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 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
30 #include "insn-flags.h"
37 #ifndef ACCUMULATE_OUTGOING_ARGS
38 #define ACCUMULATE_OUTGOING_ARGS 0
41 /* Supply a default definition for PUSH_ARGS. */
44 #define PUSH_ARGS !ACCUMULATE_OUTGOING_ARGS
50 #if !defined FUNCTION_OK_FOR_SIBCALL
51 #define FUNCTION_OK_FOR_SIBCALL(DECL) 1
54 #if !defined PREFERRED_STACK_BOUNDARY && defined STACK_BOUNDARY
55 #define PREFERRED_STACK_BOUNDARY STACK_BOUNDARY
58 /* Decide whether a function's arguments should be processed
59 from first to last or from last to first.
61 They should if the stack and args grow in opposite directions, but
62 only if we have push insns. */
66 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
67 #define PUSH_ARGS_REVERSED PUSH_ARGS
72 #ifndef PUSH_ARGS_REVERSED
73 #define PUSH_ARGS_REVERSED 0
76 /* Like PREFERRED_STACK_BOUNDARY but in units of bytes, not bits. */
77 #define STACK_BYTES (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)
79 /* Data structure and subroutines used within expand_call. */
83 /* Tree node for this argument. */
85 /* Mode for value; TYPE_MODE unless promoted. */
86 enum machine_mode mode;
87 /* Current RTL value for argument, or 0 if it isn't precomputed. */
89 /* Initially-compute RTL value for argument; only for const functions. */
91 /* Register to pass this argument in, 0 if passed on stack, or an
92 PARALLEL if the arg is to be copied into multiple non-contiguous
95 /* Register to pass this argument in when generating tail call sequence.
96 This is not the same register as for normal calls on machines with
99 /* If REG was promoted from the actual mode of the argument expression,
100 indicates whether the promotion is sign- or zero-extended. */
102 /* Number of registers to use. 0 means put the whole arg in registers.
103 Also 0 if not passed in registers. */
105 /* Non-zero if argument must be passed on stack.
106 Note that some arguments may be passed on the stack
107 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
108 pass_on_stack identifies arguments that *cannot* go in registers. */
110 /* Offset of this argument from beginning of stack-args. */
111 struct args_size offset;
112 /* Similar, but offset to the start of the stack slot. Different from
113 OFFSET if this arg pads downward. */
114 struct args_size slot_offset;
115 /* Size of this argument on the stack, rounded up for any padding it gets,
116 parts of the argument passed in registers do not count.
117 If REG_PARM_STACK_SPACE is defined, then register parms
118 are counted here as well. */
119 struct args_size size;
120 /* Location on the stack at which parameter should be stored. The store
121 has already been done if STACK == VALUE. */
123 /* Location on the stack of the start of this argument slot. This can
124 differ from STACK if this arg pads downward. This location is known
125 to be aligned to FUNCTION_ARG_BOUNDARY. */
127 /* Place that this stack area has been saved, if needed. */
129 /* If an argument's alignment does not permit direct copying into registers,
130 copy in smaller-sized pieces into pseudos. These are stored in a
131 block pointed to by this field. The next field says how many
132 word-sized pseudos we made. */
135 /* The amount that the stack pointer needs to be adjusted to
136 force alignment for the next argument. */
137 struct args_size alignment_pad;
140 /* A vector of one char per byte of stack space. A byte if non-zero if
141 the corresponding stack location has been used.
142 This vector is used to prevent a function call within an argument from
143 clobbering any stack already set up. */
144 static char *stack_usage_map;
146 /* Size of STACK_USAGE_MAP. */
147 static int highest_outgoing_arg_in_use;
149 /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
150 stack location's tail call argument has been already stored into the stack.
151 This bitmap is used to prevent sibling call optimization if function tries
152 to use parent's incoming argument slots when they have been already
153 overwritten with tail call arguments. */
154 static sbitmap stored_args_map;
156 /* stack_arg_under_construction is nonzero when an argument may be
157 initialized with a constructor call (including a C function that
158 returns a BLKmode struct) and expand_call must take special action
159 to make sure the object being constructed does not overlap the
160 argument list for the constructor call. */
161 int stack_arg_under_construction;
163 static int calls_function PARAMS ((tree, int));
164 static int calls_function_1 PARAMS ((tree, int));
166 /* Nonzero if this is a call to a `const' function. */
168 /* Nonzero if this is a call to a `volatile' function. */
169 #define ECF_NORETURN 2
170 /* Nonzero if this is a call to malloc or a related function. */
172 /* Nonzero if it is plausible that this is a call to alloca. */
173 #define ECF_MAY_BE_ALLOCA 8
174 /* Nonzero if this is a call to a function that won't throw an exception. */
175 #define ECF_NOTHROW 16
176 /* Nonzero if this is a call to setjmp or a related function. */
177 #define ECF_RETURNS_TWICE 32
178 /* Nonzero if this is a call to `longjmp'. */
179 #define ECF_LONGJMP 64
180 /* Nonzero if this is a syscall that makes a new process in the image of
182 #define ECF_FORK_OR_EXEC 128
183 #define ECF_SIBCALL 256
184 /* Nonzero if this is a call to "pure" function (like const function,
185 but may read memory. */
187 /* Nonzero if this is a call to a function that returns with the stack
188 pointer depressed. */
189 #define ECF_SP_DEPRESSED 1024
191 static void emit_call_1 PARAMS ((rtx, tree, tree, HOST_WIDE_INT,
192 HOST_WIDE_INT, HOST_WIDE_INT, rtx,
193 rtx, int, rtx, int));
194 static void precompute_register_parameters PARAMS ((int,
197 static int store_one_arg PARAMS ((struct arg_data *, rtx, int, int,
199 static void store_unaligned_arguments_into_pseudos PARAMS ((struct arg_data *,
201 static int finalize_must_preallocate PARAMS ((int, int,
203 struct args_size *));
204 static void precompute_arguments PARAMS ((int, int,
206 static int compute_argument_block_size PARAMS ((int,
209 static void initialize_argument_information PARAMS ((int,
216 static void compute_argument_addresses PARAMS ((struct arg_data *,
218 static rtx rtx_for_function_call PARAMS ((tree, tree));
219 static void load_register_parameters PARAMS ((struct arg_data *,
221 static int libfunc_nothrow PARAMS ((rtx));
222 static rtx emit_library_call_value_1 PARAMS ((int, rtx, rtx,
226 static int special_function_p PARAMS ((tree, int));
227 static int flags_from_decl_or_type PARAMS ((tree));
228 static rtx try_to_integrate PARAMS ((tree, tree, rtx,
230 static int check_sibcall_argument_overlap_1 PARAMS ((rtx));
231 static int check_sibcall_argument_overlap PARAMS ((rtx, struct arg_data *));
233 static int combine_pending_stack_adjustment_and_call
234 PARAMS ((int, struct args_size *, int));
236 #ifdef REG_PARM_STACK_SPACE
237 static rtx save_fixed_argument_area PARAMS ((int, rtx, int *, int *));
238 static void restore_fixed_argument_area PARAMS ((rtx, rtx, int, int));
241 /* If WHICH is 1, return 1 if EXP contains a call to the built-in function
244 If WHICH is 0, return 1 if EXP contains a call to any function.
245 Actually, we only need return 1 if evaluating EXP would require pushing
246 arguments on the stack, but that is too difficult to compute, so we just
247 assume any function call might require the stack. */
249 static tree calls_function_save_exprs;
252 calls_function (exp, which)
258 calls_function_save_exprs = 0;
259 val = calls_function_1 (exp, which);
260 calls_function_save_exprs = 0;
264 /* Recursive function to do the work of above function. */
267 calls_function_1 (exp, which)
272 enum tree_code code = TREE_CODE (exp);
273 int class = TREE_CODE_CLASS (code);
274 int length = first_rtl_op (code);
276 /* If this code is language-specific, we don't know what it will do. */
277 if ((int) code >= NUM_TREE_CODES)
285 else if ((TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
287 && (TYPE_RETURNS_STACK_DEPRESSED
288 (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))))
290 else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
291 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
293 && (special_function_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
295 & ECF_MAY_BE_ALLOCA))
301 if (SAVE_EXPR_RTL (exp) != 0)
303 if (value_member (exp, calls_function_save_exprs))
305 calls_function_save_exprs = tree_cons (NULL_TREE, exp,
306 calls_function_save_exprs);
307 return (TREE_OPERAND (exp, 0) != 0
308 && calls_function_1 (TREE_OPERAND (exp, 0), which));
313 register tree subblock;
315 for (local = BLOCK_VARS (exp); local; local = TREE_CHAIN (local))
316 if (DECL_INITIAL (local) != 0
317 && calls_function_1 (DECL_INITIAL (local), which))
320 for (subblock = BLOCK_SUBBLOCKS (exp);
322 subblock = TREE_CHAIN (subblock))
323 if (calls_function_1 (subblock, which))
329 for (; exp != 0; exp = TREE_CHAIN (exp))
330 if (calls_function_1 (TREE_VALUE (exp), which))
338 /* Only expressions, references, and blocks can contain calls. */
339 if (! IS_EXPR_CODE_CLASS (class) && class != 'r' && class != 'b')
342 for (i = 0; i < length; i++)
343 if (TREE_OPERAND (exp, i) != 0
344 && calls_function_1 (TREE_OPERAND (exp, i), which))
350 /* Force FUNEXP into a form suitable for the address of a CALL,
351 and return that as an rtx. Also load the static chain register
352 if FNDECL is a nested function.
354 CALL_FUSAGE points to a variable holding the prospective
355 CALL_INSN_FUNCTION_USAGE information. */
358 prepare_call_address (funexp, fndecl, call_fusage, reg_parm_seen)
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;
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 && (RETURN_POPS_ARGS (fndecl, funtype, stack_size) > 0
479 rtx n_pop = GEN_INT (RETURN_POPS_ARGS (fndecl, funtype, stack_size));
482 /* If this subroutine pops its own args, record that in the call insn
483 if possible, for the sake of frame pointer elimination. */
486 pat = GEN_SIBCALL_VALUE_POP (valreg,
487 gen_rtx_MEM (FUNCTION_MODE, funexp),
488 rounded_stack_size_rtx, next_arg_reg,
491 pat = GEN_SIBCALL_POP (gen_rtx_MEM (FUNCTION_MODE, funexp),
492 rounded_stack_size_rtx, next_arg_reg, n_pop);
494 emit_call_insn (pat);
500 #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop)
501 /* If the target has "call" or "call_value" insns, then prefer them
502 if no arguments are actually popped. If the target does not have
503 "call" or "call_value" insns, then we must use the popping versions
504 even if the call has no arguments to pop. */
505 #if defined (HAVE_call) && defined (HAVE_call_value)
506 if (HAVE_call && HAVE_call_value && HAVE_call_pop && HAVE_call_value_pop
507 && n_popped > 0 && ! (ecf_flags & ECF_SP_DEPRESSED))
509 if (HAVE_call_pop && HAVE_call_value_pop)
512 rtx n_pop = GEN_INT (n_popped);
515 /* If this subroutine pops its own args, record that in the call insn
516 if possible, for the sake of frame pointer elimination. */
519 pat = GEN_CALL_VALUE_POP (valreg,
520 gen_rtx_MEM (FUNCTION_MODE, funexp),
521 rounded_stack_size_rtx, next_arg_reg, n_pop);
523 pat = GEN_CALL_POP (gen_rtx_MEM (FUNCTION_MODE, funexp),
524 rounded_stack_size_rtx, next_arg_reg, n_pop);
526 emit_call_insn (pat);
532 #if defined (HAVE_sibcall) && defined (HAVE_sibcall_value)
533 if ((ecf_flags & ECF_SIBCALL)
534 && HAVE_sibcall && HAVE_sibcall_value)
537 emit_call_insn (GEN_SIBCALL_VALUE (valreg,
538 gen_rtx_MEM (FUNCTION_MODE, funexp),
539 rounded_stack_size_rtx,
540 next_arg_reg, NULL_RTX));
542 emit_call_insn (GEN_SIBCALL (gen_rtx_MEM (FUNCTION_MODE, funexp),
543 rounded_stack_size_rtx, next_arg_reg,
544 struct_value_size_rtx));
549 #if defined (HAVE_call) && defined (HAVE_call_value)
550 if (HAVE_call && HAVE_call_value)
553 emit_call_insn (GEN_CALL_VALUE (valreg,
554 gen_rtx_MEM (FUNCTION_MODE, funexp),
555 rounded_stack_size_rtx, next_arg_reg,
558 emit_call_insn (GEN_CALL (gen_rtx_MEM (FUNCTION_MODE, funexp),
559 rounded_stack_size_rtx, next_arg_reg,
560 struct_value_size_rtx));
566 /* Find the CALL insn we just emitted. */
567 for (call_insn = get_last_insn ();
568 call_insn && GET_CODE (call_insn) != CALL_INSN;
569 call_insn = PREV_INSN (call_insn))
575 /* Mark memory as used for "pure" function call. */
576 if (ecf_flags & ECF_PURE)
578 call_fusage = gen_rtx_EXPR_LIST (VOIDmode,
579 gen_rtx_USE (VOIDmode,
580 gen_rtx_MEM (BLKmode,
581 gen_rtx_SCRATCH (VOIDmode))), call_fusage);
584 /* Put the register usage information on the CALL. If there is already
585 some usage information, put ours at the end. */
586 if (CALL_INSN_FUNCTION_USAGE (call_insn))
590 for (link = CALL_INSN_FUNCTION_USAGE (call_insn); XEXP (link, 1) != 0;
591 link = XEXP (link, 1))
594 XEXP (link, 1) = call_fusage;
597 CALL_INSN_FUNCTION_USAGE (call_insn) = call_fusage;
599 /* If this is a const call, then set the insn's unchanging bit. */
600 if (ecf_flags & (ECF_CONST | ECF_PURE))
601 CONST_CALL_P (call_insn) = 1;
603 /* If this call can't throw, attach a REG_EH_REGION reg note to that
605 if (ecf_flags & ECF_NOTHROW)
606 REG_NOTES (call_insn) = gen_rtx_EXPR_LIST (REG_EH_REGION, const0_rtx,
607 REG_NOTES (call_insn));
609 if (ecf_flags & ECF_NORETURN)
610 REG_NOTES (call_insn) = gen_rtx_EXPR_LIST (REG_NORETURN, const0_rtx,
611 REG_NOTES (call_insn));
613 SIBLING_CALL_P (call_insn) = ((ecf_flags & ECF_SIBCALL) != 0);
615 /* Restore this now, so that we do defer pops for this call's args
616 if the context of the call as a whole permits. */
617 inhibit_defer_pop = old_inhibit_defer_pop;
622 CALL_INSN_FUNCTION_USAGE (call_insn)
623 = gen_rtx_EXPR_LIST (VOIDmode,
624 gen_rtx_CLOBBER (VOIDmode, stack_pointer_rtx),
625 CALL_INSN_FUNCTION_USAGE (call_insn));
626 rounded_stack_size -= n_popped;
627 rounded_stack_size_rtx = GEN_INT (rounded_stack_size);
628 stack_pointer_delta -= n_popped;
631 if (!ACCUMULATE_OUTGOING_ARGS)
633 /* If returning from the subroutine does not automatically pop the args,
634 we need an instruction to pop them sooner or later.
635 Perhaps do it now; perhaps just record how much space to pop later.
637 If returning from the subroutine does pop the args, indicate that the
638 stack pointer will be changed. */
640 if (rounded_stack_size != 0 && ! (ecf_flags & ECF_SP_DEPRESSED))
642 if (flag_defer_pop && inhibit_defer_pop == 0
643 && ! (ecf_flags & (ECF_CONST | ECF_PURE)))
644 pending_stack_adjust += rounded_stack_size;
646 adjust_stack (rounded_stack_size_rtx);
649 /* When we accumulate outgoing args, we must avoid any stack manipulations.
650 Restore the stack pointer to its original value now. Usually
651 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
652 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
653 popping variants of functions exist as well.
655 ??? We may optimize similar to defer_pop above, but it is
656 probably not worthwhile.
658 ??? It will be worthwhile to enable combine_stack_adjustments even for
661 anti_adjust_stack (GEN_INT (n_popped));
664 /* Determine if the function identified by NAME and FNDECL is one with
665 special properties we wish to know about.
667 For example, if the function might return more than one time (setjmp), then
668 set RETURNS_TWICE to a nonzero value.
670 Similarly set LONGJMP for if the function is in the longjmp family.
672 Set MALLOC for any of the standard memory allocation functions which
673 allocate from the heap.
675 Set MAY_BE_ALLOCA for any memory allocation function that might allocate
676 space from the stack such as alloca. */
679 special_function_p (fndecl, flags)
683 if (! (flags & ECF_MALLOC)
684 && fndecl && DECL_NAME (fndecl)
685 && IDENTIFIER_LENGTH (DECL_NAME (fndecl)) <= 17
686 /* Exclude functions not at the file scope, or not `extern',
687 since they are not the magic functions we would otherwise
689 && DECL_CONTEXT (fndecl) == NULL_TREE && TREE_PUBLIC (fndecl))
691 const char *name = IDENTIFIER_POINTER (DECL_NAME (fndecl));
692 const char *tname = name;
694 /* We assume that alloca will always be called by name. It
695 makes no sense to pass it as a pointer-to-function to
696 anything that does not understand its behavior. */
697 if (((IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 6
699 && ! strcmp (name, "alloca"))
700 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 16
702 && ! strcmp (name, "__builtin_alloca"))))
703 flags |= ECF_MAY_BE_ALLOCA;
705 /* Disregard prefix _, __ or __x. */
708 if (name[1] == '_' && name[2] == 'x')
710 else if (name[1] == '_')
719 && (! strcmp (tname, "setjmp")
720 || ! strcmp (tname, "setjmp_syscall")))
722 && ! strcmp (tname, "sigsetjmp"))
724 && ! strcmp (tname, "savectx")))
725 flags |= ECF_RETURNS_TWICE;
728 && ! strcmp (tname, "siglongjmp"))
729 flags |= ECF_LONGJMP;
731 else if ((tname[0] == 'q' && tname[1] == 's'
732 && ! strcmp (tname, "qsetjmp"))
733 || (tname[0] == 'v' && tname[1] == 'f'
734 && ! strcmp (tname, "vfork")))
735 flags |= ECF_RETURNS_TWICE;
737 else if (tname[0] == 'l' && tname[1] == 'o'
738 && ! strcmp (tname, "longjmp"))
739 flags |= ECF_LONGJMP;
741 else if ((tname[0] == 'f' && tname[1] == 'o'
742 && ! strcmp (tname, "fork"))
743 /* Linux specific: __clone. check NAME to insist on the
744 leading underscores, to avoid polluting the ISO / POSIX
746 || (name[0] == '_' && name[1] == '_'
747 && ! strcmp (tname, "clone"))
748 || (tname[0] == 'e' && tname[1] == 'x' && tname[2] == 'e'
749 && tname[3] == 'c' && (tname[4] == 'l' || tname[4] == 'v')
751 || ((tname[5] == 'p' || tname[5] == 'e')
752 && tname[6] == '\0'))))
753 flags |= ECF_FORK_OR_EXEC;
755 /* Do not add any more malloc-like functions to this list,
756 instead mark them as malloc functions using the malloc attribute.
757 Note, realloc is not suitable for attribute malloc since
758 it may return the same address across multiple calls.
759 C++ operator new is not suitable because it is not required
760 to return a unique pointer; indeed, the standard placement new
761 just returns its argument. */
762 else if (TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl))) == Pmode
763 && (! strcmp (tname, "malloc")
764 || ! strcmp (tname, "calloc")
765 || ! strcmp (tname, "strdup")))
771 /* Return nonzero when tree represent call to longjmp. */
774 setjmp_call_p (fndecl)
777 return special_function_p (fndecl, 0) & ECF_RETURNS_TWICE;
780 /* Detect flags (function attributes) from the function type node. */
783 flags_from_decl_or_type (exp)
788 /* ??? We can't set IS_MALLOC for function types? */
791 /* The function exp may have the `malloc' attribute. */
792 if (DECL_P (exp) && DECL_IS_MALLOC (exp))
795 /* The function exp may have the `pure' attribute. */
796 if (DECL_P (exp) && DECL_IS_PURE (exp))
799 if (TREE_NOTHROW (exp))
800 flags |= ECF_NOTHROW;
803 if (TREE_READONLY (exp) && ! TREE_THIS_VOLATILE (exp))
806 if (TREE_THIS_VOLATILE (exp))
807 flags |= ECF_NORETURN;
812 /* Precompute all register parameters as described by ARGS, storing values
813 into fields within the ARGS array.
815 NUM_ACTUALS indicates the total number elements in the ARGS array.
817 Set REG_PARM_SEEN if we encounter a register parameter. */
820 precompute_register_parameters (num_actuals, args, reg_parm_seen)
822 struct arg_data *args;
829 for (i = 0; i < num_actuals; i++)
830 if (args[i].reg != 0 && ! args[i].pass_on_stack)
834 if (args[i].value == 0)
837 args[i].value = expand_expr (args[i].tree_value, NULL_RTX,
839 preserve_temp_slots (args[i].value);
842 /* ANSI doesn't require a sequence point here,
843 but PCC has one, so this will avoid some problems. */
847 /* If we are to promote the function arg to a wider mode,
850 if (args[i].mode != TYPE_MODE (TREE_TYPE (args[i].tree_value)))
852 = convert_modes (args[i].mode,
853 TYPE_MODE (TREE_TYPE (args[i].tree_value)),
854 args[i].value, args[i].unsignedp);
856 /* If the value is expensive, and we are inside an appropriately
857 short loop, put the value into a pseudo and then put the pseudo
860 For small register classes, also do this if this call uses
861 register parameters. This is to avoid reload conflicts while
862 loading the parameters registers. */
864 if ((! (GET_CODE (args[i].value) == REG
865 || (GET_CODE (args[i].value) == SUBREG
866 && GET_CODE (SUBREG_REG (args[i].value)) == REG)))
867 && args[i].mode != BLKmode
868 && rtx_cost (args[i].value, SET) > COSTS_N_INSNS (1)
869 && ((SMALL_REGISTER_CLASSES && *reg_parm_seen)
870 || preserve_subexpressions_p ()))
871 args[i].value = copy_to_mode_reg (args[i].mode, args[i].value);
875 #ifdef REG_PARM_STACK_SPACE
877 /* The argument list is the property of the called routine and it
878 may clobber it. If the fixed area has been used for previous
879 parameters, we must save and restore it. */
882 save_fixed_argument_area (reg_parm_stack_space, argblock,
883 low_to_save, high_to_save)
884 int reg_parm_stack_space;
890 rtx save_area = NULL_RTX;
892 /* Compute the boundary of the that needs to be saved, if any. */
893 #ifdef ARGS_GROW_DOWNWARD
894 for (i = 0; i < reg_parm_stack_space + 1; i++)
896 for (i = 0; i < reg_parm_stack_space; i++)
899 if (i >= highest_outgoing_arg_in_use
900 || stack_usage_map[i] == 0)
903 if (*low_to_save == -1)
909 if (*low_to_save >= 0)
911 int num_to_save = *high_to_save - *low_to_save + 1;
912 enum machine_mode save_mode
913 = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1);
916 /* If we don't have the required alignment, must do this in BLKmode. */
917 if ((*low_to_save & (MIN (GET_MODE_SIZE (save_mode),
918 BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1)))
921 #ifdef ARGS_GROW_DOWNWARD
923 = gen_rtx_MEM (save_mode,
924 memory_address (save_mode,
925 plus_constant (argblock,
928 stack_area = gen_rtx_MEM (save_mode,
929 memory_address (save_mode,
930 plus_constant (argblock,
933 if (save_mode == BLKmode)
935 save_area = assign_stack_temp (BLKmode, num_to_save, 0);
936 /* Cannot use emit_block_move here because it can be done by a
937 library call which in turn gets into this place again and deadly
938 infinite recursion happens. */
939 move_by_pieces (validize_mem (save_area), stack_area, num_to_save,
944 save_area = gen_reg_rtx (save_mode);
945 emit_move_insn (save_area, stack_area);
952 restore_fixed_argument_area (save_area, argblock, high_to_save, low_to_save)
958 enum machine_mode save_mode = GET_MODE (save_area);
959 #ifdef ARGS_GROW_DOWNWARD
961 = gen_rtx_MEM (save_mode,
962 memory_address (save_mode,
963 plus_constant (argblock,
967 = gen_rtx_MEM (save_mode,
968 memory_address (save_mode,
969 plus_constant (argblock,
973 if (save_mode != BLKmode)
974 emit_move_insn (stack_area, save_area);
976 /* Cannot use emit_block_move here because it can be done by a library
977 call which in turn gets into this place again and deadly infinite
978 recursion happens. */
979 move_by_pieces (stack_area, validize_mem (save_area),
980 high_to_save - low_to_save + 1, PARM_BOUNDARY);
984 /* If any elements in ARGS refer to parameters that are to be passed in
985 registers, but not in memory, and whose alignment does not permit a
986 direct copy into registers. Copy the values into a group of pseudos
987 which we will later copy into the appropriate hard registers.
989 Pseudos for each unaligned argument will be stored into the array
990 args[argnum].aligned_regs. The caller is responsible for deallocating
991 the aligned_regs array if it is nonzero. */
994 store_unaligned_arguments_into_pseudos (args, num_actuals)
995 struct arg_data *args;
1000 for (i = 0; i < num_actuals; i++)
1001 if (args[i].reg != 0 && ! args[i].pass_on_stack
1002 && args[i].mode == BLKmode
1003 && (TYPE_ALIGN (TREE_TYPE (args[i].tree_value))
1004 < (unsigned int) MIN (BIGGEST_ALIGNMENT, BITS_PER_WORD)))
1006 int bytes = int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1007 int big_endian_correction = 0;
1009 args[i].n_aligned_regs
1010 = args[i].partial ? args[i].partial
1011 : (bytes + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
1013 args[i].aligned_regs = (rtx *) xmalloc (sizeof (rtx)
1014 * args[i].n_aligned_regs);
1016 /* Structures smaller than a word are aligned to the least
1017 significant byte (to the right). On a BYTES_BIG_ENDIAN machine,
1018 this means we must skip the empty high order bytes when
1019 calculating the bit offset. */
1020 if (BYTES_BIG_ENDIAN && bytes < UNITS_PER_WORD)
1021 big_endian_correction = (BITS_PER_WORD - (bytes * BITS_PER_UNIT));
1023 for (j = 0; j < args[i].n_aligned_regs; j++)
1025 rtx reg = gen_reg_rtx (word_mode);
1026 rtx word = operand_subword_force (args[i].value, j, BLKmode);
1027 int bitsize = MIN (bytes * BITS_PER_UNIT, BITS_PER_WORD);
1028 int bitalign = TYPE_ALIGN (TREE_TYPE (args[i].tree_value));
1030 args[i].aligned_regs[j] = reg;
1032 /* There is no need to restrict this code to loading items
1033 in TYPE_ALIGN sized hunks. The bitfield instructions can
1034 load up entire word sized registers efficiently.
1036 ??? This may not be needed anymore.
1037 We use to emit a clobber here but that doesn't let later
1038 passes optimize the instructions we emit. By storing 0 into
1039 the register later passes know the first AND to zero out the
1040 bitfield being set in the register is unnecessary. The store
1041 of 0 will be deleted as will at least the first AND. */
1043 emit_move_insn (reg, const0_rtx);
1045 bytes -= bitsize / BITS_PER_UNIT;
1046 store_bit_field (reg, bitsize, big_endian_correction, word_mode,
1047 extract_bit_field (word, bitsize, 0, 1, NULL_RTX,
1048 word_mode, word_mode, bitalign,
1050 bitalign, BITS_PER_WORD);
1055 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1058 NUM_ACTUALS is the total number of parameters.
1060 N_NAMED_ARGS is the total number of named arguments.
1062 FNDECL is the tree code for the target of this call (if known)
1064 ARGS_SO_FAR holds state needed by the target to know where to place
1067 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1068 for arguments which are passed in registers.
1070 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1071 and may be modified by this routine.
1073 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1074 flags which may may be modified by this routine. */
1077 initialize_argument_information (num_actuals, args, args_size, n_named_args,
1078 actparms, fndecl, args_so_far,
1079 reg_parm_stack_space, old_stack_level,
1080 old_pending_adj, must_preallocate,
1082 int num_actuals ATTRIBUTE_UNUSED;
1083 struct arg_data *args;
1084 struct args_size *args_size;
1085 int n_named_args ATTRIBUTE_UNUSED;
1088 CUMULATIVE_ARGS *args_so_far;
1089 int reg_parm_stack_space;
1090 rtx *old_stack_level;
1091 int *old_pending_adj;
1092 int *must_preallocate;
1095 /* 1 if scanning parms front to back, -1 if scanning back to front. */
1098 /* Count arg position in order args appear. */
1101 struct args_size alignment_pad;
1105 args_size->constant = 0;
1108 /* In this loop, we consider args in the order they are written.
1109 We fill up ARGS from the front or from the back if necessary
1110 so that in any case the first arg to be pushed ends up at the front. */
1112 if (PUSH_ARGS_REVERSED)
1114 i = num_actuals - 1, inc = -1;
1115 /* In this case, must reverse order of args
1116 so that we compute and push the last arg first. */
1123 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1124 for (p = actparms, argpos = 0; p; p = TREE_CHAIN (p), i += inc, argpos++)
1126 tree type = TREE_TYPE (TREE_VALUE (p));
1128 enum machine_mode mode;
1130 args[i].tree_value = TREE_VALUE (p);
1132 /* Replace erroneous argument with constant zero. */
1133 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
1134 args[i].tree_value = integer_zero_node, type = integer_type_node;
1136 /* If TYPE is a transparent union, pass things the way we would
1137 pass the first field of the union. We have already verified that
1138 the modes are the same. */
1139 if (TREE_CODE (type) == UNION_TYPE && TYPE_TRANSPARENT_UNION (type))
1140 type = TREE_TYPE (TYPE_FIELDS (type));
1142 /* Decide where to pass this arg.
1144 args[i].reg is nonzero if all or part is passed in registers.
1146 args[i].partial is nonzero if part but not all is passed in registers,
1147 and the exact value says how many words are passed in registers.
1149 args[i].pass_on_stack is nonzero if the argument must at least be
1150 computed on the stack. It may then be loaded back into registers
1151 if args[i].reg is nonzero.
1153 These decisions are driven by the FUNCTION_... macros and must agree
1154 with those made by function.c. */
1156 /* See if this argument should be passed by invisible reference. */
1157 if ((TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST
1158 && contains_placeholder_p (TYPE_SIZE (type)))
1159 || TREE_ADDRESSABLE (type)
1160 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
1161 || FUNCTION_ARG_PASS_BY_REFERENCE (*args_so_far, TYPE_MODE (type),
1162 type, argpos < n_named_args)
1166 /* If we're compiling a thunk, pass through invisible
1167 references instead of making a copy. */
1168 if (current_function_is_thunk
1169 #ifdef FUNCTION_ARG_CALLEE_COPIES
1170 || (FUNCTION_ARG_CALLEE_COPIES (*args_so_far, TYPE_MODE (type),
1171 type, argpos < n_named_args)
1172 /* If it's in a register, we must make a copy of it too. */
1173 /* ??? Is this a sufficient test? Is there a better one? */
1174 && !(TREE_CODE (args[i].tree_value) == VAR_DECL
1175 && REG_P (DECL_RTL (args[i].tree_value)))
1176 && ! TREE_ADDRESSABLE (type))
1180 /* C++ uses a TARGET_EXPR to indicate that we want to make a
1181 new object from the argument. If we are passing by
1182 invisible reference, the callee will do that for us, so we
1183 can strip off the TARGET_EXPR. This is not always safe,
1184 but it is safe in the only case where this is a useful
1185 optimization; namely, when the argument is a plain object.
1186 In that case, the frontend is just asking the backend to
1187 make a bitwise copy of the argument. */
1189 if (TREE_CODE (args[i].tree_value) == TARGET_EXPR
1190 && (DECL_P (TREE_OPERAND (args[i].tree_value, 1)))
1191 && ! REG_P (DECL_RTL (TREE_OPERAND (args[i].tree_value, 1))))
1192 args[i].tree_value = TREE_OPERAND (args[i].tree_value, 1);
1194 args[i].tree_value = build1 (ADDR_EXPR,
1195 build_pointer_type (type),
1196 args[i].tree_value);
1197 type = build_pointer_type (type);
1201 /* We make a copy of the object and pass the address to the
1202 function being called. */
1205 if (!COMPLETE_TYPE_P (type)
1206 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST
1207 || (flag_stack_check && ! STACK_CHECK_BUILTIN
1208 && (0 < compare_tree_int (TYPE_SIZE_UNIT (type),
1209 STACK_CHECK_MAX_VAR_SIZE))))
1211 /* This is a variable-sized object. Make space on the stack
1213 rtx size_rtx = expr_size (TREE_VALUE (p));
1215 if (*old_stack_level == 0)
1217 emit_stack_save (SAVE_BLOCK, old_stack_level, NULL_RTX);
1218 *old_pending_adj = pending_stack_adjust;
1219 pending_stack_adjust = 0;
1222 copy = gen_rtx_MEM (BLKmode,
1223 allocate_dynamic_stack_space
1224 (size_rtx, NULL_RTX, TYPE_ALIGN (type)));
1225 set_mem_attributes (copy, type, 1);
1228 copy = assign_temp (type, 0, 1, 0);
1230 store_expr (args[i].tree_value, copy, 0);
1231 *ecf_flags &= ~(ECF_CONST | ECF_PURE);
1233 args[i].tree_value = build1 (ADDR_EXPR,
1234 build_pointer_type (type),
1235 make_tree (type, copy));
1236 type = build_pointer_type (type);
1240 mode = TYPE_MODE (type);
1241 unsignedp = TREE_UNSIGNED (type);
1243 #ifdef PROMOTE_FUNCTION_ARGS
1244 mode = promote_mode (type, mode, &unsignedp, 1);
1247 args[i].unsignedp = unsignedp;
1248 args[i].mode = mode;
1250 args[i].reg = FUNCTION_ARG (*args_so_far, mode, type,
1251 argpos < n_named_args);
1252 #ifdef FUNCTION_INCOMING_ARG
1253 /* If this is a sibling call and the machine has register windows, the
1254 register window has to be unwinded before calling the routine, so
1255 arguments have to go into the incoming registers. */
1256 args[i].tail_call_reg = FUNCTION_INCOMING_ARG (*args_so_far, mode, type,
1257 argpos < n_named_args);
1259 args[i].tail_call_reg = args[i].reg;
1262 #ifdef FUNCTION_ARG_PARTIAL_NREGS
1265 = FUNCTION_ARG_PARTIAL_NREGS (*args_so_far, mode, type,
1266 argpos < n_named_args);
1269 args[i].pass_on_stack = MUST_PASS_IN_STACK (mode, type);
1271 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1272 it means that we are to pass this arg in the register(s) designated
1273 by the PARALLEL, but also to pass it in the stack. */
1274 if (args[i].reg && GET_CODE (args[i].reg) == PARALLEL
1275 && XEXP (XVECEXP (args[i].reg, 0, 0), 0) == 0)
1276 args[i].pass_on_stack = 1;
1278 /* If this is an addressable type, we must preallocate the stack
1279 since we must evaluate the object into its final location.
1281 If this is to be passed in both registers and the stack, it is simpler
1283 if (TREE_ADDRESSABLE (type)
1284 || (args[i].pass_on_stack && args[i].reg != 0))
1285 *must_preallocate = 1;
1287 /* If this is an addressable type, we cannot pre-evaluate it. Thus,
1288 we cannot consider this function call constant. */
1289 if (TREE_ADDRESSABLE (type))
1290 *ecf_flags &= ~(ECF_CONST | ECF_PURE);
1292 /* Compute the stack-size of this argument. */
1293 if (args[i].reg == 0 || args[i].partial != 0
1294 || reg_parm_stack_space > 0
1295 || args[i].pass_on_stack)
1296 locate_and_pad_parm (mode, type,
1297 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1302 fndecl, args_size, &args[i].offset,
1303 &args[i].size, &alignment_pad);
1305 #ifndef ARGS_GROW_DOWNWARD
1306 args[i].slot_offset = *args_size;
1309 args[i].alignment_pad = alignment_pad;
1311 /* If a part of the arg was put into registers,
1312 don't include that part in the amount pushed. */
1313 if (reg_parm_stack_space == 0 && ! args[i].pass_on_stack)
1314 args[i].size.constant -= ((args[i].partial * UNITS_PER_WORD)
1315 / (PARM_BOUNDARY / BITS_PER_UNIT)
1316 * (PARM_BOUNDARY / BITS_PER_UNIT));
1318 /* Update ARGS_SIZE, the total stack space for args so far. */
1320 args_size->constant += args[i].size.constant;
1321 if (args[i].size.var)
1323 ADD_PARM_SIZE (*args_size, args[i].size.var);
1326 /* Since the slot offset points to the bottom of the slot,
1327 we must record it after incrementing if the args grow down. */
1328 #ifdef ARGS_GROW_DOWNWARD
1329 args[i].slot_offset = *args_size;
1331 args[i].slot_offset.constant = -args_size->constant;
1333 SUB_PARM_SIZE (args[i].slot_offset, args_size->var);
1336 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1337 have been used, etc. */
1339 FUNCTION_ARG_ADVANCE (*args_so_far, TYPE_MODE (type), type,
1340 argpos < n_named_args);
1344 /* Update ARGS_SIZE to contain the total size for the argument block.
1345 Return the original constant component of the argument block's size.
1347 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1348 for arguments passed in registers. */
1351 compute_argument_block_size (reg_parm_stack_space, args_size,
1352 preferred_stack_boundary)
1353 int reg_parm_stack_space;
1354 struct args_size *args_size;
1355 int preferred_stack_boundary ATTRIBUTE_UNUSED;
1357 int unadjusted_args_size = args_size->constant;
1359 /* For accumulate outgoing args mode we don't need to align, since the frame
1360 will be already aligned. Align to STACK_BOUNDARY in order to prevent
1361 backends from generating missaligned frame sizes. */
1362 #ifdef STACK_BOUNDARY
1363 if (ACCUMULATE_OUTGOING_ARGS && preferred_stack_boundary > STACK_BOUNDARY)
1364 preferred_stack_boundary = STACK_BOUNDARY;
1367 /* Compute the actual size of the argument block required. The variable
1368 and constant sizes must be combined, the size may have to be rounded,
1369 and there may be a minimum required size. */
1373 args_size->var = ARGS_SIZE_TREE (*args_size);
1374 args_size->constant = 0;
1376 #ifdef PREFERRED_STACK_BOUNDARY
1377 preferred_stack_boundary /= BITS_PER_UNIT;
1378 if (preferred_stack_boundary > 1)
1380 /* We don't handle this case yet. To handle it correctly we have
1381 to add the delta, round and substract the delta.
1382 Currently no machine description requires this support. */
1383 if (stack_pointer_delta & (preferred_stack_boundary - 1))
1385 args_size->var = round_up (args_size->var, preferred_stack_boundary);
1389 if (reg_parm_stack_space > 0)
1392 = size_binop (MAX_EXPR, args_size->var,
1393 ssize_int (reg_parm_stack_space));
1395 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1396 /* The area corresponding to register parameters is not to count in
1397 the size of the block we need. So make the adjustment. */
1399 = size_binop (MINUS_EXPR, args_size->var,
1400 ssize_int (reg_parm_stack_space));
1406 #ifdef PREFERRED_STACK_BOUNDARY
1407 preferred_stack_boundary /= BITS_PER_UNIT;
1408 if (preferred_stack_boundary < 1)
1409 preferred_stack_boundary = 1;
1410 args_size->constant = (((args_size->constant
1411 + stack_pointer_delta
1412 + preferred_stack_boundary - 1)
1413 / preferred_stack_boundary
1414 * preferred_stack_boundary)
1415 - stack_pointer_delta);
1418 args_size->constant = MAX (args_size->constant,
1419 reg_parm_stack_space);
1421 #ifdef MAYBE_REG_PARM_STACK_SPACE
1422 if (reg_parm_stack_space == 0)
1423 args_size->constant = 0;
1426 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1427 args_size->constant -= reg_parm_stack_space;
1430 return unadjusted_args_size;
1433 /* Precompute parameters as needed for a function call.
1435 FLAGS is mask of ECF_* constants.
1437 NUM_ACTUALS is the number of arguments.
1439 ARGS is an array containing information for each argument; this
1440 routine fills in the INITIAL_VALUE and VALUE fields for each
1441 precomputed argument. */
1444 precompute_arguments (flags, num_actuals, args)
1447 struct arg_data *args;
1451 /* If this function call is cse'able, precompute all the parameters.
1452 Note that if the parameter is constructed into a temporary, this will
1453 cause an additional copy because the parameter will be constructed
1454 into a temporary location and then copied into the outgoing arguments.
1455 If a parameter contains a call to alloca and this function uses the
1456 stack, precompute the parameter. */
1458 /* If we preallocated the stack space, and some arguments must be passed
1459 on the stack, then we must precompute any parameter which contains a
1460 function call which will store arguments on the stack.
1461 Otherwise, evaluating the parameter may clobber previous parameters
1462 which have already been stored into the stack. (we have code to avoid
1463 such case by saving the ougoing stack arguments, but it results in
1466 for (i = 0; i < num_actuals; i++)
1467 if ((flags & (ECF_CONST | ECF_PURE))
1468 || calls_function (args[i].tree_value, !ACCUMULATE_OUTGOING_ARGS))
1470 /* If this is an addressable type, we cannot pre-evaluate it. */
1471 if (TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value)))
1477 = expand_expr (args[i].tree_value, NULL_RTX, VOIDmode, 0);
1479 preserve_temp_slots (args[i].value);
1482 /* ANSI doesn't require a sequence point here,
1483 but PCC has one, so this will avoid some problems. */
1486 args[i].initial_value = args[i].value
1487 = protect_from_queue (args[i].value, 0);
1489 if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) != args[i].mode)
1492 = convert_modes (args[i].mode,
1493 TYPE_MODE (TREE_TYPE (args[i].tree_value)),
1494 args[i].value, args[i].unsignedp);
1495 #ifdef PROMOTE_FOR_CALL_ONLY
1496 /* CSE will replace this only if it contains args[i].value
1497 pseudo, so convert it down to the declared mode using
1499 if (GET_CODE (args[i].value) == REG
1500 && GET_MODE_CLASS (args[i].mode) == MODE_INT)
1502 args[i].initial_value
1503 = gen_rtx_SUBREG (TYPE_MODE (TREE_TYPE (args[i].tree_value)),
1505 SUBREG_PROMOTED_VAR_P (args[i].initial_value) = 1;
1506 SUBREG_PROMOTED_UNSIGNED_P (args[i].initial_value)
1507 = args[i].unsignedp;
1514 /* Given the current state of MUST_PREALLOCATE and information about
1515 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
1516 compute and return the final value for MUST_PREALLOCATE. */
1519 finalize_must_preallocate (must_preallocate, num_actuals, args, args_size)
1520 int must_preallocate;
1522 struct arg_data *args;
1523 struct args_size *args_size;
1525 /* See if we have or want to preallocate stack space.
1527 If we would have to push a partially-in-regs parm
1528 before other stack parms, preallocate stack space instead.
1530 If the size of some parm is not a multiple of the required stack
1531 alignment, we must preallocate.
1533 If the total size of arguments that would otherwise create a copy in
1534 a temporary (such as a CALL) is more than half the total argument list
1535 size, preallocation is faster.
1537 Another reason to preallocate is if we have a machine (like the m88k)
1538 where stack alignment is required to be maintained between every
1539 pair of insns, not just when the call is made. However, we assume here
1540 that such machines either do not have push insns (and hence preallocation
1541 would occur anyway) or the problem is taken care of with
1544 if (! must_preallocate)
1546 int partial_seen = 0;
1547 int copy_to_evaluate_size = 0;
1550 for (i = 0; i < num_actuals && ! must_preallocate; i++)
1552 if (args[i].partial > 0 && ! args[i].pass_on_stack)
1554 else if (partial_seen && args[i].reg == 0)
1555 must_preallocate = 1;
1557 if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode
1558 && (TREE_CODE (args[i].tree_value) == CALL_EXPR
1559 || TREE_CODE (args[i].tree_value) == TARGET_EXPR
1560 || TREE_CODE (args[i].tree_value) == COND_EXPR
1561 || TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value))))
1562 copy_to_evaluate_size
1563 += int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1566 if (copy_to_evaluate_size * 2 >= args_size->constant
1567 && args_size->constant > 0)
1568 must_preallocate = 1;
1570 return must_preallocate;
1573 /* If we preallocated stack space, compute the address of each argument
1574 and store it into the ARGS array.
1576 We need not ensure it is a valid memory address here; it will be
1577 validized when it is used.
1579 ARGBLOCK is an rtx for the address of the outgoing arguments. */
1582 compute_argument_addresses (args, argblock, num_actuals)
1583 struct arg_data *args;
1589 rtx arg_reg = argblock;
1590 int i, arg_offset = 0;
1592 if (GET_CODE (argblock) == PLUS)
1593 arg_reg = XEXP (argblock, 0), arg_offset = INTVAL (XEXP (argblock, 1));
1595 for (i = 0; i < num_actuals; i++)
1597 rtx offset = ARGS_SIZE_RTX (args[i].offset);
1598 rtx slot_offset = ARGS_SIZE_RTX (args[i].slot_offset);
1601 /* Skip this parm if it will not be passed on the stack. */
1602 if (! args[i].pass_on_stack && args[i].reg != 0)
1605 if (GET_CODE (offset) == CONST_INT)
1606 addr = plus_constant (arg_reg, INTVAL (offset));
1608 addr = gen_rtx_PLUS (Pmode, arg_reg, offset);
1610 addr = plus_constant (addr, arg_offset);
1611 args[i].stack = gen_rtx_MEM (args[i].mode, addr);
1612 set_mem_attributes (args[i].stack,
1613 TREE_TYPE (args[i].tree_value), 1);
1615 if (GET_CODE (slot_offset) == CONST_INT)
1616 addr = plus_constant (arg_reg, INTVAL (slot_offset));
1618 addr = gen_rtx_PLUS (Pmode, arg_reg, slot_offset);
1620 addr = plus_constant (addr, arg_offset);
1621 args[i].stack_slot = gen_rtx_MEM (args[i].mode, addr);
1622 set_mem_attributes (args[i].stack_slot,
1623 TREE_TYPE (args[i].tree_value), 1);
1625 /* Function incoming arguments may overlap with sibling call
1626 outgoing arguments and we cannot allow reordering of reads
1627 from function arguments with stores to outgoing arguments
1628 of sibling calls. */
1629 MEM_ALIAS_SET (args[i].stack) = 0;
1630 MEM_ALIAS_SET (args[i].stack_slot) = 0;
1635 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
1636 in a call instruction.
1638 FNDECL is the tree node for the target function. For an indirect call
1639 FNDECL will be NULL_TREE.
1641 EXP is the CALL_EXPR for this call. */
1644 rtx_for_function_call (fndecl, exp)
1650 /* Get the function to call, in the form of RTL. */
1653 /* If this is the first use of the function, see if we need to
1654 make an external definition for it. */
1655 if (! TREE_USED (fndecl))
1657 assemble_external (fndecl);
1658 TREE_USED (fndecl) = 1;
1661 /* Get a SYMBOL_REF rtx for the function address. */
1662 funexp = XEXP (DECL_RTL (fndecl), 0);
1665 /* Generate an rtx (probably a pseudo-register) for the address. */
1670 expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
1671 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
1673 /* Check the function is executable. */
1674 if (current_function_check_memory_usage)
1676 #ifdef POINTERS_EXTEND_UNSIGNED
1677 /* It might be OK to convert funexp in place, but there's
1678 a lot going on between here and when it happens naturally
1679 that this seems safer. */
1680 funaddr = convert_memory_address (Pmode, funexp);
1682 emit_library_call (chkr_check_exec_libfunc, LCT_CONST_MAKE_BLOCK,
1683 VOIDmode, 1, funaddr, Pmode);
1690 /* Do the register loads required for any wholly-register parms or any
1691 parms which are passed both on the stack and in a register. Their
1692 expressions were already evaluated.
1694 Mark all register-parms as living through the call, putting these USE
1695 insns in the CALL_INSN_FUNCTION_USAGE field. */
1698 load_register_parameters (args, num_actuals, call_fusage, flags)
1699 struct arg_data *args;
1706 #ifdef LOAD_ARGS_REVERSED
1707 for (i = num_actuals - 1; i >= 0; i--)
1709 for (i = 0; i < num_actuals; i++)
1712 rtx reg = ((flags & ECF_SIBCALL)
1713 ? args[i].tail_call_reg : args[i].reg);
1714 int partial = args[i].partial;
1719 /* Set to non-negative if must move a word at a time, even if just
1720 one word (e.g, partial == 1 && mode == DFmode). Set to -1 if
1721 we just use a normal move insn. This value can be zero if the
1722 argument is a zero size structure with no fields. */
1723 nregs = (partial ? partial
1724 : (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode
1725 ? ((int_size_in_bytes (TREE_TYPE (args[i].tree_value))
1726 + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD)
1729 /* Handle calls that pass values in multiple non-contiguous
1730 locations. The Irix 6 ABI has examples of this. */
1732 if (GET_CODE (reg) == PARALLEL)
1733 emit_group_load (reg, args[i].value,
1734 int_size_in_bytes (TREE_TYPE (args[i].tree_value)),
1735 TYPE_ALIGN (TREE_TYPE (args[i].tree_value)));
1737 /* If simple case, just do move. If normal partial, store_one_arg
1738 has already loaded the register for us. In all other cases,
1739 load the register(s) from memory. */
1741 else if (nregs == -1)
1742 emit_move_insn (reg, args[i].value);
1744 /* If we have pre-computed the values to put in the registers in
1745 the case of non-aligned structures, copy them in now. */
1747 else if (args[i].n_aligned_regs != 0)
1748 for (j = 0; j < args[i].n_aligned_regs; j++)
1749 emit_move_insn (gen_rtx_REG (word_mode, REGNO (reg) + j),
1750 args[i].aligned_regs[j]);
1752 else if (partial == 0 || args[i].pass_on_stack)
1753 move_block_to_reg (REGNO (reg),
1754 validize_mem (args[i].value), nregs,
1757 /* Handle calls that pass values in multiple non-contiguous
1758 locations. The Irix 6 ABI has examples of this. */
1759 if (GET_CODE (reg) == PARALLEL)
1760 use_group_regs (call_fusage, reg);
1761 else if (nregs == -1)
1762 use_reg (call_fusage, reg);
1764 use_regs (call_fusage, REGNO (reg), nregs == 0 ? 1 : nregs);
1769 /* Try to integrate function. See expand_inline_function for documentation
1770 about the parameters. */
1773 try_to_integrate (fndecl, actparms, target, ignore, type, structure_value_addr)
1779 rtx structure_value_addr;
1784 rtx old_stack_level = 0;
1785 int reg_parm_stack_space = 0;
1787 #ifdef REG_PARM_STACK_SPACE
1788 #ifdef MAYBE_REG_PARM_STACK_SPACE
1789 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
1791 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
1795 before_call = get_last_insn ();
1797 timevar_push (TV_INTEGRATION);
1799 temp = expand_inline_function (fndecl, actparms, target,
1801 structure_value_addr);
1803 timevar_pop (TV_INTEGRATION);
1805 /* If inlining succeeded, return. */
1806 if (temp != (rtx) (HOST_WIDE_INT) - 1)
1808 if (ACCUMULATE_OUTGOING_ARGS)
1810 /* If the outgoing argument list must be preserved, push
1811 the stack before executing the inlined function if it
1814 for (i = reg_parm_stack_space - 1; i >= 0; i--)
1815 if (i < highest_outgoing_arg_in_use && stack_usage_map[i] != 0)
1818 if (stack_arg_under_construction || i >= 0)
1821 = before_call ? NEXT_INSN (before_call) : get_insns ();
1822 rtx insn = NULL_RTX, seq;
1824 /* Look for a call in the inline function code.
1825 If DECL_SAVED_INSNS (fndecl)->outgoing_args_size is
1826 nonzero then there is a call and it is not necessary
1827 to scan the insns. */
1829 if (DECL_SAVED_INSNS (fndecl)->outgoing_args_size == 0)
1830 for (insn = first_insn; insn; insn = NEXT_INSN (insn))
1831 if (GET_CODE (insn) == CALL_INSN)
1836 /* Reserve enough stack space so that the largest
1837 argument list of any function call in the inline
1838 function does not overlap the argument list being
1839 evaluated. This is usually an overestimate because
1840 allocate_dynamic_stack_space reserves space for an
1841 outgoing argument list in addition to the requested
1842 space, but there is no way to ask for stack space such
1843 that an argument list of a certain length can be
1846 Add the stack space reserved for register arguments, if
1847 any, in the inline function. What is really needed is the
1848 largest value of reg_parm_stack_space in the inline
1849 function, but that is not available. Using the current
1850 value of reg_parm_stack_space is wrong, but gives
1851 correct results on all supported machines. */
1853 int adjust = (DECL_SAVED_INSNS (fndecl)->outgoing_args_size
1854 + reg_parm_stack_space);
1857 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1858 allocate_dynamic_stack_space (GEN_INT (adjust),
1859 NULL_RTX, BITS_PER_UNIT);
1862 emit_insns_before (seq, first_insn);
1863 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
1868 /* If the result is equivalent to TARGET, return TARGET to simplify
1869 checks in store_expr. They can be equivalent but not equal in the
1870 case of a function that returns BLKmode. */
1871 if (temp != target && rtx_equal_p (temp, target))
1876 /* If inlining failed, mark FNDECL as needing to be compiled
1877 separately after all. If function was declared inline,
1879 if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline
1880 && optimize > 0 && !TREE_ADDRESSABLE (fndecl))
1882 warning_with_decl (fndecl, "inlining failed in call to `%s'");
1883 warning ("called from here");
1885 mark_addressable (fndecl);
1886 return (rtx) (HOST_WIDE_INT) - 1;
1889 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
1890 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
1891 bytes, then we would need to push some additional bytes to pad the
1892 arguments. So, we compute an adjust to the stack pointer for an
1893 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
1894 bytes. Then, when the arguments are pushed the stack will be perfectly
1895 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
1896 be popped after the call. Returns the adjustment. */
1899 combine_pending_stack_adjustment_and_call (unadjusted_args_size,
1901 preferred_unit_stack_boundary)
1902 int unadjusted_args_size;
1903 struct args_size *args_size;
1904 int preferred_unit_stack_boundary;
1906 /* The number of bytes to pop so that the stack will be
1907 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
1908 HOST_WIDE_INT adjustment;
1909 /* The alignment of the stack after the arguments are pushed, if we
1910 just pushed the arguments without adjust the stack here. */
1911 HOST_WIDE_INT unadjusted_alignment;
1913 unadjusted_alignment
1914 = ((stack_pointer_delta + unadjusted_args_size)
1915 % preferred_unit_stack_boundary);
1917 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
1918 as possible -- leaving just enough left to cancel out the
1919 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
1920 PENDING_STACK_ADJUST is non-negative, and congruent to
1921 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
1923 /* Begin by trying to pop all the bytes. */
1924 unadjusted_alignment
1925 = (unadjusted_alignment
1926 - (pending_stack_adjust % preferred_unit_stack_boundary));
1927 adjustment = pending_stack_adjust;
1928 /* Push enough additional bytes that the stack will be aligned
1929 after the arguments are pushed. */
1930 if (preferred_unit_stack_boundary > 1)
1932 if (unadjusted_alignment >= 0)
1933 adjustment -= preferred_unit_stack_boundary - unadjusted_alignment;
1935 adjustment += unadjusted_alignment;
1938 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
1939 bytes after the call. The right number is the entire
1940 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
1941 by the arguments in the first place. */
1943 = pending_stack_adjust - adjustment + unadjusted_args_size;
1948 /* Scan X expression if it does not dereference any argument slots
1949 we already clobbered by tail call arguments (as noted in stored_args_map
1951 Return non-zero if X expression dereferences such argument slots,
1955 check_sibcall_argument_overlap_1 (x)
1966 code = GET_CODE (x);
1970 if (XEXP (x, 0) == current_function_internal_arg_pointer)
1972 else if (GET_CODE (XEXP (x, 0)) == PLUS
1973 && XEXP (XEXP (x, 0), 0) ==
1974 current_function_internal_arg_pointer
1975 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT)
1976 i = INTVAL (XEXP (XEXP (x, 0), 1));
1980 #ifdef ARGS_GROW_DOWNWARD
1981 i = -i - GET_MODE_SIZE (GET_MODE (x));
1984 for (k = 0; k < GET_MODE_SIZE (GET_MODE (x)); k++)
1985 if (i + k < stored_args_map->n_bits
1986 && TEST_BIT (stored_args_map, i + k))
1992 /* Scan all subexpressions. */
1993 fmt = GET_RTX_FORMAT (code);
1994 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
1998 if (check_sibcall_argument_overlap_1 (XEXP (x, i)))
2001 else if (*fmt == 'E')
2003 for (j = 0; j < XVECLEN (x, i); j++)
2004 if (check_sibcall_argument_overlap_1 (XVECEXP (x, i, j)))
2011 /* Scan sequence after INSN if it does not dereference any argument slots
2012 we already clobbered by tail call arguments (as noted in stored_args_map
2013 bitmap). Add stack slots for ARG to stored_args_map bitmap afterwards.
2014 Return non-zero if sequence after INSN dereferences such argument slots,
2018 check_sibcall_argument_overlap (insn, arg)
2020 struct arg_data *arg;
2024 if (insn == NULL_RTX)
2025 insn = get_insns ();
2027 insn = NEXT_INSN (insn);
2029 for (; insn; insn = NEXT_INSN (insn))
2031 && check_sibcall_argument_overlap_1 (PATTERN (insn)))
2034 #ifdef ARGS_GROW_DOWNWARD
2035 low = -arg->offset.constant - arg->size.constant;
2037 low = arg->offset.constant;
2040 for (high = low + arg->size.constant; low < high; low++)
2041 SET_BIT (stored_args_map, low);
2042 return insn != NULL_RTX;
2045 /* Generate all the code for a function call
2046 and return an rtx for its value.
2047 Store the value in TARGET (specified as an rtx) if convenient.
2048 If the value is stored in TARGET then TARGET is returned.
2049 If IGNORE is nonzero, then we ignore the value of the function call. */
2052 expand_call (exp, target, ignore)
2057 /* Nonzero if we are currently expanding a call. */
2058 static int currently_expanding_call = 0;
2060 /* List of actual parameters. */
2061 tree actparms = TREE_OPERAND (exp, 1);
2062 /* RTX for the function to be called. */
2064 /* Sequence of insns to perform a tail recursive "call". */
2065 rtx tail_recursion_insns = NULL_RTX;
2066 /* Sequence of insns to perform a normal "call". */
2067 rtx normal_call_insns = NULL_RTX;
2068 /* Sequence of insns to perform a tail recursive "call". */
2069 rtx tail_call_insns = NULL_RTX;
2070 /* Data type of the function. */
2072 /* Declaration of the function being called,
2073 or 0 if the function is computed (not known by name). */
2076 int try_tail_call = 1;
2077 int try_tail_recursion = 1;
2080 /* Register in which non-BLKmode value will be returned,
2081 or 0 if no value or if value is BLKmode. */
2083 /* Address where we should return a BLKmode value;
2084 0 if value not BLKmode. */
2085 rtx structure_value_addr = 0;
2086 /* Nonzero if that address is being passed by treating it as
2087 an extra, implicit first parameter. Otherwise,
2088 it is passed by being copied directly into struct_value_rtx. */
2089 int structure_value_addr_parm = 0;
2090 /* Size of aggregate value wanted, or zero if none wanted
2091 or if we are using the non-reentrant PCC calling convention
2092 or expecting the value in registers. */
2093 HOST_WIDE_INT struct_value_size = 0;
2094 /* Nonzero if called function returns an aggregate in memory PCC style,
2095 by returning the address of where to find it. */
2096 int pcc_struct_value = 0;
2098 /* Number of actual parameters in this call, including struct value addr. */
2100 /* Number of named args. Args after this are anonymous ones
2101 and they must all go on the stack. */
2104 /* Vector of information about each argument.
2105 Arguments are numbered in the order they will be pushed,
2106 not the order they are written. */
2107 struct arg_data *args;
2109 /* Total size in bytes of all the stack-parms scanned so far. */
2110 struct args_size args_size;
2111 struct args_size adjusted_args_size;
2112 /* Size of arguments before any adjustments (such as rounding). */
2113 int unadjusted_args_size;
2114 /* Data on reg parms scanned so far. */
2115 CUMULATIVE_ARGS args_so_far;
2116 /* Nonzero if a reg parm has been scanned. */
2118 /* Nonzero if this is an indirect function call. */
2120 /* Nonzero if we must avoid push-insns in the args for this call.
2121 If stack space is allocated for register parameters, but not by the
2122 caller, then it is preallocated in the fixed part of the stack frame.
2123 So the entire argument block must then be preallocated (i.e., we
2124 ignore PUSH_ROUNDING in that case). */
2126 int must_preallocate = !PUSH_ARGS;
2128 /* Size of the stack reserved for parameter registers. */
2129 int reg_parm_stack_space = 0;
2131 /* Address of space preallocated for stack parms
2132 (on machines that lack push insns), or 0 if space not preallocated. */
2135 /* Mask of ECF_ flags. */
2137 /* Nonzero if this is a call to an inline function. */
2138 int is_integrable = 0;
2139 #ifdef REG_PARM_STACK_SPACE
2140 /* Define the boundary of the register parm stack space that needs to be
2142 int low_to_save = -1, high_to_save;
2143 rtx save_area = 0; /* Place that it is saved */
2146 int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
2147 char *initial_stack_usage_map = stack_usage_map;
2148 int old_stack_arg_under_construction = 0;
2150 rtx old_stack_level = 0;
2151 int old_pending_adj = 0;
2152 int old_inhibit_defer_pop = inhibit_defer_pop;
2153 int old_stack_allocated;
2155 register tree p = TREE_OPERAND (exp, 0);
2157 /* The alignment of the stack, in bits. */
2158 HOST_WIDE_INT preferred_stack_boundary;
2159 /* The alignment of the stack, in bytes. */
2160 HOST_WIDE_INT preferred_unit_stack_boundary;
2162 /* The value of the function call can be put in a hard register. But
2163 if -fcheck-memory-usage, code which invokes functions (and thus
2164 damages some hard registers) can be inserted before using the value.
2165 So, target is always a pseudo-register in that case. */
2166 if (current_function_check_memory_usage)
2169 /* See if this is "nothrow" function call. */
2170 if (TREE_NOTHROW (exp))
2171 flags |= ECF_NOTHROW;
2173 /* See if we can find a DECL-node for the actual function.
2174 As a result, decide whether this is a call to an integrable function. */
2176 fndecl = get_callee_fndecl (exp);
2180 && fndecl != current_function_decl
2181 && DECL_INLINE (fndecl)
2182 && DECL_SAVED_INSNS (fndecl)
2183 && DECL_SAVED_INSNS (fndecl)->inlinable)
2185 else if (! TREE_ADDRESSABLE (fndecl))
2187 /* In case this function later becomes inlinable,
2188 record that there was already a non-inline call to it.
2190 Use abstraction instead of setting TREE_ADDRESSABLE
2192 if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline
2195 warning_with_decl (fndecl, "can't inline call to `%s'");
2196 warning ("called from here");
2198 mark_addressable (fndecl);
2201 flags |= flags_from_decl_or_type (fndecl);
2204 /* If we don't have specific function to call, see if we have a
2205 attributes set in the type. */
2207 flags |= flags_from_decl_or_type (TREE_TYPE (TREE_TYPE (p)));
2209 /* Mark if the function returns with the stack pointer depressed. */
2210 if (TREE_CODE (TREE_TYPE (TREE_TYPE (p))) == FUNCTION_TYPE
2211 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (TREE_TYPE (p))))
2213 flags |= ECF_SP_DEPRESSED;
2214 flags &= ~(ECF_PURE | ECF_CONST);
2217 #ifdef REG_PARM_STACK_SPACE
2218 #ifdef MAYBE_REG_PARM_STACK_SPACE
2219 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
2221 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
2225 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2226 if (reg_parm_stack_space > 0 && PUSH_ARGS)
2227 must_preallocate = 1;
2230 /* Warn if this value is an aggregate type,
2231 regardless of which calling convention we are using for it. */
2232 if (warn_aggregate_return && AGGREGATE_TYPE_P (TREE_TYPE (exp)))
2233 warning ("function call has aggregate value");
2235 /* Set up a place to return a structure. */
2237 /* Cater to broken compilers. */
2238 if (aggregate_value_p (exp))
2240 /* This call returns a big structure. */
2241 flags &= ~(ECF_CONST | ECF_PURE);
2243 #ifdef PCC_STATIC_STRUCT_RETURN
2245 pcc_struct_value = 1;
2246 /* Easier than making that case work right. */
2249 /* In case this is a static function, note that it has been
2251 if (! TREE_ADDRESSABLE (fndecl))
2252 mark_addressable (fndecl);
2256 #else /* not PCC_STATIC_STRUCT_RETURN */
2258 struct_value_size = int_size_in_bytes (TREE_TYPE (exp));
2260 if (target && GET_CODE (target) == MEM)
2261 structure_value_addr = XEXP (target, 0);
2266 /* For variable-sized objects, we must be called with a target
2267 specified. If we were to allocate space on the stack here,
2268 we would have no way of knowing when to free it. */
2270 if (struct_value_size < 0)
2273 d = assign_temp (TREE_TYPE (exp), 1, 1, 1);
2274 mark_temp_addr_taken (d);
2275 structure_value_addr = XEXP (d, 0);
2279 #endif /* not PCC_STATIC_STRUCT_RETURN */
2282 /* If called function is inline, try to integrate it. */
2286 rtx temp = try_to_integrate (fndecl, actparms, target,
2287 ignore, TREE_TYPE (exp),
2288 structure_value_addr);
2289 if (temp != (rtx) (HOST_WIDE_INT) - 1)
2293 /* Figure out the amount to which the stack should be aligned. */
2294 #ifdef PREFERRED_STACK_BOUNDARY
2295 preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
2297 preferred_stack_boundary = STACK_BOUNDARY;
2300 /* Operand 0 is a pointer-to-function; get the type of the function. */
2301 funtype = TREE_TYPE (TREE_OPERAND (exp, 0));
2302 if (! POINTER_TYPE_P (funtype))
2304 funtype = TREE_TYPE (funtype);
2306 /* See if this is a call to a function that can return more than once
2307 or a call to longjmp or malloc. */
2308 flags |= special_function_p (fndecl, flags);
2310 if (flags & ECF_MAY_BE_ALLOCA)
2311 current_function_calls_alloca = 1;
2313 /* If struct_value_rtx is 0, it means pass the address
2314 as if it were an extra parameter. */
2315 if (structure_value_addr && struct_value_rtx == 0)
2317 /* If structure_value_addr is a REG other than
2318 virtual_outgoing_args_rtx, we can use always use it. If it
2319 is not a REG, we must always copy it into a register.
2320 If it is virtual_outgoing_args_rtx, we must copy it to another
2321 register in some cases. */
2322 rtx temp = (GET_CODE (structure_value_addr) != REG
2323 || (ACCUMULATE_OUTGOING_ARGS
2324 && stack_arg_under_construction
2325 && structure_value_addr == virtual_outgoing_args_rtx)
2326 ? copy_addr_to_reg (structure_value_addr)
2327 : structure_value_addr);
2330 = tree_cons (error_mark_node,
2331 make_tree (build_pointer_type (TREE_TYPE (funtype)),
2334 structure_value_addr_parm = 1;
2337 /* Count the arguments and set NUM_ACTUALS. */
2338 for (p = actparms, num_actuals = 0; p; p = TREE_CHAIN (p))
2341 /* Compute number of named args.
2342 Normally, don't include the last named arg if anonymous args follow.
2343 We do include the last named arg if STRICT_ARGUMENT_NAMING is nonzero.
2344 (If no anonymous args follow, the result of list_length is actually
2345 one too large. This is harmless.)
2347 If PRETEND_OUTGOING_VARARGS_NAMED is set and STRICT_ARGUMENT_NAMING is
2348 zero, this machine will be able to place unnamed args that were
2349 passed in registers into the stack. So treat all args as named.
2350 This allows the insns emitting for a specific argument list to be
2351 independent of the function declaration.
2353 If PRETEND_OUTGOING_VARARGS_NAMED is not set, we do not have any
2354 reliable way to pass unnamed args in registers, so we must force
2355 them into memory. */
2357 if ((STRICT_ARGUMENT_NAMING
2358 || ! PRETEND_OUTGOING_VARARGS_NAMED)
2359 && TYPE_ARG_TYPES (funtype) != 0)
2361 = (list_length (TYPE_ARG_TYPES (funtype))
2362 /* Don't include the last named arg. */
2363 - (STRICT_ARGUMENT_NAMING ? 0 : 1)
2364 /* Count the struct value address, if it is passed as a parm. */
2365 + structure_value_addr_parm);
2367 /* If we know nothing, treat all args as named. */
2368 n_named_args = num_actuals;
2370 /* Start updating where the next arg would go.
2372 On some machines (such as the PA) indirect calls have a different
2373 calling convention than normal calls. The last argument in
2374 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
2376 INIT_CUMULATIVE_ARGS (args_so_far, funtype, NULL_RTX, (fndecl == 0));
2378 /* Make a vector to hold all the information about each arg. */
2379 args = (struct arg_data *) alloca (num_actuals * sizeof (struct arg_data));
2380 bzero ((char *) args, num_actuals * sizeof (struct arg_data));
2382 /* Build up entries inthe ARGS array, compute the size of the arguments
2383 into ARGS_SIZE, etc. */
2384 initialize_argument_information (num_actuals, args, &args_size,
2385 n_named_args, actparms, fndecl,
2386 &args_so_far, reg_parm_stack_space,
2387 &old_stack_level, &old_pending_adj,
2388 &must_preallocate, &flags);
2392 /* If this function requires a variable-sized argument list, don't
2393 try to make a cse'able block for this call. We may be able to
2394 do this eventually, but it is too complicated to keep track of
2395 what insns go in the cse'able block and which don't. */
2397 flags &= ~(ECF_CONST | ECF_PURE);
2398 must_preallocate = 1;
2401 /* Now make final decision about preallocating stack space. */
2402 must_preallocate = finalize_must_preallocate (must_preallocate,
2406 /* If the structure value address will reference the stack pointer, we
2407 must stabilize it. We don't need to do this if we know that we are
2408 not going to adjust the stack pointer in processing this call. */
2410 if (structure_value_addr
2411 && (reg_mentioned_p (virtual_stack_dynamic_rtx, structure_value_addr)
2412 || reg_mentioned_p (virtual_outgoing_args_rtx,
2413 structure_value_addr))
2415 || (!ACCUMULATE_OUTGOING_ARGS && args_size.constant)))
2416 structure_value_addr = copy_to_reg (structure_value_addr);
2418 /* Tail calls can make things harder to debug, and we're traditionally
2419 pushed these optimizations into -O2. Don't try if we're already
2420 expanding a call, as that means we're an argument. Similarly, if
2421 there's pending loops or cleanups we know there's code to follow
2424 If rtx_equal_function_value_matters is false, that means we've
2425 finished with regular parsing. Which means that some of the
2426 machinery we use to generate tail-calls is no longer in place.
2427 This is most often true of sjlj-exceptions, which we couldn't
2428 tail-call to anyway. */
2430 if (currently_expanding_call++ != 0
2431 || !flag_optimize_sibling_calls
2432 || !rtx_equal_function_value_matters
2433 || !stmt_loop_nest_empty ()
2434 || any_pending_cleanups (1)
2436 try_tail_call = try_tail_recursion = 0;
2438 /* Tail recursion fails, when we are not dealing with recursive calls. */
2439 if (!try_tail_recursion
2440 || TREE_CODE (TREE_OPERAND (exp, 0)) != ADDR_EXPR
2441 || TREE_OPERAND (TREE_OPERAND (exp, 0), 0) != current_function_decl)
2442 try_tail_recursion = 0;
2444 /* Rest of purposes for tail call optimizations to fail. */
2446 #ifdef HAVE_sibcall_epilogue
2447 !HAVE_sibcall_epilogue
2452 /* Doing sibling call optimization needs some work, since
2453 structure_value_addr can be allocated on the stack.
2454 It does not seem worth the effort since few optimizable
2455 sibling calls will return a structure. */
2456 || structure_value_addr != NULL_RTX
2457 /* If the register holding the address is a callee saved
2458 register, then we lose. We have no way to prevent that,
2459 so we only allow calls to named functions. */
2460 /* ??? This could be done by having the insn constraints
2461 use a register class that is all call-clobbered. Any
2462 reload insns generated to fix things up would appear
2463 before the sibcall_epilogue. */
2464 || fndecl == NULL_TREE
2465 || (flags & (ECF_RETURNS_TWICE | ECF_LONGJMP))
2466 || TREE_THIS_VOLATILE (fndecl)
2467 || !FUNCTION_OK_FOR_SIBCALL (fndecl)
2468 /* If this function requires more stack slots than the current
2469 function, we cannot change it into a sibling call. */
2470 || args_size.constant > current_function_args_size
2471 /* If the callee pops its own arguments, then it must pop exactly
2472 the same number of arguments as the current function. */
2473 || RETURN_POPS_ARGS (fndecl, funtype, args_size.constant)
2474 != RETURN_POPS_ARGS (current_function_decl,
2475 TREE_TYPE (current_function_decl),
2476 current_function_args_size))
2479 if (try_tail_call || try_tail_recursion)
2482 actparms = NULL_TREE;
2483 /* Ok, we're going to give the tail call the old college try.
2484 This means we're going to evaluate the function arguments
2485 up to three times. There are two degrees of badness we can
2486 encounter, those that can be unsaved and those that can't.
2487 (See unsafe_for_reeval commentary for details.)
2489 Generate a new argument list. Pass safe arguments through
2490 unchanged. For the easy badness wrap them in UNSAVE_EXPRs.
2491 For hard badness, evaluate them now and put their resulting
2492 rtx in a temporary VAR_DECL.
2494 initialize_argument_information has ordered the array for the
2495 order to be pushed, and we must remember this when reconstructing
2496 the original argument orde. */
2498 if (PUSH_ARGS_REVERSED)
2507 i = num_actuals - 1;
2511 for (; i != end; i += inc)
2513 switch (unsafe_for_reeval (args[i].tree_value))
2518 case 1: /* Mildly unsafe. */
2519 args[i].tree_value = unsave_expr (args[i].tree_value);
2522 case 2: /* Wildly unsafe. */
2524 tree var = build_decl (VAR_DECL, NULL_TREE,
2525 TREE_TYPE (args[i].tree_value));
2526 DECL_RTL (var) = expand_expr (args[i].tree_value, NULL_RTX,
2527 VOIDmode, EXPAND_NORMAL);
2528 args[i].tree_value = var;
2535 /* We need to build actparms for optimize_tail_recursion. We can
2536 safely trash away TREE_PURPOSE, since it is unused by this
2538 if (try_tail_recursion)
2539 actparms = tree_cons (NULL_TREE, args[i].tree_value, actparms);
2541 /* Expanding one of those dangerous arguments could have added
2542 cleanups, but otherwise give it a whirl. */
2543 if (any_pending_cleanups (1))
2544 try_tail_call = try_tail_recursion = 0;
2547 /* Generate a tail recursion sequence when calling ourselves. */
2549 if (try_tail_recursion)
2551 /* We want to emit any pending stack adjustments before the tail
2552 recursion "call". That way we know any adjustment after the tail
2553 recursion call can be ignored if we indeed use the tail recursion
2555 int save_pending_stack_adjust = pending_stack_adjust;
2556 int save_stack_pointer_delta = stack_pointer_delta;
2558 /* Use a new sequence to hold any RTL we generate. We do not even
2559 know if we will use this RTL yet. The final decision can not be
2560 made until after RTL generation for the entire function is
2563 /* If expanding any of the arguments creates cleanups, we can't
2564 do a tailcall. So, we'll need to pop the pending cleanups
2565 list. If, however, all goes well, and there are no cleanups
2566 then the call to expand_start_target_temps will have no
2568 expand_start_target_temps ();
2569 if (optimize_tail_recursion (actparms, get_last_insn ()))
2571 if (any_pending_cleanups (1))
2572 try_tail_call = try_tail_recursion = 0;
2574 tail_recursion_insns = get_insns ();
2576 expand_end_target_temps ();
2579 /* Restore the original pending stack adjustment for the sibling and
2580 normal call cases below. */
2581 pending_stack_adjust = save_pending_stack_adjust;
2582 stack_pointer_delta = save_stack_pointer_delta;
2585 if (profile_arc_flag && (flags & ECF_FORK_OR_EXEC))
2587 /* A fork duplicates the profile information, and an exec discards
2588 it. We can't rely on fork/exec to be paired. So write out the
2589 profile information we have gathered so far, and clear it. */
2590 /* ??? When Linux's __clone is called with CLONE_VM set, profiling
2591 is subject to race conditions, just as with multithreaded
2594 emit_library_call (gen_rtx_SYMBOL_REF (Pmode, "__bb_fork_func"), 0,
2598 /* Ensure current function's preferred stack boundary is at least
2599 what we need. We don't have to increase alignment for recursive
2601 if (cfun->preferred_stack_boundary < preferred_stack_boundary
2602 && fndecl != current_function_decl)
2603 cfun->preferred_stack_boundary = preferred_stack_boundary;
2605 preferred_unit_stack_boundary = preferred_stack_boundary / BITS_PER_UNIT;
2607 function_call_count++;
2609 /* We want to make two insn chains; one for a sibling call, the other
2610 for a normal call. We will select one of the two chains after
2611 initial RTL generation is complete. */
2612 for (pass = 0; pass < 2; pass++)
2614 int sibcall_failure = 0;
2615 /* We want to emit ay pending stack adjustments before the tail
2616 recursion "call". That way we know any adjustment after the tail
2617 recursion call can be ignored if we indeed use the tail recursion
2619 int save_pending_stack_adjust = 0;
2620 int save_stack_pointer_delta = 0;
2622 rtx before_call, next_arg_reg;
2626 if (! try_tail_call)
2629 /* Emit any queued insns now; otherwise they would end up in
2630 only one of the alternates. */
2633 /* State variables we need to save and restore between
2635 save_pending_stack_adjust = pending_stack_adjust;
2636 save_stack_pointer_delta = stack_pointer_delta;
2639 flags &= ~ECF_SIBCALL;
2641 flags |= ECF_SIBCALL;
2643 /* Other state variables that we must reinitialize each time
2644 through the loop (that are not initialized by the loop itself). */
2648 /* Start a new sequence for the normal call case.
2650 From this point on, if the sibling call fails, we want to set
2651 sibcall_failure instead of continuing the loop. */
2656 /* We know at this point that there are not currently any
2657 pending cleanups. If, however, in the process of evaluating
2658 the arguments we were to create some, we'll need to be
2659 able to get rid of them. */
2660 expand_start_target_temps ();
2663 /* When calling a const function, we must pop the stack args right away,
2664 so that the pop is deleted or moved with the call. */
2665 if (flags & (ECF_CONST | ECF_PURE))
2668 /* Don't let pending stack adjusts add up to too much.
2669 Also, do all pending adjustments now if there is any chance
2670 this might be a call to alloca or if we are expanding a sibling
2672 if (pending_stack_adjust >= 32
2673 || (pending_stack_adjust > 0 && (flags & ECF_MAY_BE_ALLOCA))
2675 do_pending_stack_adjust ();
2677 /* Push the temporary stack slot level so that we can free any
2678 temporaries we make. */
2681 #ifdef FINAL_REG_PARM_STACK_SPACE
2682 reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant,
2685 /* Precompute any arguments as needed. */
2687 precompute_arguments (flags, num_actuals, args);
2689 /* Now we are about to start emitting insns that can be deleted
2690 if a libcall is deleted. */
2691 if (flags & (ECF_CONST | ECF_PURE | ECF_MALLOC))
2694 adjusted_args_size = args_size;
2695 /* Compute the actual size of the argument block required. The variable
2696 and constant sizes must be combined, the size may have to be rounded,
2697 and there may be a minimum required size. When generating a sibcall
2698 pattern, do not round up, since we'll be re-using whatever space our
2700 unadjusted_args_size
2701 = compute_argument_block_size (reg_parm_stack_space,
2702 &adjusted_args_size,
2704 : preferred_stack_boundary));
2706 old_stack_allocated = stack_pointer_delta - pending_stack_adjust;
2708 /* The argument block when performing a sibling call is the
2709 incoming argument block. */
2712 argblock = virtual_incoming_args_rtx;
2713 stored_args_map = sbitmap_alloc (args_size.constant);
2714 sbitmap_zero (stored_args_map);
2717 /* If we have no actual push instructions, or shouldn't use them,
2718 make space for all args right now. */
2719 else if (adjusted_args_size.var != 0)
2721 if (old_stack_level == 0)
2723 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
2724 old_pending_adj = pending_stack_adjust;
2725 pending_stack_adjust = 0;
2726 /* stack_arg_under_construction says whether a stack arg is
2727 being constructed at the old stack level. Pushing the stack
2728 gets a clean outgoing argument block. */
2729 old_stack_arg_under_construction = stack_arg_under_construction;
2730 stack_arg_under_construction = 0;
2732 argblock = push_block (ARGS_SIZE_RTX (adjusted_args_size), 0, 0);
2736 /* Note that we must go through the motions of allocating an argument
2737 block even if the size is zero because we may be storing args
2738 in the area reserved for register arguments, which may be part of
2741 int needed = adjusted_args_size.constant;
2743 /* Store the maximum argument space used. It will be pushed by
2744 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
2747 if (needed > current_function_outgoing_args_size)
2748 current_function_outgoing_args_size = needed;
2750 if (must_preallocate)
2752 if (ACCUMULATE_OUTGOING_ARGS)
2754 /* Since the stack pointer will never be pushed, it is
2755 possible for the evaluation of a parm to clobber
2756 something we have already written to the stack.
2757 Since most function calls on RISC machines do not use
2758 the stack, this is uncommon, but must work correctly.
2760 Therefore, we save any area of the stack that was already
2761 written and that we are using. Here we set up to do this
2762 by making a new stack usage map from the old one. The
2763 actual save will be done by store_one_arg.
2765 Another approach might be to try to reorder the argument
2766 evaluations to avoid this conflicting stack usage. */
2768 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2769 /* Since we will be writing into the entire argument area,
2770 the map must be allocated for its entire size, not just
2771 the part that is the responsibility of the caller. */
2772 needed += reg_parm_stack_space;
2775 #ifdef ARGS_GROW_DOWNWARD
2776 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
2779 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
2783 = (char *) alloca (highest_outgoing_arg_in_use);
2785 if (initial_highest_arg_in_use)
2786 bcopy (initial_stack_usage_map, stack_usage_map,
2787 initial_highest_arg_in_use);
2789 if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
2790 bzero (&stack_usage_map[initial_highest_arg_in_use],
2791 (highest_outgoing_arg_in_use
2792 - initial_highest_arg_in_use));
2795 /* The address of the outgoing argument list must not be
2796 copied to a register here, because argblock would be left
2797 pointing to the wrong place after the call to
2798 allocate_dynamic_stack_space below. */
2800 argblock = virtual_outgoing_args_rtx;
2804 if (inhibit_defer_pop == 0)
2806 /* Try to reuse some or all of the pending_stack_adjust
2807 to get this space. */
2809 = (combine_pending_stack_adjustment_and_call
2810 (unadjusted_args_size,
2811 &adjusted_args_size,
2812 preferred_unit_stack_boundary));
2814 /* combine_pending_stack_adjustment_and_call computes
2815 an adjustment before the arguments are allocated.
2816 Account for them and see whether or not the stack
2817 needs to go up or down. */
2818 needed = unadjusted_args_size - needed;
2822 /* We're releasing stack space. */
2823 /* ??? We can avoid any adjustment at all if we're
2824 already aligned. FIXME. */
2825 pending_stack_adjust = -needed;
2826 do_pending_stack_adjust ();
2830 /* We need to allocate space. We'll do that in
2831 push_block below. */
2832 pending_stack_adjust = 0;
2835 /* Special case this because overhead of `push_block' in
2836 this case is non-trivial. */
2838 argblock = virtual_outgoing_args_rtx;
2840 argblock = push_block (GEN_INT (needed), 0, 0);
2842 /* We only really need to call `copy_to_reg' in the case
2843 where push insns are going to be used to pass ARGBLOCK
2844 to a function call in ARGS. In that case, the stack
2845 pointer changes value from the allocation point to the
2846 call point, and hence the value of
2847 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
2848 as well always do it. */
2849 argblock = copy_to_reg (argblock);
2851 /* The save/restore code in store_one_arg handles all
2852 cases except one: a constructor call (including a C
2853 function returning a BLKmode struct) to initialize
2855 if (stack_arg_under_construction)
2857 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2858 rtx push_size = GEN_INT (reg_parm_stack_space
2859 + adjusted_args_size.constant);
2861 rtx push_size = GEN_INT (adjusted_args_size.constant);
2863 if (old_stack_level == 0)
2865 emit_stack_save (SAVE_BLOCK, &old_stack_level,
2867 old_pending_adj = pending_stack_adjust;
2868 pending_stack_adjust = 0;
2869 /* stack_arg_under_construction says whether a stack
2870 arg is being constructed at the old stack level.
2871 Pushing the stack gets a clean outgoing argument
2873 old_stack_arg_under_construction
2874 = stack_arg_under_construction;
2875 stack_arg_under_construction = 0;
2876 /* Make a new map for the new argument list. */
2877 stack_usage_map = (char *)
2878 alloca (highest_outgoing_arg_in_use);
2879 bzero (stack_usage_map, highest_outgoing_arg_in_use);
2880 highest_outgoing_arg_in_use = 0;
2882 allocate_dynamic_stack_space (push_size, NULL_RTX,
2885 /* If argument evaluation might modify the stack pointer,
2886 copy the address of the argument list to a register. */
2887 for (i = 0; i < num_actuals; i++)
2888 if (args[i].pass_on_stack)
2890 argblock = copy_addr_to_reg (argblock);
2897 compute_argument_addresses (args, argblock, num_actuals);
2899 #ifdef PREFERRED_STACK_BOUNDARY
2900 /* If we push args individually in reverse order, perform stack alignment
2901 before the first push (the last arg). */
2902 if (PUSH_ARGS_REVERSED && argblock == 0
2903 && adjusted_args_size.constant != unadjusted_args_size)
2905 /* When the stack adjustment is pending, we get better code
2906 by combining the adjustments. */
2907 if (pending_stack_adjust
2908 && ! (flags & (ECF_CONST | ECF_PURE))
2909 && ! inhibit_defer_pop)
2911 pending_stack_adjust
2912 = (combine_pending_stack_adjustment_and_call
2913 (unadjusted_args_size,
2914 &adjusted_args_size,
2915 preferred_unit_stack_boundary));
2916 do_pending_stack_adjust ();
2918 else if (argblock == 0)
2919 anti_adjust_stack (GEN_INT (adjusted_args_size.constant
2920 - unadjusted_args_size));
2922 /* Now that the stack is properly aligned, pops can't safely
2923 be deferred during the evaluation of the arguments. */
2927 /* Don't try to defer pops if preallocating, not even from the first arg,
2928 since ARGBLOCK probably refers to the SP. */
2932 funexp = rtx_for_function_call (fndecl, exp);
2934 /* Figure out the register where the value, if any, will come back. */
2936 if (TYPE_MODE (TREE_TYPE (exp)) != VOIDmode
2937 && ! structure_value_addr)
2939 if (pcc_struct_value)
2940 valreg = hard_function_value (build_pointer_type (TREE_TYPE (exp)),
2941 fndecl, (pass == 0));
2943 valreg = hard_function_value (TREE_TYPE (exp), fndecl, (pass == 0));
2946 /* Precompute all register parameters. It isn't safe to compute anything
2947 once we have started filling any specific hard regs. */
2948 precompute_register_parameters (num_actuals, args, ®_parm_seen);
2950 #ifdef REG_PARM_STACK_SPACE
2951 /* Save the fixed argument area if it's part of the caller's frame and
2952 is clobbered by argument setup for this call. */
2953 if (ACCUMULATE_OUTGOING_ARGS && pass)
2954 save_area = save_fixed_argument_area (reg_parm_stack_space, argblock,
2955 &low_to_save, &high_to_save);
2958 /* Now store (and compute if necessary) all non-register parms.
2959 These come before register parms, since they can require block-moves,
2960 which could clobber the registers used for register parms.
2961 Parms which have partial registers are not stored here,
2962 but we do preallocate space here if they want that. */
2964 for (i = 0; i < num_actuals; i++)
2965 if (args[i].reg == 0 || args[i].pass_on_stack)
2967 rtx before_arg = get_last_insn ();
2969 if (store_one_arg (&args[i], argblock, flags,
2970 adjusted_args_size.var != 0,
2971 reg_parm_stack_space)
2973 && check_sibcall_argument_overlap (before_arg,
2975 sibcall_failure = 1;
2978 /* If we have a parm that is passed in registers but not in memory
2979 and whose alignment does not permit a direct copy into registers,
2980 make a group of pseudos that correspond to each register that we
2982 if (STRICT_ALIGNMENT)
2983 store_unaligned_arguments_into_pseudos (args, num_actuals);
2985 /* Now store any partially-in-registers parm.
2986 This is the last place a block-move can happen. */
2988 for (i = 0; i < num_actuals; i++)
2989 if (args[i].partial != 0 && ! args[i].pass_on_stack)
2991 rtx before_arg = get_last_insn ();
2993 if (store_one_arg (&args[i], argblock, flags,
2994 adjusted_args_size.var != 0,
2995 reg_parm_stack_space)
2997 && check_sibcall_argument_overlap (before_arg,
2999 sibcall_failure = 1;
3002 #ifdef PREFERRED_STACK_BOUNDARY
3003 /* If we pushed args in forward order, perform stack alignment
3004 after pushing the last arg. */
3005 if (!PUSH_ARGS_REVERSED && argblock == 0)
3006 anti_adjust_stack (GEN_INT (adjusted_args_size.constant
3007 - unadjusted_args_size));
3010 /* If register arguments require space on the stack and stack space
3011 was not preallocated, allocate stack space here for arguments
3012 passed in registers. */
3013 #ifdef OUTGOING_REG_PARM_STACK_SPACE
3014 if (!ACCUMULATE_OUTGOING_ARGS
3015 && must_preallocate == 0 && reg_parm_stack_space > 0)
3016 anti_adjust_stack (GEN_INT (reg_parm_stack_space));
3019 /* Pass the function the address in which to return a
3021 if (pass != 0 && structure_value_addr && ! structure_value_addr_parm)
3023 emit_move_insn (struct_value_rtx,
3025 force_operand (structure_value_addr,
3028 /* Mark the memory for the aggregate as write-only. */
3029 if (current_function_check_memory_usage)
3030 emit_library_call (chkr_set_right_libfunc, LCT_CONST_MAKE_BLOCK,
3032 structure_value_addr, ptr_mode,
3033 GEN_INT (struct_value_size),
3034 TYPE_MODE (sizetype),
3035 GEN_INT (MEMORY_USE_WO),
3036 TYPE_MODE (integer_type_node));
3038 if (GET_CODE (struct_value_rtx) == REG)
3039 use_reg (&call_fusage, struct_value_rtx);
3042 funexp = prepare_call_address (funexp, fndecl, &call_fusage,
3045 load_register_parameters (args, num_actuals, &call_fusage, flags);
3047 /* Perform postincrements before actually calling the function. */
3050 /* Save a pointer to the last insn before the call, so that we can
3051 later safely search backwards to find the CALL_INSN. */
3052 before_call = get_last_insn ();
3054 /* Set up next argument register. For sibling calls on machines
3055 with register windows this should be the incoming register. */
3056 #ifdef FUNCTION_INCOMING_ARG
3058 next_arg_reg = FUNCTION_INCOMING_ARG (args_so_far, VOIDmode,
3062 next_arg_reg = FUNCTION_ARG (args_so_far, VOIDmode,
3065 /* All arguments and registers used for the call must be set up by
3068 #ifdef PREFERRED_STACK_BOUNDARY
3069 /* Stack must be properly aligned now. */
3070 if (pass && stack_pointer_delta % preferred_unit_stack_boundary)
3074 /* Generate the actual call instruction. */
3075 emit_call_1 (funexp, fndecl, funtype, unadjusted_args_size,
3076 adjusted_args_size.constant, struct_value_size,
3077 next_arg_reg, valreg, old_inhibit_defer_pop, call_fusage,
3080 /* Verify that we've deallocated all the stack we used. */
3082 && old_stack_allocated != stack_pointer_delta - pending_stack_adjust)
3085 /* If call is cse'able, make appropriate pair of reg-notes around it.
3086 Test valreg so we don't crash; may safely ignore `const'
3087 if return type is void. Disable for PARALLEL return values, because
3088 we have no way to move such values into a pseudo register. */
3090 && (flags & (ECF_CONST | ECF_PURE))
3091 && valreg != 0 && GET_CODE (valreg) != PARALLEL)
3094 rtx temp = gen_reg_rtx (GET_MODE (valreg));
3097 /* Mark the return value as a pointer if needed. */
3098 if (TREE_CODE (TREE_TYPE (exp)) == POINTER_TYPE)
3099 mark_reg_pointer (temp, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp))));
3101 /* Construct an "equal form" for the value which mentions all the
3102 arguments in order as well as the function name. */
3103 for (i = 0; i < num_actuals; i++)
3104 note = gen_rtx_EXPR_LIST (VOIDmode, args[i].initial_value, note);
3105 note = gen_rtx_EXPR_LIST (VOIDmode, funexp, note);
3107 insns = get_insns ();
3110 if (flags & ECF_PURE)
3111 note = gen_rtx_EXPR_LIST (VOIDmode,
3112 gen_rtx_USE (VOIDmode,
3113 gen_rtx_MEM (BLKmode,
3114 gen_rtx_SCRATCH (VOIDmode))), note);
3116 emit_libcall_block (insns, temp, valreg, note);
3120 else if (flags & (ECF_CONST | ECF_PURE))
3122 /* Otherwise, just write out the sequence without a note. */
3123 rtx insns = get_insns ();
3128 else if (flags & ECF_MALLOC)
3130 rtx temp = gen_reg_rtx (GET_MODE (valreg));
3133 /* The return value from a malloc-like function is a pointer. */
3134 if (TREE_CODE (TREE_TYPE (exp)) == POINTER_TYPE)
3135 mark_reg_pointer (temp, BIGGEST_ALIGNMENT);
3137 emit_move_insn (temp, valreg);
3139 /* The return value from a malloc-like function can not alias
3141 last = get_last_insn ();
3143 gen_rtx_EXPR_LIST (REG_NOALIAS, temp, REG_NOTES (last));
3145 /* Write out the sequence. */
3146 insns = get_insns ();
3152 /* For calls to `setjmp', etc., inform flow.c it should complain
3153 if nonvolatile values are live. For functions that cannot return,
3154 inform flow that control does not fall through. */
3156 if ((flags & (ECF_RETURNS_TWICE | ECF_NORETURN | ECF_LONGJMP)) || pass == 0)
3158 /* The barrier or NOTE_INSN_SETJMP note must be emitted
3159 immediately after the CALL_INSN. Some ports emit more
3160 than just a CALL_INSN above, so we must search for it here. */
3162 rtx last = get_last_insn ();
3163 while (GET_CODE (last) != CALL_INSN)
3165 last = PREV_INSN (last);
3166 /* There was no CALL_INSN? */
3167 if (last == before_call)
3171 if (flags & ECF_RETURNS_TWICE)
3173 emit_note_after (NOTE_INSN_SETJMP, last);
3174 current_function_calls_setjmp = 1;
3177 emit_barrier_after (last);
3180 if (flags & ECF_LONGJMP)
3181 current_function_calls_longjmp = 1;
3183 /* If this function is returning into a memory location marked as
3184 readonly, it means it is initializing that location. But we normally
3185 treat functions as not clobbering such locations, so we need to
3186 specify that this one does. */
3187 if (target != 0 && GET_CODE (target) == MEM
3188 && structure_value_addr != 0 && RTX_UNCHANGING_P (target))
3189 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
3191 /* If value type not void, return an rtx for the value. */
3193 /* If there are cleanups to be called, don't use a hard reg as target.
3194 We need to double check this and see if it matters anymore. */
3195 if (any_pending_cleanups (1))
3197 if (target && REG_P (target)
3198 && REGNO (target) < FIRST_PSEUDO_REGISTER)
3200 sibcall_failure = 1;
3203 if (TYPE_MODE (TREE_TYPE (exp)) == VOIDmode
3206 target = const0_rtx;
3208 else if (structure_value_addr)
3210 if (target == 0 || GET_CODE (target) != MEM)
3213 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
3214 memory_address (TYPE_MODE (TREE_TYPE (exp)),
3215 structure_value_addr));
3216 set_mem_attributes (target, exp, 1);
3219 else if (pcc_struct_value)
3221 /* This is the special C++ case where we need to
3222 know what the true target was. We take care to
3223 never use this value more than once in one expression. */
3224 target = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
3225 copy_to_reg (valreg));
3226 set_mem_attributes (target, exp, 1);
3228 /* Handle calls that return values in multiple non-contiguous locations.
3229 The Irix 6 ABI has examples of this. */
3230 else if (GET_CODE (valreg) == PARALLEL)
3232 int bytes = int_size_in_bytes (TREE_TYPE (exp));
3236 target = assign_stack_temp (TYPE_MODE (TREE_TYPE (exp)),
3238 MEM_SET_IN_STRUCT_P (target, AGGREGATE_TYPE_P (TREE_TYPE (exp)));
3239 preserve_temp_slots (target);
3242 if (! rtx_equal_p (target, valreg))
3243 emit_group_store (target, valreg, bytes,
3244 TYPE_ALIGN (TREE_TYPE (exp)));
3246 /* We can not support sibling calls for this case. */
3247 sibcall_failure = 1;
3250 && GET_MODE (target) == TYPE_MODE (TREE_TYPE (exp))
3251 && GET_MODE (target) == GET_MODE (valreg))
3253 /* TARGET and VALREG cannot be equal at this point because the
3254 latter would not have REG_FUNCTION_VALUE_P true, while the
3255 former would if it were referring to the same register.
3257 If they refer to the same register, this move will be a no-op,
3258 except when function inlining is being done. */
3259 emit_move_insn (target, valreg);
3261 else if (TYPE_MODE (TREE_TYPE (exp)) == BLKmode)
3262 target = copy_blkmode_from_reg (target, valreg, TREE_TYPE (exp));
3264 target = copy_to_reg (valreg);
3266 #ifdef PROMOTE_FUNCTION_RETURN
3267 /* If we promoted this return value, make the proper SUBREG. TARGET
3268 might be const0_rtx here, so be careful. */
3269 if (GET_CODE (target) == REG
3270 && TYPE_MODE (TREE_TYPE (exp)) != BLKmode
3271 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
3273 tree type = TREE_TYPE (exp);
3274 int unsignedp = TREE_UNSIGNED (type);
3276 /* If we don't promote as expected, something is wrong. */
3277 if (GET_MODE (target)
3278 != promote_mode (type, TYPE_MODE (type), &unsignedp, 1))
3281 target = gen_rtx_SUBREG (TYPE_MODE (type), target, 0);
3282 SUBREG_PROMOTED_VAR_P (target) = 1;
3283 SUBREG_PROMOTED_UNSIGNED_P (target) = unsignedp;
3287 /* If size of args is variable or this was a constructor call for a stack
3288 argument, restore saved stack-pointer value. */
3290 if (old_stack_level && ! (flags & ECF_SP_DEPRESSED))
3292 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
3293 pending_stack_adjust = old_pending_adj;
3294 stack_arg_under_construction = old_stack_arg_under_construction;
3295 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
3296 stack_usage_map = initial_stack_usage_map;
3297 sibcall_failure = 1;
3299 else if (ACCUMULATE_OUTGOING_ARGS && pass)
3301 #ifdef REG_PARM_STACK_SPACE
3304 restore_fixed_argument_area (save_area, argblock,
3305 high_to_save, low_to_save);
3309 /* If we saved any argument areas, restore them. */
3310 for (i = 0; i < num_actuals; i++)
3311 if (args[i].save_area)
3313 enum machine_mode save_mode = GET_MODE (args[i].save_area);
3315 = gen_rtx_MEM (save_mode,
3316 memory_address (save_mode,
3317 XEXP (args[i].stack_slot, 0)));
3319 if (save_mode != BLKmode)
3320 emit_move_insn (stack_area, args[i].save_area);
3322 emit_block_move (stack_area,
3323 validize_mem (args[i].save_area),
3324 GEN_INT (args[i].size.constant),
3328 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
3329 stack_usage_map = initial_stack_usage_map;
3332 /* If this was alloca, record the new stack level for nonlocal gotos.
3333 Check for the handler slots since we might not have a save area
3334 for non-local gotos. */
3336 if ((flags & ECF_MAY_BE_ALLOCA) && nonlocal_goto_handler_slots != 0)
3337 emit_stack_save (SAVE_NONLOCAL, &nonlocal_goto_stack_level, NULL_RTX);
3341 /* Free up storage we no longer need. */
3342 for (i = 0; i < num_actuals; ++i)
3343 if (args[i].aligned_regs)
3344 free (args[i].aligned_regs);
3348 /* Undo the fake expand_start_target_temps we did earlier. If
3349 there had been any cleanups created, we've already set
3351 expand_end_target_temps ();
3354 insns = get_insns ();
3359 tail_call_insns = insns;
3361 /* If something prevents making this a sibling call,
3362 zero out the sequence. */
3363 if (sibcall_failure)
3364 tail_call_insns = NULL_RTX;
3365 /* Restore the pending stack adjustment now that we have
3366 finished generating the sibling call sequence. */
3368 pending_stack_adjust = save_pending_stack_adjust;
3369 stack_pointer_delta = save_stack_pointer_delta;
3371 /* Prepare arg structure for next iteration. */
3372 for (i = 0; i < num_actuals; i++)
3375 args[i].aligned_regs = 0;
3379 sbitmap_free (stored_args_map);
3382 normal_call_insns = insns;
3385 /* The function optimize_sibling_and_tail_recursive_calls doesn't
3386 handle CALL_PLACEHOLDERs inside other CALL_PLACEHOLDERs. This
3387 can happen if the arguments to this function call an inline
3388 function who's expansion contains another CALL_PLACEHOLDER.
3390 If there are any C_Ps in any of these sequences, replace them
3391 with their normal call. */
3393 for (insn = normal_call_insns; insn; insn = NEXT_INSN (insn))
3394 if (GET_CODE (insn) == CALL_INSN
3395 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
3396 replace_call_placeholder (insn, sibcall_use_normal);
3398 for (insn = tail_call_insns; insn; insn = NEXT_INSN (insn))
3399 if (GET_CODE (insn) == CALL_INSN
3400 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
3401 replace_call_placeholder (insn, sibcall_use_normal);
3403 for (insn = tail_recursion_insns; insn; insn = NEXT_INSN (insn))
3404 if (GET_CODE (insn) == CALL_INSN
3405 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
3406 replace_call_placeholder (insn, sibcall_use_normal);
3408 /* If this was a potential tail recursion site, then emit a
3409 CALL_PLACEHOLDER with the normal and the tail recursion streams.
3410 One of them will be selected later. */
3411 if (tail_recursion_insns || tail_call_insns)
3413 /* The tail recursion label must be kept around. We could expose
3414 its use in the CALL_PLACEHOLDER, but that creates unwanted edges
3415 and makes determining true tail recursion sites difficult.
3417 So we set LABEL_PRESERVE_P here, then clear it when we select
3418 one of the call sequences after rtl generation is complete. */
3419 if (tail_recursion_insns)
3420 LABEL_PRESERVE_P (tail_recursion_label) = 1;
3421 emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode, normal_call_insns,
3423 tail_recursion_insns,
3424 tail_recursion_label));
3427 emit_insns (normal_call_insns);
3429 currently_expanding_call--;
3431 /* If this function returns with the stack pointer depressed, ensure
3432 this block saves and restores the stack pointer, show it was
3433 changed, and adjust for any outgoing arg space. */
3434 if (flags & ECF_SP_DEPRESSED)
3436 clear_pending_stack_adjust ();
3437 emit_insn (gen_rtx (CLOBBER, VOIDmode, stack_pointer_rtx));
3438 emit_move_insn (virtual_stack_dynamic_rtx, stack_pointer_rtx);
3439 save_stack_pointer ();
3445 /* Returns nonzero if FUN is the symbol for a library function which can
3449 libfunc_nothrow (fun)
3452 if (fun == throw_libfunc
3453 || fun == rethrow_libfunc
3454 || fun == sjthrow_libfunc
3455 || fun == sjpopnthrow_libfunc)
3461 /* Output a library call to function FUN (a SYMBOL_REF rtx).
3462 The RETVAL parameter specifies whether return value needs to be saved, other
3463 parameters are documented in the emit_library_call function bellow. */
3465 emit_library_call_value_1 (retval, orgfun, value, fn_type, outmode, nargs, p)
3469 enum libcall_type fn_type;
3470 enum machine_mode outmode;
3474 /* Total size in bytes of all the stack-parms scanned so far. */
3475 struct args_size args_size;
3476 /* Size of arguments before any adjustments (such as rounding). */
3477 struct args_size original_args_size;
3478 register int argnum;
3482 struct args_size alignment_pad;
3484 CUMULATIVE_ARGS args_so_far;
3488 enum machine_mode mode;
3491 struct args_size offset;
3492 struct args_size size;
3496 int old_inhibit_defer_pop = inhibit_defer_pop;
3497 rtx call_fusage = 0;
3500 int pcc_struct_value = 0;
3501 int struct_value_size = 0;
3503 int reg_parm_stack_space = 0;
3506 #ifdef REG_PARM_STACK_SPACE
3507 /* Define the boundary of the register parm stack space that needs to be
3509 int low_to_save = -1, high_to_save = 0;
3510 rtx save_area = 0; /* Place that it is saved. */
3513 /* Size of the stack reserved for parameter registers. */
3514 int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
3515 char *initial_stack_usage_map = stack_usage_map;
3517 #ifdef REG_PARM_STACK_SPACE
3518 #ifdef MAYBE_REG_PARM_STACK_SPACE
3519 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
3521 reg_parm_stack_space = REG_PARM_STACK_SPACE ((tree) 0);
3525 if (fn_type == LCT_CONST_MAKE_BLOCK)
3527 else if (fn_type == LCT_PURE_MAKE_BLOCK)
3531 if (libfunc_nothrow (fun))
3532 flags |= ECF_NOTHROW;
3534 #ifdef PREFERRED_STACK_BOUNDARY
3535 /* Ensure current function's preferred stack boundary is at least
3537 if (cfun->preferred_stack_boundary < PREFERRED_STACK_BOUNDARY)
3538 cfun->preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
3541 /* If this kind of value comes back in memory,
3542 decide where in memory it should come back. */
3543 if (outmode != VOIDmode && aggregate_value_p (type_for_mode (outmode, 0)))
3545 #ifdef PCC_STATIC_STRUCT_RETURN
3547 = hard_function_value (build_pointer_type (type_for_mode (outmode, 0)),
3549 mem_value = gen_rtx_MEM (outmode, pointer_reg);
3550 pcc_struct_value = 1;
3552 value = gen_reg_rtx (outmode);
3553 #else /* not PCC_STATIC_STRUCT_RETURN */
3554 struct_value_size = GET_MODE_SIZE (outmode);
3555 if (value != 0 && GET_CODE (value) == MEM)
3558 mem_value = assign_stack_temp (outmode, GET_MODE_SIZE (outmode), 0);
3561 /* This call returns a big structure. */
3562 flags &= ~(ECF_CONST | ECF_PURE);
3565 /* ??? Unfinished: must pass the memory address as an argument. */
3567 /* Copy all the libcall-arguments out of the varargs data
3568 and into a vector ARGVEC.
3570 Compute how to pass each argument. We only support a very small subset
3571 of the full argument passing conventions to limit complexity here since
3572 library functions shouldn't have many args. */
3574 argvec = (struct arg *) alloca ((nargs + 1) * sizeof (struct arg));
3575 bzero ((char *) argvec, (nargs + 1) * sizeof (struct arg));
3577 INIT_CUMULATIVE_ARGS (args_so_far, NULL_TREE, fun, 0);
3579 args_size.constant = 0;
3584 /* Now we are about to start emitting insns that can be deleted
3585 if a libcall is deleted. */
3586 if (flags & (ECF_CONST | ECF_PURE))
3591 /* If there's a structure value address to be passed,
3592 either pass it in the special place, or pass it as an extra argument. */
3593 if (mem_value && struct_value_rtx == 0 && ! pcc_struct_value)
3595 rtx addr = XEXP (mem_value, 0);
3598 /* Make sure it is a reasonable operand for a move or push insn. */
3599 if (GET_CODE (addr) != REG && GET_CODE (addr) != MEM
3600 && ! (CONSTANT_P (addr) && LEGITIMATE_CONSTANT_P (addr)))
3601 addr = force_operand (addr, NULL_RTX);
3603 argvec[count].value = addr;
3604 argvec[count].mode = Pmode;
3605 argvec[count].partial = 0;
3607 argvec[count].reg = FUNCTION_ARG (args_so_far, Pmode, NULL_TREE, 1);
3608 #ifdef FUNCTION_ARG_PARTIAL_NREGS
3609 if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far, Pmode, NULL_TREE, 1))
3613 locate_and_pad_parm (Pmode, NULL_TREE,
3614 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3617 argvec[count].reg != 0,
3619 NULL_TREE, &args_size, &argvec[count].offset,
3620 &argvec[count].size, &alignment_pad);
3622 if (argvec[count].reg == 0 || argvec[count].partial != 0
3623 || reg_parm_stack_space > 0)
3624 args_size.constant += argvec[count].size.constant;
3626 FUNCTION_ARG_ADVANCE (args_so_far, Pmode, (tree) 0, 1);
3631 for (; count < nargs; count++)
3633 rtx val = va_arg (p, rtx);
3634 enum machine_mode mode = va_arg (p, enum machine_mode);
3636 /* We cannot convert the arg value to the mode the library wants here;
3637 must do it earlier where we know the signedness of the arg. */
3639 || (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode))
3642 /* On some machines, there's no way to pass a float to a library fcn.
3643 Pass it as a double instead. */
3644 #ifdef LIBGCC_NEEDS_DOUBLE
3645 if (LIBGCC_NEEDS_DOUBLE && mode == SFmode)
3646 val = convert_modes (DFmode, SFmode, val, 0), mode = DFmode;
3649 /* There's no need to call protect_from_queue, because
3650 either emit_move_insn or emit_push_insn will do that. */
3652 /* Make sure it is a reasonable operand for a move or push insn. */
3653 if (GET_CODE (val) != REG && GET_CODE (val) != MEM
3654 && ! (CONSTANT_P (val) && LEGITIMATE_CONSTANT_P (val)))
3655 val = force_operand (val, NULL_RTX);
3657 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
3658 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, mode, NULL_TREE, 1))
3660 /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can
3661 be viewed as just an efficiency improvement. */
3662 rtx slot = assign_stack_temp (mode, GET_MODE_SIZE (mode), 0);
3663 emit_move_insn (slot, val);
3664 val = force_operand (XEXP (slot, 0), NULL_RTX);
3669 argvec[count].value = val;
3670 argvec[count].mode = mode;
3672 argvec[count].reg = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
3674 #ifdef FUNCTION_ARG_PARTIAL_NREGS
3675 argvec[count].partial
3676 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, NULL_TREE, 1);
3678 argvec[count].partial = 0;
3681 locate_and_pad_parm (mode, NULL_TREE,
3682 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3685 argvec[count].reg != 0,
3687 NULL_TREE, &args_size, &argvec[count].offset,
3688 &argvec[count].size, &alignment_pad);
3690 if (argvec[count].size.var)
3693 if (reg_parm_stack_space == 0 && argvec[count].partial)
3694 argvec[count].size.constant -= argvec[count].partial * UNITS_PER_WORD;
3696 if (argvec[count].reg == 0 || argvec[count].partial != 0
3697 || reg_parm_stack_space > 0)
3698 args_size.constant += argvec[count].size.constant;
3700 FUNCTION_ARG_ADVANCE (args_so_far, mode, (tree) 0, 1);
3703 #ifdef FINAL_REG_PARM_STACK_SPACE
3704 reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant,
3707 /* If this machine requires an external definition for library
3708 functions, write one out. */
3709 assemble_external_libcall (fun);
3711 original_args_size = args_size;
3712 #ifdef PREFERRED_STACK_BOUNDARY
3713 args_size.constant = (((args_size.constant
3714 + stack_pointer_delta
3718 - stack_pointer_delta);
3721 args_size.constant = MAX (args_size.constant,
3722 reg_parm_stack_space);
3724 #ifndef OUTGOING_REG_PARM_STACK_SPACE
3725 args_size.constant -= reg_parm_stack_space;
3728 if (args_size.constant > current_function_outgoing_args_size)
3729 current_function_outgoing_args_size = args_size.constant;
3731 if (ACCUMULATE_OUTGOING_ARGS)
3733 /* Since the stack pointer will never be pushed, it is possible for
3734 the evaluation of a parm to clobber something we have already
3735 written to the stack. Since most function calls on RISC machines
3736 do not use the stack, this is uncommon, but must work correctly.
3738 Therefore, we save any area of the stack that was already written
3739 and that we are using. Here we set up to do this by making a new
3740 stack usage map from the old one.
3742 Another approach might be to try to reorder the argument
3743 evaluations to avoid this conflicting stack usage. */
3745 needed = args_size.constant;
3747 #ifndef OUTGOING_REG_PARM_STACK_SPACE
3748 /* Since we will be writing into the entire argument area, the
3749 map must be allocated for its entire size, not just the part that
3750 is the responsibility of the caller. */
3751 needed += reg_parm_stack_space;
3754 #ifdef ARGS_GROW_DOWNWARD
3755 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
3758 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
3761 stack_usage_map = (char *) alloca (highest_outgoing_arg_in_use);
3763 if (initial_highest_arg_in_use)
3764 bcopy (initial_stack_usage_map, stack_usage_map,
3765 initial_highest_arg_in_use);
3767 if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
3768 bzero (&stack_usage_map[initial_highest_arg_in_use],
3769 highest_outgoing_arg_in_use - initial_highest_arg_in_use);
3772 /* The address of the outgoing argument list must not be copied to a
3773 register here, because argblock would be left pointing to the
3774 wrong place after the call to allocate_dynamic_stack_space below. */
3776 argblock = virtual_outgoing_args_rtx;
3781 argblock = push_block (GEN_INT (args_size.constant), 0, 0);
3784 #ifdef PREFERRED_STACK_BOUNDARY
3785 /* If we push args individually in reverse order, perform stack alignment
3786 before the first push (the last arg). */
3787 if (argblock == 0 && PUSH_ARGS_REVERSED)
3788 anti_adjust_stack (GEN_INT (args_size.constant
3789 - original_args_size.constant));
3792 if (PUSH_ARGS_REVERSED)
3803 #ifdef REG_PARM_STACK_SPACE
3804 if (ACCUMULATE_OUTGOING_ARGS)
3806 /* The argument list is the property of the called routine and it
3807 may clobber it. If the fixed area has been used for previous
3808 parameters, we must save and restore it.
3810 Here we compute the boundary of the that needs to be saved, if any. */
3812 #ifdef ARGS_GROW_DOWNWARD
3813 for (count = 0; count < reg_parm_stack_space + 1; count++)
3815 for (count = 0; count < reg_parm_stack_space; count++)
3818 if (count >= highest_outgoing_arg_in_use
3819 || stack_usage_map[count] == 0)
3822 if (low_to_save == -1)
3823 low_to_save = count;
3825 high_to_save = count;
3828 if (low_to_save >= 0)
3830 int num_to_save = high_to_save - low_to_save + 1;
3831 enum machine_mode save_mode
3832 = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1);
3835 /* If we don't have the required alignment, must do this in BLKmode. */
3836 if ((low_to_save & (MIN (GET_MODE_SIZE (save_mode),
3837 BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1)))
3838 save_mode = BLKmode;
3840 #ifdef ARGS_GROW_DOWNWARD
3841 stack_area = gen_rtx_MEM (save_mode,
3842 memory_address (save_mode,
3843 plus_constant (argblock,
3846 stack_area = gen_rtx_MEM (save_mode,
3847 memory_address (save_mode,
3848 plus_constant (argblock,
3851 if (save_mode == BLKmode)
3853 save_area = assign_stack_temp (BLKmode, num_to_save, 0);
3854 emit_block_move (validize_mem (save_area), stack_area,
3855 GEN_INT (num_to_save), PARM_BOUNDARY);
3859 save_area = gen_reg_rtx (save_mode);
3860 emit_move_insn (save_area, stack_area);
3866 /* Push the args that need to be pushed. */
3868 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3869 are to be pushed. */
3870 for (count = 0; count < nargs; count++, argnum += inc)
3872 register enum machine_mode mode = argvec[argnum].mode;
3873 register rtx val = argvec[argnum].value;
3874 rtx reg = argvec[argnum].reg;
3875 int partial = argvec[argnum].partial;
3876 int lower_bound = 0, upper_bound = 0, i;
3878 if (! (reg != 0 && partial == 0))
3880 if (ACCUMULATE_OUTGOING_ARGS)
3882 /* If this is being stored into a pre-allocated, fixed-size,
3883 stack area, save any previous data at that location. */
3885 #ifdef ARGS_GROW_DOWNWARD
3886 /* stack_slot is negative, but we want to index stack_usage_map
3887 with positive values. */
3888 upper_bound = -argvec[argnum].offset.constant + 1;
3889 lower_bound = upper_bound - argvec[argnum].size.constant;
3891 lower_bound = argvec[argnum].offset.constant;
3892 upper_bound = lower_bound + argvec[argnum].size.constant;
3895 for (i = lower_bound; i < upper_bound; i++)
3896 if (stack_usage_map[i]
3897 /* Don't store things in the fixed argument area at this
3898 point; it has already been saved. */
3899 && i > reg_parm_stack_space)
3902 if (i != upper_bound)
3904 /* We need to make a save area. See what mode we can make
3906 enum machine_mode save_mode
3907 = mode_for_size (argvec[argnum].size.constant
3915 plus_constant (argblock,
3916 argvec[argnum].offset.constant)));
3917 argvec[argnum].save_area = gen_reg_rtx (save_mode);
3919 emit_move_insn (argvec[argnum].save_area, stack_area);
3923 emit_push_insn (val, mode, NULL_TREE, NULL_RTX, 0, partial, reg, 0,
3924 argblock, GEN_INT (argvec[argnum].offset.constant),
3925 reg_parm_stack_space, ARGS_SIZE_RTX (alignment_pad));
3927 /* Now mark the segment we just used. */
3928 if (ACCUMULATE_OUTGOING_ARGS)
3929 for (i = lower_bound; i < upper_bound; i++)
3930 stack_usage_map[i] = 1;
3936 #ifdef PREFERRED_STACK_BOUNDARY
3937 /* If we pushed args in forward order, perform stack alignment
3938 after pushing the last arg. */
3939 if (argblock == 0 && !PUSH_ARGS_REVERSED)
3940 anti_adjust_stack (GEN_INT (args_size.constant
3941 - original_args_size.constant));
3944 if (PUSH_ARGS_REVERSED)
3949 fun = prepare_call_address (fun, NULL_TREE, &call_fusage, 0);
3951 /* Now load any reg parms into their regs. */
3953 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3954 are to be pushed. */
3955 for (count = 0; count < nargs; count++, argnum += inc)
3957 register rtx val = argvec[argnum].value;
3958 rtx reg = argvec[argnum].reg;
3959 int partial = argvec[argnum].partial;
3961 /* Handle calls that pass values in multiple non-contiguous
3962 locations. The PA64 has examples of this for library calls. */
3963 if (reg != 0 && GET_CODE (reg) == PARALLEL)
3964 emit_group_load (reg, val,
3965 GET_MODE_SIZE (GET_MODE (val)),
3966 GET_MODE_ALIGNMENT (GET_MODE (val)));
3967 else if (reg != 0 && partial == 0)
3968 emit_move_insn (reg, val);
3973 /* Any regs containing parms remain in use through the call. */
3974 for (count = 0; count < nargs; count++)
3976 rtx reg = argvec[count].reg;
3977 if (reg != 0 && GET_CODE (reg) == PARALLEL)
3978 use_group_regs (&call_fusage, reg);
3980 use_reg (&call_fusage, reg);
3983 /* Pass the function the address in which to return a structure value. */
3984 if (mem_value != 0 && struct_value_rtx != 0 && ! pcc_struct_value)
3986 emit_move_insn (struct_value_rtx,
3988 force_operand (XEXP (mem_value, 0),
3990 if (GET_CODE (struct_value_rtx) == REG)
3991 use_reg (&call_fusage, struct_value_rtx);
3994 /* Don't allow popping to be deferred, since then
3995 cse'ing of library calls could delete a call and leave the pop. */
3997 valreg = (mem_value == 0 && outmode != VOIDmode
3998 ? hard_libcall_value (outmode) : NULL_RTX);
4000 #ifdef PREFERRED_STACK_BOUNDARY
4001 /* Stack must be properly aligned now. */
4002 if (stack_pointer_delta & (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT - 1))
4006 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4007 will set inhibit_defer_pop to that value. */
4008 /* The return type is needed to decide how many bytes the function pops.
4009 Signedness plays no role in that, so for simplicity, we pretend it's
4010 always signed. We also assume that the list of arguments passed has
4011 no impact, so we pretend it is unknown. */
4014 get_identifier (XSTR (orgfun, 0)),
4015 build_function_type (outmode == VOIDmode ? void_type_node
4016 : type_for_mode (outmode, 0), NULL_TREE),
4017 original_args_size.constant, args_size.constant,
4019 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1),
4021 old_inhibit_defer_pop + 1, call_fusage, flags);
4023 /* Now restore inhibit_defer_pop to its actual original value. */
4026 /* If call is cse'able, make appropriate pair of reg-notes around it.
4027 Test valreg so we don't crash; may safely ignore `const'
4028 if return type is void. Disable for PARALLEL return values, because
4029 we have no way to move such values into a pseudo register. */
4030 if ((flags & (ECF_CONST | ECF_PURE))
4031 && valreg != 0 && GET_CODE (valreg) != PARALLEL)
4034 rtx temp = gen_reg_rtx (GET_MODE (valreg));
4038 /* Construct an "equal form" for the value which mentions all the
4039 arguments in order as well as the function name. */
4040 for (i = 0; i < nargs; i++)
4041 note = gen_rtx_EXPR_LIST (VOIDmode, argvec[i].value, note);
4042 note = gen_rtx_EXPR_LIST (VOIDmode, fun, note);
4044 insns = get_insns ();
4047 if (flags & ECF_PURE)
4048 note = gen_rtx_EXPR_LIST (VOIDmode,
4049 gen_rtx_USE (VOIDmode,
4050 gen_rtx_MEM (BLKmode,
4051 gen_rtx_SCRATCH (VOIDmode))), note);
4053 emit_libcall_block (insns, temp, valreg, note);
4057 else if (flags & (ECF_CONST | ECF_PURE))
4059 /* Otherwise, just write out the sequence without a note. */
4060 rtx insns = get_insns ();
4067 /* Copy the value to the right place. */
4068 if (outmode != VOIDmode && retval)
4074 if (value != mem_value)
4075 emit_move_insn (value, mem_value);
4077 else if (value != 0)
4078 emit_move_insn (value, hard_libcall_value (outmode));
4080 value = hard_libcall_value (outmode);
4083 if (ACCUMULATE_OUTGOING_ARGS)
4085 #ifdef REG_PARM_STACK_SPACE
4088 enum machine_mode save_mode = GET_MODE (save_area);
4089 #ifdef ARGS_GROW_DOWNWARD
4091 = gen_rtx_MEM (save_mode,
4092 memory_address (save_mode,
4093 plus_constant (argblock,
4097 = gen_rtx_MEM (save_mode,
4098 memory_address (save_mode,
4099 plus_constant (argblock, low_to_save)));
4101 if (save_mode != BLKmode)
4102 emit_move_insn (stack_area, save_area);
4104 emit_block_move (stack_area, validize_mem (save_area),
4105 GEN_INT (high_to_save - low_to_save + 1),
4110 /* If we saved any argument areas, restore them. */
4111 for (count = 0; count < nargs; count++)
4112 if (argvec[count].save_area)
4114 enum machine_mode save_mode = GET_MODE (argvec[count].save_area);
4116 = gen_rtx_MEM (save_mode,
4119 plus_constant (argblock,
4120 argvec[count].offset.constant)));
4122 emit_move_insn (stack_area, argvec[count].save_area);
4125 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
4126 stack_usage_map = initial_stack_usage_map;
4133 /* Output a library call to function FUN (a SYMBOL_REF rtx)
4134 (emitting the queue unless NO_QUEUE is nonzero),
4135 for a value of mode OUTMODE,
4136 with NARGS different arguments, passed as alternating rtx values
4137 and machine_modes to convert them to.
4138 The rtx values should have been passed through protect_from_queue already.
4140 FN_TYPE will is zero for `normal' calls, one for `const' calls, wich
4141 which will be enclosed in REG_LIBCALL/REG_RETVAL notes and two for `pure'
4142 calls, that are handled like `const' calls with extra
4143 (use (memory (scratch)). */
4146 emit_library_call VPARAMS((rtx orgfun, enum libcall_type fn_type,
4147 enum machine_mode outmode, int nargs, ...))
4149 #ifndef ANSI_PROTOTYPES
4152 enum machine_mode outmode;
4157 VA_START (p, nargs);
4159 #ifndef ANSI_PROTOTYPES
4160 orgfun = va_arg (p, rtx);
4161 fn_type = va_arg (p, int);
4162 outmode = va_arg (p, enum machine_mode);
4163 nargs = va_arg (p, int);
4166 emit_library_call_value_1 (0, orgfun, NULL_RTX, fn_type, outmode, nargs, p);
4171 /* Like emit_library_call except that an extra argument, VALUE,
4172 comes second and says where to store the result.
4173 (If VALUE is zero, this function chooses a convenient way
4174 to return the value.
4176 This function returns an rtx for where the value is to be found.
4177 If VALUE is nonzero, VALUE is returned. */
4180 emit_library_call_value VPARAMS((rtx orgfun, rtx value,
4181 enum libcall_type fn_type,
4182 enum machine_mode outmode, int nargs, ...))
4184 #ifndef ANSI_PROTOTYPES
4188 enum machine_mode outmode;
4193 VA_START (p, nargs);
4195 #ifndef ANSI_PROTOTYPES
4196 orgfun = va_arg (p, rtx);
4197 value = va_arg (p, rtx);
4198 fn_type = va_arg (p, int);
4199 outmode = va_arg (p, enum machine_mode);
4200 nargs = va_arg (p, int);
4203 value = emit_library_call_value_1 (1, orgfun, value, fn_type, outmode, nargs, p);
4211 /* Return an rtx which represents a suitable home on the stack
4212 given TYPE, the type of the argument looking for a home.
4213 This is called only for BLKmode arguments.
4215 SIZE is the size needed for this target.
4216 ARGS_ADDR is the address of the bottom of the argument block for this call.
4217 OFFSET describes this parameter's offset into ARGS_ADDR. It is meaningless
4218 if this machine uses push insns. */
4221 target_for_arg (type, size, args_addr, offset)
4225 struct args_size offset;
4228 rtx offset_rtx = ARGS_SIZE_RTX (offset);
4230 /* We do not call memory_address if possible,
4231 because we want to address as close to the stack
4232 as possible. For non-variable sized arguments,
4233 this will be stack-pointer relative addressing. */
4234 if (GET_CODE (offset_rtx) == CONST_INT)
4235 target = plus_constant (args_addr, INTVAL (offset_rtx));
4238 /* I have no idea how to guarantee that this
4239 will work in the presence of register parameters. */
4240 target = gen_rtx_PLUS (Pmode, args_addr, offset_rtx);
4241 target = memory_address (QImode, target);
4244 return gen_rtx_MEM (BLKmode, target);
4248 /* Store a single argument for a function call
4249 into the register or memory area where it must be passed.
4250 *ARG describes the argument value and where to pass it.
4252 ARGBLOCK is the address of the stack-block for all the arguments,
4253 or 0 on a machine where arguments are pushed individually.
4255 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
4256 so must be careful about how the stack is used.
4258 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
4259 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
4260 that we need not worry about saving and restoring the stack.
4262 FNDECL is the declaration of the function we are calling.
4264 Return non-zero if this arg should cause sibcall failure,
4268 store_one_arg (arg, argblock, flags, variable_size, reg_parm_stack_space)
4269 struct arg_data *arg;
4272 int variable_size ATTRIBUTE_UNUSED;
4273 int reg_parm_stack_space;
4275 register tree pval = arg->tree_value;
4279 int i, lower_bound = 0, upper_bound = 0;
4280 int sibcall_failure = 0;
4282 if (TREE_CODE (pval) == ERROR_MARK)
4285 /* Push a new temporary level for any temporaries we make for
4289 if (ACCUMULATE_OUTGOING_ARGS && !(flags & ECF_SIBCALL))
4291 /* If this is being stored into a pre-allocated, fixed-size, stack area,
4292 save any previous data at that location. */
4293 if (argblock && ! variable_size && arg->stack)
4295 #ifdef ARGS_GROW_DOWNWARD
4296 /* stack_slot is negative, but we want to index stack_usage_map
4297 with positive values. */
4298 if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
4299 upper_bound = -INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1)) + 1;
4303 lower_bound = upper_bound - arg->size.constant;
4305 if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
4306 lower_bound = INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1));
4310 upper_bound = lower_bound + arg->size.constant;
4313 for (i = lower_bound; i < upper_bound; i++)
4314 if (stack_usage_map[i]
4315 /* Don't store things in the fixed argument area at this point;
4316 it has already been saved. */
4317 && i > reg_parm_stack_space)
4320 if (i != upper_bound)
4322 /* We need to make a save area. See what mode we can make it. */
4323 enum machine_mode save_mode
4324 = mode_for_size (arg->size.constant * BITS_PER_UNIT, MODE_INT, 1);
4326 = gen_rtx_MEM (save_mode,
4327 memory_address (save_mode,
4328 XEXP (arg->stack_slot, 0)));
4330 if (save_mode == BLKmode)
4332 arg->save_area = assign_stack_temp (BLKmode,
4333 arg->size.constant, 0);
4334 MEM_SET_IN_STRUCT_P (arg->save_area,
4335 AGGREGATE_TYPE_P (TREE_TYPE
4336 (arg->tree_value)));
4337 preserve_temp_slots (arg->save_area);
4338 emit_block_move (validize_mem (arg->save_area), stack_area,
4339 GEN_INT (arg->size.constant),
4344 arg->save_area = gen_reg_rtx (save_mode);
4345 emit_move_insn (arg->save_area, stack_area);
4349 /* Now that we have saved any slots that will be overwritten by this
4350 store, mark all slots this store will use. We must do this before
4351 we actually expand the argument since the expansion itself may
4352 trigger library calls which might need to use the same stack slot. */
4353 if (argblock && ! variable_size && arg->stack)
4354 for (i = lower_bound; i < upper_bound; i++)
4355 stack_usage_map[i] = 1;
4358 /* If this isn't going to be placed on both the stack and in registers,
4359 set up the register and number of words. */
4360 if (! arg->pass_on_stack)
4361 reg = arg->reg, partial = arg->partial;
4363 if (reg != 0 && partial == 0)
4364 /* Being passed entirely in a register. We shouldn't be called in
4368 /* If this arg needs special alignment, don't load the registers
4370 if (arg->n_aligned_regs != 0)
4373 /* If this is being passed partially in a register, we can't evaluate
4374 it directly into its stack slot. Otherwise, we can. */
4375 if (arg->value == 0)
4377 /* stack_arg_under_construction is nonzero if a function argument is
4378 being evaluated directly into the outgoing argument list and
4379 expand_call must take special action to preserve the argument list
4380 if it is called recursively.
4382 For scalar function arguments stack_usage_map is sufficient to
4383 determine which stack slots must be saved and restored. Scalar
4384 arguments in general have pass_on_stack == 0.
4386 If this argument is initialized by a function which takes the
4387 address of the argument (a C++ constructor or a C function
4388 returning a BLKmode structure), then stack_usage_map is
4389 insufficient and expand_call must push the stack around the
4390 function call. Such arguments have pass_on_stack == 1.
4392 Note that it is always safe to set stack_arg_under_construction,
4393 but this generates suboptimal code if set when not needed. */
4395 if (arg->pass_on_stack)
4396 stack_arg_under_construction++;
4398 arg->value = expand_expr (pval,
4400 || TYPE_MODE (TREE_TYPE (pval)) != arg->mode)
4401 ? NULL_RTX : arg->stack,
4404 /* If we are promoting object (or for any other reason) the mode
4405 doesn't agree, convert the mode. */
4407 if (arg->mode != TYPE_MODE (TREE_TYPE (pval)))
4408 arg->value = convert_modes (arg->mode, TYPE_MODE (TREE_TYPE (pval)),
4409 arg->value, arg->unsignedp);
4411 if (arg->pass_on_stack)
4412 stack_arg_under_construction--;
4415 /* Don't allow anything left on stack from computation
4416 of argument to alloca. */
4417 if (flags & ECF_MAY_BE_ALLOCA)
4418 do_pending_stack_adjust ();
4420 if (arg->value == arg->stack)
4422 /* If the value is already in the stack slot, we are done. */
4423 if (current_function_check_memory_usage && GET_CODE (arg->stack) == MEM)
4425 emit_library_call (chkr_set_right_libfunc, LCT_CONST_MAKE_BLOCK,
4426 VOIDmode, 3, XEXP (arg->stack, 0), Pmode,
4427 ARGS_SIZE_RTX (arg->size),
4428 TYPE_MODE (sizetype),
4429 GEN_INT (MEMORY_USE_RW),
4430 TYPE_MODE (integer_type_node));
4433 else if (arg->mode != BLKmode)
4437 /* Argument is a scalar, not entirely passed in registers.
4438 (If part is passed in registers, arg->partial says how much
4439 and emit_push_insn will take care of putting it there.)
4441 Push it, and if its size is less than the
4442 amount of space allocated to it,
4443 also bump stack pointer by the additional space.
4444 Note that in C the default argument promotions
4445 will prevent such mismatches. */
4447 size = GET_MODE_SIZE (arg->mode);
4448 /* Compute how much space the push instruction will push.
4449 On many machines, pushing a byte will advance the stack
4450 pointer by a halfword. */
4451 #ifdef PUSH_ROUNDING
4452 size = PUSH_ROUNDING (size);
4456 /* Compute how much space the argument should get:
4457 round up to a multiple of the alignment for arguments. */
4458 if (none != FUNCTION_ARG_PADDING (arg->mode, TREE_TYPE (pval)))
4459 used = (((size + PARM_BOUNDARY / BITS_PER_UNIT - 1)
4460 / (PARM_BOUNDARY / BITS_PER_UNIT))
4461 * (PARM_BOUNDARY / BITS_PER_UNIT));
4463 /* This isn't already where we want it on the stack, so put it there.
4464 This can either be done with push or copy insns. */
4465 emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), NULL_RTX, 0,
4466 partial, reg, used - size, argblock,
4467 ARGS_SIZE_RTX (arg->offset), reg_parm_stack_space,
4468 ARGS_SIZE_RTX (arg->alignment_pad));
4472 /* BLKmode, at least partly to be pushed. */
4474 register int excess;
4477 /* Pushing a nonscalar.
4478 If part is passed in registers, PARTIAL says how much
4479 and emit_push_insn will take care of putting it there. */
4481 /* Round its size up to a multiple
4482 of the allocation unit for arguments. */
4484 if (arg->size.var != 0)
4487 size_rtx = ARGS_SIZE_RTX (arg->size);
4491 /* PUSH_ROUNDING has no effect on us, because
4492 emit_push_insn for BLKmode is careful to avoid it. */
4493 excess = (arg->size.constant - int_size_in_bytes (TREE_TYPE (pval))
4494 + partial * UNITS_PER_WORD);
4495 size_rtx = expr_size (pval);
4498 if ((flags & ECF_SIBCALL) && GET_CODE (arg->value) == MEM)
4500 /* emit_push_insn might not work properly if arg->value and
4501 argblock + arg->offset areas overlap. */
4505 if (XEXP (x, 0) == current_function_internal_arg_pointer
4506 || (GET_CODE (XEXP (x, 0)) == PLUS
4507 && XEXP (XEXP (x, 0), 0) ==
4508 current_function_internal_arg_pointer
4509 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT))
4511 if (XEXP (x, 0) != current_function_internal_arg_pointer)
4512 i = INTVAL (XEXP (XEXP (x, 0), 1));
4514 /* expand_call should ensure this */
4515 if (arg->offset.var || GET_CODE (size_rtx) != CONST_INT)
4518 if (arg->offset.constant > i)
4520 if (arg->offset.constant < i + INTVAL (size_rtx))
4521 sibcall_failure = 1;
4523 else if (arg->offset.constant < i)
4525 if (i < arg->offset.constant + INTVAL (size_rtx))
4526 sibcall_failure = 1;
4531 emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), size_rtx,
4532 TYPE_ALIGN (TREE_TYPE (pval)), partial, reg, excess,
4533 argblock, ARGS_SIZE_RTX (arg->offset),
4534 reg_parm_stack_space,
4535 ARGS_SIZE_RTX (arg->alignment_pad));
4538 /* Unless this is a partially-in-register argument, the argument is now
4541 ??? Note that this can change arg->value from arg->stack to
4542 arg->stack_slot and it matters when they are not the same.
4543 It isn't totally clear that this is correct in all cases. */
4545 arg->value = arg->stack_slot;
4547 /* Once we have pushed something, pops can't safely
4548 be deferred during the rest of the arguments. */
4551 /* ANSI doesn't require a sequence point here,
4552 but PCC has one, so this will avoid some problems. */
4555 /* Free any temporary slots made in processing this argument. Show
4556 that we might have taken the address of something and pushed that
4558 preserve_temp_slots (NULL_RTX);
4562 return sibcall_failure;