1 /* Convert function calls to rtl insns, for GNU C compiler.
2 Copyright (C) 1989-2013 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"
37 #include "diagnostic-core.h"
42 #include "langhooks.h"
48 /* Like PREFERRED_STACK_BOUNDARY but in units of bytes, not bits. */
49 #define STACK_BYTES (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)
51 /* Data structure and subroutines used within expand_call. */
55 /* Tree node for this argument. */
57 /* Mode for value; TYPE_MODE unless promoted. */
58 enum machine_mode mode
;
59 /* Current RTL value for argument, or 0 if it isn't precomputed. */
61 /* Initially-compute RTL value for argument; only for const functions. */
63 /* Register to pass this argument in, 0 if passed on stack, or an
64 PARALLEL if the arg is to be copied into multiple non-contiguous
67 /* Register to pass this argument in when generating tail call sequence.
68 This is not the same register as for normal calls on machines with
71 /* If REG is a PARALLEL, this is a copy of VALUE pulled into the correct
72 form for emit_group_move. */
74 /* If REG was promoted from the actual mode of the argument expression,
75 indicates whether the promotion is sign- or zero-extended. */
77 /* Number of bytes to put in registers. 0 means put the whole arg
78 in registers. Also 0 if not passed in registers. */
80 /* Nonzero if argument must be passed on stack.
81 Note that some arguments may be passed on the stack
82 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
83 pass_on_stack identifies arguments that *cannot* go in registers. */
85 /* Some fields packaged up for locate_and_pad_parm. */
86 struct locate_and_pad_arg_data locate
;
87 /* Location on the stack at which parameter should be stored. The store
88 has already been done if STACK == VALUE. */
90 /* Location on the stack of the start of this argument slot. This can
91 differ from STACK if this arg pads downward. This location is known
92 to be aligned to TARGET_FUNCTION_ARG_BOUNDARY. */
94 /* Place that this stack area has been saved, if needed. */
96 /* If an argument's alignment does not permit direct copying into registers,
97 copy in smaller-sized pieces into pseudos. These are stored in a
98 block pointed to by this field. The next field says how many
99 word-sized pseudos we made. */
104 /* A vector of one char per byte of stack space. A byte if nonzero if
105 the corresponding stack location has been used.
106 This vector is used to prevent a function call within an argument from
107 clobbering any stack already set up. */
108 static char *stack_usage_map
;
110 /* Size of STACK_USAGE_MAP. */
111 static int highest_outgoing_arg_in_use
;
113 /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
114 stack location's tail call argument has been already stored into the stack.
115 This bitmap is used to prevent sibling call optimization if function tries
116 to use parent's incoming argument slots when they have been already
117 overwritten with tail call arguments. */
118 static sbitmap stored_args_map
;
120 /* stack_arg_under_construction is nonzero when an argument may be
121 initialized with a constructor call (including a C function that
122 returns a BLKmode struct) and expand_call must take special action
123 to make sure the object being constructed does not overlap the
124 argument list for the constructor call. */
125 static int stack_arg_under_construction
;
127 static void emit_call_1 (rtx
, tree
, tree
, tree
, HOST_WIDE_INT
, HOST_WIDE_INT
,
128 HOST_WIDE_INT
, rtx
, rtx
, int, rtx
, int,
130 static void precompute_register_parameters (int, struct arg_data
*, int *);
131 static int store_one_arg (struct arg_data
*, rtx
, int, int, int);
132 static void store_unaligned_arguments_into_pseudos (struct arg_data
*, int);
133 static int finalize_must_preallocate (int, int, struct arg_data
*,
135 static void precompute_arguments (int, struct arg_data
*);
136 static int compute_argument_block_size (int, struct args_size
*, tree
, tree
, int);
137 static void initialize_argument_information (int, struct arg_data
*,
138 struct args_size
*, int,
140 tree
, tree
, cumulative_args_t
, int,
141 rtx
*, int *, int *, int *,
143 static void compute_argument_addresses (struct arg_data
*, rtx
, int);
144 static rtx
rtx_for_function_call (tree
, tree
);
145 static void load_register_parameters (struct arg_data
*, int, rtx
*, int,
147 static rtx
emit_library_call_value_1 (int, rtx
, rtx
, enum libcall_type
,
148 enum machine_mode
, int, va_list);
149 static int special_function_p (const_tree
, int);
150 static int check_sibcall_argument_overlap_1 (rtx
);
151 static int check_sibcall_argument_overlap (rtx
, struct arg_data
*, int);
153 static int combine_pending_stack_adjustment_and_call (int, struct args_size
*,
155 static tree
split_complex_types (tree
);
157 #ifdef REG_PARM_STACK_SPACE
158 static rtx
save_fixed_argument_area (int, rtx
, int *, int *);
159 static void restore_fixed_argument_area (rtx
, rtx
, int, int);
162 /* Force FUNEXP into a form suitable for the address of a CALL,
163 and return that as an rtx. Also load the static chain register
164 if FNDECL is a nested function.
166 CALL_FUSAGE points to a variable holding the prospective
167 CALL_INSN_FUNCTION_USAGE information. */
170 prepare_call_address (tree fndecl
, rtx funexp
, rtx static_chain_value
,
171 rtx
*call_fusage
, int reg_parm_seen
, int sibcallp
)
173 /* Make a valid memory address and copy constants through pseudo-regs,
174 but not for a constant address if -fno-function-cse. */
175 if (GET_CODE (funexp
) != SYMBOL_REF
)
176 /* If we are using registers for parameters, force the
177 function address into a register now. */
178 funexp
= ((reg_parm_seen
179 && targetm
.small_register_classes_for_mode_p (FUNCTION_MODE
))
180 ? force_not_mem (memory_address (FUNCTION_MODE
, funexp
))
181 : memory_address (FUNCTION_MODE
, funexp
));
184 #ifndef NO_FUNCTION_CSE
185 if (optimize
&& ! flag_no_function_cse
)
186 funexp
= force_reg (Pmode
, funexp
);
190 if (static_chain_value
!= 0)
195 chain
= targetm
.calls
.static_chain (fndecl
, false);
196 static_chain_value
= convert_memory_address (Pmode
, static_chain_value
);
198 emit_move_insn (chain
, static_chain_value
);
200 use_reg (call_fusage
, chain
);
206 /* Generate instructions to call function FUNEXP,
207 and optionally pop the results.
208 The CALL_INSN is the first insn generated.
210 FNDECL is the declaration node of the function. This is given to the
211 hook TARGET_RETURN_POPS_ARGS to determine whether this function pops
214 FUNTYPE is the data type of the function. This is given to the hook
215 TARGET_RETURN_POPS_ARGS to determine whether this function pops its
216 own args. We used to allow an identifier for library functions, but
217 that doesn't work when the return type is an aggregate type and the
218 calling convention says that the pointer to this aggregate is to be
219 popped by the callee.
221 STACK_SIZE is the number of bytes of arguments on the stack,
222 ROUNDED_STACK_SIZE is that number rounded up to
223 PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
224 both to put into the call insn and to generate explicit popping
227 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
228 It is zero if this call doesn't want a structure value.
230 NEXT_ARG_REG is the rtx that results from executing
231 targetm.calls.function_arg (&args_so_far, VOIDmode, void_type_node, true)
232 just after all the args have had their registers assigned.
233 This could be whatever you like, but normally it is the first
234 arg-register beyond those used for args in this call,
235 or 0 if all the arg-registers are used in this call.
236 It is passed on to `gen_call' so you can put this info in the call insn.
238 VALREG is a hard register in which a value is returned,
239 or 0 if the call does not return a value.
241 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
242 the args to this call were processed.
243 We restore `inhibit_defer_pop' to that value.
245 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
246 denote registers used by the called function. */
249 emit_call_1 (rtx funexp
, tree fntree ATTRIBUTE_UNUSED
, tree fndecl ATTRIBUTE_UNUSED
,
250 tree funtype ATTRIBUTE_UNUSED
,
251 HOST_WIDE_INT stack_size ATTRIBUTE_UNUSED
,
252 HOST_WIDE_INT rounded_stack_size
,
253 HOST_WIDE_INT struct_value_size ATTRIBUTE_UNUSED
,
254 rtx next_arg_reg ATTRIBUTE_UNUSED
, rtx valreg
,
255 int old_inhibit_defer_pop
, rtx call_fusage
, int ecf_flags
,
256 cumulative_args_t args_so_far ATTRIBUTE_UNUSED
)
258 rtx rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
259 rtx call_insn
, call
, funmem
;
260 int already_popped
= 0;
261 HOST_WIDE_INT n_popped
262 = targetm
.calls
.return_pops_args (fndecl
, funtype
, stack_size
);
264 #ifdef CALL_POPS_ARGS
265 n_popped
+= CALL_POPS_ARGS (*get_cumulative_args (args_so_far
));
268 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
269 and we don't want to load it into a register as an optimization,
270 because prepare_call_address already did it if it should be done. */
271 if (GET_CODE (funexp
) != SYMBOL_REF
)
272 funexp
= memory_address (FUNCTION_MODE
, funexp
);
274 funmem
= gen_rtx_MEM (FUNCTION_MODE
, funexp
);
275 if (fndecl
&& TREE_CODE (fndecl
) == FUNCTION_DECL
)
279 /* Although a built-in FUNCTION_DECL and its non-__builtin
280 counterpart compare equal and get a shared mem_attrs, they
281 produce different dump output in compare-debug compilations,
282 if an entry gets garbage collected in one compilation, then
283 adds a different (but equivalent) entry, while the other
284 doesn't run the garbage collector at the same spot and then
285 shares the mem_attr with the equivalent entry. */
286 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
288 tree t2
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
293 set_mem_expr (funmem
, t
);
296 set_mem_expr (funmem
, build_simple_mem_ref (CALL_EXPR_FN (fntree
)));
298 #if defined (HAVE_sibcall_pop) && defined (HAVE_sibcall_value_pop)
299 if ((ecf_flags
& ECF_SIBCALL
)
300 && HAVE_sibcall_pop
&& HAVE_sibcall_value_pop
301 && (n_popped
> 0 || stack_size
== 0))
303 rtx n_pop
= GEN_INT (n_popped
);
306 /* If this subroutine pops its own args, record that in the call insn
307 if possible, for the sake of frame pointer elimination. */
310 pat
= GEN_SIBCALL_VALUE_POP (valreg
, funmem
, rounded_stack_size_rtx
,
311 next_arg_reg
, n_pop
);
313 pat
= GEN_SIBCALL_POP (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
316 emit_call_insn (pat
);
322 #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop)
323 /* If the target has "call" or "call_value" insns, then prefer them
324 if no arguments are actually popped. If the target does not have
325 "call" or "call_value" insns, then we must use the popping versions
326 even if the call has no arguments to pop. */
327 #if defined (HAVE_call) && defined (HAVE_call_value)
328 if (HAVE_call
&& HAVE_call_value
&& HAVE_call_pop
&& HAVE_call_value_pop
331 if (HAVE_call_pop
&& HAVE_call_value_pop
)
334 rtx n_pop
= GEN_INT (n_popped
);
337 /* If this subroutine pops its own args, record that in the call insn
338 if possible, for the sake of frame pointer elimination. */
341 pat
= GEN_CALL_VALUE_POP (valreg
, funmem
, rounded_stack_size_rtx
,
342 next_arg_reg
, n_pop
);
344 pat
= GEN_CALL_POP (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
347 emit_call_insn (pat
);
353 #if defined (HAVE_sibcall) && defined (HAVE_sibcall_value)
354 if ((ecf_flags
& ECF_SIBCALL
)
355 && HAVE_sibcall
&& HAVE_sibcall_value
)
358 emit_call_insn (GEN_SIBCALL_VALUE (valreg
, funmem
,
359 rounded_stack_size_rtx
,
360 next_arg_reg
, NULL_RTX
));
362 emit_call_insn (GEN_SIBCALL (funmem
, rounded_stack_size_rtx
,
364 GEN_INT (struct_value_size
)));
369 #if defined (HAVE_call) && defined (HAVE_call_value)
370 if (HAVE_call
&& HAVE_call_value
)
373 emit_call_insn (GEN_CALL_VALUE (valreg
, funmem
, rounded_stack_size_rtx
,
374 next_arg_reg
, NULL_RTX
));
376 emit_call_insn (GEN_CALL (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
377 GEN_INT (struct_value_size
)));
383 /* Find the call we just emitted. */
384 call_insn
= last_call_insn ();
386 /* Some target create a fresh MEM instead of reusing the one provided
387 above. Set its MEM_EXPR. */
388 call
= get_call_rtx_from (call_insn
);
390 && MEM_EXPR (XEXP (call
, 0)) == NULL_TREE
391 && MEM_EXPR (funmem
) != NULL_TREE
)
392 set_mem_expr (XEXP (call
, 0), MEM_EXPR (funmem
));
394 /* Put the register usage information there. */
395 add_function_usage_to (call_insn
, call_fusage
);
397 /* If this is a const call, then set the insn's unchanging bit. */
398 if (ecf_flags
& ECF_CONST
)
399 RTL_CONST_CALL_P (call_insn
) = 1;
401 /* If this is a pure call, then set the insn's unchanging bit. */
402 if (ecf_flags
& ECF_PURE
)
403 RTL_PURE_CALL_P (call_insn
) = 1;
405 /* If this is a const call, then set the insn's unchanging bit. */
406 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
407 RTL_LOOPING_CONST_OR_PURE_CALL_P (call_insn
) = 1;
409 /* Create a nothrow REG_EH_REGION note, if needed. */
410 make_reg_eh_region_note (call_insn
, ecf_flags
, 0);
412 if (ecf_flags
& ECF_NORETURN
)
413 add_reg_note (call_insn
, REG_NORETURN
, const0_rtx
);
415 if (ecf_flags
& ECF_RETURNS_TWICE
)
417 add_reg_note (call_insn
, REG_SETJMP
, const0_rtx
);
418 cfun
->calls_setjmp
= 1;
421 SIBLING_CALL_P (call_insn
) = ((ecf_flags
& ECF_SIBCALL
) != 0);
423 /* Restore this now, so that we do defer pops for this call's args
424 if the context of the call as a whole permits. */
425 inhibit_defer_pop
= old_inhibit_defer_pop
;
430 CALL_INSN_FUNCTION_USAGE (call_insn
)
431 = gen_rtx_EXPR_LIST (VOIDmode
,
432 gen_rtx_CLOBBER (VOIDmode
, stack_pointer_rtx
),
433 CALL_INSN_FUNCTION_USAGE (call_insn
));
434 rounded_stack_size
-= n_popped
;
435 rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
436 stack_pointer_delta
-= n_popped
;
438 add_reg_note (call_insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
440 /* If popup is needed, stack realign must use DRAP */
441 if (SUPPORTS_STACK_ALIGNMENT
)
442 crtl
->need_drap
= true;
444 /* For noreturn calls when not accumulating outgoing args force
445 REG_ARGS_SIZE note to prevent crossjumping of calls with different
447 else if (!ACCUMULATE_OUTGOING_ARGS
&& (ecf_flags
& ECF_NORETURN
) != 0)
448 add_reg_note (call_insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
450 if (!ACCUMULATE_OUTGOING_ARGS
)
452 /* If returning from the subroutine does not automatically pop the args,
453 we need an instruction to pop them sooner or later.
454 Perhaps do it now; perhaps just record how much space to pop later.
456 If returning from the subroutine does pop the args, indicate that the
457 stack pointer will be changed. */
459 if (rounded_stack_size
!= 0)
461 if (ecf_flags
& ECF_NORETURN
)
462 /* Just pretend we did the pop. */
463 stack_pointer_delta
-= rounded_stack_size
;
464 else if (flag_defer_pop
&& inhibit_defer_pop
== 0
465 && ! (ecf_flags
& (ECF_CONST
| ECF_PURE
)))
466 pending_stack_adjust
+= rounded_stack_size
;
468 adjust_stack (rounded_stack_size_rtx
);
471 /* When we accumulate outgoing args, we must avoid any stack manipulations.
472 Restore the stack pointer to its original value now. Usually
473 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
474 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
475 popping variants of functions exist as well.
477 ??? We may optimize similar to defer_pop above, but it is
478 probably not worthwhile.
480 ??? It will be worthwhile to enable combine_stack_adjustments even for
483 anti_adjust_stack (GEN_INT (n_popped
));
486 /* Determine if the function identified by NAME and FNDECL is one with
487 special properties we wish to know about.
489 For example, if the function might return more than one time (setjmp), then
490 set RETURNS_TWICE to a nonzero value.
492 Similarly set NORETURN if the function is in the longjmp family.
494 Set MAY_BE_ALLOCA for any memory allocation function that might allocate
495 space from the stack such as alloca. */
498 special_function_p (const_tree fndecl
, int flags
)
500 if (fndecl
&& DECL_NAME (fndecl
)
501 && IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) <= 17
502 /* Exclude functions not at the file scope, or not `extern',
503 since they are not the magic functions we would otherwise
505 FIXME: this should be handled with attributes, not with this
506 hacky imitation of DECL_ASSEMBLER_NAME. It's (also) wrong
507 because you can declare fork() inside a function if you
509 && (DECL_CONTEXT (fndecl
) == NULL_TREE
510 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
511 && TREE_PUBLIC (fndecl
))
513 const char *name
= IDENTIFIER_POINTER (DECL_NAME (fndecl
));
514 const char *tname
= name
;
516 /* We assume that alloca will always be called by name. It
517 makes no sense to pass it as a pointer-to-function to
518 anything that does not understand its behavior. */
519 if (((IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 6
521 && ! strcmp (name
, "alloca"))
522 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 16
524 && ! strcmp (name
, "__builtin_alloca"))))
525 flags
|= ECF_MAY_BE_ALLOCA
;
527 /* Disregard prefix _, __, __x or __builtin_. */
532 && !strncmp (name
+ 3, "uiltin_", 7))
534 else if (name
[1] == '_' && name
[2] == 'x')
536 else if (name
[1] == '_')
545 && (! strcmp (tname
, "setjmp")
546 || ! strcmp (tname
, "setjmp_syscall")))
548 && ! strcmp (tname
, "sigsetjmp"))
550 && ! strcmp (tname
, "savectx")))
551 flags
|= ECF_RETURNS_TWICE
| ECF_LEAF
;
554 && ! strcmp (tname
, "siglongjmp"))
555 flags
|= ECF_NORETURN
;
557 else if ((tname
[0] == 'q' && tname
[1] == 's'
558 && ! strcmp (tname
, "qsetjmp"))
559 || (tname
[0] == 'v' && tname
[1] == 'f'
560 && ! strcmp (tname
, "vfork"))
561 || (tname
[0] == 'g' && tname
[1] == 'e'
562 && !strcmp (tname
, "getcontext")))
563 flags
|= ECF_RETURNS_TWICE
| ECF_LEAF
;
565 else if (tname
[0] == 'l' && tname
[1] == 'o'
566 && ! strcmp (tname
, "longjmp"))
567 flags
|= ECF_NORETURN
;
573 /* Similar to special_function_p; return a set of ERF_ flags for the
576 decl_return_flags (tree fndecl
)
579 tree type
= TREE_TYPE (fndecl
);
583 attr
= lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type
));
587 attr
= TREE_VALUE (TREE_VALUE (attr
));
588 if (!attr
|| TREE_STRING_LENGTH (attr
) < 1)
591 switch (TREE_STRING_POINTER (attr
)[0])
597 return ERF_RETURNS_ARG
| (TREE_STRING_POINTER (attr
)[0] - '1');
608 /* Return nonzero when FNDECL represents a call to setjmp. */
611 setjmp_call_p (const_tree fndecl
)
613 if (DECL_IS_RETURNS_TWICE (fndecl
))
614 return ECF_RETURNS_TWICE
;
615 return special_function_p (fndecl
, 0) & ECF_RETURNS_TWICE
;
619 /* Return true if STMT is an alloca call. */
622 gimple_alloca_call_p (const_gimple stmt
)
626 if (!is_gimple_call (stmt
))
629 fndecl
= gimple_call_fndecl (stmt
);
630 if (fndecl
&& (special_function_p (fndecl
, 0) & ECF_MAY_BE_ALLOCA
))
636 /* Return true when exp contains alloca call. */
639 alloca_call_p (const_tree exp
)
642 if (TREE_CODE (exp
) == CALL_EXPR
643 && (fndecl
= get_callee_fndecl (exp
))
644 && (special_function_p (fndecl
, 0) & ECF_MAY_BE_ALLOCA
))
649 /* Return TRUE if FNDECL is either a TM builtin or a TM cloned
650 function. Return FALSE otherwise. */
653 is_tm_builtin (const_tree fndecl
)
658 if (decl_is_tm_clone (fndecl
))
661 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
663 switch (DECL_FUNCTION_CODE (fndecl
))
665 case BUILT_IN_TM_COMMIT
:
666 case BUILT_IN_TM_COMMIT_EH
:
667 case BUILT_IN_TM_ABORT
:
668 case BUILT_IN_TM_IRREVOCABLE
:
669 case BUILT_IN_TM_GETTMCLONE_IRR
:
670 case BUILT_IN_TM_MEMCPY
:
671 case BUILT_IN_TM_MEMMOVE
:
672 case BUILT_IN_TM_MEMSET
:
673 CASE_BUILT_IN_TM_STORE (1):
674 CASE_BUILT_IN_TM_STORE (2):
675 CASE_BUILT_IN_TM_STORE (4):
676 CASE_BUILT_IN_TM_STORE (8):
677 CASE_BUILT_IN_TM_STORE (FLOAT
):
678 CASE_BUILT_IN_TM_STORE (DOUBLE
):
679 CASE_BUILT_IN_TM_STORE (LDOUBLE
):
680 CASE_BUILT_IN_TM_STORE (M64
):
681 CASE_BUILT_IN_TM_STORE (M128
):
682 CASE_BUILT_IN_TM_STORE (M256
):
683 CASE_BUILT_IN_TM_LOAD (1):
684 CASE_BUILT_IN_TM_LOAD (2):
685 CASE_BUILT_IN_TM_LOAD (4):
686 CASE_BUILT_IN_TM_LOAD (8):
687 CASE_BUILT_IN_TM_LOAD (FLOAT
):
688 CASE_BUILT_IN_TM_LOAD (DOUBLE
):
689 CASE_BUILT_IN_TM_LOAD (LDOUBLE
):
690 CASE_BUILT_IN_TM_LOAD (M64
):
691 CASE_BUILT_IN_TM_LOAD (M128
):
692 CASE_BUILT_IN_TM_LOAD (M256
):
693 case BUILT_IN_TM_LOG
:
694 case BUILT_IN_TM_LOG_1
:
695 case BUILT_IN_TM_LOG_2
:
696 case BUILT_IN_TM_LOG_4
:
697 case BUILT_IN_TM_LOG_8
:
698 case BUILT_IN_TM_LOG_FLOAT
:
699 case BUILT_IN_TM_LOG_DOUBLE
:
700 case BUILT_IN_TM_LOG_LDOUBLE
:
701 case BUILT_IN_TM_LOG_M64
:
702 case BUILT_IN_TM_LOG_M128
:
703 case BUILT_IN_TM_LOG_M256
:
712 /* Detect flags (function attributes) from the function decl or type node. */
715 flags_from_decl_or_type (const_tree exp
)
721 /* The function exp may have the `malloc' attribute. */
722 if (DECL_IS_MALLOC (exp
))
725 /* The function exp may have the `returns_twice' attribute. */
726 if (DECL_IS_RETURNS_TWICE (exp
))
727 flags
|= ECF_RETURNS_TWICE
;
729 /* Process the pure and const attributes. */
730 if (TREE_READONLY (exp
))
732 if (DECL_PURE_P (exp
))
734 if (DECL_LOOPING_CONST_OR_PURE_P (exp
))
735 flags
|= ECF_LOOPING_CONST_OR_PURE
;
737 if (DECL_IS_NOVOPS (exp
))
739 if (lookup_attribute ("leaf", DECL_ATTRIBUTES (exp
)))
742 if (TREE_NOTHROW (exp
))
743 flags
|= ECF_NOTHROW
;
747 if (is_tm_builtin (exp
))
748 flags
|= ECF_TM_BUILTIN
;
749 else if ((flags
& (ECF_CONST
|ECF_NOVOPS
)) != 0
750 || lookup_attribute ("transaction_pure",
751 TYPE_ATTRIBUTES (TREE_TYPE (exp
))))
752 flags
|= ECF_TM_PURE
;
755 flags
= special_function_p (exp
, flags
);
757 else if (TYPE_P (exp
))
759 if (TYPE_READONLY (exp
))
763 && ((flags
& ECF_CONST
) != 0
764 || lookup_attribute ("transaction_pure", TYPE_ATTRIBUTES (exp
))))
765 flags
|= ECF_TM_PURE
;
768 if (TREE_THIS_VOLATILE (exp
))
770 flags
|= ECF_NORETURN
;
771 if (flags
& (ECF_CONST
|ECF_PURE
))
772 flags
|= ECF_LOOPING_CONST_OR_PURE
;
778 /* Detect flags from a CALL_EXPR. */
781 call_expr_flags (const_tree t
)
784 tree decl
= get_callee_fndecl (t
);
787 flags
= flags_from_decl_or_type (decl
);
790 t
= TREE_TYPE (CALL_EXPR_FN (t
));
791 if (t
&& TREE_CODE (t
) == POINTER_TYPE
)
792 flags
= flags_from_decl_or_type (TREE_TYPE (t
));
800 /* Precompute all register parameters as described by ARGS, storing values
801 into fields within the ARGS array.
803 NUM_ACTUALS indicates the total number elements in the ARGS array.
805 Set REG_PARM_SEEN if we encounter a register parameter. */
808 precompute_register_parameters (int num_actuals
, struct arg_data
*args
,
815 for (i
= 0; i
< num_actuals
; i
++)
816 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
)
820 if (args
[i
].value
== 0)
823 args
[i
].value
= expand_normal (args
[i
].tree_value
);
824 preserve_temp_slots (args
[i
].value
);
828 /* If we are to promote the function arg to a wider mode,
831 if (args
[i
].mode
!= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)))
833 = convert_modes (args
[i
].mode
,
834 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
835 args
[i
].value
, args
[i
].unsignedp
);
837 /* If the value is a non-legitimate constant, force it into a
838 pseudo now. TLS symbols sometimes need a call to resolve. */
839 if (CONSTANT_P (args
[i
].value
)
840 && !targetm
.legitimate_constant_p (args
[i
].mode
, args
[i
].value
))
841 args
[i
].value
= force_reg (args
[i
].mode
, args
[i
].value
);
843 /* If we're going to have to load the value by parts, pull the
844 parts into pseudos. The part extraction process can involve
845 non-trivial computation. */
846 if (GET_CODE (args
[i
].reg
) == PARALLEL
)
848 tree type
= TREE_TYPE (args
[i
].tree_value
);
849 args
[i
].parallel_value
850 = emit_group_load_into_temps (args
[i
].reg
, args
[i
].value
,
851 type
, int_size_in_bytes (type
));
854 /* If the value is expensive, and we are inside an appropriately
855 short loop, put the value into a pseudo and then put the pseudo
858 For small register classes, also do this if this call uses
859 register parameters. This is to avoid reload conflicts while
860 loading the parameters registers. */
862 else if ((! (REG_P (args
[i
].value
)
863 || (GET_CODE (args
[i
].value
) == SUBREG
864 && REG_P (SUBREG_REG (args
[i
].value
)))))
865 && args
[i
].mode
!= BLKmode
866 && set_src_cost (args
[i
].value
, optimize_insn_for_speed_p ())
869 && targetm
.small_register_classes_for_mode_p (args
[i
].mode
))
871 args
[i
].value
= copy_to_mode_reg (args
[i
].mode
, args
[i
].value
);
875 #ifdef REG_PARM_STACK_SPACE
877 /* The argument list is the property of the called routine and it
878 may clobber it. If the fixed area has been used for previous
879 parameters, we must save and restore it. */
882 save_fixed_argument_area (int reg_parm_stack_space
, rtx argblock
, int *low_to_save
, int *high_to_save
)
887 /* Compute the boundary of the area that needs to be saved, if any. */
888 high
= reg_parm_stack_space
;
889 #ifdef ARGS_GROW_DOWNWARD
892 if (high
> highest_outgoing_arg_in_use
)
893 high
= highest_outgoing_arg_in_use
;
895 for (low
= 0; low
< high
; low
++)
896 if (stack_usage_map
[low
] != 0)
899 enum machine_mode save_mode
;
905 while (stack_usage_map
[--high
] == 0)
909 *high_to_save
= high
;
911 num_to_save
= high
- low
+ 1;
912 save_mode
= mode_for_size (num_to_save
* BITS_PER_UNIT
, MODE_INT
, 1);
914 /* If we don't have the required alignment, must do this
916 if ((low
& (MIN (GET_MODE_SIZE (save_mode
),
917 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)))
920 #ifdef ARGS_GROW_DOWNWARD
925 addr
= plus_constant (Pmode
, argblock
, delta
);
926 stack_area
= gen_rtx_MEM (save_mode
, memory_address (save_mode
, addr
));
928 set_mem_align (stack_area
, PARM_BOUNDARY
);
929 if (save_mode
== BLKmode
)
931 save_area
= assign_stack_temp (BLKmode
, num_to_save
);
932 emit_block_move (validize_mem (save_area
), stack_area
,
933 GEN_INT (num_to_save
), BLOCK_OP_CALL_PARM
);
937 save_area
= gen_reg_rtx (save_mode
);
938 emit_move_insn (save_area
, stack_area
);
948 restore_fixed_argument_area (rtx save_area
, rtx argblock
, int high_to_save
, int low_to_save
)
950 enum machine_mode save_mode
= GET_MODE (save_area
);
952 rtx addr
, stack_area
;
954 #ifdef ARGS_GROW_DOWNWARD
955 delta
= -high_to_save
;
959 addr
= plus_constant (Pmode
, argblock
, delta
);
960 stack_area
= gen_rtx_MEM (save_mode
, memory_address (save_mode
, addr
));
961 set_mem_align (stack_area
, PARM_BOUNDARY
);
963 if (save_mode
!= BLKmode
)
964 emit_move_insn (stack_area
, save_area
);
966 emit_block_move (stack_area
, validize_mem (save_area
),
967 GEN_INT (high_to_save
- low_to_save
+ 1),
970 #endif /* REG_PARM_STACK_SPACE */
972 /* If any elements in ARGS refer to parameters that are to be passed in
973 registers, but not in memory, and whose alignment does not permit a
974 direct copy into registers. Copy the values into a group of pseudos
975 which we will later copy into the appropriate hard registers.
977 Pseudos for each unaligned argument will be stored into the array
978 args[argnum].aligned_regs. The caller is responsible for deallocating
979 the aligned_regs array if it is nonzero. */
982 store_unaligned_arguments_into_pseudos (struct arg_data
*args
, int num_actuals
)
986 for (i
= 0; i
< num_actuals
; i
++)
987 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
988 && GET_CODE (args
[i
].reg
) != PARALLEL
989 && args
[i
].mode
== BLKmode
990 && MEM_P (args
[i
].value
)
991 && (MEM_ALIGN (args
[i
].value
)
992 < (unsigned int) MIN (BIGGEST_ALIGNMENT
, BITS_PER_WORD
)))
994 int bytes
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
995 int endian_correction
= 0;
999 gcc_assert (args
[i
].partial
% UNITS_PER_WORD
== 0);
1000 args
[i
].n_aligned_regs
= args
[i
].partial
/ UNITS_PER_WORD
;
1004 args
[i
].n_aligned_regs
1005 = (bytes
+ UNITS_PER_WORD
- 1) / UNITS_PER_WORD
;
1008 args
[i
].aligned_regs
= XNEWVEC (rtx
, args
[i
].n_aligned_regs
);
1010 /* Structures smaller than a word are normally aligned to the
1011 least significant byte. On a BYTES_BIG_ENDIAN machine,
1012 this means we must skip the empty high order bytes when
1013 calculating the bit offset. */
1014 if (bytes
< UNITS_PER_WORD
1015 #ifdef BLOCK_REG_PADDING
1016 && (BLOCK_REG_PADDING (args
[i
].mode
,
1017 TREE_TYPE (args
[i
].tree_value
), 1)
1023 endian_correction
= BITS_PER_WORD
- bytes
* BITS_PER_UNIT
;
1025 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1027 rtx reg
= gen_reg_rtx (word_mode
);
1028 rtx word
= operand_subword_force (args
[i
].value
, j
, BLKmode
);
1029 int bitsize
= MIN (bytes
* BITS_PER_UNIT
, BITS_PER_WORD
);
1031 args
[i
].aligned_regs
[j
] = reg
;
1032 word
= extract_bit_field (word
, bitsize
, 0, 1, NULL_RTX
,
1033 word_mode
, word_mode
);
1035 /* There is no need to restrict this code to loading items
1036 in TYPE_ALIGN sized hunks. The bitfield instructions can
1037 load up entire word sized registers efficiently.
1039 ??? This may not be needed anymore.
1040 We use to emit a clobber here but that doesn't let later
1041 passes optimize the instructions we emit. By storing 0 into
1042 the register later passes know the first AND to zero out the
1043 bitfield being set in the register is unnecessary. The store
1044 of 0 will be deleted as will at least the first AND. */
1046 emit_move_insn (reg
, const0_rtx
);
1048 bytes
-= bitsize
/ BITS_PER_UNIT
;
1049 store_bit_field (reg
, bitsize
, endian_correction
, 0, 0,
1055 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1058 NUM_ACTUALS is the total number of parameters.
1060 N_NAMED_ARGS is the total number of named arguments.
1062 STRUCT_VALUE_ADDR_VALUE is the implicit argument for a struct return
1065 FNDECL is the tree code for the target of this call (if known)
1067 ARGS_SO_FAR holds state needed by the target to know where to place
1070 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1071 for arguments which are passed in registers.
1073 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1074 and may be modified by this routine.
1076 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1077 flags which may may be modified by this routine.
1079 MAY_TAILCALL is cleared if we encounter an invisible pass-by-reference
1080 that requires allocation of stack space.
1082 CALL_FROM_THUNK_P is true if this call is the jump from a thunk to
1083 the thunked-to function. */
1086 initialize_argument_information (int num_actuals ATTRIBUTE_UNUSED
,
1087 struct arg_data
*args
,
1088 struct args_size
*args_size
,
1089 int n_named_args ATTRIBUTE_UNUSED
,
1090 tree exp
, tree struct_value_addr_value
,
1091 tree fndecl
, tree fntype
,
1092 cumulative_args_t args_so_far
,
1093 int reg_parm_stack_space
,
1094 rtx
*old_stack_level
, int *old_pending_adj
,
1095 int *must_preallocate
, int *ecf_flags
,
1096 bool *may_tailcall
, bool call_from_thunk_p
)
1098 CUMULATIVE_ARGS
*args_so_far_pnt
= get_cumulative_args (args_so_far
);
1099 location_t loc
= EXPR_LOCATION (exp
);
1100 /* 1 if scanning parms front to back, -1 if scanning back to front. */
1103 /* Count arg position in order args appear. */
1108 args_size
->constant
= 0;
1111 /* In this loop, we consider args in the order they are written.
1112 We fill up ARGS from the front or from the back if necessary
1113 so that in any case the first arg to be pushed ends up at the front. */
1115 if (PUSH_ARGS_REVERSED
)
1117 i
= num_actuals
- 1, inc
= -1;
1118 /* In this case, must reverse order of args
1119 so that we compute and push the last arg first. */
1126 /* First fill in the actual arguments in the ARGS array, splitting
1127 complex arguments if necessary. */
1130 call_expr_arg_iterator iter
;
1133 if (struct_value_addr_value
)
1135 args
[j
].tree_value
= struct_value_addr_value
;
1138 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
1140 tree argtype
= TREE_TYPE (arg
);
1141 if (targetm
.calls
.split_complex_arg
1143 && TREE_CODE (argtype
) == COMPLEX_TYPE
1144 && targetm
.calls
.split_complex_arg (argtype
))
1146 tree subtype
= TREE_TYPE (argtype
);
1147 args
[j
].tree_value
= build1 (REALPART_EXPR
, subtype
, arg
);
1149 args
[j
].tree_value
= build1 (IMAGPART_EXPR
, subtype
, arg
);
1152 args
[j
].tree_value
= arg
;
1157 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1158 for (argpos
= 0; argpos
< num_actuals
; i
+= inc
, argpos
++)
1160 tree type
= TREE_TYPE (args
[i
].tree_value
);
1162 enum machine_mode mode
;
1164 /* Replace erroneous argument with constant zero. */
1165 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
1166 args
[i
].tree_value
= integer_zero_node
, type
= integer_type_node
;
1168 /* If TYPE is a transparent union or record, pass things the way
1169 we would pass the first field of the union or record. We have
1170 already verified that the modes are the same. */
1171 if ((TREE_CODE (type
) == UNION_TYPE
|| TREE_CODE (type
) == RECORD_TYPE
)
1172 && TYPE_TRANSPARENT_AGGR (type
))
1173 type
= TREE_TYPE (first_field (type
));
1175 /* Decide where to pass this arg.
1177 args[i].reg is nonzero if all or part is passed in registers.
1179 args[i].partial is nonzero if part but not all is passed in registers,
1180 and the exact value says how many bytes are passed in registers.
1182 args[i].pass_on_stack is nonzero if the argument must at least be
1183 computed on the stack. It may then be loaded back into registers
1184 if args[i].reg is nonzero.
1186 These decisions are driven by the FUNCTION_... macros and must agree
1187 with those made by function.c. */
1189 /* See if this argument should be passed by invisible reference. */
1190 if (pass_by_reference (args_so_far_pnt
, TYPE_MODE (type
),
1191 type
, argpos
< n_named_args
))
1194 tree base
= NULL_TREE
;
1197 = reference_callee_copied (args_so_far_pnt
, TYPE_MODE (type
),
1198 type
, argpos
< n_named_args
);
1200 /* If we're compiling a thunk, pass through invisible references
1201 instead of making a copy. */
1202 if (call_from_thunk_p
1204 && !TREE_ADDRESSABLE (type
)
1205 && (base
= get_base_address (args
[i
].tree_value
))
1206 && TREE_CODE (base
) != SSA_NAME
1207 && (!DECL_P (base
) || MEM_P (DECL_RTL (base
)))))
1209 mark_addressable (args
[i
].tree_value
);
1211 /* We can't use sibcalls if a callee-copied argument is
1212 stored in the current function's frame. */
1213 if (!call_from_thunk_p
&& DECL_P (base
) && !TREE_STATIC (base
))
1214 *may_tailcall
= false;
1216 args
[i
].tree_value
= build_fold_addr_expr_loc (loc
,
1217 args
[i
].tree_value
);
1218 type
= TREE_TYPE (args
[i
].tree_value
);
1220 if (*ecf_flags
& ECF_CONST
)
1221 *ecf_flags
&= ~(ECF_CONST
| ECF_LOOPING_CONST_OR_PURE
);
1225 /* We make a copy of the object and pass the address to the
1226 function being called. */
1229 if (!COMPLETE_TYPE_P (type
)
1230 || TREE_CODE (TYPE_SIZE_UNIT (type
)) != INTEGER_CST
1231 || (flag_stack_check
== GENERIC_STACK_CHECK
1232 && compare_tree_int (TYPE_SIZE_UNIT (type
),
1233 STACK_CHECK_MAX_VAR_SIZE
) > 0))
1235 /* This is a variable-sized object. Make space on the stack
1237 rtx size_rtx
= expr_size (args
[i
].tree_value
);
1239 if (*old_stack_level
== 0)
1241 emit_stack_save (SAVE_BLOCK
, old_stack_level
);
1242 *old_pending_adj
= pending_stack_adjust
;
1243 pending_stack_adjust
= 0;
1246 /* We can pass TRUE as the 4th argument because we just
1247 saved the stack pointer and will restore it right after
1249 copy
= allocate_dynamic_stack_space (size_rtx
,
1253 copy
= gen_rtx_MEM (BLKmode
, copy
);
1254 set_mem_attributes (copy
, type
, 1);
1257 copy
= assign_temp (type
, 1, 0);
1259 store_expr (args
[i
].tree_value
, copy
, 0, false);
1261 /* Just change the const function to pure and then let
1262 the next test clear the pure based on
1264 if (*ecf_flags
& ECF_CONST
)
1266 *ecf_flags
&= ~ECF_CONST
;
1267 *ecf_flags
|= ECF_PURE
;
1270 if (!callee_copies
&& *ecf_flags
& ECF_PURE
)
1271 *ecf_flags
&= ~(ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
1274 = build_fold_addr_expr_loc (loc
, make_tree (type
, copy
));
1275 type
= TREE_TYPE (args
[i
].tree_value
);
1276 *may_tailcall
= false;
1280 unsignedp
= TYPE_UNSIGNED (type
);
1281 mode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
1282 fndecl
? TREE_TYPE (fndecl
) : fntype
, 0);
1284 args
[i
].unsignedp
= unsignedp
;
1285 args
[i
].mode
= mode
;
1287 args
[i
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
, type
,
1288 argpos
< n_named_args
);
1290 /* If this is a sibling call and the machine has register windows, the
1291 register window has to be unwinded before calling the routine, so
1292 arguments have to go into the incoming registers. */
1293 if (targetm
.calls
.function_incoming_arg
!= targetm
.calls
.function_arg
)
1294 args
[i
].tail_call_reg
1295 = targetm
.calls
.function_incoming_arg (args_so_far
, mode
, type
,
1296 argpos
< n_named_args
);
1298 args
[i
].tail_call_reg
= args
[i
].reg
;
1302 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, type
,
1303 argpos
< n_named_args
);
1305 args
[i
].pass_on_stack
= targetm
.calls
.must_pass_in_stack (mode
, type
);
1307 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1308 it means that we are to pass this arg in the register(s) designated
1309 by the PARALLEL, but also to pass it in the stack. */
1310 if (args
[i
].reg
&& GET_CODE (args
[i
].reg
) == PARALLEL
1311 && XEXP (XVECEXP (args
[i
].reg
, 0, 0), 0) == 0)
1312 args
[i
].pass_on_stack
= 1;
1314 /* If this is an addressable type, we must preallocate the stack
1315 since we must evaluate the object into its final location.
1317 If this is to be passed in both registers and the stack, it is simpler
1319 if (TREE_ADDRESSABLE (type
)
1320 || (args
[i
].pass_on_stack
&& args
[i
].reg
!= 0))
1321 *must_preallocate
= 1;
1323 /* Compute the stack-size of this argument. */
1324 if (args
[i
].reg
== 0 || args
[i
].partial
!= 0
1325 || reg_parm_stack_space
> 0
1326 || args
[i
].pass_on_stack
)
1327 locate_and_pad_parm (mode
, type
,
1328 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1333 reg_parm_stack_space
,
1334 args
[i
].pass_on_stack
? 0 : args
[i
].partial
,
1335 fndecl
, args_size
, &args
[i
].locate
);
1336 #ifdef BLOCK_REG_PADDING
1338 /* The argument is passed entirely in registers. See at which
1339 end it should be padded. */
1340 args
[i
].locate
.where_pad
=
1341 BLOCK_REG_PADDING (mode
, type
,
1342 int_size_in_bytes (type
) <= UNITS_PER_WORD
);
1345 /* Update ARGS_SIZE, the total stack space for args so far. */
1347 args_size
->constant
+= args
[i
].locate
.size
.constant
;
1348 if (args
[i
].locate
.size
.var
)
1349 ADD_PARM_SIZE (*args_size
, args
[i
].locate
.size
.var
);
1351 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1352 have been used, etc. */
1354 targetm
.calls
.function_arg_advance (args_so_far
, TYPE_MODE (type
),
1355 type
, argpos
< n_named_args
);
1359 /* Update ARGS_SIZE to contain the total size for the argument block.
1360 Return the original constant component of the argument block's size.
1362 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1363 for arguments passed in registers. */
1366 compute_argument_block_size (int reg_parm_stack_space
,
1367 struct args_size
*args_size
,
1368 tree fndecl ATTRIBUTE_UNUSED
,
1369 tree fntype ATTRIBUTE_UNUSED
,
1370 int preferred_stack_boundary ATTRIBUTE_UNUSED
)
1372 int unadjusted_args_size
= args_size
->constant
;
1374 /* For accumulate outgoing args mode we don't need to align, since the frame
1375 will be already aligned. Align to STACK_BOUNDARY in order to prevent
1376 backends from generating misaligned frame sizes. */
1377 if (ACCUMULATE_OUTGOING_ARGS
&& preferred_stack_boundary
> STACK_BOUNDARY
)
1378 preferred_stack_boundary
= STACK_BOUNDARY
;
1380 /* Compute the actual size of the argument block required. The variable
1381 and constant sizes must be combined, the size may have to be rounded,
1382 and there may be a minimum required size. */
1386 args_size
->var
= ARGS_SIZE_TREE (*args_size
);
1387 args_size
->constant
= 0;
1389 preferred_stack_boundary
/= BITS_PER_UNIT
;
1390 if (preferred_stack_boundary
> 1)
1392 /* We don't handle this case yet. To handle it correctly we have
1393 to add the delta, round and subtract the delta.
1394 Currently no machine description requires this support. */
1395 gcc_assert (!(stack_pointer_delta
& (preferred_stack_boundary
- 1)));
1396 args_size
->var
= round_up (args_size
->var
, preferred_stack_boundary
);
1399 if (reg_parm_stack_space
> 0)
1402 = size_binop (MAX_EXPR
, args_size
->var
,
1403 ssize_int (reg_parm_stack_space
));
1405 /* The area corresponding to register parameters is not to count in
1406 the size of the block we need. So make the adjustment. */
1407 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
1409 = size_binop (MINUS_EXPR
, args_size
->var
,
1410 ssize_int (reg_parm_stack_space
));
1415 preferred_stack_boundary
/= BITS_PER_UNIT
;
1416 if (preferred_stack_boundary
< 1)
1417 preferred_stack_boundary
= 1;
1418 args_size
->constant
= (((args_size
->constant
1419 + stack_pointer_delta
1420 + preferred_stack_boundary
- 1)
1421 / preferred_stack_boundary
1422 * preferred_stack_boundary
)
1423 - stack_pointer_delta
);
1425 args_size
->constant
= MAX (args_size
->constant
,
1426 reg_parm_stack_space
);
1428 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
1429 args_size
->constant
-= reg_parm_stack_space
;
1431 return unadjusted_args_size
;
1434 /* Precompute parameters as needed for a function call.
1436 FLAGS is mask of ECF_* constants.
1438 NUM_ACTUALS is the number of arguments.
1440 ARGS is an array containing information for each argument; this
1441 routine fills in the INITIAL_VALUE and VALUE fields for each
1442 precomputed argument. */
1445 precompute_arguments (int num_actuals
, struct arg_data
*args
)
1449 /* If this is a libcall, then precompute all arguments so that we do not
1450 get extraneous instructions emitted as part of the libcall sequence. */
1452 /* If we preallocated the stack space, and some arguments must be passed
1453 on the stack, then we must precompute any parameter which contains a
1454 function call which will store arguments on the stack.
1455 Otherwise, evaluating the parameter may clobber previous parameters
1456 which have already been stored into the stack. (we have code to avoid
1457 such case by saving the outgoing stack arguments, but it results in
1459 if (!ACCUMULATE_OUTGOING_ARGS
)
1462 for (i
= 0; i
< num_actuals
; i
++)
1465 enum machine_mode mode
;
1467 if (TREE_CODE (args
[i
].tree_value
) != CALL_EXPR
)
1470 /* If this is an addressable type, we cannot pre-evaluate it. */
1471 type
= TREE_TYPE (args
[i
].tree_value
);
1472 gcc_assert (!TREE_ADDRESSABLE (type
));
1474 args
[i
].initial_value
= args
[i
].value
1475 = expand_normal (args
[i
].tree_value
);
1477 mode
= TYPE_MODE (type
);
1478 if (mode
!= args
[i
].mode
)
1480 int unsignedp
= args
[i
].unsignedp
;
1482 = convert_modes (args
[i
].mode
, mode
,
1483 args
[i
].value
, args
[i
].unsignedp
);
1485 /* CSE will replace this only if it contains args[i].value
1486 pseudo, so convert it down to the declared mode using
1488 if (REG_P (args
[i
].value
)
1489 && GET_MODE_CLASS (args
[i
].mode
) == MODE_INT
1490 && promote_mode (type
, mode
, &unsignedp
) != args
[i
].mode
)
1492 args
[i
].initial_value
1493 = gen_lowpart_SUBREG (mode
, args
[i
].value
);
1494 SUBREG_PROMOTED_VAR_P (args
[i
].initial_value
) = 1;
1495 SUBREG_PROMOTED_UNSIGNED_SET (args
[i
].initial_value
,
1502 /* Given the current state of MUST_PREALLOCATE and information about
1503 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
1504 compute and return the final value for MUST_PREALLOCATE. */
1507 finalize_must_preallocate (int must_preallocate
, int num_actuals
,
1508 struct arg_data
*args
, struct args_size
*args_size
)
1510 /* See if we have or want to preallocate stack space.
1512 If we would have to push a partially-in-regs parm
1513 before other stack parms, preallocate stack space instead.
1515 If the size of some parm is not a multiple of the required stack
1516 alignment, we must preallocate.
1518 If the total size of arguments that would otherwise create a copy in
1519 a temporary (such as a CALL) is more than half the total argument list
1520 size, preallocation is faster.
1522 Another reason to preallocate is if we have a machine (like the m88k)
1523 where stack alignment is required to be maintained between every
1524 pair of insns, not just when the call is made. However, we assume here
1525 that such machines either do not have push insns (and hence preallocation
1526 would occur anyway) or the problem is taken care of with
1529 if (! must_preallocate
)
1531 int partial_seen
= 0;
1532 int copy_to_evaluate_size
= 0;
1535 for (i
= 0; i
< num_actuals
&& ! must_preallocate
; i
++)
1537 if (args
[i
].partial
> 0 && ! args
[i
].pass_on_stack
)
1539 else if (partial_seen
&& args
[i
].reg
== 0)
1540 must_preallocate
= 1;
1542 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
1543 && (TREE_CODE (args
[i
].tree_value
) == CALL_EXPR
1544 || TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
1545 || TREE_CODE (args
[i
].tree_value
) == COND_EXPR
1546 || TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
))))
1547 copy_to_evaluate_size
1548 += int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1551 if (copy_to_evaluate_size
* 2 >= args_size
->constant
1552 && args_size
->constant
> 0)
1553 must_preallocate
= 1;
1555 return must_preallocate
;
1558 /* If we preallocated stack space, compute the address of each argument
1559 and store it into the ARGS array.
1561 We need not ensure it is a valid memory address here; it will be
1562 validized when it is used.
1564 ARGBLOCK is an rtx for the address of the outgoing arguments. */
1567 compute_argument_addresses (struct arg_data
*args
, rtx argblock
, int num_actuals
)
1571 rtx arg_reg
= argblock
;
1572 int i
, arg_offset
= 0;
1574 if (GET_CODE (argblock
) == PLUS
)
1575 arg_reg
= XEXP (argblock
, 0), arg_offset
= INTVAL (XEXP (argblock
, 1));
1577 for (i
= 0; i
< num_actuals
; i
++)
1579 rtx offset
= ARGS_SIZE_RTX (args
[i
].locate
.offset
);
1580 rtx slot_offset
= ARGS_SIZE_RTX (args
[i
].locate
.slot_offset
);
1582 unsigned int align
, boundary
;
1583 unsigned int units_on_stack
= 0;
1584 enum machine_mode partial_mode
= VOIDmode
;
1586 /* Skip this parm if it will not be passed on the stack. */
1587 if (! args
[i
].pass_on_stack
1589 && args
[i
].partial
== 0)
1592 if (CONST_INT_P (offset
))
1593 addr
= plus_constant (Pmode
, arg_reg
, INTVAL (offset
));
1595 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, offset
);
1597 addr
= plus_constant (Pmode
, addr
, arg_offset
);
1599 if (args
[i
].partial
!= 0)
1601 /* Only part of the parameter is being passed on the stack.
1602 Generate a simple memory reference of the correct size. */
1603 units_on_stack
= args
[i
].locate
.size
.constant
;
1604 partial_mode
= mode_for_size (units_on_stack
* BITS_PER_UNIT
,
1606 args
[i
].stack
= gen_rtx_MEM (partial_mode
, addr
);
1607 set_mem_size (args
[i
].stack
, units_on_stack
);
1611 args
[i
].stack
= gen_rtx_MEM (args
[i
].mode
, addr
);
1612 set_mem_attributes (args
[i
].stack
,
1613 TREE_TYPE (args
[i
].tree_value
), 1);
1615 align
= BITS_PER_UNIT
;
1616 boundary
= args
[i
].locate
.boundary
;
1617 if (args
[i
].locate
.where_pad
!= downward
)
1619 else if (CONST_INT_P (offset
))
1621 align
= INTVAL (offset
) * BITS_PER_UNIT
| boundary
;
1622 align
= align
& -align
;
1624 set_mem_align (args
[i
].stack
, align
);
1626 if (CONST_INT_P (slot_offset
))
1627 addr
= plus_constant (Pmode
, arg_reg
, INTVAL (slot_offset
));
1629 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, slot_offset
);
1631 addr
= plus_constant (Pmode
, addr
, arg_offset
);
1633 if (args
[i
].partial
!= 0)
1635 /* Only part of the parameter is being passed on the stack.
1636 Generate a simple memory reference of the correct size.
1638 args
[i
].stack_slot
= gen_rtx_MEM (partial_mode
, addr
);
1639 set_mem_size (args
[i
].stack_slot
, units_on_stack
);
1643 args
[i
].stack_slot
= gen_rtx_MEM (args
[i
].mode
, addr
);
1644 set_mem_attributes (args
[i
].stack_slot
,
1645 TREE_TYPE (args
[i
].tree_value
), 1);
1647 set_mem_align (args
[i
].stack_slot
, args
[i
].locate
.boundary
);
1649 /* Function incoming arguments may overlap with sibling call
1650 outgoing arguments and we cannot allow reordering of reads
1651 from function arguments with stores to outgoing arguments
1652 of sibling calls. */
1653 set_mem_alias_set (args
[i
].stack
, 0);
1654 set_mem_alias_set (args
[i
].stack_slot
, 0);
1659 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
1660 in a call instruction.
1662 FNDECL is the tree node for the target function. For an indirect call
1663 FNDECL will be NULL_TREE.
1665 ADDR is the operand 0 of CALL_EXPR for this call. */
1668 rtx_for_function_call (tree fndecl
, tree addr
)
1672 /* Get the function to call, in the form of RTL. */
1675 if (!TREE_USED (fndecl
) && fndecl
!= current_function_decl
)
1676 TREE_USED (fndecl
) = 1;
1678 /* Get a SYMBOL_REF rtx for the function address. */
1679 funexp
= XEXP (DECL_RTL (fndecl
), 0);
1682 /* Generate an rtx (probably a pseudo-register) for the address. */
1685 funexp
= expand_normal (addr
);
1686 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
1691 /* Internal state for internal_arg_pointer_based_exp and its helpers. */
1694 /* Last insn that has been scanned by internal_arg_pointer_based_exp_scan,
1695 or NULL_RTX if none has been scanned yet. */
1697 /* Vector indexed by REGNO - FIRST_PSEUDO_REGISTER, recording if a pseudo is
1698 based on crtl->args.internal_arg_pointer. The element is NULL_RTX if the
1699 pseudo isn't based on it, a CONST_INT offset if the pseudo is based on it
1700 with fixed offset, or PC if this is with variable or unknown offset. */
1702 } internal_arg_pointer_exp_state
;
1704 static rtx
internal_arg_pointer_based_exp (rtx
, bool);
1706 /* Helper function for internal_arg_pointer_based_exp. Scan insns in
1707 the tail call sequence, starting with first insn that hasn't been
1708 scanned yet, and note for each pseudo on the LHS whether it is based
1709 on crtl->args.internal_arg_pointer or not, and what offset from that
1710 that pointer it has. */
1713 internal_arg_pointer_based_exp_scan (void)
1715 rtx insn
, scan_start
= internal_arg_pointer_exp_state
.scan_start
;
1717 if (scan_start
== NULL_RTX
)
1718 insn
= get_insns ();
1720 insn
= NEXT_INSN (scan_start
);
1724 rtx set
= single_set (insn
);
1725 if (set
&& REG_P (SET_DEST (set
)) && !HARD_REGISTER_P (SET_DEST (set
)))
1728 unsigned int idx
= REGNO (SET_DEST (set
)) - FIRST_PSEUDO_REGISTER
;
1729 /* Punt on pseudos set multiple times. */
1730 if (idx
< internal_arg_pointer_exp_state
.cache
.length ()
1731 && (internal_arg_pointer_exp_state
.cache
[idx
]
1735 val
= internal_arg_pointer_based_exp (SET_SRC (set
), false);
1736 if (val
!= NULL_RTX
)
1738 if (idx
>= internal_arg_pointer_exp_state
.cache
.length ())
1739 internal_arg_pointer_exp_state
.cache
1740 .safe_grow_cleared (idx
+ 1);
1741 internal_arg_pointer_exp_state
.cache
[idx
] = val
;
1744 if (NEXT_INSN (insn
) == NULL_RTX
)
1746 insn
= NEXT_INSN (insn
);
1749 internal_arg_pointer_exp_state
.scan_start
= scan_start
;
1752 /* Helper function for internal_arg_pointer_based_exp, called through
1753 for_each_rtx. Return 1 if *LOC is a register based on
1754 crtl->args.internal_arg_pointer. Return -1 if *LOC is not based on it
1755 and the subexpressions need not be examined. Otherwise return 0. */
1758 internal_arg_pointer_based_exp_1 (rtx
*loc
, void *data ATTRIBUTE_UNUSED
)
1760 if (REG_P (*loc
) && internal_arg_pointer_based_exp (*loc
, false) != NULL_RTX
)
1767 /* Compute whether RTL is based on crtl->args.internal_arg_pointer. Return
1768 NULL_RTX if RTL isn't based on it, a CONST_INT offset if RTL is based on
1769 it with fixed offset, or PC if this is with variable or unknown offset.
1770 TOPLEVEL is true if the function is invoked at the topmost level. */
1773 internal_arg_pointer_based_exp (rtx rtl
, bool toplevel
)
1775 if (CONSTANT_P (rtl
))
1778 if (rtl
== crtl
->args
.internal_arg_pointer
)
1781 if (REG_P (rtl
) && HARD_REGISTER_P (rtl
))
1784 if (GET_CODE (rtl
) == PLUS
&& CONST_INT_P (XEXP (rtl
, 1)))
1786 rtx val
= internal_arg_pointer_based_exp (XEXP (rtl
, 0), toplevel
);
1787 if (val
== NULL_RTX
|| val
== pc_rtx
)
1789 return plus_constant (Pmode
, val
, INTVAL (XEXP (rtl
, 1)));
1792 /* When called at the topmost level, scan pseudo assignments in between the
1793 last scanned instruction in the tail call sequence and the latest insn
1794 in that sequence. */
1796 internal_arg_pointer_based_exp_scan ();
1800 unsigned int idx
= REGNO (rtl
) - FIRST_PSEUDO_REGISTER
;
1801 if (idx
< internal_arg_pointer_exp_state
.cache
.length ())
1802 return internal_arg_pointer_exp_state
.cache
[idx
];
1807 if (for_each_rtx (&rtl
, internal_arg_pointer_based_exp_1
, NULL
))
1813 /* Return true if and only if SIZE storage units (usually bytes)
1814 starting from address ADDR overlap with already clobbered argument
1815 area. This function is used to determine if we should give up a
1819 mem_overlaps_already_clobbered_arg_p (rtx addr
, unsigned HOST_WIDE_INT size
)
1824 if (bitmap_empty_p (stored_args_map
))
1826 val
= internal_arg_pointer_based_exp (addr
, true);
1827 if (val
== NULL_RTX
)
1829 else if (val
== pc_rtx
)
1833 #ifdef STACK_GROWS_DOWNWARD
1834 i
-= crtl
->args
.pretend_args_size
;
1836 i
+= crtl
->args
.pretend_args_size
;
1839 #ifdef ARGS_GROW_DOWNWARD
1844 unsigned HOST_WIDE_INT k
;
1846 for (k
= 0; k
< size
; k
++)
1847 if (i
+ k
< SBITMAP_SIZE (stored_args_map
)
1848 && bitmap_bit_p (stored_args_map
, i
+ k
))
1855 /* Do the register loads required for any wholly-register parms or any
1856 parms which are passed both on the stack and in a register. Their
1857 expressions were already evaluated.
1859 Mark all register-parms as living through the call, putting these USE
1860 insns in the CALL_INSN_FUNCTION_USAGE field.
1862 When IS_SIBCALL, perform the check_sibcall_argument_overlap
1863 checking, setting *SIBCALL_FAILURE if appropriate. */
1866 load_register_parameters (struct arg_data
*args
, int num_actuals
,
1867 rtx
*call_fusage
, int flags
, int is_sibcall
,
1868 int *sibcall_failure
)
1872 for (i
= 0; i
< num_actuals
; i
++)
1874 rtx reg
= ((flags
& ECF_SIBCALL
)
1875 ? args
[i
].tail_call_reg
: args
[i
].reg
);
1878 int partial
= args
[i
].partial
;
1881 rtx before_arg
= get_last_insn ();
1882 /* Set non-negative if we must move a word at a time, even if
1883 just one word (e.g, partial == 4 && mode == DFmode). Set
1884 to -1 if we just use a normal move insn. This value can be
1885 zero if the argument is a zero size structure. */
1887 if (GET_CODE (reg
) == PARALLEL
)
1891 gcc_assert (partial
% UNITS_PER_WORD
== 0);
1892 nregs
= partial
/ UNITS_PER_WORD
;
1894 else if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
)
1896 size
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1897 nregs
= (size
+ (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
1900 size
= GET_MODE_SIZE (args
[i
].mode
);
1902 /* Handle calls that pass values in multiple non-contiguous
1903 locations. The Irix 6 ABI has examples of this. */
1905 if (GET_CODE (reg
) == PARALLEL
)
1906 emit_group_move (reg
, args
[i
].parallel_value
);
1908 /* If simple case, just do move. If normal partial, store_one_arg
1909 has already loaded the register for us. In all other cases,
1910 load the register(s) from memory. */
1912 else if (nregs
== -1)
1914 emit_move_insn (reg
, args
[i
].value
);
1915 #ifdef BLOCK_REG_PADDING
1916 /* Handle case where we have a value that needs shifting
1917 up to the msb. eg. a QImode value and we're padding
1918 upward on a BYTES_BIG_ENDIAN machine. */
1919 if (size
< UNITS_PER_WORD
1920 && (args
[i
].locate
.where_pad
1921 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
1924 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
1926 /* Assigning REG here rather than a temp makes CALL_FUSAGE
1927 report the whole reg as used. Strictly speaking, the
1928 call only uses SIZE bytes at the msb end, but it doesn't
1929 seem worth generating rtl to say that. */
1930 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
1931 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, shift
, reg
, 1);
1933 emit_move_insn (reg
, x
);
1938 /* If we have pre-computed the values to put in the registers in
1939 the case of non-aligned structures, copy them in now. */
1941 else if (args
[i
].n_aligned_regs
!= 0)
1942 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1943 emit_move_insn (gen_rtx_REG (word_mode
, REGNO (reg
) + j
),
1944 args
[i
].aligned_regs
[j
]);
1946 else if (partial
== 0 || args
[i
].pass_on_stack
)
1948 rtx mem
= validize_mem (args
[i
].value
);
1950 /* Check for overlap with already clobbered argument area,
1951 providing that this has non-zero size. */
1954 || mem_overlaps_already_clobbered_arg_p
1955 (XEXP (args
[i
].value
, 0), size
)))
1956 *sibcall_failure
= 1;
1958 /* Handle a BLKmode that needs shifting. */
1959 if (nregs
== 1 && size
< UNITS_PER_WORD
1960 #ifdef BLOCK_REG_PADDING
1961 && args
[i
].locate
.where_pad
== downward
1967 rtx tem
= operand_subword_force (mem
, 0, args
[i
].mode
);
1968 rtx ri
= gen_rtx_REG (word_mode
, REGNO (reg
));
1969 rtx x
= gen_reg_rtx (word_mode
);
1970 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
1971 enum tree_code dir
= BYTES_BIG_ENDIAN
? RSHIFT_EXPR
1974 emit_move_insn (x
, tem
);
1975 x
= expand_shift (dir
, word_mode
, x
, shift
, ri
, 1);
1977 emit_move_insn (ri
, x
);
1980 move_block_to_reg (REGNO (reg
), mem
, nregs
, args
[i
].mode
);
1983 /* When a parameter is a block, and perhaps in other cases, it is
1984 possible that it did a load from an argument slot that was
1985 already clobbered. */
1987 && check_sibcall_argument_overlap (before_arg
, &args
[i
], 0))
1988 *sibcall_failure
= 1;
1990 /* Handle calls that pass values in multiple non-contiguous
1991 locations. The Irix 6 ABI has examples of this. */
1992 if (GET_CODE (reg
) == PARALLEL
)
1993 use_group_regs (call_fusage
, reg
);
1994 else if (nregs
== -1)
1995 use_reg_mode (call_fusage
, reg
,
1996 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)));
1998 use_regs (call_fusage
, REGNO (reg
), nregs
);
2003 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
2004 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
2005 bytes, then we would need to push some additional bytes to pad the
2006 arguments. So, we compute an adjust to the stack pointer for an
2007 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
2008 bytes. Then, when the arguments are pushed the stack will be perfectly
2009 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
2010 be popped after the call. Returns the adjustment. */
2013 combine_pending_stack_adjustment_and_call (int unadjusted_args_size
,
2014 struct args_size
*args_size
,
2015 unsigned int preferred_unit_stack_boundary
)
2017 /* The number of bytes to pop so that the stack will be
2018 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
2019 HOST_WIDE_INT adjustment
;
2020 /* The alignment of the stack after the arguments are pushed, if we
2021 just pushed the arguments without adjust the stack here. */
2022 unsigned HOST_WIDE_INT unadjusted_alignment
;
2024 unadjusted_alignment
2025 = ((stack_pointer_delta
+ unadjusted_args_size
)
2026 % preferred_unit_stack_boundary
);
2028 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
2029 as possible -- leaving just enough left to cancel out the
2030 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
2031 PENDING_STACK_ADJUST is non-negative, and congruent to
2032 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
2034 /* Begin by trying to pop all the bytes. */
2035 unadjusted_alignment
2036 = (unadjusted_alignment
2037 - (pending_stack_adjust
% preferred_unit_stack_boundary
));
2038 adjustment
= pending_stack_adjust
;
2039 /* Push enough additional bytes that the stack will be aligned
2040 after the arguments are pushed. */
2041 if (preferred_unit_stack_boundary
> 1)
2043 if (unadjusted_alignment
> 0)
2044 adjustment
-= preferred_unit_stack_boundary
- unadjusted_alignment
;
2046 adjustment
+= unadjusted_alignment
;
2049 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
2050 bytes after the call. The right number is the entire
2051 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
2052 by the arguments in the first place. */
2054 = pending_stack_adjust
- adjustment
+ unadjusted_args_size
;
2059 /* Scan X expression if it does not dereference any argument slots
2060 we already clobbered by tail call arguments (as noted in stored_args_map
2062 Return nonzero if X expression dereferences such argument slots,
2066 check_sibcall_argument_overlap_1 (rtx x
)
2075 code
= GET_CODE (x
);
2077 /* We need not check the operands of the CALL expression itself. */
2082 return mem_overlaps_already_clobbered_arg_p (XEXP (x
, 0),
2083 GET_MODE_SIZE (GET_MODE (x
)));
2085 /* Scan all subexpressions. */
2086 fmt
= GET_RTX_FORMAT (code
);
2087 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
2091 if (check_sibcall_argument_overlap_1 (XEXP (x
, i
)))
2094 else if (*fmt
== 'E')
2096 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2097 if (check_sibcall_argument_overlap_1 (XVECEXP (x
, i
, j
)))
2104 /* Scan sequence after INSN if it does not dereference any argument slots
2105 we already clobbered by tail call arguments (as noted in stored_args_map
2106 bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
2107 stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP
2108 should be 0). Return nonzero if sequence after INSN dereferences such argument
2109 slots, zero otherwise. */
2112 check_sibcall_argument_overlap (rtx insn
, struct arg_data
*arg
, int mark_stored_args_map
)
2116 if (insn
== NULL_RTX
)
2117 insn
= get_insns ();
2119 insn
= NEXT_INSN (insn
);
2121 for (; insn
; insn
= NEXT_INSN (insn
))
2123 && check_sibcall_argument_overlap_1 (PATTERN (insn
)))
2126 if (mark_stored_args_map
)
2128 #ifdef ARGS_GROW_DOWNWARD
2129 low
= -arg
->locate
.slot_offset
.constant
- arg
->locate
.size
.constant
;
2131 low
= arg
->locate
.slot_offset
.constant
;
2134 for (high
= low
+ arg
->locate
.size
.constant
; low
< high
; low
++)
2135 bitmap_set_bit (stored_args_map
, low
);
2137 return insn
!= NULL_RTX
;
2140 /* Given that a function returns a value of mode MODE at the most
2141 significant end of hard register VALUE, shift VALUE left or right
2142 as specified by LEFT_P. Return true if some action was needed. */
2145 shift_return_value (enum machine_mode mode
, bool left_p
, rtx value
)
2147 HOST_WIDE_INT shift
;
2149 gcc_assert (REG_P (value
) && HARD_REGISTER_P (value
));
2150 shift
= GET_MODE_BITSIZE (GET_MODE (value
)) - GET_MODE_BITSIZE (mode
);
2154 /* Use ashr rather than lshr for right shifts. This is for the benefit
2155 of the MIPS port, which requires SImode values to be sign-extended
2156 when stored in 64-bit registers. */
2157 if (!force_expand_binop (GET_MODE (value
), left_p
? ashl_optab
: ashr_optab
,
2158 value
, GEN_INT (shift
), value
, 1, OPTAB_WIDEN
))
2163 /* If X is a likely-spilled register value, copy it to a pseudo
2164 register and return that register. Return X otherwise. */
2167 avoid_likely_spilled_reg (rtx x
)
2172 && HARD_REGISTER_P (x
)
2173 && targetm
.class_likely_spilled_p (REGNO_REG_CLASS (REGNO (x
))))
2175 /* Make sure that we generate a REG rather than a CONCAT.
2176 Moves into CONCATs can need nontrivial instructions,
2177 and the whole point of this function is to avoid
2178 using the hard register directly in such a situation. */
2179 generating_concat_p
= 0;
2180 new_rtx
= gen_reg_rtx (GET_MODE (x
));
2181 generating_concat_p
= 1;
2182 emit_move_insn (new_rtx
, x
);
2188 /* Generate all the code for a CALL_EXPR exp
2189 and return an rtx for its value.
2190 Store the value in TARGET (specified as an rtx) if convenient.
2191 If the value is stored in TARGET then TARGET is returned.
2192 If IGNORE is nonzero, then we ignore the value of the function call. */
2195 expand_call (tree exp
, rtx target
, int ignore
)
2197 /* Nonzero if we are currently expanding a call. */
2198 static int currently_expanding_call
= 0;
2200 /* RTX for the function to be called. */
2202 /* Sequence of insns to perform a normal "call". */
2203 rtx normal_call_insns
= NULL_RTX
;
2204 /* Sequence of insns to perform a tail "call". */
2205 rtx tail_call_insns
= NULL_RTX
;
2206 /* Data type of the function. */
2208 tree type_arg_types
;
2210 /* Declaration of the function being called,
2211 or 0 if the function is computed (not known by name). */
2213 /* The type of the function being called. */
2215 bool try_tail_call
= CALL_EXPR_TAILCALL (exp
);
2218 /* Register in which non-BLKmode value will be returned,
2219 or 0 if no value or if value is BLKmode. */
2221 /* Address where we should return a BLKmode value;
2222 0 if value not BLKmode. */
2223 rtx structure_value_addr
= 0;
2224 /* Nonzero if that address is being passed by treating it as
2225 an extra, implicit first parameter. Otherwise,
2226 it is passed by being copied directly into struct_value_rtx. */
2227 int structure_value_addr_parm
= 0;
2228 /* Holds the value of implicit argument for the struct value. */
2229 tree structure_value_addr_value
= NULL_TREE
;
2230 /* Size of aggregate value wanted, or zero if none wanted
2231 or if we are using the non-reentrant PCC calling convention
2232 or expecting the value in registers. */
2233 HOST_WIDE_INT struct_value_size
= 0;
2234 /* Nonzero if called function returns an aggregate in memory PCC style,
2235 by returning the address of where to find it. */
2236 int pcc_struct_value
= 0;
2237 rtx struct_value
= 0;
2239 /* Number of actual parameters in this call, including struct value addr. */
2241 /* Number of named args. Args after this are anonymous ones
2242 and they must all go on the stack. */
2244 /* Number of complex actual arguments that need to be split. */
2245 int num_complex_actuals
= 0;
2247 /* Vector of information about each argument.
2248 Arguments are numbered in the order they will be pushed,
2249 not the order they are written. */
2250 struct arg_data
*args
;
2252 /* Total size in bytes of all the stack-parms scanned so far. */
2253 struct args_size args_size
;
2254 struct args_size adjusted_args_size
;
2255 /* Size of arguments before any adjustments (such as rounding). */
2256 int unadjusted_args_size
;
2257 /* Data on reg parms scanned so far. */
2258 CUMULATIVE_ARGS args_so_far_v
;
2259 cumulative_args_t args_so_far
;
2260 /* Nonzero if a reg parm has been scanned. */
2262 /* Nonzero if this is an indirect function call. */
2264 /* Nonzero if we must avoid push-insns in the args for this call.
2265 If stack space is allocated for register parameters, but not by the
2266 caller, then it is preallocated in the fixed part of the stack frame.
2267 So the entire argument block must then be preallocated (i.e., we
2268 ignore PUSH_ROUNDING in that case). */
2270 int must_preallocate
= !PUSH_ARGS
;
2272 /* Size of the stack reserved for parameter registers. */
2273 int reg_parm_stack_space
= 0;
2275 /* Address of space preallocated for stack parms
2276 (on machines that lack push insns), or 0 if space not preallocated. */
2279 /* Mask of ECF_ and ERF_ flags. */
2281 int return_flags
= 0;
2282 #ifdef REG_PARM_STACK_SPACE
2283 /* Define the boundary of the register parm stack space that needs to be
2285 int low_to_save
, high_to_save
;
2286 rtx save_area
= 0; /* Place that it is saved */
2289 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
2290 char *initial_stack_usage_map
= stack_usage_map
;
2291 char *stack_usage_map_buf
= NULL
;
2293 int old_stack_allocated
;
2295 /* State variables to track stack modifications. */
2296 rtx old_stack_level
= 0;
2297 int old_stack_arg_under_construction
= 0;
2298 int old_pending_adj
= 0;
2299 int old_inhibit_defer_pop
= inhibit_defer_pop
;
2301 /* Some stack pointer alterations we make are performed via
2302 allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
2303 which we then also need to save/restore along the way. */
2304 int old_stack_pointer_delta
= 0;
2307 tree addr
= CALL_EXPR_FN (exp
);
2309 /* The alignment of the stack, in bits. */
2310 unsigned HOST_WIDE_INT preferred_stack_boundary
;
2311 /* The alignment of the stack, in bytes. */
2312 unsigned HOST_WIDE_INT preferred_unit_stack_boundary
;
2313 /* The static chain value to use for this call. */
2314 rtx static_chain_value
;
2315 /* See if this is "nothrow" function call. */
2316 if (TREE_NOTHROW (exp
))
2317 flags
|= ECF_NOTHROW
;
2319 /* See if we can find a DECL-node for the actual function, and get the
2320 function attributes (flags) from the function decl or type node. */
2321 fndecl
= get_callee_fndecl (exp
);
2324 fntype
= TREE_TYPE (fndecl
);
2325 flags
|= flags_from_decl_or_type (fndecl
);
2326 return_flags
|= decl_return_flags (fndecl
);
2330 fntype
= TREE_TYPE (TREE_TYPE (addr
));
2331 flags
|= flags_from_decl_or_type (fntype
);
2333 rettype
= TREE_TYPE (exp
);
2335 struct_value
= targetm
.calls
.struct_value_rtx (fntype
, 0);
2337 /* Warn if this value is an aggregate type,
2338 regardless of which calling convention we are using for it. */
2339 if (AGGREGATE_TYPE_P (rettype
))
2340 warning (OPT_Waggregate_return
, "function call has aggregate value");
2342 /* If the result of a non looping pure or const function call is
2343 ignored (or void), and none of its arguments are volatile, we can
2344 avoid expanding the call and just evaluate the arguments for
2346 if ((flags
& (ECF_CONST
| ECF_PURE
))
2347 && (!(flags
& ECF_LOOPING_CONST_OR_PURE
))
2348 && (ignore
|| target
== const0_rtx
2349 || TYPE_MODE (rettype
) == VOIDmode
))
2351 bool volatilep
= false;
2353 call_expr_arg_iterator iter
;
2355 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
2356 if (TREE_THIS_VOLATILE (arg
))
2364 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
2365 expand_expr (arg
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
2370 #ifdef REG_PARM_STACK_SPACE
2371 reg_parm_stack_space
= REG_PARM_STACK_SPACE (!fndecl
? fntype
: fndecl
);
2374 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
2375 && reg_parm_stack_space
> 0 && PUSH_ARGS
)
2376 must_preallocate
= 1;
2378 /* Set up a place to return a structure. */
2380 /* Cater to broken compilers. */
2381 if (aggregate_value_p (exp
, fntype
))
2383 /* This call returns a big structure. */
2384 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
2386 #ifdef PCC_STATIC_STRUCT_RETURN
2388 pcc_struct_value
= 1;
2390 #else /* not PCC_STATIC_STRUCT_RETURN */
2392 struct_value_size
= int_size_in_bytes (rettype
);
2394 if (target
&& MEM_P (target
) && CALL_EXPR_RETURN_SLOT_OPT (exp
))
2395 structure_value_addr
= XEXP (target
, 0);
2398 /* For variable-sized objects, we must be called with a target
2399 specified. If we were to allocate space on the stack here,
2400 we would have no way of knowing when to free it. */
2401 rtx d
= assign_temp (rettype
, 1, 1);
2402 structure_value_addr
= XEXP (d
, 0);
2406 #endif /* not PCC_STATIC_STRUCT_RETURN */
2409 /* Figure out the amount to which the stack should be aligned. */
2410 preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
2413 struct cgraph_rtl_info
*i
= cgraph_rtl_info (fndecl
);
2414 /* Without automatic stack alignment, we can't increase preferred
2415 stack boundary. With automatic stack alignment, it is
2416 unnecessary since unless we can guarantee that all callers will
2417 align the outgoing stack properly, callee has to align its
2420 && i
->preferred_incoming_stack_boundary
2421 && i
->preferred_incoming_stack_boundary
< preferred_stack_boundary
)
2422 preferred_stack_boundary
= i
->preferred_incoming_stack_boundary
;
2425 /* Operand 0 is a pointer-to-function; get the type of the function. */
2426 funtype
= TREE_TYPE (addr
);
2427 gcc_assert (POINTER_TYPE_P (funtype
));
2428 funtype
= TREE_TYPE (funtype
);
2430 /* Count whether there are actual complex arguments that need to be split
2431 into their real and imaginary parts. Munge the type_arg_types
2432 appropriately here as well. */
2433 if (targetm
.calls
.split_complex_arg
)
2435 call_expr_arg_iterator iter
;
2437 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
2439 tree type
= TREE_TYPE (arg
);
2440 if (type
&& TREE_CODE (type
) == COMPLEX_TYPE
2441 && targetm
.calls
.split_complex_arg (type
))
2442 num_complex_actuals
++;
2444 type_arg_types
= split_complex_types (TYPE_ARG_TYPES (funtype
));
2447 type_arg_types
= TYPE_ARG_TYPES (funtype
);
2449 if (flags
& ECF_MAY_BE_ALLOCA
)
2450 cfun
->calls_alloca
= 1;
2452 /* If struct_value_rtx is 0, it means pass the address
2453 as if it were an extra parameter. Put the argument expression
2454 in structure_value_addr_value. */
2455 if (structure_value_addr
&& struct_value
== 0)
2457 /* If structure_value_addr is a REG other than
2458 virtual_outgoing_args_rtx, we can use always use it. If it
2459 is not a REG, we must always copy it into a register.
2460 If it is virtual_outgoing_args_rtx, we must copy it to another
2461 register in some cases. */
2462 rtx temp
= (!REG_P (structure_value_addr
)
2463 || (ACCUMULATE_OUTGOING_ARGS
2464 && stack_arg_under_construction
2465 && structure_value_addr
== virtual_outgoing_args_rtx
)
2466 ? copy_addr_to_reg (convert_memory_address
2467 (Pmode
, structure_value_addr
))
2468 : structure_value_addr
);
2470 structure_value_addr_value
=
2471 make_tree (build_pointer_type (TREE_TYPE (funtype
)), temp
);
2472 structure_value_addr_parm
= 1;
2475 /* Count the arguments and set NUM_ACTUALS. */
2477 call_expr_nargs (exp
) + num_complex_actuals
+ structure_value_addr_parm
;
2479 /* Compute number of named args.
2480 First, do a raw count of the args for INIT_CUMULATIVE_ARGS. */
2482 if (type_arg_types
!= 0)
2484 = (list_length (type_arg_types
)
2485 /* Count the struct value address, if it is passed as a parm. */
2486 + structure_value_addr_parm
);
2488 /* If we know nothing, treat all args as named. */
2489 n_named_args
= num_actuals
;
2491 /* Start updating where the next arg would go.
2493 On some machines (such as the PA) indirect calls have a different
2494 calling convention than normal calls. The fourth argument in
2495 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
2497 INIT_CUMULATIVE_ARGS (args_so_far_v
, funtype
, NULL_RTX
, fndecl
, n_named_args
);
2498 args_so_far
= pack_cumulative_args (&args_so_far_v
);
2500 /* Now possibly adjust the number of named args.
2501 Normally, don't include the last named arg if anonymous args follow.
2502 We do include the last named arg if
2503 targetm.calls.strict_argument_naming() returns nonzero.
2504 (If no anonymous args follow, the result of list_length is actually
2505 one too large. This is harmless.)
2507 If targetm.calls.pretend_outgoing_varargs_named() returns
2508 nonzero, and targetm.calls.strict_argument_naming() returns zero,
2509 this machine will be able to place unnamed args that were passed
2510 in registers into the stack. So treat all args as named. This
2511 allows the insns emitting for a specific argument list to be
2512 independent of the function declaration.
2514 If targetm.calls.pretend_outgoing_varargs_named() returns zero,
2515 we do not have any reliable way to pass unnamed args in
2516 registers, so we must force them into memory. */
2518 if (type_arg_types
!= 0
2519 && targetm
.calls
.strict_argument_naming (args_so_far
))
2521 else if (type_arg_types
!= 0
2522 && ! targetm
.calls
.pretend_outgoing_varargs_named (args_so_far
))
2523 /* Don't include the last named arg. */
2526 /* Treat all args as named. */
2527 n_named_args
= num_actuals
;
2529 /* Make a vector to hold all the information about each arg. */
2530 args
= XALLOCAVEC (struct arg_data
, num_actuals
);
2531 memset (args
, 0, num_actuals
* sizeof (struct arg_data
));
2533 /* Build up entries in the ARGS array, compute the size of the
2534 arguments into ARGS_SIZE, etc. */
2535 initialize_argument_information (num_actuals
, args
, &args_size
,
2537 structure_value_addr_value
, fndecl
, fntype
,
2538 args_so_far
, reg_parm_stack_space
,
2539 &old_stack_level
, &old_pending_adj
,
2540 &must_preallocate
, &flags
,
2541 &try_tail_call
, CALL_FROM_THUNK_P (exp
));
2544 must_preallocate
= 1;
2546 /* Now make final decision about preallocating stack space. */
2547 must_preallocate
= finalize_must_preallocate (must_preallocate
,
2551 /* If the structure value address will reference the stack pointer, we
2552 must stabilize it. We don't need to do this if we know that we are
2553 not going to adjust the stack pointer in processing this call. */
2555 if (structure_value_addr
2556 && (reg_mentioned_p (virtual_stack_dynamic_rtx
, structure_value_addr
)
2557 || reg_mentioned_p (virtual_outgoing_args_rtx
,
2558 structure_value_addr
))
2560 || (!ACCUMULATE_OUTGOING_ARGS
&& args_size
.constant
)))
2561 structure_value_addr
= copy_to_reg (structure_value_addr
);
2563 /* Tail calls can make things harder to debug, and we've traditionally
2564 pushed these optimizations into -O2. Don't try if we're already
2565 expanding a call, as that means we're an argument. Don't try if
2566 there's cleanups, as we know there's code to follow the call. */
2568 if (currently_expanding_call
++ != 0
2569 || !flag_optimize_sibling_calls
2571 || dbg_cnt (tail_call
) == false)
2574 /* Rest of purposes for tail call optimizations to fail. */
2576 #ifdef HAVE_sibcall_epilogue
2577 !HAVE_sibcall_epilogue
2582 /* Doing sibling call optimization needs some work, since
2583 structure_value_addr can be allocated on the stack.
2584 It does not seem worth the effort since few optimizable
2585 sibling calls will return a structure. */
2586 || structure_value_addr
!= NULL_RTX
2587 #ifdef REG_PARM_STACK_SPACE
2588 /* If outgoing reg parm stack space changes, we can not do sibcall. */
2589 || (OUTGOING_REG_PARM_STACK_SPACE (funtype
)
2590 != OUTGOING_REG_PARM_STACK_SPACE (TREE_TYPE (current_function_decl
)))
2591 || (reg_parm_stack_space
!= REG_PARM_STACK_SPACE (fndecl
))
2593 /* Check whether the target is able to optimize the call
2595 || !targetm
.function_ok_for_sibcall (fndecl
, exp
)
2596 /* Functions that do not return exactly once may not be sibcall
2598 || (flags
& (ECF_RETURNS_TWICE
| ECF_NORETURN
))
2599 || TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (addr
)))
2600 /* If the called function is nested in the current one, it might access
2601 some of the caller's arguments, but could clobber them beforehand if
2602 the argument areas are shared. */
2603 || (fndecl
&& decl_function_context (fndecl
) == current_function_decl
)
2604 /* If this function requires more stack slots than the current
2605 function, we cannot change it into a sibling call.
2606 crtl->args.pretend_args_size is not part of the
2607 stack allocated by our caller. */
2608 || args_size
.constant
> (crtl
->args
.size
2609 - crtl
->args
.pretend_args_size
)
2610 /* If the callee pops its own arguments, then it must pop exactly
2611 the same number of arguments as the current function. */
2612 || (targetm
.calls
.return_pops_args (fndecl
, funtype
, args_size
.constant
)
2613 != targetm
.calls
.return_pops_args (current_function_decl
,
2614 TREE_TYPE (current_function_decl
),
2616 || !lang_hooks
.decls
.ok_for_sibcall (fndecl
))
2619 /* Check if caller and callee disagree in promotion of function
2623 enum machine_mode caller_mode
, caller_promoted_mode
;
2624 enum machine_mode callee_mode
, callee_promoted_mode
;
2625 int caller_unsignedp
, callee_unsignedp
;
2626 tree caller_res
= DECL_RESULT (current_function_decl
);
2628 caller_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (caller_res
));
2629 caller_mode
= DECL_MODE (caller_res
);
2630 callee_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (funtype
));
2631 callee_mode
= TYPE_MODE (TREE_TYPE (funtype
));
2632 caller_promoted_mode
2633 = promote_function_mode (TREE_TYPE (caller_res
), caller_mode
,
2635 TREE_TYPE (current_function_decl
), 1);
2636 callee_promoted_mode
2637 = promote_function_mode (TREE_TYPE (funtype
), callee_mode
,
2640 if (caller_mode
!= VOIDmode
2641 && (caller_promoted_mode
!= callee_promoted_mode
2642 || ((caller_mode
!= caller_promoted_mode
2643 || callee_mode
!= callee_promoted_mode
)
2644 && (caller_unsignedp
!= callee_unsignedp
2645 || GET_MODE_BITSIZE (caller_mode
)
2646 < GET_MODE_BITSIZE (callee_mode
)))))
2650 /* Ensure current function's preferred stack boundary is at least
2651 what we need. Stack alignment may also increase preferred stack
2653 if (crtl
->preferred_stack_boundary
< preferred_stack_boundary
)
2654 crtl
->preferred_stack_boundary
= preferred_stack_boundary
;
2656 preferred_stack_boundary
= crtl
->preferred_stack_boundary
;
2658 preferred_unit_stack_boundary
= preferred_stack_boundary
/ BITS_PER_UNIT
;
2660 /* We want to make two insn chains; one for a sibling call, the other
2661 for a normal call. We will select one of the two chains after
2662 initial RTL generation is complete. */
2663 for (pass
= try_tail_call
? 0 : 1; pass
< 2; pass
++)
2665 int sibcall_failure
= 0;
2666 /* We want to emit any pending stack adjustments before the tail
2667 recursion "call". That way we know any adjustment after the tail
2668 recursion call can be ignored if we indeed use the tail
2670 int save_pending_stack_adjust
= 0;
2671 int save_stack_pointer_delta
= 0;
2673 rtx before_call
, next_arg_reg
, after_args
;
2677 /* State variables we need to save and restore between
2679 save_pending_stack_adjust
= pending_stack_adjust
;
2680 save_stack_pointer_delta
= stack_pointer_delta
;
2683 flags
&= ~ECF_SIBCALL
;
2685 flags
|= ECF_SIBCALL
;
2687 /* Other state variables that we must reinitialize each time
2688 through the loop (that are not initialized by the loop itself). */
2692 /* Start a new sequence for the normal call case.
2694 From this point on, if the sibling call fails, we want to set
2695 sibcall_failure instead of continuing the loop. */
2698 /* Don't let pending stack adjusts add up to too much.
2699 Also, do all pending adjustments now if there is any chance
2700 this might be a call to alloca or if we are expanding a sibling
2702 Also do the adjustments before a throwing call, otherwise
2703 exception handling can fail; PR 19225. */
2704 if (pending_stack_adjust
>= 32
2705 || (pending_stack_adjust
> 0
2706 && (flags
& ECF_MAY_BE_ALLOCA
))
2707 || (pending_stack_adjust
> 0
2708 && flag_exceptions
&& !(flags
& ECF_NOTHROW
))
2710 do_pending_stack_adjust ();
2712 /* Precompute any arguments as needed. */
2714 precompute_arguments (num_actuals
, args
);
2716 /* Now we are about to start emitting insns that can be deleted
2717 if a libcall is deleted. */
2718 if (pass
&& (flags
& ECF_MALLOC
))
2721 if (pass
== 0 && crtl
->stack_protect_guard
)
2722 stack_protect_epilogue ();
2724 adjusted_args_size
= args_size
;
2725 /* Compute the actual size of the argument block required. The variable
2726 and constant sizes must be combined, the size may have to be rounded,
2727 and there may be a minimum required size. When generating a sibcall
2728 pattern, do not round up, since we'll be re-using whatever space our
2730 unadjusted_args_size
2731 = compute_argument_block_size (reg_parm_stack_space
,
2732 &adjusted_args_size
,
2735 : preferred_stack_boundary
));
2737 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
2739 /* The argument block when performing a sibling call is the
2740 incoming argument block. */
2743 argblock
= crtl
->args
.internal_arg_pointer
;
2745 #ifdef STACK_GROWS_DOWNWARD
2746 = plus_constant (Pmode
, argblock
, crtl
->args
.pretend_args_size
);
2748 = plus_constant (Pmode
, argblock
, -crtl
->args
.pretend_args_size
);
2750 stored_args_map
= sbitmap_alloc (args_size
.constant
);
2751 bitmap_clear (stored_args_map
);
2754 /* If we have no actual push instructions, or shouldn't use them,
2755 make space for all args right now. */
2756 else if (adjusted_args_size
.var
!= 0)
2758 if (old_stack_level
== 0)
2760 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
2761 old_stack_pointer_delta
= stack_pointer_delta
;
2762 old_pending_adj
= pending_stack_adjust
;
2763 pending_stack_adjust
= 0;
2764 /* stack_arg_under_construction says whether a stack arg is
2765 being constructed at the old stack level. Pushing the stack
2766 gets a clean outgoing argument block. */
2767 old_stack_arg_under_construction
= stack_arg_under_construction
;
2768 stack_arg_under_construction
= 0;
2770 argblock
= push_block (ARGS_SIZE_RTX (adjusted_args_size
), 0, 0);
2771 if (flag_stack_usage_info
)
2772 current_function_has_unbounded_dynamic_stack_size
= 1;
2776 /* Note that we must go through the motions of allocating an argument
2777 block even if the size is zero because we may be storing args
2778 in the area reserved for register arguments, which may be part of
2781 int needed
= adjusted_args_size
.constant
;
2783 /* Store the maximum argument space used. It will be pushed by
2784 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
2787 if (needed
> crtl
->outgoing_args_size
)
2788 crtl
->outgoing_args_size
= needed
;
2790 if (must_preallocate
)
2792 if (ACCUMULATE_OUTGOING_ARGS
)
2794 /* Since the stack pointer will never be pushed, it is
2795 possible for the evaluation of a parm to clobber
2796 something we have already written to the stack.
2797 Since most function calls on RISC machines do not use
2798 the stack, this is uncommon, but must work correctly.
2800 Therefore, we save any area of the stack that was already
2801 written and that we are using. Here we set up to do this
2802 by making a new stack usage map from the old one. The
2803 actual save will be done by store_one_arg.
2805 Another approach might be to try to reorder the argument
2806 evaluations to avoid this conflicting stack usage. */
2808 /* Since we will be writing into the entire argument area,
2809 the map must be allocated for its entire size, not just
2810 the part that is the responsibility of the caller. */
2811 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
2812 needed
+= reg_parm_stack_space
;
2814 #ifdef ARGS_GROW_DOWNWARD
2815 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2818 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2821 free (stack_usage_map_buf
);
2822 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
2823 stack_usage_map
= stack_usage_map_buf
;
2825 if (initial_highest_arg_in_use
)
2826 memcpy (stack_usage_map
, initial_stack_usage_map
,
2827 initial_highest_arg_in_use
);
2829 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
2830 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
2831 (highest_outgoing_arg_in_use
2832 - initial_highest_arg_in_use
));
2835 /* The address of the outgoing argument list must not be
2836 copied to a register here, because argblock would be left
2837 pointing to the wrong place after the call to
2838 allocate_dynamic_stack_space below. */
2840 argblock
= virtual_outgoing_args_rtx
;
2844 if (inhibit_defer_pop
== 0)
2846 /* Try to reuse some or all of the pending_stack_adjust
2847 to get this space. */
2849 = (combine_pending_stack_adjustment_and_call
2850 (unadjusted_args_size
,
2851 &adjusted_args_size
,
2852 preferred_unit_stack_boundary
));
2854 /* combine_pending_stack_adjustment_and_call computes
2855 an adjustment before the arguments are allocated.
2856 Account for them and see whether or not the stack
2857 needs to go up or down. */
2858 needed
= unadjusted_args_size
- needed
;
2862 /* We're releasing stack space. */
2863 /* ??? We can avoid any adjustment at all if we're
2864 already aligned. FIXME. */
2865 pending_stack_adjust
= -needed
;
2866 do_pending_stack_adjust ();
2870 /* We need to allocate space. We'll do that in
2871 push_block below. */
2872 pending_stack_adjust
= 0;
2875 /* Special case this because overhead of `push_block' in
2876 this case is non-trivial. */
2878 argblock
= virtual_outgoing_args_rtx
;
2881 argblock
= push_block (GEN_INT (needed
), 0, 0);
2882 #ifdef ARGS_GROW_DOWNWARD
2883 argblock
= plus_constant (Pmode
, argblock
, needed
);
2887 /* We only really need to call `copy_to_reg' in the case
2888 where push insns are going to be used to pass ARGBLOCK
2889 to a function call in ARGS. In that case, the stack
2890 pointer changes value from the allocation point to the
2891 call point, and hence the value of
2892 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
2893 as well always do it. */
2894 argblock
= copy_to_reg (argblock
);
2899 if (ACCUMULATE_OUTGOING_ARGS
)
2901 /* The save/restore code in store_one_arg handles all
2902 cases except one: a constructor call (including a C
2903 function returning a BLKmode struct) to initialize
2905 if (stack_arg_under_construction
)
2908 = GEN_INT (adjusted_args_size
.constant
2909 + (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
2910 : TREE_TYPE (fndecl
))) ? 0
2911 : reg_parm_stack_space
));
2912 if (old_stack_level
== 0)
2914 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
2915 old_stack_pointer_delta
= stack_pointer_delta
;
2916 old_pending_adj
= pending_stack_adjust
;
2917 pending_stack_adjust
= 0;
2918 /* stack_arg_under_construction says whether a stack
2919 arg is being constructed at the old stack level.
2920 Pushing the stack gets a clean outgoing argument
2922 old_stack_arg_under_construction
2923 = stack_arg_under_construction
;
2924 stack_arg_under_construction
= 0;
2925 /* Make a new map for the new argument list. */
2926 free (stack_usage_map_buf
);
2927 stack_usage_map_buf
= XCNEWVEC (char, highest_outgoing_arg_in_use
);
2928 stack_usage_map
= stack_usage_map_buf
;
2929 highest_outgoing_arg_in_use
= 0;
2931 /* We can pass TRUE as the 4th argument because we just
2932 saved the stack pointer and will restore it right after
2934 allocate_dynamic_stack_space (push_size
, 0,
2935 BIGGEST_ALIGNMENT
, true);
2938 /* If argument evaluation might modify the stack pointer,
2939 copy the address of the argument list to a register. */
2940 for (i
= 0; i
< num_actuals
; i
++)
2941 if (args
[i
].pass_on_stack
)
2943 argblock
= copy_addr_to_reg (argblock
);
2948 compute_argument_addresses (args
, argblock
, num_actuals
);
2950 /* If we push args individually in reverse order, perform stack alignment
2951 before the first push (the last arg). */
2952 if (PUSH_ARGS_REVERSED
&& argblock
== 0
2953 && adjusted_args_size
.constant
!= unadjusted_args_size
)
2955 /* When the stack adjustment is pending, we get better code
2956 by combining the adjustments. */
2957 if (pending_stack_adjust
2958 && ! inhibit_defer_pop
)
2960 pending_stack_adjust
2961 = (combine_pending_stack_adjustment_and_call
2962 (unadjusted_args_size
,
2963 &adjusted_args_size
,
2964 preferred_unit_stack_boundary
));
2965 do_pending_stack_adjust ();
2967 else if (argblock
== 0)
2968 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
2969 - unadjusted_args_size
));
2971 /* Now that the stack is properly aligned, pops can't safely
2972 be deferred during the evaluation of the arguments. */
2975 /* Record the maximum pushed stack space size. We need to delay
2976 doing it this far to take into account the optimization done
2977 by combine_pending_stack_adjustment_and_call. */
2978 if (flag_stack_usage_info
2979 && !ACCUMULATE_OUTGOING_ARGS
2981 && adjusted_args_size
.var
== 0)
2983 int pushed
= adjusted_args_size
.constant
+ pending_stack_adjust
;
2984 if (pushed
> current_function_pushed_stack_size
)
2985 current_function_pushed_stack_size
= pushed
;
2988 funexp
= rtx_for_function_call (fndecl
, addr
);
2990 /* Figure out the register where the value, if any, will come back. */
2992 if (TYPE_MODE (rettype
) != VOIDmode
2993 && ! structure_value_addr
)
2995 if (pcc_struct_value
)
2996 valreg
= hard_function_value (build_pointer_type (rettype
),
2997 fndecl
, NULL
, (pass
== 0));
2999 valreg
= hard_function_value (rettype
, fndecl
, fntype
,
3002 /* If VALREG is a PARALLEL whose first member has a zero
3003 offset, use that. This is for targets such as m68k that
3004 return the same value in multiple places. */
3005 if (GET_CODE (valreg
) == PARALLEL
)
3007 rtx elem
= XVECEXP (valreg
, 0, 0);
3008 rtx where
= XEXP (elem
, 0);
3009 rtx offset
= XEXP (elem
, 1);
3010 if (offset
== const0_rtx
3011 && GET_MODE (where
) == GET_MODE (valreg
))
3016 /* Precompute all register parameters. It isn't safe to compute anything
3017 once we have started filling any specific hard regs. */
3018 precompute_register_parameters (num_actuals
, args
, ®_parm_seen
);
3020 if (CALL_EXPR_STATIC_CHAIN (exp
))
3021 static_chain_value
= expand_normal (CALL_EXPR_STATIC_CHAIN (exp
));
3023 static_chain_value
= 0;
3025 #ifdef REG_PARM_STACK_SPACE
3026 /* Save the fixed argument area if it's part of the caller's frame and
3027 is clobbered by argument setup for this call. */
3028 if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
3029 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
3030 &low_to_save
, &high_to_save
);
3033 /* Now store (and compute if necessary) all non-register parms.
3034 These come before register parms, since they can require block-moves,
3035 which could clobber the registers used for register parms.
3036 Parms which have partial registers are not stored here,
3037 but we do preallocate space here if they want that. */
3039 for (i
= 0; i
< num_actuals
; i
++)
3041 if (args
[i
].reg
== 0 || args
[i
].pass_on_stack
)
3043 rtx before_arg
= get_last_insn ();
3045 if (store_one_arg (&args
[i
], argblock
, flags
,
3046 adjusted_args_size
.var
!= 0,
3047 reg_parm_stack_space
)
3049 && check_sibcall_argument_overlap (before_arg
,
3051 sibcall_failure
= 1;
3056 = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
3057 gen_rtx_USE (VOIDmode
, args
[i
].stack
),
3061 /* If we have a parm that is passed in registers but not in memory
3062 and whose alignment does not permit a direct copy into registers,
3063 make a group of pseudos that correspond to each register that we
3065 if (STRICT_ALIGNMENT
)
3066 store_unaligned_arguments_into_pseudos (args
, num_actuals
);
3068 /* Now store any partially-in-registers parm.
3069 This is the last place a block-move can happen. */
3071 for (i
= 0; i
< num_actuals
; i
++)
3072 if (args
[i
].partial
!= 0 && ! args
[i
].pass_on_stack
)
3074 rtx before_arg
= get_last_insn ();
3076 if (store_one_arg (&args
[i
], argblock
, flags
,
3077 adjusted_args_size
.var
!= 0,
3078 reg_parm_stack_space
)
3080 && check_sibcall_argument_overlap (before_arg
,
3082 sibcall_failure
= 1;
3085 /* If we pushed args in forward order, perform stack alignment
3086 after pushing the last arg. */
3087 if (!PUSH_ARGS_REVERSED
&& argblock
== 0)
3088 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
3089 - unadjusted_args_size
));
3091 /* If register arguments require space on the stack and stack space
3092 was not preallocated, allocate stack space here for arguments
3093 passed in registers. */
3094 if (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
3095 && !ACCUMULATE_OUTGOING_ARGS
3096 && must_preallocate
== 0 && reg_parm_stack_space
> 0)
3097 anti_adjust_stack (GEN_INT (reg_parm_stack_space
));
3099 /* Pass the function the address in which to return a
3101 if (pass
!= 0 && structure_value_addr
&& ! structure_value_addr_parm
)
3103 structure_value_addr
3104 = convert_memory_address (Pmode
, structure_value_addr
);
3105 emit_move_insn (struct_value
,
3107 force_operand (structure_value_addr
,
3110 if (REG_P (struct_value
))
3111 use_reg (&call_fusage
, struct_value
);
3114 after_args
= get_last_insn ();
3115 funexp
= prepare_call_address (fndecl
, funexp
, static_chain_value
,
3116 &call_fusage
, reg_parm_seen
, pass
== 0);
3118 load_register_parameters (args
, num_actuals
, &call_fusage
, flags
,
3119 pass
== 0, &sibcall_failure
);
3121 /* Save a pointer to the last insn before the call, so that we can
3122 later safely search backwards to find the CALL_INSN. */
3123 before_call
= get_last_insn ();
3125 /* Set up next argument register. For sibling calls on machines
3126 with register windows this should be the incoming register. */
3128 next_arg_reg
= targetm
.calls
.function_incoming_arg (args_so_far
,
3133 next_arg_reg
= targetm
.calls
.function_arg (args_so_far
,
3134 VOIDmode
, void_type_node
,
3137 if (pass
== 1 && (return_flags
& ERF_RETURNS_ARG
))
3139 int arg_nr
= return_flags
& ERF_RETURN_ARG_MASK
;
3140 if (PUSH_ARGS_REVERSED
)
3141 arg_nr
= num_actuals
- arg_nr
- 1;
3143 && arg_nr
< num_actuals
3147 && GET_MODE (args
[arg_nr
].reg
) == GET_MODE (valreg
))
3149 = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args
[arg_nr
].tree_value
)),
3150 gen_rtx_SET (VOIDmode
, valreg
, args
[arg_nr
].reg
),
3153 /* All arguments and registers used for the call must be set up by
3156 /* Stack must be properly aligned now. */
3158 || !(stack_pointer_delta
% preferred_unit_stack_boundary
));
3160 /* Generate the actual call instruction. */
3161 emit_call_1 (funexp
, exp
, fndecl
, funtype
, unadjusted_args_size
,
3162 adjusted_args_size
.constant
, struct_value_size
,
3163 next_arg_reg
, valreg
, old_inhibit_defer_pop
, call_fusage
,
3164 flags
, args_so_far
);
3166 /* If the call setup or the call itself overlaps with anything
3167 of the argument setup we probably clobbered our call address.
3168 In that case we can't do sibcalls. */
3170 && check_sibcall_argument_overlap (after_args
, 0, 0))
3171 sibcall_failure
= 1;
3173 /* If a non-BLKmode value is returned at the most significant end
3174 of a register, shift the register right by the appropriate amount
3175 and update VALREG accordingly. BLKmode values are handled by the
3176 group load/store machinery below. */
3177 if (!structure_value_addr
3178 && !pcc_struct_value
3179 && TYPE_MODE (rettype
) != VOIDmode
3180 && TYPE_MODE (rettype
) != BLKmode
3182 && targetm
.calls
.return_in_msb (rettype
))
3184 if (shift_return_value (TYPE_MODE (rettype
), false, valreg
))
3185 sibcall_failure
= 1;
3186 valreg
= gen_rtx_REG (TYPE_MODE (rettype
), REGNO (valreg
));
3189 if (pass
&& (flags
& ECF_MALLOC
))
3191 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
3194 /* The return value from a malloc-like function is a pointer. */
3195 if (TREE_CODE (rettype
) == POINTER_TYPE
)
3196 mark_reg_pointer (temp
, MALLOC_ABI_ALIGNMENT
);
3198 emit_move_insn (temp
, valreg
);
3200 /* The return value from a malloc-like function can not alias
3202 last
= get_last_insn ();
3203 add_reg_note (last
, REG_NOALIAS
, temp
);
3205 /* Write out the sequence. */
3206 insns
= get_insns ();
3212 /* For calls to `setjmp', etc., inform
3213 function.c:setjmp_warnings that it should complain if
3214 nonvolatile values are live. For functions that cannot
3215 return, inform flow that control does not fall through. */
3217 if ((flags
& ECF_NORETURN
) || pass
== 0)
3219 /* The barrier must be emitted
3220 immediately after the CALL_INSN. Some ports emit more
3221 than just a CALL_INSN above, so we must search for it here. */
3223 rtx last
= get_last_insn ();
3224 while (!CALL_P (last
))
3226 last
= PREV_INSN (last
);
3227 /* There was no CALL_INSN? */
3228 gcc_assert (last
!= before_call
);
3231 emit_barrier_after (last
);
3233 /* Stack adjustments after a noreturn call are dead code.
3234 However when NO_DEFER_POP is in effect, we must preserve
3235 stack_pointer_delta. */
3236 if (inhibit_defer_pop
== 0)
3238 stack_pointer_delta
= old_stack_allocated
;
3239 pending_stack_adjust
= 0;
3243 /* If value type not void, return an rtx for the value. */
3245 if (TYPE_MODE (rettype
) == VOIDmode
3247 target
= const0_rtx
;
3248 else if (structure_value_addr
)
3250 if (target
== 0 || !MEM_P (target
))
3253 = gen_rtx_MEM (TYPE_MODE (rettype
),
3254 memory_address (TYPE_MODE (rettype
),
3255 structure_value_addr
));
3256 set_mem_attributes (target
, rettype
, 1);
3259 else if (pcc_struct_value
)
3261 /* This is the special C++ case where we need to
3262 know what the true target was. We take care to
3263 never use this value more than once in one expression. */
3264 target
= gen_rtx_MEM (TYPE_MODE (rettype
),
3265 copy_to_reg (valreg
));
3266 set_mem_attributes (target
, rettype
, 1);
3268 /* Handle calls that return values in multiple non-contiguous locations.
3269 The Irix 6 ABI has examples of this. */
3270 else if (GET_CODE (valreg
) == PARALLEL
)
3273 target
= emit_group_move_into_temps (valreg
);
3274 else if (rtx_equal_p (target
, valreg
))
3276 else if (GET_CODE (target
) == PARALLEL
)
3277 /* Handle the result of a emit_group_move_into_temps
3278 call in the previous pass. */
3279 emit_group_move (target
, valreg
);
3281 emit_group_store (target
, valreg
, rettype
,
3282 int_size_in_bytes (rettype
));
3285 && GET_MODE (target
) == TYPE_MODE (rettype
)
3286 && GET_MODE (target
) == GET_MODE (valreg
))
3288 bool may_overlap
= false;
3290 /* We have to copy a return value in a CLASS_LIKELY_SPILLED hard
3291 reg to a plain register. */
3292 if (!REG_P (target
) || HARD_REGISTER_P (target
))
3293 valreg
= avoid_likely_spilled_reg (valreg
);
3295 /* If TARGET is a MEM in the argument area, and we have
3296 saved part of the argument area, then we can't store
3297 directly into TARGET as it may get overwritten when we
3298 restore the argument save area below. Don't work too
3299 hard though and simply force TARGET to a register if it
3300 is a MEM; the optimizer is quite likely to sort it out. */
3301 if (ACCUMULATE_OUTGOING_ARGS
&& pass
&& MEM_P (target
))
3302 for (i
= 0; i
< num_actuals
; i
++)
3303 if (args
[i
].save_area
)
3310 target
= copy_to_reg (valreg
);
3313 /* TARGET and VALREG cannot be equal at this point
3314 because the latter would not have
3315 REG_FUNCTION_VALUE_P true, while the former would if
3316 it were referring to the same register.
3318 If they refer to the same register, this move will be
3319 a no-op, except when function inlining is being
3321 emit_move_insn (target
, valreg
);
3323 /* If we are setting a MEM, this code must be executed.
3324 Since it is emitted after the call insn, sibcall
3325 optimization cannot be performed in that case. */
3327 sibcall_failure
= 1;
3331 target
= copy_to_reg (avoid_likely_spilled_reg (valreg
));
3333 /* If we promoted this return value, make the proper SUBREG.
3334 TARGET might be const0_rtx here, so be careful. */
3336 && TYPE_MODE (rettype
) != BLKmode
3337 && GET_MODE (target
) != TYPE_MODE (rettype
))
3339 tree type
= rettype
;
3340 int unsignedp
= TYPE_UNSIGNED (type
);
3342 enum machine_mode pmode
;
3344 /* Ensure we promote as expected, and get the new unsignedness. */
3345 pmode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
3347 gcc_assert (GET_MODE (target
) == pmode
);
3349 if ((WORDS_BIG_ENDIAN
|| BYTES_BIG_ENDIAN
)
3350 && (GET_MODE_SIZE (GET_MODE (target
))
3351 > GET_MODE_SIZE (TYPE_MODE (type
))))
3353 offset
= GET_MODE_SIZE (GET_MODE (target
))
3354 - GET_MODE_SIZE (TYPE_MODE (type
));
3355 if (! BYTES_BIG_ENDIAN
)
3356 offset
= (offset
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
3357 else if (! WORDS_BIG_ENDIAN
)
3358 offset
%= UNITS_PER_WORD
;
3361 target
= gen_rtx_SUBREG (TYPE_MODE (type
), target
, offset
);
3362 SUBREG_PROMOTED_VAR_P (target
) = 1;
3363 SUBREG_PROMOTED_UNSIGNED_SET (target
, unsignedp
);
3366 /* If size of args is variable or this was a constructor call for a stack
3367 argument, restore saved stack-pointer value. */
3369 if (old_stack_level
)
3371 rtx prev
= get_last_insn ();
3373 emit_stack_restore (SAVE_BLOCK
, old_stack_level
);
3374 stack_pointer_delta
= old_stack_pointer_delta
;
3376 fixup_args_size_notes (prev
, get_last_insn (), stack_pointer_delta
);
3378 pending_stack_adjust
= old_pending_adj
;
3379 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
3380 stack_arg_under_construction
= old_stack_arg_under_construction
;
3381 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
3382 stack_usage_map
= initial_stack_usage_map
;
3383 sibcall_failure
= 1;
3385 else if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
3387 #ifdef REG_PARM_STACK_SPACE
3389 restore_fixed_argument_area (save_area
, argblock
,
3390 high_to_save
, low_to_save
);
3393 /* If we saved any argument areas, restore them. */
3394 for (i
= 0; i
< num_actuals
; i
++)
3395 if (args
[i
].save_area
)
3397 enum machine_mode save_mode
= GET_MODE (args
[i
].save_area
);
3399 = gen_rtx_MEM (save_mode
,
3400 memory_address (save_mode
,
3401 XEXP (args
[i
].stack_slot
, 0)));
3403 if (save_mode
!= BLKmode
)
3404 emit_move_insn (stack_area
, args
[i
].save_area
);
3406 emit_block_move (stack_area
, args
[i
].save_area
,
3407 GEN_INT (args
[i
].locate
.size
.constant
),
3408 BLOCK_OP_CALL_PARM
);
3411 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
3412 stack_usage_map
= initial_stack_usage_map
;
3415 /* If this was alloca, record the new stack level for nonlocal gotos.
3416 Check for the handler slots since we might not have a save area
3417 for non-local gotos. */
3419 if ((flags
& ECF_MAY_BE_ALLOCA
) && cfun
->nonlocal_goto_save_area
!= 0)
3420 update_nonlocal_goto_save_area ();
3422 /* Free up storage we no longer need. */
3423 for (i
= 0; i
< num_actuals
; ++i
)
3424 free (args
[i
].aligned_regs
);
3426 insns
= get_insns ();
3431 tail_call_insns
= insns
;
3433 /* Restore the pending stack adjustment now that we have
3434 finished generating the sibling call sequence. */
3436 pending_stack_adjust
= save_pending_stack_adjust
;
3437 stack_pointer_delta
= save_stack_pointer_delta
;
3439 /* Prepare arg structure for next iteration. */
3440 for (i
= 0; i
< num_actuals
; i
++)
3443 args
[i
].aligned_regs
= 0;
3447 sbitmap_free (stored_args_map
);
3448 internal_arg_pointer_exp_state
.scan_start
= NULL_RTX
;
3449 internal_arg_pointer_exp_state
.cache
.release ();
3453 normal_call_insns
= insns
;
3455 /* Verify that we've deallocated all the stack we used. */
3456 gcc_assert ((flags
& ECF_NORETURN
)
3457 || (old_stack_allocated
3458 == stack_pointer_delta
- pending_stack_adjust
));
3461 /* If something prevents making this a sibling call,
3462 zero out the sequence. */
3463 if (sibcall_failure
)
3464 tail_call_insns
= NULL_RTX
;
3469 /* If tail call production succeeded, we need to remove REG_EQUIV notes on
3470 arguments too, as argument area is now clobbered by the call. */
3471 if (tail_call_insns
)
3473 emit_insn (tail_call_insns
);
3474 crtl
->tail_call_emit
= true;
3477 emit_insn (normal_call_insns
);
3479 currently_expanding_call
--;
3481 free (stack_usage_map_buf
);
3486 /* A sibling call sequence invalidates any REG_EQUIV notes made for
3487 this function's incoming arguments.
3489 At the start of RTL generation we know the only REG_EQUIV notes
3490 in the rtl chain are those for incoming arguments, so we can look
3491 for REG_EQUIV notes between the start of the function and the
3492 NOTE_INSN_FUNCTION_BEG.
3494 This is (slight) overkill. We could keep track of the highest
3495 argument we clobber and be more selective in removing notes, but it
3496 does not seem to be worth the effort. */
3499 fixup_tail_calls (void)
3503 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3507 /* There are never REG_EQUIV notes for the incoming arguments
3508 after the NOTE_INSN_FUNCTION_BEG note, so stop if we see it. */
3510 && NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
)
3513 note
= find_reg_note (insn
, REG_EQUIV
, 0);
3515 remove_note (insn
, note
);
3516 note
= find_reg_note (insn
, REG_EQUIV
, 0);
3521 /* Traverse a list of TYPES and expand all complex types into their
3524 split_complex_types (tree types
)
3528 /* Before allocating memory, check for the common case of no complex. */
3529 for (p
= types
; p
; p
= TREE_CHAIN (p
))
3531 tree type
= TREE_VALUE (p
);
3532 if (TREE_CODE (type
) == COMPLEX_TYPE
3533 && targetm
.calls
.split_complex_arg (type
))
3539 types
= copy_list (types
);
3541 for (p
= types
; p
; p
= TREE_CHAIN (p
))
3543 tree complex_type
= TREE_VALUE (p
);
3545 if (TREE_CODE (complex_type
) == COMPLEX_TYPE
3546 && targetm
.calls
.split_complex_arg (complex_type
))
3550 /* Rewrite complex type with component type. */
3551 TREE_VALUE (p
) = TREE_TYPE (complex_type
);
3552 next
= TREE_CHAIN (p
);
3554 /* Add another component type for the imaginary part. */
3555 imag
= build_tree_list (NULL_TREE
, TREE_VALUE (p
));
3556 TREE_CHAIN (p
) = imag
;
3557 TREE_CHAIN (imag
) = next
;
3559 /* Skip the newly created node. */
3567 /* Output a library call to function FUN (a SYMBOL_REF rtx).
3568 The RETVAL parameter specifies whether return value needs to be saved, other
3569 parameters are documented in the emit_library_call function below. */
3572 emit_library_call_value_1 (int retval
, rtx orgfun
, rtx value
,
3573 enum libcall_type fn_type
,
3574 enum machine_mode outmode
, int nargs
, va_list p
)
3576 /* Total size in bytes of all the stack-parms scanned so far. */
3577 struct args_size args_size
;
3578 /* Size of arguments before any adjustments (such as rounding). */
3579 struct args_size original_args_size
;
3582 /* Todo, choose the correct decl type of orgfun. Sadly this information
3583 isn't present here, so we default to native calling abi here. */
3584 tree fndecl ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
3585 tree fntype ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
3589 CUMULATIVE_ARGS args_so_far_v
;
3590 cumulative_args_t args_so_far
;
3594 enum machine_mode mode
;
3597 struct locate_and_pad_arg_data locate
;
3601 int old_inhibit_defer_pop
= inhibit_defer_pop
;
3602 rtx call_fusage
= 0;
3605 int pcc_struct_value
= 0;
3606 int struct_value_size
= 0;
3608 int reg_parm_stack_space
= 0;
3611 tree tfom
; /* type_for_mode (outmode, 0) */
3613 #ifdef REG_PARM_STACK_SPACE
3614 /* Define the boundary of the register parm stack space that needs to be
3616 int low_to_save
= 0, high_to_save
= 0;
3617 rtx save_area
= 0; /* Place that it is saved. */
3620 /* Size of the stack reserved for parameter registers. */
3621 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
3622 char *initial_stack_usage_map
= stack_usage_map
;
3623 char *stack_usage_map_buf
= NULL
;
3625 rtx struct_value
= targetm
.calls
.struct_value_rtx (0, 0);
3627 #ifdef REG_PARM_STACK_SPACE
3628 reg_parm_stack_space
= REG_PARM_STACK_SPACE ((tree
) 0);
3631 /* By default, library functions can not throw. */
3632 flags
= ECF_NOTHROW
;
3645 flags
|= ECF_NORETURN
;
3648 flags
= ECF_NORETURN
;
3650 case LCT_RETURNS_TWICE
:
3651 flags
= ECF_RETURNS_TWICE
;
3656 /* Ensure current function's preferred stack boundary is at least
3658 if (crtl
->preferred_stack_boundary
< PREFERRED_STACK_BOUNDARY
)
3659 crtl
->preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
3661 /* If this kind of value comes back in memory,
3662 decide where in memory it should come back. */
3663 if (outmode
!= VOIDmode
)
3665 tfom
= lang_hooks
.types
.type_for_mode (outmode
, 0);
3666 if (aggregate_value_p (tfom
, 0))
3668 #ifdef PCC_STATIC_STRUCT_RETURN
3670 = hard_function_value (build_pointer_type (tfom
), 0, 0, 0);
3671 mem_value
= gen_rtx_MEM (outmode
, pointer_reg
);
3672 pcc_struct_value
= 1;
3674 value
= gen_reg_rtx (outmode
);
3675 #else /* not PCC_STATIC_STRUCT_RETURN */
3676 struct_value_size
= GET_MODE_SIZE (outmode
);
3677 if (value
!= 0 && MEM_P (value
))
3680 mem_value
= assign_temp (tfom
, 1, 1);
3682 /* This call returns a big structure. */
3683 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
3687 tfom
= void_type_node
;
3689 /* ??? Unfinished: must pass the memory address as an argument. */
3691 /* Copy all the libcall-arguments out of the varargs data
3692 and into a vector ARGVEC.
3694 Compute how to pass each argument. We only support a very small subset
3695 of the full argument passing conventions to limit complexity here since
3696 library functions shouldn't have many args. */
3698 argvec
= XALLOCAVEC (struct arg
, nargs
+ 1);
3699 memset (argvec
, 0, (nargs
+ 1) * sizeof (struct arg
));
3701 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
3702 INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far_v
, outmode
, fun
);
3704 INIT_CUMULATIVE_ARGS (args_so_far_v
, NULL_TREE
, fun
, 0, nargs
);
3706 args_so_far
= pack_cumulative_args (&args_so_far_v
);
3708 args_size
.constant
= 0;
3715 /* If there's a structure value address to be passed,
3716 either pass it in the special place, or pass it as an extra argument. */
3717 if (mem_value
&& struct_value
== 0 && ! pcc_struct_value
)
3719 rtx addr
= XEXP (mem_value
, 0);
3723 /* Make sure it is a reasonable operand for a move or push insn. */
3724 if (!REG_P (addr
) && !MEM_P (addr
)
3725 && !(CONSTANT_P (addr
)
3726 && targetm
.legitimate_constant_p (Pmode
, addr
)))
3727 addr
= force_operand (addr
, NULL_RTX
);
3729 argvec
[count
].value
= addr
;
3730 argvec
[count
].mode
= Pmode
;
3731 argvec
[count
].partial
= 0;
3733 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
,
3734 Pmode
, NULL_TREE
, true);
3735 gcc_assert (targetm
.calls
.arg_partial_bytes (args_so_far
, Pmode
,
3736 NULL_TREE
, 1) == 0);
3738 locate_and_pad_parm (Pmode
, NULL_TREE
,
3739 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3742 argvec
[count
].reg
!= 0,
3744 reg_parm_stack_space
, 0,
3745 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
3747 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
3748 || reg_parm_stack_space
> 0)
3749 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
3751 targetm
.calls
.function_arg_advance (args_so_far
, Pmode
, (tree
) 0, true);
3756 for (; count
< nargs
; count
++)
3758 rtx val
= va_arg (p
, rtx
);
3759 enum machine_mode mode
= (enum machine_mode
) va_arg (p
, int);
3762 /* We cannot convert the arg value to the mode the library wants here;
3763 must do it earlier where we know the signedness of the arg. */
3764 gcc_assert (mode
!= BLKmode
3765 && (GET_MODE (val
) == mode
|| GET_MODE (val
) == VOIDmode
));
3767 /* Make sure it is a reasonable operand for a move or push insn. */
3768 if (!REG_P (val
) && !MEM_P (val
)
3769 && !(CONSTANT_P (val
) && targetm
.legitimate_constant_p (mode
, val
)))
3770 val
= force_operand (val
, NULL_RTX
);
3772 if (pass_by_reference (&args_so_far_v
, mode
, NULL_TREE
, 1))
3776 = !reference_callee_copied (&args_so_far_v
, mode
, NULL_TREE
, 1);
3778 /* If this was a CONST function, it is now PURE since it now
3780 if (flags
& ECF_CONST
)
3782 flags
&= ~ECF_CONST
;
3786 if (MEM_P (val
) && !must_copy
)
3788 tree val_expr
= MEM_EXPR (val
);
3790 mark_addressable (val_expr
);
3795 slot
= assign_temp (lang_hooks
.types
.type_for_mode (mode
, 0),
3797 emit_move_insn (slot
, val
);
3800 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3801 gen_rtx_USE (VOIDmode
, slot
),
3804 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3805 gen_rtx_CLOBBER (VOIDmode
,
3810 val
= force_operand (XEXP (slot
, 0), NULL_RTX
);
3813 mode
= promote_function_mode (NULL_TREE
, mode
, &unsigned_p
, NULL_TREE
, 0);
3814 argvec
[count
].mode
= mode
;
3815 argvec
[count
].value
= convert_modes (mode
, GET_MODE (val
), val
, unsigned_p
);
3816 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
3819 argvec
[count
].partial
3820 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, NULL_TREE
, 1);
3822 if (argvec
[count
].reg
== 0
3823 || argvec
[count
].partial
!= 0
3824 || reg_parm_stack_space
> 0)
3826 locate_and_pad_parm (mode
, NULL_TREE
,
3827 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3830 argvec
[count
].reg
!= 0,
3832 reg_parm_stack_space
, argvec
[count
].partial
,
3833 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
3834 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
3835 gcc_assert (!argvec
[count
].locate
.size
.var
);
3837 #ifdef BLOCK_REG_PADDING
3839 /* The argument is passed entirely in registers. See at which
3840 end it should be padded. */
3841 argvec
[count
].locate
.where_pad
=
3842 BLOCK_REG_PADDING (mode
, NULL_TREE
,
3843 GET_MODE_SIZE (mode
) <= UNITS_PER_WORD
);
3846 targetm
.calls
.function_arg_advance (args_so_far
, mode
, (tree
) 0, true);
3849 /* If this machine requires an external definition for library
3850 functions, write one out. */
3851 assemble_external_libcall (fun
);
3853 original_args_size
= args_size
;
3854 args_size
.constant
= (((args_size
.constant
3855 + stack_pointer_delta
3859 - stack_pointer_delta
);
3861 args_size
.constant
= MAX (args_size
.constant
,
3862 reg_parm_stack_space
);
3864 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
3865 args_size
.constant
-= reg_parm_stack_space
;
3867 if (args_size
.constant
> crtl
->outgoing_args_size
)
3868 crtl
->outgoing_args_size
= args_size
.constant
;
3870 if (flag_stack_usage_info
&& !ACCUMULATE_OUTGOING_ARGS
)
3872 int pushed
= args_size
.constant
+ pending_stack_adjust
;
3873 if (pushed
> current_function_pushed_stack_size
)
3874 current_function_pushed_stack_size
= pushed
;
3877 if (ACCUMULATE_OUTGOING_ARGS
)
3879 /* Since the stack pointer will never be pushed, it is possible for
3880 the evaluation of a parm to clobber something we have already
3881 written to the stack. Since most function calls on RISC machines
3882 do not use the stack, this is uncommon, but must work correctly.
3884 Therefore, we save any area of the stack that was already written
3885 and that we are using. Here we set up to do this by making a new
3886 stack usage map from the old one.
3888 Another approach might be to try to reorder the argument
3889 evaluations to avoid this conflicting stack usage. */
3891 needed
= args_size
.constant
;
3893 /* Since we will be writing into the entire argument area, the
3894 map must be allocated for its entire size, not just the part that
3895 is the responsibility of the caller. */
3896 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
3897 needed
+= reg_parm_stack_space
;
3899 #ifdef ARGS_GROW_DOWNWARD
3900 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
3903 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
3906 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
3907 stack_usage_map
= stack_usage_map_buf
;
3909 if (initial_highest_arg_in_use
)
3910 memcpy (stack_usage_map
, initial_stack_usage_map
,
3911 initial_highest_arg_in_use
);
3913 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
3914 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
3915 highest_outgoing_arg_in_use
- initial_highest_arg_in_use
);
3918 /* We must be careful to use virtual regs before they're instantiated,
3919 and real regs afterwards. Loop optimization, for example, can create
3920 new libcalls after we've instantiated the virtual regs, and if we
3921 use virtuals anyway, they won't match the rtl patterns. */
3923 if (virtuals_instantiated
)
3924 argblock
= plus_constant (Pmode
, stack_pointer_rtx
,
3925 STACK_POINTER_OFFSET
);
3927 argblock
= virtual_outgoing_args_rtx
;
3932 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
3935 /* If we push args individually in reverse order, perform stack alignment
3936 before the first push (the last arg). */
3937 if (argblock
== 0 && PUSH_ARGS_REVERSED
)
3938 anti_adjust_stack (GEN_INT (args_size
.constant
3939 - original_args_size
.constant
));
3941 if (PUSH_ARGS_REVERSED
)
3952 #ifdef REG_PARM_STACK_SPACE
3953 if (ACCUMULATE_OUTGOING_ARGS
)
3955 /* The argument list is the property of the called routine and it
3956 may clobber it. If the fixed area has been used for previous
3957 parameters, we must save and restore it. */
3958 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
3959 &low_to_save
, &high_to_save
);
3963 /* Push the args that need to be pushed. */
3965 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3966 are to be pushed. */
3967 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
3969 enum machine_mode mode
= argvec
[argnum
].mode
;
3970 rtx val
= argvec
[argnum
].value
;
3971 rtx reg
= argvec
[argnum
].reg
;
3972 int partial
= argvec
[argnum
].partial
;
3973 unsigned int parm_align
= argvec
[argnum
].locate
.boundary
;
3974 int lower_bound
= 0, upper_bound
= 0, i
;
3976 if (! (reg
!= 0 && partial
== 0))
3980 if (ACCUMULATE_OUTGOING_ARGS
)
3982 /* If this is being stored into a pre-allocated, fixed-size,
3983 stack area, save any previous data at that location. */
3985 #ifdef ARGS_GROW_DOWNWARD
3986 /* stack_slot is negative, but we want to index stack_usage_map
3987 with positive values. */
3988 upper_bound
= -argvec
[argnum
].locate
.slot_offset
.constant
+ 1;
3989 lower_bound
= upper_bound
- argvec
[argnum
].locate
.size
.constant
;
3991 lower_bound
= argvec
[argnum
].locate
.slot_offset
.constant
;
3992 upper_bound
= lower_bound
+ argvec
[argnum
].locate
.size
.constant
;
3996 /* Don't worry about things in the fixed argument area;
3997 it has already been saved. */
3998 if (i
< reg_parm_stack_space
)
3999 i
= reg_parm_stack_space
;
4000 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
4003 if (i
< upper_bound
)
4005 /* We need to make a save area. */
4007 = argvec
[argnum
].locate
.size
.constant
* BITS_PER_UNIT
;
4008 enum machine_mode save_mode
4009 = mode_for_size (size
, MODE_INT
, 1);
4011 = plus_constant (Pmode
, argblock
,
4012 argvec
[argnum
].locate
.offset
.constant
);
4014 = gen_rtx_MEM (save_mode
, memory_address (save_mode
, adr
));
4016 if (save_mode
== BLKmode
)
4018 argvec
[argnum
].save_area
4019 = assign_stack_temp (BLKmode
,
4020 argvec
[argnum
].locate
.size
.constant
4023 emit_block_move (validize_mem (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
);
4069 /* If we pushed args in forward order, perform stack alignment
4070 after pushing the last arg. */
4071 if (argblock
== 0 && !PUSH_ARGS_REVERSED
)
4072 anti_adjust_stack (GEN_INT (args_size
.constant
4073 - original_args_size
.constant
));
4075 if (PUSH_ARGS_REVERSED
)
4080 fun
= prepare_call_address (NULL
, fun
, NULL
, &call_fusage
, 0, 0);
4082 /* Now load any reg parms into their regs. */
4084 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4085 are to be pushed. */
4086 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
4088 enum machine_mode mode
= argvec
[argnum
].mode
;
4089 rtx val
= argvec
[argnum
].value
;
4090 rtx reg
= argvec
[argnum
].reg
;
4091 int partial
= argvec
[argnum
].partial
;
4092 #ifdef BLOCK_REG_PADDING
4096 /* Handle calls that pass values in multiple non-contiguous
4097 locations. The PA64 has examples of this for library calls. */
4098 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4099 emit_group_load (reg
, val
, NULL_TREE
, GET_MODE_SIZE (mode
));
4100 else if (reg
!= 0 && partial
== 0)
4102 emit_move_insn (reg
, val
);
4103 #ifdef BLOCK_REG_PADDING
4104 size
= GET_MODE_SIZE (argvec
[argnum
].mode
);
4106 /* Copied from load_register_parameters. */
4108 /* Handle case where we have a value that needs shifting
4109 up to the msb. eg. a QImode value and we're padding
4110 upward on a BYTES_BIG_ENDIAN machine. */
4111 if (size
< UNITS_PER_WORD
4112 && (argvec
[argnum
].locate
.where_pad
4113 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
4116 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
4118 /* Assigning REG here rather than a temp makes CALL_FUSAGE
4119 report the whole reg as used. Strictly speaking, the
4120 call only uses SIZE bytes at the msb end, but it doesn't
4121 seem worth generating rtl to say that. */
4122 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
4123 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, shift
, reg
, 1);
4125 emit_move_insn (reg
, x
);
4133 /* Any regs containing parms remain in use through the call. */
4134 for (count
= 0; count
< nargs
; count
++)
4136 rtx reg
= argvec
[count
].reg
;
4137 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4138 use_group_regs (&call_fusage
, reg
);
4141 int partial
= argvec
[count
].partial
;
4145 gcc_assert (partial
% UNITS_PER_WORD
== 0);
4146 nregs
= partial
/ UNITS_PER_WORD
;
4147 use_regs (&call_fusage
, REGNO (reg
), nregs
);
4150 use_reg (&call_fusage
, reg
);
4154 /* Pass the function the address in which to return a structure value. */
4155 if (mem_value
!= 0 && struct_value
!= 0 && ! pcc_struct_value
)
4157 emit_move_insn (struct_value
,
4159 force_operand (XEXP (mem_value
, 0),
4161 if (REG_P (struct_value
))
4162 use_reg (&call_fusage
, struct_value
);
4165 /* Don't allow popping to be deferred, since then
4166 cse'ing of library calls could delete a call and leave the pop. */
4168 valreg
= (mem_value
== 0 && outmode
!= VOIDmode
4169 ? hard_libcall_value (outmode
, orgfun
) : NULL_RTX
);
4171 /* Stack must be properly aligned now. */
4172 gcc_assert (!(stack_pointer_delta
4173 & (PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
- 1)));
4175 before_call
= get_last_insn ();
4177 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4178 will set inhibit_defer_pop to that value. */
4179 /* The return type is needed to decide how many bytes the function pops.
4180 Signedness plays no role in that, so for simplicity, we pretend it's
4181 always signed. We also assume that the list of arguments passed has
4182 no impact, so we pretend it is unknown. */
4184 emit_call_1 (fun
, NULL
,
4185 get_identifier (XSTR (orgfun
, 0)),
4186 build_function_type (tfom
, NULL_TREE
),
4187 original_args_size
.constant
, args_size
.constant
,
4189 targetm
.calls
.function_arg (args_so_far
,
4190 VOIDmode
, void_type_node
, true),
4192 old_inhibit_defer_pop
+ 1, call_fusage
, flags
, args_so_far
);
4194 /* Right-shift returned value if necessary. */
4195 if (!pcc_struct_value
4196 && TYPE_MODE (tfom
) != BLKmode
4197 && targetm
.calls
.return_in_msb (tfom
))
4199 shift_return_value (TYPE_MODE (tfom
), false, valreg
);
4200 valreg
= gen_rtx_REG (TYPE_MODE (tfom
), REGNO (valreg
));
4203 /* For calls to `setjmp', etc., inform function.c:setjmp_warnings
4204 that it should complain if nonvolatile values are live. For
4205 functions that cannot return, inform flow that control does not
4207 if (flags
& ECF_NORETURN
)
4209 /* The barrier note must be emitted
4210 immediately after the CALL_INSN. Some ports emit more than
4211 just a CALL_INSN above, so we must search for it here. */
4212 rtx last
= get_last_insn ();
4213 while (!CALL_P (last
))
4215 last
= PREV_INSN (last
);
4216 /* There was no CALL_INSN? */
4217 gcc_assert (last
!= before_call
);
4220 emit_barrier_after (last
);
4223 /* Consider that "regular" libcalls, i.e. all of them except for LCT_THROW
4224 and LCT_RETURNS_TWICE, cannot perform non-local gotos. */
4225 if (flags
& ECF_NOTHROW
)
4227 rtx last
= get_last_insn ();
4228 while (!CALL_P (last
))
4230 last
= PREV_INSN (last
);
4231 /* There was no CALL_INSN? */
4232 gcc_assert (last
!= before_call
);
4235 make_reg_eh_region_note_nothrow_nononlocal (last
);
4238 /* Now restore inhibit_defer_pop to its actual original value. */
4243 /* Copy the value to the right place. */
4244 if (outmode
!= VOIDmode
&& retval
)
4250 if (value
!= mem_value
)
4251 emit_move_insn (value
, mem_value
);
4253 else if (GET_CODE (valreg
) == PARALLEL
)
4256 value
= gen_reg_rtx (outmode
);
4257 emit_group_store (value
, valreg
, NULL_TREE
, GET_MODE_SIZE (outmode
));
4261 /* Convert to the proper mode if a promotion has been active. */
4262 if (GET_MODE (valreg
) != outmode
)
4264 int unsignedp
= TYPE_UNSIGNED (tfom
);
4266 gcc_assert (promote_function_mode (tfom
, outmode
, &unsignedp
,
4267 fndecl
? TREE_TYPE (fndecl
) : fntype
, 1)
4268 == GET_MODE (valreg
));
4269 valreg
= convert_modes (outmode
, GET_MODE (valreg
), valreg
, 0);
4273 emit_move_insn (value
, valreg
);
4279 if (ACCUMULATE_OUTGOING_ARGS
)
4281 #ifdef REG_PARM_STACK_SPACE
4283 restore_fixed_argument_area (save_area
, argblock
,
4284 high_to_save
, low_to_save
);
4287 /* If we saved any argument areas, restore them. */
4288 for (count
= 0; count
< nargs
; count
++)
4289 if (argvec
[count
].save_area
)
4291 enum machine_mode save_mode
= GET_MODE (argvec
[count
].save_area
);
4292 rtx adr
= plus_constant (Pmode
, argblock
,
4293 argvec
[count
].locate
.offset
.constant
);
4294 rtx stack_area
= gen_rtx_MEM (save_mode
,
4295 memory_address (save_mode
, adr
));
4297 if (save_mode
== BLKmode
)
4298 emit_block_move (stack_area
,
4299 validize_mem (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
)
4440 tree ot
= TREE_TYPE (arg
->tree_value
);
4441 tree nt
= build_qualified_type (ot
, (TYPE_QUALS (ot
)
4442 | TYPE_QUAL_CONST
));
4444 arg
->save_area
= assign_temp (nt
, 1, 1);
4445 preserve_temp_slots (arg
->save_area
);
4446 emit_block_move (validize_mem (arg
->save_area
), stack_area
,
4447 GEN_INT (arg
->locate
.size
.constant
),
4448 BLOCK_OP_CALL_PARM
);
4452 arg
->save_area
= gen_reg_rtx (save_mode
);
4453 emit_move_insn (arg
->save_area
, stack_area
);
4459 /* If this isn't going to be placed on both the stack and in registers,
4460 set up the register and number of words. */
4461 if (! arg
->pass_on_stack
)
4463 if (flags
& ECF_SIBCALL
)
4464 reg
= arg
->tail_call_reg
;
4467 partial
= arg
->partial
;
4470 /* Being passed entirely in a register. We shouldn't be called in
4472 gcc_assert (reg
== 0 || partial
!= 0);
4474 /* If this arg needs special alignment, don't load the registers
4476 if (arg
->n_aligned_regs
!= 0)
4479 /* If this is being passed partially in a register, we can't evaluate
4480 it directly into its stack slot. Otherwise, we can. */
4481 if (arg
->value
== 0)
4483 /* stack_arg_under_construction is nonzero if a function argument is
4484 being evaluated directly into the outgoing argument list and
4485 expand_call must take special action to preserve the argument list
4486 if it is called recursively.
4488 For scalar function arguments stack_usage_map is sufficient to
4489 determine which stack slots must be saved and restored. Scalar
4490 arguments in general have pass_on_stack == 0.
4492 If this argument is initialized by a function which takes the
4493 address of the argument (a C++ constructor or a C function
4494 returning a BLKmode structure), then stack_usage_map is
4495 insufficient and expand_call must push the stack around the
4496 function call. Such arguments have pass_on_stack == 1.
4498 Note that it is always safe to set stack_arg_under_construction,
4499 but this generates suboptimal code if set when not needed. */
4501 if (arg
->pass_on_stack
)
4502 stack_arg_under_construction
++;
4504 arg
->value
= expand_expr (pval
,
4506 || TYPE_MODE (TREE_TYPE (pval
)) != arg
->mode
)
4507 ? NULL_RTX
: arg
->stack
,
4508 VOIDmode
, EXPAND_STACK_PARM
);
4510 /* If we are promoting object (or for any other reason) the mode
4511 doesn't agree, convert the mode. */
4513 if (arg
->mode
!= TYPE_MODE (TREE_TYPE (pval
)))
4514 arg
->value
= convert_modes (arg
->mode
, TYPE_MODE (TREE_TYPE (pval
)),
4515 arg
->value
, arg
->unsignedp
);
4517 if (arg
->pass_on_stack
)
4518 stack_arg_under_construction
--;
4521 /* Check for overlap with already clobbered argument area. */
4522 if ((flags
& ECF_SIBCALL
)
4523 && MEM_P (arg
->value
)
4524 && mem_overlaps_already_clobbered_arg_p (XEXP (arg
->value
, 0),
4525 arg
->locate
.size
.constant
))
4526 sibcall_failure
= 1;
4528 /* Don't allow anything left on stack from computation
4529 of argument to alloca. */
4530 if (flags
& ECF_MAY_BE_ALLOCA
)
4531 do_pending_stack_adjust ();
4533 if (arg
->value
== arg
->stack
)
4534 /* If the value is already in the stack slot, we are done. */
4536 else if (arg
->mode
!= BLKmode
)
4539 unsigned int parm_align
;
4541 /* Argument is a scalar, not entirely passed in registers.
4542 (If part is passed in registers, arg->partial says how much
4543 and emit_push_insn will take care of putting it there.)
4545 Push it, and if its size is less than the
4546 amount of space allocated to it,
4547 also bump stack pointer by the additional space.
4548 Note that in C the default argument promotions
4549 will prevent such mismatches. */
4551 size
= GET_MODE_SIZE (arg
->mode
);
4552 /* Compute how much space the push instruction will push.
4553 On many machines, pushing a byte will advance the stack
4554 pointer by a halfword. */
4555 #ifdef PUSH_ROUNDING
4556 size
= PUSH_ROUNDING (size
);
4560 /* Compute how much space the argument should get:
4561 round up to a multiple of the alignment for arguments. */
4562 if (none
!= FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)))
4563 used
= (((size
+ PARM_BOUNDARY
/ BITS_PER_UNIT
- 1)
4564 / (PARM_BOUNDARY
/ BITS_PER_UNIT
))
4565 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
4567 /* Compute the alignment of the pushed argument. */
4568 parm_align
= arg
->locate
.boundary
;
4569 if (FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)) == downward
)
4571 int pad
= used
- size
;
4574 unsigned int pad_align
= (pad
& -pad
) * BITS_PER_UNIT
;
4575 parm_align
= MIN (parm_align
, pad_align
);
4579 /* This isn't already where we want it on the stack, so put it there.
4580 This can either be done with push or copy insns. */
4581 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), NULL_RTX
,
4582 parm_align
, partial
, reg
, used
- size
, argblock
,
4583 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
4584 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
));
4586 /* Unless this is a partially-in-register argument, the argument is now
4589 arg
->value
= arg
->stack
;
4593 /* BLKmode, at least partly to be pushed. */
4595 unsigned int parm_align
;
4599 /* Pushing a nonscalar.
4600 If part is passed in registers, PARTIAL says how much
4601 and emit_push_insn will take care of putting it there. */
4603 /* Round its size up to a multiple
4604 of the allocation unit for arguments. */
4606 if (arg
->locate
.size
.var
!= 0)
4609 size_rtx
= ARGS_SIZE_RTX (arg
->locate
.size
);
4613 /* PUSH_ROUNDING has no effect on us, because emit_push_insn
4614 for BLKmode is careful to avoid it. */
4615 excess
= (arg
->locate
.size
.constant
4616 - int_size_in_bytes (TREE_TYPE (pval
))
4618 size_rtx
= expand_expr (size_in_bytes (TREE_TYPE (pval
)),
4619 NULL_RTX
, TYPE_MODE (sizetype
),
4623 parm_align
= arg
->locate
.boundary
;
4625 /* When an argument is padded down, the block is aligned to
4626 PARM_BOUNDARY, but the actual argument isn't. */
4627 if (FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)) == downward
)
4629 if (arg
->locate
.size
.var
)
4630 parm_align
= BITS_PER_UNIT
;
4633 unsigned int excess_align
= (excess
& -excess
) * BITS_PER_UNIT
;
4634 parm_align
= MIN (parm_align
, excess_align
);
4638 if ((flags
& ECF_SIBCALL
) && MEM_P (arg
->value
))
4640 /* emit_push_insn might not work properly if arg->value and
4641 argblock + arg->locate.offset areas overlap. */
4645 if (XEXP (x
, 0) == crtl
->args
.internal_arg_pointer
4646 || (GET_CODE (XEXP (x
, 0)) == PLUS
4647 && XEXP (XEXP (x
, 0), 0) ==
4648 crtl
->args
.internal_arg_pointer
4649 && CONST_INT_P (XEXP (XEXP (x
, 0), 1))))
4651 if (XEXP (x
, 0) != crtl
->args
.internal_arg_pointer
)
4652 i
= INTVAL (XEXP (XEXP (x
, 0), 1));
4654 /* expand_call should ensure this. */
4655 gcc_assert (!arg
->locate
.offset
.var
4656 && arg
->locate
.size
.var
== 0
4657 && CONST_INT_P (size_rtx
));
4659 if (arg
->locate
.offset
.constant
> i
)
4661 if (arg
->locate
.offset
.constant
< i
+ INTVAL (size_rtx
))
4662 sibcall_failure
= 1;
4664 else if (arg
->locate
.offset
.constant
< i
)
4666 /* Use arg->locate.size.constant instead of size_rtx
4667 because we only care about the part of the argument
4669 if (i
< (arg
->locate
.offset
.constant
4670 + arg
->locate
.size
.constant
))
4671 sibcall_failure
= 1;
4675 /* Even though they appear to be at the same location,
4676 if part of the outgoing argument is in registers,
4677 they aren't really at the same location. Check for
4678 this by making sure that the incoming size is the
4679 same as the outgoing size. */
4680 if (arg
->locate
.size
.constant
!= INTVAL (size_rtx
))
4681 sibcall_failure
= 1;
4686 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx
,
4687 parm_align
, partial
, reg
, excess
, argblock
,
4688 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
4689 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
));
4691 /* Unless this is a partially-in-register argument, the argument is now
4694 ??? Unlike the case above, in which we want the actual
4695 address of the data, so that we can load it directly into a
4696 register, here we want the address of the stack slot, so that
4697 it's properly aligned for word-by-word copying or something
4698 like that. It's not clear that this is always correct. */
4700 arg
->value
= arg
->stack_slot
;
4703 if (arg
->reg
&& GET_CODE (arg
->reg
) == PARALLEL
)
4705 tree type
= TREE_TYPE (arg
->tree_value
);
4707 = emit_group_load_into_temps (arg
->reg
, arg
->value
, type
,
4708 int_size_in_bytes (type
));
4711 /* Mark all slots this store used. */
4712 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
)
4713 && argblock
&& ! variable_size
&& arg
->stack
)
4714 for (i
= lower_bound
; i
< upper_bound
; i
++)
4715 stack_usage_map
[i
] = 1;
4717 /* Once we have pushed something, pops can't safely
4718 be deferred during the rest of the arguments. */
4721 /* Free any temporary slots made in processing this argument. */
4724 return sibcall_failure
;
4727 /* Nonzero if we do not know how to pass TYPE solely in registers. */
4730 must_pass_in_stack_var_size (enum machine_mode mode ATTRIBUTE_UNUSED
,
4736 /* If the type has variable size... */
4737 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4740 /* If the type is marked as addressable (it is required
4741 to be constructed into the stack)... */
4742 if (TREE_ADDRESSABLE (type
))
4748 /* Another version of the TARGET_MUST_PASS_IN_STACK hook. This one
4749 takes trailing padding of a structure into account. */
4750 /* ??? Should be able to merge these two by examining BLOCK_REG_PADDING. */
4753 must_pass_in_stack_var_size_or_pad (enum machine_mode mode
, const_tree type
)
4758 /* If the type has variable size... */
4759 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4762 /* If the type is marked as addressable (it is required
4763 to be constructed into the stack)... */
4764 if (TREE_ADDRESSABLE (type
))
4767 /* If the padding and mode of the type is such that a copy into
4768 a register would put it into the wrong part of the register. */
4770 && int_size_in_bytes (type
) % (PARM_BOUNDARY
/ BITS_PER_UNIT
)
4771 && (FUNCTION_ARG_PADDING (mode
, type
)
4772 == (BYTES_BIG_ENDIAN
? upward
: downward
)))