1 /* Convert function calls to rtl insns, for GNU C compiler.
2 Copyright (C) 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998
3 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of 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
37 #if !defined FUNCTION_OK_FOR_SIBCALL
38 #define FUNCTION_OK_FOR_SIBCALL(DECL) 1
41 /* Decide whether a function's arguments should be processed
42 from first to last or from last to first.
44 They should if the stack and args grow in opposite directions, but
45 only if we have push insns. */
49 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
50 #define PUSH_ARGS_REVERSED PUSH_ARGS
55 #ifndef PUSH_ARGS_REVERSED
56 #define PUSH_ARGS_REVERSED 0
59 #ifndef STACK_POINTER_OFFSET
60 #define STACK_POINTER_OFFSET 0
63 /* Like PREFERRED_STACK_BOUNDARY but in units of bytes, not bits. */
64 #define STACK_BYTES (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)
66 /* Data structure and subroutines used within expand_call. */
70 /* Tree node for this argument. */
72 /* Mode for value; TYPE_MODE unless promoted. */
73 enum machine_mode mode;
74 /* Current RTL value for argument, or 0 if it isn't precomputed. */
76 /* Initially-compute RTL value for argument; only for const functions. */
78 /* Register to pass this argument in, 0 if passed on stack, or an
79 PARALLEL if the arg is to be copied into multiple non-contiguous
82 /* Register to pass this argument in when generating tail call sequence.
83 This is not the same register as for normal calls on machines with
86 /* If REG was promoted from the actual mode of the argument expression,
87 indicates whether the promotion is sign- or zero-extended. */
89 /* Number of registers to use. 0 means put the whole arg in registers.
90 Also 0 if not passed in registers. */
92 /* Non-zero if argument must be passed on stack.
93 Note that some arguments may be passed on the stack
94 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
95 pass_on_stack identifies arguments that *cannot* go in registers. */
97 /* Offset of this argument from beginning of stack-args. */
98 struct args_size offset;
99 /* Similar, but offset to the start of the stack slot. Different from
100 OFFSET if this arg pads downward. */
101 struct args_size slot_offset;
102 /* Size of this argument on the stack, rounded up for any padding it gets,
103 parts of the argument passed in registers do not count.
104 If REG_PARM_STACK_SPACE is defined, then register parms
105 are counted here as well. */
106 struct args_size size;
107 /* Location on the stack at which parameter should be stored. The store
108 has already been done if STACK == VALUE. */
110 /* Location on the stack of the start of this argument slot. This can
111 differ from STACK if this arg pads downward. This location is known
112 to be aligned to FUNCTION_ARG_BOUNDARY. */
114 /* Place that this stack area has been saved, if needed. */
116 /* If an argument's alignment does not permit direct copying into registers,
117 copy in smaller-sized pieces into pseudos. These are stored in a
118 block pointed to by this field. The next field says how many
119 word-sized pseudos we made. */
122 /* The amount that the stack pointer needs to be adjusted to
123 force alignment for the next argument. */
124 struct args_size alignment_pad;
127 /* A vector of one char per byte of stack space. A byte if non-zero if
128 the corresponding stack location has been used.
129 This vector is used to prevent a function call within an argument from
130 clobbering any stack already set up. */
131 static char *stack_usage_map;
133 /* Size of STACK_USAGE_MAP. */
134 static int highest_outgoing_arg_in_use;
136 /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
137 stack location's tail call argument has been already stored into the stack.
138 This bitmap is used to prevent sibling call optimization if function tries
139 to use parent's incoming argument slots when they have been already
140 overwritten with tail call arguments. */
141 static sbitmap stored_args_map;
143 /* stack_arg_under_construction is nonzero when an argument may be
144 initialized with a constructor call (including a C function that
145 returns a BLKmode struct) and expand_call must take special action
146 to make sure the object being constructed does not overlap the
147 argument list for the constructor call. */
148 int stack_arg_under_construction;
150 static int calls_function PARAMS ((tree, int));
151 static int calls_function_1 PARAMS ((tree, int));
153 /* Nonzero if this is a call to a `const' function. */
155 /* Nonzero if this is a call to a `volatile' function. */
156 #define ECF_NORETURN 2
157 /* Nonzero if this is a call to malloc or a related function. */
159 /* Nonzero if it is plausible that this is a call to alloca. */
160 #define ECF_MAY_BE_ALLOCA 8
161 /* Nonzero if this is a call to a function that won't throw an exception. */
162 #define ECF_NOTHROW 16
163 /* Nonzero if this is a call to setjmp or a related function. */
164 #define ECF_RETURNS_TWICE 32
165 /* Nonzero if this is a call to `longjmp'. */
166 #define ECF_LONGJMP 64
167 /* Nonzero if this is a syscall that makes a new process in the image of
169 #define ECF_FORK_OR_EXEC 128
170 #define ECF_SIBCALL 256
171 /* Nonzero if this is a call to "pure" function (like const function,
172 but may read memory. */
174 /* Nonzero if this is a call to a function that returns with the stack
175 pointer depressed. */
176 #define ECF_SP_DEPRESSED 1024
177 /* Nonzero if this call is known to always return. */
178 #define ECF_ALWAYS_RETURN 2048
180 static void emit_call_1 PARAMS ((rtx, tree, tree, HOST_WIDE_INT,
181 HOST_WIDE_INT, HOST_WIDE_INT, rtx,
182 rtx, int, rtx, int));
183 static void precompute_register_parameters PARAMS ((int,
186 static int store_one_arg PARAMS ((struct arg_data *, rtx, int, int,
188 static void store_unaligned_arguments_into_pseudos PARAMS ((struct arg_data *,
190 static int finalize_must_preallocate PARAMS ((int, int,
192 struct args_size *));
193 static void precompute_arguments PARAMS ((int, int,
195 static int compute_argument_block_size PARAMS ((int,
198 static void initialize_argument_information PARAMS ((int,
205 static void compute_argument_addresses PARAMS ((struct arg_data *,
207 static rtx rtx_for_function_call PARAMS ((tree, tree));
208 static void load_register_parameters PARAMS ((struct arg_data *,
210 static rtx emit_library_call_value_1 PARAMS ((int, rtx, rtx,
214 static int special_function_p PARAMS ((tree, int));
215 static int flags_from_decl_or_type PARAMS ((tree));
216 static rtx try_to_integrate PARAMS ((tree, tree, rtx,
218 static int check_sibcall_argument_overlap_1 PARAMS ((rtx));
219 static int check_sibcall_argument_overlap PARAMS ((rtx, struct arg_data *));
221 static int combine_pending_stack_adjustment_and_call
222 PARAMS ((int, struct args_size *, int));
224 #ifdef REG_PARM_STACK_SPACE
225 static rtx save_fixed_argument_area PARAMS ((int, rtx, int *, int *));
226 static void restore_fixed_argument_area PARAMS ((rtx, rtx, int, int));
229 /* If WHICH is 1, return 1 if EXP contains a call to the built-in function
232 If WHICH is 0, return 1 if EXP contains a call to any function.
233 Actually, we only need return 1 if evaluating EXP would require pushing
234 arguments on the stack, but that is too difficult to compute, so we just
235 assume any function call might require the stack. */
237 static tree calls_function_save_exprs;
240 calls_function (exp, which)
246 calls_function_save_exprs = 0;
247 val = calls_function_1 (exp, which);
248 calls_function_save_exprs = 0;
252 /* Recursive function to do the work of above function. */
255 calls_function_1 (exp, which)
260 enum tree_code code = TREE_CODE (exp);
261 int class = TREE_CODE_CLASS (code);
262 int length = first_rtl_op (code);
264 /* If this code is language-specific, we don't know what it will do. */
265 if ((int) code >= NUM_TREE_CODES)
273 else if ((TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
275 && (TYPE_RETURNS_STACK_DEPRESSED
276 (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))))
278 else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
279 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
281 && (special_function_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
283 & ECF_MAY_BE_ALLOCA))
292 for (tem = CONSTRUCTOR_ELTS (exp); tem != 0; tem = TREE_CHAIN (tem))
293 if (calls_function_1 (TREE_VALUE (tem), which))
300 if (SAVE_EXPR_RTL (exp) != 0)
302 if (value_member (exp, calls_function_save_exprs))
304 calls_function_save_exprs = tree_cons (NULL_TREE, exp,
305 calls_function_save_exprs);
306 return (TREE_OPERAND (exp, 0) != 0
307 && calls_function_1 (TREE_OPERAND (exp, 0), which));
314 for (local = BLOCK_VARS (exp); local; local = TREE_CHAIN (local))
315 if (DECL_INITIAL (local) != 0
316 && calls_function_1 (DECL_INITIAL (local), which))
319 for (subblock = BLOCK_SUBBLOCKS (exp);
321 subblock = TREE_CHAIN (subblock))
322 if (calls_function_1 (subblock, which))
328 for (; exp != 0; exp = TREE_CHAIN (exp))
329 if (calls_function_1 (TREE_VALUE (exp), which))
337 /* Only expressions, references, and blocks can contain calls. */
338 if (! IS_EXPR_CODE_CLASS (class) && class != 'r' && class != 'b')
341 for (i = 0; i < length; i++)
342 if (TREE_OPERAND (exp, i) != 0
343 && calls_function_1 (TREE_OPERAND (exp, i), which))
349 /* Force FUNEXP into a form suitable for the address of a CALL,
350 and return that as an rtx. Also load the static chain register
351 if FNDECL is a nested function.
353 CALL_FUSAGE points to a variable holding the prospective
354 CALL_INSN_FUNCTION_USAGE information. */
357 prepare_call_address (funexp, fndecl, call_fusage, reg_parm_seen, sibcallp)
364 rtx static_chain_value = 0;
366 funexp = protect_from_queue (funexp, 0);
369 /* Get possible static chain value for nested function in C. */
370 static_chain_value = lookup_static_chain (fndecl);
372 /* Make a valid memory address and copy constants thru pseudo-regs,
373 but not for a constant address if -fno-function-cse. */
374 if (GET_CODE (funexp) != SYMBOL_REF)
375 /* If we are using registers for parameters, force the
376 function address into a register now. */
377 funexp = ((SMALL_REGISTER_CLASSES && reg_parm_seen)
378 ? force_not_mem (memory_address (FUNCTION_MODE, funexp))
379 : memory_address (FUNCTION_MODE, funexp));
382 #ifndef NO_FUNCTION_CSE
383 if (optimize && ! flag_no_function_cse)
384 #ifdef NO_RECURSIVE_FUNCTION_CSE
385 if (fndecl != current_function_decl)
387 funexp = force_reg (Pmode, funexp);
391 if (static_chain_value != 0)
393 emit_move_insn (static_chain_rtx, static_chain_value);
395 if (GET_CODE (static_chain_rtx) == REG)
396 use_reg (call_fusage, static_chain_rtx);
402 /* Generate instructions to call function FUNEXP,
403 and optionally pop the results.
404 The CALL_INSN is the first insn generated.
406 FNDECL is the declaration node of the function. This is given to the
407 macro RETURN_POPS_ARGS to determine whether this function pops its own args.
409 FUNTYPE is the data type of the function. This is given to the macro
410 RETURN_POPS_ARGS to determine whether this function pops its own args.
411 We used to allow an identifier for library functions, but that doesn't
412 work when the return type is an aggregate type and the calling convention
413 says that the pointer to this aggregate is to be popped by the callee.
415 STACK_SIZE is the number of bytes of arguments on the stack,
416 ROUNDED_STACK_SIZE is that number rounded up to
417 PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
418 both to put into the call insn and to generate explicit popping
421 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
422 It is zero if this call doesn't want a structure value.
424 NEXT_ARG_REG is the rtx that results from executing
425 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1)
426 just after all the args have had their registers assigned.
427 This could be whatever you like, but normally it is the first
428 arg-register beyond those used for args in this call,
429 or 0 if all the arg-registers are used in this call.
430 It is passed on to `gen_call' so you can put this info in the call insn.
432 VALREG is a hard register in which a value is returned,
433 or 0 if the call does not return a value.
435 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
436 the args to this call were processed.
437 We restore `inhibit_defer_pop' to that value.
439 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
440 denote registers used by the called function. */
443 emit_call_1 (funexp, fndecl, funtype, stack_size, rounded_stack_size,
444 struct_value_size, next_arg_reg, valreg, old_inhibit_defer_pop,
445 call_fusage, ecf_flags)
447 tree fndecl ATTRIBUTE_UNUSED;
448 tree funtype ATTRIBUTE_UNUSED;
449 HOST_WIDE_INT stack_size ATTRIBUTE_UNUSED;
450 HOST_WIDE_INT rounded_stack_size;
451 HOST_WIDE_INT struct_value_size ATTRIBUTE_UNUSED;
452 rtx next_arg_reg ATTRIBUTE_UNUSED;
454 int old_inhibit_defer_pop;
458 rtx rounded_stack_size_rtx = GEN_INT (rounded_stack_size);
460 int already_popped = 0;
461 HOST_WIDE_INT n_popped = RETURN_POPS_ARGS (fndecl, funtype, stack_size);
462 #if defined (HAVE_call) && defined (HAVE_call_value)
463 rtx struct_value_size_rtx;
464 struct_value_size_rtx = GEN_INT (struct_value_size);
467 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
468 and we don't want to load it into a register as an optimization,
469 because prepare_call_address already did it if it should be done. */
470 if (GET_CODE (funexp) != SYMBOL_REF)
471 funexp = memory_address (FUNCTION_MODE, funexp);
473 #if defined (HAVE_sibcall_pop) && defined (HAVE_sibcall_value_pop)
474 if ((ecf_flags & ECF_SIBCALL)
475 && HAVE_sibcall_pop && HAVE_sibcall_value_pop
476 && (n_popped > 0 || stack_size == 0))
478 rtx n_pop = GEN_INT (n_popped);
481 /* If this subroutine pops its own args, record that in the call insn
482 if possible, for the sake of frame pointer elimination. */
485 pat = GEN_SIBCALL_VALUE_POP (valreg,
486 gen_rtx_MEM (FUNCTION_MODE, funexp),
487 rounded_stack_size_rtx, next_arg_reg,
490 pat = GEN_SIBCALL_POP (gen_rtx_MEM (FUNCTION_MODE, funexp),
491 rounded_stack_size_rtx, next_arg_reg, n_pop);
493 emit_call_insn (pat);
499 #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop)
500 /* If the target has "call" or "call_value" insns, then prefer them
501 if no arguments are actually popped. If the target does not have
502 "call" or "call_value" insns, then we must use the popping versions
503 even if the call has no arguments to pop. */
504 #if defined (HAVE_call) && defined (HAVE_call_value)
505 if (HAVE_call && HAVE_call_value && HAVE_call_pop && HAVE_call_value_pop
506 && n_popped > 0 && ! (ecf_flags & ECF_SP_DEPRESSED))
508 if (HAVE_call_pop && HAVE_call_value_pop)
511 rtx n_pop = GEN_INT (n_popped);
514 /* If this subroutine pops its own args, record that in the call insn
515 if possible, for the sake of frame pointer elimination. */
518 pat = GEN_CALL_VALUE_POP (valreg,
519 gen_rtx_MEM (FUNCTION_MODE, funexp),
520 rounded_stack_size_rtx, next_arg_reg, n_pop);
522 pat = GEN_CALL_POP (gen_rtx_MEM (FUNCTION_MODE, funexp),
523 rounded_stack_size_rtx, next_arg_reg, n_pop);
525 emit_call_insn (pat);
531 #if defined (HAVE_sibcall) && defined (HAVE_sibcall_value)
532 if ((ecf_flags & ECF_SIBCALL)
533 && HAVE_sibcall && HAVE_sibcall_value)
536 emit_call_insn (GEN_SIBCALL_VALUE (valreg,
537 gen_rtx_MEM (FUNCTION_MODE, funexp),
538 rounded_stack_size_rtx,
539 next_arg_reg, NULL_RTX));
541 emit_call_insn (GEN_SIBCALL (gen_rtx_MEM (FUNCTION_MODE, funexp),
542 rounded_stack_size_rtx, next_arg_reg,
543 struct_value_size_rtx));
548 #if defined (HAVE_call) && defined (HAVE_call_value)
549 if (HAVE_call && HAVE_call_value)
552 emit_call_insn (GEN_CALL_VALUE (valreg,
553 gen_rtx_MEM (FUNCTION_MODE, funexp),
554 rounded_stack_size_rtx, next_arg_reg,
557 emit_call_insn (GEN_CALL (gen_rtx_MEM (FUNCTION_MODE, funexp),
558 rounded_stack_size_rtx, next_arg_reg,
559 struct_value_size_rtx));
565 /* Find the CALL insn we just emitted. */
566 for (call_insn = get_last_insn ();
567 call_insn && GET_CODE (call_insn) != CALL_INSN;
568 call_insn = PREV_INSN (call_insn))
574 /* Mark memory as used for "pure" function call. */
575 if (ecf_flags & ECF_PURE)
579 gen_rtx_USE (VOIDmode,
580 gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode))),
583 /* Put the register usage information on the CALL. If there is already
584 some usage information, put ours at the end. */
585 if (CALL_INSN_FUNCTION_USAGE (call_insn))
589 for (link = CALL_INSN_FUNCTION_USAGE (call_insn); XEXP (link, 1) != 0;
590 link = XEXP (link, 1))
593 XEXP (link, 1) = call_fusage;
596 CALL_INSN_FUNCTION_USAGE (call_insn) = call_fusage;
598 /* If this is a const call, then set the insn's unchanging bit. */
599 if (ecf_flags & (ECF_CONST | ECF_PURE))
600 CONST_OR_PURE_CALL_P (call_insn) = 1;
602 /* If this call can't throw, attach a REG_EH_REGION reg note to that
604 if (ecf_flags & ECF_NOTHROW)
605 REG_NOTES (call_insn) = gen_rtx_EXPR_LIST (REG_EH_REGION, const0_rtx,
606 REG_NOTES (call_insn));
608 if (ecf_flags & ECF_NORETURN)
609 REG_NOTES (call_insn) = gen_rtx_EXPR_LIST (REG_NORETURN, const0_rtx,
610 REG_NOTES (call_insn));
611 if (ecf_flags & ECF_ALWAYS_RETURN)
612 REG_NOTES (call_insn) = gen_rtx_EXPR_LIST (REG_ALWAYS_RETURN, const0_rtx,
613 REG_NOTES (call_insn));
615 if (ecf_flags & ECF_RETURNS_TWICE)
617 REG_NOTES (call_insn) = gen_rtx_EXPR_LIST (REG_SETJMP, const0_rtx,
618 REG_NOTES (call_insn));
619 current_function_calls_setjmp = 1;
622 SIBLING_CALL_P (call_insn) = ((ecf_flags & ECF_SIBCALL) != 0);
624 /* Restore this now, so that we do defer pops for this call's args
625 if the context of the call as a whole permits. */
626 inhibit_defer_pop = old_inhibit_defer_pop;
631 CALL_INSN_FUNCTION_USAGE (call_insn)
632 = gen_rtx_EXPR_LIST (VOIDmode,
633 gen_rtx_CLOBBER (VOIDmode, stack_pointer_rtx),
634 CALL_INSN_FUNCTION_USAGE (call_insn));
635 rounded_stack_size -= n_popped;
636 rounded_stack_size_rtx = GEN_INT (rounded_stack_size);
637 stack_pointer_delta -= n_popped;
640 if (!ACCUMULATE_OUTGOING_ARGS)
642 /* If returning from the subroutine does not automatically pop the args,
643 we need an instruction to pop them sooner or later.
644 Perhaps do it now; perhaps just record how much space to pop later.
646 If returning from the subroutine does pop the args, indicate that the
647 stack pointer will be changed. */
649 if (rounded_stack_size != 0 && ! (ecf_flags & ECF_SP_DEPRESSED))
651 if (flag_defer_pop && inhibit_defer_pop == 0
652 && ! (ecf_flags & (ECF_CONST | ECF_PURE)))
653 pending_stack_adjust += rounded_stack_size;
655 adjust_stack (rounded_stack_size_rtx);
658 /* When we accumulate outgoing args, we must avoid any stack manipulations.
659 Restore the stack pointer to its original value now. Usually
660 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
661 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
662 popping variants of functions exist as well.
664 ??? We may optimize similar to defer_pop above, but it is
665 probably not worthwhile.
667 ??? It will be worthwhile to enable combine_stack_adjustments even for
670 anti_adjust_stack (GEN_INT (n_popped));
673 /* Determine if the function identified by NAME and FNDECL is one with
674 special properties we wish to know about.
676 For example, if the function might return more than one time (setjmp), then
677 set RETURNS_TWICE to a nonzero value.
679 Similarly set LONGJMP for if the function is in the longjmp family.
681 Set MALLOC for any of the standard memory allocation functions which
682 allocate from the heap.
684 Set MAY_BE_ALLOCA for any memory allocation function that might allocate
685 space from the stack such as alloca. */
688 special_function_p (fndecl, flags)
692 if (! (flags & ECF_MALLOC)
693 && fndecl && DECL_NAME (fndecl)
694 && IDENTIFIER_LENGTH (DECL_NAME (fndecl)) <= 17
695 /* Exclude functions not at the file scope, or not `extern',
696 since they are not the magic functions we would otherwise
698 && DECL_CONTEXT (fndecl) == NULL_TREE && TREE_PUBLIC (fndecl))
700 const char *name = IDENTIFIER_POINTER (DECL_NAME (fndecl));
701 const char *tname = name;
703 /* We assume that alloca will always be called by name. It
704 makes no sense to pass it as a pointer-to-function to
705 anything that does not understand its behavior. */
706 if (((IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 6
708 && ! strcmp (name, "alloca"))
709 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 16
711 && ! strcmp (name, "__builtin_alloca"))))
712 flags |= ECF_MAY_BE_ALLOCA;
714 /* Disregard prefix _, __ or __x. */
717 if (name[1] == '_' && name[2] == 'x')
719 else if (name[1] == '_')
728 && (! strcmp (tname, "setjmp")
729 || ! strcmp (tname, "setjmp_syscall")))
731 && ! strcmp (tname, "sigsetjmp"))
733 && ! strcmp (tname, "savectx")))
734 flags |= ECF_RETURNS_TWICE;
737 && ! strcmp (tname, "siglongjmp"))
738 flags |= ECF_LONGJMP;
740 else if ((tname[0] == 'q' && tname[1] == 's'
741 && ! strcmp (tname, "qsetjmp"))
742 || (tname[0] == 'v' && tname[1] == 'f'
743 && ! strcmp (tname, "vfork")))
744 flags |= ECF_RETURNS_TWICE;
746 else if (tname[0] == 'l' && tname[1] == 'o'
747 && ! strcmp (tname, "longjmp"))
748 flags |= ECF_LONGJMP;
750 else if ((tname[0] == 'f' && tname[1] == 'o'
751 && ! strcmp (tname, "fork"))
752 /* Linux specific: __clone. check NAME to insist on the
753 leading underscores, to avoid polluting the ISO / POSIX
755 || (name[0] == '_' && name[1] == '_'
756 && ! strcmp (tname, "clone"))
757 || (tname[0] == 'e' && tname[1] == 'x' && tname[2] == 'e'
758 && tname[3] == 'c' && (tname[4] == 'l' || tname[4] == 'v')
760 || ((tname[5] == 'p' || tname[5] == 'e')
761 && tname[6] == '\0'))))
762 flags |= ECF_FORK_OR_EXEC;
764 /* Do not add any more malloc-like functions to this list,
765 instead mark them as malloc functions using the malloc attribute.
766 Note, realloc is not suitable for attribute malloc since
767 it may return the same address across multiple calls.
768 C++ operator new is not suitable because it is not required
769 to return a unique pointer; indeed, the standard placement new
770 just returns its argument. */
771 else if (TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl))) == Pmode
772 && (! strcmp (tname, "malloc")
773 || ! strcmp (tname, "calloc")
774 || ! strcmp (tname, "strdup")))
780 /* Return nonzero when tree represent call to longjmp. */
783 setjmp_call_p (fndecl)
786 return special_function_p (fndecl, 0) & ECF_RETURNS_TWICE;
789 /* Detect flags (function attributes) from the function type node. */
792 flags_from_decl_or_type (exp)
797 /* ??? We can't set IS_MALLOC for function types? */
800 /* The function exp may have the `malloc' attribute. */
801 if (DECL_P (exp) && DECL_IS_MALLOC (exp))
804 /* The function exp may have the `pure' attribute. */
805 if (DECL_P (exp) && DECL_IS_PURE (exp))
808 if (TREE_NOTHROW (exp))
809 flags |= ECF_NOTHROW;
812 if (TREE_READONLY (exp) && ! TREE_THIS_VOLATILE (exp))
815 if (TREE_THIS_VOLATILE (exp))
816 flags |= ECF_NORETURN;
821 /* Precompute all register parameters as described by ARGS, storing values
822 into fields within the ARGS array.
824 NUM_ACTUALS indicates the total number elements in the ARGS array.
826 Set REG_PARM_SEEN if we encounter a register parameter. */
829 precompute_register_parameters (num_actuals, args, reg_parm_seen)
831 struct arg_data *args;
838 for (i = 0; i < num_actuals; i++)
839 if (args[i].reg != 0 && ! args[i].pass_on_stack)
843 if (args[i].value == 0)
846 args[i].value = expand_expr (args[i].tree_value, NULL_RTX,
848 preserve_temp_slots (args[i].value);
851 /* ANSI doesn't require a sequence point here,
852 but PCC has one, so this will avoid some problems. */
856 /* If we are to promote the function arg to a wider mode,
859 if (args[i].mode != TYPE_MODE (TREE_TYPE (args[i].tree_value)))
861 = convert_modes (args[i].mode,
862 TYPE_MODE (TREE_TYPE (args[i].tree_value)),
863 args[i].value, args[i].unsignedp);
865 /* If the value is expensive, and we are inside an appropriately
866 short loop, put the value into a pseudo and then put the pseudo
869 For small register classes, also do this if this call uses
870 register parameters. This is to avoid reload conflicts while
871 loading the parameters registers. */
873 if ((! (GET_CODE (args[i].value) == REG
874 || (GET_CODE (args[i].value) == SUBREG
875 && GET_CODE (SUBREG_REG (args[i].value)) == REG)))
876 && args[i].mode != BLKmode
877 && rtx_cost (args[i].value, SET) > COSTS_N_INSNS (1)
878 && ((SMALL_REGISTER_CLASSES && *reg_parm_seen)
879 || preserve_subexpressions_p ()))
880 args[i].value = copy_to_mode_reg (args[i].mode, args[i].value);
884 #ifdef REG_PARM_STACK_SPACE
886 /* The argument list is the property of the called routine and it
887 may clobber it. If the fixed area has been used for previous
888 parameters, we must save and restore it. */
891 save_fixed_argument_area (reg_parm_stack_space, argblock,
892 low_to_save, high_to_save)
893 int reg_parm_stack_space;
899 rtx save_area = NULL_RTX;
901 /* Compute the boundary of the that needs to be saved, if any. */
902 #ifdef ARGS_GROW_DOWNWARD
903 for (i = 0; i < reg_parm_stack_space + 1; i++)
905 for (i = 0; i < reg_parm_stack_space; i++)
908 if (i >= highest_outgoing_arg_in_use
909 || stack_usage_map[i] == 0)
912 if (*low_to_save == -1)
918 if (*low_to_save >= 0)
920 int num_to_save = *high_to_save - *low_to_save + 1;
921 enum machine_mode save_mode
922 = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1);
925 /* If we don't have the required alignment, must do this in BLKmode. */
926 if ((*low_to_save & (MIN (GET_MODE_SIZE (save_mode),
927 BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1)))
930 #ifdef ARGS_GROW_DOWNWARD
932 = gen_rtx_MEM (save_mode,
933 memory_address (save_mode,
934 plus_constant (argblock,
937 stack_area = gen_rtx_MEM (save_mode,
938 memory_address (save_mode,
939 plus_constant (argblock,
943 set_mem_align (stack_area, PARM_BOUNDARY);
944 if (save_mode == BLKmode)
946 save_area = assign_stack_temp (BLKmode, num_to_save, 0);
947 /* Cannot use emit_block_move here because it can be done by a
948 library call which in turn gets into this place again and deadly
949 infinite recursion happens. */
950 move_by_pieces (validize_mem (save_area), stack_area, num_to_save,
955 save_area = gen_reg_rtx (save_mode);
956 emit_move_insn (save_area, stack_area);
964 restore_fixed_argument_area (save_area, argblock, high_to_save, low_to_save)
970 enum machine_mode save_mode = GET_MODE (save_area);
971 #ifdef ARGS_GROW_DOWNWARD
973 = gen_rtx_MEM (save_mode,
974 memory_address (save_mode,
975 plus_constant (argblock,
979 = gen_rtx_MEM (save_mode,
980 memory_address (save_mode,
981 plus_constant (argblock,
985 if (save_mode != BLKmode)
986 emit_move_insn (stack_area, save_area);
988 /* Cannot use emit_block_move here because it can be done by a library
989 call which in turn gets into this place again and deadly infinite
990 recursion happens. */
991 move_by_pieces (stack_area, validize_mem (save_area),
992 high_to_save - low_to_save + 1, PARM_BOUNDARY);
994 #endif /* REG_PARM_STACK_SPACE */
996 /* If any elements in ARGS refer to parameters that are to be passed in
997 registers, but not in memory, and whose alignment does not permit a
998 direct copy into registers. Copy the values into a group of pseudos
999 which we will later copy into the appropriate hard registers.
1001 Pseudos for each unaligned argument will be stored into the array
1002 args[argnum].aligned_regs. The caller is responsible for deallocating
1003 the aligned_regs array if it is nonzero. */
1006 store_unaligned_arguments_into_pseudos (args, num_actuals)
1007 struct arg_data *args;
1012 for (i = 0; i < num_actuals; i++)
1013 if (args[i].reg != 0 && ! args[i].pass_on_stack
1014 && args[i].mode == BLKmode
1015 && (TYPE_ALIGN (TREE_TYPE (args[i].tree_value))
1016 < (unsigned int) MIN (BIGGEST_ALIGNMENT, BITS_PER_WORD)))
1018 int bytes = int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1019 int big_endian_correction = 0;
1021 args[i].n_aligned_regs
1022 = args[i].partial ? args[i].partial
1023 : (bytes + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
1025 args[i].aligned_regs = (rtx *) xmalloc (sizeof (rtx)
1026 * args[i].n_aligned_regs);
1028 /* Structures smaller than a word are aligned to the least
1029 significant byte (to the right). On a BYTES_BIG_ENDIAN machine,
1030 this means we must skip the empty high order bytes when
1031 calculating the bit offset. */
1032 if (BYTES_BIG_ENDIAN && bytes < UNITS_PER_WORD)
1033 big_endian_correction = (BITS_PER_WORD - (bytes * BITS_PER_UNIT));
1035 for (j = 0; j < args[i].n_aligned_regs; j++)
1037 rtx reg = gen_reg_rtx (word_mode);
1038 rtx word = operand_subword_force (args[i].value, j, BLKmode);
1039 int bitsize = MIN (bytes * BITS_PER_UNIT, BITS_PER_WORD);
1041 args[i].aligned_regs[j] = reg;
1043 /* There is no need to restrict this code to loading items
1044 in TYPE_ALIGN sized hunks. The bitfield instructions can
1045 load up entire word sized registers efficiently.
1047 ??? This may not be needed anymore.
1048 We use to emit a clobber here but that doesn't let later
1049 passes optimize the instructions we emit. By storing 0 into
1050 the register later passes know the first AND to zero out the
1051 bitfield being set in the register is unnecessary. The store
1052 of 0 will be deleted as will at least the first AND. */
1054 emit_move_insn (reg, const0_rtx);
1056 bytes -= bitsize / BITS_PER_UNIT;
1057 store_bit_field (reg, bitsize, big_endian_correction, word_mode,
1058 extract_bit_field (word, bitsize, 0, 1, NULL_RTX,
1059 word_mode, word_mode,
1066 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1069 NUM_ACTUALS is the total number of parameters.
1071 N_NAMED_ARGS is the total number of named arguments.
1073 FNDECL is the tree code for the target of this call (if known)
1075 ARGS_SO_FAR holds state needed by the target to know where to place
1078 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1079 for arguments which are passed in registers.
1081 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1082 and may be modified by this routine.
1084 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1085 flags which may may be modified by this routine. */
1088 initialize_argument_information (num_actuals, args, args_size, n_named_args,
1089 actparms, fndecl, args_so_far,
1090 reg_parm_stack_space, old_stack_level,
1091 old_pending_adj, must_preallocate,
1093 int num_actuals ATTRIBUTE_UNUSED;
1094 struct arg_data *args;
1095 struct args_size *args_size;
1096 int n_named_args ATTRIBUTE_UNUSED;
1099 CUMULATIVE_ARGS *args_so_far;
1100 int reg_parm_stack_space;
1101 rtx *old_stack_level;
1102 int *old_pending_adj;
1103 int *must_preallocate;
1106 /* 1 if scanning parms front to back, -1 if scanning back to front. */
1109 /* Count arg position in order args appear. */
1112 struct args_size alignment_pad;
1116 args_size->constant = 0;
1119 /* In this loop, we consider args in the order they are written.
1120 We fill up ARGS from the front or from the back if necessary
1121 so that in any case the first arg to be pushed ends up at the front. */
1123 if (PUSH_ARGS_REVERSED)
1125 i = num_actuals - 1, inc = -1;
1126 /* In this case, must reverse order of args
1127 so that we compute and push the last arg first. */
1134 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1135 for (p = actparms, argpos = 0; p; p = TREE_CHAIN (p), i += inc, argpos++)
1137 tree type = TREE_TYPE (TREE_VALUE (p));
1139 enum machine_mode mode;
1141 args[i].tree_value = TREE_VALUE (p);
1143 /* Replace erroneous argument with constant zero. */
1144 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
1145 args[i].tree_value = integer_zero_node, type = integer_type_node;
1147 /* If TYPE is a transparent union, pass things the way we would
1148 pass the first field of the union. We have already verified that
1149 the modes are the same. */
1150 if (TREE_CODE (type) == UNION_TYPE && TYPE_TRANSPARENT_UNION (type))
1151 type = TREE_TYPE (TYPE_FIELDS (type));
1153 /* Decide where to pass this arg.
1155 args[i].reg is nonzero if all or part is passed in registers.
1157 args[i].partial is nonzero if part but not all is passed in registers,
1158 and the exact value says how many words are passed in registers.
1160 args[i].pass_on_stack is nonzero if the argument must at least be
1161 computed on the stack. It may then be loaded back into registers
1162 if args[i].reg is nonzero.
1164 These decisions are driven by the FUNCTION_... macros and must agree
1165 with those made by function.c. */
1167 /* See if this argument should be passed by invisible reference. */
1168 if ((TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST
1169 && contains_placeholder_p (TYPE_SIZE (type)))
1170 || TREE_ADDRESSABLE (type)
1171 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
1172 || FUNCTION_ARG_PASS_BY_REFERENCE (*args_so_far, TYPE_MODE (type),
1173 type, argpos < n_named_args)
1177 /* If we're compiling a thunk, pass through invisible
1178 references instead of making a copy. */
1179 if (current_function_is_thunk
1180 #ifdef FUNCTION_ARG_CALLEE_COPIES
1181 || (FUNCTION_ARG_CALLEE_COPIES (*args_so_far, TYPE_MODE (type),
1182 type, argpos < n_named_args)
1183 /* If it's in a register, we must make a copy of it too. */
1184 /* ??? Is this a sufficient test? Is there a better one? */
1185 && !(TREE_CODE (args[i].tree_value) == VAR_DECL
1186 && REG_P (DECL_RTL (args[i].tree_value)))
1187 && ! TREE_ADDRESSABLE (type))
1191 /* C++ uses a TARGET_EXPR to indicate that we want to make a
1192 new object from the argument. If we are passing by
1193 invisible reference, the callee will do that for us, so we
1194 can strip off the TARGET_EXPR. This is not always safe,
1195 but it is safe in the only case where this is a useful
1196 optimization; namely, when the argument is a plain object.
1197 In that case, the frontend is just asking the backend to
1198 make a bitwise copy of the argument. */
1200 if (TREE_CODE (args[i].tree_value) == TARGET_EXPR
1201 && (DECL_P (TREE_OPERAND (args[i].tree_value, 1)))
1202 && ! REG_P (DECL_RTL (TREE_OPERAND (args[i].tree_value, 1))))
1203 args[i].tree_value = TREE_OPERAND (args[i].tree_value, 1);
1205 args[i].tree_value = build1 (ADDR_EXPR,
1206 build_pointer_type (type),
1207 args[i].tree_value);
1208 type = build_pointer_type (type);
1212 /* We make a copy of the object and pass the address to the
1213 function being called. */
1216 if (!COMPLETE_TYPE_P (type)
1217 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST
1218 || (flag_stack_check && ! STACK_CHECK_BUILTIN
1219 && (0 < compare_tree_int (TYPE_SIZE_UNIT (type),
1220 STACK_CHECK_MAX_VAR_SIZE))))
1222 /* This is a variable-sized object. Make space on the stack
1224 rtx size_rtx = expr_size (TREE_VALUE (p));
1226 if (*old_stack_level == 0)
1228 emit_stack_save (SAVE_BLOCK, old_stack_level, NULL_RTX);
1229 *old_pending_adj = pending_stack_adjust;
1230 pending_stack_adjust = 0;
1233 copy = gen_rtx_MEM (BLKmode,
1234 allocate_dynamic_stack_space
1235 (size_rtx, NULL_RTX, TYPE_ALIGN (type)));
1236 set_mem_attributes (copy, type, 1);
1239 copy = assign_temp (type, 0, 1, 0);
1241 store_expr (args[i].tree_value, copy, 0);
1242 *ecf_flags &= ~(ECF_CONST | ECF_PURE);
1244 args[i].tree_value = build1 (ADDR_EXPR,
1245 build_pointer_type (type),
1246 make_tree (type, copy));
1247 type = build_pointer_type (type);
1251 mode = TYPE_MODE (type);
1252 unsignedp = TREE_UNSIGNED (type);
1254 #ifdef PROMOTE_FUNCTION_ARGS
1255 mode = promote_mode (type, mode, &unsignedp, 1);
1258 args[i].unsignedp = unsignedp;
1259 args[i].mode = mode;
1261 args[i].reg = FUNCTION_ARG (*args_so_far, mode, type,
1262 argpos < n_named_args);
1263 #ifdef FUNCTION_INCOMING_ARG
1264 /* If this is a sibling call and the machine has register windows, the
1265 register window has to be unwinded before calling the routine, so
1266 arguments have to go into the incoming registers. */
1267 args[i].tail_call_reg = FUNCTION_INCOMING_ARG (*args_so_far, mode, type,
1268 argpos < n_named_args);
1270 args[i].tail_call_reg = args[i].reg;
1273 #ifdef FUNCTION_ARG_PARTIAL_NREGS
1276 = FUNCTION_ARG_PARTIAL_NREGS (*args_so_far, mode, type,
1277 argpos < n_named_args);
1280 args[i].pass_on_stack = MUST_PASS_IN_STACK (mode, type);
1282 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1283 it means that we are to pass this arg in the register(s) designated
1284 by the PARALLEL, but also to pass it in the stack. */
1285 if (args[i].reg && GET_CODE (args[i].reg) == PARALLEL
1286 && XEXP (XVECEXP (args[i].reg, 0, 0), 0) == 0)
1287 args[i].pass_on_stack = 1;
1289 /* If this is an addressable type, we must preallocate the stack
1290 since we must evaluate the object into its final location.
1292 If this is to be passed in both registers and the stack, it is simpler
1294 if (TREE_ADDRESSABLE (type)
1295 || (args[i].pass_on_stack && args[i].reg != 0))
1296 *must_preallocate = 1;
1298 /* If this is an addressable type, we cannot pre-evaluate it. Thus,
1299 we cannot consider this function call constant. */
1300 if (TREE_ADDRESSABLE (type))
1301 *ecf_flags &= ~(ECF_CONST | ECF_PURE);
1303 /* Compute the stack-size of this argument. */
1304 if (args[i].reg == 0 || args[i].partial != 0
1305 || reg_parm_stack_space > 0
1306 || args[i].pass_on_stack)
1307 locate_and_pad_parm (mode, type,
1308 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1313 fndecl, args_size, &args[i].offset,
1314 &args[i].size, &alignment_pad);
1316 #ifndef ARGS_GROW_DOWNWARD
1317 args[i].slot_offset = *args_size;
1320 args[i].alignment_pad = alignment_pad;
1322 /* If a part of the arg was put into registers,
1323 don't include that part in the amount pushed. */
1324 if (reg_parm_stack_space == 0 && ! args[i].pass_on_stack)
1325 args[i].size.constant -= ((args[i].partial * UNITS_PER_WORD)
1326 / (PARM_BOUNDARY / BITS_PER_UNIT)
1327 * (PARM_BOUNDARY / BITS_PER_UNIT));
1329 /* Update ARGS_SIZE, the total stack space for args so far. */
1331 args_size->constant += args[i].size.constant;
1332 if (args[i].size.var)
1334 ADD_PARM_SIZE (*args_size, args[i].size.var);
1337 /* Since the slot offset points to the bottom of the slot,
1338 we must record it after incrementing if the args grow down. */
1339 #ifdef ARGS_GROW_DOWNWARD
1340 args[i].slot_offset = *args_size;
1342 args[i].slot_offset.constant = -args_size->constant;
1344 SUB_PARM_SIZE (args[i].slot_offset, args_size->var);
1347 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1348 have been used, etc. */
1350 FUNCTION_ARG_ADVANCE (*args_so_far, TYPE_MODE (type), type,
1351 argpos < n_named_args);
1355 /* Update ARGS_SIZE to contain the total size for the argument block.
1356 Return the original constant component of the argument block's size.
1358 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1359 for arguments passed in registers. */
1362 compute_argument_block_size (reg_parm_stack_space, args_size,
1363 preferred_stack_boundary)
1364 int reg_parm_stack_space;
1365 struct args_size *args_size;
1366 int preferred_stack_boundary ATTRIBUTE_UNUSED;
1368 int unadjusted_args_size = args_size->constant;
1370 /* For accumulate outgoing args mode we don't need to align, since the frame
1371 will be already aligned. Align to STACK_BOUNDARY in order to prevent
1372 backends from generating misaligned frame sizes. */
1373 if (ACCUMULATE_OUTGOING_ARGS && preferred_stack_boundary > STACK_BOUNDARY)
1374 preferred_stack_boundary = STACK_BOUNDARY;
1376 /* Compute the actual size of the argument block required. The variable
1377 and constant sizes must be combined, the size may have to be rounded,
1378 and there may be a minimum required size. */
1382 args_size->var = ARGS_SIZE_TREE (*args_size);
1383 args_size->constant = 0;
1385 preferred_stack_boundary /= BITS_PER_UNIT;
1386 if (preferred_stack_boundary > 1)
1388 /* We don't handle this case yet. To handle it correctly we have
1389 to add the delta, round and subtract the delta.
1390 Currently no machine description requires this support. */
1391 if (stack_pointer_delta & (preferred_stack_boundary - 1))
1393 args_size->var = round_up (args_size->var, preferred_stack_boundary);
1396 if (reg_parm_stack_space > 0)
1399 = size_binop (MAX_EXPR, args_size->var,
1400 ssize_int (reg_parm_stack_space));
1402 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1403 /* The area corresponding to register parameters is not to count in
1404 the size of the block we need. So make the adjustment. */
1406 = size_binop (MINUS_EXPR, args_size->var,
1407 ssize_int (reg_parm_stack_space));
1413 preferred_stack_boundary /= BITS_PER_UNIT;
1414 if (preferred_stack_boundary < 1)
1415 preferred_stack_boundary = 1;
1416 args_size->constant = (((args_size->constant
1417 + stack_pointer_delta
1418 + preferred_stack_boundary - 1)
1419 / preferred_stack_boundary
1420 * preferred_stack_boundary)
1421 - stack_pointer_delta);
1423 args_size->constant = MAX (args_size->constant,
1424 reg_parm_stack_space);
1426 #ifdef MAYBE_REG_PARM_STACK_SPACE
1427 if (reg_parm_stack_space == 0)
1428 args_size->constant = 0;
1431 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1432 args_size->constant -= reg_parm_stack_space;
1435 return unadjusted_args_size;
1438 /* Precompute parameters as needed for a function call.
1440 FLAGS is mask of ECF_* constants.
1442 NUM_ACTUALS is the number of arguments.
1444 ARGS is an array containing information for each argument; this
1445 routine fills in the INITIAL_VALUE and VALUE fields for each
1446 precomputed argument. */
1449 precompute_arguments (flags, num_actuals, args)
1452 struct arg_data *args;
1456 /* If this function call is cse'able, precompute all the parameters.
1457 Note that if the parameter is constructed into a temporary, this will
1458 cause an additional copy because the parameter will be constructed
1459 into a temporary location and then copied into the outgoing arguments.
1460 If a parameter contains a call to alloca and this function uses the
1461 stack, precompute the parameter. */
1463 /* If we preallocated the stack space, and some arguments must be passed
1464 on the stack, then we must precompute any parameter which contains a
1465 function call which will store arguments on the stack.
1466 Otherwise, evaluating the parameter may clobber previous parameters
1467 which have already been stored into the stack. (we have code to avoid
1468 such case by saving the outgoing stack arguments, but it results in
1471 for (i = 0; i < num_actuals; i++)
1472 if ((flags & (ECF_CONST | ECF_PURE))
1473 || calls_function (args[i].tree_value, !ACCUMULATE_OUTGOING_ARGS))
1475 enum machine_mode mode;
1477 /* If this is an addressable type, we cannot pre-evaluate it. */
1478 if (TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value)))
1484 = expand_expr (args[i].tree_value, NULL_RTX, VOIDmode, 0);
1486 preserve_temp_slots (args[i].value);
1489 /* ANSI doesn't require a sequence point here,
1490 but PCC has one, so this will avoid some problems. */
1493 args[i].initial_value = args[i].value
1494 = protect_from_queue (args[i].value, 0);
1496 mode = TYPE_MODE (TREE_TYPE (args[i].tree_value));
1497 if (mode != args[i].mode)
1500 = convert_modes (args[i].mode, mode,
1501 args[i].value, args[i].unsignedp);
1502 #ifdef PROMOTE_FOR_CALL_ONLY
1503 /* CSE will replace this only if it contains args[i].value
1504 pseudo, so convert it down to the declared mode using
1506 if (GET_CODE (args[i].value) == REG
1507 && GET_MODE_CLASS (args[i].mode) == MODE_INT)
1509 args[i].initial_value
1510 = gen_lowpart_SUBREG (mode, args[i].value);
1511 SUBREG_PROMOTED_VAR_P (args[i].initial_value) = 1;
1512 SUBREG_PROMOTED_UNSIGNED_P (args[i].initial_value)
1513 = args[i].unsignedp;
1520 /* Given the current state of MUST_PREALLOCATE and information about
1521 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
1522 compute and return the final value for MUST_PREALLOCATE. */
1525 finalize_must_preallocate (must_preallocate, num_actuals, args, args_size)
1526 int must_preallocate;
1528 struct arg_data *args;
1529 struct args_size *args_size;
1531 /* See if we have or want to preallocate stack space.
1533 If we would have to push a partially-in-regs parm
1534 before other stack parms, preallocate stack space instead.
1536 If the size of some parm is not a multiple of the required stack
1537 alignment, we must preallocate.
1539 If the total size of arguments that would otherwise create a copy in
1540 a temporary (such as a CALL) is more than half the total argument list
1541 size, preallocation is faster.
1543 Another reason to preallocate is if we have a machine (like the m88k)
1544 where stack alignment is required to be maintained between every
1545 pair of insns, not just when the call is made. However, we assume here
1546 that such machines either do not have push insns (and hence preallocation
1547 would occur anyway) or the problem is taken care of with
1550 if (! must_preallocate)
1552 int partial_seen = 0;
1553 int copy_to_evaluate_size = 0;
1556 for (i = 0; i < num_actuals && ! must_preallocate; i++)
1558 if (args[i].partial > 0 && ! args[i].pass_on_stack)
1560 else if (partial_seen && args[i].reg == 0)
1561 must_preallocate = 1;
1563 if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode
1564 && (TREE_CODE (args[i].tree_value) == CALL_EXPR
1565 || TREE_CODE (args[i].tree_value) == TARGET_EXPR
1566 || TREE_CODE (args[i].tree_value) == COND_EXPR
1567 || TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value))))
1568 copy_to_evaluate_size
1569 += int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1572 if (copy_to_evaluate_size * 2 >= args_size->constant
1573 && args_size->constant > 0)
1574 must_preallocate = 1;
1576 return must_preallocate;
1579 /* If we preallocated stack space, compute the address of each argument
1580 and store it into the ARGS array.
1582 We need not ensure it is a valid memory address here; it will be
1583 validized when it is used.
1585 ARGBLOCK is an rtx for the address of the outgoing arguments. */
1588 compute_argument_addresses (args, argblock, num_actuals)
1589 struct arg_data *args;
1595 rtx arg_reg = argblock;
1596 int i, arg_offset = 0;
1598 if (GET_CODE (argblock) == PLUS)
1599 arg_reg = XEXP (argblock, 0), arg_offset = INTVAL (XEXP (argblock, 1));
1601 for (i = 0; i < num_actuals; i++)
1603 rtx offset = ARGS_SIZE_RTX (args[i].offset);
1604 rtx slot_offset = ARGS_SIZE_RTX (args[i].slot_offset);
1607 /* Skip this parm if it will not be passed on the stack. */
1608 if (! args[i].pass_on_stack && args[i].reg != 0)
1611 if (GET_CODE (offset) == CONST_INT)
1612 addr = plus_constant (arg_reg, INTVAL (offset));
1614 addr = gen_rtx_PLUS (Pmode, arg_reg, offset);
1616 addr = plus_constant (addr, arg_offset);
1617 args[i].stack = gen_rtx_MEM (args[i].mode, addr);
1618 set_mem_attributes (args[i].stack,
1619 TREE_TYPE (args[i].tree_value), 1);
1621 if (GET_CODE (slot_offset) == CONST_INT)
1622 addr = plus_constant (arg_reg, INTVAL (slot_offset));
1624 addr = gen_rtx_PLUS (Pmode, arg_reg, slot_offset);
1626 addr = plus_constant (addr, arg_offset);
1627 args[i].stack_slot = gen_rtx_MEM (args[i].mode, addr);
1628 set_mem_attributes (args[i].stack_slot,
1629 TREE_TYPE (args[i].tree_value), 1);
1631 /* Function incoming arguments may overlap with sibling call
1632 outgoing arguments and we cannot allow reordering of reads
1633 from function arguments with stores to outgoing arguments
1634 of sibling calls. */
1635 set_mem_alias_set (args[i].stack, 0);
1636 set_mem_alias_set (args[i].stack_slot, 0);
1641 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
1642 in a call instruction.
1644 FNDECL is the tree node for the target function. For an indirect call
1645 FNDECL will be NULL_TREE.
1647 EXP is the CALL_EXPR for this call. */
1650 rtx_for_function_call (fndecl, exp)
1656 /* Get the function to call, in the form of RTL. */
1659 /* If this is the first use of the function, see if we need to
1660 make an external definition for it. */
1661 if (! TREE_USED (fndecl))
1663 assemble_external (fndecl);
1664 TREE_USED (fndecl) = 1;
1667 /* Get a SYMBOL_REF rtx for the function address. */
1668 funexp = XEXP (DECL_RTL (fndecl), 0);
1671 /* Generate an rtx (probably a pseudo-register) for the address. */
1676 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
1677 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
1679 /* Check the function is executable. */
1680 if (current_function_check_memory_usage)
1682 #ifdef POINTERS_EXTEND_UNSIGNED
1683 if (GET_MODE (funexp) != ptr_mode)
1684 funaddr = convert_memory_address (ptr_mode, funexp);
1686 emit_library_call (chkr_check_exec_libfunc, LCT_CONST_MAKE_BLOCK,
1687 VOIDmode, 1, funaddr, ptr_mode);
1694 /* Do the register loads required for any wholly-register parms or any
1695 parms which are passed both on the stack and in a register. Their
1696 expressions were already evaluated.
1698 Mark all register-parms as living through the call, putting these USE
1699 insns in the CALL_INSN_FUNCTION_USAGE field. */
1702 load_register_parameters (args, num_actuals, call_fusage, flags)
1703 struct arg_data *args;
1710 #ifdef LOAD_ARGS_REVERSED
1711 for (i = num_actuals - 1; i >= 0; i--)
1713 for (i = 0; i < num_actuals; i++)
1716 rtx reg = ((flags & ECF_SIBCALL)
1717 ? args[i].tail_call_reg : args[i].reg);
1718 int partial = args[i].partial;
1723 /* Set to non-negative if must move a word at a time, even if just
1724 one word (e.g, partial == 1 && mode == DFmode). Set to -1 if
1725 we just use a normal move insn. This value can be zero if the
1726 argument is a zero size structure with no fields. */
1727 nregs = (partial ? partial
1728 : (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode
1729 ? ((int_size_in_bytes (TREE_TYPE (args[i].tree_value))
1730 + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD)
1733 /* Handle calls that pass values in multiple non-contiguous
1734 locations. The Irix 6 ABI has examples of this. */
1736 if (GET_CODE (reg) == PARALLEL)
1737 emit_group_load (reg, args[i].value,
1738 int_size_in_bytes (TREE_TYPE (args[i].tree_value)));
1740 /* If simple case, just do move. If normal partial, store_one_arg
1741 has already loaded the register for us. In all other cases,
1742 load the register(s) from memory. */
1744 else if (nregs == -1)
1745 emit_move_insn (reg, args[i].value);
1747 /* If we have pre-computed the values to put in the registers in
1748 the case of non-aligned structures, copy them in now. */
1750 else if (args[i].n_aligned_regs != 0)
1751 for (j = 0; j < args[i].n_aligned_regs; j++)
1752 emit_move_insn (gen_rtx_REG (word_mode, REGNO (reg) + j),
1753 args[i].aligned_regs[j]);
1755 else if (partial == 0 || args[i].pass_on_stack)
1756 move_block_to_reg (REGNO (reg),
1757 validize_mem (args[i].value), nregs,
1760 /* Handle calls that pass values in multiple non-contiguous
1761 locations. The Irix 6 ABI has examples of this. */
1762 if (GET_CODE (reg) == PARALLEL)
1763 use_group_regs (call_fusage, reg);
1764 else if (nregs == -1)
1765 use_reg (call_fusage, reg);
1767 use_regs (call_fusage, REGNO (reg), nregs == 0 ? 1 : nregs);
1772 /* Try to integrate function. See expand_inline_function for documentation
1773 about the parameters. */
1776 try_to_integrate (fndecl, actparms, target, ignore, type, structure_value_addr)
1782 rtx structure_value_addr;
1787 rtx old_stack_level = 0;
1788 int reg_parm_stack_space = 0;
1790 #ifdef REG_PARM_STACK_SPACE
1791 #ifdef MAYBE_REG_PARM_STACK_SPACE
1792 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
1794 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
1798 before_call = get_last_insn ();
1800 timevar_push (TV_INTEGRATION);
1802 temp = expand_inline_function (fndecl, actparms, target,
1804 structure_value_addr);
1806 timevar_pop (TV_INTEGRATION);
1808 /* If inlining succeeded, return. */
1809 if (temp != (rtx) (HOST_WIDE_INT) - 1)
1811 if (ACCUMULATE_OUTGOING_ARGS)
1813 /* If the outgoing argument list must be preserved, push
1814 the stack before executing the inlined function if it
1817 for (i = reg_parm_stack_space - 1; i >= 0; i--)
1818 if (i < highest_outgoing_arg_in_use && stack_usage_map[i] != 0)
1821 if (stack_arg_under_construction || i >= 0)
1824 = before_call ? NEXT_INSN (before_call) : get_insns ();
1825 rtx insn = NULL_RTX, seq;
1827 /* Look for a call in the inline function code.
1828 If DECL_SAVED_INSNS (fndecl)->outgoing_args_size is
1829 nonzero then there is a call and it is not necessary
1830 to scan the insns. */
1832 if (DECL_SAVED_INSNS (fndecl)->outgoing_args_size == 0)
1833 for (insn = first_insn; insn; insn = NEXT_INSN (insn))
1834 if (GET_CODE (insn) == CALL_INSN)
1839 /* Reserve enough stack space so that the largest
1840 argument list of any function call in the inline
1841 function does not overlap the argument list being
1842 evaluated. This is usually an overestimate because
1843 allocate_dynamic_stack_space reserves space for an
1844 outgoing argument list in addition to the requested
1845 space, but there is no way to ask for stack space such
1846 that an argument list of a certain length can be
1849 Add the stack space reserved for register arguments, if
1850 any, in the inline function. What is really needed is the
1851 largest value of reg_parm_stack_space in the inline
1852 function, but that is not available. Using the current
1853 value of reg_parm_stack_space is wrong, but gives
1854 correct results on all supported machines. */
1856 int adjust = (DECL_SAVED_INSNS (fndecl)->outgoing_args_size
1857 + reg_parm_stack_space);
1860 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1861 allocate_dynamic_stack_space (GEN_INT (adjust),
1862 NULL_RTX, BITS_PER_UNIT);
1865 emit_insns_before (seq, first_insn);
1866 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
1871 /* If the result is equivalent to TARGET, return TARGET to simplify
1872 checks in store_expr. They can be equivalent but not equal in the
1873 case of a function that returns BLKmode. */
1874 if (temp != target && rtx_equal_p (temp, target))
1879 /* If inlining failed, mark FNDECL as needing to be compiled
1880 separately after all. If function was declared inline,
1882 if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline
1883 && optimize > 0 && !TREE_ADDRESSABLE (fndecl))
1885 warning_with_decl (fndecl, "inlining failed in call to `%s'");
1886 warning ("called from here");
1888 mark_addressable (fndecl);
1889 return (rtx) (HOST_WIDE_INT) - 1;
1892 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
1893 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
1894 bytes, then we would need to push some additional bytes to pad the
1895 arguments. So, we compute an adjust to the stack pointer for an
1896 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
1897 bytes. Then, when the arguments are pushed the stack will be perfectly
1898 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
1899 be popped after the call. Returns the adjustment. */
1902 combine_pending_stack_adjustment_and_call (unadjusted_args_size,
1904 preferred_unit_stack_boundary)
1905 int unadjusted_args_size;
1906 struct args_size *args_size;
1907 int preferred_unit_stack_boundary;
1909 /* The number of bytes to pop so that the stack will be
1910 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
1911 HOST_WIDE_INT adjustment;
1912 /* The alignment of the stack after the arguments are pushed, if we
1913 just pushed the arguments without adjust the stack here. */
1914 HOST_WIDE_INT unadjusted_alignment;
1916 unadjusted_alignment
1917 = ((stack_pointer_delta + unadjusted_args_size)
1918 % preferred_unit_stack_boundary);
1920 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
1921 as possible -- leaving just enough left to cancel out the
1922 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
1923 PENDING_STACK_ADJUST is non-negative, and congruent to
1924 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
1926 /* Begin by trying to pop all the bytes. */
1927 unadjusted_alignment
1928 = (unadjusted_alignment
1929 - (pending_stack_adjust % preferred_unit_stack_boundary));
1930 adjustment = pending_stack_adjust;
1931 /* Push enough additional bytes that the stack will be aligned
1932 after the arguments are pushed. */
1933 if (preferred_unit_stack_boundary > 1)
1935 if (unadjusted_alignment > 0)
1936 adjustment -= preferred_unit_stack_boundary - unadjusted_alignment;
1938 adjustment += unadjusted_alignment;
1941 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
1942 bytes after the call. The right number is the entire
1943 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
1944 by the arguments in the first place. */
1946 = pending_stack_adjust - adjustment + unadjusted_args_size;
1951 /* Scan X expression if it does not dereference any argument slots
1952 we already clobbered by tail call arguments (as noted in stored_args_map
1954 Return non-zero if X expression dereferences such argument slots,
1958 check_sibcall_argument_overlap_1 (x)
1969 code = GET_CODE (x);
1973 if (XEXP (x, 0) == current_function_internal_arg_pointer)
1975 else if (GET_CODE (XEXP (x, 0)) == PLUS
1976 && XEXP (XEXP (x, 0), 0) ==
1977 current_function_internal_arg_pointer
1978 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT)
1979 i = INTVAL (XEXP (XEXP (x, 0), 1));
1983 #ifdef ARGS_GROW_DOWNWARD
1984 i = -i - GET_MODE_SIZE (GET_MODE (x));
1987 for (k = 0; k < GET_MODE_SIZE (GET_MODE (x)); k++)
1988 if (i + k < stored_args_map->n_bits
1989 && TEST_BIT (stored_args_map, i + k))
1995 /* Scan all subexpressions. */
1996 fmt = GET_RTX_FORMAT (code);
1997 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
2001 if (check_sibcall_argument_overlap_1 (XEXP (x, i)))
2004 else if (*fmt == 'E')
2006 for (j = 0; j < XVECLEN (x, i); j++)
2007 if (check_sibcall_argument_overlap_1 (XVECEXP (x, i, j)))
2014 /* Scan sequence after INSN if it does not dereference any argument slots
2015 we already clobbered by tail call arguments (as noted in stored_args_map
2016 bitmap). Add stack slots for ARG to stored_args_map bitmap afterwards.
2017 Return non-zero if sequence after INSN dereferences such argument slots,
2021 check_sibcall_argument_overlap (insn, arg)
2023 struct arg_data *arg;
2027 if (insn == NULL_RTX)
2028 insn = get_insns ();
2030 insn = NEXT_INSN (insn);
2032 for (; insn; insn = NEXT_INSN (insn))
2034 && check_sibcall_argument_overlap_1 (PATTERN (insn)))
2037 #ifdef ARGS_GROW_DOWNWARD
2038 low = -arg->slot_offset.constant - arg->size.constant;
2040 low = arg->slot_offset.constant;
2043 for (high = low + arg->size.constant; low < high; low++)
2044 SET_BIT (stored_args_map, low);
2045 return insn != NULL_RTX;
2048 /* Generate all the code for a function call
2049 and return an rtx for its value.
2050 Store the value in TARGET (specified as an rtx) if convenient.
2051 If the value is stored in TARGET then TARGET is returned.
2052 If IGNORE is nonzero, then we ignore the value of the function call. */
2055 expand_call (exp, target, ignore)
2060 /* Nonzero if we are currently expanding a call. */
2061 static int currently_expanding_call = 0;
2063 /* List of actual parameters. */
2064 tree actparms = TREE_OPERAND (exp, 1);
2065 /* RTX for the function to be called. */
2067 /* Sequence of insns to perform a tail recursive "call". */
2068 rtx tail_recursion_insns = NULL_RTX;
2069 /* Sequence of insns to perform a normal "call". */
2070 rtx normal_call_insns = NULL_RTX;
2071 /* Sequence of insns to perform a tail recursive "call". */
2072 rtx tail_call_insns = NULL_RTX;
2073 /* Data type of the function. */
2075 /* Declaration of the function being called,
2076 or 0 if the function is computed (not known by name). */
2079 int try_tail_call = 1;
2080 int try_tail_recursion = 1;
2083 /* Register in which non-BLKmode value will be returned,
2084 or 0 if no value or if value is BLKmode. */
2086 /* Address where we should return a BLKmode value;
2087 0 if value not BLKmode. */
2088 rtx structure_value_addr = 0;
2089 /* Nonzero if that address is being passed by treating it as
2090 an extra, implicit first parameter. Otherwise,
2091 it is passed by being copied directly into struct_value_rtx. */
2092 int structure_value_addr_parm = 0;
2093 /* Size of aggregate value wanted, or zero if none wanted
2094 or if we are using the non-reentrant PCC calling convention
2095 or expecting the value in registers. */
2096 HOST_WIDE_INT struct_value_size = 0;
2097 /* Nonzero if called function returns an aggregate in memory PCC style,
2098 by returning the address of where to find it. */
2099 int pcc_struct_value = 0;
2101 /* Number of actual parameters in this call, including struct value addr. */
2103 /* Number of named args. Args after this are anonymous ones
2104 and they must all go on the stack. */
2107 /* Vector of information about each argument.
2108 Arguments are numbered in the order they will be pushed,
2109 not the order they are written. */
2110 struct arg_data *args;
2112 /* Total size in bytes of all the stack-parms scanned so far. */
2113 struct args_size args_size;
2114 struct args_size adjusted_args_size;
2115 /* Size of arguments before any adjustments (such as rounding). */
2116 int unadjusted_args_size;
2117 /* Data on reg parms scanned so far. */
2118 CUMULATIVE_ARGS args_so_far;
2119 /* Nonzero if a reg parm has been scanned. */
2121 /* Nonzero if this is an indirect function call. */
2123 /* Nonzero if we must avoid push-insns in the args for this call.
2124 If stack space is allocated for register parameters, but not by the
2125 caller, then it is preallocated in the fixed part of the stack frame.
2126 So the entire argument block must then be preallocated (i.e., we
2127 ignore PUSH_ROUNDING in that case). */
2129 int must_preallocate = !PUSH_ARGS;
2131 /* Size of the stack reserved for parameter registers. */
2132 int reg_parm_stack_space = 0;
2134 /* Address of space preallocated for stack parms
2135 (on machines that lack push insns), or 0 if space not preallocated. */
2138 /* Mask of ECF_ flags. */
2140 /* Nonzero if this is a call to an inline function. */
2141 int is_integrable = 0;
2142 #ifdef REG_PARM_STACK_SPACE
2143 /* Define the boundary of the register parm stack space that needs to be
2145 int low_to_save = -1, high_to_save;
2146 rtx save_area = 0; /* Place that it is saved */
2149 int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
2150 char *initial_stack_usage_map = stack_usage_map;
2151 int old_stack_arg_under_construction = 0;
2153 rtx old_stack_level = 0;
2154 int old_pending_adj = 0;
2155 int old_inhibit_defer_pop = inhibit_defer_pop;
2156 int old_stack_allocated;
2158 tree p = TREE_OPERAND (exp, 0);
2160 /* The alignment of the stack, in bits. */
2161 HOST_WIDE_INT preferred_stack_boundary;
2162 /* The alignment of the stack, in bytes. */
2163 HOST_WIDE_INT preferred_unit_stack_boundary;
2165 /* The value of the function call can be put in a hard register. But
2166 if -fcheck-memory-usage, code which invokes functions (and thus
2167 damages some hard registers) can be inserted before using the value.
2168 So, target is always a pseudo-register in that case. */
2169 if (current_function_check_memory_usage)
2172 /* See if this is "nothrow" function call. */
2173 if (TREE_NOTHROW (exp))
2174 flags |= ECF_NOTHROW;
2176 /* See if we can find a DECL-node for the actual function.
2177 As a result, decide whether this is a call to an integrable function. */
2179 fndecl = get_callee_fndecl (exp);
2183 && fndecl != current_function_decl
2184 && DECL_INLINE (fndecl)
2185 && DECL_SAVED_INSNS (fndecl)
2186 && DECL_SAVED_INSNS (fndecl)->inlinable)
2188 else if (! TREE_ADDRESSABLE (fndecl))
2190 /* In case this function later becomes inlinable,
2191 record that there was already a non-inline call to it.
2193 Use abstraction instead of setting TREE_ADDRESSABLE
2195 if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline
2198 warning_with_decl (fndecl, "can't inline call to `%s'");
2199 warning ("called from here");
2201 mark_addressable (fndecl);
2204 flags |= flags_from_decl_or_type (fndecl);
2207 /* If we don't have specific function to call, see if we have a
2208 attributes set in the type. */
2210 flags |= flags_from_decl_or_type (TREE_TYPE (TREE_TYPE (p)));
2212 /* Mark if the function returns with the stack pointer depressed. */
2213 if (TREE_CODE (TREE_TYPE (TREE_TYPE (p))) == FUNCTION_TYPE
2214 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (TREE_TYPE (p))))
2216 flags |= ECF_SP_DEPRESSED;
2217 flags &= ~(ECF_PURE | ECF_CONST);
2220 #ifdef REG_PARM_STACK_SPACE
2221 #ifdef MAYBE_REG_PARM_STACK_SPACE
2222 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
2224 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
2228 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2229 if (reg_parm_stack_space > 0 && PUSH_ARGS)
2230 must_preallocate = 1;
2233 /* Warn if this value is an aggregate type,
2234 regardless of which calling convention we are using for it. */
2235 if (warn_aggregate_return && AGGREGATE_TYPE_P (TREE_TYPE (exp)))
2236 warning ("function call has aggregate value");
2238 /* Set up a place to return a structure. */
2240 /* Cater to broken compilers. */
2241 if (aggregate_value_p (exp))
2243 /* This call returns a big structure. */
2244 flags &= ~(ECF_CONST | ECF_PURE);
2246 #ifdef PCC_STATIC_STRUCT_RETURN
2248 pcc_struct_value = 1;
2249 /* Easier than making that case work right. */
2252 /* In case this is a static function, note that it has been
2254 if (! TREE_ADDRESSABLE (fndecl))
2255 mark_addressable (fndecl);
2259 #else /* not PCC_STATIC_STRUCT_RETURN */
2261 struct_value_size = int_size_in_bytes (TREE_TYPE (exp));
2263 if (target && GET_CODE (target) == MEM)
2264 structure_value_addr = XEXP (target, 0);
2267 /* For variable-sized objects, we must be called with a target
2268 specified. If we were to allocate space on the stack here,
2269 we would have no way of knowing when to free it. */
2270 rtx d = assign_temp (TREE_TYPE (exp), 1, 1, 1);
2272 mark_temp_addr_taken (d);
2273 structure_value_addr = XEXP (d, 0);
2277 #endif /* not PCC_STATIC_STRUCT_RETURN */
2280 /* If called function is inline, try to integrate it. */
2284 rtx temp = try_to_integrate (fndecl, actparms, target,
2285 ignore, TREE_TYPE (exp),
2286 structure_value_addr);
2287 if (temp != (rtx) (HOST_WIDE_INT) - 1)
2291 /* Figure out the amount to which the stack should be aligned. */
2292 preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
2294 /* Operand 0 is a pointer-to-function; get the type of the function. */
2295 funtype = TREE_TYPE (TREE_OPERAND (exp, 0));
2296 if (! POINTER_TYPE_P (funtype))
2298 funtype = TREE_TYPE (funtype);
2300 /* See if this is a call to a function that can return more than once
2301 or a call to longjmp or malloc. */
2302 flags |= special_function_p (fndecl, flags);
2304 if (flags & ECF_MAY_BE_ALLOCA)
2305 current_function_calls_alloca = 1;
2307 /* If struct_value_rtx is 0, it means pass the address
2308 as if it were an extra parameter. */
2309 if (structure_value_addr && struct_value_rtx == 0)
2311 /* If structure_value_addr is a REG other than
2312 virtual_outgoing_args_rtx, we can use always use it. If it
2313 is not a REG, we must always copy it into a register.
2314 If it is virtual_outgoing_args_rtx, we must copy it to another
2315 register in some cases. */
2316 rtx temp = (GET_CODE (structure_value_addr) != REG
2317 || (ACCUMULATE_OUTGOING_ARGS
2318 && stack_arg_under_construction
2319 && structure_value_addr == virtual_outgoing_args_rtx)
2320 ? copy_addr_to_reg (structure_value_addr)
2321 : structure_value_addr);
2324 = tree_cons (error_mark_node,
2325 make_tree (build_pointer_type (TREE_TYPE (funtype)),
2328 structure_value_addr_parm = 1;
2331 /* Count the arguments and set NUM_ACTUALS. */
2332 for (p = actparms, num_actuals = 0; p; p = TREE_CHAIN (p))
2335 /* Compute number of named args.
2336 Normally, don't include the last named arg if anonymous args follow.
2337 We do include the last named arg if STRICT_ARGUMENT_NAMING is nonzero.
2338 (If no anonymous args follow, the result of list_length is actually
2339 one too large. This is harmless.)
2341 If PRETEND_OUTGOING_VARARGS_NAMED is set and STRICT_ARGUMENT_NAMING is
2342 zero, this machine will be able to place unnamed args that were
2343 passed in registers into the stack. So treat all args as named.
2344 This allows the insns emitting for a specific argument list to be
2345 independent of the function declaration.
2347 If PRETEND_OUTGOING_VARARGS_NAMED is not set, we do not have any
2348 reliable way to pass unnamed args in registers, so we must force
2349 them into memory. */
2351 if ((STRICT_ARGUMENT_NAMING
2352 || ! PRETEND_OUTGOING_VARARGS_NAMED)
2353 && TYPE_ARG_TYPES (funtype) != 0)
2355 = (list_length (TYPE_ARG_TYPES (funtype))
2356 /* Don't include the last named arg. */
2357 - (STRICT_ARGUMENT_NAMING ? 0 : 1)
2358 /* Count the struct value address, if it is passed as a parm. */
2359 + structure_value_addr_parm);
2361 /* If we know nothing, treat all args as named. */
2362 n_named_args = num_actuals;
2364 /* Start updating where the next arg would go.
2366 On some machines (such as the PA) indirect calls have a different
2367 calling convention than normal calls. The last argument in
2368 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
2370 INIT_CUMULATIVE_ARGS (args_so_far, funtype, NULL_RTX, (fndecl == 0));
2372 /* Make a vector to hold all the information about each arg. */
2373 args = (struct arg_data *) alloca (num_actuals * sizeof (struct arg_data));
2374 memset ((char *) args, 0, num_actuals * sizeof (struct arg_data));
2376 /* Build up entries in the ARGS array, compute the size of the
2377 arguments into ARGS_SIZE, etc. */
2378 initialize_argument_information (num_actuals, args, &args_size,
2379 n_named_args, actparms, fndecl,
2380 &args_so_far, reg_parm_stack_space,
2381 &old_stack_level, &old_pending_adj,
2382 &must_preallocate, &flags);
2386 /* If this function requires a variable-sized argument list, don't
2387 try to make a cse'able block for this call. We may be able to
2388 do this eventually, but it is too complicated to keep track of
2389 what insns go in the cse'able block and which don't. */
2391 flags &= ~(ECF_CONST | ECF_PURE);
2392 must_preallocate = 1;
2395 /* Now make final decision about preallocating stack space. */
2396 must_preallocate = finalize_must_preallocate (must_preallocate,
2400 /* If the structure value address will reference the stack pointer, we
2401 must stabilize it. We don't need to do this if we know that we are
2402 not going to adjust the stack pointer in processing this call. */
2404 if (structure_value_addr
2405 && (reg_mentioned_p (virtual_stack_dynamic_rtx, structure_value_addr)
2406 || reg_mentioned_p (virtual_outgoing_args_rtx,
2407 structure_value_addr))
2409 || (!ACCUMULATE_OUTGOING_ARGS && args_size.constant)))
2410 structure_value_addr = copy_to_reg (structure_value_addr);
2412 /* Tail calls can make things harder to debug, and we're traditionally
2413 pushed these optimizations into -O2. Don't try if we're already
2414 expanding a call, as that means we're an argument. Don't try if
2415 there's cleanups, as we know there's code to follow the call.
2417 If rtx_equal_function_value_matters is false, that means we've
2418 finished with regular parsing. Which means that some of the
2419 machinery we use to generate tail-calls is no longer in place.
2420 This is most often true of sjlj-exceptions, which we couldn't
2421 tail-call to anyway. */
2423 if (currently_expanding_call++ != 0
2424 || !flag_optimize_sibling_calls
2425 || !rtx_equal_function_value_matters
2426 || any_pending_cleanups (1)
2428 try_tail_call = try_tail_recursion = 0;
2430 /* Tail recursion fails, when we are not dealing with recursive calls. */
2431 if (!try_tail_recursion
2432 || TREE_CODE (TREE_OPERAND (exp, 0)) != ADDR_EXPR
2433 || TREE_OPERAND (TREE_OPERAND (exp, 0), 0) != current_function_decl)
2434 try_tail_recursion = 0;
2436 /* Rest of purposes for tail call optimizations to fail. */
2438 #ifdef HAVE_sibcall_epilogue
2439 !HAVE_sibcall_epilogue
2444 /* Doing sibling call optimization needs some work, since
2445 structure_value_addr can be allocated on the stack.
2446 It does not seem worth the effort since few optimizable
2447 sibling calls will return a structure. */
2448 || structure_value_addr != NULL_RTX
2449 /* If the register holding the address is a callee saved
2450 register, then we lose. We have no way to prevent that,
2451 so we only allow calls to named functions. */
2452 /* ??? This could be done by having the insn constraints
2453 use a register class that is all call-clobbered. Any
2454 reload insns generated to fix things up would appear
2455 before the sibcall_epilogue. */
2456 || fndecl == NULL_TREE
2457 || (flags & (ECF_RETURNS_TWICE | ECF_LONGJMP))
2458 || TREE_THIS_VOLATILE (fndecl)
2459 || !FUNCTION_OK_FOR_SIBCALL (fndecl)
2460 /* If this function requires more stack slots than the current
2461 function, we cannot change it into a sibling call. */
2462 || args_size.constant > current_function_args_size
2463 /* If the callee pops its own arguments, then it must pop exactly
2464 the same number of arguments as the current function. */
2465 || RETURN_POPS_ARGS (fndecl, funtype, args_size.constant)
2466 != RETURN_POPS_ARGS (current_function_decl,
2467 TREE_TYPE (current_function_decl),
2468 current_function_args_size))
2471 if (try_tail_call || try_tail_recursion)
2474 actparms = NULL_TREE;
2475 /* Ok, we're going to give the tail call the old college try.
2476 This means we're going to evaluate the function arguments
2477 up to three times. There are two degrees of badness we can
2478 encounter, those that can be unsaved and those that can't.
2479 (See unsafe_for_reeval commentary for details.)
2481 Generate a new argument list. Pass safe arguments through
2482 unchanged. For the easy badness wrap them in UNSAVE_EXPRs.
2483 For hard badness, evaluate them now and put their resulting
2484 rtx in a temporary VAR_DECL.
2486 initialize_argument_information has ordered the array for the
2487 order to be pushed, and we must remember this when reconstructing
2488 the original argument order. */
2490 if (PUSH_ARGS_REVERSED)
2499 i = num_actuals - 1;
2503 for (; i != end; i += inc)
2505 switch (unsafe_for_reeval (args[i].tree_value))
2510 case 1: /* Mildly unsafe. */
2511 args[i].tree_value = unsave_expr (args[i].tree_value);
2514 case 2: /* Wildly unsafe. */
2516 tree var = build_decl (VAR_DECL, NULL_TREE,
2517 TREE_TYPE (args[i].tree_value));
2519 expand_expr (args[i].tree_value, NULL_RTX,
2520 VOIDmode, EXPAND_NORMAL));
2521 args[i].tree_value = var;
2528 /* We need to build actparms for optimize_tail_recursion. We can
2529 safely trash away TREE_PURPOSE, since it is unused by this
2531 if (try_tail_recursion)
2532 actparms = tree_cons (NULL_TREE, args[i].tree_value, actparms);
2534 /* Expanding one of those dangerous arguments could have added
2535 cleanups, but otherwise give it a whirl. */
2536 if (any_pending_cleanups (1))
2537 try_tail_call = try_tail_recursion = 0;
2540 /* Generate a tail recursion sequence when calling ourselves. */
2542 if (try_tail_recursion)
2544 /* We want to emit any pending stack adjustments before the tail
2545 recursion "call". That way we know any adjustment after the tail
2546 recursion call can be ignored if we indeed use the tail recursion
2548 int save_pending_stack_adjust = pending_stack_adjust;
2549 int save_stack_pointer_delta = stack_pointer_delta;
2551 /* Emit any queued insns now; otherwise they would end up in
2552 only one of the alternates. */
2555 /* Use a new sequence to hold any RTL we generate. We do not even
2556 know if we will use this RTL yet. The final decision can not be
2557 made until after RTL generation for the entire function is
2560 /* If expanding any of the arguments creates cleanups, we can't
2561 do a tailcall. So, we'll need to pop the pending cleanups
2562 list. If, however, all goes well, and there are no cleanups
2563 then the call to expand_start_target_temps will have no
2565 expand_start_target_temps ();
2566 if (optimize_tail_recursion (actparms, get_last_insn ()))
2568 if (any_pending_cleanups (1))
2569 try_tail_call = try_tail_recursion = 0;
2571 tail_recursion_insns = get_insns ();
2573 expand_end_target_temps ();
2576 /* Restore the original pending stack adjustment for the sibling and
2577 normal call cases below. */
2578 pending_stack_adjust = save_pending_stack_adjust;
2579 stack_pointer_delta = save_stack_pointer_delta;
2582 if (profile_arc_flag && (flags & ECF_FORK_OR_EXEC))
2584 /* A fork duplicates the profile information, and an exec discards
2585 it. We can't rely on fork/exec to be paired. So write out the
2586 profile information we have gathered so far, and clear it. */
2587 /* ??? When Linux's __clone is called with CLONE_VM set, profiling
2588 is subject to race conditions, just as with multithreaded
2591 emit_library_call (gen_rtx_SYMBOL_REF (Pmode, "__bb_fork_func"),
2596 /* Ensure current function's preferred stack boundary is at least
2597 what we need. We don't have to increase alignment for recursive
2599 if (cfun->preferred_stack_boundary < preferred_stack_boundary
2600 && fndecl != current_function_decl)
2601 cfun->preferred_stack_boundary = preferred_stack_boundary;
2603 preferred_unit_stack_boundary = preferred_stack_boundary / BITS_PER_UNIT;
2605 function_call_count++;
2607 /* We want to make two insn chains; one for a sibling call, the other
2608 for a normal call. We will select one of the two chains after
2609 initial RTL generation is complete. */
2610 for (pass = 0; pass < 2; pass++)
2612 int sibcall_failure = 0;
2613 /* We want to emit any pending stack adjustments before the tail
2614 recursion "call". That way we know any adjustment after the tail
2615 recursion call can be ignored if we indeed use the tail recursion
2617 int save_pending_stack_adjust = 0;
2618 int save_stack_pointer_delta = 0;
2620 rtx before_call, next_arg_reg;
2624 if (! try_tail_call)
2627 /* Emit any queued insns now; otherwise they would end up in
2628 only one of the alternates. */
2631 /* State variables we need to save and restore between
2633 save_pending_stack_adjust = pending_stack_adjust;
2634 save_stack_pointer_delta = stack_pointer_delta;
2637 flags &= ~ECF_SIBCALL;
2639 flags |= ECF_SIBCALL;
2641 /* Other state variables that we must reinitialize each time
2642 through the loop (that are not initialized by the loop itself). */
2646 /* Start a new sequence for the normal call case.
2648 From this point on, if the sibling call fails, we want to set
2649 sibcall_failure instead of continuing the loop. */
2654 /* We know at this point that there are not currently any
2655 pending cleanups. If, however, in the process of evaluating
2656 the arguments we were to create some, we'll need to be
2657 able to get rid of them. */
2658 expand_start_target_temps ();
2661 /* Don't let pending stack adjusts add up to too much.
2662 Also, do all pending adjustments now if there is any chance
2663 this might be a call to alloca or if we are expanding a sibling
2665 if (pending_stack_adjust >= 32
2666 || (pending_stack_adjust > 0 && (flags & ECF_MAY_BE_ALLOCA))
2668 do_pending_stack_adjust ();
2670 /* When calling a const function, we must pop the stack args right away,
2671 so that the pop is deleted or moved with the call. */
2672 if (flags & (ECF_CONST | ECF_PURE))
2675 /* Push the temporary stack slot level so that we can free any
2676 temporaries we make. */
2679 #ifdef FINAL_REG_PARM_STACK_SPACE
2680 reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant,
2683 /* Precompute any arguments as needed. */
2685 precompute_arguments (flags, num_actuals, args);
2687 /* Now we are about to start emitting insns that can be deleted
2688 if a libcall is deleted. */
2689 if (flags & (ECF_CONST | ECF_PURE | ECF_MALLOC))
2692 adjusted_args_size = args_size;
2693 /* Compute the actual size of the argument block required. The variable
2694 and constant sizes must be combined, the size may have to be rounded,
2695 and there may be a minimum required size. When generating a sibcall
2696 pattern, do not round up, since we'll be re-using whatever space our
2698 unadjusted_args_size
2699 = compute_argument_block_size (reg_parm_stack_space,
2700 &adjusted_args_size,
2702 : preferred_stack_boundary));
2704 old_stack_allocated = stack_pointer_delta - pending_stack_adjust;
2706 /* The argument block when performing a sibling call is the
2707 incoming argument block. */
2710 argblock = virtual_incoming_args_rtx;
2711 stored_args_map = sbitmap_alloc (args_size.constant);
2712 sbitmap_zero (stored_args_map);
2715 /* If we have no actual push instructions, or shouldn't use them,
2716 make space for all args right now. */
2717 else if (adjusted_args_size.var != 0)
2719 if (old_stack_level == 0)
2721 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
2722 old_pending_adj = pending_stack_adjust;
2723 pending_stack_adjust = 0;
2724 /* stack_arg_under_construction says whether a stack arg is
2725 being constructed at the old stack level. Pushing the stack
2726 gets a clean outgoing argument block. */
2727 old_stack_arg_under_construction = stack_arg_under_construction;
2728 stack_arg_under_construction = 0;
2730 argblock = push_block (ARGS_SIZE_RTX (adjusted_args_size), 0, 0);
2734 /* Note that we must go through the motions of allocating an argument
2735 block even if the size is zero because we may be storing args
2736 in the area reserved for register arguments, which may be part of
2739 int needed = adjusted_args_size.constant;
2741 /* Store the maximum argument space used. It will be pushed by
2742 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
2745 if (needed > current_function_outgoing_args_size)
2746 current_function_outgoing_args_size = needed;
2748 if (must_preallocate)
2750 if (ACCUMULATE_OUTGOING_ARGS)
2752 /* Since the stack pointer will never be pushed, it is
2753 possible for the evaluation of a parm to clobber
2754 something we have already written to the stack.
2755 Since most function calls on RISC machines do not use
2756 the stack, this is uncommon, but must work correctly.
2758 Therefore, we save any area of the stack that was already
2759 written and that we are using. Here we set up to do this
2760 by making a new stack usage map from the old one. The
2761 actual save will be done by store_one_arg.
2763 Another approach might be to try to reorder the argument
2764 evaluations to avoid this conflicting stack usage. */
2766 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2767 /* Since we will be writing into the entire argument area,
2768 the map must be allocated for its entire size, not just
2769 the part that is the responsibility of the caller. */
2770 needed += reg_parm_stack_space;
2773 #ifdef ARGS_GROW_DOWNWARD
2774 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
2777 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
2781 = (char *) alloca (highest_outgoing_arg_in_use);
2783 if (initial_highest_arg_in_use)
2784 memcpy (stack_usage_map, initial_stack_usage_map,
2785 initial_highest_arg_in_use);
2787 if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
2788 memset (&stack_usage_map[initial_highest_arg_in_use], 0,
2789 (highest_outgoing_arg_in_use
2790 - initial_highest_arg_in_use));
2793 /* The address of the outgoing argument list must not be
2794 copied to a register here, because argblock would be left
2795 pointing to the wrong place after the call to
2796 allocate_dynamic_stack_space below. */
2798 argblock = virtual_outgoing_args_rtx;
2802 if (inhibit_defer_pop == 0)
2804 /* Try to reuse some or all of the pending_stack_adjust
2805 to get this space. */
2807 = (combine_pending_stack_adjustment_and_call
2808 (unadjusted_args_size,
2809 &adjusted_args_size,
2810 preferred_unit_stack_boundary));
2812 /* combine_pending_stack_adjustment_and_call computes
2813 an adjustment before the arguments are allocated.
2814 Account for them and see whether or not the stack
2815 needs to go up or down. */
2816 needed = unadjusted_args_size - needed;
2820 /* We're releasing stack space. */
2821 /* ??? We can avoid any adjustment at all if we're
2822 already aligned. FIXME. */
2823 pending_stack_adjust = -needed;
2824 do_pending_stack_adjust ();
2828 /* We need to allocate space. We'll do that in
2829 push_block below. */
2830 pending_stack_adjust = 0;
2833 /* Special case this because overhead of `push_block' in
2834 this case is non-trivial. */
2836 argblock = virtual_outgoing_args_rtx;
2838 argblock = push_block (GEN_INT (needed), 0, 0);
2840 /* We only really need to call `copy_to_reg' in the case
2841 where push insns are going to be used to pass ARGBLOCK
2842 to a function call in ARGS. In that case, the stack
2843 pointer changes value from the allocation point to the
2844 call point, and hence the value of
2845 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
2846 as well always do it. */
2847 argblock = copy_to_reg (argblock);
2849 /* The save/restore code in store_one_arg handles all
2850 cases except one: a constructor call (including a C
2851 function returning a BLKmode struct) to initialize
2853 if (stack_arg_under_construction)
2855 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2856 rtx push_size = GEN_INT (reg_parm_stack_space
2857 + adjusted_args_size.constant);
2859 rtx push_size = GEN_INT (adjusted_args_size.constant);
2861 if (old_stack_level == 0)
2863 emit_stack_save (SAVE_BLOCK, &old_stack_level,
2865 old_pending_adj = pending_stack_adjust;
2866 pending_stack_adjust = 0;
2867 /* stack_arg_under_construction says whether a stack
2868 arg is being constructed at the old stack level.
2869 Pushing the stack gets a clean outgoing argument
2871 old_stack_arg_under_construction
2872 = stack_arg_under_construction;
2873 stack_arg_under_construction = 0;
2874 /* Make a new map for the new argument list. */
2875 stack_usage_map = (char *)
2876 alloca (highest_outgoing_arg_in_use);
2877 memset (stack_usage_map, 0, highest_outgoing_arg_in_use);
2878 highest_outgoing_arg_in_use = 0;
2880 allocate_dynamic_stack_space (push_size, NULL_RTX,
2883 /* If argument evaluation might modify the stack pointer,
2884 copy the address of the argument list to a register. */
2885 for (i = 0; i < num_actuals; i++)
2886 if (args[i].pass_on_stack)
2888 argblock = copy_addr_to_reg (argblock);
2895 compute_argument_addresses (args, argblock, num_actuals);
2897 /* If we push args individually in reverse order, perform stack alignment
2898 before the first push (the last arg). */
2899 if (PUSH_ARGS_REVERSED && argblock == 0
2900 && adjusted_args_size.constant != unadjusted_args_size)
2902 /* When the stack adjustment is pending, we get better code
2903 by combining the adjustments. */
2904 if (pending_stack_adjust
2905 && ! (flags & (ECF_CONST | ECF_PURE))
2906 && ! inhibit_defer_pop)
2908 pending_stack_adjust
2909 = (combine_pending_stack_adjustment_and_call
2910 (unadjusted_args_size,
2911 &adjusted_args_size,
2912 preferred_unit_stack_boundary));
2913 do_pending_stack_adjust ();
2915 else if (argblock == 0)
2916 anti_adjust_stack (GEN_INT (adjusted_args_size.constant
2917 - unadjusted_args_size));
2919 /* Now that the stack is properly aligned, pops can't safely
2920 be deferred during the evaluation of the arguments. */
2923 funexp = rtx_for_function_call (fndecl, exp);
2925 /* Figure out the register where the value, if any, will come back. */
2927 if (TYPE_MODE (TREE_TYPE (exp)) != VOIDmode
2928 && ! structure_value_addr)
2930 if (pcc_struct_value)
2931 valreg = hard_function_value (build_pointer_type (TREE_TYPE (exp)),
2932 fndecl, (pass == 0));
2934 valreg = hard_function_value (TREE_TYPE (exp), fndecl, (pass == 0));
2937 /* Precompute all register parameters. It isn't safe to compute anything
2938 once we have started filling any specific hard regs. */
2939 precompute_register_parameters (num_actuals, args, ®_parm_seen);
2941 #ifdef REG_PARM_STACK_SPACE
2942 /* Save the fixed argument area if it's part of the caller's frame and
2943 is clobbered by argument setup for this call. */
2944 if (ACCUMULATE_OUTGOING_ARGS && pass)
2945 save_area = save_fixed_argument_area (reg_parm_stack_space, argblock,
2946 &low_to_save, &high_to_save);
2949 /* Now store (and compute if necessary) all non-register parms.
2950 These come before register parms, since they can require block-moves,
2951 which could clobber the registers used for register parms.
2952 Parms which have partial registers are not stored here,
2953 but we do preallocate space here if they want that. */
2955 for (i = 0; i < num_actuals; i++)
2956 if (args[i].reg == 0 || args[i].pass_on_stack)
2958 rtx before_arg = get_last_insn ();
2960 if (store_one_arg (&args[i], argblock, flags,
2961 adjusted_args_size.var != 0,
2962 reg_parm_stack_space)
2964 && check_sibcall_argument_overlap (before_arg,
2966 sibcall_failure = 1;
2969 /* If we have a parm that is passed in registers but not in memory
2970 and whose alignment does not permit a direct copy into registers,
2971 make a group of pseudos that correspond to each register that we
2973 if (STRICT_ALIGNMENT)
2974 store_unaligned_arguments_into_pseudos (args, num_actuals);
2976 /* Now store any partially-in-registers parm.
2977 This is the last place a block-move can happen. */
2979 for (i = 0; i < num_actuals; i++)
2980 if (args[i].partial != 0 && ! args[i].pass_on_stack)
2982 rtx before_arg = get_last_insn ();
2984 if (store_one_arg (&args[i], argblock, flags,
2985 adjusted_args_size.var != 0,
2986 reg_parm_stack_space)
2988 && check_sibcall_argument_overlap (before_arg,
2990 sibcall_failure = 1;
2993 /* If we pushed args in forward order, perform stack alignment
2994 after pushing the last arg. */
2995 if (!PUSH_ARGS_REVERSED && argblock == 0)
2996 anti_adjust_stack (GEN_INT (adjusted_args_size.constant
2997 - unadjusted_args_size));
2999 /* If register arguments require space on the stack and stack space
3000 was not preallocated, allocate stack space here for arguments
3001 passed in registers. */
3002 #ifdef OUTGOING_REG_PARM_STACK_SPACE
3003 if (!ACCUMULATE_OUTGOING_ARGS
3004 && must_preallocate == 0 && reg_parm_stack_space > 0)
3005 anti_adjust_stack (GEN_INT (reg_parm_stack_space));
3008 /* Pass the function the address in which to return a
3010 if (pass != 0 && structure_value_addr && ! structure_value_addr_parm)
3012 emit_move_insn (struct_value_rtx,
3014 force_operand (structure_value_addr,
3017 /* Mark the memory for the aggregate as write-only. */
3018 if (current_function_check_memory_usage)
3019 emit_library_call (chkr_set_right_libfunc, LCT_CONST_MAKE_BLOCK,
3021 structure_value_addr, ptr_mode,
3022 GEN_INT (struct_value_size),
3023 TYPE_MODE (sizetype),
3024 GEN_INT (MEMORY_USE_WO),
3025 TYPE_MODE (integer_type_node));
3027 if (GET_CODE (struct_value_rtx) == REG)
3028 use_reg (&call_fusage, struct_value_rtx);
3031 funexp = prepare_call_address (funexp, fndecl, &call_fusage,
3032 reg_parm_seen, pass == 0);
3034 load_register_parameters (args, num_actuals, &call_fusage, flags);
3036 /* Perform postincrements before actually calling the function. */
3039 /* Save a pointer to the last insn before the call, so that we can
3040 later safely search backwards to find the CALL_INSN. */
3041 before_call = get_last_insn ();
3043 /* Set up next argument register. For sibling calls on machines
3044 with register windows this should be the incoming register. */
3045 #ifdef FUNCTION_INCOMING_ARG
3047 next_arg_reg = FUNCTION_INCOMING_ARG (args_so_far, VOIDmode,
3051 next_arg_reg = FUNCTION_ARG (args_so_far, VOIDmode,
3054 /* All arguments and registers used for the call must be set up by
3057 /* Stack must be properly aligned now. */
3058 if (pass && stack_pointer_delta % preferred_unit_stack_boundary)
3061 /* Generate the actual call instruction. */
3062 emit_call_1 (funexp, fndecl, funtype, unadjusted_args_size,
3063 adjusted_args_size.constant, struct_value_size,
3064 next_arg_reg, valreg, old_inhibit_defer_pop, call_fusage,
3067 /* Verify that we've deallocated all the stack we used. */
3069 && old_stack_allocated != stack_pointer_delta - pending_stack_adjust)
3072 /* If call is cse'able, make appropriate pair of reg-notes around it.
3073 Test valreg so we don't crash; may safely ignore `const'
3074 if return type is void. Disable for PARALLEL return values, because
3075 we have no way to move such values into a pseudo register. */
3077 && (flags & (ECF_CONST | ECF_PURE))
3078 && valreg != 0 && GET_CODE (valreg) != PARALLEL)
3081 rtx temp = gen_reg_rtx (GET_MODE (valreg));
3084 /* Mark the return value as a pointer if needed. */
3085 if (TREE_CODE (TREE_TYPE (exp)) == POINTER_TYPE)
3086 mark_reg_pointer (temp, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp))));
3088 /* Construct an "equal form" for the value which mentions all the
3089 arguments in order as well as the function name. */
3090 for (i = 0; i < num_actuals; i++)
3091 note = gen_rtx_EXPR_LIST (VOIDmode, args[i].initial_value, note);
3092 note = gen_rtx_EXPR_LIST (VOIDmode, funexp, note);
3094 insns = get_insns ();
3097 if (flags & ECF_PURE)
3098 note = gen_rtx_EXPR_LIST (VOIDmode,
3099 gen_rtx_USE (VOIDmode,
3100 gen_rtx_MEM (BLKmode,
3101 gen_rtx_SCRATCH (VOIDmode))), note);
3103 emit_libcall_block (insns, temp, valreg, note);
3107 else if (flags & (ECF_CONST | ECF_PURE))
3109 /* Otherwise, just write out the sequence without a note. */
3110 rtx insns = get_insns ();
3115 else if (flags & ECF_MALLOC)
3117 rtx temp = gen_reg_rtx (GET_MODE (valreg));
3120 /* The return value from a malloc-like function is a pointer. */
3121 if (TREE_CODE (TREE_TYPE (exp)) == POINTER_TYPE)
3122 mark_reg_pointer (temp, BIGGEST_ALIGNMENT);
3124 emit_move_insn (temp, valreg);
3126 /* The return value from a malloc-like function can not alias
3128 last = get_last_insn ();
3130 gen_rtx_EXPR_LIST (REG_NOALIAS, temp, REG_NOTES (last));
3132 /* Write out the sequence. */
3133 insns = get_insns ();
3139 /* For calls to `setjmp', etc., inform flow.c it should complain
3140 if nonvolatile values are live. For functions that cannot return,
3141 inform flow that control does not fall through. */
3143 if ((flags & (ECF_NORETURN | ECF_LONGJMP)) || pass == 0)
3145 /* The barrier must be emitted
3146 immediately after the CALL_INSN. Some ports emit more
3147 than just a CALL_INSN above, so we must search for it here. */
3149 rtx last = get_last_insn ();
3150 while (GET_CODE (last) != CALL_INSN)
3152 last = PREV_INSN (last);
3153 /* There was no CALL_INSN? */
3154 if (last == before_call)
3158 emit_barrier_after (last);
3161 if (flags & ECF_LONGJMP)
3162 current_function_calls_longjmp = 1;
3164 /* If this function is returning into a memory location marked as
3165 readonly, it means it is initializing that location. But we normally
3166 treat functions as not clobbering such locations, so we need to
3167 specify that this one does. */
3168 if (target != 0 && GET_CODE (target) == MEM
3169 && structure_value_addr != 0 && RTX_UNCHANGING_P (target))
3170 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
3172 /* If value type not void, return an rtx for the value. */
3174 /* If there are cleanups to be called, don't use a hard reg as target.
3175 We need to double check this and see if it matters anymore. */
3176 if (any_pending_cleanups (1))
3178 if (target && REG_P (target)
3179 && REGNO (target) < FIRST_PSEUDO_REGISTER)
3181 sibcall_failure = 1;
3184 if (TYPE_MODE (TREE_TYPE (exp)) == VOIDmode
3187 target = const0_rtx;
3189 else if (structure_value_addr)
3191 if (target == 0 || GET_CODE (target) != MEM)
3194 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
3195 memory_address (TYPE_MODE (TREE_TYPE (exp)),
3196 structure_value_addr));
3197 set_mem_attributes (target, exp, 1);
3200 else if (pcc_struct_value)
3202 /* This is the special C++ case where we need to
3203 know what the true target was. We take care to
3204 never use this value more than once in one expression. */
3205 target = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
3206 copy_to_reg (valreg));
3207 set_mem_attributes (target, exp, 1);
3209 /* Handle calls that return values in multiple non-contiguous locations.
3210 The Irix 6 ABI has examples of this. */
3211 else if (GET_CODE (valreg) == PARALLEL)
3215 /* This will only be assigned once, so it can be readonly. */
3216 tree nt = build_qualified_type (TREE_TYPE (exp),
3217 (TYPE_QUALS (TREE_TYPE (exp))
3218 | TYPE_QUAL_CONST));
3220 target = assign_temp (nt, 0, 1, 1);
3221 preserve_temp_slots (target);
3224 if (! rtx_equal_p (target, valreg))
3225 emit_group_store (target, valreg,
3226 int_size_in_bytes (TREE_TYPE (exp)));
3228 /* We can not support sibling calls for this case. */
3229 sibcall_failure = 1;
3232 && GET_MODE (target) == TYPE_MODE (TREE_TYPE (exp))
3233 && GET_MODE (target) == GET_MODE (valreg))
3235 /* TARGET and VALREG cannot be equal at this point because the
3236 latter would not have REG_FUNCTION_VALUE_P true, while the
3237 former would if it were referring to the same register.
3239 If they refer to the same register, this move will be a no-op,
3240 except when function inlining is being done. */
3241 emit_move_insn (target, valreg);
3243 else if (TYPE_MODE (TREE_TYPE (exp)) == BLKmode)
3245 target = copy_blkmode_from_reg (target, valreg, TREE_TYPE (exp));
3247 /* We can not support sibling calls for this case. */
3248 sibcall_failure = 1;
3251 target = copy_to_reg (valreg);
3253 #ifdef PROMOTE_FUNCTION_RETURN
3254 /* If we promoted this return value, make the proper SUBREG. TARGET
3255 might be const0_rtx here, so be careful. */
3256 if (GET_CODE (target) == REG
3257 && TYPE_MODE (TREE_TYPE (exp)) != BLKmode
3258 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
3260 tree type = TREE_TYPE (exp);
3261 int unsignedp = TREE_UNSIGNED (type);
3264 /* If we don't promote as expected, something is wrong. */
3265 if (GET_MODE (target)
3266 != promote_mode (type, TYPE_MODE (type), &unsignedp, 1))
3269 if ((WORDS_BIG_ENDIAN || BYTES_BIG_ENDIAN)
3270 && GET_MODE_SIZE (GET_MODE (target))
3271 > GET_MODE_SIZE (TYPE_MODE (type)))
3273 offset = GET_MODE_SIZE (GET_MODE (target))
3274 - GET_MODE_SIZE (TYPE_MODE (type));
3275 if (! BYTES_BIG_ENDIAN)
3276 offset = (offset / UNITS_PER_WORD) * UNITS_PER_WORD;
3277 else if (! WORDS_BIG_ENDIAN)
3278 offset %= UNITS_PER_WORD;
3280 target = gen_rtx_SUBREG (TYPE_MODE (type), target, offset);
3281 SUBREG_PROMOTED_VAR_P (target) = 1;
3282 SUBREG_PROMOTED_UNSIGNED_P (target) = unsignedp;
3286 /* If size of args is variable or this was a constructor call for a stack
3287 argument, restore saved stack-pointer value. */
3289 if (old_stack_level && ! (flags & ECF_SP_DEPRESSED))
3291 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
3292 pending_stack_adjust = old_pending_adj;
3293 stack_arg_under_construction = old_stack_arg_under_construction;
3294 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
3295 stack_usage_map = initial_stack_usage_map;
3296 sibcall_failure = 1;
3298 else if (ACCUMULATE_OUTGOING_ARGS && pass)
3300 #ifdef REG_PARM_STACK_SPACE
3303 restore_fixed_argument_area (save_area, argblock,
3304 high_to_save, low_to_save);
3308 /* If we saved any argument areas, restore them. */
3309 for (i = 0; i < num_actuals; i++)
3310 if (args[i].save_area)
3312 enum machine_mode save_mode = GET_MODE (args[i].save_area);
3314 = gen_rtx_MEM (save_mode,
3315 memory_address (save_mode,
3316 XEXP (args[i].stack_slot, 0)));
3318 if (save_mode != BLKmode)
3319 emit_move_insn (stack_area, args[i].save_area);
3321 emit_block_move (stack_area,
3322 validize_mem (args[i].save_area),
3323 GEN_INT (args[i].size.constant));
3326 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
3327 stack_usage_map = initial_stack_usage_map;
3330 /* If this was alloca, record the new stack level for nonlocal gotos.
3331 Check for the handler slots since we might not have a save area
3332 for non-local gotos. */
3334 if ((flags & ECF_MAY_BE_ALLOCA) && nonlocal_goto_handler_slots != 0)
3335 emit_stack_save (SAVE_NONLOCAL, &nonlocal_goto_stack_level, NULL_RTX);
3339 /* Free up storage we no longer need. */
3340 for (i = 0; i < num_actuals; ++i)
3341 if (args[i].aligned_regs)
3342 free (args[i].aligned_regs);
3346 /* Undo the fake expand_start_target_temps we did earlier. If
3347 there had been any cleanups created, we've already set
3349 expand_end_target_temps ();
3352 insns = get_insns ();
3357 tail_call_insns = insns;
3359 /* Restore the pending stack adjustment now that we have
3360 finished generating the sibling call sequence. */
3362 pending_stack_adjust = save_pending_stack_adjust;
3363 stack_pointer_delta = save_stack_pointer_delta;
3365 /* Prepare arg structure for next iteration. */
3366 for (i = 0; i < num_actuals; i++)
3369 args[i].aligned_regs = 0;
3373 sbitmap_free (stored_args_map);
3376 normal_call_insns = insns;
3378 /* If something prevents making this a sibling call,
3379 zero out the sequence. */
3380 if (sibcall_failure)
3381 tail_call_insns = NULL_RTX;
3384 /* The function optimize_sibling_and_tail_recursive_calls doesn't
3385 handle CALL_PLACEHOLDERs inside other CALL_PLACEHOLDERs. This
3386 can happen if the arguments to this function call an inline
3387 function who's expansion contains another CALL_PLACEHOLDER.
3389 If there are any C_Ps in any of these sequences, replace them
3390 with their normal call. */
3392 for (insn = normal_call_insns; insn; insn = NEXT_INSN (insn))
3393 if (GET_CODE (insn) == CALL_INSN
3394 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
3395 replace_call_placeholder (insn, sibcall_use_normal);
3397 for (insn = tail_call_insns; insn; insn = NEXT_INSN (insn))
3398 if (GET_CODE (insn) == CALL_INSN
3399 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
3400 replace_call_placeholder (insn, sibcall_use_normal);
3402 for (insn = tail_recursion_insns; insn; insn = NEXT_INSN (insn))
3403 if (GET_CODE (insn) == CALL_INSN
3404 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
3405 replace_call_placeholder (insn, sibcall_use_normal);
3407 /* If this was a potential tail recursion site, then emit a
3408 CALL_PLACEHOLDER with the normal and the tail recursion streams.
3409 One of them will be selected later. */
3410 if (tail_recursion_insns || tail_call_insns)
3412 /* The tail recursion label must be kept around. We could expose
3413 its use in the CALL_PLACEHOLDER, but that creates unwanted edges
3414 and makes determining true tail recursion sites difficult.
3416 So we set LABEL_PRESERVE_P here, then clear it when we select
3417 one of the call sequences after rtl generation is complete. */
3418 if (tail_recursion_insns)
3419 LABEL_PRESERVE_P (tail_recursion_label) = 1;
3420 emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode, normal_call_insns,
3422 tail_recursion_insns,
3423 tail_recursion_label));
3426 emit_insns (normal_call_insns);
3428 currently_expanding_call--;
3430 /* If this function returns with the stack pointer depressed, ensure
3431 this block saves and restores the stack pointer, show it was
3432 changed, and adjust for any outgoing arg space. */
3433 if (flags & ECF_SP_DEPRESSED)
3435 clear_pending_stack_adjust ();
3436 emit_insn (gen_rtx (CLOBBER, VOIDmode, stack_pointer_rtx));
3437 emit_move_insn (virtual_stack_dynamic_rtx, stack_pointer_rtx);
3438 save_stack_pointer ();
3444 /* Output a library call to function FUN (a SYMBOL_REF rtx).
3445 The RETVAL parameter specifies whether return value needs to be saved, other
3446 parameters are documented in the emit_library_call function below. */
3449 emit_library_call_value_1 (retval, orgfun, value, fn_type, outmode, nargs, p)
3453 enum libcall_type fn_type;
3454 enum machine_mode outmode;
3458 /* Total size in bytes of all the stack-parms scanned so far. */
3459 struct args_size args_size;
3460 /* Size of arguments before any adjustments (such as rounding). */
3461 struct args_size original_args_size;
3466 struct args_size alignment_pad;
3468 CUMULATIVE_ARGS args_so_far;
3472 enum machine_mode mode;
3475 struct args_size offset;
3476 struct args_size size;
3480 int old_inhibit_defer_pop = inhibit_defer_pop;
3481 rtx call_fusage = 0;
3484 int pcc_struct_value = 0;
3485 int struct_value_size = 0;
3487 int reg_parm_stack_space = 0;
3491 #ifdef REG_PARM_STACK_SPACE
3492 /* Define the boundary of the register parm stack space that needs to be
3494 int low_to_save = -1, high_to_save = 0;
3495 rtx save_area = 0; /* Place that it is saved. */
3498 /* Size of the stack reserved for parameter registers. */
3499 int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
3500 char *initial_stack_usage_map = stack_usage_map;
3502 #ifdef REG_PARM_STACK_SPACE
3503 #ifdef MAYBE_REG_PARM_STACK_SPACE
3504 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
3506 reg_parm_stack_space = REG_PARM_STACK_SPACE ((tree) 0);
3510 /* By default, library functions can not throw. */
3511 flags = ECF_NOTHROW;
3518 /* Nothing to do here. */
3520 case LCT_CONST_MAKE_BLOCK:
3523 case LCT_PURE_MAKE_BLOCK:
3527 flags |= ECF_NORETURN;
3530 flags = ECF_NORETURN;
3532 case LCT_ALWAYS_RETURN:
3533 flags = ECF_ALWAYS_RETURN;
3535 case LCT_RETURNS_TWICE:
3536 flags = ECF_RETURNS_TWICE;
3541 /* Ensure current function's preferred stack boundary is at least
3543 if (cfun->preferred_stack_boundary < PREFERRED_STACK_BOUNDARY)
3544 cfun->preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
3546 /* If this kind of value comes back in memory,
3547 decide where in memory it should come back. */
3548 if (outmode != VOIDmode && aggregate_value_p (type_for_mode (outmode, 0)))
3550 #ifdef PCC_STATIC_STRUCT_RETURN
3552 = hard_function_value (build_pointer_type (type_for_mode (outmode, 0)),
3554 mem_value = gen_rtx_MEM (outmode, pointer_reg);
3555 pcc_struct_value = 1;
3557 value = gen_reg_rtx (outmode);
3558 #else /* not PCC_STATIC_STRUCT_RETURN */
3559 struct_value_size = GET_MODE_SIZE (outmode);
3560 if (value != 0 && GET_CODE (value) == MEM)
3563 mem_value = assign_temp (type_for_mode (outmode, 0), 0, 1, 1);
3566 /* This call returns a big structure. */
3567 flags &= ~(ECF_CONST | ECF_PURE);
3570 /* ??? Unfinished: must pass the memory address as an argument. */
3572 /* Copy all the libcall-arguments out of the varargs data
3573 and into a vector ARGVEC.
3575 Compute how to pass each argument. We only support a very small subset
3576 of the full argument passing conventions to limit complexity here since
3577 library functions shouldn't have many args. */
3579 argvec = (struct arg *) alloca ((nargs + 1) * sizeof (struct arg));
3580 memset ((char *) argvec, 0, (nargs + 1) * sizeof (struct arg));
3582 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
3583 INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far, outmode, fun);
3585 INIT_CUMULATIVE_ARGS (args_so_far, NULL_TREE, fun, 0);
3588 args_size.constant = 0;
3593 /* Now we are about to start emitting insns that can be deleted
3594 if a libcall is deleted. */
3595 if (flags & (ECF_CONST | ECF_PURE))
3600 /* If there's a structure value address to be passed,
3601 either pass it in the special place, or pass it as an extra argument. */
3602 if (mem_value && struct_value_rtx == 0 && ! pcc_struct_value)
3604 rtx addr = XEXP (mem_value, 0);
3607 /* Make sure it is a reasonable operand for a move or push insn. */
3608 if (GET_CODE (addr) != REG && GET_CODE (addr) != MEM
3609 && ! (CONSTANT_P (addr) && LEGITIMATE_CONSTANT_P (addr)))
3610 addr = force_operand (addr, NULL_RTX);
3612 argvec[count].value = addr;
3613 argvec[count].mode = Pmode;
3614 argvec[count].partial = 0;
3616 argvec[count].reg = FUNCTION_ARG (args_so_far, Pmode, NULL_TREE, 1);
3617 #ifdef FUNCTION_ARG_PARTIAL_NREGS
3618 if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far, Pmode, NULL_TREE, 1))
3622 locate_and_pad_parm (Pmode, NULL_TREE,
3623 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3626 argvec[count].reg != 0,
3628 NULL_TREE, &args_size, &argvec[count].offset,
3629 &argvec[count].size, &alignment_pad);
3631 if (argvec[count].reg == 0 || argvec[count].partial != 0
3632 || reg_parm_stack_space > 0)
3633 args_size.constant += argvec[count].size.constant;
3635 FUNCTION_ARG_ADVANCE (args_so_far, Pmode, (tree) 0, 1);
3640 for (; count < nargs; count++)
3642 rtx val = va_arg (p, rtx);
3643 enum machine_mode mode = va_arg (p, enum machine_mode);
3645 /* We cannot convert the arg value to the mode the library wants here;
3646 must do it earlier where we know the signedness of the arg. */
3648 || (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode))
3651 /* On some machines, there's no way to pass a float to a library fcn.
3652 Pass it as a double instead. */
3653 #ifdef LIBGCC_NEEDS_DOUBLE
3654 if (LIBGCC_NEEDS_DOUBLE && mode == SFmode)
3655 val = convert_modes (DFmode, SFmode, val, 0), mode = DFmode;
3658 /* There's no need to call protect_from_queue, because
3659 either emit_move_insn or emit_push_insn will do that. */
3661 /* Make sure it is a reasonable operand for a move or push insn. */
3662 if (GET_CODE (val) != REG && GET_CODE (val) != MEM
3663 && ! (CONSTANT_P (val) && LEGITIMATE_CONSTANT_P (val)))
3664 val = force_operand (val, NULL_RTX);
3666 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
3667 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, mode, NULL_TREE, 1))
3671 #ifdef FUNCTION_ARG_CALLEE_COPIES
3672 && ! FUNCTION_ARG_CALLEE_COPIES (args_so_far, mode,
3677 if (GET_MODE (val) == MEM && ! must_copy)
3681 slot = assign_temp (type_for_mode (mode, 0), 0, 1, 1);
3682 emit_move_insn (slot, val);
3686 tree type = type_for_mode (mode, 0);
3688 slot = gen_rtx_MEM (mode,
3689 expand_expr (build1 (ADDR_EXPR,
3692 make_tree (type, val)),
3693 NULL_RTX, VOIDmode, 0));
3696 call_fusage = gen_rtx_EXPR_LIST (VOIDmode,
3697 gen_rtx_USE (VOIDmode, slot),
3700 call_fusage = gen_rtx_EXPR_LIST (VOIDmode,
3701 gen_rtx_CLOBBER (VOIDmode,
3706 val = force_operand (XEXP (slot, 0), NULL_RTX);
3710 argvec[count].value = val;
3711 argvec[count].mode = mode;
3713 argvec[count].reg = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
3715 #ifdef FUNCTION_ARG_PARTIAL_NREGS
3716 argvec[count].partial
3717 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, NULL_TREE, 1);
3719 argvec[count].partial = 0;
3722 locate_and_pad_parm (mode, NULL_TREE,
3723 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3726 argvec[count].reg != 0,
3728 NULL_TREE, &args_size, &argvec[count].offset,
3729 &argvec[count].size, &alignment_pad);
3731 if (argvec[count].size.var)
3734 if (reg_parm_stack_space == 0 && argvec[count].partial)
3735 argvec[count].size.constant -= argvec[count].partial * UNITS_PER_WORD;
3737 if (argvec[count].reg == 0 || argvec[count].partial != 0
3738 || reg_parm_stack_space > 0)
3739 args_size.constant += argvec[count].size.constant;
3741 FUNCTION_ARG_ADVANCE (args_so_far, mode, (tree) 0, 1);
3744 #ifdef FINAL_REG_PARM_STACK_SPACE
3745 reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant,
3748 /* If this machine requires an external definition for library
3749 functions, write one out. */
3750 assemble_external_libcall (fun);
3752 original_args_size = args_size;
3753 args_size.constant = (((args_size.constant
3754 + stack_pointer_delta
3758 - stack_pointer_delta);
3760 args_size.constant = MAX (args_size.constant,
3761 reg_parm_stack_space);
3763 #ifndef OUTGOING_REG_PARM_STACK_SPACE
3764 args_size.constant -= reg_parm_stack_space;
3767 if (args_size.constant > current_function_outgoing_args_size)
3768 current_function_outgoing_args_size = args_size.constant;
3770 if (ACCUMULATE_OUTGOING_ARGS)
3772 /* Since the stack pointer will never be pushed, it is possible for
3773 the evaluation of a parm to clobber something we have already
3774 written to the stack. Since most function calls on RISC machines
3775 do not use the stack, this is uncommon, but must work correctly.
3777 Therefore, we save any area of the stack that was already written
3778 and that we are using. Here we set up to do this by making a new
3779 stack usage map from the old one.
3781 Another approach might be to try to reorder the argument
3782 evaluations to avoid this conflicting stack usage. */
3784 needed = args_size.constant;
3786 #ifndef OUTGOING_REG_PARM_STACK_SPACE
3787 /* Since we will be writing into the entire argument area, the
3788 map must be allocated for its entire size, not just the part that
3789 is the responsibility of the caller. */
3790 needed += reg_parm_stack_space;
3793 #ifdef ARGS_GROW_DOWNWARD
3794 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
3797 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
3800 stack_usage_map = (char *) alloca (highest_outgoing_arg_in_use);
3802 if (initial_highest_arg_in_use)
3803 memcpy (stack_usage_map, initial_stack_usage_map,
3804 initial_highest_arg_in_use);
3806 if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
3807 memset (&stack_usage_map[initial_highest_arg_in_use], 0,
3808 highest_outgoing_arg_in_use - initial_highest_arg_in_use);
3811 /* We must be careful to use virtual regs before they're instantiated,
3812 and real regs afterwards. Loop optimization, for example, can create
3813 new libcalls after we've instantiated the virtual regs, and if we
3814 use virtuals anyway, they won't match the rtl patterns. */
3816 if (virtuals_instantiated)
3817 argblock = plus_constant (stack_pointer_rtx, STACK_POINTER_OFFSET);
3819 argblock = virtual_outgoing_args_rtx;
3824 argblock = push_block (GEN_INT (args_size.constant), 0, 0);
3827 /* If we push args individually in reverse order, perform stack alignment
3828 before the first push (the last arg). */
3829 if (argblock == 0 && PUSH_ARGS_REVERSED)
3830 anti_adjust_stack (GEN_INT (args_size.constant
3831 - original_args_size.constant));
3833 if (PUSH_ARGS_REVERSED)
3844 #ifdef REG_PARM_STACK_SPACE
3845 if (ACCUMULATE_OUTGOING_ARGS)
3847 /* The argument list is the property of the called routine and it
3848 may clobber it. If the fixed area has been used for previous
3849 parameters, we must save and restore it.
3851 Here we compute the boundary of the that needs to be saved, if any. */
3853 #ifdef ARGS_GROW_DOWNWARD
3854 for (count = 0; count < reg_parm_stack_space + 1; count++)
3856 for (count = 0; count < reg_parm_stack_space; count++)
3859 if (count >= highest_outgoing_arg_in_use
3860 || stack_usage_map[count] == 0)
3863 if (low_to_save == -1)
3864 low_to_save = count;
3866 high_to_save = count;
3869 if (low_to_save >= 0)
3871 int num_to_save = high_to_save - low_to_save + 1;
3872 enum machine_mode save_mode
3873 = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1);
3876 /* If we don't have the required alignment, must do this in BLKmode. */
3877 if ((low_to_save & (MIN (GET_MODE_SIZE (save_mode),
3878 BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1)))
3879 save_mode = BLKmode;
3881 #ifdef ARGS_GROW_DOWNWARD
3882 stack_area = gen_rtx_MEM (save_mode,
3883 memory_address (save_mode,
3884 plus_constant (argblock,
3887 stack_area = gen_rtx_MEM (save_mode,
3888 memory_address (save_mode,
3889 plus_constant (argblock,
3892 if (save_mode == BLKmode)
3894 save_area = assign_stack_temp (BLKmode, num_to_save, 0);
3895 set_mem_align (save_area, PARM_BOUNDARY);
3896 emit_block_move (validize_mem (save_area), stack_area,
3897 GEN_INT (num_to_save));
3901 save_area = gen_reg_rtx (save_mode);
3902 emit_move_insn (save_area, stack_area);
3908 /* Push the args that need to be pushed. */
3910 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3911 are to be pushed. */
3912 for (count = 0; count < nargs; count++, argnum += inc)
3914 enum machine_mode mode = argvec[argnum].mode;
3915 rtx val = argvec[argnum].value;
3916 rtx reg = argvec[argnum].reg;
3917 int partial = argvec[argnum].partial;
3918 int lower_bound = 0, upper_bound = 0, i;
3920 if (! (reg != 0 && partial == 0))
3922 if (ACCUMULATE_OUTGOING_ARGS)
3924 /* If this is being stored into a pre-allocated, fixed-size,
3925 stack area, save any previous data at that location. */
3927 #ifdef ARGS_GROW_DOWNWARD
3928 /* stack_slot is negative, but we want to index stack_usage_map
3929 with positive values. */
3930 upper_bound = -argvec[argnum].offset.constant + 1;
3931 lower_bound = upper_bound - argvec[argnum].size.constant;
3933 lower_bound = argvec[argnum].offset.constant;
3934 upper_bound = lower_bound + argvec[argnum].size.constant;
3937 for (i = lower_bound; i < upper_bound; i++)
3938 if (stack_usage_map[i]
3939 /* Don't store things in the fixed argument area at this
3940 point; it has already been saved. */
3941 && i > reg_parm_stack_space)
3944 if (i != upper_bound)
3946 /* We need to make a save area. See what mode we can make
3948 enum machine_mode save_mode
3949 = mode_for_size (argvec[argnum].size.constant
3957 plus_constant (argblock,
3958 argvec[argnum].offset.constant)));
3959 argvec[argnum].save_area = gen_reg_rtx (save_mode);
3961 emit_move_insn (argvec[argnum].save_area, stack_area);
3965 emit_push_insn (val, mode, NULL_TREE, NULL_RTX, 0, partial, reg, 0,
3966 argblock, GEN_INT (argvec[argnum].offset.constant),
3967 reg_parm_stack_space, ARGS_SIZE_RTX (alignment_pad));
3969 /* Now mark the segment we just used. */
3970 if (ACCUMULATE_OUTGOING_ARGS)
3971 for (i = lower_bound; i < upper_bound; i++)
3972 stack_usage_map[i] = 1;
3978 /* If we pushed args in forward order, perform stack alignment
3979 after pushing the last arg. */
3980 if (argblock == 0 && !PUSH_ARGS_REVERSED)
3981 anti_adjust_stack (GEN_INT (args_size.constant
3982 - original_args_size.constant));
3984 if (PUSH_ARGS_REVERSED)
3989 fun = prepare_call_address (fun, NULL_TREE, &call_fusage, 0, 0);
3991 /* Now load any reg parms into their regs. */
3993 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3994 are to be pushed. */
3995 for (count = 0; count < nargs; count++, argnum += inc)
3997 rtx val = argvec[argnum].value;
3998 rtx reg = argvec[argnum].reg;
3999 int partial = argvec[argnum].partial;
4001 /* Handle calls that pass values in multiple non-contiguous
4002 locations. The PA64 has examples of this for library calls. */
4003 if (reg != 0 && GET_CODE (reg) == PARALLEL)
4004 emit_group_load (reg, val, GET_MODE_SIZE (GET_MODE (val)));
4005 else if (reg != 0 && partial == 0)
4006 emit_move_insn (reg, val);
4011 /* Any regs containing parms remain in use through the call. */
4012 for (count = 0; count < nargs; count++)
4014 rtx reg = argvec[count].reg;
4015 if (reg != 0 && GET_CODE (reg) == PARALLEL)
4016 use_group_regs (&call_fusage, reg);
4018 use_reg (&call_fusage, reg);
4021 /* Pass the function the address in which to return a structure value. */
4022 if (mem_value != 0 && struct_value_rtx != 0 && ! pcc_struct_value)
4024 emit_move_insn (struct_value_rtx,
4026 force_operand (XEXP (mem_value, 0),
4028 if (GET_CODE (struct_value_rtx) == REG)
4029 use_reg (&call_fusage, struct_value_rtx);
4032 /* Don't allow popping to be deferred, since then
4033 cse'ing of library calls could delete a call and leave the pop. */
4035 valreg = (mem_value == 0 && outmode != VOIDmode
4036 ? hard_libcall_value (outmode) : NULL_RTX);
4038 /* Stack must be properly aligned now. */
4039 if (stack_pointer_delta & (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT - 1))
4042 before_call = get_last_insn ();
4044 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4045 will set inhibit_defer_pop to that value. */
4046 /* The return type is needed to decide how many bytes the function pops.
4047 Signedness plays no role in that, so for simplicity, we pretend it's
4048 always signed. We also assume that the list of arguments passed has
4049 no impact, so we pretend it is unknown. */
4052 get_identifier (XSTR (orgfun, 0)),
4053 build_function_type (outmode == VOIDmode ? void_type_node
4054 : type_for_mode (outmode, 0), NULL_TREE),
4055 original_args_size.constant, args_size.constant,
4057 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1),
4059 old_inhibit_defer_pop + 1, call_fusage, flags);
4061 /* For calls to `setjmp', etc., inform flow.c it should complain
4062 if nonvolatile values are live. For functions that cannot return,
4063 inform flow that control does not fall through. */
4065 if (flags & (ECF_NORETURN | ECF_LONGJMP))
4067 /* The barrier note must be emitted
4068 immediately after the CALL_INSN. Some ports emit more than
4069 just a CALL_INSN above, so we must search for it here. */
4071 rtx last = get_last_insn ();
4072 while (GET_CODE (last) != CALL_INSN)
4074 last = PREV_INSN (last);
4075 /* There was no CALL_INSN? */
4076 if (last == before_call)
4080 emit_barrier_after (last);
4083 /* Now restore inhibit_defer_pop to its actual original value. */
4086 /* If call is cse'able, make appropriate pair of reg-notes around it.
4087 Test valreg so we don't crash; may safely ignore `const'
4088 if return type is void. Disable for PARALLEL return values, because
4089 we have no way to move such values into a pseudo register. */
4090 if ((flags & (ECF_CONST | ECF_PURE))
4091 && valreg != 0 && GET_CODE (valreg) != PARALLEL)
4094 rtx temp = gen_reg_rtx (GET_MODE (valreg));
4098 /* Construct an "equal form" for the value which mentions all the
4099 arguments in order as well as the function name. */
4100 for (i = 0; i < nargs; i++)
4101 note = gen_rtx_EXPR_LIST (VOIDmode, argvec[i].value, note);
4102 note = gen_rtx_EXPR_LIST (VOIDmode, fun, note);
4104 insns = get_insns ();
4107 if (flags & ECF_PURE)
4108 note = gen_rtx_EXPR_LIST (VOIDmode,
4109 gen_rtx_USE (VOIDmode,
4110 gen_rtx_MEM (BLKmode,
4111 gen_rtx_SCRATCH (VOIDmode))), note);
4113 emit_libcall_block (insns, temp, valreg, note);
4117 else if (flags & (ECF_CONST | ECF_PURE))
4119 /* Otherwise, just write out the sequence without a note. */
4120 rtx insns = get_insns ();
4127 /* Copy the value to the right place. */
4128 if (outmode != VOIDmode && retval)
4134 if (value != mem_value)
4135 emit_move_insn (value, mem_value);
4137 else if (value != 0)
4138 emit_move_insn (value, hard_libcall_value (outmode));
4140 value = hard_libcall_value (outmode);
4143 if (ACCUMULATE_OUTGOING_ARGS)
4145 #ifdef REG_PARM_STACK_SPACE
4148 enum machine_mode save_mode = GET_MODE (save_area);
4149 #ifdef ARGS_GROW_DOWNWARD
4151 = gen_rtx_MEM (save_mode,
4152 memory_address (save_mode,
4153 plus_constant (argblock,
4157 = gen_rtx_MEM (save_mode,
4158 memory_address (save_mode,
4159 plus_constant (argblock, low_to_save)));
4162 set_mem_align (stack_area, PARM_BOUNDARY);
4163 if (save_mode != BLKmode)
4164 emit_move_insn (stack_area, save_area);
4166 emit_block_move (stack_area, validize_mem (save_area),
4167 GEN_INT (high_to_save - low_to_save + 1));
4171 /* If we saved any argument areas, restore them. */
4172 for (count = 0; count < nargs; count++)
4173 if (argvec[count].save_area)
4175 enum machine_mode save_mode = GET_MODE (argvec[count].save_area);
4177 = gen_rtx_MEM (save_mode,
4180 plus_constant (argblock,
4181 argvec[count].offset.constant)));
4183 emit_move_insn (stack_area, argvec[count].save_area);
4186 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
4187 stack_usage_map = initial_stack_usage_map;
4194 /* Output a library call to function FUN (a SYMBOL_REF rtx)
4195 (emitting the queue unless NO_QUEUE is nonzero),
4196 for a value of mode OUTMODE,
4197 with NARGS different arguments, passed as alternating rtx values
4198 and machine_modes to convert them to.
4199 The rtx values should have been passed through protect_from_queue already.
4201 FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for `const'
4202 calls, LCT_PURE for `pure' calls, LCT_CONST_MAKE_BLOCK for `const' calls
4203 which should be enclosed in REG_LIBCALL/REG_RETVAL notes,
4204 LCT_PURE_MAKE_BLOCK for `purep' calls which should be enclosed in
4205 REG_LIBCALL/REG_RETVAL notes with extra (use (memory (scratch)),
4206 or other LCT_ value for other types of library calls. */
4209 emit_library_call VPARAMS((rtx orgfun, enum libcall_type fn_type,
4210 enum machine_mode outmode, int nargs, ...))
4213 VA_FIXEDARG (p, rtx, orgfun);
4214 VA_FIXEDARG (p, int, fn_type);
4215 VA_FIXEDARG (p, enum machine_mode, outmode);
4216 VA_FIXEDARG (p, int, nargs);
4218 emit_library_call_value_1 (0, orgfun, NULL_RTX, fn_type, outmode, nargs, p);
4223 /* Like emit_library_call except that an extra argument, VALUE,
4224 comes second and says where to store the result.
4225 (If VALUE is zero, this function chooses a convenient way
4226 to return the value.
4228 This function returns an rtx for where the value is to be found.
4229 If VALUE is nonzero, VALUE is returned. */
4232 emit_library_call_value VPARAMS((rtx orgfun, rtx value,
4233 enum libcall_type fn_type,
4234 enum machine_mode outmode, int nargs, ...))
4239 VA_FIXEDARG (p, rtx, orgfun);
4240 VA_FIXEDARG (p, rtx, value);
4241 VA_FIXEDARG (p, int, fn_type);
4242 VA_FIXEDARG (p, enum machine_mode, outmode);
4243 VA_FIXEDARG (p, int, nargs);
4245 result = emit_library_call_value_1 (1, orgfun, value, fn_type, outmode,
4253 /* Store a single argument for a function call
4254 into the register or memory area where it must be passed.
4255 *ARG describes the argument value and where to pass it.
4257 ARGBLOCK is the address of the stack-block for all the arguments,
4258 or 0 on a machine where arguments are pushed individually.
4260 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
4261 so must be careful about how the stack is used.
4263 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
4264 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
4265 that we need not worry about saving and restoring the stack.
4267 FNDECL is the declaration of the function we are calling.
4269 Return non-zero if this arg should cause sibcall failure,
4273 store_one_arg (arg, argblock, flags, variable_size, reg_parm_stack_space)
4274 struct arg_data *arg;
4277 int variable_size ATTRIBUTE_UNUSED;
4278 int reg_parm_stack_space;
4280 tree pval = arg->tree_value;
4284 int i, lower_bound = 0, upper_bound = 0;
4285 int sibcall_failure = 0;
4287 if (TREE_CODE (pval) == ERROR_MARK)
4290 /* Push a new temporary level for any temporaries we make for
4294 if (ACCUMULATE_OUTGOING_ARGS && !(flags & ECF_SIBCALL))
4296 /* If this is being stored into a pre-allocated, fixed-size, stack area,
4297 save any previous data at that location. */
4298 if (argblock && ! variable_size && arg->stack)
4300 #ifdef ARGS_GROW_DOWNWARD
4301 /* stack_slot is negative, but we want to index stack_usage_map
4302 with positive values. */
4303 if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
4304 upper_bound = -INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1)) + 1;
4308 lower_bound = upper_bound - arg->size.constant;
4310 if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
4311 lower_bound = INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1));
4315 upper_bound = lower_bound + arg->size.constant;
4318 for (i = lower_bound; i < upper_bound; i++)
4319 if (stack_usage_map[i]
4320 /* Don't store things in the fixed argument area at this point;
4321 it has already been saved. */
4322 && i > reg_parm_stack_space)
4325 if (i != upper_bound)
4327 /* We need to make a save area. See what mode we can make it. */
4328 enum machine_mode save_mode
4329 = mode_for_size (arg->size.constant * BITS_PER_UNIT, MODE_INT, 1);
4331 = gen_rtx_MEM (save_mode,
4332 memory_address (save_mode,
4333 XEXP (arg->stack_slot, 0)));
4335 if (save_mode == BLKmode)
4337 tree ot = TREE_TYPE (arg->tree_value);
4338 tree nt = build_qualified_type (ot, (TYPE_QUALS (ot)
4339 | TYPE_QUAL_CONST));
4341 arg->save_area = assign_temp (nt, 0, 1, 1);
4342 preserve_temp_slots (arg->save_area);
4343 emit_block_move (validize_mem (arg->save_area), stack_area,
4344 expr_size (arg->tree_value));
4348 arg->save_area = gen_reg_rtx (save_mode);
4349 emit_move_insn (arg->save_area, stack_area);
4353 /* Now that we have saved any slots that will be overwritten by this
4354 store, mark all slots this store will use. We must do this before
4355 we actually expand the argument since the expansion itself may
4356 trigger library calls which might need to use the same stack slot. */
4357 if (argblock && ! variable_size && arg->stack)
4358 for (i = lower_bound; i < upper_bound; i++)
4359 stack_usage_map[i] = 1;
4362 /* If this isn't going to be placed on both the stack and in registers,
4363 set up the register and number of words. */
4364 if (! arg->pass_on_stack)
4365 reg = arg->reg, partial = arg->partial;
4367 if (reg != 0 && partial == 0)
4368 /* Being passed entirely in a register. We shouldn't be called in
4372 /* If this arg needs special alignment, don't load the registers
4374 if (arg->n_aligned_regs != 0)
4377 /* If this is being passed partially in a register, we can't evaluate
4378 it directly into its stack slot. Otherwise, we can. */
4379 if (arg->value == 0)
4381 /* stack_arg_under_construction is nonzero if a function argument is
4382 being evaluated directly into the outgoing argument list and
4383 expand_call must take special action to preserve the argument list
4384 if it is called recursively.
4386 For scalar function arguments stack_usage_map is sufficient to
4387 determine which stack slots must be saved and restored. Scalar
4388 arguments in general have pass_on_stack == 0.
4390 If this argument is initialized by a function which takes the
4391 address of the argument (a C++ constructor or a C function
4392 returning a BLKmode structure), then stack_usage_map is
4393 insufficient and expand_call must push the stack around the
4394 function call. Such arguments have pass_on_stack == 1.
4396 Note that it is always safe to set stack_arg_under_construction,
4397 but this generates suboptimal code if set when not needed. */
4399 if (arg->pass_on_stack)
4400 stack_arg_under_construction++;
4402 arg->value = expand_expr (pval,
4404 || TYPE_MODE (TREE_TYPE (pval)) != arg->mode)
4405 ? NULL_RTX : arg->stack,
4408 /* If we are promoting object (or for any other reason) the mode
4409 doesn't agree, convert the mode. */
4411 if (arg->mode != TYPE_MODE (TREE_TYPE (pval)))
4412 arg->value = convert_modes (arg->mode, TYPE_MODE (TREE_TYPE (pval)),
4413 arg->value, arg->unsignedp);
4415 if (arg->pass_on_stack)
4416 stack_arg_under_construction--;
4419 /* Don't allow anything left on stack from computation
4420 of argument to alloca. */
4421 if (flags & ECF_MAY_BE_ALLOCA)
4422 do_pending_stack_adjust ();
4424 if (arg->value == arg->stack)
4426 /* If the value is already in the stack slot, we are done. */
4427 if (current_function_check_memory_usage && GET_CODE (arg->stack) == MEM)
4429 emit_library_call (chkr_set_right_libfunc, LCT_CONST_MAKE_BLOCK,
4430 VOIDmode, 3, XEXP (arg->stack, 0), Pmode,
4431 ARGS_SIZE_RTX (arg->size),
4432 TYPE_MODE (sizetype),
4433 GEN_INT (MEMORY_USE_RW),
4434 TYPE_MODE (integer_type_node));
4437 else if (arg->mode != BLKmode)
4441 /* Argument is a scalar, not entirely passed in registers.
4442 (If part is passed in registers, arg->partial says how much
4443 and emit_push_insn will take care of putting it there.)
4445 Push it, and if its size is less than the
4446 amount of space allocated to it,
4447 also bump stack pointer by the additional space.
4448 Note that in C the default argument promotions
4449 will prevent such mismatches. */
4451 size = GET_MODE_SIZE (arg->mode);
4452 /* Compute how much space the push instruction will push.
4453 On many machines, pushing a byte will advance the stack
4454 pointer by a halfword. */
4455 #ifdef PUSH_ROUNDING
4456 size = PUSH_ROUNDING (size);
4460 /* Compute how much space the argument should get:
4461 round up to a multiple of the alignment for arguments. */
4462 if (none != FUNCTION_ARG_PADDING (arg->mode, TREE_TYPE (pval)))
4463 used = (((size + PARM_BOUNDARY / BITS_PER_UNIT - 1)
4464 / (PARM_BOUNDARY / BITS_PER_UNIT))
4465 * (PARM_BOUNDARY / BITS_PER_UNIT));
4467 /* This isn't already where we want it on the stack, so put it there.
4468 This can either be done with push or copy insns. */
4469 emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), NULL_RTX, 0,
4470 partial, reg, used - size, argblock,
4471 ARGS_SIZE_RTX (arg->offset), reg_parm_stack_space,
4472 ARGS_SIZE_RTX (arg->alignment_pad));
4476 /* BLKmode, at least partly to be pushed. */
4481 /* Pushing a nonscalar.
4482 If part is passed in registers, PARTIAL says how much
4483 and emit_push_insn will take care of putting it there. */
4485 /* Round its size up to a multiple
4486 of the allocation unit for arguments. */
4488 if (arg->size.var != 0)
4491 size_rtx = ARGS_SIZE_RTX (arg->size);
4495 /* PUSH_ROUNDING has no effect on us, because
4496 emit_push_insn for BLKmode is careful to avoid it. */
4497 excess = (arg->size.constant - int_size_in_bytes (TREE_TYPE (pval))
4498 + partial * UNITS_PER_WORD);
4499 size_rtx = expr_size (pval);
4502 if ((flags & ECF_SIBCALL) && GET_CODE (arg->value) == MEM)
4504 /* emit_push_insn might not work properly if arg->value and
4505 argblock + arg->offset areas overlap. */
4509 if (XEXP (x, 0) == current_function_internal_arg_pointer
4510 || (GET_CODE (XEXP (x, 0)) == PLUS
4511 && XEXP (XEXP (x, 0), 0) ==
4512 current_function_internal_arg_pointer
4513 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT))
4515 if (XEXP (x, 0) != current_function_internal_arg_pointer)
4516 i = INTVAL (XEXP (XEXP (x, 0), 1));
4518 /* expand_call should ensure this */
4519 if (arg->offset.var || GET_CODE (size_rtx) != CONST_INT)
4522 if (arg->offset.constant > i)
4524 if (arg->offset.constant < i + INTVAL (size_rtx))
4525 sibcall_failure = 1;
4527 else if (arg->offset.constant < i)
4529 if (i < arg->offset.constant + INTVAL (size_rtx))
4530 sibcall_failure = 1;
4535 /* Special handling is required if part of the parameter lies in the
4536 register parameter area. The argument may be copied into the stack
4537 slot using memcpy(), but the original contents of the register
4538 parameter area will be restored after the memcpy() call.
4540 To ensure that the part that lies in the register parameter area
4541 is copied correctly, we emit a separate push for that part. This
4542 push should be small enough to avoid a call to memcpy(). */
4543 #ifndef STACK_PARMS_IN_REG_PARM_AREA
4544 if (arg->reg && arg->pass_on_stack)
4549 if (arg->offset.constant < reg_parm_stack_space && arg->offset.var)
4550 error ("variable offset is passed partially in stack and in reg");
4551 else if (arg->offset.constant < reg_parm_stack_space && arg->size.var)
4552 error ("variable size is passed partially in stack and in reg");
4553 else if (arg->offset.constant < reg_parm_stack_space
4554 && ((arg->offset.constant + arg->size.constant)
4555 > reg_parm_stack_space))
4557 rtx size_rtx1 = GEN_INT (reg_parm_stack_space - arg->offset.constant);
4558 emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), size_rtx1,
4559 TYPE_ALIGN (TREE_TYPE (pval)), partial, reg,
4560 excess, argblock, ARGS_SIZE_RTX (arg->offset),
4561 reg_parm_stack_space,
4562 ARGS_SIZE_RTX (arg->alignment_pad));
4567 emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), size_rtx,
4568 TYPE_ALIGN (TREE_TYPE (pval)), partial, reg, excess,
4569 argblock, ARGS_SIZE_RTX (arg->offset),
4570 reg_parm_stack_space,
4571 ARGS_SIZE_RTX (arg->alignment_pad));
4574 /* Unless this is a partially-in-register argument, the argument is now
4577 ??? Note that this can change arg->value from arg->stack to
4578 arg->stack_slot and it matters when they are not the same.
4579 It isn't totally clear that this is correct in all cases. */
4581 arg->value = arg->stack_slot;
4583 /* Once we have pushed something, pops can't safely
4584 be deferred during the rest of the arguments. */
4587 /* ANSI doesn't require a sequence point here,
4588 but PCC has one, so this will avoid some problems. */
4591 /* Free any temporary slots made in processing this argument. Show
4592 that we might have taken the address of something and pushed that
4594 preserve_temp_slots (NULL_RTX);
4598 return sibcall_failure;