1 /* Convert function calls to rtl insns, for GNU C compiler.
2 Copyright (C) 1989-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
22 #include "coretypes.h"
26 #include "stor-layout.h"
28 #include "stringpool.h"
30 #include "basic-block.h"
31 #include "tree-ssa-alias.h"
32 #include "internal-fn.h"
33 #include "gimple-expr.h"
42 #include "diagnostic-core.h"
47 #include "langhooks.h"
53 /* Like PREFERRED_STACK_BOUNDARY but in units of bytes, not bits. */
54 #define STACK_BYTES (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)
56 /* Data structure and subroutines used within expand_call. */
60 /* Tree node for this argument. */
62 /* Mode for value; TYPE_MODE unless promoted. */
63 enum machine_mode mode
;
64 /* Current RTL value for argument, or 0 if it isn't precomputed. */
66 /* Initially-compute RTL value for argument; only for const functions. */
68 /* Register to pass this argument in, 0 if passed on stack, or an
69 PARALLEL if the arg is to be copied into multiple non-contiguous
72 /* Register to pass this argument in when generating tail call sequence.
73 This is not the same register as for normal calls on machines with
76 /* If REG is a PARALLEL, this is a copy of VALUE pulled into the correct
77 form for emit_group_move. */
79 /* If REG was promoted from the actual mode of the argument expression,
80 indicates whether the promotion is sign- or zero-extended. */
82 /* Number of bytes to put in registers. 0 means put the whole arg
83 in registers. Also 0 if not passed in registers. */
85 /* Nonzero if argument must be passed on stack.
86 Note that some arguments may be passed on the stack
87 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
88 pass_on_stack identifies arguments that *cannot* go in registers. */
90 /* Some fields packaged up for locate_and_pad_parm. */
91 struct locate_and_pad_arg_data locate
;
92 /* Location on the stack at which parameter should be stored. The store
93 has already been done if STACK == VALUE. */
95 /* Location on the stack of the start of this argument slot. This can
96 differ from STACK if this arg pads downward. This location is known
97 to be aligned to TARGET_FUNCTION_ARG_BOUNDARY. */
99 /* Place that this stack area has been saved, if needed. */
101 /* If an argument's alignment does not permit direct copying into registers,
102 copy in smaller-sized pieces into pseudos. These are stored in a
103 block pointed to by this field. The next field says how many
104 word-sized pseudos we made. */
109 /* A vector of one char per byte of stack space. A byte if nonzero if
110 the corresponding stack location has been used.
111 This vector is used to prevent a function call within an argument from
112 clobbering any stack already set up. */
113 static char *stack_usage_map
;
115 /* Size of STACK_USAGE_MAP. */
116 static int highest_outgoing_arg_in_use
;
118 /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
119 stack location's tail call argument has been already stored into the stack.
120 This bitmap is used to prevent sibling call optimization if function tries
121 to use parent's incoming argument slots when they have been already
122 overwritten with tail call arguments. */
123 static sbitmap stored_args_map
;
125 /* stack_arg_under_construction is nonzero when an argument may be
126 initialized with a constructor call (including a C function that
127 returns a BLKmode struct) and expand_call must take special action
128 to make sure the object being constructed does not overlap the
129 argument list for the constructor call. */
130 static int stack_arg_under_construction
;
132 static void emit_call_1 (rtx
, tree
, tree
, tree
, HOST_WIDE_INT
, HOST_WIDE_INT
,
133 HOST_WIDE_INT
, rtx
, rtx
, int, rtx
, int,
135 static void precompute_register_parameters (int, struct arg_data
*, int *);
136 static int store_one_arg (struct arg_data
*, rtx
, int, int, int);
137 static void store_unaligned_arguments_into_pseudos (struct arg_data
*, int);
138 static int finalize_must_preallocate (int, int, struct arg_data
*,
140 static void precompute_arguments (int, struct arg_data
*);
141 static int compute_argument_block_size (int, struct args_size
*, tree
, tree
, int);
142 static void initialize_argument_information (int, struct arg_data
*,
143 struct args_size
*, int,
145 tree
, tree
, cumulative_args_t
, int,
146 rtx
*, int *, int *, int *,
148 static void compute_argument_addresses (struct arg_data
*, rtx
, int);
149 static rtx
rtx_for_function_call (tree
, tree
);
150 static void load_register_parameters (struct arg_data
*, int, rtx
*, int,
152 static rtx
emit_library_call_value_1 (int, rtx
, rtx
, enum libcall_type
,
153 enum machine_mode
, int, va_list);
154 static int special_function_p (const_tree
, int);
155 static int check_sibcall_argument_overlap_1 (rtx
);
156 static int check_sibcall_argument_overlap (rtx_insn
*, struct arg_data
*, int);
158 static int combine_pending_stack_adjustment_and_call (int, struct args_size
*,
160 static tree
split_complex_types (tree
);
162 #ifdef REG_PARM_STACK_SPACE
163 static rtx
save_fixed_argument_area (int, rtx
, int *, int *);
164 static void restore_fixed_argument_area (rtx
, rtx
, int, int);
167 /* Force FUNEXP into a form suitable for the address of a CALL,
168 and return that as an rtx. Also load the static chain register
169 if FNDECL is a nested function.
171 CALL_FUSAGE points to a variable holding the prospective
172 CALL_INSN_FUNCTION_USAGE information. */
175 prepare_call_address (tree fndecl
, rtx funexp
, rtx static_chain_value
,
176 rtx
*call_fusage
, int reg_parm_seen
, int sibcallp
)
178 /* Make a valid memory address and copy constants through pseudo-regs,
179 but not for a constant address if -fno-function-cse. */
180 if (GET_CODE (funexp
) != SYMBOL_REF
)
181 /* If we are using registers for parameters, force the
182 function address into a register now. */
183 funexp
= ((reg_parm_seen
184 && targetm
.small_register_classes_for_mode_p (FUNCTION_MODE
))
185 ? force_not_mem (memory_address (FUNCTION_MODE
, funexp
))
186 : memory_address (FUNCTION_MODE
, funexp
));
189 #ifndef NO_FUNCTION_CSE
190 if (optimize
&& ! flag_no_function_cse
)
191 funexp
= force_reg (Pmode
, funexp
);
195 if (static_chain_value
!= 0)
200 chain
= targetm
.calls
.static_chain (fndecl
, false);
201 static_chain_value
= convert_memory_address (Pmode
, static_chain_value
);
203 emit_move_insn (chain
, static_chain_value
);
205 use_reg (call_fusage
, chain
);
211 /* Generate instructions to call function FUNEXP,
212 and optionally pop the results.
213 The CALL_INSN is the first insn generated.
215 FNDECL is the declaration node of the function. This is given to the
216 hook TARGET_RETURN_POPS_ARGS to determine whether this function pops
219 FUNTYPE is the data type of the function. This is given to the hook
220 TARGET_RETURN_POPS_ARGS to determine whether this function pops its
221 own args. We used to allow an identifier for library functions, but
222 that doesn't work when the return type is an aggregate type and the
223 calling convention says that the pointer to this aggregate is to be
224 popped by the callee.
226 STACK_SIZE is the number of bytes of arguments on the stack,
227 ROUNDED_STACK_SIZE is that number rounded up to
228 PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
229 both to put into the call insn and to generate explicit popping
232 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
233 It is zero if this call doesn't want a structure value.
235 NEXT_ARG_REG is the rtx that results from executing
236 targetm.calls.function_arg (&args_so_far, VOIDmode, void_type_node, true)
237 just after all the args have had their registers assigned.
238 This could be whatever you like, but normally it is the first
239 arg-register beyond those used for args in this call,
240 or 0 if all the arg-registers are used in this call.
241 It is passed on to `gen_call' so you can put this info in the call insn.
243 VALREG is a hard register in which a value is returned,
244 or 0 if the call does not return a value.
246 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
247 the args to this call were processed.
248 We restore `inhibit_defer_pop' to that value.
250 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
251 denote registers used by the called function. */
254 emit_call_1 (rtx funexp
, tree fntree ATTRIBUTE_UNUSED
, tree fndecl ATTRIBUTE_UNUSED
,
255 tree funtype ATTRIBUTE_UNUSED
,
256 HOST_WIDE_INT stack_size ATTRIBUTE_UNUSED
,
257 HOST_WIDE_INT rounded_stack_size
,
258 HOST_WIDE_INT struct_value_size ATTRIBUTE_UNUSED
,
259 rtx next_arg_reg ATTRIBUTE_UNUSED
, rtx valreg
,
260 int old_inhibit_defer_pop
, rtx call_fusage
, int ecf_flags
,
261 cumulative_args_t args_so_far ATTRIBUTE_UNUSED
)
263 rtx rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
266 int already_popped
= 0;
267 HOST_WIDE_INT n_popped
268 = targetm
.calls
.return_pops_args (fndecl
, funtype
, stack_size
);
270 #ifdef CALL_POPS_ARGS
271 n_popped
+= CALL_POPS_ARGS (*get_cumulative_args (args_so_far
));
274 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
275 and we don't want to load it into a register as an optimization,
276 because prepare_call_address already did it if it should be done. */
277 if (GET_CODE (funexp
) != SYMBOL_REF
)
278 funexp
= memory_address (FUNCTION_MODE
, funexp
);
280 funmem
= gen_rtx_MEM (FUNCTION_MODE
, funexp
);
281 if (fndecl
&& TREE_CODE (fndecl
) == FUNCTION_DECL
)
285 /* Although a built-in FUNCTION_DECL and its non-__builtin
286 counterpart compare equal and get a shared mem_attrs, they
287 produce different dump output in compare-debug compilations,
288 if an entry gets garbage collected in one compilation, then
289 adds a different (but equivalent) entry, while the other
290 doesn't run the garbage collector at the same spot and then
291 shares the mem_attr with the equivalent entry. */
292 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
294 tree t2
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
299 set_mem_expr (funmem
, t
);
302 set_mem_expr (funmem
, build_simple_mem_ref (CALL_EXPR_FN (fntree
)));
304 #if defined (HAVE_sibcall_pop) && defined (HAVE_sibcall_value_pop)
305 if ((ecf_flags
& ECF_SIBCALL
)
306 && HAVE_sibcall_pop
&& HAVE_sibcall_value_pop
307 && (n_popped
> 0 || stack_size
== 0))
309 rtx n_pop
= GEN_INT (n_popped
);
312 /* If this subroutine pops its own args, record that in the call insn
313 if possible, for the sake of frame pointer elimination. */
316 pat
= GEN_SIBCALL_VALUE_POP (valreg
, funmem
, rounded_stack_size_rtx
,
317 next_arg_reg
, n_pop
);
319 pat
= GEN_SIBCALL_POP (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
322 emit_call_insn (pat
);
328 #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop)
329 /* If the target has "call" or "call_value" insns, then prefer them
330 if no arguments are actually popped. If the target does not have
331 "call" or "call_value" insns, then we must use the popping versions
332 even if the call has no arguments to pop. */
333 #if defined (HAVE_call) && defined (HAVE_call_value)
334 if (HAVE_call
&& HAVE_call_value
&& HAVE_call_pop
&& HAVE_call_value_pop
337 if (HAVE_call_pop
&& HAVE_call_value_pop
)
340 rtx n_pop
= GEN_INT (n_popped
);
343 /* If this subroutine pops its own args, record that in the call insn
344 if possible, for the sake of frame pointer elimination. */
347 pat
= GEN_CALL_VALUE_POP (valreg
, funmem
, rounded_stack_size_rtx
,
348 next_arg_reg
, n_pop
);
350 pat
= GEN_CALL_POP (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
353 emit_call_insn (pat
);
359 #if defined (HAVE_sibcall) && defined (HAVE_sibcall_value)
360 if ((ecf_flags
& ECF_SIBCALL
)
361 && HAVE_sibcall
&& HAVE_sibcall_value
)
364 emit_call_insn (GEN_SIBCALL_VALUE (valreg
, funmem
,
365 rounded_stack_size_rtx
,
366 next_arg_reg
, NULL_RTX
));
368 emit_call_insn (GEN_SIBCALL (funmem
, rounded_stack_size_rtx
,
370 GEN_INT (struct_value_size
)));
375 #if defined (HAVE_call) && defined (HAVE_call_value)
376 if (HAVE_call
&& HAVE_call_value
)
379 emit_call_insn (GEN_CALL_VALUE (valreg
, funmem
, rounded_stack_size_rtx
,
380 next_arg_reg
, NULL_RTX
));
382 emit_call_insn (GEN_CALL (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
383 GEN_INT (struct_value_size
)));
389 /* Find the call we just emitted. */
390 call_insn
= last_call_insn ();
392 /* Some target create a fresh MEM instead of reusing the one provided
393 above. Set its MEM_EXPR. */
394 call
= get_call_rtx_from (call_insn
);
396 && MEM_EXPR (XEXP (call
, 0)) == NULL_TREE
397 && MEM_EXPR (funmem
) != NULL_TREE
)
398 set_mem_expr (XEXP (call
, 0), MEM_EXPR (funmem
));
400 /* Put the register usage information there. */
401 add_function_usage_to (call_insn
, call_fusage
);
403 /* If this is a const call, then set the insn's unchanging bit. */
404 if (ecf_flags
& ECF_CONST
)
405 RTL_CONST_CALL_P (call_insn
) = 1;
407 /* If this is a pure call, then set the insn's unchanging bit. */
408 if (ecf_flags
& ECF_PURE
)
409 RTL_PURE_CALL_P (call_insn
) = 1;
411 /* If this is a const call, then set the insn's unchanging bit. */
412 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
413 RTL_LOOPING_CONST_OR_PURE_CALL_P (call_insn
) = 1;
415 /* Create a nothrow REG_EH_REGION note, if needed. */
416 make_reg_eh_region_note (call_insn
, ecf_flags
, 0);
418 if (ecf_flags
& ECF_NORETURN
)
419 add_reg_note (call_insn
, REG_NORETURN
, const0_rtx
);
421 if (ecf_flags
& ECF_RETURNS_TWICE
)
423 add_reg_note (call_insn
, REG_SETJMP
, const0_rtx
);
424 cfun
->calls_setjmp
= 1;
427 SIBLING_CALL_P (call_insn
) = ((ecf_flags
& ECF_SIBCALL
) != 0);
429 /* Restore this now, so that we do defer pops for this call's args
430 if the context of the call as a whole permits. */
431 inhibit_defer_pop
= old_inhibit_defer_pop
;
436 CALL_INSN_FUNCTION_USAGE (call_insn
)
437 = gen_rtx_EXPR_LIST (VOIDmode
,
438 gen_rtx_CLOBBER (VOIDmode
, stack_pointer_rtx
),
439 CALL_INSN_FUNCTION_USAGE (call_insn
));
440 rounded_stack_size
-= n_popped
;
441 rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
442 stack_pointer_delta
-= n_popped
;
444 add_reg_note (call_insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
446 /* If popup is needed, stack realign must use DRAP */
447 if (SUPPORTS_STACK_ALIGNMENT
)
448 crtl
->need_drap
= true;
450 /* For noreturn calls when not accumulating outgoing args force
451 REG_ARGS_SIZE note to prevent crossjumping of calls with different
453 else if (!ACCUMULATE_OUTGOING_ARGS
&& (ecf_flags
& ECF_NORETURN
) != 0)
454 add_reg_note (call_insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
456 if (!ACCUMULATE_OUTGOING_ARGS
)
458 /* If returning from the subroutine does not automatically pop the args,
459 we need an instruction to pop them sooner or later.
460 Perhaps do it now; perhaps just record how much space to pop later.
462 If returning from the subroutine does pop the args, indicate that the
463 stack pointer will be changed. */
465 if (rounded_stack_size
!= 0)
467 if (ecf_flags
& ECF_NORETURN
)
468 /* Just pretend we did the pop. */
469 stack_pointer_delta
-= rounded_stack_size
;
470 else if (flag_defer_pop
&& inhibit_defer_pop
== 0
471 && ! (ecf_flags
& (ECF_CONST
| ECF_PURE
)))
472 pending_stack_adjust
+= rounded_stack_size
;
474 adjust_stack (rounded_stack_size_rtx
);
477 /* When we accumulate outgoing args, we must avoid any stack manipulations.
478 Restore the stack pointer to its original value now. Usually
479 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
480 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
481 popping variants of functions exist as well.
483 ??? We may optimize similar to defer_pop above, but it is
484 probably not worthwhile.
486 ??? It will be worthwhile to enable combine_stack_adjustments even for
489 anti_adjust_stack (GEN_INT (n_popped
));
492 /* Determine if the function identified by NAME and FNDECL is one with
493 special properties we wish to know about.
495 For example, if the function might return more than one time (setjmp), then
496 set RETURNS_TWICE to a nonzero value.
498 Similarly set NORETURN if the function is in the longjmp family.
500 Set MAY_BE_ALLOCA for any memory allocation function that might allocate
501 space from the stack such as alloca. */
504 special_function_p (const_tree fndecl
, int flags
)
506 if (fndecl
&& DECL_NAME (fndecl
)
507 && IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) <= 17
508 /* Exclude functions not at the file scope, or not `extern',
509 since they are not the magic functions we would otherwise
511 FIXME: this should be handled with attributes, not with this
512 hacky imitation of DECL_ASSEMBLER_NAME. It's (also) wrong
513 because you can declare fork() inside a function if you
515 && (DECL_CONTEXT (fndecl
) == NULL_TREE
516 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
517 && TREE_PUBLIC (fndecl
))
519 const char *name
= IDENTIFIER_POINTER (DECL_NAME (fndecl
));
520 const char *tname
= name
;
522 /* We assume that alloca will always be called by name. It
523 makes no sense to pass it as a pointer-to-function to
524 anything that does not understand its behavior. */
525 if (((IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 6
527 && ! strcmp (name
, "alloca"))
528 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 16
530 && ! strcmp (name
, "__builtin_alloca"))))
531 flags
|= ECF_MAY_BE_ALLOCA
;
533 /* Disregard prefix _, __, __x or __builtin_. */
538 && !strncmp (name
+ 3, "uiltin_", 7))
540 else if (name
[1] == '_' && name
[2] == 'x')
542 else if (name
[1] == '_')
551 && (! strcmp (tname
, "setjmp")
552 || ! strcmp (tname
, "setjmp_syscall")))
554 && ! strcmp (tname
, "sigsetjmp"))
556 && ! strcmp (tname
, "savectx")))
557 flags
|= ECF_RETURNS_TWICE
| ECF_LEAF
;
560 && ! strcmp (tname
, "siglongjmp"))
561 flags
|= ECF_NORETURN
;
563 else if ((tname
[0] == 'q' && tname
[1] == 's'
564 && ! strcmp (tname
, "qsetjmp"))
565 || (tname
[0] == 'v' && tname
[1] == 'f'
566 && ! strcmp (tname
, "vfork"))
567 || (tname
[0] == 'g' && tname
[1] == 'e'
568 && !strcmp (tname
, "getcontext")))
569 flags
|= ECF_RETURNS_TWICE
| ECF_LEAF
;
571 else if (tname
[0] == 'l' && tname
[1] == 'o'
572 && ! strcmp (tname
, "longjmp"))
573 flags
|= ECF_NORETURN
;
579 /* Similar to special_function_p; return a set of ERF_ flags for the
582 decl_return_flags (tree fndecl
)
585 tree type
= TREE_TYPE (fndecl
);
589 attr
= lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type
));
593 attr
= TREE_VALUE (TREE_VALUE (attr
));
594 if (!attr
|| TREE_STRING_LENGTH (attr
) < 1)
597 switch (TREE_STRING_POINTER (attr
)[0])
603 return ERF_RETURNS_ARG
| (TREE_STRING_POINTER (attr
)[0] - '1');
614 /* Return nonzero when FNDECL represents a call to setjmp. */
617 setjmp_call_p (const_tree fndecl
)
619 if (DECL_IS_RETURNS_TWICE (fndecl
))
620 return ECF_RETURNS_TWICE
;
621 return special_function_p (fndecl
, 0) & ECF_RETURNS_TWICE
;
625 /* Return true if STMT is an alloca call. */
628 gimple_alloca_call_p (const_gimple stmt
)
632 if (!is_gimple_call (stmt
))
635 fndecl
= gimple_call_fndecl (stmt
);
636 if (fndecl
&& (special_function_p (fndecl
, 0) & ECF_MAY_BE_ALLOCA
))
642 /* Return true when exp contains alloca call. */
645 alloca_call_p (const_tree exp
)
648 if (TREE_CODE (exp
) == CALL_EXPR
649 && (fndecl
= get_callee_fndecl (exp
))
650 && (special_function_p (fndecl
, 0) & ECF_MAY_BE_ALLOCA
))
655 /* Return TRUE if FNDECL is either a TM builtin or a TM cloned
656 function. Return FALSE otherwise. */
659 is_tm_builtin (const_tree fndecl
)
664 if (decl_is_tm_clone (fndecl
))
667 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
669 switch (DECL_FUNCTION_CODE (fndecl
))
671 case BUILT_IN_TM_COMMIT
:
672 case BUILT_IN_TM_COMMIT_EH
:
673 case BUILT_IN_TM_ABORT
:
674 case BUILT_IN_TM_IRREVOCABLE
:
675 case BUILT_IN_TM_GETTMCLONE_IRR
:
676 case BUILT_IN_TM_MEMCPY
:
677 case BUILT_IN_TM_MEMMOVE
:
678 case BUILT_IN_TM_MEMSET
:
679 CASE_BUILT_IN_TM_STORE (1):
680 CASE_BUILT_IN_TM_STORE (2):
681 CASE_BUILT_IN_TM_STORE (4):
682 CASE_BUILT_IN_TM_STORE (8):
683 CASE_BUILT_IN_TM_STORE (FLOAT
):
684 CASE_BUILT_IN_TM_STORE (DOUBLE
):
685 CASE_BUILT_IN_TM_STORE (LDOUBLE
):
686 CASE_BUILT_IN_TM_STORE (M64
):
687 CASE_BUILT_IN_TM_STORE (M128
):
688 CASE_BUILT_IN_TM_STORE (M256
):
689 CASE_BUILT_IN_TM_LOAD (1):
690 CASE_BUILT_IN_TM_LOAD (2):
691 CASE_BUILT_IN_TM_LOAD (4):
692 CASE_BUILT_IN_TM_LOAD (8):
693 CASE_BUILT_IN_TM_LOAD (FLOAT
):
694 CASE_BUILT_IN_TM_LOAD (DOUBLE
):
695 CASE_BUILT_IN_TM_LOAD (LDOUBLE
):
696 CASE_BUILT_IN_TM_LOAD (M64
):
697 CASE_BUILT_IN_TM_LOAD (M128
):
698 CASE_BUILT_IN_TM_LOAD (M256
):
699 case BUILT_IN_TM_LOG
:
700 case BUILT_IN_TM_LOG_1
:
701 case BUILT_IN_TM_LOG_2
:
702 case BUILT_IN_TM_LOG_4
:
703 case BUILT_IN_TM_LOG_8
:
704 case BUILT_IN_TM_LOG_FLOAT
:
705 case BUILT_IN_TM_LOG_DOUBLE
:
706 case BUILT_IN_TM_LOG_LDOUBLE
:
707 case BUILT_IN_TM_LOG_M64
:
708 case BUILT_IN_TM_LOG_M128
:
709 case BUILT_IN_TM_LOG_M256
:
718 /* Detect flags (function attributes) from the function decl or type node. */
721 flags_from_decl_or_type (const_tree exp
)
727 /* The function exp may have the `malloc' attribute. */
728 if (DECL_IS_MALLOC (exp
))
731 /* The function exp may have the `returns_twice' attribute. */
732 if (DECL_IS_RETURNS_TWICE (exp
))
733 flags
|= ECF_RETURNS_TWICE
;
735 /* Process the pure and const attributes. */
736 if (TREE_READONLY (exp
))
738 if (DECL_PURE_P (exp
))
740 if (DECL_LOOPING_CONST_OR_PURE_P (exp
))
741 flags
|= ECF_LOOPING_CONST_OR_PURE
;
743 if (DECL_IS_NOVOPS (exp
))
745 if (lookup_attribute ("leaf", DECL_ATTRIBUTES (exp
)))
748 if (TREE_NOTHROW (exp
))
749 flags
|= ECF_NOTHROW
;
753 if (is_tm_builtin (exp
))
754 flags
|= ECF_TM_BUILTIN
;
755 else if ((flags
& (ECF_CONST
|ECF_NOVOPS
)) != 0
756 || lookup_attribute ("transaction_pure",
757 TYPE_ATTRIBUTES (TREE_TYPE (exp
))))
758 flags
|= ECF_TM_PURE
;
761 flags
= special_function_p (exp
, flags
);
763 else if (TYPE_P (exp
))
765 if (TYPE_READONLY (exp
))
769 && ((flags
& ECF_CONST
) != 0
770 || lookup_attribute ("transaction_pure", TYPE_ATTRIBUTES (exp
))))
771 flags
|= ECF_TM_PURE
;
776 if (TREE_THIS_VOLATILE (exp
))
778 flags
|= ECF_NORETURN
;
779 if (flags
& (ECF_CONST
|ECF_PURE
))
780 flags
|= ECF_LOOPING_CONST_OR_PURE
;
786 /* Detect flags from a CALL_EXPR. */
789 call_expr_flags (const_tree t
)
792 tree decl
= get_callee_fndecl (t
);
795 flags
= flags_from_decl_or_type (decl
);
798 t
= TREE_TYPE (CALL_EXPR_FN (t
));
799 if (t
&& TREE_CODE (t
) == POINTER_TYPE
)
800 flags
= flags_from_decl_or_type (TREE_TYPE (t
));
808 /* Precompute all register parameters as described by ARGS, storing values
809 into fields within the ARGS array.
811 NUM_ACTUALS indicates the total number elements in the ARGS array.
813 Set REG_PARM_SEEN if we encounter a register parameter. */
816 precompute_register_parameters (int num_actuals
, struct arg_data
*args
,
823 for (i
= 0; i
< num_actuals
; i
++)
824 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
)
828 if (args
[i
].value
== 0)
831 args
[i
].value
= expand_normal (args
[i
].tree_value
);
832 preserve_temp_slots (args
[i
].value
);
836 /* If we are to promote the function arg to a wider mode,
839 if (args
[i
].mode
!= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)))
841 = convert_modes (args
[i
].mode
,
842 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
843 args
[i
].value
, args
[i
].unsignedp
);
845 /* If the value is a non-legitimate constant, force it into a
846 pseudo now. TLS symbols sometimes need a call to resolve. */
847 if (CONSTANT_P (args
[i
].value
)
848 && !targetm
.legitimate_constant_p (args
[i
].mode
, args
[i
].value
))
849 args
[i
].value
= force_reg (args
[i
].mode
, args
[i
].value
);
851 /* If we're going to have to load the value by parts, pull the
852 parts into pseudos. The part extraction process can involve
853 non-trivial computation. */
854 if (GET_CODE (args
[i
].reg
) == PARALLEL
)
856 tree type
= TREE_TYPE (args
[i
].tree_value
);
857 args
[i
].parallel_value
858 = emit_group_load_into_temps (args
[i
].reg
, args
[i
].value
,
859 type
, int_size_in_bytes (type
));
862 /* If the value is expensive, and we are inside an appropriately
863 short loop, put the value into a pseudo and then put the pseudo
866 For small register classes, also do this if this call uses
867 register parameters. This is to avoid reload conflicts while
868 loading the parameters registers. */
870 else if ((! (REG_P (args
[i
].value
)
871 || (GET_CODE (args
[i
].value
) == SUBREG
872 && REG_P (SUBREG_REG (args
[i
].value
)))))
873 && args
[i
].mode
!= BLKmode
874 && set_src_cost (args
[i
].value
, optimize_insn_for_speed_p ())
877 && targetm
.small_register_classes_for_mode_p (args
[i
].mode
))
879 args
[i
].value
= copy_to_mode_reg (args
[i
].mode
, args
[i
].value
);
883 #ifdef REG_PARM_STACK_SPACE
885 /* The argument list is the property of the called routine and it
886 may clobber it. If the fixed area has been used for previous
887 parameters, we must save and restore it. */
890 save_fixed_argument_area (int reg_parm_stack_space
, rtx argblock
, int *low_to_save
, int *high_to_save
)
895 /* Compute the boundary of the area that needs to be saved, if any. */
896 high
= reg_parm_stack_space
;
897 #ifdef ARGS_GROW_DOWNWARD
900 if (high
> highest_outgoing_arg_in_use
)
901 high
= highest_outgoing_arg_in_use
;
903 for (low
= 0; low
< high
; low
++)
904 if (stack_usage_map
[low
] != 0)
907 enum machine_mode save_mode
;
913 while (stack_usage_map
[--high
] == 0)
917 *high_to_save
= high
;
919 num_to_save
= high
- low
+ 1;
920 save_mode
= mode_for_size (num_to_save
* BITS_PER_UNIT
, MODE_INT
, 1);
922 /* If we don't have the required alignment, must do this
924 if ((low
& (MIN (GET_MODE_SIZE (save_mode
),
925 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)))
928 #ifdef ARGS_GROW_DOWNWARD
933 addr
= plus_constant (Pmode
, argblock
, delta
);
934 stack_area
= gen_rtx_MEM (save_mode
, memory_address (save_mode
, addr
));
936 set_mem_align (stack_area
, PARM_BOUNDARY
);
937 if (save_mode
== BLKmode
)
939 save_area
= assign_stack_temp (BLKmode
, num_to_save
);
940 emit_block_move (validize_mem (save_area
), stack_area
,
941 GEN_INT (num_to_save
), BLOCK_OP_CALL_PARM
);
945 save_area
= gen_reg_rtx (save_mode
);
946 emit_move_insn (save_area
, stack_area
);
956 restore_fixed_argument_area (rtx save_area
, rtx argblock
, int high_to_save
, int low_to_save
)
958 enum machine_mode save_mode
= GET_MODE (save_area
);
960 rtx addr
, stack_area
;
962 #ifdef ARGS_GROW_DOWNWARD
963 delta
= -high_to_save
;
967 addr
= plus_constant (Pmode
, argblock
, delta
);
968 stack_area
= gen_rtx_MEM (save_mode
, memory_address (save_mode
, addr
));
969 set_mem_align (stack_area
, PARM_BOUNDARY
);
971 if (save_mode
!= BLKmode
)
972 emit_move_insn (stack_area
, save_area
);
974 emit_block_move (stack_area
, validize_mem (save_area
),
975 GEN_INT (high_to_save
- low_to_save
+ 1),
978 #endif /* REG_PARM_STACK_SPACE */
980 /* If any elements in ARGS refer to parameters that are to be passed in
981 registers, but not in memory, and whose alignment does not permit a
982 direct copy into registers. Copy the values into a group of pseudos
983 which we will later copy into the appropriate hard registers.
985 Pseudos for each unaligned argument will be stored into the array
986 args[argnum].aligned_regs. The caller is responsible for deallocating
987 the aligned_regs array if it is nonzero. */
990 store_unaligned_arguments_into_pseudos (struct arg_data
*args
, int num_actuals
)
994 for (i
= 0; i
< num_actuals
; i
++)
995 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
996 && GET_CODE (args
[i
].reg
) != PARALLEL
997 && args
[i
].mode
== BLKmode
998 && MEM_P (args
[i
].value
)
999 && (MEM_ALIGN (args
[i
].value
)
1000 < (unsigned int) MIN (BIGGEST_ALIGNMENT
, BITS_PER_WORD
)))
1002 int bytes
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1003 int endian_correction
= 0;
1005 if (args
[i
].partial
)
1007 gcc_assert (args
[i
].partial
% UNITS_PER_WORD
== 0);
1008 args
[i
].n_aligned_regs
= args
[i
].partial
/ UNITS_PER_WORD
;
1012 args
[i
].n_aligned_regs
1013 = (bytes
+ UNITS_PER_WORD
- 1) / UNITS_PER_WORD
;
1016 args
[i
].aligned_regs
= XNEWVEC (rtx
, args
[i
].n_aligned_regs
);
1018 /* Structures smaller than a word are normally aligned to the
1019 least significant byte. On a BYTES_BIG_ENDIAN machine,
1020 this means we must skip the empty high order bytes when
1021 calculating the bit offset. */
1022 if (bytes
< UNITS_PER_WORD
1023 #ifdef BLOCK_REG_PADDING
1024 && (BLOCK_REG_PADDING (args
[i
].mode
,
1025 TREE_TYPE (args
[i
].tree_value
), 1)
1031 endian_correction
= BITS_PER_WORD
- bytes
* BITS_PER_UNIT
;
1033 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1035 rtx reg
= gen_reg_rtx (word_mode
);
1036 rtx word
= operand_subword_force (args
[i
].value
, j
, BLKmode
);
1037 int bitsize
= MIN (bytes
* BITS_PER_UNIT
, BITS_PER_WORD
);
1039 args
[i
].aligned_regs
[j
] = reg
;
1040 word
= extract_bit_field (word
, bitsize
, 0, 1, NULL_RTX
,
1041 word_mode
, word_mode
);
1043 /* There is no need to restrict this code to loading items
1044 in TYPE_ALIGN sized hunks. The bitfield instructions can
1045 load up entire word sized registers efficiently.
1047 ??? This may not be needed anymore.
1048 We use to emit a clobber here but that doesn't let later
1049 passes optimize the instructions we emit. By storing 0 into
1050 the register later passes know the first AND to zero out the
1051 bitfield being set in the register is unnecessary. The store
1052 of 0 will be deleted as will at least the first AND. */
1054 emit_move_insn (reg
, const0_rtx
);
1056 bytes
-= bitsize
/ BITS_PER_UNIT
;
1057 store_bit_field (reg
, bitsize
, endian_correction
, 0, 0,
1063 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1066 NUM_ACTUALS is the total number of parameters.
1068 N_NAMED_ARGS is the total number of named arguments.
1070 STRUCT_VALUE_ADDR_VALUE is the implicit argument for a struct return
1073 FNDECL is the tree code for the target of this call (if known)
1075 ARGS_SO_FAR holds state needed by the target to know where to place
1078 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1079 for arguments which are passed in registers.
1081 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1082 and may be modified by this routine.
1084 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1085 flags which may may be modified by this routine.
1087 MAY_TAILCALL is cleared if we encounter an invisible pass-by-reference
1088 that requires allocation of stack space.
1090 CALL_FROM_THUNK_P is true if this call is the jump from a thunk to
1091 the thunked-to function. */
1094 initialize_argument_information (int num_actuals ATTRIBUTE_UNUSED
,
1095 struct arg_data
*args
,
1096 struct args_size
*args_size
,
1097 int n_named_args ATTRIBUTE_UNUSED
,
1098 tree exp
, tree struct_value_addr_value
,
1099 tree fndecl
, tree fntype
,
1100 cumulative_args_t args_so_far
,
1101 int reg_parm_stack_space
,
1102 rtx
*old_stack_level
, int *old_pending_adj
,
1103 int *must_preallocate
, int *ecf_flags
,
1104 bool *may_tailcall
, bool call_from_thunk_p
)
1106 CUMULATIVE_ARGS
*args_so_far_pnt
= get_cumulative_args (args_so_far
);
1107 location_t loc
= EXPR_LOCATION (exp
);
1109 /* Count arg position in order args appear. */
1114 args_size
->constant
= 0;
1117 /* In this loop, we consider args in the order they are written.
1118 We fill up ARGS from the back. */
1120 i
= num_actuals
- 1;
1123 call_expr_arg_iterator iter
;
1126 if (struct_value_addr_value
)
1128 args
[j
].tree_value
= struct_value_addr_value
;
1131 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
1133 tree argtype
= TREE_TYPE (arg
);
1134 if (targetm
.calls
.split_complex_arg
1136 && TREE_CODE (argtype
) == COMPLEX_TYPE
1137 && targetm
.calls
.split_complex_arg (argtype
))
1139 tree subtype
= TREE_TYPE (argtype
);
1140 args
[j
].tree_value
= build1 (REALPART_EXPR
, subtype
, arg
);
1142 args
[j
].tree_value
= build1 (IMAGPART_EXPR
, subtype
, arg
);
1145 args
[j
].tree_value
= arg
;
1150 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1151 for (argpos
= 0; argpos
< num_actuals
; i
--, argpos
++)
1153 tree type
= TREE_TYPE (args
[i
].tree_value
);
1155 enum machine_mode mode
;
1157 /* Replace erroneous argument with constant zero. */
1158 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
1159 args
[i
].tree_value
= integer_zero_node
, type
= integer_type_node
;
1161 /* If TYPE is a transparent union or record, pass things the way
1162 we would pass the first field of the union or record. We have
1163 already verified that the modes are the same. */
1164 if ((TREE_CODE (type
) == UNION_TYPE
|| TREE_CODE (type
) == RECORD_TYPE
)
1165 && TYPE_TRANSPARENT_AGGR (type
))
1166 type
= TREE_TYPE (first_field (type
));
1168 /* Decide where to pass this arg.
1170 args[i].reg is nonzero if all or part is passed in registers.
1172 args[i].partial is nonzero if part but not all is passed in registers,
1173 and the exact value says how many bytes are passed in registers.
1175 args[i].pass_on_stack is nonzero if the argument must at least be
1176 computed on the stack. It may then be loaded back into registers
1177 if args[i].reg is nonzero.
1179 These decisions are driven by the FUNCTION_... macros and must agree
1180 with those made by function.c. */
1182 /* See if this argument should be passed by invisible reference. */
1183 if (pass_by_reference (args_so_far_pnt
, TYPE_MODE (type
),
1184 type
, argpos
< n_named_args
))
1187 tree base
= NULL_TREE
;
1190 = reference_callee_copied (args_so_far_pnt
, TYPE_MODE (type
),
1191 type
, argpos
< n_named_args
);
1193 /* If we're compiling a thunk, pass through invisible references
1194 instead of making a copy. */
1195 if (call_from_thunk_p
1197 && !TREE_ADDRESSABLE (type
)
1198 && (base
= get_base_address (args
[i
].tree_value
))
1199 && TREE_CODE (base
) != SSA_NAME
1200 && (!DECL_P (base
) || MEM_P (DECL_RTL (base
)))))
1202 mark_addressable (args
[i
].tree_value
);
1204 /* We can't use sibcalls if a callee-copied argument is
1205 stored in the current function's frame. */
1206 if (!call_from_thunk_p
&& DECL_P (base
) && !TREE_STATIC (base
))
1207 *may_tailcall
= false;
1209 args
[i
].tree_value
= build_fold_addr_expr_loc (loc
,
1210 args
[i
].tree_value
);
1211 type
= TREE_TYPE (args
[i
].tree_value
);
1213 if (*ecf_flags
& ECF_CONST
)
1214 *ecf_flags
&= ~(ECF_CONST
| ECF_LOOPING_CONST_OR_PURE
);
1218 /* We make a copy of the object and pass the address to the
1219 function being called. */
1222 if (!COMPLETE_TYPE_P (type
)
1223 || TREE_CODE (TYPE_SIZE_UNIT (type
)) != INTEGER_CST
1224 || (flag_stack_check
== GENERIC_STACK_CHECK
1225 && compare_tree_int (TYPE_SIZE_UNIT (type
),
1226 STACK_CHECK_MAX_VAR_SIZE
) > 0))
1228 /* This is a variable-sized object. Make space on the stack
1230 rtx size_rtx
= expr_size (args
[i
].tree_value
);
1232 if (*old_stack_level
== 0)
1234 emit_stack_save (SAVE_BLOCK
, old_stack_level
);
1235 *old_pending_adj
= pending_stack_adjust
;
1236 pending_stack_adjust
= 0;
1239 /* We can pass TRUE as the 4th argument because we just
1240 saved the stack pointer and will restore it right after
1242 copy
= allocate_dynamic_stack_space (size_rtx
,
1246 copy
= gen_rtx_MEM (BLKmode
, copy
);
1247 set_mem_attributes (copy
, type
, 1);
1250 copy
= assign_temp (type
, 1, 0);
1252 store_expr (args
[i
].tree_value
, copy
, 0, false);
1254 /* Just change the const function to pure and then let
1255 the next test clear the pure based on
1257 if (*ecf_flags
& ECF_CONST
)
1259 *ecf_flags
&= ~ECF_CONST
;
1260 *ecf_flags
|= ECF_PURE
;
1263 if (!callee_copies
&& *ecf_flags
& ECF_PURE
)
1264 *ecf_flags
&= ~(ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
1267 = build_fold_addr_expr_loc (loc
, make_tree (type
, copy
));
1268 type
= TREE_TYPE (args
[i
].tree_value
);
1269 *may_tailcall
= false;
1273 unsignedp
= TYPE_UNSIGNED (type
);
1274 mode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
1275 fndecl
? TREE_TYPE (fndecl
) : fntype
, 0);
1277 args
[i
].unsignedp
= unsignedp
;
1278 args
[i
].mode
= mode
;
1280 args
[i
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
, type
,
1281 argpos
< n_named_args
);
1283 /* If this is a sibling call and the machine has register windows, the
1284 register window has to be unwinded before calling the routine, so
1285 arguments have to go into the incoming registers. */
1286 if (targetm
.calls
.function_incoming_arg
!= targetm
.calls
.function_arg
)
1287 args
[i
].tail_call_reg
1288 = targetm
.calls
.function_incoming_arg (args_so_far
, mode
, type
,
1289 argpos
< n_named_args
);
1291 args
[i
].tail_call_reg
= args
[i
].reg
;
1295 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, type
,
1296 argpos
< n_named_args
);
1298 args
[i
].pass_on_stack
= targetm
.calls
.must_pass_in_stack (mode
, type
);
1300 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1301 it means that we are to pass this arg in the register(s) designated
1302 by the PARALLEL, but also to pass it in the stack. */
1303 if (args
[i
].reg
&& GET_CODE (args
[i
].reg
) == PARALLEL
1304 && XEXP (XVECEXP (args
[i
].reg
, 0, 0), 0) == 0)
1305 args
[i
].pass_on_stack
= 1;
1307 /* If this is an addressable type, we must preallocate the stack
1308 since we must evaluate the object into its final location.
1310 If this is to be passed in both registers and the stack, it is simpler
1312 if (TREE_ADDRESSABLE (type
)
1313 || (args
[i
].pass_on_stack
&& args
[i
].reg
!= 0))
1314 *must_preallocate
= 1;
1316 /* Compute the stack-size of this argument. */
1317 if (args
[i
].reg
== 0 || args
[i
].partial
!= 0
1318 || reg_parm_stack_space
> 0
1319 || args
[i
].pass_on_stack
)
1320 locate_and_pad_parm (mode
, type
,
1321 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1326 reg_parm_stack_space
,
1327 args
[i
].pass_on_stack
? 0 : args
[i
].partial
,
1328 fndecl
, args_size
, &args
[i
].locate
);
1329 #ifdef BLOCK_REG_PADDING
1331 /* The argument is passed entirely in registers. See at which
1332 end it should be padded. */
1333 args
[i
].locate
.where_pad
=
1334 BLOCK_REG_PADDING (mode
, type
,
1335 int_size_in_bytes (type
) <= UNITS_PER_WORD
);
1338 /* Update ARGS_SIZE, the total stack space for args so far. */
1340 args_size
->constant
+= args
[i
].locate
.size
.constant
;
1341 if (args
[i
].locate
.size
.var
)
1342 ADD_PARM_SIZE (*args_size
, args
[i
].locate
.size
.var
);
1344 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1345 have been used, etc. */
1347 targetm
.calls
.function_arg_advance (args_so_far
, TYPE_MODE (type
),
1348 type
, argpos
< n_named_args
);
1352 /* Update ARGS_SIZE to contain the total size for the argument block.
1353 Return the original constant component of the argument block's size.
1355 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1356 for arguments passed in registers. */
1359 compute_argument_block_size (int reg_parm_stack_space
,
1360 struct args_size
*args_size
,
1361 tree fndecl ATTRIBUTE_UNUSED
,
1362 tree fntype ATTRIBUTE_UNUSED
,
1363 int preferred_stack_boundary ATTRIBUTE_UNUSED
)
1365 int unadjusted_args_size
= args_size
->constant
;
1367 /* For accumulate outgoing args mode we don't need to align, since the frame
1368 will be already aligned. Align to STACK_BOUNDARY in order to prevent
1369 backends from generating misaligned frame sizes. */
1370 if (ACCUMULATE_OUTGOING_ARGS
&& preferred_stack_boundary
> STACK_BOUNDARY
)
1371 preferred_stack_boundary
= STACK_BOUNDARY
;
1373 /* Compute the actual size of the argument block required. The variable
1374 and constant sizes must be combined, the size may have to be rounded,
1375 and there may be a minimum required size. */
1379 args_size
->var
= ARGS_SIZE_TREE (*args_size
);
1380 args_size
->constant
= 0;
1382 preferred_stack_boundary
/= BITS_PER_UNIT
;
1383 if (preferred_stack_boundary
> 1)
1385 /* We don't handle this case yet. To handle it correctly we have
1386 to add the delta, round and subtract the delta.
1387 Currently no machine description requires this support. */
1388 gcc_assert (!(stack_pointer_delta
& (preferred_stack_boundary
- 1)));
1389 args_size
->var
= round_up (args_size
->var
, preferred_stack_boundary
);
1392 if (reg_parm_stack_space
> 0)
1395 = size_binop (MAX_EXPR
, args_size
->var
,
1396 ssize_int (reg_parm_stack_space
));
1398 /* The area corresponding to register parameters is not to count in
1399 the size of the block we need. So make the adjustment. */
1400 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
1402 = size_binop (MINUS_EXPR
, args_size
->var
,
1403 ssize_int (reg_parm_stack_space
));
1408 preferred_stack_boundary
/= BITS_PER_UNIT
;
1409 if (preferred_stack_boundary
< 1)
1410 preferred_stack_boundary
= 1;
1411 args_size
->constant
= (((args_size
->constant
1412 + stack_pointer_delta
1413 + preferred_stack_boundary
- 1)
1414 / preferred_stack_boundary
1415 * preferred_stack_boundary
)
1416 - stack_pointer_delta
);
1418 args_size
->constant
= MAX (args_size
->constant
,
1419 reg_parm_stack_space
);
1421 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
1422 args_size
->constant
-= reg_parm_stack_space
;
1424 return unadjusted_args_size
;
1427 /* Precompute parameters as needed for a function call.
1429 FLAGS is mask of ECF_* constants.
1431 NUM_ACTUALS is the number of arguments.
1433 ARGS is an array containing information for each argument; this
1434 routine fills in the INITIAL_VALUE and VALUE fields for each
1435 precomputed argument. */
1438 precompute_arguments (int num_actuals
, struct arg_data
*args
)
1442 /* If this is a libcall, then precompute all arguments so that we do not
1443 get extraneous instructions emitted as part of the libcall sequence. */
1445 /* If we preallocated the stack space, and some arguments must be passed
1446 on the stack, then we must precompute any parameter which contains a
1447 function call which will store arguments on the stack.
1448 Otherwise, evaluating the parameter may clobber previous parameters
1449 which have already been stored into the stack. (we have code to avoid
1450 such case by saving the outgoing stack arguments, but it results in
1452 if (!ACCUMULATE_OUTGOING_ARGS
)
1455 for (i
= 0; i
< num_actuals
; i
++)
1458 enum machine_mode mode
;
1460 if (TREE_CODE (args
[i
].tree_value
) != CALL_EXPR
)
1463 /* If this is an addressable type, we cannot pre-evaluate it. */
1464 type
= TREE_TYPE (args
[i
].tree_value
);
1465 gcc_assert (!TREE_ADDRESSABLE (type
));
1467 args
[i
].initial_value
= args
[i
].value
1468 = expand_normal (args
[i
].tree_value
);
1470 mode
= TYPE_MODE (type
);
1471 if (mode
!= args
[i
].mode
)
1473 int unsignedp
= args
[i
].unsignedp
;
1475 = convert_modes (args
[i
].mode
, mode
,
1476 args
[i
].value
, args
[i
].unsignedp
);
1478 /* CSE will replace this only if it contains args[i].value
1479 pseudo, so convert it down to the declared mode using
1481 if (REG_P (args
[i
].value
)
1482 && GET_MODE_CLASS (args
[i
].mode
) == MODE_INT
1483 && promote_mode (type
, mode
, &unsignedp
) != args
[i
].mode
)
1485 args
[i
].initial_value
1486 = gen_lowpart_SUBREG (mode
, args
[i
].value
);
1487 SUBREG_PROMOTED_VAR_P (args
[i
].initial_value
) = 1;
1488 if (promoted_for_signed_and_unsigned_p (args
[i
].tree_value
, mode
))
1489 SUBREG_PROMOTED_SET (args
[i
].initial_value
, SRP_SIGNED_AND_UNSIGNED
);
1491 SUBREG_PROMOTED_SET (args
[i
].initial_value
, args
[i
].unsignedp
);
1497 /* Given the current state of MUST_PREALLOCATE and information about
1498 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
1499 compute and return the final value for MUST_PREALLOCATE. */
1502 finalize_must_preallocate (int must_preallocate
, int num_actuals
,
1503 struct arg_data
*args
, struct args_size
*args_size
)
1505 /* See if we have or want to preallocate stack space.
1507 If we would have to push a partially-in-regs parm
1508 before other stack parms, preallocate stack space instead.
1510 If the size of some parm is not a multiple of the required stack
1511 alignment, we must preallocate.
1513 If the total size of arguments that would otherwise create a copy in
1514 a temporary (such as a CALL) is more than half the total argument list
1515 size, preallocation is faster.
1517 Another reason to preallocate is if we have a machine (like the m88k)
1518 where stack alignment is required to be maintained between every
1519 pair of insns, not just when the call is made. However, we assume here
1520 that such machines either do not have push insns (and hence preallocation
1521 would occur anyway) or the problem is taken care of with
1524 if (! must_preallocate
)
1526 int partial_seen
= 0;
1527 int copy_to_evaluate_size
= 0;
1530 for (i
= 0; i
< num_actuals
&& ! must_preallocate
; i
++)
1532 if (args
[i
].partial
> 0 && ! args
[i
].pass_on_stack
)
1534 else if (partial_seen
&& args
[i
].reg
== 0)
1535 must_preallocate
= 1;
1537 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
1538 && (TREE_CODE (args
[i
].tree_value
) == CALL_EXPR
1539 || TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
1540 || TREE_CODE (args
[i
].tree_value
) == COND_EXPR
1541 || TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
))))
1542 copy_to_evaluate_size
1543 += int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1546 if (copy_to_evaluate_size
* 2 >= args_size
->constant
1547 && args_size
->constant
> 0)
1548 must_preallocate
= 1;
1550 return must_preallocate
;
1553 /* If we preallocated stack space, compute the address of each argument
1554 and store it into the ARGS array.
1556 We need not ensure it is a valid memory address here; it will be
1557 validized when it is used.
1559 ARGBLOCK is an rtx for the address of the outgoing arguments. */
1562 compute_argument_addresses (struct arg_data
*args
, rtx argblock
, int num_actuals
)
1566 rtx arg_reg
= argblock
;
1567 int i
, arg_offset
= 0;
1569 if (GET_CODE (argblock
) == PLUS
)
1570 arg_reg
= XEXP (argblock
, 0), arg_offset
= INTVAL (XEXP (argblock
, 1));
1572 for (i
= 0; i
< num_actuals
; i
++)
1574 rtx offset
= ARGS_SIZE_RTX (args
[i
].locate
.offset
);
1575 rtx slot_offset
= ARGS_SIZE_RTX (args
[i
].locate
.slot_offset
);
1577 unsigned int align
, boundary
;
1578 unsigned int units_on_stack
= 0;
1579 enum machine_mode partial_mode
= VOIDmode
;
1581 /* Skip this parm if it will not be passed on the stack. */
1582 if (! args
[i
].pass_on_stack
1584 && args
[i
].partial
== 0)
1587 if (CONST_INT_P (offset
))
1588 addr
= plus_constant (Pmode
, arg_reg
, INTVAL (offset
));
1590 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, offset
);
1592 addr
= plus_constant (Pmode
, addr
, arg_offset
);
1594 if (args
[i
].partial
!= 0)
1596 /* Only part of the parameter is being passed on the stack.
1597 Generate a simple memory reference of the correct size. */
1598 units_on_stack
= args
[i
].locate
.size
.constant
;
1599 partial_mode
= mode_for_size (units_on_stack
* BITS_PER_UNIT
,
1601 args
[i
].stack
= gen_rtx_MEM (partial_mode
, addr
);
1602 set_mem_size (args
[i
].stack
, units_on_stack
);
1606 args
[i
].stack
= gen_rtx_MEM (args
[i
].mode
, addr
);
1607 set_mem_attributes (args
[i
].stack
,
1608 TREE_TYPE (args
[i
].tree_value
), 1);
1610 align
= BITS_PER_UNIT
;
1611 boundary
= args
[i
].locate
.boundary
;
1612 if (args
[i
].locate
.where_pad
!= downward
)
1614 else if (CONST_INT_P (offset
))
1616 align
= INTVAL (offset
) * BITS_PER_UNIT
| boundary
;
1617 align
= align
& -align
;
1619 set_mem_align (args
[i
].stack
, align
);
1621 if (CONST_INT_P (slot_offset
))
1622 addr
= plus_constant (Pmode
, arg_reg
, INTVAL (slot_offset
));
1624 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, slot_offset
);
1626 addr
= plus_constant (Pmode
, addr
, arg_offset
);
1628 if (args
[i
].partial
!= 0)
1630 /* Only part of the parameter is being passed on the stack.
1631 Generate a simple memory reference of the correct size.
1633 args
[i
].stack_slot
= gen_rtx_MEM (partial_mode
, addr
);
1634 set_mem_size (args
[i
].stack_slot
, units_on_stack
);
1638 args
[i
].stack_slot
= gen_rtx_MEM (args
[i
].mode
, addr
);
1639 set_mem_attributes (args
[i
].stack_slot
,
1640 TREE_TYPE (args
[i
].tree_value
), 1);
1642 set_mem_align (args
[i
].stack_slot
, args
[i
].locate
.boundary
);
1644 /* Function incoming arguments may overlap with sibling call
1645 outgoing arguments and we cannot allow reordering of reads
1646 from function arguments with stores to outgoing arguments
1647 of sibling calls. */
1648 set_mem_alias_set (args
[i
].stack
, 0);
1649 set_mem_alias_set (args
[i
].stack_slot
, 0);
1654 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
1655 in a call instruction.
1657 FNDECL is the tree node for the target function. For an indirect call
1658 FNDECL will be NULL_TREE.
1660 ADDR is the operand 0 of CALL_EXPR for this call. */
1663 rtx_for_function_call (tree fndecl
, tree addr
)
1667 /* Get the function to call, in the form of RTL. */
1670 if (!TREE_USED (fndecl
) && fndecl
!= current_function_decl
)
1671 TREE_USED (fndecl
) = 1;
1673 /* Get a SYMBOL_REF rtx for the function address. */
1674 funexp
= XEXP (DECL_RTL (fndecl
), 0);
1677 /* Generate an rtx (probably a pseudo-register) for the address. */
1680 funexp
= expand_normal (addr
);
1681 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
1686 /* Internal state for internal_arg_pointer_based_exp and its helpers. */
1689 /* Last insn that has been scanned by internal_arg_pointer_based_exp_scan,
1690 or NULL_RTX if none has been scanned yet. */
1691 rtx_insn
*scan_start
;
1692 /* Vector indexed by REGNO - FIRST_PSEUDO_REGISTER, recording if a pseudo is
1693 based on crtl->args.internal_arg_pointer. The element is NULL_RTX if the
1694 pseudo isn't based on it, a CONST_INT offset if the pseudo is based on it
1695 with fixed offset, or PC if this is with variable or unknown offset. */
1697 } internal_arg_pointer_exp_state
;
1699 static rtx
internal_arg_pointer_based_exp (rtx
, bool);
1701 /* Helper function for internal_arg_pointer_based_exp. Scan insns in
1702 the tail call sequence, starting with first insn that hasn't been
1703 scanned yet, and note for each pseudo on the LHS whether it is based
1704 on crtl->args.internal_arg_pointer or not, and what offset from that
1705 that pointer it has. */
1708 internal_arg_pointer_based_exp_scan (void)
1710 rtx_insn
*insn
, *scan_start
= internal_arg_pointer_exp_state
.scan_start
;
1712 if (scan_start
== NULL_RTX
)
1713 insn
= get_insns ();
1715 insn
= NEXT_INSN (scan_start
);
1719 rtx set
= single_set (insn
);
1720 if (set
&& REG_P (SET_DEST (set
)) && !HARD_REGISTER_P (SET_DEST (set
)))
1723 unsigned int idx
= REGNO (SET_DEST (set
)) - FIRST_PSEUDO_REGISTER
;
1724 /* Punt on pseudos set multiple times. */
1725 if (idx
< internal_arg_pointer_exp_state
.cache
.length ()
1726 && (internal_arg_pointer_exp_state
.cache
[idx
]
1730 val
= internal_arg_pointer_based_exp (SET_SRC (set
), false);
1731 if (val
!= NULL_RTX
)
1733 if (idx
>= internal_arg_pointer_exp_state
.cache
.length ())
1734 internal_arg_pointer_exp_state
.cache
1735 .safe_grow_cleared (idx
+ 1);
1736 internal_arg_pointer_exp_state
.cache
[idx
] = val
;
1739 if (NEXT_INSN (insn
) == NULL_RTX
)
1741 insn
= NEXT_INSN (insn
);
1744 internal_arg_pointer_exp_state
.scan_start
= scan_start
;
1747 /* Helper function for internal_arg_pointer_based_exp, called through
1748 for_each_rtx. Return 1 if *LOC is a register based on
1749 crtl->args.internal_arg_pointer. Return -1 if *LOC is not based on it
1750 and the subexpressions need not be examined. Otherwise return 0. */
1753 internal_arg_pointer_based_exp_1 (rtx
*loc
, void *data ATTRIBUTE_UNUSED
)
1755 if (REG_P (*loc
) && internal_arg_pointer_based_exp (*loc
, false) != NULL_RTX
)
1762 /* Compute whether RTL is based on crtl->args.internal_arg_pointer. Return
1763 NULL_RTX if RTL isn't based on it, a CONST_INT offset if RTL is based on
1764 it with fixed offset, or PC if this is with variable or unknown offset.
1765 TOPLEVEL is true if the function is invoked at the topmost level. */
1768 internal_arg_pointer_based_exp (rtx rtl
, bool toplevel
)
1770 if (CONSTANT_P (rtl
))
1773 if (rtl
== crtl
->args
.internal_arg_pointer
)
1776 if (REG_P (rtl
) && HARD_REGISTER_P (rtl
))
1779 if (GET_CODE (rtl
) == PLUS
&& CONST_INT_P (XEXP (rtl
, 1)))
1781 rtx val
= internal_arg_pointer_based_exp (XEXP (rtl
, 0), toplevel
);
1782 if (val
== NULL_RTX
|| val
== pc_rtx
)
1784 return plus_constant (Pmode
, val
, INTVAL (XEXP (rtl
, 1)));
1787 /* When called at the topmost level, scan pseudo assignments in between the
1788 last scanned instruction in the tail call sequence and the latest insn
1789 in that sequence. */
1791 internal_arg_pointer_based_exp_scan ();
1795 unsigned int idx
= REGNO (rtl
) - FIRST_PSEUDO_REGISTER
;
1796 if (idx
< internal_arg_pointer_exp_state
.cache
.length ())
1797 return internal_arg_pointer_exp_state
.cache
[idx
];
1802 if (for_each_rtx (&rtl
, internal_arg_pointer_based_exp_1
, NULL
))
1808 /* Return true if and only if SIZE storage units (usually bytes)
1809 starting from address ADDR overlap with already clobbered argument
1810 area. This function is used to determine if we should give up a
1814 mem_overlaps_already_clobbered_arg_p (rtx addr
, unsigned HOST_WIDE_INT size
)
1819 if (bitmap_empty_p (stored_args_map
))
1821 val
= internal_arg_pointer_based_exp (addr
, true);
1822 if (val
== NULL_RTX
)
1824 else if (val
== pc_rtx
)
1828 #ifdef STACK_GROWS_DOWNWARD
1829 i
-= crtl
->args
.pretend_args_size
;
1831 i
+= crtl
->args
.pretend_args_size
;
1834 #ifdef ARGS_GROW_DOWNWARD
1839 unsigned HOST_WIDE_INT k
;
1841 for (k
= 0; k
< size
; k
++)
1842 if (i
+ k
< SBITMAP_SIZE (stored_args_map
)
1843 && bitmap_bit_p (stored_args_map
, i
+ k
))
1850 /* Do the register loads required for any wholly-register parms or any
1851 parms which are passed both on the stack and in a register. Their
1852 expressions were already evaluated.
1854 Mark all register-parms as living through the call, putting these USE
1855 insns in the CALL_INSN_FUNCTION_USAGE field.
1857 When IS_SIBCALL, perform the check_sibcall_argument_overlap
1858 checking, setting *SIBCALL_FAILURE if appropriate. */
1861 load_register_parameters (struct arg_data
*args
, int num_actuals
,
1862 rtx
*call_fusage
, int flags
, int is_sibcall
,
1863 int *sibcall_failure
)
1867 for (i
= 0; i
< num_actuals
; i
++)
1869 rtx reg
= ((flags
& ECF_SIBCALL
)
1870 ? args
[i
].tail_call_reg
: args
[i
].reg
);
1873 int partial
= args
[i
].partial
;
1876 rtx_insn
*before_arg
= get_last_insn ();
1877 /* Set non-negative if we must move a word at a time, even if
1878 just one word (e.g, partial == 4 && mode == DFmode). Set
1879 to -1 if we just use a normal move insn. This value can be
1880 zero if the argument is a zero size structure. */
1882 if (GET_CODE (reg
) == PARALLEL
)
1886 gcc_assert (partial
% UNITS_PER_WORD
== 0);
1887 nregs
= partial
/ UNITS_PER_WORD
;
1889 else if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
)
1891 size
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1892 nregs
= (size
+ (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
1895 size
= GET_MODE_SIZE (args
[i
].mode
);
1897 /* Handle calls that pass values in multiple non-contiguous
1898 locations. The Irix 6 ABI has examples of this. */
1900 if (GET_CODE (reg
) == PARALLEL
)
1901 emit_group_move (reg
, args
[i
].parallel_value
);
1903 /* If simple case, just do move. If normal partial, store_one_arg
1904 has already loaded the register for us. In all other cases,
1905 load the register(s) from memory. */
1907 else if (nregs
== -1)
1909 emit_move_insn (reg
, args
[i
].value
);
1910 #ifdef BLOCK_REG_PADDING
1911 /* Handle case where we have a value that needs shifting
1912 up to the msb. eg. a QImode value and we're padding
1913 upward on a BYTES_BIG_ENDIAN machine. */
1914 if (size
< UNITS_PER_WORD
1915 && (args
[i
].locate
.where_pad
1916 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
1919 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
1921 /* Assigning REG here rather than a temp makes CALL_FUSAGE
1922 report the whole reg as used. Strictly speaking, the
1923 call only uses SIZE bytes at the msb end, but it doesn't
1924 seem worth generating rtl to say that. */
1925 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
1926 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, shift
, reg
, 1);
1928 emit_move_insn (reg
, x
);
1933 /* If we have pre-computed the values to put in the registers in
1934 the case of non-aligned structures, copy them in now. */
1936 else if (args
[i
].n_aligned_regs
!= 0)
1937 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1938 emit_move_insn (gen_rtx_REG (word_mode
, REGNO (reg
) + j
),
1939 args
[i
].aligned_regs
[j
]);
1941 else if (partial
== 0 || args
[i
].pass_on_stack
)
1943 rtx mem
= validize_mem (copy_rtx (args
[i
].value
));
1945 /* Check for overlap with already clobbered argument area,
1946 providing that this has non-zero size. */
1949 || mem_overlaps_already_clobbered_arg_p
1950 (XEXP (args
[i
].value
, 0), size
)))
1951 *sibcall_failure
= 1;
1953 /* Handle a BLKmode that needs shifting. */
1954 if (nregs
== 1 && size
< UNITS_PER_WORD
1955 #ifdef BLOCK_REG_PADDING
1956 && args
[i
].locate
.where_pad
== downward
1962 rtx tem
= operand_subword_force (mem
, 0, args
[i
].mode
);
1963 rtx ri
= gen_rtx_REG (word_mode
, REGNO (reg
));
1964 rtx x
= gen_reg_rtx (word_mode
);
1965 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
1966 enum tree_code dir
= BYTES_BIG_ENDIAN
? RSHIFT_EXPR
1969 emit_move_insn (x
, tem
);
1970 x
= expand_shift (dir
, word_mode
, x
, shift
, ri
, 1);
1972 emit_move_insn (ri
, x
);
1975 move_block_to_reg (REGNO (reg
), mem
, nregs
, args
[i
].mode
);
1978 /* When a parameter is a block, and perhaps in other cases, it is
1979 possible that it did a load from an argument slot that was
1980 already clobbered. */
1982 && check_sibcall_argument_overlap (before_arg
, &args
[i
], 0))
1983 *sibcall_failure
= 1;
1985 /* Handle calls that pass values in multiple non-contiguous
1986 locations. The Irix 6 ABI has examples of this. */
1987 if (GET_CODE (reg
) == PARALLEL
)
1988 use_group_regs (call_fusage
, reg
);
1989 else if (nregs
== -1)
1990 use_reg_mode (call_fusage
, reg
,
1991 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)));
1993 use_regs (call_fusage
, REGNO (reg
), nregs
);
1998 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
1999 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
2000 bytes, then we would need to push some additional bytes to pad the
2001 arguments. So, we compute an adjust to the stack pointer for an
2002 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
2003 bytes. Then, when the arguments are pushed the stack will be perfectly
2004 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
2005 be popped after the call. Returns the adjustment. */
2008 combine_pending_stack_adjustment_and_call (int unadjusted_args_size
,
2009 struct args_size
*args_size
,
2010 unsigned int preferred_unit_stack_boundary
)
2012 /* The number of bytes to pop so that the stack will be
2013 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
2014 HOST_WIDE_INT adjustment
;
2015 /* The alignment of the stack after the arguments are pushed, if we
2016 just pushed the arguments without adjust the stack here. */
2017 unsigned HOST_WIDE_INT unadjusted_alignment
;
2019 unadjusted_alignment
2020 = ((stack_pointer_delta
+ unadjusted_args_size
)
2021 % preferred_unit_stack_boundary
);
2023 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
2024 as possible -- leaving just enough left to cancel out the
2025 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
2026 PENDING_STACK_ADJUST is non-negative, and congruent to
2027 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
2029 /* Begin by trying to pop all the bytes. */
2030 unadjusted_alignment
2031 = (unadjusted_alignment
2032 - (pending_stack_adjust
% preferred_unit_stack_boundary
));
2033 adjustment
= pending_stack_adjust
;
2034 /* Push enough additional bytes that the stack will be aligned
2035 after the arguments are pushed. */
2036 if (preferred_unit_stack_boundary
> 1)
2038 if (unadjusted_alignment
> 0)
2039 adjustment
-= preferred_unit_stack_boundary
- unadjusted_alignment
;
2041 adjustment
+= unadjusted_alignment
;
2044 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
2045 bytes after the call. The right number is the entire
2046 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
2047 by the arguments in the first place. */
2049 = pending_stack_adjust
- adjustment
+ unadjusted_args_size
;
2054 /* Scan X expression if it does not dereference any argument slots
2055 we already clobbered by tail call arguments (as noted in stored_args_map
2057 Return nonzero if X expression dereferences such argument slots,
2061 check_sibcall_argument_overlap_1 (rtx x
)
2070 code
= GET_CODE (x
);
2072 /* We need not check the operands of the CALL expression itself. */
2077 return mem_overlaps_already_clobbered_arg_p (XEXP (x
, 0),
2078 GET_MODE_SIZE (GET_MODE (x
)));
2080 /* Scan all subexpressions. */
2081 fmt
= GET_RTX_FORMAT (code
);
2082 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
2086 if (check_sibcall_argument_overlap_1 (XEXP (x
, i
)))
2089 else if (*fmt
== 'E')
2091 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2092 if (check_sibcall_argument_overlap_1 (XVECEXP (x
, i
, j
)))
2099 /* Scan sequence after INSN if it does not dereference any argument slots
2100 we already clobbered by tail call arguments (as noted in stored_args_map
2101 bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
2102 stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP
2103 should be 0). Return nonzero if sequence after INSN dereferences such argument
2104 slots, zero otherwise. */
2107 check_sibcall_argument_overlap (rtx_insn
*insn
, struct arg_data
*arg
,
2108 int mark_stored_args_map
)
2112 if (insn
== NULL_RTX
)
2113 insn
= get_insns ();
2115 insn
= NEXT_INSN (insn
);
2117 for (; insn
; insn
= NEXT_INSN (insn
))
2119 && check_sibcall_argument_overlap_1 (PATTERN (insn
)))
2122 if (mark_stored_args_map
)
2124 #ifdef ARGS_GROW_DOWNWARD
2125 low
= -arg
->locate
.slot_offset
.constant
- arg
->locate
.size
.constant
;
2127 low
= arg
->locate
.slot_offset
.constant
;
2130 for (high
= low
+ arg
->locate
.size
.constant
; low
< high
; low
++)
2131 bitmap_set_bit (stored_args_map
, low
);
2133 return insn
!= NULL_RTX
;
2136 /* Given that a function returns a value of mode MODE at the most
2137 significant end of hard register VALUE, shift VALUE left or right
2138 as specified by LEFT_P. Return true if some action was needed. */
2141 shift_return_value (enum machine_mode mode
, bool left_p
, rtx value
)
2143 HOST_WIDE_INT shift
;
2145 gcc_assert (REG_P (value
) && HARD_REGISTER_P (value
));
2146 shift
= GET_MODE_BITSIZE (GET_MODE (value
)) - GET_MODE_BITSIZE (mode
);
2150 /* Use ashr rather than lshr for right shifts. This is for the benefit
2151 of the MIPS port, which requires SImode values to be sign-extended
2152 when stored in 64-bit registers. */
2153 if (!force_expand_binop (GET_MODE (value
), left_p
? ashl_optab
: ashr_optab
,
2154 value
, GEN_INT (shift
), value
, 1, OPTAB_WIDEN
))
2159 /* If X is a likely-spilled register value, copy it to a pseudo
2160 register and return that register. Return X otherwise. */
2163 avoid_likely_spilled_reg (rtx x
)
2168 && HARD_REGISTER_P (x
)
2169 && targetm
.class_likely_spilled_p (REGNO_REG_CLASS (REGNO (x
))))
2171 /* Make sure that we generate a REG rather than a CONCAT.
2172 Moves into CONCATs can need nontrivial instructions,
2173 and the whole point of this function is to avoid
2174 using the hard register directly in such a situation. */
2175 generating_concat_p
= 0;
2176 new_rtx
= gen_reg_rtx (GET_MODE (x
));
2177 generating_concat_p
= 1;
2178 emit_move_insn (new_rtx
, x
);
2184 /* Generate all the code for a CALL_EXPR exp
2185 and return an rtx for its value.
2186 Store the value in TARGET (specified as an rtx) if convenient.
2187 If the value is stored in TARGET then TARGET is returned.
2188 If IGNORE is nonzero, then we ignore the value of the function call. */
2191 expand_call (tree exp
, rtx target
, int ignore
)
2193 /* Nonzero if we are currently expanding a call. */
2194 static int currently_expanding_call
= 0;
2196 /* RTX for the function to be called. */
2198 /* Sequence of insns to perform a normal "call". */
2199 rtx_insn
*normal_call_insns
= NULL
;
2200 /* Sequence of insns to perform a tail "call". */
2201 rtx_insn
*tail_call_insns
= NULL
;
2202 /* Data type of the function. */
2204 tree type_arg_types
;
2206 /* Declaration of the function being called,
2207 or 0 if the function is computed (not known by name). */
2209 /* The type of the function being called. */
2211 bool try_tail_call
= CALL_EXPR_TAILCALL (exp
);
2214 /* Register in which non-BLKmode value will be returned,
2215 or 0 if no value or if value is BLKmode. */
2217 /* Address where we should return a BLKmode value;
2218 0 if value not BLKmode. */
2219 rtx structure_value_addr
= 0;
2220 /* Nonzero if that address is being passed by treating it as
2221 an extra, implicit first parameter. Otherwise,
2222 it is passed by being copied directly into struct_value_rtx. */
2223 int structure_value_addr_parm
= 0;
2224 /* Holds the value of implicit argument for the struct value. */
2225 tree structure_value_addr_value
= NULL_TREE
;
2226 /* Size of aggregate value wanted, or zero if none wanted
2227 or if we are using the non-reentrant PCC calling convention
2228 or expecting the value in registers. */
2229 HOST_WIDE_INT struct_value_size
= 0;
2230 /* Nonzero if called function returns an aggregate in memory PCC style,
2231 by returning the address of where to find it. */
2232 int pcc_struct_value
= 0;
2233 rtx struct_value
= 0;
2235 /* Number of actual parameters in this call, including struct value addr. */
2237 /* Number of named args. Args after this are anonymous ones
2238 and they must all go on the stack. */
2240 /* Number of complex actual arguments that need to be split. */
2241 int num_complex_actuals
= 0;
2243 /* Vector of information about each argument.
2244 Arguments are numbered in the order they will be pushed,
2245 not the order they are written. */
2246 struct arg_data
*args
;
2248 /* Total size in bytes of all the stack-parms scanned so far. */
2249 struct args_size args_size
;
2250 struct args_size adjusted_args_size
;
2251 /* Size of arguments before any adjustments (such as rounding). */
2252 int unadjusted_args_size
;
2253 /* Data on reg parms scanned so far. */
2254 CUMULATIVE_ARGS args_so_far_v
;
2255 cumulative_args_t args_so_far
;
2256 /* Nonzero if a reg parm has been scanned. */
2258 /* Nonzero if this is an indirect function call. */
2260 /* Nonzero if we must avoid push-insns in the args for this call.
2261 If stack space is allocated for register parameters, but not by the
2262 caller, then it is preallocated in the fixed part of the stack frame.
2263 So the entire argument block must then be preallocated (i.e., we
2264 ignore PUSH_ROUNDING in that case). */
2266 int must_preallocate
= !PUSH_ARGS
;
2268 /* Size of the stack reserved for parameter registers. */
2269 int reg_parm_stack_space
= 0;
2271 /* Address of space preallocated for stack parms
2272 (on machines that lack push insns), or 0 if space not preallocated. */
2275 /* Mask of ECF_ and ERF_ flags. */
2277 int return_flags
= 0;
2278 #ifdef REG_PARM_STACK_SPACE
2279 /* Define the boundary of the register parm stack space that needs to be
2281 int low_to_save
, high_to_save
;
2282 rtx save_area
= 0; /* Place that it is saved */
2285 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
2286 char *initial_stack_usage_map
= stack_usage_map
;
2287 char *stack_usage_map_buf
= NULL
;
2289 int old_stack_allocated
;
2291 /* State variables to track stack modifications. */
2292 rtx old_stack_level
= 0;
2293 int old_stack_arg_under_construction
= 0;
2294 int old_pending_adj
= 0;
2295 int old_inhibit_defer_pop
= inhibit_defer_pop
;
2297 /* Some stack pointer alterations we make are performed via
2298 allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
2299 which we then also need to save/restore along the way. */
2300 int old_stack_pointer_delta
= 0;
2303 tree addr
= CALL_EXPR_FN (exp
);
2305 /* The alignment of the stack, in bits. */
2306 unsigned HOST_WIDE_INT preferred_stack_boundary
;
2307 /* The alignment of the stack, in bytes. */
2308 unsigned HOST_WIDE_INT preferred_unit_stack_boundary
;
2309 /* The static chain value to use for this call. */
2310 rtx static_chain_value
;
2311 /* See if this is "nothrow" function call. */
2312 if (TREE_NOTHROW (exp
))
2313 flags
|= ECF_NOTHROW
;
2315 /* See if we can find a DECL-node for the actual function, and get the
2316 function attributes (flags) from the function decl or type node. */
2317 fndecl
= get_callee_fndecl (exp
);
2320 fntype
= TREE_TYPE (fndecl
);
2321 flags
|= flags_from_decl_or_type (fndecl
);
2322 return_flags
|= decl_return_flags (fndecl
);
2326 fntype
= TREE_TYPE (TREE_TYPE (addr
));
2327 flags
|= flags_from_decl_or_type (fntype
);
2329 rettype
= TREE_TYPE (exp
);
2331 struct_value
= targetm
.calls
.struct_value_rtx (fntype
, 0);
2333 /* Warn if this value is an aggregate type,
2334 regardless of which calling convention we are using for it. */
2335 if (AGGREGATE_TYPE_P (rettype
))
2336 warning (OPT_Waggregate_return
, "function call has aggregate value");
2338 /* If the result of a non looping pure or const function call is
2339 ignored (or void), and none of its arguments are volatile, we can
2340 avoid expanding the call and just evaluate the arguments for
2342 if ((flags
& (ECF_CONST
| ECF_PURE
))
2343 && (!(flags
& ECF_LOOPING_CONST_OR_PURE
))
2344 && (ignore
|| target
== const0_rtx
2345 || TYPE_MODE (rettype
) == VOIDmode
))
2347 bool volatilep
= false;
2349 call_expr_arg_iterator iter
;
2351 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
2352 if (TREE_THIS_VOLATILE (arg
))
2360 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
2361 expand_expr (arg
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
2366 #ifdef REG_PARM_STACK_SPACE
2367 reg_parm_stack_space
= REG_PARM_STACK_SPACE (!fndecl
? fntype
: fndecl
);
2370 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
2371 && reg_parm_stack_space
> 0 && PUSH_ARGS
)
2372 must_preallocate
= 1;
2374 /* Set up a place to return a structure. */
2376 /* Cater to broken compilers. */
2377 if (aggregate_value_p (exp
, fntype
))
2379 /* This call returns a big structure. */
2380 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
2382 #ifdef PCC_STATIC_STRUCT_RETURN
2384 pcc_struct_value
= 1;
2386 #else /* not PCC_STATIC_STRUCT_RETURN */
2388 struct_value_size
= int_size_in_bytes (rettype
);
2390 if (target
&& MEM_P (target
) && CALL_EXPR_RETURN_SLOT_OPT (exp
))
2391 structure_value_addr
= XEXP (target
, 0);
2394 /* For variable-sized objects, we must be called with a target
2395 specified. If we were to allocate space on the stack here,
2396 we would have no way of knowing when to free it. */
2397 rtx d
= assign_temp (rettype
, 1, 1);
2398 structure_value_addr
= XEXP (d
, 0);
2402 #endif /* not PCC_STATIC_STRUCT_RETURN */
2405 /* Figure out the amount to which the stack should be aligned. */
2406 preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
2409 struct cgraph_rtl_info
*i
= cgraph_node::rtl_info (fndecl
);
2410 /* Without automatic stack alignment, we can't increase preferred
2411 stack boundary. With automatic stack alignment, it is
2412 unnecessary since unless we can guarantee that all callers will
2413 align the outgoing stack properly, callee has to align its
2416 && i
->preferred_incoming_stack_boundary
2417 && i
->preferred_incoming_stack_boundary
< preferred_stack_boundary
)
2418 preferred_stack_boundary
= i
->preferred_incoming_stack_boundary
;
2421 /* Operand 0 is a pointer-to-function; get the type of the function. */
2422 funtype
= TREE_TYPE (addr
);
2423 gcc_assert (POINTER_TYPE_P (funtype
));
2424 funtype
= TREE_TYPE (funtype
);
2426 /* Count whether there are actual complex arguments that need to be split
2427 into their real and imaginary parts. Munge the type_arg_types
2428 appropriately here as well. */
2429 if (targetm
.calls
.split_complex_arg
)
2431 call_expr_arg_iterator iter
;
2433 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
2435 tree type
= TREE_TYPE (arg
);
2436 if (type
&& TREE_CODE (type
) == COMPLEX_TYPE
2437 && targetm
.calls
.split_complex_arg (type
))
2438 num_complex_actuals
++;
2440 type_arg_types
= split_complex_types (TYPE_ARG_TYPES (funtype
));
2443 type_arg_types
= TYPE_ARG_TYPES (funtype
);
2445 if (flags
& ECF_MAY_BE_ALLOCA
)
2446 cfun
->calls_alloca
= 1;
2448 /* If struct_value_rtx is 0, it means pass the address
2449 as if it were an extra parameter. Put the argument expression
2450 in structure_value_addr_value. */
2451 if (structure_value_addr
&& struct_value
== 0)
2453 /* If structure_value_addr is a REG other than
2454 virtual_outgoing_args_rtx, we can use always use it. If it
2455 is not a REG, we must always copy it into a register.
2456 If it is virtual_outgoing_args_rtx, we must copy it to another
2457 register in some cases. */
2458 rtx temp
= (!REG_P (structure_value_addr
)
2459 || (ACCUMULATE_OUTGOING_ARGS
2460 && stack_arg_under_construction
2461 && structure_value_addr
== virtual_outgoing_args_rtx
)
2462 ? copy_addr_to_reg (convert_memory_address
2463 (Pmode
, structure_value_addr
))
2464 : structure_value_addr
);
2466 structure_value_addr_value
=
2467 make_tree (build_pointer_type (TREE_TYPE (funtype
)), temp
);
2468 structure_value_addr_parm
= 1;
2471 /* Count the arguments and set NUM_ACTUALS. */
2473 call_expr_nargs (exp
) + num_complex_actuals
+ structure_value_addr_parm
;
2475 /* Compute number of named args.
2476 First, do a raw count of the args for INIT_CUMULATIVE_ARGS. */
2478 if (type_arg_types
!= 0)
2480 = (list_length (type_arg_types
)
2481 /* Count the struct value address, if it is passed as a parm. */
2482 + structure_value_addr_parm
);
2484 /* If we know nothing, treat all args as named. */
2485 n_named_args
= num_actuals
;
2487 /* Start updating where the next arg would go.
2489 On some machines (such as the PA) indirect calls have a different
2490 calling convention than normal calls. The fourth argument in
2491 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
2493 INIT_CUMULATIVE_ARGS (args_so_far_v
, funtype
, NULL_RTX
, fndecl
, n_named_args
);
2494 args_so_far
= pack_cumulative_args (&args_so_far_v
);
2496 /* Now possibly adjust the number of named args.
2497 Normally, don't include the last named arg if anonymous args follow.
2498 We do include the last named arg if
2499 targetm.calls.strict_argument_naming() returns nonzero.
2500 (If no anonymous args follow, the result of list_length is actually
2501 one too large. This is harmless.)
2503 If targetm.calls.pretend_outgoing_varargs_named() returns
2504 nonzero, and targetm.calls.strict_argument_naming() returns zero,
2505 this machine will be able to place unnamed args that were passed
2506 in registers into the stack. So treat all args as named. This
2507 allows the insns emitting for a specific argument list to be
2508 independent of the function declaration.
2510 If targetm.calls.pretend_outgoing_varargs_named() returns zero,
2511 we do not have any reliable way to pass unnamed args in
2512 registers, so we must force them into memory. */
2514 if (type_arg_types
!= 0
2515 && targetm
.calls
.strict_argument_naming (args_so_far
))
2517 else if (type_arg_types
!= 0
2518 && ! targetm
.calls
.pretend_outgoing_varargs_named (args_so_far
))
2519 /* Don't include the last named arg. */
2522 /* Treat all args as named. */
2523 n_named_args
= num_actuals
;
2525 /* Make a vector to hold all the information about each arg. */
2526 args
= XALLOCAVEC (struct arg_data
, num_actuals
);
2527 memset (args
, 0, num_actuals
* sizeof (struct arg_data
));
2529 /* Build up entries in the ARGS array, compute the size of the
2530 arguments into ARGS_SIZE, etc. */
2531 initialize_argument_information (num_actuals
, args
, &args_size
,
2533 structure_value_addr_value
, fndecl
, fntype
,
2534 args_so_far
, reg_parm_stack_space
,
2535 &old_stack_level
, &old_pending_adj
,
2536 &must_preallocate
, &flags
,
2537 &try_tail_call
, CALL_FROM_THUNK_P (exp
));
2540 must_preallocate
= 1;
2542 /* Now make final decision about preallocating stack space. */
2543 must_preallocate
= finalize_must_preallocate (must_preallocate
,
2547 /* If the structure value address will reference the stack pointer, we
2548 must stabilize it. We don't need to do this if we know that we are
2549 not going to adjust the stack pointer in processing this call. */
2551 if (structure_value_addr
2552 && (reg_mentioned_p (virtual_stack_dynamic_rtx
, structure_value_addr
)
2553 || reg_mentioned_p (virtual_outgoing_args_rtx
,
2554 structure_value_addr
))
2556 || (!ACCUMULATE_OUTGOING_ARGS
&& args_size
.constant
)))
2557 structure_value_addr
= copy_to_reg (structure_value_addr
);
2559 /* Tail calls can make things harder to debug, and we've traditionally
2560 pushed these optimizations into -O2. Don't try if we're already
2561 expanding a call, as that means we're an argument. Don't try if
2562 there's cleanups, as we know there's code to follow the call. */
2564 if (currently_expanding_call
++ != 0
2565 || !flag_optimize_sibling_calls
2567 || dbg_cnt (tail_call
) == false)
2570 /* Rest of purposes for tail call optimizations to fail. */
2572 #ifdef HAVE_sibcall_epilogue
2573 !HAVE_sibcall_epilogue
2578 /* Doing sibling call optimization needs some work, since
2579 structure_value_addr can be allocated on the stack.
2580 It does not seem worth the effort since few optimizable
2581 sibling calls will return a structure. */
2582 || structure_value_addr
!= NULL_RTX
2583 #ifdef REG_PARM_STACK_SPACE
2584 /* If outgoing reg parm stack space changes, we can not do sibcall. */
2585 || (OUTGOING_REG_PARM_STACK_SPACE (funtype
)
2586 != OUTGOING_REG_PARM_STACK_SPACE (TREE_TYPE (current_function_decl
)))
2587 || (reg_parm_stack_space
!= REG_PARM_STACK_SPACE (current_function_decl
))
2589 /* Check whether the target is able to optimize the call
2591 || !targetm
.function_ok_for_sibcall (fndecl
, exp
)
2592 /* Functions that do not return exactly once may not be sibcall
2594 || (flags
& (ECF_RETURNS_TWICE
| ECF_NORETURN
))
2595 || TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (addr
)))
2596 /* If the called function is nested in the current one, it might access
2597 some of the caller's arguments, but could clobber them beforehand if
2598 the argument areas are shared. */
2599 || (fndecl
&& decl_function_context (fndecl
) == current_function_decl
)
2600 /* If this function requires more stack slots than the current
2601 function, we cannot change it into a sibling call.
2602 crtl->args.pretend_args_size is not part of the
2603 stack allocated by our caller. */
2604 || args_size
.constant
> (crtl
->args
.size
2605 - crtl
->args
.pretend_args_size
)
2606 /* If the callee pops its own arguments, then it must pop exactly
2607 the same number of arguments as the current function. */
2608 || (targetm
.calls
.return_pops_args (fndecl
, funtype
, args_size
.constant
)
2609 != targetm
.calls
.return_pops_args (current_function_decl
,
2610 TREE_TYPE (current_function_decl
),
2612 || !lang_hooks
.decls
.ok_for_sibcall (fndecl
))
2615 /* Check if caller and callee disagree in promotion of function
2619 enum machine_mode caller_mode
, caller_promoted_mode
;
2620 enum machine_mode callee_mode
, callee_promoted_mode
;
2621 int caller_unsignedp
, callee_unsignedp
;
2622 tree caller_res
= DECL_RESULT (current_function_decl
);
2624 caller_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (caller_res
));
2625 caller_mode
= DECL_MODE (caller_res
);
2626 callee_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (funtype
));
2627 callee_mode
= TYPE_MODE (TREE_TYPE (funtype
));
2628 caller_promoted_mode
2629 = promote_function_mode (TREE_TYPE (caller_res
), caller_mode
,
2631 TREE_TYPE (current_function_decl
), 1);
2632 callee_promoted_mode
2633 = promote_function_mode (TREE_TYPE (funtype
), callee_mode
,
2636 if (caller_mode
!= VOIDmode
2637 && (caller_promoted_mode
!= callee_promoted_mode
2638 || ((caller_mode
!= caller_promoted_mode
2639 || callee_mode
!= callee_promoted_mode
)
2640 && (caller_unsignedp
!= callee_unsignedp
2641 || GET_MODE_BITSIZE (caller_mode
)
2642 < GET_MODE_BITSIZE (callee_mode
)))))
2646 /* Ensure current function's preferred stack boundary is at least
2647 what we need. Stack alignment may also increase preferred stack
2649 if (crtl
->preferred_stack_boundary
< preferred_stack_boundary
)
2650 crtl
->preferred_stack_boundary
= preferred_stack_boundary
;
2652 preferred_stack_boundary
= crtl
->preferred_stack_boundary
;
2654 preferred_unit_stack_boundary
= preferred_stack_boundary
/ BITS_PER_UNIT
;
2656 /* We want to make two insn chains; one for a sibling call, the other
2657 for a normal call. We will select one of the two chains after
2658 initial RTL generation is complete. */
2659 for (pass
= try_tail_call
? 0 : 1; pass
< 2; pass
++)
2661 int sibcall_failure
= 0;
2662 /* We want to emit any pending stack adjustments before the tail
2663 recursion "call". That way we know any adjustment after the tail
2664 recursion call can be ignored if we indeed use the tail
2666 saved_pending_stack_adjust save
;
2667 rtx_insn
*insns
, *before_call
, *after_args
;
2672 /* State variables we need to save and restore between
2674 save_pending_stack_adjust (&save
);
2677 flags
&= ~ECF_SIBCALL
;
2679 flags
|= ECF_SIBCALL
;
2681 /* Other state variables that we must reinitialize each time
2682 through the loop (that are not initialized by the loop itself). */
2686 /* Start a new sequence for the normal call case.
2688 From this point on, if the sibling call fails, we want to set
2689 sibcall_failure instead of continuing the loop. */
2692 /* Don't let pending stack adjusts add up to too much.
2693 Also, do all pending adjustments now if there is any chance
2694 this might be a call to alloca or if we are expanding a sibling
2696 Also do the adjustments before a throwing call, otherwise
2697 exception handling can fail; PR 19225. */
2698 if (pending_stack_adjust
>= 32
2699 || (pending_stack_adjust
> 0
2700 && (flags
& ECF_MAY_BE_ALLOCA
))
2701 || (pending_stack_adjust
> 0
2702 && flag_exceptions
&& !(flags
& ECF_NOTHROW
))
2704 do_pending_stack_adjust ();
2706 /* Precompute any arguments as needed. */
2708 precompute_arguments (num_actuals
, args
);
2710 /* Now we are about to start emitting insns that can be deleted
2711 if a libcall is deleted. */
2712 if (pass
&& (flags
& ECF_MALLOC
))
2715 if (pass
== 0 && crtl
->stack_protect_guard
)
2716 stack_protect_epilogue ();
2718 adjusted_args_size
= args_size
;
2719 /* Compute the actual size of the argument block required. The variable
2720 and constant sizes must be combined, the size may have to be rounded,
2721 and there may be a minimum required size. When generating a sibcall
2722 pattern, do not round up, since we'll be re-using whatever space our
2724 unadjusted_args_size
2725 = compute_argument_block_size (reg_parm_stack_space
,
2726 &adjusted_args_size
,
2729 : preferred_stack_boundary
));
2731 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
2733 /* The argument block when performing a sibling call is the
2734 incoming argument block. */
2737 argblock
= crtl
->args
.internal_arg_pointer
;
2739 #ifdef STACK_GROWS_DOWNWARD
2740 = plus_constant (Pmode
, argblock
, crtl
->args
.pretend_args_size
);
2742 = plus_constant (Pmode
, argblock
, -crtl
->args
.pretend_args_size
);
2744 stored_args_map
= sbitmap_alloc (args_size
.constant
);
2745 bitmap_clear (stored_args_map
);
2748 /* If we have no actual push instructions, or shouldn't use them,
2749 make space for all args right now. */
2750 else if (adjusted_args_size
.var
!= 0)
2752 if (old_stack_level
== 0)
2754 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
2755 old_stack_pointer_delta
= stack_pointer_delta
;
2756 old_pending_adj
= pending_stack_adjust
;
2757 pending_stack_adjust
= 0;
2758 /* stack_arg_under_construction says whether a stack arg is
2759 being constructed at the old stack level. Pushing the stack
2760 gets a clean outgoing argument block. */
2761 old_stack_arg_under_construction
= stack_arg_under_construction
;
2762 stack_arg_under_construction
= 0;
2764 argblock
= push_block (ARGS_SIZE_RTX (adjusted_args_size
), 0, 0);
2765 if (flag_stack_usage_info
)
2766 current_function_has_unbounded_dynamic_stack_size
= 1;
2770 /* Note that we must go through the motions of allocating an argument
2771 block even if the size is zero because we may be storing args
2772 in the area reserved for register arguments, which may be part of
2775 int needed
= adjusted_args_size
.constant
;
2777 /* Store the maximum argument space used. It will be pushed by
2778 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
2781 if (needed
> crtl
->outgoing_args_size
)
2782 crtl
->outgoing_args_size
= needed
;
2784 if (must_preallocate
)
2786 if (ACCUMULATE_OUTGOING_ARGS
)
2788 /* Since the stack pointer will never be pushed, it is
2789 possible for the evaluation of a parm to clobber
2790 something we have already written to the stack.
2791 Since most function calls on RISC machines do not use
2792 the stack, this is uncommon, but must work correctly.
2794 Therefore, we save any area of the stack that was already
2795 written and that we are using. Here we set up to do this
2796 by making a new stack usage map from the old one. The
2797 actual save will be done by store_one_arg.
2799 Another approach might be to try to reorder the argument
2800 evaluations to avoid this conflicting stack usage. */
2802 /* Since we will be writing into the entire argument area,
2803 the map must be allocated for its entire size, not just
2804 the part that is the responsibility of the caller. */
2805 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
2806 needed
+= reg_parm_stack_space
;
2808 #ifdef ARGS_GROW_DOWNWARD
2809 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2812 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2815 free (stack_usage_map_buf
);
2816 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
2817 stack_usage_map
= stack_usage_map_buf
;
2819 if (initial_highest_arg_in_use
)
2820 memcpy (stack_usage_map
, initial_stack_usage_map
,
2821 initial_highest_arg_in_use
);
2823 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
2824 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
2825 (highest_outgoing_arg_in_use
2826 - initial_highest_arg_in_use
));
2829 /* The address of the outgoing argument list must not be
2830 copied to a register here, because argblock would be left
2831 pointing to the wrong place after the call to
2832 allocate_dynamic_stack_space below. */
2834 argblock
= virtual_outgoing_args_rtx
;
2838 if (inhibit_defer_pop
== 0)
2840 /* Try to reuse some or all of the pending_stack_adjust
2841 to get this space. */
2843 = (combine_pending_stack_adjustment_and_call
2844 (unadjusted_args_size
,
2845 &adjusted_args_size
,
2846 preferred_unit_stack_boundary
));
2848 /* combine_pending_stack_adjustment_and_call computes
2849 an adjustment before the arguments are allocated.
2850 Account for them and see whether or not the stack
2851 needs to go up or down. */
2852 needed
= unadjusted_args_size
- needed
;
2856 /* We're releasing stack space. */
2857 /* ??? We can avoid any adjustment at all if we're
2858 already aligned. FIXME. */
2859 pending_stack_adjust
= -needed
;
2860 do_pending_stack_adjust ();
2864 /* We need to allocate space. We'll do that in
2865 push_block below. */
2866 pending_stack_adjust
= 0;
2869 /* Special case this because overhead of `push_block' in
2870 this case is non-trivial. */
2872 argblock
= virtual_outgoing_args_rtx
;
2875 argblock
= push_block (GEN_INT (needed
), 0, 0);
2876 #ifdef ARGS_GROW_DOWNWARD
2877 argblock
= plus_constant (Pmode
, argblock
, needed
);
2881 /* We only really need to call `copy_to_reg' in the case
2882 where push insns are going to be used to pass ARGBLOCK
2883 to a function call in ARGS. In that case, the stack
2884 pointer changes value from the allocation point to the
2885 call point, and hence the value of
2886 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
2887 as well always do it. */
2888 argblock
= copy_to_reg (argblock
);
2893 if (ACCUMULATE_OUTGOING_ARGS
)
2895 /* The save/restore code in store_one_arg handles all
2896 cases except one: a constructor call (including a C
2897 function returning a BLKmode struct) to initialize
2899 if (stack_arg_under_construction
)
2902 = GEN_INT (adjusted_args_size
.constant
2903 + (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
2904 : TREE_TYPE (fndecl
))) ? 0
2905 : reg_parm_stack_space
));
2906 if (old_stack_level
== 0)
2908 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
2909 old_stack_pointer_delta
= stack_pointer_delta
;
2910 old_pending_adj
= pending_stack_adjust
;
2911 pending_stack_adjust
= 0;
2912 /* stack_arg_under_construction says whether a stack
2913 arg is being constructed at the old stack level.
2914 Pushing the stack gets a clean outgoing argument
2916 old_stack_arg_under_construction
2917 = stack_arg_under_construction
;
2918 stack_arg_under_construction
= 0;
2919 /* Make a new map for the new argument list. */
2920 free (stack_usage_map_buf
);
2921 stack_usage_map_buf
= XCNEWVEC (char, highest_outgoing_arg_in_use
);
2922 stack_usage_map
= stack_usage_map_buf
;
2923 highest_outgoing_arg_in_use
= 0;
2925 /* We can pass TRUE as the 4th argument because we just
2926 saved the stack pointer and will restore it right after
2928 allocate_dynamic_stack_space (push_size
, 0,
2929 BIGGEST_ALIGNMENT
, true);
2932 /* If argument evaluation might modify the stack pointer,
2933 copy the address of the argument list to a register. */
2934 for (i
= 0; i
< num_actuals
; i
++)
2935 if (args
[i
].pass_on_stack
)
2937 argblock
= copy_addr_to_reg (argblock
);
2942 compute_argument_addresses (args
, argblock
, num_actuals
);
2944 /* Perform stack alignment before the first push (the last arg). */
2946 && adjusted_args_size
.constant
> reg_parm_stack_space
2947 && adjusted_args_size
.constant
!= unadjusted_args_size
)
2949 /* When the stack adjustment is pending, we get better code
2950 by combining the adjustments. */
2951 if (pending_stack_adjust
2952 && ! inhibit_defer_pop
)
2954 pending_stack_adjust
2955 = (combine_pending_stack_adjustment_and_call
2956 (unadjusted_args_size
,
2957 &adjusted_args_size
,
2958 preferred_unit_stack_boundary
));
2959 do_pending_stack_adjust ();
2961 else if (argblock
== 0)
2962 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
2963 - unadjusted_args_size
));
2965 /* Now that the stack is properly aligned, pops can't safely
2966 be deferred during the evaluation of the arguments. */
2969 /* Record the maximum pushed stack space size. We need to delay
2970 doing it this far to take into account the optimization done
2971 by combine_pending_stack_adjustment_and_call. */
2972 if (flag_stack_usage_info
2973 && !ACCUMULATE_OUTGOING_ARGS
2975 && adjusted_args_size
.var
== 0)
2977 int pushed
= adjusted_args_size
.constant
+ pending_stack_adjust
;
2978 if (pushed
> current_function_pushed_stack_size
)
2979 current_function_pushed_stack_size
= pushed
;
2982 funexp
= rtx_for_function_call (fndecl
, addr
);
2984 /* Figure out the register where the value, if any, will come back. */
2986 if (TYPE_MODE (rettype
) != VOIDmode
2987 && ! structure_value_addr
)
2989 if (pcc_struct_value
)
2990 valreg
= hard_function_value (build_pointer_type (rettype
),
2991 fndecl
, NULL
, (pass
== 0));
2993 valreg
= hard_function_value (rettype
, fndecl
, fntype
,
2996 /* If VALREG is a PARALLEL whose first member has a zero
2997 offset, use that. This is for targets such as m68k that
2998 return the same value in multiple places. */
2999 if (GET_CODE (valreg
) == PARALLEL
)
3001 rtx elem
= XVECEXP (valreg
, 0, 0);
3002 rtx where
= XEXP (elem
, 0);
3003 rtx offset
= XEXP (elem
, 1);
3004 if (offset
== const0_rtx
3005 && GET_MODE (where
) == GET_MODE (valreg
))
3010 /* Precompute all register parameters. It isn't safe to compute anything
3011 once we have started filling any specific hard regs. */
3012 precompute_register_parameters (num_actuals
, args
, ®_parm_seen
);
3014 if (CALL_EXPR_STATIC_CHAIN (exp
))
3015 static_chain_value
= expand_normal (CALL_EXPR_STATIC_CHAIN (exp
));
3017 static_chain_value
= 0;
3019 #ifdef REG_PARM_STACK_SPACE
3020 /* Save the fixed argument area if it's part of the caller's frame and
3021 is clobbered by argument setup for this call. */
3022 if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
3023 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
3024 &low_to_save
, &high_to_save
);
3027 /* Now store (and compute if necessary) all non-register parms.
3028 These come before register parms, since they can require block-moves,
3029 which could clobber the registers used for register parms.
3030 Parms which have partial registers are not stored here,
3031 but we do preallocate space here if they want that. */
3033 for (i
= 0; i
< num_actuals
; i
++)
3035 if (args
[i
].reg
== 0 || args
[i
].pass_on_stack
)
3037 rtx_insn
*before_arg
= get_last_insn ();
3039 /* We don't allow passing huge (> 2^30 B) arguments
3040 by value. It would cause an overflow later on. */
3041 if (adjusted_args_size
.constant
3042 >= (1 << (HOST_BITS_PER_INT
- 2)))
3044 sorry ("passing too large argument on stack");
3048 if (store_one_arg (&args
[i
], argblock
, flags
,
3049 adjusted_args_size
.var
!= 0,
3050 reg_parm_stack_space
)
3052 && check_sibcall_argument_overlap (before_arg
,
3054 sibcall_failure
= 1;
3059 = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
3060 gen_rtx_USE (VOIDmode
, args
[i
].stack
),
3064 /* If we have a parm that is passed in registers but not in memory
3065 and whose alignment does not permit a direct copy into registers,
3066 make a group of pseudos that correspond to each register that we
3068 if (STRICT_ALIGNMENT
)
3069 store_unaligned_arguments_into_pseudos (args
, num_actuals
);
3071 /* Now store any partially-in-registers parm.
3072 This is the last place a block-move can happen. */
3074 for (i
= 0; i
< num_actuals
; i
++)
3075 if (args
[i
].partial
!= 0 && ! args
[i
].pass_on_stack
)
3077 rtx_insn
*before_arg
= get_last_insn ();
3079 if (store_one_arg (&args
[i
], argblock
, flags
,
3080 adjusted_args_size
.var
!= 0,
3081 reg_parm_stack_space
)
3083 && check_sibcall_argument_overlap (before_arg
,
3085 sibcall_failure
= 1;
3088 /* If register arguments require space on the stack and stack space
3089 was not preallocated, allocate stack space here for arguments
3090 passed in registers. */
3091 if (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
3092 && !ACCUMULATE_OUTGOING_ARGS
3093 && must_preallocate
== 0 && reg_parm_stack_space
> 0)
3094 anti_adjust_stack (GEN_INT (reg_parm_stack_space
));
3096 /* Pass the function the address in which to return a
3098 if (pass
!= 0 && structure_value_addr
&& ! structure_value_addr_parm
)
3100 structure_value_addr
3101 = convert_memory_address (Pmode
, structure_value_addr
);
3102 emit_move_insn (struct_value
,
3104 force_operand (structure_value_addr
,
3107 if (REG_P (struct_value
))
3108 use_reg (&call_fusage
, struct_value
);
3111 after_args
= get_last_insn ();
3112 funexp
= prepare_call_address (fndecl
, funexp
, static_chain_value
,
3113 &call_fusage
, reg_parm_seen
, pass
== 0);
3115 load_register_parameters (args
, num_actuals
, &call_fusage
, flags
,
3116 pass
== 0, &sibcall_failure
);
3118 /* Save a pointer to the last insn before the call, so that we can
3119 later safely search backwards to find the CALL_INSN. */
3120 before_call
= get_last_insn ();
3122 /* Set up next argument register. For sibling calls on machines
3123 with register windows this should be the incoming register. */
3125 next_arg_reg
= targetm
.calls
.function_incoming_arg (args_so_far
,
3130 next_arg_reg
= targetm
.calls
.function_arg (args_so_far
,
3131 VOIDmode
, void_type_node
,
3134 if (pass
== 1 && (return_flags
& ERF_RETURNS_ARG
))
3136 int arg_nr
= return_flags
& ERF_RETURN_ARG_MASK
;
3137 arg_nr
= num_actuals
- arg_nr
- 1;
3139 && arg_nr
< num_actuals
3143 && GET_MODE (args
[arg_nr
].reg
) == GET_MODE (valreg
))
3145 = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args
[arg_nr
].tree_value
)),
3146 gen_rtx_SET (VOIDmode
, valreg
, args
[arg_nr
].reg
),
3149 /* All arguments and registers used for the call must be set up by
3152 /* Stack must be properly aligned now. */
3154 || !(stack_pointer_delta
% preferred_unit_stack_boundary
));
3156 /* Generate the actual call instruction. */
3157 emit_call_1 (funexp
, exp
, fndecl
, funtype
, unadjusted_args_size
,
3158 adjusted_args_size
.constant
, struct_value_size
,
3159 next_arg_reg
, valreg
, old_inhibit_defer_pop
, call_fusage
,
3160 flags
, args_so_far
);
3162 if (flag_use_caller_save
)
3164 rtx_call_insn
*last
;
3165 rtx datum
= NULL_RTX
;
3166 if (fndecl
!= NULL_TREE
)
3168 datum
= XEXP (DECL_RTL (fndecl
), 0);
3169 gcc_assert (datum
!= NULL_RTX
3170 && GET_CODE (datum
) == SYMBOL_REF
);
3172 last
= last_call_insn ();
3173 add_reg_note (last
, REG_CALL_DECL
, datum
);
3176 /* If the call setup or the call itself overlaps with anything
3177 of the argument setup we probably clobbered our call address.
3178 In that case we can't do sibcalls. */
3180 && check_sibcall_argument_overlap (after_args
, 0, 0))
3181 sibcall_failure
= 1;
3183 /* If a non-BLKmode value is returned at the most significant end
3184 of a register, shift the register right by the appropriate amount
3185 and update VALREG accordingly. BLKmode values are handled by the
3186 group load/store machinery below. */
3187 if (!structure_value_addr
3188 && !pcc_struct_value
3189 && TYPE_MODE (rettype
) != VOIDmode
3190 && TYPE_MODE (rettype
) != BLKmode
3192 && targetm
.calls
.return_in_msb (rettype
))
3194 if (shift_return_value (TYPE_MODE (rettype
), false, valreg
))
3195 sibcall_failure
= 1;
3196 valreg
= gen_rtx_REG (TYPE_MODE (rettype
), REGNO (valreg
));
3199 if (pass
&& (flags
& ECF_MALLOC
))
3201 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
3202 rtx_insn
*last
, *insns
;
3204 /* The return value from a malloc-like function is a pointer. */
3205 if (TREE_CODE (rettype
) == POINTER_TYPE
)
3206 mark_reg_pointer (temp
, MALLOC_ABI_ALIGNMENT
);
3208 emit_move_insn (temp
, valreg
);
3210 /* The return value from a malloc-like function can not alias
3212 last
= get_last_insn ();
3213 add_reg_note (last
, REG_NOALIAS
, temp
);
3215 /* Write out the sequence. */
3216 insns
= get_insns ();
3222 /* For calls to `setjmp', etc., inform
3223 function.c:setjmp_warnings that it should complain if
3224 nonvolatile values are live. For functions that cannot
3225 return, inform flow that control does not fall through. */
3227 if ((flags
& ECF_NORETURN
) || pass
== 0)
3229 /* The barrier must be emitted
3230 immediately after the CALL_INSN. Some ports emit more
3231 than just a CALL_INSN above, so we must search for it here. */
3233 rtx_insn
*last
= get_last_insn ();
3234 while (!CALL_P (last
))
3236 last
= PREV_INSN (last
);
3237 /* There was no CALL_INSN? */
3238 gcc_assert (last
!= before_call
);
3241 emit_barrier_after (last
);
3243 /* Stack adjustments after a noreturn call are dead code.
3244 However when NO_DEFER_POP is in effect, we must preserve
3245 stack_pointer_delta. */
3246 if (inhibit_defer_pop
== 0)
3248 stack_pointer_delta
= old_stack_allocated
;
3249 pending_stack_adjust
= 0;
3253 /* If value type not void, return an rtx for the value. */
3255 if (TYPE_MODE (rettype
) == VOIDmode
3257 target
= const0_rtx
;
3258 else if (structure_value_addr
)
3260 if (target
== 0 || !MEM_P (target
))
3263 = gen_rtx_MEM (TYPE_MODE (rettype
),
3264 memory_address (TYPE_MODE (rettype
),
3265 structure_value_addr
));
3266 set_mem_attributes (target
, rettype
, 1);
3269 else if (pcc_struct_value
)
3271 /* This is the special C++ case where we need to
3272 know what the true target was. We take care to
3273 never use this value more than once in one expression. */
3274 target
= gen_rtx_MEM (TYPE_MODE (rettype
),
3275 copy_to_reg (valreg
));
3276 set_mem_attributes (target
, rettype
, 1);
3278 /* Handle calls that return values in multiple non-contiguous locations.
3279 The Irix 6 ABI has examples of this. */
3280 else if (GET_CODE (valreg
) == PARALLEL
)
3283 target
= emit_group_move_into_temps (valreg
);
3284 else if (rtx_equal_p (target
, valreg
))
3286 else if (GET_CODE (target
) == PARALLEL
)
3287 /* Handle the result of a emit_group_move_into_temps
3288 call in the previous pass. */
3289 emit_group_move (target
, valreg
);
3291 emit_group_store (target
, valreg
, rettype
,
3292 int_size_in_bytes (rettype
));
3295 && GET_MODE (target
) == TYPE_MODE (rettype
)
3296 && GET_MODE (target
) == GET_MODE (valreg
))
3298 bool may_overlap
= false;
3300 /* We have to copy a return value in a CLASS_LIKELY_SPILLED hard
3301 reg to a plain register. */
3302 if (!REG_P (target
) || HARD_REGISTER_P (target
))
3303 valreg
= avoid_likely_spilled_reg (valreg
);
3305 /* If TARGET is a MEM in the argument area, and we have
3306 saved part of the argument area, then we can't store
3307 directly into TARGET as it may get overwritten when we
3308 restore the argument save area below. Don't work too
3309 hard though and simply force TARGET to a register if it
3310 is a MEM; the optimizer is quite likely to sort it out. */
3311 if (ACCUMULATE_OUTGOING_ARGS
&& pass
&& MEM_P (target
))
3312 for (i
= 0; i
< num_actuals
; i
++)
3313 if (args
[i
].save_area
)
3320 target
= copy_to_reg (valreg
);
3323 /* TARGET and VALREG cannot be equal at this point
3324 because the latter would not have
3325 REG_FUNCTION_VALUE_P true, while the former would if
3326 it were referring to the same register.
3328 If they refer to the same register, this move will be
3329 a no-op, except when function inlining is being
3331 emit_move_insn (target
, valreg
);
3333 /* If we are setting a MEM, this code must be executed.
3334 Since it is emitted after the call insn, sibcall
3335 optimization cannot be performed in that case. */
3337 sibcall_failure
= 1;
3341 target
= copy_to_reg (avoid_likely_spilled_reg (valreg
));
3343 /* If we promoted this return value, make the proper SUBREG.
3344 TARGET might be const0_rtx here, so be careful. */
3346 && TYPE_MODE (rettype
) != BLKmode
3347 && GET_MODE (target
) != TYPE_MODE (rettype
))
3349 tree type
= rettype
;
3350 int unsignedp
= TYPE_UNSIGNED (type
);
3352 enum machine_mode pmode
;
3354 /* Ensure we promote as expected, and get the new unsignedness. */
3355 pmode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
3357 gcc_assert (GET_MODE (target
) == pmode
);
3359 if ((WORDS_BIG_ENDIAN
|| BYTES_BIG_ENDIAN
)
3360 && (GET_MODE_SIZE (GET_MODE (target
))
3361 > GET_MODE_SIZE (TYPE_MODE (type
))))
3363 offset
= GET_MODE_SIZE (GET_MODE (target
))
3364 - GET_MODE_SIZE (TYPE_MODE (type
));
3365 if (! BYTES_BIG_ENDIAN
)
3366 offset
= (offset
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
3367 else if (! WORDS_BIG_ENDIAN
)
3368 offset
%= UNITS_PER_WORD
;
3371 target
= gen_rtx_SUBREG (TYPE_MODE (type
), target
, offset
);
3372 SUBREG_PROMOTED_VAR_P (target
) = 1;
3373 SUBREG_PROMOTED_SET (target
, unsignedp
);
3376 /* If size of args is variable or this was a constructor call for a stack
3377 argument, restore saved stack-pointer value. */
3379 if (old_stack_level
)
3381 rtx_insn
*prev
= get_last_insn ();
3383 emit_stack_restore (SAVE_BLOCK
, old_stack_level
);
3384 stack_pointer_delta
= old_stack_pointer_delta
;
3386 fixup_args_size_notes (prev
, get_last_insn (), stack_pointer_delta
);
3388 pending_stack_adjust
= old_pending_adj
;
3389 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
3390 stack_arg_under_construction
= old_stack_arg_under_construction
;
3391 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
3392 stack_usage_map
= initial_stack_usage_map
;
3393 sibcall_failure
= 1;
3395 else if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
3397 #ifdef REG_PARM_STACK_SPACE
3399 restore_fixed_argument_area (save_area
, argblock
,
3400 high_to_save
, low_to_save
);
3403 /* If we saved any argument areas, restore them. */
3404 for (i
= 0; i
< num_actuals
; i
++)
3405 if (args
[i
].save_area
)
3407 enum machine_mode save_mode
= GET_MODE (args
[i
].save_area
);
3409 = gen_rtx_MEM (save_mode
,
3410 memory_address (save_mode
,
3411 XEXP (args
[i
].stack_slot
, 0)));
3413 if (save_mode
!= BLKmode
)
3414 emit_move_insn (stack_area
, args
[i
].save_area
);
3416 emit_block_move (stack_area
, args
[i
].save_area
,
3417 GEN_INT (args
[i
].locate
.size
.constant
),
3418 BLOCK_OP_CALL_PARM
);
3421 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
3422 stack_usage_map
= initial_stack_usage_map
;
3425 /* If this was alloca, record the new stack level for nonlocal gotos.
3426 Check for the handler slots since we might not have a save area
3427 for non-local gotos. */
3429 if ((flags
& ECF_MAY_BE_ALLOCA
) && cfun
->nonlocal_goto_save_area
!= 0)
3430 update_nonlocal_goto_save_area ();
3432 /* Free up storage we no longer need. */
3433 for (i
= 0; i
< num_actuals
; ++i
)
3434 free (args
[i
].aligned_regs
);
3436 insns
= get_insns ();
3441 tail_call_insns
= insns
;
3443 /* Restore the pending stack adjustment now that we have
3444 finished generating the sibling call sequence. */
3446 restore_pending_stack_adjust (&save
);
3448 /* Prepare arg structure for next iteration. */
3449 for (i
= 0; i
< num_actuals
; i
++)
3452 args
[i
].aligned_regs
= 0;
3456 sbitmap_free (stored_args_map
);
3457 internal_arg_pointer_exp_state
.scan_start
= NULL
;
3458 internal_arg_pointer_exp_state
.cache
.release ();
3462 normal_call_insns
= insns
;
3464 /* Verify that we've deallocated all the stack we used. */
3465 gcc_assert ((flags
& ECF_NORETURN
)
3466 || (old_stack_allocated
3467 == stack_pointer_delta
- pending_stack_adjust
));
3470 /* If something prevents making this a sibling call,
3471 zero out the sequence. */
3472 if (sibcall_failure
)
3473 tail_call_insns
= NULL
;
3478 /* If tail call production succeeded, we need to remove REG_EQUIV notes on
3479 arguments too, as argument area is now clobbered by the call. */
3480 if (tail_call_insns
)
3482 emit_insn (tail_call_insns
);
3483 crtl
->tail_call_emit
= true;
3486 emit_insn (normal_call_insns
);
3488 currently_expanding_call
--;
3490 free (stack_usage_map_buf
);
3495 /* A sibling call sequence invalidates any REG_EQUIV notes made for
3496 this function's incoming arguments.
3498 At the start of RTL generation we know the only REG_EQUIV notes
3499 in the rtl chain are those for incoming arguments, so we can look
3500 for REG_EQUIV notes between the start of the function and the
3501 NOTE_INSN_FUNCTION_BEG.
3503 This is (slight) overkill. We could keep track of the highest
3504 argument we clobber and be more selective in removing notes, but it
3505 does not seem to be worth the effort. */
3508 fixup_tail_calls (void)
3512 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3516 /* There are never REG_EQUIV notes for the incoming arguments
3517 after the NOTE_INSN_FUNCTION_BEG note, so stop if we see it. */
3519 && NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
)
3522 note
= find_reg_note (insn
, REG_EQUIV
, 0);
3524 remove_note (insn
, note
);
3525 note
= find_reg_note (insn
, REG_EQUIV
, 0);
3530 /* Traverse a list of TYPES and expand all complex types into their
3533 split_complex_types (tree types
)
3537 /* Before allocating memory, check for the common case of no complex. */
3538 for (p
= types
; p
; p
= TREE_CHAIN (p
))
3540 tree type
= TREE_VALUE (p
);
3541 if (TREE_CODE (type
) == COMPLEX_TYPE
3542 && targetm
.calls
.split_complex_arg (type
))
3548 types
= copy_list (types
);
3550 for (p
= types
; p
; p
= TREE_CHAIN (p
))
3552 tree complex_type
= TREE_VALUE (p
);
3554 if (TREE_CODE (complex_type
) == COMPLEX_TYPE
3555 && targetm
.calls
.split_complex_arg (complex_type
))
3559 /* Rewrite complex type with component type. */
3560 TREE_VALUE (p
) = TREE_TYPE (complex_type
);
3561 next
= TREE_CHAIN (p
);
3563 /* Add another component type for the imaginary part. */
3564 imag
= build_tree_list (NULL_TREE
, TREE_VALUE (p
));
3565 TREE_CHAIN (p
) = imag
;
3566 TREE_CHAIN (imag
) = next
;
3568 /* Skip the newly created node. */
3576 /* Output a library call to function FUN (a SYMBOL_REF rtx).
3577 The RETVAL parameter specifies whether return value needs to be saved, other
3578 parameters are documented in the emit_library_call function below. */
3581 emit_library_call_value_1 (int retval
, rtx orgfun
, rtx value
,
3582 enum libcall_type fn_type
,
3583 enum machine_mode outmode
, int nargs
, va_list p
)
3585 /* Total size in bytes of all the stack-parms scanned so far. */
3586 struct args_size args_size
;
3587 /* Size of arguments before any adjustments (such as rounding). */
3588 struct args_size original_args_size
;
3591 /* Todo, choose the correct decl type of orgfun. Sadly this information
3592 isn't present here, so we default to native calling abi here. */
3593 tree fndecl ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
3594 tree fntype ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
3597 CUMULATIVE_ARGS args_so_far_v
;
3598 cumulative_args_t args_so_far
;
3602 enum machine_mode mode
;
3605 struct locate_and_pad_arg_data locate
;
3609 int old_inhibit_defer_pop
= inhibit_defer_pop
;
3610 rtx call_fusage
= 0;
3613 int pcc_struct_value
= 0;
3614 int struct_value_size
= 0;
3616 int reg_parm_stack_space
= 0;
3618 rtx_insn
*before_call
;
3619 tree tfom
; /* type_for_mode (outmode, 0) */
3621 #ifdef REG_PARM_STACK_SPACE
3622 /* Define the boundary of the register parm stack space that needs to be
3624 int low_to_save
= 0, high_to_save
= 0;
3625 rtx save_area
= 0; /* Place that it is saved. */
3628 /* Size of the stack reserved for parameter registers. */
3629 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
3630 char *initial_stack_usage_map
= stack_usage_map
;
3631 char *stack_usage_map_buf
= NULL
;
3633 rtx struct_value
= targetm
.calls
.struct_value_rtx (0, 0);
3635 #ifdef REG_PARM_STACK_SPACE
3636 reg_parm_stack_space
= REG_PARM_STACK_SPACE ((tree
) 0);
3639 /* By default, library functions can not throw. */
3640 flags
= ECF_NOTHROW
;
3653 flags
|= ECF_NORETURN
;
3656 flags
= ECF_NORETURN
;
3658 case LCT_RETURNS_TWICE
:
3659 flags
= ECF_RETURNS_TWICE
;
3664 /* Ensure current function's preferred stack boundary is at least
3666 if (crtl
->preferred_stack_boundary
< PREFERRED_STACK_BOUNDARY
)
3667 crtl
->preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
3669 /* If this kind of value comes back in memory,
3670 decide where in memory it should come back. */
3671 if (outmode
!= VOIDmode
)
3673 tfom
= lang_hooks
.types
.type_for_mode (outmode
, 0);
3674 if (aggregate_value_p (tfom
, 0))
3676 #ifdef PCC_STATIC_STRUCT_RETURN
3678 = hard_function_value (build_pointer_type (tfom
), 0, 0, 0);
3679 mem_value
= gen_rtx_MEM (outmode
, pointer_reg
);
3680 pcc_struct_value
= 1;
3682 value
= gen_reg_rtx (outmode
);
3683 #else /* not PCC_STATIC_STRUCT_RETURN */
3684 struct_value_size
= GET_MODE_SIZE (outmode
);
3685 if (value
!= 0 && MEM_P (value
))
3688 mem_value
= assign_temp (tfom
, 1, 1);
3690 /* This call returns a big structure. */
3691 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
3695 tfom
= void_type_node
;
3697 /* ??? Unfinished: must pass the memory address as an argument. */
3699 /* Copy all the libcall-arguments out of the varargs data
3700 and into a vector ARGVEC.
3702 Compute how to pass each argument. We only support a very small subset
3703 of the full argument passing conventions to limit complexity here since
3704 library functions shouldn't have many args. */
3706 argvec
= XALLOCAVEC (struct arg
, nargs
+ 1);
3707 memset (argvec
, 0, (nargs
+ 1) * sizeof (struct arg
));
3709 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
3710 INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far_v
, outmode
, fun
);
3712 INIT_CUMULATIVE_ARGS (args_so_far_v
, NULL_TREE
, fun
, 0, nargs
);
3714 args_so_far
= pack_cumulative_args (&args_so_far_v
);
3716 args_size
.constant
= 0;
3723 /* If there's a structure value address to be passed,
3724 either pass it in the special place, or pass it as an extra argument. */
3725 if (mem_value
&& struct_value
== 0 && ! pcc_struct_value
)
3727 rtx addr
= XEXP (mem_value
, 0);
3731 /* Make sure it is a reasonable operand for a move or push insn. */
3732 if (!REG_P (addr
) && !MEM_P (addr
)
3733 && !(CONSTANT_P (addr
)
3734 && targetm
.legitimate_constant_p (Pmode
, addr
)))
3735 addr
= force_operand (addr
, NULL_RTX
);
3737 argvec
[count
].value
= addr
;
3738 argvec
[count
].mode
= Pmode
;
3739 argvec
[count
].partial
= 0;
3741 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
,
3742 Pmode
, NULL_TREE
, true);
3743 gcc_assert (targetm
.calls
.arg_partial_bytes (args_so_far
, Pmode
,
3744 NULL_TREE
, 1) == 0);
3746 locate_and_pad_parm (Pmode
, NULL_TREE
,
3747 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3750 argvec
[count
].reg
!= 0,
3752 reg_parm_stack_space
, 0,
3753 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
3755 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
3756 || reg_parm_stack_space
> 0)
3757 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
3759 targetm
.calls
.function_arg_advance (args_so_far
, Pmode
, (tree
) 0, true);
3764 for (; count
< nargs
; count
++)
3766 rtx val
= va_arg (p
, rtx
);
3767 enum machine_mode mode
= (enum machine_mode
) va_arg (p
, int);
3770 /* We cannot convert the arg value to the mode the library wants here;
3771 must do it earlier where we know the signedness of the arg. */
3772 gcc_assert (mode
!= BLKmode
3773 && (GET_MODE (val
) == mode
|| GET_MODE (val
) == VOIDmode
));
3775 /* Make sure it is a reasonable operand for a move or push insn. */
3776 if (!REG_P (val
) && !MEM_P (val
)
3777 && !(CONSTANT_P (val
) && targetm
.legitimate_constant_p (mode
, val
)))
3778 val
= force_operand (val
, NULL_RTX
);
3780 if (pass_by_reference (&args_so_far_v
, mode
, NULL_TREE
, 1))
3784 = !reference_callee_copied (&args_so_far_v
, mode
, NULL_TREE
, 1);
3786 /* If this was a CONST function, it is now PURE since it now
3788 if (flags
& ECF_CONST
)
3790 flags
&= ~ECF_CONST
;
3794 if (MEM_P (val
) && !must_copy
)
3796 tree val_expr
= MEM_EXPR (val
);
3798 mark_addressable (val_expr
);
3803 slot
= assign_temp (lang_hooks
.types
.type_for_mode (mode
, 0),
3805 emit_move_insn (slot
, val
);
3808 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3809 gen_rtx_USE (VOIDmode
, slot
),
3812 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3813 gen_rtx_CLOBBER (VOIDmode
,
3818 val
= force_operand (XEXP (slot
, 0), NULL_RTX
);
3821 mode
= promote_function_mode (NULL_TREE
, mode
, &unsigned_p
, NULL_TREE
, 0);
3822 argvec
[count
].mode
= mode
;
3823 argvec
[count
].value
= convert_modes (mode
, GET_MODE (val
), val
, unsigned_p
);
3824 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
3827 argvec
[count
].partial
3828 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, NULL_TREE
, 1);
3830 if (argvec
[count
].reg
== 0
3831 || argvec
[count
].partial
!= 0
3832 || reg_parm_stack_space
> 0)
3834 locate_and_pad_parm (mode
, NULL_TREE
,
3835 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3838 argvec
[count
].reg
!= 0,
3840 reg_parm_stack_space
, argvec
[count
].partial
,
3841 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
3842 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
3843 gcc_assert (!argvec
[count
].locate
.size
.var
);
3845 #ifdef BLOCK_REG_PADDING
3847 /* The argument is passed entirely in registers. See at which
3848 end it should be padded. */
3849 argvec
[count
].locate
.where_pad
=
3850 BLOCK_REG_PADDING (mode
, NULL_TREE
,
3851 GET_MODE_SIZE (mode
) <= UNITS_PER_WORD
);
3854 targetm
.calls
.function_arg_advance (args_so_far
, mode
, (tree
) 0, true);
3857 /* If this machine requires an external definition for library
3858 functions, write one out. */
3859 assemble_external_libcall (fun
);
3861 original_args_size
= args_size
;
3862 args_size
.constant
= (((args_size
.constant
3863 + stack_pointer_delta
3867 - stack_pointer_delta
);
3869 args_size
.constant
= MAX (args_size
.constant
,
3870 reg_parm_stack_space
);
3872 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
3873 args_size
.constant
-= reg_parm_stack_space
;
3875 if (args_size
.constant
> crtl
->outgoing_args_size
)
3876 crtl
->outgoing_args_size
= args_size
.constant
;
3878 if (flag_stack_usage_info
&& !ACCUMULATE_OUTGOING_ARGS
)
3880 int pushed
= args_size
.constant
+ pending_stack_adjust
;
3881 if (pushed
> current_function_pushed_stack_size
)
3882 current_function_pushed_stack_size
= pushed
;
3885 if (ACCUMULATE_OUTGOING_ARGS
)
3887 /* Since the stack pointer will never be pushed, it is possible for
3888 the evaluation of a parm to clobber something we have already
3889 written to the stack. Since most function calls on RISC machines
3890 do not use the stack, this is uncommon, but must work correctly.
3892 Therefore, we save any area of the stack that was already written
3893 and that we are using. Here we set up to do this by making a new
3894 stack usage map from the old one.
3896 Another approach might be to try to reorder the argument
3897 evaluations to avoid this conflicting stack usage. */
3899 needed
= args_size
.constant
;
3901 /* Since we will be writing into the entire argument area, the
3902 map must be allocated for its entire size, not just the part that
3903 is the responsibility of the caller. */
3904 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
3905 needed
+= reg_parm_stack_space
;
3907 #ifdef ARGS_GROW_DOWNWARD
3908 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
3911 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
3914 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
3915 stack_usage_map
= stack_usage_map_buf
;
3917 if (initial_highest_arg_in_use
)
3918 memcpy (stack_usage_map
, initial_stack_usage_map
,
3919 initial_highest_arg_in_use
);
3921 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
3922 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
3923 highest_outgoing_arg_in_use
- initial_highest_arg_in_use
);
3926 /* We must be careful to use virtual regs before they're instantiated,
3927 and real regs afterwards. Loop optimization, for example, can create
3928 new libcalls after we've instantiated the virtual regs, and if we
3929 use virtuals anyway, they won't match the rtl patterns. */
3931 if (virtuals_instantiated
)
3932 argblock
= plus_constant (Pmode
, stack_pointer_rtx
,
3933 STACK_POINTER_OFFSET
);
3935 argblock
= virtual_outgoing_args_rtx
;
3940 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
3943 /* We push args individually in reverse order, perform stack alignment
3944 before the first push (the last arg). */
3946 anti_adjust_stack (GEN_INT (args_size
.constant
3947 - original_args_size
.constant
));
3951 #ifdef REG_PARM_STACK_SPACE
3952 if (ACCUMULATE_OUTGOING_ARGS
)
3954 /* The argument list is the property of the called routine and it
3955 may clobber it. If the fixed area has been used for previous
3956 parameters, we must save and restore it. */
3957 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
3958 &low_to_save
, &high_to_save
);
3962 /* Push the args that need to be pushed. */
3964 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3965 are to be pushed. */
3966 for (count
= 0; count
< nargs
; count
++, argnum
--)
3968 enum machine_mode mode
= argvec
[argnum
].mode
;
3969 rtx val
= argvec
[argnum
].value
;
3970 rtx reg
= argvec
[argnum
].reg
;
3971 int partial
= argvec
[argnum
].partial
;
3972 unsigned int parm_align
= argvec
[argnum
].locate
.boundary
;
3973 int lower_bound
= 0, upper_bound
= 0, i
;
3975 if (! (reg
!= 0 && partial
== 0))
3979 if (ACCUMULATE_OUTGOING_ARGS
)
3981 /* If this is being stored into a pre-allocated, fixed-size,
3982 stack area, save any previous data at that location. */
3984 #ifdef ARGS_GROW_DOWNWARD
3985 /* stack_slot is negative, but we want to index stack_usage_map
3986 with positive values. */
3987 upper_bound
= -argvec
[argnum
].locate
.slot_offset
.constant
+ 1;
3988 lower_bound
= upper_bound
- argvec
[argnum
].locate
.size
.constant
;
3990 lower_bound
= argvec
[argnum
].locate
.slot_offset
.constant
;
3991 upper_bound
= lower_bound
+ argvec
[argnum
].locate
.size
.constant
;
3995 /* Don't worry about things in the fixed argument area;
3996 it has already been saved. */
3997 if (i
< reg_parm_stack_space
)
3998 i
= reg_parm_stack_space
;
3999 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
4002 if (i
< upper_bound
)
4004 /* We need to make a save area. */
4006 = argvec
[argnum
].locate
.size
.constant
* BITS_PER_UNIT
;
4007 enum machine_mode save_mode
4008 = mode_for_size (size
, MODE_INT
, 1);
4010 = plus_constant (Pmode
, argblock
,
4011 argvec
[argnum
].locate
.offset
.constant
);
4013 = gen_rtx_MEM (save_mode
, memory_address (save_mode
, adr
));
4015 if (save_mode
== BLKmode
)
4017 argvec
[argnum
].save_area
4018 = assign_stack_temp (BLKmode
,
4019 argvec
[argnum
].locate
.size
.constant
4022 emit_block_move (validize_mem
4023 (copy_rtx (argvec
[argnum
].save_area
)),
4025 GEN_INT (argvec
[argnum
].locate
.size
.constant
),
4026 BLOCK_OP_CALL_PARM
);
4030 argvec
[argnum
].save_area
= gen_reg_rtx (save_mode
);
4032 emit_move_insn (argvec
[argnum
].save_area
, stack_area
);
4037 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, parm_align
,
4038 partial
, reg
, 0, argblock
,
4039 GEN_INT (argvec
[argnum
].locate
.offset
.constant
),
4040 reg_parm_stack_space
,
4041 ARGS_SIZE_RTX (argvec
[argnum
].locate
.alignment_pad
));
4043 /* Now mark the segment we just used. */
4044 if (ACCUMULATE_OUTGOING_ARGS
)
4045 for (i
= lower_bound
; i
< upper_bound
; i
++)
4046 stack_usage_map
[i
] = 1;
4050 /* Indicate argument access so that alias.c knows that these
4053 use
= plus_constant (Pmode
, argblock
,
4054 argvec
[argnum
].locate
.offset
.constant
);
4056 /* When arguments are pushed, trying to tell alias.c where
4057 exactly this argument is won't work, because the
4058 auto-increment causes confusion. So we merely indicate
4059 that we access something with a known mode somewhere on
4061 use
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
4062 gen_rtx_SCRATCH (Pmode
));
4063 use
= gen_rtx_MEM (argvec
[argnum
].mode
, use
);
4064 use
= gen_rtx_USE (VOIDmode
, use
);
4065 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
, use
, call_fusage
);
4071 fun
= prepare_call_address (NULL
, fun
, NULL
, &call_fusage
, 0, 0);
4073 /* Now load any reg parms into their regs. */
4075 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4076 are to be pushed. */
4077 for (count
= 0; count
< nargs
; count
++, argnum
--)
4079 enum machine_mode mode
= argvec
[argnum
].mode
;
4080 rtx val
= argvec
[argnum
].value
;
4081 rtx reg
= argvec
[argnum
].reg
;
4082 int partial
= argvec
[argnum
].partial
;
4083 #ifdef BLOCK_REG_PADDING
4087 /* Handle calls that pass values in multiple non-contiguous
4088 locations. The PA64 has examples of this for library calls. */
4089 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4090 emit_group_load (reg
, val
, NULL_TREE
, GET_MODE_SIZE (mode
));
4091 else if (reg
!= 0 && partial
== 0)
4093 emit_move_insn (reg
, val
);
4094 #ifdef BLOCK_REG_PADDING
4095 size
= GET_MODE_SIZE (argvec
[argnum
].mode
);
4097 /* Copied from load_register_parameters. */
4099 /* Handle case where we have a value that needs shifting
4100 up to the msb. eg. a QImode value and we're padding
4101 upward on a BYTES_BIG_ENDIAN machine. */
4102 if (size
< UNITS_PER_WORD
4103 && (argvec
[argnum
].locate
.where_pad
4104 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
4107 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
4109 /* Assigning REG here rather than a temp makes CALL_FUSAGE
4110 report the whole reg as used. Strictly speaking, the
4111 call only uses SIZE bytes at the msb end, but it doesn't
4112 seem worth generating rtl to say that. */
4113 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
4114 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, shift
, reg
, 1);
4116 emit_move_insn (reg
, x
);
4124 /* Any regs containing parms remain in use through the call. */
4125 for (count
= 0; count
< nargs
; count
++)
4127 rtx reg
= argvec
[count
].reg
;
4128 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4129 use_group_regs (&call_fusage
, reg
);
4132 int partial
= argvec
[count
].partial
;
4136 gcc_assert (partial
% UNITS_PER_WORD
== 0);
4137 nregs
= partial
/ UNITS_PER_WORD
;
4138 use_regs (&call_fusage
, REGNO (reg
), nregs
);
4141 use_reg (&call_fusage
, reg
);
4145 /* Pass the function the address in which to return a structure value. */
4146 if (mem_value
!= 0 && struct_value
!= 0 && ! pcc_struct_value
)
4148 emit_move_insn (struct_value
,
4150 force_operand (XEXP (mem_value
, 0),
4152 if (REG_P (struct_value
))
4153 use_reg (&call_fusage
, struct_value
);
4156 /* Don't allow popping to be deferred, since then
4157 cse'ing of library calls could delete a call and leave the pop. */
4159 valreg
= (mem_value
== 0 && outmode
!= VOIDmode
4160 ? hard_libcall_value (outmode
, orgfun
) : NULL_RTX
);
4162 /* Stack must be properly aligned now. */
4163 gcc_assert (!(stack_pointer_delta
4164 & (PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
- 1)));
4166 before_call
= get_last_insn ();
4168 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4169 will set inhibit_defer_pop to that value. */
4170 /* The return type is needed to decide how many bytes the function pops.
4171 Signedness plays no role in that, so for simplicity, we pretend it's
4172 always signed. We also assume that the list of arguments passed has
4173 no impact, so we pretend it is unknown. */
4175 emit_call_1 (fun
, NULL
,
4176 get_identifier (XSTR (orgfun
, 0)),
4177 build_function_type (tfom
, NULL_TREE
),
4178 original_args_size
.constant
, args_size
.constant
,
4180 targetm
.calls
.function_arg (args_so_far
,
4181 VOIDmode
, void_type_node
, true),
4183 old_inhibit_defer_pop
+ 1, call_fusage
, flags
, args_so_far
);
4185 if (flag_use_caller_save
)
4187 rtx last
, datum
= orgfun
;
4188 gcc_assert (GET_CODE (datum
) == SYMBOL_REF
);
4189 last
= last_call_insn ();
4190 add_reg_note (last
, REG_CALL_DECL
, datum
);
4193 /* Right-shift returned value if necessary. */
4194 if (!pcc_struct_value
4195 && TYPE_MODE (tfom
) != BLKmode
4196 && targetm
.calls
.return_in_msb (tfom
))
4198 shift_return_value (TYPE_MODE (tfom
), false, valreg
);
4199 valreg
= gen_rtx_REG (TYPE_MODE (tfom
), REGNO (valreg
));
4202 /* For calls to `setjmp', etc., inform function.c:setjmp_warnings
4203 that it should complain if nonvolatile values are live. For
4204 functions that cannot return, inform flow that control does not
4206 if (flags
& ECF_NORETURN
)
4208 /* The barrier note must be emitted
4209 immediately after the CALL_INSN. Some ports emit more than
4210 just a CALL_INSN above, so we must search for it here. */
4211 rtx_insn
*last
= get_last_insn ();
4212 while (!CALL_P (last
))
4214 last
= PREV_INSN (last
);
4215 /* There was no CALL_INSN? */
4216 gcc_assert (last
!= before_call
);
4219 emit_barrier_after (last
);
4222 /* Consider that "regular" libcalls, i.e. all of them except for LCT_THROW
4223 and LCT_RETURNS_TWICE, cannot perform non-local gotos. */
4224 if (flags
& ECF_NOTHROW
)
4226 rtx_insn
*last
= get_last_insn ();
4227 while (!CALL_P (last
))
4229 last
= PREV_INSN (last
);
4230 /* There was no CALL_INSN? */
4231 gcc_assert (last
!= before_call
);
4234 make_reg_eh_region_note_nothrow_nononlocal (last
);
4237 /* Now restore inhibit_defer_pop to its actual original value. */
4242 /* Copy the value to the right place. */
4243 if (outmode
!= VOIDmode
&& retval
)
4249 if (value
!= mem_value
)
4250 emit_move_insn (value
, mem_value
);
4252 else if (GET_CODE (valreg
) == PARALLEL
)
4255 value
= gen_reg_rtx (outmode
);
4256 emit_group_store (value
, valreg
, NULL_TREE
, GET_MODE_SIZE (outmode
));
4260 /* Convert to the proper mode if a promotion has been active. */
4261 if (GET_MODE (valreg
) != outmode
)
4263 int unsignedp
= TYPE_UNSIGNED (tfom
);
4265 gcc_assert (promote_function_mode (tfom
, outmode
, &unsignedp
,
4266 fndecl
? TREE_TYPE (fndecl
) : fntype
, 1)
4267 == GET_MODE (valreg
));
4268 valreg
= convert_modes (outmode
, GET_MODE (valreg
), valreg
, 0);
4272 emit_move_insn (value
, valreg
);
4278 if (ACCUMULATE_OUTGOING_ARGS
)
4280 #ifdef REG_PARM_STACK_SPACE
4282 restore_fixed_argument_area (save_area
, argblock
,
4283 high_to_save
, low_to_save
);
4286 /* If we saved any argument areas, restore them. */
4287 for (count
= 0; count
< nargs
; count
++)
4288 if (argvec
[count
].save_area
)
4290 enum machine_mode save_mode
= GET_MODE (argvec
[count
].save_area
);
4291 rtx adr
= plus_constant (Pmode
, argblock
,
4292 argvec
[count
].locate
.offset
.constant
);
4293 rtx stack_area
= gen_rtx_MEM (save_mode
,
4294 memory_address (save_mode
, adr
));
4296 if (save_mode
== BLKmode
)
4297 emit_block_move (stack_area
,
4299 (copy_rtx (argvec
[count
].save_area
)),
4300 GEN_INT (argvec
[count
].locate
.size
.constant
),
4301 BLOCK_OP_CALL_PARM
);
4303 emit_move_insn (stack_area
, argvec
[count
].save_area
);
4306 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
4307 stack_usage_map
= initial_stack_usage_map
;
4310 free (stack_usage_map_buf
);
4316 /* Output a library call to function FUN (a SYMBOL_REF rtx)
4317 (emitting the queue unless NO_QUEUE is nonzero),
4318 for a value of mode OUTMODE,
4319 with NARGS different arguments, passed as alternating rtx values
4320 and machine_modes to convert them to.
4322 FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for
4323 `const' calls, LCT_PURE for `pure' calls, or other LCT_ value for
4324 other types of library calls. */
4327 emit_library_call (rtx orgfun
, enum libcall_type fn_type
,
4328 enum machine_mode outmode
, int nargs
, ...)
4332 va_start (p
, nargs
);
4333 emit_library_call_value_1 (0, orgfun
, NULL_RTX
, fn_type
, outmode
, nargs
, p
);
4337 /* Like emit_library_call except that an extra argument, VALUE,
4338 comes second and says where to store the result.
4339 (If VALUE is zero, this function chooses a convenient way
4340 to return the value.
4342 This function returns an rtx for where the value is to be found.
4343 If VALUE is nonzero, VALUE is returned. */
4346 emit_library_call_value (rtx orgfun
, rtx value
,
4347 enum libcall_type fn_type
,
4348 enum machine_mode outmode
, int nargs
, ...)
4353 va_start (p
, nargs
);
4354 result
= emit_library_call_value_1 (1, orgfun
, value
, fn_type
, outmode
,
4361 /* Store a single argument for a function call
4362 into the register or memory area where it must be passed.
4363 *ARG describes the argument value and where to pass it.
4365 ARGBLOCK is the address of the stack-block for all the arguments,
4366 or 0 on a machine where arguments are pushed individually.
4368 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
4369 so must be careful about how the stack is used.
4371 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
4372 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
4373 that we need not worry about saving and restoring the stack.
4375 FNDECL is the declaration of the function we are calling.
4377 Return nonzero if this arg should cause sibcall failure,
4381 store_one_arg (struct arg_data
*arg
, rtx argblock
, int flags
,
4382 int variable_size ATTRIBUTE_UNUSED
, int reg_parm_stack_space
)
4384 tree pval
= arg
->tree_value
;
4388 int i
, lower_bound
= 0, upper_bound
= 0;
4389 int sibcall_failure
= 0;
4391 if (TREE_CODE (pval
) == ERROR_MARK
)
4394 /* Push a new temporary level for any temporaries we make for
4398 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
))
4400 /* If this is being stored into a pre-allocated, fixed-size, stack area,
4401 save any previous data at that location. */
4402 if (argblock
&& ! variable_size
&& arg
->stack
)
4404 #ifdef ARGS_GROW_DOWNWARD
4405 /* stack_slot is negative, but we want to index stack_usage_map
4406 with positive values. */
4407 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
4408 upper_bound
= -INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1)) + 1;
4412 lower_bound
= upper_bound
- arg
->locate
.size
.constant
;
4414 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
4415 lower_bound
= INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1));
4419 upper_bound
= lower_bound
+ arg
->locate
.size
.constant
;
4423 /* Don't worry about things in the fixed argument area;
4424 it has already been saved. */
4425 if (i
< reg_parm_stack_space
)
4426 i
= reg_parm_stack_space
;
4427 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
4430 if (i
< upper_bound
)
4432 /* We need to make a save area. */
4433 unsigned int size
= arg
->locate
.size
.constant
* BITS_PER_UNIT
;
4434 enum machine_mode save_mode
= mode_for_size (size
, MODE_INT
, 1);
4435 rtx adr
= memory_address (save_mode
, XEXP (arg
->stack_slot
, 0));
4436 rtx stack_area
= gen_rtx_MEM (save_mode
, adr
);
4438 if (save_mode
== BLKmode
)
4441 = assign_temp (TREE_TYPE (arg
->tree_value
), 1, 1);
4442 preserve_temp_slots (arg
->save_area
);
4443 emit_block_move (validize_mem (copy_rtx (arg
->save_area
)),
4445 GEN_INT (arg
->locate
.size
.constant
),
4446 BLOCK_OP_CALL_PARM
);
4450 arg
->save_area
= gen_reg_rtx (save_mode
);
4451 emit_move_insn (arg
->save_area
, stack_area
);
4457 /* If this isn't going to be placed on both the stack and in registers,
4458 set up the register and number of words. */
4459 if (! arg
->pass_on_stack
)
4461 if (flags
& ECF_SIBCALL
)
4462 reg
= arg
->tail_call_reg
;
4465 partial
= arg
->partial
;
4468 /* Being passed entirely in a register. We shouldn't be called in
4470 gcc_assert (reg
== 0 || partial
!= 0);
4472 /* If this arg needs special alignment, don't load the registers
4474 if (arg
->n_aligned_regs
!= 0)
4477 /* If this is being passed partially in a register, we can't evaluate
4478 it directly into its stack slot. Otherwise, we can. */
4479 if (arg
->value
== 0)
4481 /* stack_arg_under_construction is nonzero if a function argument is
4482 being evaluated directly into the outgoing argument list and
4483 expand_call must take special action to preserve the argument list
4484 if it is called recursively.
4486 For scalar function arguments stack_usage_map is sufficient to
4487 determine which stack slots must be saved and restored. Scalar
4488 arguments in general have pass_on_stack == 0.
4490 If this argument is initialized by a function which takes the
4491 address of the argument (a C++ constructor or a C function
4492 returning a BLKmode structure), then stack_usage_map is
4493 insufficient and expand_call must push the stack around the
4494 function call. Such arguments have pass_on_stack == 1.
4496 Note that it is always safe to set stack_arg_under_construction,
4497 but this generates suboptimal code if set when not needed. */
4499 if (arg
->pass_on_stack
)
4500 stack_arg_under_construction
++;
4502 arg
->value
= expand_expr (pval
,
4504 || TYPE_MODE (TREE_TYPE (pval
)) != arg
->mode
)
4505 ? NULL_RTX
: arg
->stack
,
4506 VOIDmode
, EXPAND_STACK_PARM
);
4508 /* If we are promoting object (or for any other reason) the mode
4509 doesn't agree, convert the mode. */
4511 if (arg
->mode
!= TYPE_MODE (TREE_TYPE (pval
)))
4512 arg
->value
= convert_modes (arg
->mode
, TYPE_MODE (TREE_TYPE (pval
)),
4513 arg
->value
, arg
->unsignedp
);
4515 if (arg
->pass_on_stack
)
4516 stack_arg_under_construction
--;
4519 /* Check for overlap with already clobbered argument area. */
4520 if ((flags
& ECF_SIBCALL
)
4521 && MEM_P (arg
->value
)
4522 && mem_overlaps_already_clobbered_arg_p (XEXP (arg
->value
, 0),
4523 arg
->locate
.size
.constant
))
4524 sibcall_failure
= 1;
4526 /* Don't allow anything left on stack from computation
4527 of argument to alloca. */
4528 if (flags
& ECF_MAY_BE_ALLOCA
)
4529 do_pending_stack_adjust ();
4531 if (arg
->value
== arg
->stack
)
4532 /* If the value is already in the stack slot, we are done. */
4534 else if (arg
->mode
!= BLKmode
)
4537 unsigned int parm_align
;
4539 /* Argument is a scalar, not entirely passed in registers.
4540 (If part is passed in registers, arg->partial says how much
4541 and emit_push_insn will take care of putting it there.)
4543 Push it, and if its size is less than the
4544 amount of space allocated to it,
4545 also bump stack pointer by the additional space.
4546 Note that in C the default argument promotions
4547 will prevent such mismatches. */
4549 size
= GET_MODE_SIZE (arg
->mode
);
4550 /* Compute how much space the push instruction will push.
4551 On many machines, pushing a byte will advance the stack
4552 pointer by a halfword. */
4553 #ifdef PUSH_ROUNDING
4554 size
= PUSH_ROUNDING (size
);
4558 /* Compute how much space the argument should get:
4559 round up to a multiple of the alignment for arguments. */
4560 if (none
!= FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)))
4561 used
= (((size
+ PARM_BOUNDARY
/ BITS_PER_UNIT
- 1)
4562 / (PARM_BOUNDARY
/ BITS_PER_UNIT
))
4563 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
4565 /* Compute the alignment of the pushed argument. */
4566 parm_align
= arg
->locate
.boundary
;
4567 if (FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)) == downward
)
4569 int pad
= used
- size
;
4572 unsigned int pad_align
= (pad
& -pad
) * BITS_PER_UNIT
;
4573 parm_align
= MIN (parm_align
, pad_align
);
4577 /* This isn't already where we want it on the stack, so put it there.
4578 This can either be done with push or copy insns. */
4579 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), NULL_RTX
,
4580 parm_align
, partial
, reg
, used
- size
, argblock
,
4581 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
4582 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
));
4584 /* Unless this is a partially-in-register argument, the argument is now
4587 arg
->value
= arg
->stack
;
4591 /* BLKmode, at least partly to be pushed. */
4593 unsigned int parm_align
;
4597 /* Pushing a nonscalar.
4598 If part is passed in registers, PARTIAL says how much
4599 and emit_push_insn will take care of putting it there. */
4601 /* Round its size up to a multiple
4602 of the allocation unit for arguments. */
4604 if (arg
->locate
.size
.var
!= 0)
4607 size_rtx
= ARGS_SIZE_RTX (arg
->locate
.size
);
4611 /* PUSH_ROUNDING has no effect on us, because emit_push_insn
4612 for BLKmode is careful to avoid it. */
4613 excess
= (arg
->locate
.size
.constant
4614 - int_size_in_bytes (TREE_TYPE (pval
))
4616 size_rtx
= expand_expr (size_in_bytes (TREE_TYPE (pval
)),
4617 NULL_RTX
, TYPE_MODE (sizetype
),
4621 parm_align
= arg
->locate
.boundary
;
4623 /* When an argument is padded down, the block is aligned to
4624 PARM_BOUNDARY, but the actual argument isn't. */
4625 if (FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)) == downward
)
4627 if (arg
->locate
.size
.var
)
4628 parm_align
= BITS_PER_UNIT
;
4631 unsigned int excess_align
= (excess
& -excess
) * BITS_PER_UNIT
;
4632 parm_align
= MIN (parm_align
, excess_align
);
4636 if ((flags
& ECF_SIBCALL
) && MEM_P (arg
->value
))
4638 /* emit_push_insn might not work properly if arg->value and
4639 argblock + arg->locate.offset areas overlap. */
4643 if (XEXP (x
, 0) == crtl
->args
.internal_arg_pointer
4644 || (GET_CODE (XEXP (x
, 0)) == PLUS
4645 && XEXP (XEXP (x
, 0), 0) ==
4646 crtl
->args
.internal_arg_pointer
4647 && CONST_INT_P (XEXP (XEXP (x
, 0), 1))))
4649 if (XEXP (x
, 0) != crtl
->args
.internal_arg_pointer
)
4650 i
= INTVAL (XEXP (XEXP (x
, 0), 1));
4652 /* expand_call should ensure this. */
4653 gcc_assert (!arg
->locate
.offset
.var
4654 && arg
->locate
.size
.var
== 0
4655 && CONST_INT_P (size_rtx
));
4657 if (arg
->locate
.offset
.constant
> i
)
4659 if (arg
->locate
.offset
.constant
< i
+ INTVAL (size_rtx
))
4660 sibcall_failure
= 1;
4662 else if (arg
->locate
.offset
.constant
< i
)
4664 /* Use arg->locate.size.constant instead of size_rtx
4665 because we only care about the part of the argument
4667 if (i
< (arg
->locate
.offset
.constant
4668 + arg
->locate
.size
.constant
))
4669 sibcall_failure
= 1;
4673 /* Even though they appear to be at the same location,
4674 if part of the outgoing argument is in registers,
4675 they aren't really at the same location. Check for
4676 this by making sure that the incoming size is the
4677 same as the outgoing size. */
4678 if (arg
->locate
.size
.constant
!= INTVAL (size_rtx
))
4679 sibcall_failure
= 1;
4684 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx
,
4685 parm_align
, partial
, reg
, excess
, argblock
,
4686 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
4687 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
));
4689 /* Unless this is a partially-in-register argument, the argument is now
4692 ??? Unlike the case above, in which we want the actual
4693 address of the data, so that we can load it directly into a
4694 register, here we want the address of the stack slot, so that
4695 it's properly aligned for word-by-word copying or something
4696 like that. It's not clear that this is always correct. */
4698 arg
->value
= arg
->stack_slot
;
4701 if (arg
->reg
&& GET_CODE (arg
->reg
) == PARALLEL
)
4703 tree type
= TREE_TYPE (arg
->tree_value
);
4705 = emit_group_load_into_temps (arg
->reg
, arg
->value
, type
,
4706 int_size_in_bytes (type
));
4709 /* Mark all slots this store used. */
4710 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
)
4711 && argblock
&& ! variable_size
&& arg
->stack
)
4712 for (i
= lower_bound
; i
< upper_bound
; i
++)
4713 stack_usage_map
[i
] = 1;
4715 /* Once we have pushed something, pops can't safely
4716 be deferred during the rest of the arguments. */
4719 /* Free any temporary slots made in processing this argument. */
4722 return sibcall_failure
;
4725 /* Nonzero if we do not know how to pass TYPE solely in registers. */
4728 must_pass_in_stack_var_size (enum machine_mode mode ATTRIBUTE_UNUSED
,
4734 /* If the type has variable size... */
4735 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4738 /* If the type is marked as addressable (it is required
4739 to be constructed into the stack)... */
4740 if (TREE_ADDRESSABLE (type
))
4746 /* Another version of the TARGET_MUST_PASS_IN_STACK hook. This one
4747 takes trailing padding of a structure into account. */
4748 /* ??? Should be able to merge these two by examining BLOCK_REG_PADDING. */
4751 must_pass_in_stack_var_size_or_pad (enum machine_mode mode
, const_tree type
)
4756 /* If the type has variable size... */
4757 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4760 /* If the type is marked as addressable (it is required
4761 to be constructed into the stack)... */
4762 if (TREE_ADDRESSABLE (type
))
4765 /* If the padding and mode of the type is such that a copy into
4766 a register would put it into the wrong part of the register. */
4768 && int_size_in_bytes (type
) % (PARM_BOUNDARY
/ BITS_PER_UNIT
)
4769 && (FUNCTION_ARG_PADDING (mode
, type
)
4770 == (BYTES_BIG_ENDIAN
? upward
: downward
)))