1 /* Convert function calls to rtl insns, for GNU C compiler.
2 Copyright (C) 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
4 2011, 2012 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
35 #include "diagnostic-core.h"
40 #include "langhooks.h"
45 #include "tree-flow.h"
47 /* Like PREFERRED_STACK_BOUNDARY but in units of bytes, not bits. */
48 #define STACK_BYTES (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)
50 /* Data structure and subroutines used within expand_call. */
54 /* Tree node for this argument. */
56 /* Mode for value; TYPE_MODE unless promoted. */
57 enum machine_mode mode
;
58 /* Current RTL value for argument, or 0 if it isn't precomputed. */
60 /* Initially-compute RTL value for argument; only for const functions. */
62 /* Register to pass this argument in, 0 if passed on stack, or an
63 PARALLEL if the arg is to be copied into multiple non-contiguous
66 /* Register to pass this argument in when generating tail call sequence.
67 This is not the same register as for normal calls on machines with
70 /* If REG is a PARALLEL, this is a copy of VALUE pulled into the correct
71 form for emit_group_move. */
73 /* If REG was promoted from the actual mode of the argument expression,
74 indicates whether the promotion is sign- or zero-extended. */
76 /* Number of bytes to put in registers. 0 means put the whole arg
77 in registers. Also 0 if not passed in registers. */
79 /* Nonzero if argument must be passed on stack.
80 Note that some arguments may be passed on the stack
81 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
82 pass_on_stack identifies arguments that *cannot* go in registers. */
84 /* Some fields packaged up for locate_and_pad_parm. */
85 struct locate_and_pad_arg_data locate
;
86 /* Location on the stack at which parameter should be stored. The store
87 has already been done if STACK == VALUE. */
89 /* Location on the stack of the start of this argument slot. This can
90 differ from STACK if this arg pads downward. This location is known
91 to be aligned to TARGET_FUNCTION_ARG_BOUNDARY. */
93 /* Place that this stack area has been saved, if needed. */
95 /* If an argument's alignment does not permit direct copying into registers,
96 copy in smaller-sized pieces into pseudos. These are stored in a
97 block pointed to by this field. The next field says how many
98 word-sized pseudos we made. */
103 /* A vector of one char per byte of stack space. A byte if nonzero if
104 the corresponding stack location has been used.
105 This vector is used to prevent a function call within an argument from
106 clobbering any stack already set up. */
107 static char *stack_usage_map
;
109 /* Size of STACK_USAGE_MAP. */
110 static int highest_outgoing_arg_in_use
;
112 /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
113 stack location's tail call argument has been already stored into the stack.
114 This bitmap is used to prevent sibling call optimization if function tries
115 to use parent's incoming argument slots when they have been already
116 overwritten with tail call arguments. */
117 static sbitmap stored_args_map
;
119 /* stack_arg_under_construction is nonzero when an argument may be
120 initialized with a constructor call (including a C function that
121 returns a BLKmode struct) and expand_call must take special action
122 to make sure the object being constructed does not overlap the
123 argument list for the constructor call. */
124 static int stack_arg_under_construction
;
126 static void emit_call_1 (rtx
, tree
, tree
, tree
, HOST_WIDE_INT
, HOST_WIDE_INT
,
127 HOST_WIDE_INT
, rtx
, rtx
, int, rtx
, int,
129 static void precompute_register_parameters (int, struct arg_data
*, int *);
130 static int store_one_arg (struct arg_data
*, rtx
, int, int, int);
131 static void store_unaligned_arguments_into_pseudos (struct arg_data
*, int);
132 static int finalize_must_preallocate (int, int, struct arg_data
*,
134 static void precompute_arguments (int, struct arg_data
*);
135 static int compute_argument_block_size (int, struct args_size
*, tree
, tree
, int);
136 static void initialize_argument_information (int, struct arg_data
*,
137 struct args_size
*, int,
139 tree
, tree
, cumulative_args_t
, int,
140 rtx
*, int *, int *, int *,
142 static void compute_argument_addresses (struct arg_data
*, rtx
, int);
143 static rtx
rtx_for_function_call (tree
, tree
);
144 static void load_register_parameters (struct arg_data
*, int, rtx
*, int,
146 static rtx
emit_library_call_value_1 (int, rtx
, rtx
, enum libcall_type
,
147 enum machine_mode
, int, va_list);
148 static int special_function_p (const_tree
, int);
149 static int check_sibcall_argument_overlap_1 (rtx
);
150 static int check_sibcall_argument_overlap (rtx
, struct arg_data
*, int);
152 static int combine_pending_stack_adjustment_and_call (int, struct args_size
*,
154 static tree
split_complex_types (tree
);
156 #ifdef REG_PARM_STACK_SPACE
157 static rtx
save_fixed_argument_area (int, rtx
, int *, int *);
158 static void restore_fixed_argument_area (rtx
, rtx
, int, int);
161 /* Force FUNEXP into a form suitable for the address of a CALL,
162 and return that as an rtx. Also load the static chain register
163 if FNDECL is a nested function.
165 CALL_FUSAGE points to a variable holding the prospective
166 CALL_INSN_FUNCTION_USAGE information. */
169 prepare_call_address (tree fndecl
, rtx funexp
, rtx static_chain_value
,
170 rtx
*call_fusage
, int reg_parm_seen
, int sibcallp
)
172 /* Make a valid memory address and copy constants through pseudo-regs,
173 but not for a constant address if -fno-function-cse. */
174 if (GET_CODE (funexp
) != SYMBOL_REF
)
175 /* If we are using registers for parameters, force the
176 function address into a register now. */
177 funexp
= ((reg_parm_seen
178 && targetm
.small_register_classes_for_mode_p (FUNCTION_MODE
))
179 ? force_not_mem (memory_address (FUNCTION_MODE
, funexp
))
180 : memory_address (FUNCTION_MODE
, funexp
));
183 #ifndef NO_FUNCTION_CSE
184 if (optimize
&& ! flag_no_function_cse
)
185 funexp
= force_reg (Pmode
, funexp
);
189 if (static_chain_value
!= 0)
194 chain
= targetm
.calls
.static_chain (fndecl
, false);
195 static_chain_value
= convert_memory_address (Pmode
, static_chain_value
);
197 emit_move_insn (chain
, static_chain_value
);
199 use_reg (call_fusage
, chain
);
205 /* Generate instructions to call function FUNEXP,
206 and optionally pop the results.
207 The CALL_INSN is the first insn generated.
209 FNDECL is the declaration node of the function. This is given to the
210 hook TARGET_RETURN_POPS_ARGS to determine whether this function pops
213 FUNTYPE is the data type of the function. This is given to the hook
214 TARGET_RETURN_POPS_ARGS to determine whether this function pops its
215 own args. We used to allow an identifier for library functions, but
216 that doesn't work when the return type is an aggregate type and the
217 calling convention says that the pointer to this aggregate is to be
218 popped by the callee.
220 STACK_SIZE is the number of bytes of arguments on the stack,
221 ROUNDED_STACK_SIZE is that number rounded up to
222 PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
223 both to put into the call insn and to generate explicit popping
226 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
227 It is zero if this call doesn't want a structure value.
229 NEXT_ARG_REG is the rtx that results from executing
230 targetm.calls.function_arg (&args_so_far, VOIDmode, void_type_node, true)
231 just after all the args have had their registers assigned.
232 This could be whatever you like, but normally it is the first
233 arg-register beyond those used for args in this call,
234 or 0 if all the arg-registers are used in this call.
235 It is passed on to `gen_call' so you can put this info in the call insn.
237 VALREG is a hard register in which a value is returned,
238 or 0 if the call does not return a value.
240 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
241 the args to this call were processed.
242 We restore `inhibit_defer_pop' to that value.
244 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
245 denote registers used by the called function. */
248 emit_call_1 (rtx funexp
, tree fntree ATTRIBUTE_UNUSED
, tree fndecl ATTRIBUTE_UNUSED
,
249 tree funtype ATTRIBUTE_UNUSED
,
250 HOST_WIDE_INT stack_size ATTRIBUTE_UNUSED
,
251 HOST_WIDE_INT rounded_stack_size
,
252 HOST_WIDE_INT struct_value_size ATTRIBUTE_UNUSED
,
253 rtx next_arg_reg ATTRIBUTE_UNUSED
, rtx valreg
,
254 int old_inhibit_defer_pop
, rtx call_fusage
, int ecf_flags
,
255 cumulative_args_t args_so_far ATTRIBUTE_UNUSED
)
257 rtx rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
258 rtx call_insn
, call
, funmem
;
259 int already_popped
= 0;
260 HOST_WIDE_INT n_popped
261 = targetm
.calls
.return_pops_args (fndecl
, funtype
, stack_size
);
263 #ifdef CALL_POPS_ARGS
264 n_popped
+= CALL_POPS_ARGS (*get_cumulative_args (args_so_far
));
267 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
268 and we don't want to load it into a register as an optimization,
269 because prepare_call_address already did it if it should be done. */
270 if (GET_CODE (funexp
) != SYMBOL_REF
)
271 funexp
= memory_address (FUNCTION_MODE
, funexp
);
273 funmem
= gen_rtx_MEM (FUNCTION_MODE
, funexp
);
274 if (fndecl
&& TREE_CODE (fndecl
) == FUNCTION_DECL
)
278 /* Although a built-in FUNCTION_DECL and its non-__builtin
279 counterpart compare equal and get a shared mem_attrs, they
280 produce different dump output in compare-debug compilations,
281 if an entry gets garbage collected in one compilation, then
282 adds a different (but equivalent) entry, while the other
283 doesn't run the garbage collector at the same spot and then
284 shares the mem_attr with the equivalent entry. */
285 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
287 tree t2
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
292 set_mem_expr (funmem
, t
);
295 set_mem_expr (funmem
, build_simple_mem_ref (CALL_EXPR_FN (fntree
)));
297 #if defined (HAVE_sibcall_pop) && defined (HAVE_sibcall_value_pop)
298 if ((ecf_flags
& ECF_SIBCALL
)
299 && HAVE_sibcall_pop
&& HAVE_sibcall_value_pop
300 && (n_popped
> 0 || stack_size
== 0))
302 rtx n_pop
= GEN_INT (n_popped
);
305 /* If this subroutine pops its own args, record that in the call insn
306 if possible, for the sake of frame pointer elimination. */
309 pat
= GEN_SIBCALL_VALUE_POP (valreg
, funmem
, rounded_stack_size_rtx
,
310 next_arg_reg
, n_pop
);
312 pat
= GEN_SIBCALL_POP (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
315 emit_call_insn (pat
);
321 #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop)
322 /* If the target has "call" or "call_value" insns, then prefer them
323 if no arguments are actually popped. If the target does not have
324 "call" or "call_value" insns, then we must use the popping versions
325 even if the call has no arguments to pop. */
326 #if defined (HAVE_call) && defined (HAVE_call_value)
327 if (HAVE_call
&& HAVE_call_value
&& HAVE_call_pop
&& HAVE_call_value_pop
330 if (HAVE_call_pop
&& HAVE_call_value_pop
)
333 rtx n_pop
= GEN_INT (n_popped
);
336 /* If this subroutine pops its own args, record that in the call insn
337 if possible, for the sake of frame pointer elimination. */
340 pat
= GEN_CALL_VALUE_POP (valreg
, funmem
, rounded_stack_size_rtx
,
341 next_arg_reg
, n_pop
);
343 pat
= GEN_CALL_POP (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
346 emit_call_insn (pat
);
352 #if defined (HAVE_sibcall) && defined (HAVE_sibcall_value)
353 if ((ecf_flags
& ECF_SIBCALL
)
354 && HAVE_sibcall
&& HAVE_sibcall_value
)
357 emit_call_insn (GEN_SIBCALL_VALUE (valreg
, funmem
,
358 rounded_stack_size_rtx
,
359 next_arg_reg
, NULL_RTX
));
361 emit_call_insn (GEN_SIBCALL (funmem
, rounded_stack_size_rtx
,
363 GEN_INT (struct_value_size
)));
368 #if defined (HAVE_call) && defined (HAVE_call_value)
369 if (HAVE_call
&& HAVE_call_value
)
372 emit_call_insn (GEN_CALL_VALUE (valreg
, funmem
, rounded_stack_size_rtx
,
373 next_arg_reg
, NULL_RTX
));
375 emit_call_insn (GEN_CALL (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
376 GEN_INT (struct_value_size
)));
382 /* Find the call we just emitted. */
383 call_insn
= last_call_insn ();
385 /* Some target create a fresh MEM instead of reusing the one provided
386 above. Set its MEM_EXPR. */
387 call
= PATTERN (call_insn
);
388 if (GET_CODE (call
) == PARALLEL
)
389 call
= XVECEXP (call
, 0, 0);
390 if (GET_CODE (call
) == SET
)
391 call
= SET_SRC (call
);
392 if (GET_CODE (call
) == CALL
393 && MEM_P (XEXP (call
, 0))
394 && MEM_EXPR (XEXP (call
, 0)) == NULL_TREE
395 && MEM_EXPR (funmem
) != NULL_TREE
)
396 set_mem_expr (XEXP (call
, 0), MEM_EXPR (funmem
));
398 /* Put the register usage information there. */
399 add_function_usage_to (call_insn
, call_fusage
);
401 /* If this is a const call, then set the insn's unchanging bit. */
402 if (ecf_flags
& ECF_CONST
)
403 RTL_CONST_CALL_P (call_insn
) = 1;
405 /* If this is a pure call, then set the insn's unchanging bit. */
406 if (ecf_flags
& ECF_PURE
)
407 RTL_PURE_CALL_P (call_insn
) = 1;
409 /* If this is a const call, then set the insn's unchanging bit. */
410 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
411 RTL_LOOPING_CONST_OR_PURE_CALL_P (call_insn
) = 1;
413 /* Create a nothrow REG_EH_REGION note, if needed. */
414 make_reg_eh_region_note (call_insn
, ecf_flags
, 0);
416 if (ecf_flags
& ECF_NORETURN
)
417 add_reg_note (call_insn
, REG_NORETURN
, const0_rtx
);
419 if (ecf_flags
& ECF_RETURNS_TWICE
)
421 add_reg_note (call_insn
, REG_SETJMP
, const0_rtx
);
422 cfun
->calls_setjmp
= 1;
425 SIBLING_CALL_P (call_insn
) = ((ecf_flags
& ECF_SIBCALL
) != 0);
427 /* Restore this now, so that we do defer pops for this call's args
428 if the context of the call as a whole permits. */
429 inhibit_defer_pop
= old_inhibit_defer_pop
;
434 CALL_INSN_FUNCTION_USAGE (call_insn
)
435 = gen_rtx_EXPR_LIST (VOIDmode
,
436 gen_rtx_CLOBBER (VOIDmode
, stack_pointer_rtx
),
437 CALL_INSN_FUNCTION_USAGE (call_insn
));
438 rounded_stack_size
-= n_popped
;
439 rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
440 stack_pointer_delta
-= n_popped
;
442 add_reg_note (call_insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
444 /* If popup is needed, stack realign must use DRAP */
445 if (SUPPORTS_STACK_ALIGNMENT
)
446 crtl
->need_drap
= true;
448 /* For noreturn calls when not accumulating outgoing args force
449 REG_ARGS_SIZE note to prevent crossjumping of calls with different
451 else if (!ACCUMULATE_OUTGOING_ARGS
&& (ecf_flags
& ECF_NORETURN
) != 0)
452 add_reg_note (call_insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
454 if (!ACCUMULATE_OUTGOING_ARGS
)
456 /* If returning from the subroutine does not automatically pop the args,
457 we need an instruction to pop them sooner or later.
458 Perhaps do it now; perhaps just record how much space to pop later.
460 If returning from the subroutine does pop the args, indicate that the
461 stack pointer will be changed. */
463 if (rounded_stack_size
!= 0)
465 if (ecf_flags
& ECF_NORETURN
)
466 /* Just pretend we did the pop. */
467 stack_pointer_delta
-= rounded_stack_size
;
468 else if (flag_defer_pop
&& inhibit_defer_pop
== 0
469 && ! (ecf_flags
& (ECF_CONST
| ECF_PURE
)))
470 pending_stack_adjust
+= rounded_stack_size
;
472 adjust_stack (rounded_stack_size_rtx
);
475 /* When we accumulate outgoing args, we must avoid any stack manipulations.
476 Restore the stack pointer to its original value now. Usually
477 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
478 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
479 popping variants of functions exist as well.
481 ??? We may optimize similar to defer_pop above, but it is
482 probably not worthwhile.
484 ??? It will be worthwhile to enable combine_stack_adjustments even for
487 anti_adjust_stack (GEN_INT (n_popped
));
490 /* Determine if the function identified by NAME and FNDECL is one with
491 special properties we wish to know about.
493 For example, if the function might return more than one time (setjmp), then
494 set RETURNS_TWICE to a nonzero value.
496 Similarly set NORETURN if the function is in the longjmp family.
498 Set MAY_BE_ALLOCA for any memory allocation function that might allocate
499 space from the stack such as alloca. */
502 special_function_p (const_tree fndecl
, int flags
)
504 if (fndecl
&& DECL_NAME (fndecl
)
505 && IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) <= 17
506 /* Exclude functions not at the file scope, or not `extern',
507 since they are not the magic functions we would otherwise
509 FIXME: this should be handled with attributes, not with this
510 hacky imitation of DECL_ASSEMBLER_NAME. It's (also) wrong
511 because you can declare fork() inside a function if you
513 && (DECL_CONTEXT (fndecl
) == NULL_TREE
514 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
515 && TREE_PUBLIC (fndecl
))
517 const char *name
= IDENTIFIER_POINTER (DECL_NAME (fndecl
));
518 const char *tname
= name
;
520 /* We assume that alloca will always be called by name. It
521 makes no sense to pass it as a pointer-to-function to
522 anything that does not understand its behavior. */
523 if (((IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 6
525 && ! strcmp (name
, "alloca"))
526 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 16
528 && ! strcmp (name
, "__builtin_alloca"))))
529 flags
|= ECF_MAY_BE_ALLOCA
;
531 /* Disregard prefix _, __, __x or __builtin_. */
536 && !strncmp (name
+ 3, "uiltin_", 7))
538 else if (name
[1] == '_' && name
[2] == 'x')
540 else if (name
[1] == '_')
549 && (! strcmp (tname
, "setjmp")
550 || ! strcmp (tname
, "setjmp_syscall")))
552 && ! strcmp (tname
, "sigsetjmp"))
554 && ! strcmp (tname
, "savectx")))
555 flags
|= ECF_RETURNS_TWICE
;
558 && ! strcmp (tname
, "siglongjmp"))
559 flags
|= ECF_NORETURN
;
561 else if ((tname
[0] == 'q' && tname
[1] == 's'
562 && ! strcmp (tname
, "qsetjmp"))
563 || (tname
[0] == 'v' && tname
[1] == 'f'
564 && ! strcmp (tname
, "vfork"))
565 || (tname
[0] == 'g' && tname
[1] == 'e'
566 && !strcmp (tname
, "getcontext")))
567 flags
|= ECF_RETURNS_TWICE
;
569 else if (tname
[0] == 'l' && tname
[1] == 'o'
570 && ! strcmp (tname
, "longjmp"))
571 flags
|= ECF_NORETURN
;
577 /* Return nonzero when FNDECL represents a call to setjmp. */
580 setjmp_call_p (const_tree fndecl
)
582 if (DECL_IS_RETURNS_TWICE (fndecl
))
583 return ECF_RETURNS_TWICE
;
584 return special_function_p (fndecl
, 0) & ECF_RETURNS_TWICE
;
588 /* Return true if STMT is an alloca call. */
591 gimple_alloca_call_p (const_gimple stmt
)
595 if (!is_gimple_call (stmt
))
598 fndecl
= gimple_call_fndecl (stmt
);
599 if (fndecl
&& (special_function_p (fndecl
, 0) & ECF_MAY_BE_ALLOCA
))
605 /* Return true when exp contains alloca call. */
608 alloca_call_p (const_tree exp
)
610 if (TREE_CODE (exp
) == CALL_EXPR
611 && TREE_CODE (CALL_EXPR_FN (exp
)) == ADDR_EXPR
612 && (TREE_CODE (TREE_OPERAND (CALL_EXPR_FN (exp
), 0)) == FUNCTION_DECL
)
613 && (special_function_p (TREE_OPERAND (CALL_EXPR_FN (exp
), 0), 0)
614 & ECF_MAY_BE_ALLOCA
))
619 /* Return TRUE if FNDECL is either a TM builtin or a TM cloned
620 function. Return FALSE otherwise. */
623 is_tm_builtin (const_tree fndecl
)
628 if (decl_is_tm_clone (fndecl
))
631 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
633 switch (DECL_FUNCTION_CODE (fndecl
))
635 case BUILT_IN_TM_COMMIT
:
636 case BUILT_IN_TM_COMMIT_EH
:
637 case BUILT_IN_TM_ABORT
:
638 case BUILT_IN_TM_IRREVOCABLE
:
639 case BUILT_IN_TM_GETTMCLONE_IRR
:
640 case BUILT_IN_TM_MEMCPY
:
641 case BUILT_IN_TM_MEMMOVE
:
642 case BUILT_IN_TM_MEMSET
:
643 CASE_BUILT_IN_TM_STORE (1):
644 CASE_BUILT_IN_TM_STORE (2):
645 CASE_BUILT_IN_TM_STORE (4):
646 CASE_BUILT_IN_TM_STORE (8):
647 CASE_BUILT_IN_TM_STORE (FLOAT
):
648 CASE_BUILT_IN_TM_STORE (DOUBLE
):
649 CASE_BUILT_IN_TM_STORE (LDOUBLE
):
650 CASE_BUILT_IN_TM_STORE (M64
):
651 CASE_BUILT_IN_TM_STORE (M128
):
652 CASE_BUILT_IN_TM_STORE (M256
):
653 CASE_BUILT_IN_TM_LOAD (1):
654 CASE_BUILT_IN_TM_LOAD (2):
655 CASE_BUILT_IN_TM_LOAD (4):
656 CASE_BUILT_IN_TM_LOAD (8):
657 CASE_BUILT_IN_TM_LOAD (FLOAT
):
658 CASE_BUILT_IN_TM_LOAD (DOUBLE
):
659 CASE_BUILT_IN_TM_LOAD (LDOUBLE
):
660 CASE_BUILT_IN_TM_LOAD (M64
):
661 CASE_BUILT_IN_TM_LOAD (M128
):
662 CASE_BUILT_IN_TM_LOAD (M256
):
663 case BUILT_IN_TM_LOG
:
664 case BUILT_IN_TM_LOG_1
:
665 case BUILT_IN_TM_LOG_2
:
666 case BUILT_IN_TM_LOG_4
:
667 case BUILT_IN_TM_LOG_8
:
668 case BUILT_IN_TM_LOG_FLOAT
:
669 case BUILT_IN_TM_LOG_DOUBLE
:
670 case BUILT_IN_TM_LOG_LDOUBLE
:
671 case BUILT_IN_TM_LOG_M64
:
672 case BUILT_IN_TM_LOG_M128
:
673 case BUILT_IN_TM_LOG_M256
:
682 /* Detect flags (function attributes) from the function decl or type node. */
685 flags_from_decl_or_type (const_tree exp
)
691 /* The function exp may have the `malloc' attribute. */
692 if (DECL_IS_MALLOC (exp
))
695 /* The function exp may have the `returns_twice' attribute. */
696 if (DECL_IS_RETURNS_TWICE (exp
))
697 flags
|= ECF_RETURNS_TWICE
;
699 /* Process the pure and const attributes. */
700 if (TREE_READONLY (exp
))
702 if (DECL_PURE_P (exp
))
704 if (DECL_LOOPING_CONST_OR_PURE_P (exp
))
705 flags
|= ECF_LOOPING_CONST_OR_PURE
;
707 if (DECL_IS_NOVOPS (exp
))
709 if (lookup_attribute ("leaf", DECL_ATTRIBUTES (exp
)))
712 if (TREE_NOTHROW (exp
))
713 flags
|= ECF_NOTHROW
;
717 if (is_tm_builtin (exp
))
718 flags
|= ECF_TM_BUILTIN
;
719 else if ((flags
& (ECF_CONST
|ECF_NOVOPS
)) != 0
720 || lookup_attribute ("transaction_pure",
721 TYPE_ATTRIBUTES (TREE_TYPE (exp
))))
722 flags
|= ECF_TM_PURE
;
725 flags
= special_function_p (exp
, flags
);
727 else if (TYPE_P (exp
))
729 if (TYPE_READONLY (exp
))
733 && ((flags
& ECF_CONST
) != 0
734 || lookup_attribute ("transaction_pure", TYPE_ATTRIBUTES (exp
))))
735 flags
|= ECF_TM_PURE
;
738 if (TREE_THIS_VOLATILE (exp
))
740 flags
|= ECF_NORETURN
;
741 if (flags
& (ECF_CONST
|ECF_PURE
))
742 flags
|= ECF_LOOPING_CONST_OR_PURE
;
748 /* Detect flags from a CALL_EXPR. */
751 call_expr_flags (const_tree t
)
754 tree decl
= get_callee_fndecl (t
);
757 flags
= flags_from_decl_or_type (decl
);
760 t
= TREE_TYPE (CALL_EXPR_FN (t
));
761 if (t
&& TREE_CODE (t
) == POINTER_TYPE
)
762 flags
= flags_from_decl_or_type (TREE_TYPE (t
));
770 /* Precompute all register parameters as described by ARGS, storing values
771 into fields within the ARGS array.
773 NUM_ACTUALS indicates the total number elements in the ARGS array.
775 Set REG_PARM_SEEN if we encounter a register parameter. */
778 precompute_register_parameters (int num_actuals
, struct arg_data
*args
,
785 for (i
= 0; i
< num_actuals
; i
++)
786 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
)
790 if (args
[i
].value
== 0)
793 args
[i
].value
= expand_normal (args
[i
].tree_value
);
794 preserve_temp_slots (args
[i
].value
);
798 /* If we are to promote the function arg to a wider mode,
801 if (args
[i
].mode
!= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)))
803 = convert_modes (args
[i
].mode
,
804 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
805 args
[i
].value
, args
[i
].unsignedp
);
807 /* If the value is a non-legitimate constant, force it into a
808 pseudo now. TLS symbols sometimes need a call to resolve. */
809 if (CONSTANT_P (args
[i
].value
)
810 && !targetm
.legitimate_constant_p (args
[i
].mode
, args
[i
].value
))
811 args
[i
].value
= force_reg (args
[i
].mode
, args
[i
].value
);
813 /* If we're going to have to load the value by parts, pull the
814 parts into pseudos. The part extraction process can involve
815 non-trivial computation. */
816 if (GET_CODE (args
[i
].reg
) == PARALLEL
)
818 tree type
= TREE_TYPE (args
[i
].tree_value
);
819 args
[i
].parallel_value
820 = emit_group_load_into_temps (args
[i
].reg
, args
[i
].value
,
821 type
, int_size_in_bytes (type
));
824 /* If the value is expensive, and we are inside an appropriately
825 short loop, put the value into a pseudo and then put the pseudo
828 For small register classes, also do this if this call uses
829 register parameters. This is to avoid reload conflicts while
830 loading the parameters registers. */
832 else if ((! (REG_P (args
[i
].value
)
833 || (GET_CODE (args
[i
].value
) == SUBREG
834 && REG_P (SUBREG_REG (args
[i
].value
)))))
835 && args
[i
].mode
!= BLKmode
836 && set_src_cost (args
[i
].value
, optimize_insn_for_speed_p ())
839 && targetm
.small_register_classes_for_mode_p (args
[i
].mode
))
841 args
[i
].value
= copy_to_mode_reg (args
[i
].mode
, args
[i
].value
);
845 #ifdef REG_PARM_STACK_SPACE
847 /* The argument list is the property of the called routine and it
848 may clobber it. If the fixed area has been used for previous
849 parameters, we must save and restore it. */
852 save_fixed_argument_area (int reg_parm_stack_space
, rtx argblock
, int *low_to_save
, int *high_to_save
)
857 /* Compute the boundary of the area that needs to be saved, if any. */
858 high
= reg_parm_stack_space
;
859 #ifdef ARGS_GROW_DOWNWARD
862 if (high
> highest_outgoing_arg_in_use
)
863 high
= highest_outgoing_arg_in_use
;
865 for (low
= 0; low
< high
; low
++)
866 if (stack_usage_map
[low
] != 0)
869 enum machine_mode save_mode
;
874 while (stack_usage_map
[--high
] == 0)
878 *high_to_save
= high
;
880 num_to_save
= high
- low
+ 1;
881 save_mode
= mode_for_size (num_to_save
* BITS_PER_UNIT
, MODE_INT
, 1);
883 /* If we don't have the required alignment, must do this
885 if ((low
& (MIN (GET_MODE_SIZE (save_mode
),
886 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)))
889 #ifdef ARGS_GROW_DOWNWARD
894 stack_area
= gen_rtx_MEM (save_mode
,
895 memory_address (save_mode
,
896 plus_constant (argblock
,
899 set_mem_align (stack_area
, PARM_BOUNDARY
);
900 if (save_mode
== BLKmode
)
902 save_area
= assign_stack_temp (BLKmode
, num_to_save
, 0);
903 emit_block_move (validize_mem (save_area
), stack_area
,
904 GEN_INT (num_to_save
), BLOCK_OP_CALL_PARM
);
908 save_area
= gen_reg_rtx (save_mode
);
909 emit_move_insn (save_area
, stack_area
);
919 restore_fixed_argument_area (rtx save_area
, rtx argblock
, int high_to_save
, int low_to_save
)
921 enum machine_mode save_mode
= GET_MODE (save_area
);
925 #ifdef ARGS_GROW_DOWNWARD
926 delta
= -high_to_save
;
930 stack_area
= gen_rtx_MEM (save_mode
,
931 memory_address (save_mode
,
932 plus_constant (argblock
, delta
)));
933 set_mem_align (stack_area
, PARM_BOUNDARY
);
935 if (save_mode
!= BLKmode
)
936 emit_move_insn (stack_area
, save_area
);
938 emit_block_move (stack_area
, validize_mem (save_area
),
939 GEN_INT (high_to_save
- low_to_save
+ 1),
942 #endif /* REG_PARM_STACK_SPACE */
944 /* If any elements in ARGS refer to parameters that are to be passed in
945 registers, but not in memory, and whose alignment does not permit a
946 direct copy into registers. Copy the values into a group of pseudos
947 which we will later copy into the appropriate hard registers.
949 Pseudos for each unaligned argument will be stored into the array
950 args[argnum].aligned_regs. The caller is responsible for deallocating
951 the aligned_regs array if it is nonzero. */
954 store_unaligned_arguments_into_pseudos (struct arg_data
*args
, int num_actuals
)
958 for (i
= 0; i
< num_actuals
; i
++)
959 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
960 && args
[i
].mode
== BLKmode
961 && MEM_P (args
[i
].value
)
962 && (MEM_ALIGN (args
[i
].value
)
963 < (unsigned int) MIN (BIGGEST_ALIGNMENT
, BITS_PER_WORD
)))
965 int bytes
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
966 int endian_correction
= 0;
970 gcc_assert (args
[i
].partial
% UNITS_PER_WORD
== 0);
971 args
[i
].n_aligned_regs
= args
[i
].partial
/ UNITS_PER_WORD
;
975 args
[i
].n_aligned_regs
976 = (bytes
+ UNITS_PER_WORD
- 1) / UNITS_PER_WORD
;
979 args
[i
].aligned_regs
= XNEWVEC (rtx
, args
[i
].n_aligned_regs
);
981 /* Structures smaller than a word are normally aligned to the
982 least significant byte. On a BYTES_BIG_ENDIAN machine,
983 this means we must skip the empty high order bytes when
984 calculating the bit offset. */
985 if (bytes
< UNITS_PER_WORD
986 #ifdef BLOCK_REG_PADDING
987 && (BLOCK_REG_PADDING (args
[i
].mode
,
988 TREE_TYPE (args
[i
].tree_value
), 1)
994 endian_correction
= BITS_PER_WORD
- bytes
* BITS_PER_UNIT
;
996 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
998 rtx reg
= gen_reg_rtx (word_mode
);
999 rtx word
= operand_subword_force (args
[i
].value
, j
, BLKmode
);
1000 int bitsize
= MIN (bytes
* BITS_PER_UNIT
, BITS_PER_WORD
);
1002 args
[i
].aligned_regs
[j
] = reg
;
1003 word
= extract_bit_field (word
, bitsize
, 0, 1, false, NULL_RTX
,
1004 word_mode
, word_mode
);
1006 /* There is no need to restrict this code to loading items
1007 in TYPE_ALIGN sized hunks. The bitfield instructions can
1008 load up entire word sized registers efficiently.
1010 ??? This may not be needed anymore.
1011 We use to emit a clobber here but that doesn't let later
1012 passes optimize the instructions we emit. By storing 0 into
1013 the register later passes know the first AND to zero out the
1014 bitfield being set in the register is unnecessary. The store
1015 of 0 will be deleted as will at least the first AND. */
1017 emit_move_insn (reg
, const0_rtx
);
1019 bytes
-= bitsize
/ BITS_PER_UNIT
;
1020 store_bit_field (reg
, bitsize
, endian_correction
, 0, 0,
1026 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1029 NUM_ACTUALS is the total number of parameters.
1031 N_NAMED_ARGS is the total number of named arguments.
1033 STRUCT_VALUE_ADDR_VALUE is the implicit argument for a struct return
1036 FNDECL is the tree code for the target of this call (if known)
1038 ARGS_SO_FAR holds state needed by the target to know where to place
1041 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1042 for arguments which are passed in registers.
1044 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1045 and may be modified by this routine.
1047 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1048 flags which may may be modified by this routine.
1050 MAY_TAILCALL is cleared if we encounter an invisible pass-by-reference
1051 that requires allocation of stack space.
1053 CALL_FROM_THUNK_P is true if this call is the jump from a thunk to
1054 the thunked-to function. */
1057 initialize_argument_information (int num_actuals ATTRIBUTE_UNUSED
,
1058 struct arg_data
*args
,
1059 struct args_size
*args_size
,
1060 int n_named_args ATTRIBUTE_UNUSED
,
1061 tree exp
, tree struct_value_addr_value
,
1062 tree fndecl
, tree fntype
,
1063 cumulative_args_t args_so_far
,
1064 int reg_parm_stack_space
,
1065 rtx
*old_stack_level
, int *old_pending_adj
,
1066 int *must_preallocate
, int *ecf_flags
,
1067 bool *may_tailcall
, bool call_from_thunk_p
)
1069 CUMULATIVE_ARGS
*args_so_far_pnt
= get_cumulative_args (args_so_far
);
1070 location_t loc
= EXPR_LOCATION (exp
);
1071 /* 1 if scanning parms front to back, -1 if scanning back to front. */
1074 /* Count arg position in order args appear. */
1079 args_size
->constant
= 0;
1082 /* In this loop, we consider args in the order they are written.
1083 We fill up ARGS from the front or from the back if necessary
1084 so that in any case the first arg to be pushed ends up at the front. */
1086 if (PUSH_ARGS_REVERSED
)
1088 i
= num_actuals
- 1, inc
= -1;
1089 /* In this case, must reverse order of args
1090 so that we compute and push the last arg first. */
1097 /* First fill in the actual arguments in the ARGS array, splitting
1098 complex arguments if necessary. */
1101 call_expr_arg_iterator iter
;
1104 if (struct_value_addr_value
)
1106 args
[j
].tree_value
= struct_value_addr_value
;
1109 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
1111 tree argtype
= TREE_TYPE (arg
);
1112 if (targetm
.calls
.split_complex_arg
1114 && TREE_CODE (argtype
) == COMPLEX_TYPE
1115 && targetm
.calls
.split_complex_arg (argtype
))
1117 tree subtype
= TREE_TYPE (argtype
);
1118 args
[j
].tree_value
= build1 (REALPART_EXPR
, subtype
, arg
);
1120 args
[j
].tree_value
= build1 (IMAGPART_EXPR
, subtype
, arg
);
1123 args
[j
].tree_value
= arg
;
1128 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1129 for (argpos
= 0; argpos
< num_actuals
; i
+= inc
, argpos
++)
1131 tree type
= TREE_TYPE (args
[i
].tree_value
);
1133 enum machine_mode mode
;
1135 /* Replace erroneous argument with constant zero. */
1136 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
1137 args
[i
].tree_value
= integer_zero_node
, type
= integer_type_node
;
1139 /* If TYPE is a transparent union or record, pass things the way
1140 we would pass the first field of the union or record. We have
1141 already verified that the modes are the same. */
1142 if ((TREE_CODE (type
) == UNION_TYPE
|| TREE_CODE (type
) == RECORD_TYPE
)
1143 && TYPE_TRANSPARENT_AGGR (type
))
1144 type
= TREE_TYPE (first_field (type
));
1146 /* Decide where to pass this arg.
1148 args[i].reg is nonzero if all or part is passed in registers.
1150 args[i].partial is nonzero if part but not all is passed in registers,
1151 and the exact value says how many bytes are passed in registers.
1153 args[i].pass_on_stack is nonzero if the argument must at least be
1154 computed on the stack. It may then be loaded back into registers
1155 if args[i].reg is nonzero.
1157 These decisions are driven by the FUNCTION_... macros and must agree
1158 with those made by function.c. */
1160 /* See if this argument should be passed by invisible reference. */
1161 if (pass_by_reference (args_so_far_pnt
, TYPE_MODE (type
),
1162 type
, argpos
< n_named_args
))
1165 tree base
= NULL_TREE
;
1168 = reference_callee_copied (args_so_far_pnt
, TYPE_MODE (type
),
1169 type
, argpos
< n_named_args
);
1171 /* If we're compiling a thunk, pass through invisible references
1172 instead of making a copy. */
1173 if (call_from_thunk_p
1175 && !TREE_ADDRESSABLE (type
)
1176 && (base
= get_base_address (args
[i
].tree_value
))
1177 && TREE_CODE (base
) != SSA_NAME
1178 && (!DECL_P (base
) || MEM_P (DECL_RTL (base
)))))
1180 mark_addressable (args
[i
].tree_value
);
1182 /* We can't use sibcalls if a callee-copied argument is
1183 stored in the current function's frame. */
1184 if (!call_from_thunk_p
&& DECL_P (base
) && !TREE_STATIC (base
))
1185 *may_tailcall
= false;
1187 args
[i
].tree_value
= build_fold_addr_expr_loc (loc
,
1188 args
[i
].tree_value
);
1189 type
= TREE_TYPE (args
[i
].tree_value
);
1191 if (*ecf_flags
& ECF_CONST
)
1192 *ecf_flags
&= ~(ECF_CONST
| ECF_LOOPING_CONST_OR_PURE
);
1196 /* We make a copy of the object and pass the address to the
1197 function being called. */
1200 if (!COMPLETE_TYPE_P (type
)
1201 || TREE_CODE (TYPE_SIZE_UNIT (type
)) != INTEGER_CST
1202 || (flag_stack_check
== GENERIC_STACK_CHECK
1203 && compare_tree_int (TYPE_SIZE_UNIT (type
),
1204 STACK_CHECK_MAX_VAR_SIZE
) > 0))
1206 /* This is a variable-sized object. Make space on the stack
1208 rtx size_rtx
= expr_size (args
[i
].tree_value
);
1210 if (*old_stack_level
== 0)
1212 emit_stack_save (SAVE_BLOCK
, old_stack_level
);
1213 *old_pending_adj
= pending_stack_adjust
;
1214 pending_stack_adjust
= 0;
1217 /* We can pass TRUE as the 4th argument because we just
1218 saved the stack pointer and will restore it right after
1220 copy
= allocate_dynamic_stack_space (size_rtx
,
1224 copy
= gen_rtx_MEM (BLKmode
, copy
);
1225 set_mem_attributes (copy
, type
, 1);
1228 copy
= assign_temp (type
, 0, 1, 0);
1230 store_expr (args
[i
].tree_value
, copy
, 0, false);
1232 /* Just change the const function to pure and then let
1233 the next test clear the pure based on
1235 if (*ecf_flags
& ECF_CONST
)
1237 *ecf_flags
&= ~ECF_CONST
;
1238 *ecf_flags
|= ECF_PURE
;
1241 if (!callee_copies
&& *ecf_flags
& ECF_PURE
)
1242 *ecf_flags
&= ~(ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
1245 = build_fold_addr_expr_loc (loc
, make_tree (type
, copy
));
1246 type
= TREE_TYPE (args
[i
].tree_value
);
1247 *may_tailcall
= false;
1251 unsignedp
= TYPE_UNSIGNED (type
);
1252 mode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
1253 fndecl
? TREE_TYPE (fndecl
) : fntype
, 0);
1255 args
[i
].unsignedp
= unsignedp
;
1256 args
[i
].mode
= mode
;
1258 args
[i
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
, type
,
1259 argpos
< n_named_args
);
1261 /* If this is a sibling call and the machine has register windows, the
1262 register window has to be unwinded before calling the routine, so
1263 arguments have to go into the incoming registers. */
1264 if (targetm
.calls
.function_incoming_arg
!= targetm
.calls
.function_arg
)
1265 args
[i
].tail_call_reg
1266 = targetm
.calls
.function_incoming_arg (args_so_far
, mode
, type
,
1267 argpos
< n_named_args
);
1269 args
[i
].tail_call_reg
= args
[i
].reg
;
1273 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, type
,
1274 argpos
< n_named_args
);
1276 args
[i
].pass_on_stack
= targetm
.calls
.must_pass_in_stack (mode
, type
);
1278 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1279 it means that we are to pass this arg in the register(s) designated
1280 by the PARALLEL, but also to pass it in the stack. */
1281 if (args
[i
].reg
&& GET_CODE (args
[i
].reg
) == PARALLEL
1282 && XEXP (XVECEXP (args
[i
].reg
, 0, 0), 0) == 0)
1283 args
[i
].pass_on_stack
= 1;
1285 /* If this is an addressable type, we must preallocate the stack
1286 since we must evaluate the object into its final location.
1288 If this is to be passed in both registers and the stack, it is simpler
1290 if (TREE_ADDRESSABLE (type
)
1291 || (args
[i
].pass_on_stack
&& args
[i
].reg
!= 0))
1292 *must_preallocate
= 1;
1294 /* Compute the stack-size of this argument. */
1295 if (args
[i
].reg
== 0 || args
[i
].partial
!= 0
1296 || reg_parm_stack_space
> 0
1297 || args
[i
].pass_on_stack
)
1298 locate_and_pad_parm (mode
, type
,
1299 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1304 args
[i
].pass_on_stack
? 0 : args
[i
].partial
,
1305 fndecl
, args_size
, &args
[i
].locate
);
1306 #ifdef BLOCK_REG_PADDING
1308 /* The argument is passed entirely in registers. See at which
1309 end it should be padded. */
1310 args
[i
].locate
.where_pad
=
1311 BLOCK_REG_PADDING (mode
, type
,
1312 int_size_in_bytes (type
) <= UNITS_PER_WORD
);
1315 /* Update ARGS_SIZE, the total stack space for args so far. */
1317 args_size
->constant
+= args
[i
].locate
.size
.constant
;
1318 if (args
[i
].locate
.size
.var
)
1319 ADD_PARM_SIZE (*args_size
, args
[i
].locate
.size
.var
);
1321 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1322 have been used, etc. */
1324 targetm
.calls
.function_arg_advance (args_so_far
, TYPE_MODE (type
),
1325 type
, argpos
< n_named_args
);
1329 /* Update ARGS_SIZE to contain the total size for the argument block.
1330 Return the original constant component of the argument block's size.
1332 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1333 for arguments passed in registers. */
1336 compute_argument_block_size (int reg_parm_stack_space
,
1337 struct args_size
*args_size
,
1338 tree fndecl ATTRIBUTE_UNUSED
,
1339 tree fntype ATTRIBUTE_UNUSED
,
1340 int preferred_stack_boundary ATTRIBUTE_UNUSED
)
1342 int unadjusted_args_size
= args_size
->constant
;
1344 /* For accumulate outgoing args mode we don't need to align, since the frame
1345 will be already aligned. Align to STACK_BOUNDARY in order to prevent
1346 backends from generating misaligned frame sizes. */
1347 if (ACCUMULATE_OUTGOING_ARGS
&& preferred_stack_boundary
> STACK_BOUNDARY
)
1348 preferred_stack_boundary
= STACK_BOUNDARY
;
1350 /* Compute the actual size of the argument block required. The variable
1351 and constant sizes must be combined, the size may have to be rounded,
1352 and there may be a minimum required size. */
1356 args_size
->var
= ARGS_SIZE_TREE (*args_size
);
1357 args_size
->constant
= 0;
1359 preferred_stack_boundary
/= BITS_PER_UNIT
;
1360 if (preferred_stack_boundary
> 1)
1362 /* We don't handle this case yet. To handle it correctly we have
1363 to add the delta, round and subtract the delta.
1364 Currently no machine description requires this support. */
1365 gcc_assert (!(stack_pointer_delta
& (preferred_stack_boundary
- 1)));
1366 args_size
->var
= round_up (args_size
->var
, preferred_stack_boundary
);
1369 if (reg_parm_stack_space
> 0)
1372 = size_binop (MAX_EXPR
, args_size
->var
,
1373 ssize_int (reg_parm_stack_space
));
1375 /* The area corresponding to register parameters is not to count in
1376 the size of the block we need. So make the adjustment. */
1377 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
1379 = size_binop (MINUS_EXPR
, args_size
->var
,
1380 ssize_int (reg_parm_stack_space
));
1385 preferred_stack_boundary
/= BITS_PER_UNIT
;
1386 if (preferred_stack_boundary
< 1)
1387 preferred_stack_boundary
= 1;
1388 args_size
->constant
= (((args_size
->constant
1389 + stack_pointer_delta
1390 + preferred_stack_boundary
- 1)
1391 / preferred_stack_boundary
1392 * preferred_stack_boundary
)
1393 - stack_pointer_delta
);
1395 args_size
->constant
= MAX (args_size
->constant
,
1396 reg_parm_stack_space
);
1398 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
1399 args_size
->constant
-= reg_parm_stack_space
;
1401 return unadjusted_args_size
;
1404 /* Precompute parameters as needed for a function call.
1406 FLAGS is mask of ECF_* constants.
1408 NUM_ACTUALS is the number of arguments.
1410 ARGS is an array containing information for each argument; this
1411 routine fills in the INITIAL_VALUE and VALUE fields for each
1412 precomputed argument. */
1415 precompute_arguments (int num_actuals
, struct arg_data
*args
)
1419 /* If this is a libcall, then precompute all arguments so that we do not
1420 get extraneous instructions emitted as part of the libcall sequence. */
1422 /* If we preallocated the stack space, and some arguments must be passed
1423 on the stack, then we must precompute any parameter which contains a
1424 function call which will store arguments on the stack.
1425 Otherwise, evaluating the parameter may clobber previous parameters
1426 which have already been stored into the stack. (we have code to avoid
1427 such case by saving the outgoing stack arguments, but it results in
1429 if (!ACCUMULATE_OUTGOING_ARGS
)
1432 for (i
= 0; i
< num_actuals
; i
++)
1435 enum machine_mode mode
;
1437 if (TREE_CODE (args
[i
].tree_value
) != CALL_EXPR
)
1440 /* If this is an addressable type, we cannot pre-evaluate it. */
1441 type
= TREE_TYPE (args
[i
].tree_value
);
1442 gcc_assert (!TREE_ADDRESSABLE (type
));
1444 args
[i
].initial_value
= args
[i
].value
1445 = expand_normal (args
[i
].tree_value
);
1447 mode
= TYPE_MODE (type
);
1448 if (mode
!= args
[i
].mode
)
1450 int unsignedp
= args
[i
].unsignedp
;
1452 = convert_modes (args
[i
].mode
, mode
,
1453 args
[i
].value
, args
[i
].unsignedp
);
1455 /* CSE will replace this only if it contains args[i].value
1456 pseudo, so convert it down to the declared mode using
1458 if (REG_P (args
[i
].value
)
1459 && GET_MODE_CLASS (args
[i
].mode
) == MODE_INT
1460 && promote_mode (type
, mode
, &unsignedp
) != args
[i
].mode
)
1462 args
[i
].initial_value
1463 = gen_lowpart_SUBREG (mode
, args
[i
].value
);
1464 SUBREG_PROMOTED_VAR_P (args
[i
].initial_value
) = 1;
1465 SUBREG_PROMOTED_UNSIGNED_SET (args
[i
].initial_value
,
1472 /* Given the current state of MUST_PREALLOCATE and information about
1473 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
1474 compute and return the final value for MUST_PREALLOCATE. */
1477 finalize_must_preallocate (int must_preallocate
, int num_actuals
,
1478 struct arg_data
*args
, struct args_size
*args_size
)
1480 /* See if we have or want to preallocate stack space.
1482 If we would have to push a partially-in-regs parm
1483 before other stack parms, preallocate stack space instead.
1485 If the size of some parm is not a multiple of the required stack
1486 alignment, we must preallocate.
1488 If the total size of arguments that would otherwise create a copy in
1489 a temporary (such as a CALL) is more than half the total argument list
1490 size, preallocation is faster.
1492 Another reason to preallocate is if we have a machine (like the m88k)
1493 where stack alignment is required to be maintained between every
1494 pair of insns, not just when the call is made. However, we assume here
1495 that such machines either do not have push insns (and hence preallocation
1496 would occur anyway) or the problem is taken care of with
1499 if (! must_preallocate
)
1501 int partial_seen
= 0;
1502 int copy_to_evaluate_size
= 0;
1505 for (i
= 0; i
< num_actuals
&& ! must_preallocate
; i
++)
1507 if (args
[i
].partial
> 0 && ! args
[i
].pass_on_stack
)
1509 else if (partial_seen
&& args
[i
].reg
== 0)
1510 must_preallocate
= 1;
1512 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
1513 && (TREE_CODE (args
[i
].tree_value
) == CALL_EXPR
1514 || TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
1515 || TREE_CODE (args
[i
].tree_value
) == COND_EXPR
1516 || TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
))))
1517 copy_to_evaluate_size
1518 += int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1521 if (copy_to_evaluate_size
* 2 >= args_size
->constant
1522 && args_size
->constant
> 0)
1523 must_preallocate
= 1;
1525 return must_preallocate
;
1528 /* If we preallocated stack space, compute the address of each argument
1529 and store it into the ARGS array.
1531 We need not ensure it is a valid memory address here; it will be
1532 validized when it is used.
1534 ARGBLOCK is an rtx for the address of the outgoing arguments. */
1537 compute_argument_addresses (struct arg_data
*args
, rtx argblock
, int num_actuals
)
1541 rtx arg_reg
= argblock
;
1542 int i
, arg_offset
= 0;
1544 if (GET_CODE (argblock
) == PLUS
)
1545 arg_reg
= XEXP (argblock
, 0), arg_offset
= INTVAL (XEXP (argblock
, 1));
1547 for (i
= 0; i
< num_actuals
; i
++)
1549 rtx offset
= ARGS_SIZE_RTX (args
[i
].locate
.offset
);
1550 rtx slot_offset
= ARGS_SIZE_RTX (args
[i
].locate
.slot_offset
);
1552 unsigned int align
, boundary
;
1553 unsigned int units_on_stack
= 0;
1554 enum machine_mode partial_mode
= VOIDmode
;
1556 /* Skip this parm if it will not be passed on the stack. */
1557 if (! args
[i
].pass_on_stack
1559 && args
[i
].partial
== 0)
1562 if (CONST_INT_P (offset
))
1563 addr
= plus_constant (arg_reg
, INTVAL (offset
));
1565 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, offset
);
1567 addr
= plus_constant (addr
, arg_offset
);
1569 if (args
[i
].partial
!= 0)
1571 /* Only part of the parameter is being passed on the stack.
1572 Generate a simple memory reference of the correct size. */
1573 units_on_stack
= args
[i
].locate
.size
.constant
;
1574 partial_mode
= mode_for_size (units_on_stack
* BITS_PER_UNIT
,
1576 args
[i
].stack
= gen_rtx_MEM (partial_mode
, addr
);
1577 set_mem_size (args
[i
].stack
, units_on_stack
);
1581 args
[i
].stack
= gen_rtx_MEM (args
[i
].mode
, addr
);
1582 set_mem_attributes (args
[i
].stack
,
1583 TREE_TYPE (args
[i
].tree_value
), 1);
1585 align
= BITS_PER_UNIT
;
1586 boundary
= args
[i
].locate
.boundary
;
1587 if (args
[i
].locate
.where_pad
!= downward
)
1589 else if (CONST_INT_P (offset
))
1591 align
= INTVAL (offset
) * BITS_PER_UNIT
| boundary
;
1592 align
= align
& -align
;
1594 set_mem_align (args
[i
].stack
, align
);
1596 if (CONST_INT_P (slot_offset
))
1597 addr
= plus_constant (arg_reg
, INTVAL (slot_offset
));
1599 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, slot_offset
);
1601 addr
= plus_constant (addr
, arg_offset
);
1603 if (args
[i
].partial
!= 0)
1605 /* Only part of the parameter is being passed on the stack.
1606 Generate a simple memory reference of the correct size.
1608 args
[i
].stack_slot
= gen_rtx_MEM (partial_mode
, addr
);
1609 set_mem_size (args
[i
].stack_slot
, units_on_stack
);
1613 args
[i
].stack_slot
= gen_rtx_MEM (args
[i
].mode
, addr
);
1614 set_mem_attributes (args
[i
].stack_slot
,
1615 TREE_TYPE (args
[i
].tree_value
), 1);
1617 set_mem_align (args
[i
].stack_slot
, args
[i
].locate
.boundary
);
1619 /* Function incoming arguments may overlap with sibling call
1620 outgoing arguments and we cannot allow reordering of reads
1621 from function arguments with stores to outgoing arguments
1622 of sibling calls. */
1623 set_mem_alias_set (args
[i
].stack
, 0);
1624 set_mem_alias_set (args
[i
].stack_slot
, 0);
1629 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
1630 in a call instruction.
1632 FNDECL is the tree node for the target function. For an indirect call
1633 FNDECL will be NULL_TREE.
1635 ADDR is the operand 0 of CALL_EXPR for this call. */
1638 rtx_for_function_call (tree fndecl
, tree addr
)
1642 /* Get the function to call, in the form of RTL. */
1645 /* If this is the first use of the function, see if we need to
1646 make an external definition for it. */
1647 if (!TREE_USED (fndecl
) && fndecl
!= current_function_decl
)
1649 assemble_external (fndecl
);
1650 TREE_USED (fndecl
) = 1;
1653 /* Get a SYMBOL_REF rtx for the function address. */
1654 funexp
= XEXP (DECL_RTL (fndecl
), 0);
1657 /* Generate an rtx (probably a pseudo-register) for the address. */
1660 funexp
= expand_normal (addr
);
1661 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
1666 /* Internal state for internal_arg_pointer_based_exp and its helpers. */
1669 /* Last insn that has been scanned by internal_arg_pointer_based_exp_scan,
1670 or NULL_RTX if none has been scanned yet. */
1672 /* Vector indexed by REGNO - FIRST_PSEUDO_REGISTER, recording if a pseudo is
1673 based on crtl->args.internal_arg_pointer. The element is NULL_RTX if the
1674 pseudo isn't based on it, a CONST_INT offset if the pseudo is based on it
1675 with fixed offset, or PC if this is with variable or unknown offset. */
1676 VEC(rtx
, heap
) *cache
;
1677 } internal_arg_pointer_exp_state
;
1679 static rtx
internal_arg_pointer_based_exp (rtx
, bool);
1681 /* Helper function for internal_arg_pointer_based_exp. Scan insns in
1682 the tail call sequence, starting with first insn that hasn't been
1683 scanned yet, and note for each pseudo on the LHS whether it is based
1684 on crtl->args.internal_arg_pointer or not, and what offset from that
1685 that pointer it has. */
1688 internal_arg_pointer_based_exp_scan (void)
1690 rtx insn
, scan_start
= internal_arg_pointer_exp_state
.scan_start
;
1692 if (scan_start
== NULL_RTX
)
1693 insn
= get_insns ();
1695 insn
= NEXT_INSN (scan_start
);
1699 rtx set
= single_set (insn
);
1700 if (set
&& REG_P (SET_DEST (set
)) && !HARD_REGISTER_P (SET_DEST (set
)))
1703 unsigned int idx
= REGNO (SET_DEST (set
)) - FIRST_PSEUDO_REGISTER
;
1704 /* Punt on pseudos set multiple times. */
1705 if (idx
< VEC_length (rtx
, internal_arg_pointer_exp_state
.cache
)
1706 && (VEC_index (rtx
, internal_arg_pointer_exp_state
.cache
, idx
)
1710 val
= internal_arg_pointer_based_exp (SET_SRC (set
), false);
1711 if (val
!= NULL_RTX
)
1714 >= VEC_length (rtx
, internal_arg_pointer_exp_state
.cache
))
1715 VEC_safe_grow_cleared (rtx
, heap
,
1716 internal_arg_pointer_exp_state
.cache
,
1718 VEC_replace (rtx
, internal_arg_pointer_exp_state
.cache
,
1722 if (NEXT_INSN (insn
) == NULL_RTX
)
1724 insn
= NEXT_INSN (insn
);
1727 internal_arg_pointer_exp_state
.scan_start
= scan_start
;
1730 /* Helper function for internal_arg_pointer_based_exp, called through
1731 for_each_rtx. Return 1 if *LOC is a register based on
1732 crtl->args.internal_arg_pointer. Return -1 if *LOC is not based on it
1733 and the subexpressions need not be examined. Otherwise return 0. */
1736 internal_arg_pointer_based_exp_1 (rtx
*loc
, void *data ATTRIBUTE_UNUSED
)
1738 if (REG_P (*loc
) && internal_arg_pointer_based_exp (*loc
, false) != NULL_RTX
)
1745 /* Compute whether RTL is based on crtl->args.internal_arg_pointer. Return
1746 NULL_RTX if RTL isn't based on it, a CONST_INT offset if RTL is based on
1747 it with fixed offset, or PC if this is with variable or unknown offset.
1748 TOPLEVEL is true if the function is invoked at the topmost level. */
1751 internal_arg_pointer_based_exp (rtx rtl
, bool toplevel
)
1753 if (CONSTANT_P (rtl
))
1756 if (rtl
== crtl
->args
.internal_arg_pointer
)
1759 if (REG_P (rtl
) && HARD_REGISTER_P (rtl
))
1762 if (GET_CODE (rtl
) == PLUS
&& CONST_INT_P (XEXP (rtl
, 1)))
1764 rtx val
= internal_arg_pointer_based_exp (XEXP (rtl
, 0), toplevel
);
1765 if (val
== NULL_RTX
|| val
== pc_rtx
)
1767 return plus_constant (val
, INTVAL (XEXP (rtl
, 1)));
1770 /* When called at the topmost level, scan pseudo assignments in between the
1771 last scanned instruction in the tail call sequence and the latest insn
1772 in that sequence. */
1774 internal_arg_pointer_based_exp_scan ();
1778 unsigned int idx
= REGNO (rtl
) - FIRST_PSEUDO_REGISTER
;
1779 if (idx
< VEC_length (rtx
, internal_arg_pointer_exp_state
.cache
))
1780 return VEC_index (rtx
, internal_arg_pointer_exp_state
.cache
, idx
);
1785 if (for_each_rtx (&rtl
, internal_arg_pointer_based_exp_1
, NULL
))
1791 /* Return true if and only if SIZE storage units (usually bytes)
1792 starting from address ADDR overlap with already clobbered argument
1793 area. This function is used to determine if we should give up a
1797 mem_overlaps_already_clobbered_arg_p (rtx addr
, unsigned HOST_WIDE_INT size
)
1802 if (sbitmap_empty_p (stored_args_map
))
1804 val
= internal_arg_pointer_based_exp (addr
, true);
1805 if (val
== NULL_RTX
)
1807 else if (val
== pc_rtx
)
1811 #ifdef STACK_GROWS_DOWNWARD
1812 i
-= crtl
->args
.pretend_args_size
;
1814 i
+= crtl
->args
.pretend_args_size
;
1817 #ifdef ARGS_GROW_DOWNWARD
1822 unsigned HOST_WIDE_INT k
;
1824 for (k
= 0; k
< size
; k
++)
1825 if (i
+ k
< stored_args_map
->n_bits
1826 && TEST_BIT (stored_args_map
, i
+ k
))
1833 /* Do the register loads required for any wholly-register parms or any
1834 parms which are passed both on the stack and in a register. Their
1835 expressions were already evaluated.
1837 Mark all register-parms as living through the call, putting these USE
1838 insns in the CALL_INSN_FUNCTION_USAGE field.
1840 When IS_SIBCALL, perform the check_sibcall_argument_overlap
1841 checking, setting *SIBCALL_FAILURE if appropriate. */
1844 load_register_parameters (struct arg_data
*args
, int num_actuals
,
1845 rtx
*call_fusage
, int flags
, int is_sibcall
,
1846 int *sibcall_failure
)
1850 for (i
= 0; i
< num_actuals
; i
++)
1852 rtx reg
= ((flags
& ECF_SIBCALL
)
1853 ? args
[i
].tail_call_reg
: args
[i
].reg
);
1856 int partial
= args
[i
].partial
;
1859 rtx before_arg
= get_last_insn ();
1860 /* Set non-negative if we must move a word at a time, even if
1861 just one word (e.g, partial == 4 && mode == DFmode). Set
1862 to -1 if we just use a normal move insn. This value can be
1863 zero if the argument is a zero size structure. */
1865 if (GET_CODE (reg
) == PARALLEL
)
1869 gcc_assert (partial
% UNITS_PER_WORD
== 0);
1870 nregs
= partial
/ UNITS_PER_WORD
;
1872 else if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
)
1874 size
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1875 nregs
= (size
+ (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
1878 size
= GET_MODE_SIZE (args
[i
].mode
);
1880 /* Handle calls that pass values in multiple non-contiguous
1881 locations. The Irix 6 ABI has examples of this. */
1883 if (GET_CODE (reg
) == PARALLEL
)
1884 emit_group_move (reg
, args
[i
].parallel_value
);
1886 /* If simple case, just do move. If normal partial, store_one_arg
1887 has already loaded the register for us. In all other cases,
1888 load the register(s) from memory. */
1890 else if (nregs
== -1)
1892 emit_move_insn (reg
, args
[i
].value
);
1893 #ifdef BLOCK_REG_PADDING
1894 /* Handle case where we have a value that needs shifting
1895 up to the msb. eg. a QImode value and we're padding
1896 upward on a BYTES_BIG_ENDIAN machine. */
1897 if (size
< UNITS_PER_WORD
1898 && (args
[i
].locate
.where_pad
1899 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
1902 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
1904 /* Assigning REG here rather than a temp makes CALL_FUSAGE
1905 report the whole reg as used. Strictly speaking, the
1906 call only uses SIZE bytes at the msb end, but it doesn't
1907 seem worth generating rtl to say that. */
1908 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
1909 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, shift
, reg
, 1);
1911 emit_move_insn (reg
, x
);
1916 /* If we have pre-computed the values to put in the registers in
1917 the case of non-aligned structures, copy them in now. */
1919 else if (args
[i
].n_aligned_regs
!= 0)
1920 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1921 emit_move_insn (gen_rtx_REG (word_mode
, REGNO (reg
) + j
),
1922 args
[i
].aligned_regs
[j
]);
1924 else if (partial
== 0 || args
[i
].pass_on_stack
)
1926 rtx mem
= validize_mem (args
[i
].value
);
1928 /* Check for overlap with already clobbered argument area,
1929 providing that this has non-zero size. */
1932 || mem_overlaps_already_clobbered_arg_p
1933 (XEXP (args
[i
].value
, 0), size
)))
1934 *sibcall_failure
= 1;
1936 /* Handle a BLKmode that needs shifting. */
1937 if (nregs
== 1 && size
< UNITS_PER_WORD
1938 #ifdef BLOCK_REG_PADDING
1939 && args
[i
].locate
.where_pad
== downward
1945 rtx tem
= operand_subword_force (mem
, 0, args
[i
].mode
);
1946 rtx ri
= gen_rtx_REG (word_mode
, REGNO (reg
));
1947 rtx x
= gen_reg_rtx (word_mode
);
1948 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
1949 enum tree_code dir
= BYTES_BIG_ENDIAN
? RSHIFT_EXPR
1952 emit_move_insn (x
, tem
);
1953 x
= expand_shift (dir
, word_mode
, x
, shift
, ri
, 1);
1955 emit_move_insn (ri
, x
);
1958 move_block_to_reg (REGNO (reg
), mem
, nregs
, args
[i
].mode
);
1961 /* When a parameter is a block, and perhaps in other cases, it is
1962 possible that it did a load from an argument slot that was
1963 already clobbered. */
1965 && check_sibcall_argument_overlap (before_arg
, &args
[i
], 0))
1966 *sibcall_failure
= 1;
1968 /* Handle calls that pass values in multiple non-contiguous
1969 locations. The Irix 6 ABI has examples of this. */
1970 if (GET_CODE (reg
) == PARALLEL
)
1971 use_group_regs (call_fusage
, reg
);
1972 else if (nregs
== -1)
1973 use_reg_mode (call_fusage
, reg
,
1974 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)));
1976 use_regs (call_fusage
, REGNO (reg
), nregs
);
1981 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
1982 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
1983 bytes, then we would need to push some additional bytes to pad the
1984 arguments. So, we compute an adjust to the stack pointer for an
1985 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
1986 bytes. Then, when the arguments are pushed the stack will be perfectly
1987 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
1988 be popped after the call. Returns the adjustment. */
1991 combine_pending_stack_adjustment_and_call (int unadjusted_args_size
,
1992 struct args_size
*args_size
,
1993 unsigned int preferred_unit_stack_boundary
)
1995 /* The number of bytes to pop so that the stack will be
1996 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
1997 HOST_WIDE_INT adjustment
;
1998 /* The alignment of the stack after the arguments are pushed, if we
1999 just pushed the arguments without adjust the stack here. */
2000 unsigned HOST_WIDE_INT unadjusted_alignment
;
2002 unadjusted_alignment
2003 = ((stack_pointer_delta
+ unadjusted_args_size
)
2004 % preferred_unit_stack_boundary
);
2006 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
2007 as possible -- leaving just enough left to cancel out the
2008 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
2009 PENDING_STACK_ADJUST is non-negative, and congruent to
2010 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
2012 /* Begin by trying to pop all the bytes. */
2013 unadjusted_alignment
2014 = (unadjusted_alignment
2015 - (pending_stack_adjust
% preferred_unit_stack_boundary
));
2016 adjustment
= pending_stack_adjust
;
2017 /* Push enough additional bytes that the stack will be aligned
2018 after the arguments are pushed. */
2019 if (preferred_unit_stack_boundary
> 1)
2021 if (unadjusted_alignment
> 0)
2022 adjustment
-= preferred_unit_stack_boundary
- unadjusted_alignment
;
2024 adjustment
+= unadjusted_alignment
;
2027 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
2028 bytes after the call. The right number is the entire
2029 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
2030 by the arguments in the first place. */
2032 = pending_stack_adjust
- adjustment
+ unadjusted_args_size
;
2037 /* Scan X expression if it does not dereference any argument slots
2038 we already clobbered by tail call arguments (as noted in stored_args_map
2040 Return nonzero if X expression dereferences such argument slots,
2044 check_sibcall_argument_overlap_1 (rtx x
)
2053 code
= GET_CODE (x
);
2055 /* We need not check the operands of the CALL expression itself. */
2060 return mem_overlaps_already_clobbered_arg_p (XEXP (x
, 0),
2061 GET_MODE_SIZE (GET_MODE (x
)));
2063 /* Scan all subexpressions. */
2064 fmt
= GET_RTX_FORMAT (code
);
2065 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
2069 if (check_sibcall_argument_overlap_1 (XEXP (x
, i
)))
2072 else if (*fmt
== 'E')
2074 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2075 if (check_sibcall_argument_overlap_1 (XVECEXP (x
, i
, j
)))
2082 /* Scan sequence after INSN if it does not dereference any argument slots
2083 we already clobbered by tail call arguments (as noted in stored_args_map
2084 bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
2085 stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP
2086 should be 0). Return nonzero if sequence after INSN dereferences such argument
2087 slots, zero otherwise. */
2090 check_sibcall_argument_overlap (rtx insn
, struct arg_data
*arg
, int mark_stored_args_map
)
2094 if (insn
== NULL_RTX
)
2095 insn
= get_insns ();
2097 insn
= NEXT_INSN (insn
);
2099 for (; insn
; insn
= NEXT_INSN (insn
))
2101 && check_sibcall_argument_overlap_1 (PATTERN (insn
)))
2104 if (mark_stored_args_map
)
2106 #ifdef ARGS_GROW_DOWNWARD
2107 low
= -arg
->locate
.slot_offset
.constant
- arg
->locate
.size
.constant
;
2109 low
= arg
->locate
.slot_offset
.constant
;
2112 for (high
= low
+ arg
->locate
.size
.constant
; low
< high
; low
++)
2113 SET_BIT (stored_args_map
, low
);
2115 return insn
!= NULL_RTX
;
2118 /* Given that a function returns a value of mode MODE at the most
2119 significant end of hard register VALUE, shift VALUE left or right
2120 as specified by LEFT_P. Return true if some action was needed. */
2123 shift_return_value (enum machine_mode mode
, bool left_p
, rtx value
)
2125 HOST_WIDE_INT shift
;
2127 gcc_assert (REG_P (value
) && HARD_REGISTER_P (value
));
2128 shift
= GET_MODE_BITSIZE (GET_MODE (value
)) - GET_MODE_BITSIZE (mode
);
2132 /* Use ashr rather than lshr for right shifts. This is for the benefit
2133 of the MIPS port, which requires SImode values to be sign-extended
2134 when stored in 64-bit registers. */
2135 if (!force_expand_binop (GET_MODE (value
), left_p
? ashl_optab
: ashr_optab
,
2136 value
, GEN_INT (shift
), value
, 1, OPTAB_WIDEN
))
2141 /* If X is a likely-spilled register value, copy it to a pseudo
2142 register and return that register. Return X otherwise. */
2145 avoid_likely_spilled_reg (rtx x
)
2150 && HARD_REGISTER_P (x
)
2151 && targetm
.class_likely_spilled_p (REGNO_REG_CLASS (REGNO (x
))))
2153 /* Make sure that we generate a REG rather than a CONCAT.
2154 Moves into CONCATs can need nontrivial instructions,
2155 and the whole point of this function is to avoid
2156 using the hard register directly in such a situation. */
2157 generating_concat_p
= 0;
2158 new_rtx
= gen_reg_rtx (GET_MODE (x
));
2159 generating_concat_p
= 1;
2160 emit_move_insn (new_rtx
, x
);
2166 /* Generate all the code for a CALL_EXPR exp
2167 and return an rtx for its value.
2168 Store the value in TARGET (specified as an rtx) if convenient.
2169 If the value is stored in TARGET then TARGET is returned.
2170 If IGNORE is nonzero, then we ignore the value of the function call. */
2173 expand_call (tree exp
, rtx target
, int ignore
)
2175 /* Nonzero if we are currently expanding a call. */
2176 static int currently_expanding_call
= 0;
2178 /* RTX for the function to be called. */
2180 /* Sequence of insns to perform a normal "call". */
2181 rtx normal_call_insns
= NULL_RTX
;
2182 /* Sequence of insns to perform a tail "call". */
2183 rtx tail_call_insns
= NULL_RTX
;
2184 /* Data type of the function. */
2186 tree type_arg_types
;
2188 /* Declaration of the function being called,
2189 or 0 if the function is computed (not known by name). */
2191 /* The type of the function being called. */
2193 bool try_tail_call
= CALL_EXPR_TAILCALL (exp
);
2196 /* Register in which non-BLKmode value will be returned,
2197 or 0 if no value or if value is BLKmode. */
2199 /* Address where we should return a BLKmode value;
2200 0 if value not BLKmode. */
2201 rtx structure_value_addr
= 0;
2202 /* Nonzero if that address is being passed by treating it as
2203 an extra, implicit first parameter. Otherwise,
2204 it is passed by being copied directly into struct_value_rtx. */
2205 int structure_value_addr_parm
= 0;
2206 /* Holds the value of implicit argument for the struct value. */
2207 tree structure_value_addr_value
= NULL_TREE
;
2208 /* Size of aggregate value wanted, or zero if none wanted
2209 or if we are using the non-reentrant PCC calling convention
2210 or expecting the value in registers. */
2211 HOST_WIDE_INT struct_value_size
= 0;
2212 /* Nonzero if called function returns an aggregate in memory PCC style,
2213 by returning the address of where to find it. */
2214 int pcc_struct_value
= 0;
2215 rtx struct_value
= 0;
2217 /* Number of actual parameters in this call, including struct value addr. */
2219 /* Number of named args. Args after this are anonymous ones
2220 and they must all go on the stack. */
2222 /* Number of complex actual arguments that need to be split. */
2223 int num_complex_actuals
= 0;
2225 /* Vector of information about each argument.
2226 Arguments are numbered in the order they will be pushed,
2227 not the order they are written. */
2228 struct arg_data
*args
;
2230 /* Total size in bytes of all the stack-parms scanned so far. */
2231 struct args_size args_size
;
2232 struct args_size adjusted_args_size
;
2233 /* Size of arguments before any adjustments (such as rounding). */
2234 int unadjusted_args_size
;
2235 /* Data on reg parms scanned so far. */
2236 CUMULATIVE_ARGS args_so_far_v
;
2237 cumulative_args_t args_so_far
;
2238 /* Nonzero if a reg parm has been scanned. */
2240 /* Nonzero if this is an indirect function call. */
2242 /* Nonzero if we must avoid push-insns in the args for this call.
2243 If stack space is allocated for register parameters, but not by the
2244 caller, then it is preallocated in the fixed part of the stack frame.
2245 So the entire argument block must then be preallocated (i.e., we
2246 ignore PUSH_ROUNDING in that case). */
2248 int must_preallocate
= !PUSH_ARGS
;
2250 /* Size of the stack reserved for parameter registers. */
2251 int reg_parm_stack_space
= 0;
2253 /* Address of space preallocated for stack parms
2254 (on machines that lack push insns), or 0 if space not preallocated. */
2257 /* Mask of ECF_ flags. */
2259 #ifdef REG_PARM_STACK_SPACE
2260 /* Define the boundary of the register parm stack space that needs to be
2262 int low_to_save
, high_to_save
;
2263 rtx save_area
= 0; /* Place that it is saved */
2266 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
2267 char *initial_stack_usage_map
= stack_usage_map
;
2268 char *stack_usage_map_buf
= NULL
;
2270 int old_stack_allocated
;
2272 /* State variables to track stack modifications. */
2273 rtx old_stack_level
= 0;
2274 int old_stack_arg_under_construction
= 0;
2275 int old_pending_adj
= 0;
2276 int old_inhibit_defer_pop
= inhibit_defer_pop
;
2278 /* Some stack pointer alterations we make are performed via
2279 allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
2280 which we then also need to save/restore along the way. */
2281 int old_stack_pointer_delta
= 0;
2284 tree addr
= CALL_EXPR_FN (exp
);
2286 /* The alignment of the stack, in bits. */
2287 unsigned HOST_WIDE_INT preferred_stack_boundary
;
2288 /* The alignment of the stack, in bytes. */
2289 unsigned HOST_WIDE_INT preferred_unit_stack_boundary
;
2290 /* The static chain value to use for this call. */
2291 rtx static_chain_value
;
2292 /* See if this is "nothrow" function call. */
2293 if (TREE_NOTHROW (exp
))
2294 flags
|= ECF_NOTHROW
;
2296 /* See if we can find a DECL-node for the actual function, and get the
2297 function attributes (flags) from the function decl or type node. */
2298 fndecl
= get_callee_fndecl (exp
);
2301 fntype
= TREE_TYPE (fndecl
);
2302 flags
|= flags_from_decl_or_type (fndecl
);
2306 fntype
= TREE_TYPE (TREE_TYPE (addr
));
2307 flags
|= flags_from_decl_or_type (fntype
);
2309 rettype
= TREE_TYPE (exp
);
2311 struct_value
= targetm
.calls
.struct_value_rtx (fntype
, 0);
2313 /* Warn if this value is an aggregate type,
2314 regardless of which calling convention we are using for it. */
2315 if (AGGREGATE_TYPE_P (rettype
))
2316 warning (OPT_Waggregate_return
, "function call has aggregate value");
2318 /* If the result of a non looping pure or const function call is
2319 ignored (or void), and none of its arguments are volatile, we can
2320 avoid expanding the call and just evaluate the arguments for
2322 if ((flags
& (ECF_CONST
| ECF_PURE
))
2323 && (!(flags
& ECF_LOOPING_CONST_OR_PURE
))
2324 && (ignore
|| target
== const0_rtx
2325 || TYPE_MODE (rettype
) == VOIDmode
))
2327 bool volatilep
= false;
2329 call_expr_arg_iterator iter
;
2331 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
2332 if (TREE_THIS_VOLATILE (arg
))
2340 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
2341 expand_expr (arg
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
2346 #ifdef REG_PARM_STACK_SPACE
2347 reg_parm_stack_space
= REG_PARM_STACK_SPACE (!fndecl
? fntype
: fndecl
);
2350 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
2351 && reg_parm_stack_space
> 0 && PUSH_ARGS
)
2352 must_preallocate
= 1;
2354 /* Set up a place to return a structure. */
2356 /* Cater to broken compilers. */
2357 if (aggregate_value_p (exp
, fntype
))
2359 /* This call returns a big structure. */
2360 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
2362 #ifdef PCC_STATIC_STRUCT_RETURN
2364 pcc_struct_value
= 1;
2366 #else /* not PCC_STATIC_STRUCT_RETURN */
2368 struct_value_size
= int_size_in_bytes (rettype
);
2370 if (target
&& MEM_P (target
) && CALL_EXPR_RETURN_SLOT_OPT (exp
))
2371 structure_value_addr
= XEXP (target
, 0);
2374 /* For variable-sized objects, we must be called with a target
2375 specified. If we were to allocate space on the stack here,
2376 we would have no way of knowing when to free it. */
2377 rtx d
= assign_temp (rettype
, 0, 1, 1);
2379 mark_temp_addr_taken (d
);
2380 structure_value_addr
= XEXP (d
, 0);
2384 #endif /* not PCC_STATIC_STRUCT_RETURN */
2387 /* Figure out the amount to which the stack should be aligned. */
2388 preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
2391 struct cgraph_rtl_info
*i
= cgraph_rtl_info (fndecl
);
2392 /* Without automatic stack alignment, we can't increase preferred
2393 stack boundary. With automatic stack alignment, it is
2394 unnecessary since unless we can guarantee that all callers will
2395 align the outgoing stack properly, callee has to align its
2398 && i
->preferred_incoming_stack_boundary
2399 && i
->preferred_incoming_stack_boundary
< preferred_stack_boundary
)
2400 preferred_stack_boundary
= i
->preferred_incoming_stack_boundary
;
2403 /* Operand 0 is a pointer-to-function; get the type of the function. */
2404 funtype
= TREE_TYPE (addr
);
2405 gcc_assert (POINTER_TYPE_P (funtype
));
2406 funtype
= TREE_TYPE (funtype
);
2408 /* Count whether there are actual complex arguments that need to be split
2409 into their real and imaginary parts. Munge the type_arg_types
2410 appropriately here as well. */
2411 if (targetm
.calls
.split_complex_arg
)
2413 call_expr_arg_iterator iter
;
2415 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
2417 tree type
= TREE_TYPE (arg
);
2418 if (type
&& TREE_CODE (type
) == COMPLEX_TYPE
2419 && targetm
.calls
.split_complex_arg (type
))
2420 num_complex_actuals
++;
2422 type_arg_types
= split_complex_types (TYPE_ARG_TYPES (funtype
));
2425 type_arg_types
= TYPE_ARG_TYPES (funtype
);
2427 if (flags
& ECF_MAY_BE_ALLOCA
)
2428 cfun
->calls_alloca
= 1;
2430 /* If struct_value_rtx is 0, it means pass the address
2431 as if it were an extra parameter. Put the argument expression
2432 in structure_value_addr_value. */
2433 if (structure_value_addr
&& struct_value
== 0)
2435 /* If structure_value_addr is a REG other than
2436 virtual_outgoing_args_rtx, we can use always use it. If it
2437 is not a REG, we must always copy it into a register.
2438 If it is virtual_outgoing_args_rtx, we must copy it to another
2439 register in some cases. */
2440 rtx temp
= (!REG_P (structure_value_addr
)
2441 || (ACCUMULATE_OUTGOING_ARGS
2442 && stack_arg_under_construction
2443 && structure_value_addr
== virtual_outgoing_args_rtx
)
2444 ? copy_addr_to_reg (convert_memory_address
2445 (Pmode
, structure_value_addr
))
2446 : structure_value_addr
);
2448 structure_value_addr_value
=
2449 make_tree (build_pointer_type (TREE_TYPE (funtype
)), temp
);
2450 structure_value_addr_parm
= 1;
2453 /* Count the arguments and set NUM_ACTUALS. */
2455 call_expr_nargs (exp
) + num_complex_actuals
+ structure_value_addr_parm
;
2457 /* Compute number of named args.
2458 First, do a raw count of the args for INIT_CUMULATIVE_ARGS. */
2460 if (type_arg_types
!= 0)
2462 = (list_length (type_arg_types
)
2463 /* Count the struct value address, if it is passed as a parm. */
2464 + structure_value_addr_parm
);
2466 /* If we know nothing, treat all args as named. */
2467 n_named_args
= num_actuals
;
2469 /* Start updating where the next arg would go.
2471 On some machines (such as the PA) indirect calls have a different
2472 calling convention than normal calls. The fourth argument in
2473 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
2475 INIT_CUMULATIVE_ARGS (args_so_far_v
, funtype
, NULL_RTX
, fndecl
, n_named_args
);
2476 args_so_far
= pack_cumulative_args (&args_so_far_v
);
2478 /* Now possibly adjust the number of named args.
2479 Normally, don't include the last named arg if anonymous args follow.
2480 We do include the last named arg if
2481 targetm.calls.strict_argument_naming() returns nonzero.
2482 (If no anonymous args follow, the result of list_length is actually
2483 one too large. This is harmless.)
2485 If targetm.calls.pretend_outgoing_varargs_named() returns
2486 nonzero, and targetm.calls.strict_argument_naming() returns zero,
2487 this machine will be able to place unnamed args that were passed
2488 in registers into the stack. So treat all args as named. This
2489 allows the insns emitting for a specific argument list to be
2490 independent of the function declaration.
2492 If targetm.calls.pretend_outgoing_varargs_named() returns zero,
2493 we do not have any reliable way to pass unnamed args in
2494 registers, so we must force them into memory. */
2496 if (type_arg_types
!= 0
2497 && targetm
.calls
.strict_argument_naming (args_so_far
))
2499 else if (type_arg_types
!= 0
2500 && ! targetm
.calls
.pretend_outgoing_varargs_named (args_so_far
))
2501 /* Don't include the last named arg. */
2504 /* Treat all args as named. */
2505 n_named_args
= num_actuals
;
2507 /* Make a vector to hold all the information about each arg. */
2508 args
= XALLOCAVEC (struct arg_data
, num_actuals
);
2509 memset (args
, 0, num_actuals
* sizeof (struct arg_data
));
2511 /* Build up entries in the ARGS array, compute the size of the
2512 arguments into ARGS_SIZE, etc. */
2513 initialize_argument_information (num_actuals
, args
, &args_size
,
2515 structure_value_addr_value
, fndecl
, fntype
,
2516 args_so_far
, reg_parm_stack_space
,
2517 &old_stack_level
, &old_pending_adj
,
2518 &must_preallocate
, &flags
,
2519 &try_tail_call
, CALL_FROM_THUNK_P (exp
));
2522 must_preallocate
= 1;
2524 /* Now make final decision about preallocating stack space. */
2525 must_preallocate
= finalize_must_preallocate (must_preallocate
,
2529 /* If the structure value address will reference the stack pointer, we
2530 must stabilize it. We don't need to do this if we know that we are
2531 not going to adjust the stack pointer in processing this call. */
2533 if (structure_value_addr
2534 && (reg_mentioned_p (virtual_stack_dynamic_rtx
, structure_value_addr
)
2535 || reg_mentioned_p (virtual_outgoing_args_rtx
,
2536 structure_value_addr
))
2538 || (!ACCUMULATE_OUTGOING_ARGS
&& args_size
.constant
)))
2539 structure_value_addr
= copy_to_reg (structure_value_addr
);
2541 /* Tail calls can make things harder to debug, and we've traditionally
2542 pushed these optimizations into -O2. Don't try if we're already
2543 expanding a call, as that means we're an argument. Don't try if
2544 there's cleanups, as we know there's code to follow the call. */
2546 if (currently_expanding_call
++ != 0
2547 || !flag_optimize_sibling_calls
2549 || dbg_cnt (tail_call
) == false)
2552 /* Rest of purposes for tail call optimizations to fail. */
2554 #ifdef HAVE_sibcall_epilogue
2555 !HAVE_sibcall_epilogue
2560 /* Doing sibling call optimization needs some work, since
2561 structure_value_addr can be allocated on the stack.
2562 It does not seem worth the effort since few optimizable
2563 sibling calls will return a structure. */
2564 || structure_value_addr
!= NULL_RTX
2565 #ifdef REG_PARM_STACK_SPACE
2566 /* If outgoing reg parm stack space changes, we can not do sibcall. */
2567 || (OUTGOING_REG_PARM_STACK_SPACE (funtype
)
2568 != OUTGOING_REG_PARM_STACK_SPACE (TREE_TYPE (current_function_decl
)))
2569 || (reg_parm_stack_space
!= REG_PARM_STACK_SPACE (fndecl
))
2571 /* Check whether the target is able to optimize the call
2573 || !targetm
.function_ok_for_sibcall (fndecl
, exp
)
2574 /* Functions that do not return exactly once may not be sibcall
2576 || (flags
& (ECF_RETURNS_TWICE
| ECF_NORETURN
))
2577 || TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (addr
)))
2578 /* If the called function is nested in the current one, it might access
2579 some of the caller's arguments, but could clobber them beforehand if
2580 the argument areas are shared. */
2581 || (fndecl
&& decl_function_context (fndecl
) == current_function_decl
)
2582 /* If this function requires more stack slots than the current
2583 function, we cannot change it into a sibling call.
2584 crtl->args.pretend_args_size is not part of the
2585 stack allocated by our caller. */
2586 || args_size
.constant
> (crtl
->args
.size
2587 - crtl
->args
.pretend_args_size
)
2588 /* If the callee pops its own arguments, then it must pop exactly
2589 the same number of arguments as the current function. */
2590 || (targetm
.calls
.return_pops_args (fndecl
, funtype
, args_size
.constant
)
2591 != targetm
.calls
.return_pops_args (current_function_decl
,
2592 TREE_TYPE (current_function_decl
),
2594 || !lang_hooks
.decls
.ok_for_sibcall (fndecl
))
2597 /* Check if caller and callee disagree in promotion of function
2601 enum machine_mode caller_mode
, caller_promoted_mode
;
2602 enum machine_mode callee_mode
, callee_promoted_mode
;
2603 int caller_unsignedp
, callee_unsignedp
;
2604 tree caller_res
= DECL_RESULT (current_function_decl
);
2606 caller_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (caller_res
));
2607 caller_mode
= DECL_MODE (caller_res
);
2608 callee_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (funtype
));
2609 callee_mode
= TYPE_MODE (TREE_TYPE (funtype
));
2610 caller_promoted_mode
2611 = promote_function_mode (TREE_TYPE (caller_res
), caller_mode
,
2613 TREE_TYPE (current_function_decl
), 1);
2614 callee_promoted_mode
2615 = promote_function_mode (TREE_TYPE (funtype
), callee_mode
,
2618 if (caller_mode
!= VOIDmode
2619 && (caller_promoted_mode
!= callee_promoted_mode
2620 || ((caller_mode
!= caller_promoted_mode
2621 || callee_mode
!= callee_promoted_mode
)
2622 && (caller_unsignedp
!= callee_unsignedp
2623 || GET_MODE_BITSIZE (caller_mode
)
2624 < GET_MODE_BITSIZE (callee_mode
)))))
2628 /* Ensure current function's preferred stack boundary is at least
2629 what we need. Stack alignment may also increase preferred stack
2631 if (crtl
->preferred_stack_boundary
< preferred_stack_boundary
)
2632 crtl
->preferred_stack_boundary
= preferred_stack_boundary
;
2634 preferred_stack_boundary
= crtl
->preferred_stack_boundary
;
2636 preferred_unit_stack_boundary
= preferred_stack_boundary
/ BITS_PER_UNIT
;
2638 /* We want to make two insn chains; one for a sibling call, the other
2639 for a normal call. We will select one of the two chains after
2640 initial RTL generation is complete. */
2641 for (pass
= try_tail_call
? 0 : 1; pass
< 2; pass
++)
2643 int sibcall_failure
= 0;
2644 /* We want to emit any pending stack adjustments before the tail
2645 recursion "call". That way we know any adjustment after the tail
2646 recursion call can be ignored if we indeed use the tail
2648 int save_pending_stack_adjust
= 0;
2649 int save_stack_pointer_delta
= 0;
2651 rtx before_call
, next_arg_reg
, after_args
;
2655 /* State variables we need to save and restore between
2657 save_pending_stack_adjust
= pending_stack_adjust
;
2658 save_stack_pointer_delta
= stack_pointer_delta
;
2661 flags
&= ~ECF_SIBCALL
;
2663 flags
|= ECF_SIBCALL
;
2665 /* Other state variables that we must reinitialize each time
2666 through the loop (that are not initialized by the loop itself). */
2670 /* Start a new sequence for the normal call case.
2672 From this point on, if the sibling call fails, we want to set
2673 sibcall_failure instead of continuing the loop. */
2676 /* Don't let pending stack adjusts add up to too much.
2677 Also, do all pending adjustments now if there is any chance
2678 this might be a call to alloca or if we are expanding a sibling
2680 Also do the adjustments before a throwing call, otherwise
2681 exception handling can fail; PR 19225. */
2682 if (pending_stack_adjust
>= 32
2683 || (pending_stack_adjust
> 0
2684 && (flags
& ECF_MAY_BE_ALLOCA
))
2685 || (pending_stack_adjust
> 0
2686 && flag_exceptions
&& !(flags
& ECF_NOTHROW
))
2688 do_pending_stack_adjust ();
2690 /* Precompute any arguments as needed. */
2692 precompute_arguments (num_actuals
, args
);
2694 /* Now we are about to start emitting insns that can be deleted
2695 if a libcall is deleted. */
2696 if (pass
&& (flags
& ECF_MALLOC
))
2699 if (pass
== 0 && crtl
->stack_protect_guard
)
2700 stack_protect_epilogue ();
2702 adjusted_args_size
= args_size
;
2703 /* Compute the actual size of the argument block required. The variable
2704 and constant sizes must be combined, the size may have to be rounded,
2705 and there may be a minimum required size. When generating a sibcall
2706 pattern, do not round up, since we'll be re-using whatever space our
2708 unadjusted_args_size
2709 = compute_argument_block_size (reg_parm_stack_space
,
2710 &adjusted_args_size
,
2713 : preferred_stack_boundary
));
2715 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
2717 /* The argument block when performing a sibling call is the
2718 incoming argument block. */
2721 argblock
= crtl
->args
.internal_arg_pointer
;
2723 #ifdef STACK_GROWS_DOWNWARD
2724 = plus_constant (argblock
, crtl
->args
.pretend_args_size
);
2726 = plus_constant (argblock
, -crtl
->args
.pretend_args_size
);
2728 stored_args_map
= sbitmap_alloc (args_size
.constant
);
2729 sbitmap_zero (stored_args_map
);
2732 /* If we have no actual push instructions, or shouldn't use them,
2733 make space for all args right now. */
2734 else if (adjusted_args_size
.var
!= 0)
2736 if (old_stack_level
== 0)
2738 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
2739 old_stack_pointer_delta
= stack_pointer_delta
;
2740 old_pending_adj
= pending_stack_adjust
;
2741 pending_stack_adjust
= 0;
2742 /* stack_arg_under_construction says whether a stack arg is
2743 being constructed at the old stack level. Pushing the stack
2744 gets a clean outgoing argument block. */
2745 old_stack_arg_under_construction
= stack_arg_under_construction
;
2746 stack_arg_under_construction
= 0;
2748 argblock
= push_block (ARGS_SIZE_RTX (adjusted_args_size
), 0, 0);
2749 if (flag_stack_usage_info
)
2750 current_function_has_unbounded_dynamic_stack_size
= 1;
2754 /* Note that we must go through the motions of allocating an argument
2755 block even if the size is zero because we may be storing args
2756 in the area reserved for register arguments, which may be part of
2759 int needed
= adjusted_args_size
.constant
;
2761 /* Store the maximum argument space used. It will be pushed by
2762 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
2765 if (needed
> crtl
->outgoing_args_size
)
2766 crtl
->outgoing_args_size
= needed
;
2768 if (must_preallocate
)
2770 if (ACCUMULATE_OUTGOING_ARGS
)
2772 /* Since the stack pointer will never be pushed, it is
2773 possible for the evaluation of a parm to clobber
2774 something we have already written to the stack.
2775 Since most function calls on RISC machines do not use
2776 the stack, this is uncommon, but must work correctly.
2778 Therefore, we save any area of the stack that was already
2779 written and that we are using. Here we set up to do this
2780 by making a new stack usage map from the old one. The
2781 actual save will be done by store_one_arg.
2783 Another approach might be to try to reorder the argument
2784 evaluations to avoid this conflicting stack usage. */
2786 /* Since we will be writing into the entire argument area,
2787 the map must be allocated for its entire size, not just
2788 the part that is the responsibility of the caller. */
2789 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
2790 needed
+= reg_parm_stack_space
;
2792 #ifdef ARGS_GROW_DOWNWARD
2793 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2796 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2799 free (stack_usage_map_buf
);
2800 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
2801 stack_usage_map
= stack_usage_map_buf
;
2803 if (initial_highest_arg_in_use
)
2804 memcpy (stack_usage_map
, initial_stack_usage_map
,
2805 initial_highest_arg_in_use
);
2807 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
2808 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
2809 (highest_outgoing_arg_in_use
2810 - initial_highest_arg_in_use
));
2813 /* The address of the outgoing argument list must not be
2814 copied to a register here, because argblock would be left
2815 pointing to the wrong place after the call to
2816 allocate_dynamic_stack_space below. */
2818 argblock
= virtual_outgoing_args_rtx
;
2822 if (inhibit_defer_pop
== 0)
2824 /* Try to reuse some or all of the pending_stack_adjust
2825 to get this space. */
2827 = (combine_pending_stack_adjustment_and_call
2828 (unadjusted_args_size
,
2829 &adjusted_args_size
,
2830 preferred_unit_stack_boundary
));
2832 /* combine_pending_stack_adjustment_and_call computes
2833 an adjustment before the arguments are allocated.
2834 Account for them and see whether or not the stack
2835 needs to go up or down. */
2836 needed
= unadjusted_args_size
- needed
;
2840 /* We're releasing stack space. */
2841 /* ??? We can avoid any adjustment at all if we're
2842 already aligned. FIXME. */
2843 pending_stack_adjust
= -needed
;
2844 do_pending_stack_adjust ();
2848 /* We need to allocate space. We'll do that in
2849 push_block below. */
2850 pending_stack_adjust
= 0;
2853 /* Special case this because overhead of `push_block' in
2854 this case is non-trivial. */
2856 argblock
= virtual_outgoing_args_rtx
;
2859 argblock
= push_block (GEN_INT (needed
), 0, 0);
2860 #ifdef ARGS_GROW_DOWNWARD
2861 argblock
= plus_constant (argblock
, needed
);
2865 /* We only really need to call `copy_to_reg' in the case
2866 where push insns are going to be used to pass ARGBLOCK
2867 to a function call in ARGS. In that case, the stack
2868 pointer changes value from the allocation point to the
2869 call point, and hence the value of
2870 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
2871 as well always do it. */
2872 argblock
= copy_to_reg (argblock
);
2877 if (ACCUMULATE_OUTGOING_ARGS
)
2879 /* The save/restore code in store_one_arg handles all
2880 cases except one: a constructor call (including a C
2881 function returning a BLKmode struct) to initialize
2883 if (stack_arg_under_construction
)
2886 = GEN_INT (adjusted_args_size
.constant
2887 + (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
2888 : TREE_TYPE (fndecl
))) ? 0
2889 : reg_parm_stack_space
));
2890 if (old_stack_level
== 0)
2892 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
2893 old_stack_pointer_delta
= stack_pointer_delta
;
2894 old_pending_adj
= pending_stack_adjust
;
2895 pending_stack_adjust
= 0;
2896 /* stack_arg_under_construction says whether a stack
2897 arg is being constructed at the old stack level.
2898 Pushing the stack gets a clean outgoing argument
2900 old_stack_arg_under_construction
2901 = stack_arg_under_construction
;
2902 stack_arg_under_construction
= 0;
2903 /* Make a new map for the new argument list. */
2904 free (stack_usage_map_buf
);
2905 stack_usage_map_buf
= XCNEWVEC (char, highest_outgoing_arg_in_use
);
2906 stack_usage_map
= stack_usage_map_buf
;
2907 highest_outgoing_arg_in_use
= 0;
2909 /* We can pass TRUE as the 4th argument because we just
2910 saved the stack pointer and will restore it right after
2912 allocate_dynamic_stack_space (push_size
, 0,
2913 BIGGEST_ALIGNMENT
, true);
2916 /* If argument evaluation might modify the stack pointer,
2917 copy the address of the argument list to a register. */
2918 for (i
= 0; i
< num_actuals
; i
++)
2919 if (args
[i
].pass_on_stack
)
2921 argblock
= copy_addr_to_reg (argblock
);
2926 compute_argument_addresses (args
, argblock
, num_actuals
);
2928 /* If we push args individually in reverse order, perform stack alignment
2929 before the first push (the last arg). */
2930 if (PUSH_ARGS_REVERSED
&& argblock
== 0
2931 && adjusted_args_size
.constant
!= unadjusted_args_size
)
2933 /* When the stack adjustment is pending, we get better code
2934 by combining the adjustments. */
2935 if (pending_stack_adjust
2936 && ! inhibit_defer_pop
)
2938 pending_stack_adjust
2939 = (combine_pending_stack_adjustment_and_call
2940 (unadjusted_args_size
,
2941 &adjusted_args_size
,
2942 preferred_unit_stack_boundary
));
2943 do_pending_stack_adjust ();
2945 else if (argblock
== 0)
2946 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
2947 - unadjusted_args_size
));
2949 /* Now that the stack is properly aligned, pops can't safely
2950 be deferred during the evaluation of the arguments. */
2953 /* Record the maximum pushed stack space size. We need to delay
2954 doing it this far to take into account the optimization done
2955 by combine_pending_stack_adjustment_and_call. */
2956 if (flag_stack_usage_info
2957 && !ACCUMULATE_OUTGOING_ARGS
2959 && adjusted_args_size
.var
== 0)
2961 int pushed
= adjusted_args_size
.constant
+ pending_stack_adjust
;
2962 if (pushed
> current_function_pushed_stack_size
)
2963 current_function_pushed_stack_size
= pushed
;
2966 funexp
= rtx_for_function_call (fndecl
, addr
);
2968 /* Figure out the register where the value, if any, will come back. */
2970 if (TYPE_MODE (rettype
) != VOIDmode
2971 && ! structure_value_addr
)
2973 if (pcc_struct_value
)
2974 valreg
= hard_function_value (build_pointer_type (rettype
),
2975 fndecl
, NULL
, (pass
== 0));
2977 valreg
= hard_function_value (rettype
, fndecl
, fntype
,
2980 /* If VALREG is a PARALLEL whose first member has a zero
2981 offset, use that. This is for targets such as m68k that
2982 return the same value in multiple places. */
2983 if (GET_CODE (valreg
) == PARALLEL
)
2985 rtx elem
= XVECEXP (valreg
, 0, 0);
2986 rtx where
= XEXP (elem
, 0);
2987 rtx offset
= XEXP (elem
, 1);
2988 if (offset
== const0_rtx
2989 && GET_MODE (where
) == GET_MODE (valreg
))
2994 /* Precompute all register parameters. It isn't safe to compute anything
2995 once we have started filling any specific hard regs. */
2996 precompute_register_parameters (num_actuals
, args
, ®_parm_seen
);
2998 if (CALL_EXPR_STATIC_CHAIN (exp
))
2999 static_chain_value
= expand_normal (CALL_EXPR_STATIC_CHAIN (exp
));
3001 static_chain_value
= 0;
3003 #ifdef REG_PARM_STACK_SPACE
3004 /* Save the fixed argument area if it's part of the caller's frame and
3005 is clobbered by argument setup for this call. */
3006 if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
3007 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
3008 &low_to_save
, &high_to_save
);
3011 /* Now store (and compute if necessary) all non-register parms.
3012 These come before register parms, since they can require block-moves,
3013 which could clobber the registers used for register parms.
3014 Parms which have partial registers are not stored here,
3015 but we do preallocate space here if they want that. */
3017 for (i
= 0; i
< num_actuals
; i
++)
3019 if (args
[i
].reg
== 0 || args
[i
].pass_on_stack
)
3021 rtx before_arg
= get_last_insn ();
3023 if (store_one_arg (&args
[i
], argblock
, flags
,
3024 adjusted_args_size
.var
!= 0,
3025 reg_parm_stack_space
)
3027 && check_sibcall_argument_overlap (before_arg
,
3029 sibcall_failure
= 1;
3034 = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
3035 gen_rtx_USE (VOIDmode
, args
[i
].stack
),
3039 /* If we have a parm that is passed in registers but not in memory
3040 and whose alignment does not permit a direct copy into registers,
3041 make a group of pseudos that correspond to each register that we
3043 if (STRICT_ALIGNMENT
)
3044 store_unaligned_arguments_into_pseudos (args
, num_actuals
);
3046 /* Now store any partially-in-registers parm.
3047 This is the last place a block-move can happen. */
3049 for (i
= 0; i
< num_actuals
; i
++)
3050 if (args
[i
].partial
!= 0 && ! args
[i
].pass_on_stack
)
3052 rtx before_arg
= get_last_insn ();
3054 if (store_one_arg (&args
[i
], argblock
, flags
,
3055 adjusted_args_size
.var
!= 0,
3056 reg_parm_stack_space
)
3058 && check_sibcall_argument_overlap (before_arg
,
3060 sibcall_failure
= 1;
3063 /* If we pushed args in forward order, perform stack alignment
3064 after pushing the last arg. */
3065 if (!PUSH_ARGS_REVERSED
&& argblock
== 0)
3066 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
3067 - unadjusted_args_size
));
3069 /* If register arguments require space on the stack and stack space
3070 was not preallocated, allocate stack space here for arguments
3071 passed in registers. */
3072 if (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
3073 && !ACCUMULATE_OUTGOING_ARGS
3074 && must_preallocate
== 0 && reg_parm_stack_space
> 0)
3075 anti_adjust_stack (GEN_INT (reg_parm_stack_space
));
3077 /* Pass the function the address in which to return a
3079 if (pass
!= 0 && structure_value_addr
&& ! structure_value_addr_parm
)
3081 structure_value_addr
3082 = convert_memory_address (Pmode
, structure_value_addr
);
3083 emit_move_insn (struct_value
,
3085 force_operand (structure_value_addr
,
3088 if (REG_P (struct_value
))
3089 use_reg (&call_fusage
, struct_value
);
3092 after_args
= get_last_insn ();
3093 funexp
= prepare_call_address (fndecl
, funexp
, static_chain_value
,
3094 &call_fusage
, reg_parm_seen
, pass
== 0);
3096 load_register_parameters (args
, num_actuals
, &call_fusage
, flags
,
3097 pass
== 0, &sibcall_failure
);
3099 /* Save a pointer to the last insn before the call, so that we can
3100 later safely search backwards to find the CALL_INSN. */
3101 before_call
= get_last_insn ();
3103 /* Set up next argument register. For sibling calls on machines
3104 with register windows this should be the incoming register. */
3106 next_arg_reg
= targetm
.calls
.function_incoming_arg (args_so_far
,
3111 next_arg_reg
= targetm
.calls
.function_arg (args_so_far
,
3112 VOIDmode
, void_type_node
,
3115 /* All arguments and registers used for the call must be set up by
3118 /* Stack must be properly aligned now. */
3120 || !(stack_pointer_delta
% preferred_unit_stack_boundary
));
3122 /* Generate the actual call instruction. */
3123 emit_call_1 (funexp
, exp
, fndecl
, funtype
, unadjusted_args_size
,
3124 adjusted_args_size
.constant
, struct_value_size
,
3125 next_arg_reg
, valreg
, old_inhibit_defer_pop
, call_fusage
,
3126 flags
, args_so_far
);
3128 /* If the call setup or the call itself overlaps with anything
3129 of the argument setup we probably clobbered our call address.
3130 In that case we can't do sibcalls. */
3132 && check_sibcall_argument_overlap (after_args
, 0, 0))
3133 sibcall_failure
= 1;
3135 /* If a non-BLKmode value is returned at the most significant end
3136 of a register, shift the register right by the appropriate amount
3137 and update VALREG accordingly. BLKmode values are handled by the
3138 group load/store machinery below. */
3139 if (!structure_value_addr
3140 && !pcc_struct_value
3141 && TYPE_MODE (rettype
) != BLKmode
3142 && targetm
.calls
.return_in_msb (rettype
))
3144 if (shift_return_value (TYPE_MODE (rettype
), false, valreg
))
3145 sibcall_failure
= 1;
3146 valreg
= gen_rtx_REG (TYPE_MODE (rettype
), REGNO (valreg
));
3149 if (pass
&& (flags
& ECF_MALLOC
))
3151 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
3154 /* The return value from a malloc-like function is a pointer. */
3155 if (TREE_CODE (rettype
) == POINTER_TYPE
)
3156 mark_reg_pointer (temp
, BIGGEST_ALIGNMENT
);
3158 emit_move_insn (temp
, valreg
);
3160 /* The return value from a malloc-like function can not alias
3162 last
= get_last_insn ();
3163 add_reg_note (last
, REG_NOALIAS
, temp
);
3165 /* Write out the sequence. */
3166 insns
= get_insns ();
3172 /* For calls to `setjmp', etc., inform
3173 function.c:setjmp_warnings that it should complain if
3174 nonvolatile values are live. For functions that cannot
3175 return, inform flow that control does not fall through. */
3177 if ((flags
& ECF_NORETURN
) || pass
== 0)
3179 /* The barrier must be emitted
3180 immediately after the CALL_INSN. Some ports emit more
3181 than just a CALL_INSN above, so we must search for it here. */
3183 rtx last
= get_last_insn ();
3184 while (!CALL_P (last
))
3186 last
= PREV_INSN (last
);
3187 /* There was no CALL_INSN? */
3188 gcc_assert (last
!= before_call
);
3191 emit_barrier_after (last
);
3193 /* Stack adjustments after a noreturn call are dead code.
3194 However when NO_DEFER_POP is in effect, we must preserve
3195 stack_pointer_delta. */
3196 if (inhibit_defer_pop
== 0)
3198 stack_pointer_delta
= old_stack_allocated
;
3199 pending_stack_adjust
= 0;
3203 /* If value type not void, return an rtx for the value. */
3205 if (TYPE_MODE (rettype
) == VOIDmode
3207 target
= const0_rtx
;
3208 else if (structure_value_addr
)
3210 if (target
== 0 || !MEM_P (target
))
3213 = gen_rtx_MEM (TYPE_MODE (rettype
),
3214 memory_address (TYPE_MODE (rettype
),
3215 structure_value_addr
));
3216 set_mem_attributes (target
, rettype
, 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 (rettype
),
3225 copy_to_reg (valreg
));
3226 set_mem_attributes (target
, rettype
, 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
)
3233 target
= emit_group_move_into_temps (valreg
);
3234 else if (!rtx_equal_p (target
, valreg
))
3235 emit_group_store (target
, valreg
, rettype
,
3236 int_size_in_bytes (rettype
));
3239 && GET_MODE (target
) == TYPE_MODE (rettype
)
3240 && GET_MODE (target
) == GET_MODE (valreg
))
3242 bool may_overlap
= false;
3244 /* We have to copy a return value in a CLASS_LIKELY_SPILLED hard
3245 reg to a plain register. */
3246 if (!REG_P (target
) || HARD_REGISTER_P (target
))
3247 valreg
= avoid_likely_spilled_reg (valreg
);
3249 /* If TARGET is a MEM in the argument area, and we have
3250 saved part of the argument area, then we can't store
3251 directly into TARGET as it may get overwritten when we
3252 restore the argument save area below. Don't work too
3253 hard though and simply force TARGET to a register if it
3254 is a MEM; the optimizer is quite likely to sort it out. */
3255 if (ACCUMULATE_OUTGOING_ARGS
&& pass
&& MEM_P (target
))
3256 for (i
= 0; i
< num_actuals
; i
++)
3257 if (args
[i
].save_area
)
3264 target
= copy_to_reg (valreg
);
3267 /* TARGET and VALREG cannot be equal at this point
3268 because the latter would not have
3269 REG_FUNCTION_VALUE_P true, while the former would if
3270 it were referring to the same register.
3272 If they refer to the same register, this move will be
3273 a no-op, except when function inlining is being
3275 emit_move_insn (target
, valreg
);
3277 /* If we are setting a MEM, this code must be executed.
3278 Since it is emitted after the call insn, sibcall
3279 optimization cannot be performed in that case. */
3281 sibcall_failure
= 1;
3284 else if (TYPE_MODE (rettype
) == BLKmode
)
3287 if (GET_MODE (val
) != BLKmode
)
3288 val
= avoid_likely_spilled_reg (val
);
3289 target
= copy_blkmode_from_reg (target
, val
, rettype
);
3291 /* We can not support sibling calls for this case. */
3292 sibcall_failure
= 1;
3295 target
= copy_to_reg (avoid_likely_spilled_reg (valreg
));
3297 /* If we promoted this return value, make the proper SUBREG.
3298 TARGET might be const0_rtx here, so be careful. */
3300 && TYPE_MODE (rettype
) != BLKmode
3301 && GET_MODE (target
) != TYPE_MODE (rettype
))
3303 tree type
= rettype
;
3304 int unsignedp
= TYPE_UNSIGNED (type
);
3306 enum machine_mode pmode
;
3308 /* Ensure we promote as expected, and get the new unsignedness. */
3309 pmode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
3311 gcc_assert (GET_MODE (target
) == pmode
);
3313 if ((WORDS_BIG_ENDIAN
|| BYTES_BIG_ENDIAN
)
3314 && (GET_MODE_SIZE (GET_MODE (target
))
3315 > GET_MODE_SIZE (TYPE_MODE (type
))))
3317 offset
= GET_MODE_SIZE (GET_MODE (target
))
3318 - GET_MODE_SIZE (TYPE_MODE (type
));
3319 if (! BYTES_BIG_ENDIAN
)
3320 offset
= (offset
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
3321 else if (! WORDS_BIG_ENDIAN
)
3322 offset
%= UNITS_PER_WORD
;
3325 target
= gen_rtx_SUBREG (TYPE_MODE (type
), target
, offset
);
3326 SUBREG_PROMOTED_VAR_P (target
) = 1;
3327 SUBREG_PROMOTED_UNSIGNED_SET (target
, unsignedp
);
3330 /* If size of args is variable or this was a constructor call for a stack
3331 argument, restore saved stack-pointer value. */
3333 if (old_stack_level
)
3335 rtx prev
= get_last_insn ();
3337 emit_stack_restore (SAVE_BLOCK
, old_stack_level
);
3338 stack_pointer_delta
= old_stack_pointer_delta
;
3340 fixup_args_size_notes (prev
, get_last_insn (), stack_pointer_delta
);
3342 pending_stack_adjust
= old_pending_adj
;
3343 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
3344 stack_arg_under_construction
= old_stack_arg_under_construction
;
3345 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
3346 stack_usage_map
= initial_stack_usage_map
;
3347 sibcall_failure
= 1;
3349 else if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
3351 #ifdef REG_PARM_STACK_SPACE
3353 restore_fixed_argument_area (save_area
, argblock
,
3354 high_to_save
, low_to_save
);
3357 /* If we saved any argument areas, restore them. */
3358 for (i
= 0; i
< num_actuals
; i
++)
3359 if (args
[i
].save_area
)
3361 enum machine_mode save_mode
= GET_MODE (args
[i
].save_area
);
3363 = gen_rtx_MEM (save_mode
,
3364 memory_address (save_mode
,
3365 XEXP (args
[i
].stack_slot
, 0)));
3367 if (save_mode
!= BLKmode
)
3368 emit_move_insn (stack_area
, args
[i
].save_area
);
3370 emit_block_move (stack_area
, args
[i
].save_area
,
3371 GEN_INT (args
[i
].locate
.size
.constant
),
3372 BLOCK_OP_CALL_PARM
);
3375 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
3376 stack_usage_map
= initial_stack_usage_map
;
3379 /* If this was alloca, record the new stack level for nonlocal gotos.
3380 Check for the handler slots since we might not have a save area
3381 for non-local gotos. */
3383 if ((flags
& ECF_MAY_BE_ALLOCA
) && cfun
->nonlocal_goto_save_area
!= 0)
3384 update_nonlocal_goto_save_area ();
3386 /* Free up storage we no longer need. */
3387 for (i
= 0; i
< num_actuals
; ++i
)
3388 free (args
[i
].aligned_regs
);
3390 insns
= get_insns ();
3395 tail_call_insns
= insns
;
3397 /* Restore the pending stack adjustment now that we have
3398 finished generating the sibling call sequence. */
3400 pending_stack_adjust
= save_pending_stack_adjust
;
3401 stack_pointer_delta
= save_stack_pointer_delta
;
3403 /* Prepare arg structure for next iteration. */
3404 for (i
= 0; i
< num_actuals
; i
++)
3407 args
[i
].aligned_regs
= 0;
3411 sbitmap_free (stored_args_map
);
3412 internal_arg_pointer_exp_state
.scan_start
= NULL_RTX
;
3413 VEC_free (rtx
, heap
, internal_arg_pointer_exp_state
.cache
);
3417 normal_call_insns
= insns
;
3419 /* Verify that we've deallocated all the stack we used. */
3420 gcc_assert ((flags
& ECF_NORETURN
)
3421 || (old_stack_allocated
3422 == stack_pointer_delta
- pending_stack_adjust
));
3425 /* If something prevents making this a sibling call,
3426 zero out the sequence. */
3427 if (sibcall_failure
)
3428 tail_call_insns
= NULL_RTX
;
3433 /* If tail call production succeeded, we need to remove REG_EQUIV notes on
3434 arguments too, as argument area is now clobbered by the call. */
3435 if (tail_call_insns
)
3437 emit_insn (tail_call_insns
);
3438 crtl
->tail_call_emit
= true;
3441 emit_insn (normal_call_insns
);
3443 currently_expanding_call
--;
3445 free (stack_usage_map_buf
);
3450 /* A sibling call sequence invalidates any REG_EQUIV notes made for
3451 this function's incoming arguments.
3453 At the start of RTL generation we know the only REG_EQUIV notes
3454 in the rtl chain are those for incoming arguments, so we can look
3455 for REG_EQUIV notes between the start of the function and the
3456 NOTE_INSN_FUNCTION_BEG.
3458 This is (slight) overkill. We could keep track of the highest
3459 argument we clobber and be more selective in removing notes, but it
3460 does not seem to be worth the effort. */
3463 fixup_tail_calls (void)
3467 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3471 /* There are never REG_EQUIV notes for the incoming arguments
3472 after the NOTE_INSN_FUNCTION_BEG note, so stop if we see it. */
3474 && NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
)
3477 note
= find_reg_note (insn
, REG_EQUIV
, 0);
3479 remove_note (insn
, note
);
3480 note
= find_reg_note (insn
, REG_EQUIV
, 0);
3485 /* Traverse a list of TYPES and expand all complex types into their
3488 split_complex_types (tree types
)
3492 /* Before allocating memory, check for the common case of no complex. */
3493 for (p
= types
; p
; p
= TREE_CHAIN (p
))
3495 tree type
= TREE_VALUE (p
);
3496 if (TREE_CODE (type
) == COMPLEX_TYPE
3497 && targetm
.calls
.split_complex_arg (type
))
3503 types
= copy_list (types
);
3505 for (p
= types
; p
; p
= TREE_CHAIN (p
))
3507 tree complex_type
= TREE_VALUE (p
);
3509 if (TREE_CODE (complex_type
) == COMPLEX_TYPE
3510 && targetm
.calls
.split_complex_arg (complex_type
))
3514 /* Rewrite complex type with component type. */
3515 TREE_VALUE (p
) = TREE_TYPE (complex_type
);
3516 next
= TREE_CHAIN (p
);
3518 /* Add another component type for the imaginary part. */
3519 imag
= build_tree_list (NULL_TREE
, TREE_VALUE (p
));
3520 TREE_CHAIN (p
) = imag
;
3521 TREE_CHAIN (imag
) = next
;
3523 /* Skip the newly created node. */
3531 /* Output a library call to function FUN (a SYMBOL_REF rtx).
3532 The RETVAL parameter specifies whether return value needs to be saved, other
3533 parameters are documented in the emit_library_call function below. */
3536 emit_library_call_value_1 (int retval
, rtx orgfun
, rtx value
,
3537 enum libcall_type fn_type
,
3538 enum machine_mode outmode
, int nargs
, va_list p
)
3540 /* Total size in bytes of all the stack-parms scanned so far. */
3541 struct args_size args_size
;
3542 /* Size of arguments before any adjustments (such as rounding). */
3543 struct args_size original_args_size
;
3546 /* Todo, choose the correct decl type of orgfun. Sadly this information
3547 isn't present here, so we default to native calling abi here. */
3548 tree fndecl ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
3549 tree fntype ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
3553 CUMULATIVE_ARGS args_so_far_v
;
3554 cumulative_args_t args_so_far
;
3558 enum machine_mode mode
;
3561 struct locate_and_pad_arg_data locate
;
3565 int old_inhibit_defer_pop
= inhibit_defer_pop
;
3566 rtx call_fusage
= 0;
3569 int pcc_struct_value
= 0;
3570 int struct_value_size
= 0;
3572 int reg_parm_stack_space
= 0;
3575 tree tfom
; /* type_for_mode (outmode, 0) */
3577 #ifdef REG_PARM_STACK_SPACE
3578 /* Define the boundary of the register parm stack space that needs to be
3580 int low_to_save
= 0, high_to_save
= 0;
3581 rtx save_area
= 0; /* Place that it is saved. */
3584 /* Size of the stack reserved for parameter registers. */
3585 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
3586 char *initial_stack_usage_map
= stack_usage_map
;
3587 char *stack_usage_map_buf
= NULL
;
3589 rtx struct_value
= targetm
.calls
.struct_value_rtx (0, 0);
3591 #ifdef REG_PARM_STACK_SPACE
3592 reg_parm_stack_space
= REG_PARM_STACK_SPACE ((tree
) 0);
3595 /* By default, library functions can not throw. */
3596 flags
= ECF_NOTHROW
;
3609 flags
|= ECF_NORETURN
;
3612 flags
= ECF_NORETURN
;
3614 case LCT_RETURNS_TWICE
:
3615 flags
= ECF_RETURNS_TWICE
;
3620 /* Ensure current function's preferred stack boundary is at least
3622 if (crtl
->preferred_stack_boundary
< PREFERRED_STACK_BOUNDARY
)
3623 crtl
->preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
3625 /* If this kind of value comes back in memory,
3626 decide where in memory it should come back. */
3627 if (outmode
!= VOIDmode
)
3629 tfom
= lang_hooks
.types
.type_for_mode (outmode
, 0);
3630 if (aggregate_value_p (tfom
, 0))
3632 #ifdef PCC_STATIC_STRUCT_RETURN
3634 = hard_function_value (build_pointer_type (tfom
), 0, 0, 0);
3635 mem_value
= gen_rtx_MEM (outmode
, pointer_reg
);
3636 pcc_struct_value
= 1;
3638 value
= gen_reg_rtx (outmode
);
3639 #else /* not PCC_STATIC_STRUCT_RETURN */
3640 struct_value_size
= GET_MODE_SIZE (outmode
);
3641 if (value
!= 0 && MEM_P (value
))
3644 mem_value
= assign_temp (tfom
, 0, 1, 1);
3646 /* This call returns a big structure. */
3647 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
3651 tfom
= void_type_node
;
3653 /* ??? Unfinished: must pass the memory address as an argument. */
3655 /* Copy all the libcall-arguments out of the varargs data
3656 and into a vector ARGVEC.
3658 Compute how to pass each argument. We only support a very small subset
3659 of the full argument passing conventions to limit complexity here since
3660 library functions shouldn't have many args. */
3662 argvec
= XALLOCAVEC (struct arg
, nargs
+ 1);
3663 memset (argvec
, 0, (nargs
+ 1) * sizeof (struct arg
));
3665 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
3666 INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far_v
, outmode
, fun
);
3668 INIT_CUMULATIVE_ARGS (args_so_far_v
, NULL_TREE
, fun
, 0, nargs
);
3670 args_so_far
= pack_cumulative_args (&args_so_far_v
);
3672 args_size
.constant
= 0;
3679 /* If there's a structure value address to be passed,
3680 either pass it in the special place, or pass it as an extra argument. */
3681 if (mem_value
&& struct_value
== 0 && ! pcc_struct_value
)
3683 rtx addr
= XEXP (mem_value
, 0);
3687 /* Make sure it is a reasonable operand for a move or push insn. */
3688 if (!REG_P (addr
) && !MEM_P (addr
)
3689 && !(CONSTANT_P (addr
)
3690 && targetm
.legitimate_constant_p (Pmode
, addr
)))
3691 addr
= force_operand (addr
, NULL_RTX
);
3693 argvec
[count
].value
= addr
;
3694 argvec
[count
].mode
= Pmode
;
3695 argvec
[count
].partial
= 0;
3697 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
,
3698 Pmode
, NULL_TREE
, true);
3699 gcc_assert (targetm
.calls
.arg_partial_bytes (args_so_far
, Pmode
,
3700 NULL_TREE
, 1) == 0);
3702 locate_and_pad_parm (Pmode
, NULL_TREE
,
3703 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3706 argvec
[count
].reg
!= 0,
3708 0, NULL_TREE
, &args_size
, &argvec
[count
].locate
);
3710 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
3711 || reg_parm_stack_space
> 0)
3712 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
3714 targetm
.calls
.function_arg_advance (args_so_far
, Pmode
, (tree
) 0, true);
3719 for (; count
< nargs
; count
++)
3721 rtx val
= va_arg (p
, rtx
);
3722 enum machine_mode mode
= (enum machine_mode
) va_arg (p
, int);
3725 /* We cannot convert the arg value to the mode the library wants here;
3726 must do it earlier where we know the signedness of the arg. */
3727 gcc_assert (mode
!= BLKmode
3728 && (GET_MODE (val
) == mode
|| GET_MODE (val
) == VOIDmode
));
3730 /* Make sure it is a reasonable operand for a move or push insn. */
3731 if (!REG_P (val
) && !MEM_P (val
)
3732 && !(CONSTANT_P (val
) && targetm
.legitimate_constant_p (mode
, val
)))
3733 val
= force_operand (val
, NULL_RTX
);
3735 if (pass_by_reference (&args_so_far_v
, mode
, NULL_TREE
, 1))
3739 = !reference_callee_copied (&args_so_far_v
, mode
, NULL_TREE
, 1);
3741 /* If this was a CONST function, it is now PURE since it now
3743 if (flags
& ECF_CONST
)
3745 flags
&= ~ECF_CONST
;
3749 if (MEM_P (val
) && !must_copy
)
3751 tree val_expr
= MEM_EXPR (val
);
3753 mark_addressable (val_expr
);
3758 slot
= assign_temp (lang_hooks
.types
.type_for_mode (mode
, 0),
3760 emit_move_insn (slot
, val
);
3763 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3764 gen_rtx_USE (VOIDmode
, slot
),
3767 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3768 gen_rtx_CLOBBER (VOIDmode
,
3773 val
= force_operand (XEXP (slot
, 0), NULL_RTX
);
3776 mode
= promote_function_mode (NULL_TREE
, mode
, &unsigned_p
, NULL_TREE
, 0);
3777 argvec
[count
].mode
= mode
;
3778 argvec
[count
].value
= convert_modes (mode
, GET_MODE (val
), val
, unsigned_p
);
3779 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
3782 argvec
[count
].partial
3783 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, NULL_TREE
, 1);
3785 if (argvec
[count
].reg
== 0
3786 || argvec
[count
].partial
!= 0
3787 || reg_parm_stack_space
> 0)
3789 locate_and_pad_parm (mode
, NULL_TREE
,
3790 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3793 argvec
[count
].reg
!= 0,
3795 argvec
[count
].partial
,
3796 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
3797 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
3798 gcc_assert (!argvec
[count
].locate
.size
.var
);
3800 #ifdef BLOCK_REG_PADDING
3802 /* The argument is passed entirely in registers. See at which
3803 end it should be padded. */
3804 argvec
[count
].locate
.where_pad
=
3805 BLOCK_REG_PADDING (mode
, NULL_TREE
,
3806 GET_MODE_SIZE (mode
) <= UNITS_PER_WORD
);
3809 targetm
.calls
.function_arg_advance (args_so_far
, mode
, (tree
) 0, true);
3812 /* If this machine requires an external definition for library
3813 functions, write one out. */
3814 assemble_external_libcall (fun
);
3816 original_args_size
= args_size
;
3817 args_size
.constant
= (((args_size
.constant
3818 + stack_pointer_delta
3822 - stack_pointer_delta
);
3824 args_size
.constant
= MAX (args_size
.constant
,
3825 reg_parm_stack_space
);
3827 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
3828 args_size
.constant
-= reg_parm_stack_space
;
3830 if (args_size
.constant
> crtl
->outgoing_args_size
)
3831 crtl
->outgoing_args_size
= args_size
.constant
;
3833 if (flag_stack_usage_info
&& !ACCUMULATE_OUTGOING_ARGS
)
3835 int pushed
= args_size
.constant
+ pending_stack_adjust
;
3836 if (pushed
> current_function_pushed_stack_size
)
3837 current_function_pushed_stack_size
= pushed
;
3840 if (ACCUMULATE_OUTGOING_ARGS
)
3842 /* Since the stack pointer will never be pushed, it is possible for
3843 the evaluation of a parm to clobber something we have already
3844 written to the stack. Since most function calls on RISC machines
3845 do not use the stack, this is uncommon, but must work correctly.
3847 Therefore, we save any area of the stack that was already written
3848 and that we are using. Here we set up to do this by making a new
3849 stack usage map from the old one.
3851 Another approach might be to try to reorder the argument
3852 evaluations to avoid this conflicting stack usage. */
3854 needed
= args_size
.constant
;
3856 /* Since we will be writing into the entire argument area, the
3857 map must be allocated for its entire size, not just the part that
3858 is the responsibility of the caller. */
3859 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
3860 needed
+= reg_parm_stack_space
;
3862 #ifdef ARGS_GROW_DOWNWARD
3863 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
3866 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
3869 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
3870 stack_usage_map
= stack_usage_map_buf
;
3872 if (initial_highest_arg_in_use
)
3873 memcpy (stack_usage_map
, initial_stack_usage_map
,
3874 initial_highest_arg_in_use
);
3876 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
3877 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
3878 highest_outgoing_arg_in_use
- initial_highest_arg_in_use
);
3881 /* We must be careful to use virtual regs before they're instantiated,
3882 and real regs afterwards. Loop optimization, for example, can create
3883 new libcalls after we've instantiated the virtual regs, and if we
3884 use virtuals anyway, they won't match the rtl patterns. */
3886 if (virtuals_instantiated
)
3887 argblock
= plus_constant (stack_pointer_rtx
, STACK_POINTER_OFFSET
);
3889 argblock
= virtual_outgoing_args_rtx
;
3894 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
3897 /* If we push args individually in reverse order, perform stack alignment
3898 before the first push (the last arg). */
3899 if (argblock
== 0 && PUSH_ARGS_REVERSED
)
3900 anti_adjust_stack (GEN_INT (args_size
.constant
3901 - original_args_size
.constant
));
3903 if (PUSH_ARGS_REVERSED
)
3914 #ifdef REG_PARM_STACK_SPACE
3915 if (ACCUMULATE_OUTGOING_ARGS
)
3917 /* The argument list is the property of the called routine and it
3918 may clobber it. If the fixed area has been used for previous
3919 parameters, we must save and restore it. */
3920 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
3921 &low_to_save
, &high_to_save
);
3925 /* Push the args that need to be pushed. */
3927 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3928 are to be pushed. */
3929 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
3931 enum machine_mode mode
= argvec
[argnum
].mode
;
3932 rtx val
= argvec
[argnum
].value
;
3933 rtx reg
= argvec
[argnum
].reg
;
3934 int partial
= argvec
[argnum
].partial
;
3935 unsigned int parm_align
= argvec
[argnum
].locate
.boundary
;
3936 int lower_bound
= 0, upper_bound
= 0, i
;
3938 if (! (reg
!= 0 && partial
== 0))
3942 if (ACCUMULATE_OUTGOING_ARGS
)
3944 /* If this is being stored into a pre-allocated, fixed-size,
3945 stack area, save any previous data at that location. */
3947 #ifdef ARGS_GROW_DOWNWARD
3948 /* stack_slot is negative, but we want to index stack_usage_map
3949 with positive values. */
3950 upper_bound
= -argvec
[argnum
].locate
.slot_offset
.constant
+ 1;
3951 lower_bound
= upper_bound
- argvec
[argnum
].locate
.size
.constant
;
3953 lower_bound
= argvec
[argnum
].locate
.slot_offset
.constant
;
3954 upper_bound
= lower_bound
+ argvec
[argnum
].locate
.size
.constant
;
3958 /* Don't worry about things in the fixed argument area;
3959 it has already been saved. */
3960 if (i
< reg_parm_stack_space
)
3961 i
= reg_parm_stack_space
;
3962 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
3965 if (i
< upper_bound
)
3967 /* We need to make a save area. */
3969 = argvec
[argnum
].locate
.size
.constant
* BITS_PER_UNIT
;
3970 enum machine_mode save_mode
3971 = mode_for_size (size
, MODE_INT
, 1);
3973 = plus_constant (argblock
,
3974 argvec
[argnum
].locate
.offset
.constant
);
3976 = gen_rtx_MEM (save_mode
, memory_address (save_mode
, adr
));
3978 if (save_mode
== BLKmode
)
3980 argvec
[argnum
].save_area
3981 = assign_stack_temp (BLKmode
,
3982 argvec
[argnum
].locate
.size
.constant
,
3985 emit_block_move (validize_mem (argvec
[argnum
].save_area
),
3987 GEN_INT (argvec
[argnum
].locate
.size
.constant
),
3988 BLOCK_OP_CALL_PARM
);
3992 argvec
[argnum
].save_area
= gen_reg_rtx (save_mode
);
3994 emit_move_insn (argvec
[argnum
].save_area
, stack_area
);
3999 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, parm_align
,
4000 partial
, reg
, 0, argblock
,
4001 GEN_INT (argvec
[argnum
].locate
.offset
.constant
),
4002 reg_parm_stack_space
,
4003 ARGS_SIZE_RTX (argvec
[argnum
].locate
.alignment_pad
));
4005 /* Now mark the segment we just used. */
4006 if (ACCUMULATE_OUTGOING_ARGS
)
4007 for (i
= lower_bound
; i
< upper_bound
; i
++)
4008 stack_usage_map
[i
] = 1;
4012 /* Indicate argument access so that alias.c knows that these
4015 use
= plus_constant (argblock
,
4016 argvec
[argnum
].locate
.offset
.constant
);
4018 /* When arguments are pushed, trying to tell alias.c where
4019 exactly this argument is won't work, because the
4020 auto-increment causes confusion. So we merely indicate
4021 that we access something with a known mode somewhere on
4023 use
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
4024 gen_rtx_SCRATCH (Pmode
));
4025 use
= gen_rtx_MEM (argvec
[argnum
].mode
, use
);
4026 use
= gen_rtx_USE (VOIDmode
, use
);
4027 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
, use
, call_fusage
);
4031 /* If we pushed args in forward order, perform stack alignment
4032 after pushing the last arg. */
4033 if (argblock
== 0 && !PUSH_ARGS_REVERSED
)
4034 anti_adjust_stack (GEN_INT (args_size
.constant
4035 - original_args_size
.constant
));
4037 if (PUSH_ARGS_REVERSED
)
4042 fun
= prepare_call_address (NULL
, fun
, NULL
, &call_fusage
, 0, 0);
4044 /* Now load any reg parms into their regs. */
4046 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4047 are to be pushed. */
4048 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
4050 enum machine_mode mode
= argvec
[argnum
].mode
;
4051 rtx val
= argvec
[argnum
].value
;
4052 rtx reg
= argvec
[argnum
].reg
;
4053 int partial
= argvec
[argnum
].partial
;
4054 #ifdef BLOCK_REG_PADDING
4058 /* Handle calls that pass values in multiple non-contiguous
4059 locations. The PA64 has examples of this for library calls. */
4060 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4061 emit_group_load (reg
, val
, NULL_TREE
, GET_MODE_SIZE (mode
));
4062 else if (reg
!= 0 && partial
== 0)
4064 emit_move_insn (reg
, val
);
4065 #ifdef BLOCK_REG_PADDING
4066 size
= GET_MODE_SIZE (argvec
[argnum
].mode
);
4068 /* Copied from load_register_parameters. */
4070 /* Handle case where we have a value that needs shifting
4071 up to the msb. eg. a QImode value and we're padding
4072 upward on a BYTES_BIG_ENDIAN machine. */
4073 if (size
< UNITS_PER_WORD
4074 && (argvec
[argnum
].locate
.where_pad
4075 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
4078 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
4080 /* Assigning REG here rather than a temp makes CALL_FUSAGE
4081 report the whole reg as used. Strictly speaking, the
4082 call only uses SIZE bytes at the msb end, but it doesn't
4083 seem worth generating rtl to say that. */
4084 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
4085 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, shift
, reg
, 1);
4087 emit_move_insn (reg
, x
);
4095 /* Any regs containing parms remain in use through the call. */
4096 for (count
= 0; count
< nargs
; count
++)
4098 rtx reg
= argvec
[count
].reg
;
4099 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4100 use_group_regs (&call_fusage
, reg
);
4103 int partial
= argvec
[count
].partial
;
4107 gcc_assert (partial
% UNITS_PER_WORD
== 0);
4108 nregs
= partial
/ UNITS_PER_WORD
;
4109 use_regs (&call_fusage
, REGNO (reg
), nregs
);
4112 use_reg (&call_fusage
, reg
);
4116 /* Pass the function the address in which to return a structure value. */
4117 if (mem_value
!= 0 && struct_value
!= 0 && ! pcc_struct_value
)
4119 emit_move_insn (struct_value
,
4121 force_operand (XEXP (mem_value
, 0),
4123 if (REG_P (struct_value
))
4124 use_reg (&call_fusage
, struct_value
);
4127 /* Don't allow popping to be deferred, since then
4128 cse'ing of library calls could delete a call and leave the pop. */
4130 valreg
= (mem_value
== 0 && outmode
!= VOIDmode
4131 ? hard_libcall_value (outmode
, orgfun
) : NULL_RTX
);
4133 /* Stack must be properly aligned now. */
4134 gcc_assert (!(stack_pointer_delta
4135 & (PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
- 1)));
4137 before_call
= get_last_insn ();
4139 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4140 will set inhibit_defer_pop to that value. */
4141 /* The return type is needed to decide how many bytes the function pops.
4142 Signedness plays no role in that, so for simplicity, we pretend it's
4143 always signed. We also assume that the list of arguments passed has
4144 no impact, so we pretend it is unknown. */
4146 emit_call_1 (fun
, NULL
,
4147 get_identifier (XSTR (orgfun
, 0)),
4148 build_function_type (tfom
, NULL_TREE
),
4149 original_args_size
.constant
, args_size
.constant
,
4151 targetm
.calls
.function_arg (args_so_far
,
4152 VOIDmode
, void_type_node
, true),
4154 old_inhibit_defer_pop
+ 1, call_fusage
, flags
, args_so_far
);
4156 /* Right-shift returned value if necessary. */
4157 if (!pcc_struct_value
4158 && TYPE_MODE (tfom
) != BLKmode
4159 && targetm
.calls
.return_in_msb (tfom
))
4161 shift_return_value (TYPE_MODE (tfom
), false, valreg
);
4162 valreg
= gen_rtx_REG (TYPE_MODE (tfom
), REGNO (valreg
));
4165 /* For calls to `setjmp', etc., inform function.c:setjmp_warnings
4166 that it should complain if nonvolatile values are live. For
4167 functions that cannot return, inform flow that control does not
4170 if (flags
& ECF_NORETURN
)
4172 /* The barrier note must be emitted
4173 immediately after the CALL_INSN. Some ports emit more than
4174 just a CALL_INSN above, so we must search for it here. */
4176 rtx last
= get_last_insn ();
4177 while (!CALL_P (last
))
4179 last
= PREV_INSN (last
);
4180 /* There was no CALL_INSN? */
4181 gcc_assert (last
!= before_call
);
4184 emit_barrier_after (last
);
4187 /* Now restore inhibit_defer_pop to its actual original value. */
4192 /* Copy the value to the right place. */
4193 if (outmode
!= VOIDmode
&& retval
)
4199 if (value
!= mem_value
)
4200 emit_move_insn (value
, mem_value
);
4202 else if (GET_CODE (valreg
) == PARALLEL
)
4205 value
= gen_reg_rtx (outmode
);
4206 emit_group_store (value
, valreg
, NULL_TREE
, GET_MODE_SIZE (outmode
));
4210 /* Convert to the proper mode if a promotion has been active. */
4211 if (GET_MODE (valreg
) != outmode
)
4213 int unsignedp
= TYPE_UNSIGNED (tfom
);
4215 gcc_assert (promote_function_mode (tfom
, outmode
, &unsignedp
,
4216 fndecl
? TREE_TYPE (fndecl
) : fntype
, 1)
4217 == GET_MODE (valreg
));
4218 valreg
= convert_modes (outmode
, GET_MODE (valreg
), valreg
, 0);
4222 emit_move_insn (value
, valreg
);
4228 if (ACCUMULATE_OUTGOING_ARGS
)
4230 #ifdef REG_PARM_STACK_SPACE
4232 restore_fixed_argument_area (save_area
, argblock
,
4233 high_to_save
, low_to_save
);
4236 /* If we saved any argument areas, restore them. */
4237 for (count
= 0; count
< nargs
; count
++)
4238 if (argvec
[count
].save_area
)
4240 enum machine_mode save_mode
= GET_MODE (argvec
[count
].save_area
);
4241 rtx adr
= plus_constant (argblock
,
4242 argvec
[count
].locate
.offset
.constant
);
4243 rtx stack_area
= gen_rtx_MEM (save_mode
,
4244 memory_address (save_mode
, adr
));
4246 if (save_mode
== BLKmode
)
4247 emit_block_move (stack_area
,
4248 validize_mem (argvec
[count
].save_area
),
4249 GEN_INT (argvec
[count
].locate
.size
.constant
),
4250 BLOCK_OP_CALL_PARM
);
4252 emit_move_insn (stack_area
, argvec
[count
].save_area
);
4255 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
4256 stack_usage_map
= initial_stack_usage_map
;
4259 free (stack_usage_map_buf
);
4265 /* Output a library call to function FUN (a SYMBOL_REF rtx)
4266 (emitting the queue unless NO_QUEUE is nonzero),
4267 for a value of mode OUTMODE,
4268 with NARGS different arguments, passed as alternating rtx values
4269 and machine_modes to convert them to.
4271 FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for
4272 `const' calls, LCT_PURE for `pure' calls, or other LCT_ value for
4273 other types of library calls. */
4276 emit_library_call (rtx orgfun
, enum libcall_type fn_type
,
4277 enum machine_mode outmode
, int nargs
, ...)
4281 va_start (p
, nargs
);
4282 emit_library_call_value_1 (0, orgfun
, NULL_RTX
, fn_type
, outmode
, nargs
, p
);
4286 /* Like emit_library_call except that an extra argument, VALUE,
4287 comes second and says where to store the result.
4288 (If VALUE is zero, this function chooses a convenient way
4289 to return the value.
4291 This function returns an rtx for where the value is to be found.
4292 If VALUE is nonzero, VALUE is returned. */
4295 emit_library_call_value (rtx orgfun
, rtx value
,
4296 enum libcall_type fn_type
,
4297 enum machine_mode outmode
, int nargs
, ...)
4302 va_start (p
, nargs
);
4303 result
= emit_library_call_value_1 (1, orgfun
, value
, fn_type
, outmode
,
4310 /* Store a single argument for a function call
4311 into the register or memory area where it must be passed.
4312 *ARG describes the argument value and where to pass it.
4314 ARGBLOCK is the address of the stack-block for all the arguments,
4315 or 0 on a machine where arguments are pushed individually.
4317 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
4318 so must be careful about how the stack is used.
4320 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
4321 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
4322 that we need not worry about saving and restoring the stack.
4324 FNDECL is the declaration of the function we are calling.
4326 Return nonzero if this arg should cause sibcall failure,
4330 store_one_arg (struct arg_data
*arg
, rtx argblock
, int flags
,
4331 int variable_size ATTRIBUTE_UNUSED
, int reg_parm_stack_space
)
4333 tree pval
= arg
->tree_value
;
4337 int i
, lower_bound
= 0, upper_bound
= 0;
4338 int sibcall_failure
= 0;
4340 if (TREE_CODE (pval
) == ERROR_MARK
)
4343 /* Push a new temporary level for any temporaries we make for
4347 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
))
4349 /* If this is being stored into a pre-allocated, fixed-size, stack area,
4350 save any previous data at that location. */
4351 if (argblock
&& ! variable_size
&& arg
->stack
)
4353 #ifdef ARGS_GROW_DOWNWARD
4354 /* stack_slot is negative, but we want to index stack_usage_map
4355 with positive values. */
4356 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
4357 upper_bound
= -INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1)) + 1;
4361 lower_bound
= upper_bound
- arg
->locate
.size
.constant
;
4363 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
4364 lower_bound
= INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1));
4368 upper_bound
= lower_bound
+ arg
->locate
.size
.constant
;
4372 /* Don't worry about things in the fixed argument area;
4373 it has already been saved. */
4374 if (i
< reg_parm_stack_space
)
4375 i
= reg_parm_stack_space
;
4376 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
4379 if (i
< upper_bound
)
4381 /* We need to make a save area. */
4382 unsigned int size
= arg
->locate
.size
.constant
* BITS_PER_UNIT
;
4383 enum machine_mode save_mode
= mode_for_size (size
, MODE_INT
, 1);
4384 rtx adr
= memory_address (save_mode
, XEXP (arg
->stack_slot
, 0));
4385 rtx stack_area
= gen_rtx_MEM (save_mode
, adr
);
4387 if (save_mode
== BLKmode
)
4389 tree ot
= TREE_TYPE (arg
->tree_value
);
4390 tree nt
= build_qualified_type (ot
, (TYPE_QUALS (ot
)
4391 | TYPE_QUAL_CONST
));
4393 arg
->save_area
= assign_temp (nt
, 0, 1, 1);
4394 preserve_temp_slots (arg
->save_area
);
4395 emit_block_move (validize_mem (arg
->save_area
), stack_area
,
4396 GEN_INT (arg
->locate
.size
.constant
),
4397 BLOCK_OP_CALL_PARM
);
4401 arg
->save_area
= gen_reg_rtx (save_mode
);
4402 emit_move_insn (arg
->save_area
, stack_area
);
4408 /* If this isn't going to be placed on both the stack and in registers,
4409 set up the register and number of words. */
4410 if (! arg
->pass_on_stack
)
4412 if (flags
& ECF_SIBCALL
)
4413 reg
= arg
->tail_call_reg
;
4416 partial
= arg
->partial
;
4419 /* Being passed entirely in a register. We shouldn't be called in
4421 gcc_assert (reg
== 0 || partial
!= 0);
4423 /* If this arg needs special alignment, don't load the registers
4425 if (arg
->n_aligned_regs
!= 0)
4428 /* If this is being passed partially in a register, we can't evaluate
4429 it directly into its stack slot. Otherwise, we can. */
4430 if (arg
->value
== 0)
4432 /* stack_arg_under_construction is nonzero if a function argument is
4433 being evaluated directly into the outgoing argument list and
4434 expand_call must take special action to preserve the argument list
4435 if it is called recursively.
4437 For scalar function arguments stack_usage_map is sufficient to
4438 determine which stack slots must be saved and restored. Scalar
4439 arguments in general have pass_on_stack == 0.
4441 If this argument is initialized by a function which takes the
4442 address of the argument (a C++ constructor or a C function
4443 returning a BLKmode structure), then stack_usage_map is
4444 insufficient and expand_call must push the stack around the
4445 function call. Such arguments have pass_on_stack == 1.
4447 Note that it is always safe to set stack_arg_under_construction,
4448 but this generates suboptimal code if set when not needed. */
4450 if (arg
->pass_on_stack
)
4451 stack_arg_under_construction
++;
4453 arg
->value
= expand_expr (pval
,
4455 || TYPE_MODE (TREE_TYPE (pval
)) != arg
->mode
)
4456 ? NULL_RTX
: arg
->stack
,
4457 VOIDmode
, EXPAND_STACK_PARM
);
4459 /* If we are promoting object (or for any other reason) the mode
4460 doesn't agree, convert the mode. */
4462 if (arg
->mode
!= TYPE_MODE (TREE_TYPE (pval
)))
4463 arg
->value
= convert_modes (arg
->mode
, TYPE_MODE (TREE_TYPE (pval
)),
4464 arg
->value
, arg
->unsignedp
);
4466 if (arg
->pass_on_stack
)
4467 stack_arg_under_construction
--;
4470 /* Check for overlap with already clobbered argument area. */
4471 if ((flags
& ECF_SIBCALL
)
4472 && MEM_P (arg
->value
)
4473 && mem_overlaps_already_clobbered_arg_p (XEXP (arg
->value
, 0),
4474 arg
->locate
.size
.constant
))
4475 sibcall_failure
= 1;
4477 /* Don't allow anything left on stack from computation
4478 of argument to alloca. */
4479 if (flags
& ECF_MAY_BE_ALLOCA
)
4480 do_pending_stack_adjust ();
4482 if (arg
->value
== arg
->stack
)
4483 /* If the value is already in the stack slot, we are done. */
4485 else if (arg
->mode
!= BLKmode
)
4488 unsigned int parm_align
;
4490 /* Argument is a scalar, not entirely passed in registers.
4491 (If part is passed in registers, arg->partial says how much
4492 and emit_push_insn will take care of putting it there.)
4494 Push it, and if its size is less than the
4495 amount of space allocated to it,
4496 also bump stack pointer by the additional space.
4497 Note that in C the default argument promotions
4498 will prevent such mismatches. */
4500 size
= GET_MODE_SIZE (arg
->mode
);
4501 /* Compute how much space the push instruction will push.
4502 On many machines, pushing a byte will advance the stack
4503 pointer by a halfword. */
4504 #ifdef PUSH_ROUNDING
4505 size
= PUSH_ROUNDING (size
);
4509 /* Compute how much space the argument should get:
4510 round up to a multiple of the alignment for arguments. */
4511 if (none
!= FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)))
4512 used
= (((size
+ PARM_BOUNDARY
/ BITS_PER_UNIT
- 1)
4513 / (PARM_BOUNDARY
/ BITS_PER_UNIT
))
4514 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
4516 /* Compute the alignment of the pushed argument. */
4517 parm_align
= arg
->locate
.boundary
;
4518 if (FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)) == downward
)
4520 int pad
= used
- size
;
4523 unsigned int pad_align
= (pad
& -pad
) * BITS_PER_UNIT
;
4524 parm_align
= MIN (parm_align
, pad_align
);
4528 /* This isn't already where we want it on the stack, so put it there.
4529 This can either be done with push or copy insns. */
4530 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), NULL_RTX
,
4531 parm_align
, partial
, reg
, used
- size
, argblock
,
4532 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
4533 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
));
4535 /* Unless this is a partially-in-register argument, the argument is now
4538 arg
->value
= arg
->stack
;
4542 /* BLKmode, at least partly to be pushed. */
4544 unsigned int parm_align
;
4548 /* Pushing a nonscalar.
4549 If part is passed in registers, PARTIAL says how much
4550 and emit_push_insn will take care of putting it there. */
4552 /* Round its size up to a multiple
4553 of the allocation unit for arguments. */
4555 if (arg
->locate
.size
.var
!= 0)
4558 size_rtx
= ARGS_SIZE_RTX (arg
->locate
.size
);
4562 /* PUSH_ROUNDING has no effect on us, because emit_push_insn
4563 for BLKmode is careful to avoid it. */
4564 excess
= (arg
->locate
.size
.constant
4565 - int_size_in_bytes (TREE_TYPE (pval
))
4567 size_rtx
= expand_expr (size_in_bytes (TREE_TYPE (pval
)),
4568 NULL_RTX
, TYPE_MODE (sizetype
),
4572 parm_align
= arg
->locate
.boundary
;
4574 /* When an argument is padded down, the block is aligned to
4575 PARM_BOUNDARY, but the actual argument isn't. */
4576 if (FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)) == downward
)
4578 if (arg
->locate
.size
.var
)
4579 parm_align
= BITS_PER_UNIT
;
4582 unsigned int excess_align
= (excess
& -excess
) * BITS_PER_UNIT
;
4583 parm_align
= MIN (parm_align
, excess_align
);
4587 if ((flags
& ECF_SIBCALL
) && MEM_P (arg
->value
))
4589 /* emit_push_insn might not work properly if arg->value and
4590 argblock + arg->locate.offset areas overlap. */
4594 if (XEXP (x
, 0) == crtl
->args
.internal_arg_pointer
4595 || (GET_CODE (XEXP (x
, 0)) == PLUS
4596 && XEXP (XEXP (x
, 0), 0) ==
4597 crtl
->args
.internal_arg_pointer
4598 && CONST_INT_P (XEXP (XEXP (x
, 0), 1))))
4600 if (XEXP (x
, 0) != crtl
->args
.internal_arg_pointer
)
4601 i
= INTVAL (XEXP (XEXP (x
, 0), 1));
4603 /* expand_call should ensure this. */
4604 gcc_assert (!arg
->locate
.offset
.var
4605 && arg
->locate
.size
.var
== 0
4606 && CONST_INT_P (size_rtx
));
4608 if (arg
->locate
.offset
.constant
> i
)
4610 if (arg
->locate
.offset
.constant
< i
+ INTVAL (size_rtx
))
4611 sibcall_failure
= 1;
4613 else if (arg
->locate
.offset
.constant
< i
)
4615 /* Use arg->locate.size.constant instead of size_rtx
4616 because we only care about the part of the argument
4618 if (i
< (arg
->locate
.offset
.constant
4619 + arg
->locate
.size
.constant
))
4620 sibcall_failure
= 1;
4624 /* Even though they appear to be at the same location,
4625 if part of the outgoing argument is in registers,
4626 they aren't really at the same location. Check for
4627 this by making sure that the incoming size is the
4628 same as the outgoing size. */
4629 if (arg
->locate
.size
.constant
!= INTVAL (size_rtx
))
4630 sibcall_failure
= 1;
4635 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx
,
4636 parm_align
, partial
, reg
, excess
, argblock
,
4637 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
4638 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
));
4640 /* Unless this is a partially-in-register argument, the argument is now
4643 ??? Unlike the case above, in which we want the actual
4644 address of the data, so that we can load it directly into a
4645 register, here we want the address of the stack slot, so that
4646 it's properly aligned for word-by-word copying or something
4647 like that. It's not clear that this is always correct. */
4649 arg
->value
= arg
->stack_slot
;
4652 if (arg
->reg
&& GET_CODE (arg
->reg
) == PARALLEL
)
4654 tree type
= TREE_TYPE (arg
->tree_value
);
4656 = emit_group_load_into_temps (arg
->reg
, arg
->value
, type
,
4657 int_size_in_bytes (type
));
4660 /* Mark all slots this store used. */
4661 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
)
4662 && argblock
&& ! variable_size
&& arg
->stack
)
4663 for (i
= lower_bound
; i
< upper_bound
; i
++)
4664 stack_usage_map
[i
] = 1;
4666 /* Once we have pushed something, pops can't safely
4667 be deferred during the rest of the arguments. */
4670 /* Free any temporary slots made in processing this argument. Show
4671 that we might have taken the address of something and pushed that
4673 preserve_temp_slots (NULL_RTX
);
4677 return sibcall_failure
;
4680 /* Nonzero if we do not know how to pass TYPE solely in registers. */
4683 must_pass_in_stack_var_size (enum machine_mode mode ATTRIBUTE_UNUSED
,
4689 /* If the type has variable size... */
4690 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4693 /* If the type is marked as addressable (it is required
4694 to be constructed into the stack)... */
4695 if (TREE_ADDRESSABLE (type
))
4701 /* Another version of the TARGET_MUST_PASS_IN_STACK hook. This one
4702 takes trailing padding of a structure into account. */
4703 /* ??? Should be able to merge these two by examining BLOCK_REG_PADDING. */
4706 must_pass_in_stack_var_size_or_pad (enum machine_mode mode
, const_tree type
)
4711 /* If the type has variable size... */
4712 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4715 /* If the type is marked as addressable (it is required
4716 to be constructed into the stack)... */
4717 if (TREE_ADDRESSABLE (type
))
4720 /* If the padding and mode of the type is such that a copy into
4721 a register would put it into the wrong part of the register. */
4723 && int_size_in_bytes (type
) % (PARM_BOUNDARY
/ BITS_PER_UNIT
)
4724 && (FUNCTION_ARG_PADDING (mode
, type
)
4725 == (BYTES_BIG_ENDIAN
? upward
: downward
)))