1 /* Convert function calls to rtl insns, for GNU C compiler.
2 Copyright (C) 1989-2017 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"
31 #include "stringpool.h"
36 #include "diagnostic-core.h"
37 #include "fold-const.h"
38 #include "stor-layout.h"
40 #include "internal-fn.h"
46 #include "langhooks.h"
50 #include "tree-chkp.h"
52 #include "tree-ssanames.h"
55 #include "stringpool.h"
58 /* Like PREFERRED_STACK_BOUNDARY but in units of bytes, not bits. */
59 #define STACK_BYTES (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)
61 /* Data structure and subroutines used within expand_call. */
65 /* Tree node for this argument. */
67 /* Mode for value; TYPE_MODE unless promoted. */
69 /* Current RTL value for argument, or 0 if it isn't precomputed. */
71 /* Initially-compute RTL value for argument; only for const functions. */
73 /* Register to pass this argument in, 0 if passed on stack, or an
74 PARALLEL if the arg is to be copied into multiple non-contiguous
77 /* Register to pass this argument in when generating tail call sequence.
78 This is not the same register as for normal calls on machines with
81 /* If REG is a PARALLEL, this is a copy of VALUE pulled into the correct
82 form for emit_group_move. */
84 /* If value is passed in neither reg nor stack, this field holds a number
85 of a special slot to be used. */
87 /* For pointer bounds hold an index of parm bounds are bound to. -1 if
88 there is no such pointer. */
90 /* If pointer_arg refers a structure, then pointer_offset holds an offset
91 of a pointer in this structure. */
93 /* If REG was promoted from the actual mode of the argument expression,
94 indicates whether the promotion is sign- or zero-extended. */
96 /* Number of bytes to put in registers. 0 means put the whole arg
97 in registers. Also 0 if not passed in registers. */
99 /* Nonzero if argument must be passed on stack.
100 Note that some arguments may be passed on the stack
101 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
102 pass_on_stack identifies arguments that *cannot* go in registers. */
104 /* Some fields packaged up for locate_and_pad_parm. */
105 struct locate_and_pad_arg_data locate
;
106 /* Location on the stack at which parameter should be stored. The store
107 has already been done if STACK == VALUE. */
109 /* Location on the stack of the start of this argument slot. This can
110 differ from STACK if this arg pads downward. This location is known
111 to be aligned to TARGET_FUNCTION_ARG_BOUNDARY. */
113 /* Place that this stack area has been saved, if needed. */
115 /* If an argument's alignment does not permit direct copying into registers,
116 copy in smaller-sized pieces into pseudos. These are stored in a
117 block pointed to by this field. The next field says how many
118 word-sized pseudos we made. */
123 /* A vector of one char per byte of stack space. A byte if nonzero if
124 the corresponding stack location has been used.
125 This vector is used to prevent a function call within an argument from
126 clobbering any stack already set up. */
127 static char *stack_usage_map
;
129 /* Size of STACK_USAGE_MAP. */
130 static int highest_outgoing_arg_in_use
;
132 /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
133 stack location's tail call argument has been already stored into the stack.
134 This bitmap is used to prevent sibling call optimization if function tries
135 to use parent's incoming argument slots when they have been already
136 overwritten with tail call arguments. */
137 static sbitmap stored_args_map
;
139 /* stack_arg_under_construction is nonzero when an argument may be
140 initialized with a constructor call (including a C function that
141 returns a BLKmode struct) and expand_call must take special action
142 to make sure the object being constructed does not overlap the
143 argument list for the constructor call. */
144 static int stack_arg_under_construction
;
146 static void emit_call_1 (rtx
, tree
, tree
, tree
, HOST_WIDE_INT
, HOST_WIDE_INT
,
147 HOST_WIDE_INT
, rtx
, rtx
, int, rtx
, int,
149 static void precompute_register_parameters (int, struct arg_data
*, int *);
150 static void store_bounds (struct arg_data
*, struct arg_data
*);
151 static int store_one_arg (struct arg_data
*, rtx
, int, int, int);
152 static void store_unaligned_arguments_into_pseudos (struct arg_data
*, int);
153 static int finalize_must_preallocate (int, int, struct arg_data
*,
155 static void precompute_arguments (int, struct arg_data
*);
156 static int compute_argument_block_size (int, struct args_size
*, tree
, tree
, int);
157 static void initialize_argument_information (int, struct arg_data
*,
158 struct args_size
*, int,
160 tree
, tree
, cumulative_args_t
, int,
161 rtx
*, int *, int *, int *,
163 static void compute_argument_addresses (struct arg_data
*, rtx
, int);
164 static rtx
rtx_for_function_call (tree
, tree
);
165 static void load_register_parameters (struct arg_data
*, int, rtx
*, int,
167 static rtx
emit_library_call_value_1 (int, rtx
, rtx
, enum libcall_type
,
168 machine_mode
, int, va_list);
169 static int special_function_p (const_tree
, int);
170 static int check_sibcall_argument_overlap_1 (rtx
);
171 static int check_sibcall_argument_overlap (rtx_insn
*, struct arg_data
*, int);
173 static int combine_pending_stack_adjustment_and_call (int, struct args_size
*,
175 static tree
split_complex_types (tree
);
177 #ifdef REG_PARM_STACK_SPACE
178 static rtx
save_fixed_argument_area (int, rtx
, int *, int *);
179 static void restore_fixed_argument_area (rtx
, rtx
, int, int);
182 /* Force FUNEXP into a form suitable for the address of a CALL,
183 and return that as an rtx. Also load the static chain register
184 if FNDECL is a nested function.
186 CALL_FUSAGE points to a variable holding the prospective
187 CALL_INSN_FUNCTION_USAGE information. */
190 prepare_call_address (tree fndecl_or_type
, rtx funexp
, rtx static_chain_value
,
191 rtx
*call_fusage
, int reg_parm_seen
, int flags
)
193 /* Make a valid memory address and copy constants through pseudo-regs,
194 but not for a constant address if -fno-function-cse. */
195 if (GET_CODE (funexp
) != SYMBOL_REF
)
197 /* If it's an indirect call by descriptor, generate code to perform
198 runtime identification of the pointer and load the descriptor. */
199 if ((flags
& ECF_BY_DESCRIPTOR
) && !flag_trampolines
)
201 const int bit_val
= targetm
.calls
.custom_function_descriptors
;
202 rtx call_lab
= gen_label_rtx ();
204 gcc_assert (fndecl_or_type
&& TYPE_P (fndecl_or_type
));
206 = build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
, NULL_TREE
,
208 DECL_STATIC_CHAIN (fndecl_or_type
) = 1;
209 rtx chain
= targetm
.calls
.static_chain (fndecl_or_type
, false);
211 if (GET_MODE (funexp
) != Pmode
)
212 funexp
= convert_memory_address (Pmode
, funexp
);
214 /* Avoid long live ranges around function calls. */
215 funexp
= copy_to_mode_reg (Pmode
, funexp
);
218 emit_insn (gen_rtx_CLOBBER (VOIDmode
, chain
));
220 /* Emit the runtime identification pattern. */
221 rtx mask
= gen_rtx_AND (Pmode
, funexp
, GEN_INT (bit_val
));
222 emit_cmp_and_jump_insns (mask
, const0_rtx
, EQ
, NULL_RTX
, Pmode
, 1,
225 /* Statically predict the branch to very likely taken. */
226 rtx_insn
*insn
= get_last_insn ();
228 predict_insn_def (insn
, PRED_BUILTIN_EXPECT
, TAKEN
);
230 /* Load the descriptor. */
231 rtx mem
= gen_rtx_MEM (ptr_mode
,
232 plus_constant (Pmode
, funexp
, - bit_val
));
233 MEM_NOTRAP_P (mem
) = 1;
234 mem
= convert_memory_address (Pmode
, mem
);
235 emit_move_insn (chain
, mem
);
237 mem
= gen_rtx_MEM (ptr_mode
,
238 plus_constant (Pmode
, funexp
,
239 POINTER_SIZE
/ BITS_PER_UNIT
241 MEM_NOTRAP_P (mem
) = 1;
242 mem
= convert_memory_address (Pmode
, mem
);
243 emit_move_insn (funexp
, mem
);
245 emit_label (call_lab
);
249 use_reg (call_fusage
, chain
);
250 STATIC_CHAIN_REG_P (chain
) = 1;
253 /* Make sure we're not going to be overwritten below. */
254 gcc_assert (!static_chain_value
);
257 /* If we are using registers for parameters, force the
258 function address into a register now. */
259 funexp
= ((reg_parm_seen
260 && targetm
.small_register_classes_for_mode_p (FUNCTION_MODE
))
261 ? force_not_mem (memory_address (FUNCTION_MODE
, funexp
))
262 : memory_address (FUNCTION_MODE
, funexp
));
266 /* funexp could be a SYMBOL_REF represents a function pointer which is
267 of ptr_mode. In this case, it should be converted into address mode
268 to be a valid address for memory rtx pattern. See PR 64971. */
269 if (GET_MODE (funexp
) != Pmode
)
270 funexp
= convert_memory_address (Pmode
, funexp
);
272 if (!(flags
& ECF_SIBCALL
))
274 if (!NO_FUNCTION_CSE
&& optimize
&& ! flag_no_function_cse
)
275 funexp
= force_reg (Pmode
, funexp
);
279 if (static_chain_value
!= 0
280 && (TREE_CODE (fndecl_or_type
) != FUNCTION_DECL
281 || DECL_STATIC_CHAIN (fndecl_or_type
)))
285 chain
= targetm
.calls
.static_chain (fndecl_or_type
, false);
286 static_chain_value
= convert_memory_address (Pmode
, static_chain_value
);
288 emit_move_insn (chain
, static_chain_value
);
291 use_reg (call_fusage
, chain
);
292 STATIC_CHAIN_REG_P (chain
) = 1;
299 /* Generate instructions to call function FUNEXP,
300 and optionally pop the results.
301 The CALL_INSN is the first insn generated.
303 FNDECL is the declaration node of the function. This is given to the
304 hook TARGET_RETURN_POPS_ARGS to determine whether this function pops
307 FUNTYPE is the data type of the function. This is given to the hook
308 TARGET_RETURN_POPS_ARGS to determine whether this function pops its
309 own args. We used to allow an identifier for library functions, but
310 that doesn't work when the return type is an aggregate type and the
311 calling convention says that the pointer to this aggregate is to be
312 popped by the callee.
314 STACK_SIZE is the number of bytes of arguments on the stack,
315 ROUNDED_STACK_SIZE is that number rounded up to
316 PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
317 both to put into the call insn and to generate explicit popping
320 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
321 It is zero if this call doesn't want a structure value.
323 NEXT_ARG_REG is the rtx that results from executing
324 targetm.calls.function_arg (&args_so_far, VOIDmode, void_type_node, true)
325 just after all the args have had their registers assigned.
326 This could be whatever you like, but normally it is the first
327 arg-register beyond those used for args in this call,
328 or 0 if all the arg-registers are used in this call.
329 It is passed on to `gen_call' so you can put this info in the call insn.
331 VALREG is a hard register in which a value is returned,
332 or 0 if the call does not return a value.
334 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
335 the args to this call were processed.
336 We restore `inhibit_defer_pop' to that value.
338 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
339 denote registers used by the called function. */
342 emit_call_1 (rtx funexp
, tree fntree ATTRIBUTE_UNUSED
, tree fndecl ATTRIBUTE_UNUSED
,
343 tree funtype ATTRIBUTE_UNUSED
,
344 HOST_WIDE_INT stack_size ATTRIBUTE_UNUSED
,
345 HOST_WIDE_INT rounded_stack_size
,
346 HOST_WIDE_INT struct_value_size ATTRIBUTE_UNUSED
,
347 rtx next_arg_reg ATTRIBUTE_UNUSED
, rtx valreg
,
348 int old_inhibit_defer_pop
, rtx call_fusage
, int ecf_flags
,
349 cumulative_args_t args_so_far ATTRIBUTE_UNUSED
)
351 rtx rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
352 rtx call
, funmem
, pat
;
353 int already_popped
= 0;
354 HOST_WIDE_INT n_popped
= 0;
356 /* Sibling call patterns never pop arguments (no sibcall(_value)_pop
357 patterns exist). Any popping that the callee does on return will
358 be from our caller's frame rather than ours. */
359 if (!(ecf_flags
& ECF_SIBCALL
))
361 n_popped
+= targetm
.calls
.return_pops_args (fndecl
, funtype
, stack_size
);
363 #ifdef CALL_POPS_ARGS
364 n_popped
+= CALL_POPS_ARGS (*get_cumulative_args (args_so_far
));
368 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
369 and we don't want to load it into a register as an optimization,
370 because prepare_call_address already did it if it should be done. */
371 if (GET_CODE (funexp
) != SYMBOL_REF
)
372 funexp
= memory_address (FUNCTION_MODE
, funexp
);
374 funmem
= gen_rtx_MEM (FUNCTION_MODE
, funexp
);
375 if (fndecl
&& TREE_CODE (fndecl
) == FUNCTION_DECL
)
379 /* Although a built-in FUNCTION_DECL and its non-__builtin
380 counterpart compare equal and get a shared mem_attrs, they
381 produce different dump output in compare-debug compilations,
382 if an entry gets garbage collected in one compilation, then
383 adds a different (but equivalent) entry, while the other
384 doesn't run the garbage collector at the same spot and then
385 shares the mem_attr with the equivalent entry. */
386 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
388 tree t2
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
393 set_mem_expr (funmem
, t
);
396 set_mem_expr (funmem
, build_simple_mem_ref (CALL_EXPR_FN (fntree
)));
398 if (ecf_flags
& ECF_SIBCALL
)
401 pat
= targetm
.gen_sibcall_value (valreg
, funmem
,
402 rounded_stack_size_rtx
,
403 next_arg_reg
, NULL_RTX
);
405 pat
= targetm
.gen_sibcall (funmem
, rounded_stack_size_rtx
,
406 next_arg_reg
, GEN_INT (struct_value_size
));
408 /* If the target has "call" or "call_value" insns, then prefer them
409 if no arguments are actually popped. If the target does not have
410 "call" or "call_value" insns, then we must use the popping versions
411 even if the call has no arguments to pop. */
412 else if (n_popped
> 0
414 ? targetm
.have_call_value ()
415 : targetm
.have_call ()))
417 rtx n_pop
= GEN_INT (n_popped
);
419 /* If this subroutine pops its own args, record that in the call insn
420 if possible, for the sake of frame pointer elimination. */
423 pat
= targetm
.gen_call_value_pop (valreg
, funmem
,
424 rounded_stack_size_rtx
,
425 next_arg_reg
, n_pop
);
427 pat
= targetm
.gen_call_pop (funmem
, rounded_stack_size_rtx
,
428 next_arg_reg
, n_pop
);
435 pat
= targetm
.gen_call_value (valreg
, funmem
, rounded_stack_size_rtx
,
436 next_arg_reg
, NULL_RTX
);
438 pat
= targetm
.gen_call (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
439 GEN_INT (struct_value_size
));
443 /* Find the call we just emitted. */
444 rtx_call_insn
*call_insn
= last_call_insn ();
446 /* Some target create a fresh MEM instead of reusing the one provided
447 above. Set its MEM_EXPR. */
448 call
= get_call_rtx_from (call_insn
);
450 && MEM_EXPR (XEXP (call
, 0)) == NULL_TREE
451 && MEM_EXPR (funmem
) != NULL_TREE
)
452 set_mem_expr (XEXP (call
, 0), MEM_EXPR (funmem
));
454 /* Mark instrumented calls. */
456 CALL_EXPR_WITH_BOUNDS_P (call
) = CALL_WITH_BOUNDS_P (fntree
);
458 /* Put the register usage information there. */
459 add_function_usage_to (call_insn
, call_fusage
);
461 /* If this is a const call, then set the insn's unchanging bit. */
462 if (ecf_flags
& ECF_CONST
)
463 RTL_CONST_CALL_P (call_insn
) = 1;
465 /* If this is a pure call, then set the insn's unchanging bit. */
466 if (ecf_flags
& ECF_PURE
)
467 RTL_PURE_CALL_P (call_insn
) = 1;
469 /* If this is a const call, then set the insn's unchanging bit. */
470 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
471 RTL_LOOPING_CONST_OR_PURE_CALL_P (call_insn
) = 1;
473 /* Create a nothrow REG_EH_REGION note, if needed. */
474 make_reg_eh_region_note (call_insn
, ecf_flags
, 0);
476 if (ecf_flags
& ECF_NORETURN
)
477 add_reg_note (call_insn
, REG_NORETURN
, const0_rtx
);
479 if (ecf_flags
& ECF_RETURNS_TWICE
)
481 add_reg_note (call_insn
, REG_SETJMP
, const0_rtx
);
482 cfun
->calls_setjmp
= 1;
485 SIBLING_CALL_P (call_insn
) = ((ecf_flags
& ECF_SIBCALL
) != 0);
487 /* Restore this now, so that we do defer pops for this call's args
488 if the context of the call as a whole permits. */
489 inhibit_defer_pop
= old_inhibit_defer_pop
;
494 CALL_INSN_FUNCTION_USAGE (call_insn
)
495 = gen_rtx_EXPR_LIST (VOIDmode
,
496 gen_rtx_CLOBBER (VOIDmode
, stack_pointer_rtx
),
497 CALL_INSN_FUNCTION_USAGE (call_insn
));
498 rounded_stack_size
-= n_popped
;
499 rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
500 stack_pointer_delta
-= n_popped
;
502 add_reg_note (call_insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
504 /* If popup is needed, stack realign must use DRAP */
505 if (SUPPORTS_STACK_ALIGNMENT
)
506 crtl
->need_drap
= true;
508 /* For noreturn calls when not accumulating outgoing args force
509 REG_ARGS_SIZE note to prevent crossjumping of calls with different
511 else if (!ACCUMULATE_OUTGOING_ARGS
&& (ecf_flags
& ECF_NORETURN
) != 0)
512 add_reg_note (call_insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
514 if (!ACCUMULATE_OUTGOING_ARGS
)
516 /* If returning from the subroutine does not automatically pop the args,
517 we need an instruction to pop them sooner or later.
518 Perhaps do it now; perhaps just record how much space to pop later.
520 If returning from the subroutine does pop the args, indicate that the
521 stack pointer will be changed. */
523 if (rounded_stack_size
!= 0)
525 if (ecf_flags
& ECF_NORETURN
)
526 /* Just pretend we did the pop. */
527 stack_pointer_delta
-= rounded_stack_size
;
528 else if (flag_defer_pop
&& inhibit_defer_pop
== 0
529 && ! (ecf_flags
& (ECF_CONST
| ECF_PURE
)))
530 pending_stack_adjust
+= rounded_stack_size
;
532 adjust_stack (rounded_stack_size_rtx
);
535 /* When we accumulate outgoing args, we must avoid any stack manipulations.
536 Restore the stack pointer to its original value now. Usually
537 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
538 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
539 popping variants of functions exist as well.
541 ??? We may optimize similar to defer_pop above, but it is
542 probably not worthwhile.
544 ??? It will be worthwhile to enable combine_stack_adjustments even for
547 anti_adjust_stack (GEN_INT (n_popped
));
550 /* Determine if the function identified by FNDECL is one with
551 special properties we wish to know about. Modify FLAGS accordingly.
553 For example, if the function might return more than one time (setjmp), then
554 set ECF_RETURNS_TWICE.
556 Set ECF_MAY_BE_ALLOCA for any memory allocation function that might allocate
557 space from the stack such as alloca. */
560 special_function_p (const_tree fndecl
, int flags
)
562 tree name_decl
= DECL_NAME (fndecl
);
564 /* For instrumentation clones we want to derive flags
565 from the original name. */
566 if (cgraph_node::get (fndecl
)
567 && cgraph_node::get (fndecl
)->instrumentation_clone
)
568 name_decl
= DECL_NAME (cgraph_node::get (fndecl
)->orig_decl
);
570 if (fndecl
&& name_decl
571 && IDENTIFIER_LENGTH (name_decl
) <= 11
572 /* Exclude functions not at the file scope, or not `extern',
573 since they are not the magic functions we would otherwise
575 FIXME: this should be handled with attributes, not with this
576 hacky imitation of DECL_ASSEMBLER_NAME. It's (also) wrong
577 because you can declare fork() inside a function if you
579 && (DECL_CONTEXT (fndecl
) == NULL_TREE
580 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
581 && TREE_PUBLIC (fndecl
))
583 const char *name
= IDENTIFIER_POINTER (name_decl
);
584 const char *tname
= name
;
586 /* We assume that alloca will always be called by name. It
587 makes no sense to pass it as a pointer-to-function to
588 anything that does not understand its behavior. */
589 if (IDENTIFIER_LENGTH (name_decl
) == 6
591 && ! strcmp (name
, "alloca"))
592 flags
|= ECF_MAY_BE_ALLOCA
;
594 /* Disregard prefix _ or __. */
603 /* ECF_RETURNS_TWICE is safe even for -ffreestanding. */
604 if (! strcmp (tname
, "setjmp")
605 || ! strcmp (tname
, "sigsetjmp")
606 || ! strcmp (name
, "savectx")
607 || ! strcmp (name
, "vfork")
608 || ! strcmp (name
, "getcontext"))
609 flags
|= ECF_RETURNS_TWICE
;
612 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
613 switch (DECL_FUNCTION_CODE (fndecl
))
615 case BUILT_IN_ALLOCA
:
616 case BUILT_IN_ALLOCA_WITH_ALIGN
:
617 flags
|= ECF_MAY_BE_ALLOCA
;
626 /* Similar to special_function_p; return a set of ERF_ flags for the
629 decl_return_flags (tree fndecl
)
632 tree type
= TREE_TYPE (fndecl
);
636 attr
= lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type
));
640 attr
= TREE_VALUE (TREE_VALUE (attr
));
641 if (!attr
|| TREE_STRING_LENGTH (attr
) < 1)
644 switch (TREE_STRING_POINTER (attr
)[0])
650 return ERF_RETURNS_ARG
| (TREE_STRING_POINTER (attr
)[0] - '1');
661 /* Return nonzero when FNDECL represents a call to setjmp. */
664 setjmp_call_p (const_tree fndecl
)
666 if (DECL_IS_RETURNS_TWICE (fndecl
))
667 return ECF_RETURNS_TWICE
;
668 return special_function_p (fndecl
, 0) & ECF_RETURNS_TWICE
;
672 /* Return true if STMT may be an alloca call. */
675 gimple_maybe_alloca_call_p (const gimple
*stmt
)
679 if (!is_gimple_call (stmt
))
682 fndecl
= gimple_call_fndecl (stmt
);
683 if (fndecl
&& (special_function_p (fndecl
, 0) & ECF_MAY_BE_ALLOCA
))
689 /* Return true if STMT is a builtin alloca call. */
692 gimple_alloca_call_p (const gimple
*stmt
)
696 if (!is_gimple_call (stmt
))
699 fndecl
= gimple_call_fndecl (stmt
);
700 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
701 switch (DECL_FUNCTION_CODE (fndecl
))
703 case BUILT_IN_ALLOCA
:
704 case BUILT_IN_ALLOCA_WITH_ALIGN
:
713 /* Return true when exp contains a builtin alloca call. */
716 alloca_call_p (const_tree exp
)
719 if (TREE_CODE (exp
) == CALL_EXPR
720 && (fndecl
= get_callee_fndecl (exp
))
721 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
722 switch (DECL_FUNCTION_CODE (fndecl
))
724 case BUILT_IN_ALLOCA
:
725 case BUILT_IN_ALLOCA_WITH_ALIGN
:
734 /* Return TRUE if FNDECL is either a TM builtin or a TM cloned
735 function. Return FALSE otherwise. */
738 is_tm_builtin (const_tree fndecl
)
743 if (decl_is_tm_clone (fndecl
))
746 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
748 switch (DECL_FUNCTION_CODE (fndecl
))
750 case BUILT_IN_TM_COMMIT
:
751 case BUILT_IN_TM_COMMIT_EH
:
752 case BUILT_IN_TM_ABORT
:
753 case BUILT_IN_TM_IRREVOCABLE
:
754 case BUILT_IN_TM_GETTMCLONE_IRR
:
755 case BUILT_IN_TM_MEMCPY
:
756 case BUILT_IN_TM_MEMMOVE
:
757 case BUILT_IN_TM_MEMSET
:
758 CASE_BUILT_IN_TM_STORE (1):
759 CASE_BUILT_IN_TM_STORE (2):
760 CASE_BUILT_IN_TM_STORE (4):
761 CASE_BUILT_IN_TM_STORE (8):
762 CASE_BUILT_IN_TM_STORE (FLOAT
):
763 CASE_BUILT_IN_TM_STORE (DOUBLE
):
764 CASE_BUILT_IN_TM_STORE (LDOUBLE
):
765 CASE_BUILT_IN_TM_STORE (M64
):
766 CASE_BUILT_IN_TM_STORE (M128
):
767 CASE_BUILT_IN_TM_STORE (M256
):
768 CASE_BUILT_IN_TM_LOAD (1):
769 CASE_BUILT_IN_TM_LOAD (2):
770 CASE_BUILT_IN_TM_LOAD (4):
771 CASE_BUILT_IN_TM_LOAD (8):
772 CASE_BUILT_IN_TM_LOAD (FLOAT
):
773 CASE_BUILT_IN_TM_LOAD (DOUBLE
):
774 CASE_BUILT_IN_TM_LOAD (LDOUBLE
):
775 CASE_BUILT_IN_TM_LOAD (M64
):
776 CASE_BUILT_IN_TM_LOAD (M128
):
777 CASE_BUILT_IN_TM_LOAD (M256
):
778 case BUILT_IN_TM_LOG
:
779 case BUILT_IN_TM_LOG_1
:
780 case BUILT_IN_TM_LOG_2
:
781 case BUILT_IN_TM_LOG_4
:
782 case BUILT_IN_TM_LOG_8
:
783 case BUILT_IN_TM_LOG_FLOAT
:
784 case BUILT_IN_TM_LOG_DOUBLE
:
785 case BUILT_IN_TM_LOG_LDOUBLE
:
786 case BUILT_IN_TM_LOG_M64
:
787 case BUILT_IN_TM_LOG_M128
:
788 case BUILT_IN_TM_LOG_M256
:
797 /* Detect flags (function attributes) from the function decl or type node. */
800 flags_from_decl_or_type (const_tree exp
)
806 /* The function exp may have the `malloc' attribute. */
807 if (DECL_IS_MALLOC (exp
))
810 /* The function exp may have the `returns_twice' attribute. */
811 if (DECL_IS_RETURNS_TWICE (exp
))
812 flags
|= ECF_RETURNS_TWICE
;
814 /* Process the pure and const attributes. */
815 if (TREE_READONLY (exp
))
817 if (DECL_PURE_P (exp
))
819 if (DECL_LOOPING_CONST_OR_PURE_P (exp
))
820 flags
|= ECF_LOOPING_CONST_OR_PURE
;
822 if (DECL_IS_NOVOPS (exp
))
824 if (lookup_attribute ("leaf", DECL_ATTRIBUTES (exp
)))
826 if (lookup_attribute ("cold", DECL_ATTRIBUTES (exp
)))
829 if (TREE_NOTHROW (exp
))
830 flags
|= ECF_NOTHROW
;
834 if (is_tm_builtin (exp
))
835 flags
|= ECF_TM_BUILTIN
;
836 else if ((flags
& (ECF_CONST
|ECF_NOVOPS
)) != 0
837 || lookup_attribute ("transaction_pure",
838 TYPE_ATTRIBUTES (TREE_TYPE (exp
))))
839 flags
|= ECF_TM_PURE
;
842 flags
= special_function_p (exp
, flags
);
844 else if (TYPE_P (exp
))
846 if (TYPE_READONLY (exp
))
850 && ((flags
& ECF_CONST
) != 0
851 || lookup_attribute ("transaction_pure", TYPE_ATTRIBUTES (exp
))))
852 flags
|= ECF_TM_PURE
;
857 if (TREE_THIS_VOLATILE (exp
))
859 flags
|= ECF_NORETURN
;
860 if (flags
& (ECF_CONST
|ECF_PURE
))
861 flags
|= ECF_LOOPING_CONST_OR_PURE
;
867 /* Detect flags from a CALL_EXPR. */
870 call_expr_flags (const_tree t
)
873 tree decl
= get_callee_fndecl (t
);
876 flags
= flags_from_decl_or_type (decl
);
877 else if (CALL_EXPR_FN (t
) == NULL_TREE
)
878 flags
= internal_fn_flags (CALL_EXPR_IFN (t
));
881 tree type
= TREE_TYPE (CALL_EXPR_FN (t
));
882 if (type
&& TREE_CODE (type
) == POINTER_TYPE
)
883 flags
= flags_from_decl_or_type (TREE_TYPE (type
));
886 if (CALL_EXPR_BY_DESCRIPTOR (t
))
887 flags
|= ECF_BY_DESCRIPTOR
;
893 /* Return true if TYPE should be passed by invisible reference. */
896 pass_by_reference (CUMULATIVE_ARGS
*ca
, machine_mode mode
,
897 tree type
, bool named_arg
)
901 /* If this type contains non-trivial constructors, then it is
902 forbidden for the middle-end to create any new copies. */
903 if (TREE_ADDRESSABLE (type
))
906 /* GCC post 3.4 passes *all* variable sized types by reference. */
907 if (!TYPE_SIZE (type
) || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
910 /* If a record type should be passed the same as its first (and only)
911 member, use the type and mode of that member. */
912 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
914 type
= TREE_TYPE (first_field (type
));
915 mode
= TYPE_MODE (type
);
919 return targetm
.calls
.pass_by_reference (pack_cumulative_args (ca
), mode
,
923 /* Return true if TYPE, which is passed by reference, should be callee
924 copied instead of caller copied. */
927 reference_callee_copied (CUMULATIVE_ARGS
*ca
, machine_mode mode
,
928 tree type
, bool named_arg
)
930 if (type
&& TREE_ADDRESSABLE (type
))
932 return targetm
.calls
.callee_copies (pack_cumulative_args (ca
), mode
, type
,
937 /* Precompute all register parameters as described by ARGS, storing values
938 into fields within the ARGS array.
940 NUM_ACTUALS indicates the total number elements in the ARGS array.
942 Set REG_PARM_SEEN if we encounter a register parameter. */
945 precompute_register_parameters (int num_actuals
, struct arg_data
*args
,
952 for (i
= 0; i
< num_actuals
; i
++)
953 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
)
957 if (args
[i
].value
== 0)
960 args
[i
].value
= expand_normal (args
[i
].tree_value
);
961 preserve_temp_slots (args
[i
].value
);
965 /* If we are to promote the function arg to a wider mode,
968 if (args
[i
].mode
!= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)))
970 = convert_modes (args
[i
].mode
,
971 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
972 args
[i
].value
, args
[i
].unsignedp
);
974 /* If the value is a non-legitimate constant, force it into a
975 pseudo now. TLS symbols sometimes need a call to resolve. */
976 if (CONSTANT_P (args
[i
].value
)
977 && !targetm
.legitimate_constant_p (args
[i
].mode
, args
[i
].value
))
978 args
[i
].value
= force_reg (args
[i
].mode
, args
[i
].value
);
980 /* If we're going to have to load the value by parts, pull the
981 parts into pseudos. The part extraction process can involve
982 non-trivial computation. */
983 if (GET_CODE (args
[i
].reg
) == PARALLEL
)
985 tree type
= TREE_TYPE (args
[i
].tree_value
);
986 args
[i
].parallel_value
987 = emit_group_load_into_temps (args
[i
].reg
, args
[i
].value
,
988 type
, int_size_in_bytes (type
));
991 /* If the value is expensive, and we are inside an appropriately
992 short loop, put the value into a pseudo and then put the pseudo
995 For small register classes, also do this if this call uses
996 register parameters. This is to avoid reload conflicts while
997 loading the parameters registers. */
999 else if ((! (REG_P (args
[i
].value
)
1000 || (GET_CODE (args
[i
].value
) == SUBREG
1001 && REG_P (SUBREG_REG (args
[i
].value
)))))
1002 && args
[i
].mode
!= BLKmode
1003 && (set_src_cost (args
[i
].value
, args
[i
].mode
,
1004 optimize_insn_for_speed_p ())
1005 > COSTS_N_INSNS (1))
1007 && targetm
.small_register_classes_for_mode_p (args
[i
].mode
))
1009 args
[i
].value
= copy_to_mode_reg (args
[i
].mode
, args
[i
].value
);
1013 #ifdef REG_PARM_STACK_SPACE
1015 /* The argument list is the property of the called routine and it
1016 may clobber it. If the fixed area has been used for previous
1017 parameters, we must save and restore it. */
1020 save_fixed_argument_area (int reg_parm_stack_space
, rtx argblock
, int *low_to_save
, int *high_to_save
)
1025 /* Compute the boundary of the area that needs to be saved, if any. */
1026 high
= reg_parm_stack_space
;
1027 if (ARGS_GROW_DOWNWARD
)
1030 if (high
> highest_outgoing_arg_in_use
)
1031 high
= highest_outgoing_arg_in_use
;
1033 for (low
= 0; low
< high
; low
++)
1034 if (stack_usage_map
[low
] != 0)
1037 machine_mode save_mode
;
1043 while (stack_usage_map
[--high
] == 0)
1047 *high_to_save
= high
;
1049 num_to_save
= high
- low
+ 1;
1051 /* If we don't have the required alignment, must do this
1053 scalar_int_mode imode
;
1054 if (int_mode_for_size (num_to_save
* BITS_PER_UNIT
, 1).exists (&imode
)
1055 && (low
& (MIN (GET_MODE_SIZE (imode
),
1056 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)) == 0)
1059 save_mode
= BLKmode
;
1061 if (ARGS_GROW_DOWNWARD
)
1066 addr
= plus_constant (Pmode
, argblock
, delta
);
1067 stack_area
= gen_rtx_MEM (save_mode
, memory_address (save_mode
, addr
));
1069 set_mem_align (stack_area
, PARM_BOUNDARY
);
1070 if (save_mode
== BLKmode
)
1072 save_area
= assign_stack_temp (BLKmode
, num_to_save
);
1073 emit_block_move (validize_mem (save_area
), stack_area
,
1074 GEN_INT (num_to_save
), BLOCK_OP_CALL_PARM
);
1078 save_area
= gen_reg_rtx (save_mode
);
1079 emit_move_insn (save_area
, stack_area
);
1089 restore_fixed_argument_area (rtx save_area
, rtx argblock
, int high_to_save
, int low_to_save
)
1091 machine_mode save_mode
= GET_MODE (save_area
);
1093 rtx addr
, stack_area
;
1095 if (ARGS_GROW_DOWNWARD
)
1096 delta
= -high_to_save
;
1098 delta
= low_to_save
;
1100 addr
= plus_constant (Pmode
, argblock
, delta
);
1101 stack_area
= gen_rtx_MEM (save_mode
, memory_address (save_mode
, addr
));
1102 set_mem_align (stack_area
, PARM_BOUNDARY
);
1104 if (save_mode
!= BLKmode
)
1105 emit_move_insn (stack_area
, save_area
);
1107 emit_block_move (stack_area
, validize_mem (save_area
),
1108 GEN_INT (high_to_save
- low_to_save
+ 1),
1109 BLOCK_OP_CALL_PARM
);
1111 #endif /* REG_PARM_STACK_SPACE */
1113 /* If any elements in ARGS refer to parameters that are to be passed in
1114 registers, but not in memory, and whose alignment does not permit a
1115 direct copy into registers. Copy the values into a group of pseudos
1116 which we will later copy into the appropriate hard registers.
1118 Pseudos for each unaligned argument will be stored into the array
1119 args[argnum].aligned_regs. The caller is responsible for deallocating
1120 the aligned_regs array if it is nonzero. */
1123 store_unaligned_arguments_into_pseudos (struct arg_data
*args
, int num_actuals
)
1127 for (i
= 0; i
< num_actuals
; i
++)
1128 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
1129 && GET_CODE (args
[i
].reg
) != PARALLEL
1130 && args
[i
].mode
== BLKmode
1131 && MEM_P (args
[i
].value
)
1132 && (MEM_ALIGN (args
[i
].value
)
1133 < (unsigned int) MIN (BIGGEST_ALIGNMENT
, BITS_PER_WORD
)))
1135 int bytes
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1136 int endian_correction
= 0;
1138 if (args
[i
].partial
)
1140 gcc_assert (args
[i
].partial
% UNITS_PER_WORD
== 0);
1141 args
[i
].n_aligned_regs
= args
[i
].partial
/ UNITS_PER_WORD
;
1145 args
[i
].n_aligned_regs
1146 = (bytes
+ UNITS_PER_WORD
- 1) / UNITS_PER_WORD
;
1149 args
[i
].aligned_regs
= XNEWVEC (rtx
, args
[i
].n_aligned_regs
);
1151 /* Structures smaller than a word are normally aligned to the
1152 least significant byte. On a BYTES_BIG_ENDIAN machine,
1153 this means we must skip the empty high order bytes when
1154 calculating the bit offset. */
1155 if (bytes
< UNITS_PER_WORD
1156 #ifdef BLOCK_REG_PADDING
1157 && (BLOCK_REG_PADDING (args
[i
].mode
,
1158 TREE_TYPE (args
[i
].tree_value
), 1)
1164 endian_correction
= BITS_PER_WORD
- bytes
* BITS_PER_UNIT
;
1166 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1168 rtx reg
= gen_reg_rtx (word_mode
);
1169 rtx word
= operand_subword_force (args
[i
].value
, j
, BLKmode
);
1170 int bitsize
= MIN (bytes
* BITS_PER_UNIT
, BITS_PER_WORD
);
1172 args
[i
].aligned_regs
[j
] = reg
;
1173 word
= extract_bit_field (word
, bitsize
, 0, 1, NULL_RTX
,
1174 word_mode
, word_mode
, false, NULL
);
1176 /* There is no need to restrict this code to loading items
1177 in TYPE_ALIGN sized hunks. The bitfield instructions can
1178 load up entire word sized registers efficiently.
1180 ??? This may not be needed anymore.
1181 We use to emit a clobber here but that doesn't let later
1182 passes optimize the instructions we emit. By storing 0 into
1183 the register later passes know the first AND to zero out the
1184 bitfield being set in the register is unnecessary. The store
1185 of 0 will be deleted as will at least the first AND. */
1187 emit_move_insn (reg
, const0_rtx
);
1189 bytes
-= bitsize
/ BITS_PER_UNIT
;
1190 store_bit_field (reg
, bitsize
, endian_correction
, 0, 0,
1191 word_mode
, word
, false);
1196 /* The limit set by -Walloc-larger-than=. */
1197 static GTY(()) tree alloc_object_size_limit
;
1199 /* Initialize ALLOC_OBJECT_SIZE_LIMIT based on the -Walloc-size-larger-than=
1200 setting if the option is specified, or to the maximum object size if it
1201 is not. Return the initialized value. */
1204 alloc_max_size (void)
1206 if (!alloc_object_size_limit
)
1208 alloc_object_size_limit
= TYPE_MAX_VALUE (ssizetype
);
1210 if (warn_alloc_size_limit
)
1214 unsigned HOST_WIDE_INT unit
= 1;
1215 unsigned HOST_WIDE_INT limit
1216 = strtoull (warn_alloc_size_limit
, &end
, 10);
1222 /* Numeric option arguments are at most INT_MAX. Make it
1223 possible to specify a larger value by accepting common
1225 if (!strcmp (end
, "kB"))
1227 else if (!strcasecmp (end
, "KiB") || strcmp (end
, "KB"))
1229 else if (!strcmp (end
, "MB"))
1230 unit
= HOST_WIDE_INT_UC (1000) * 1000;
1231 else if (!strcasecmp (end
, "MiB"))
1232 unit
= HOST_WIDE_INT_UC (1024) * 1024;
1233 else if (!strcasecmp (end
, "GB"))
1234 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000;
1235 else if (!strcasecmp (end
, "GiB"))
1236 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024;
1237 else if (!strcasecmp (end
, "TB"))
1238 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000 * 1000;
1239 else if (!strcasecmp (end
, "TiB"))
1240 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024 * 1024;
1241 else if (!strcasecmp (end
, "PB"))
1242 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000 * 1000 * 1000;
1243 else if (!strcasecmp (end
, "PiB"))
1244 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024 * 1024 * 1024;
1245 else if (!strcasecmp (end
, "EB"))
1246 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000 * 1000 * 1000
1248 else if (!strcasecmp (end
, "EiB"))
1249 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024 * 1024 * 1024
1257 wide_int w
= wi::uhwi (limit
, HOST_BITS_PER_WIDE_INT
+ 64);
1259 if (wi::ltu_p (w
, alloc_object_size_limit
))
1260 alloc_object_size_limit
= wide_int_to_tree (ssizetype
, w
);
1265 return alloc_object_size_limit
;
1268 /* Return true when EXP's range can be determined and set RANGE[] to it
1269 after adjusting it if necessary to make EXP a valid size argument to
1270 an allocation function declared with attribute alloc_size (whose
1271 argument may be signed), or to a string manipulation function like
1275 get_size_range (tree exp
, tree range
[2])
1277 if (tree_fits_uhwi_p (exp
))
1279 /* EXP is a constant. */
1280 range
[0] = range
[1] = exp
;
1285 enum value_range_type range_type
1286 = ((TREE_CODE (exp
) == SSA_NAME
&& INTEGRAL_TYPE_P (TREE_TYPE (exp
)))
1287 ? get_range_info (exp
, &min
, &max
) : VR_VARYING
);
1289 if (range_type
== VR_VARYING
)
1291 /* No range information available. */
1292 range
[0] = NULL_TREE
;
1293 range
[1] = NULL_TREE
;
1297 tree exptype
= TREE_TYPE (exp
);
1298 unsigned expprec
= TYPE_PRECISION (exptype
);
1299 wide_int wzero
= wi::zero (expprec
);
1300 wide_int wmaxval
= wide_int (TYPE_MAX_VALUE (exptype
));
1302 bool signed_p
= !TYPE_UNSIGNED (exptype
);
1304 if (range_type
== VR_ANTI_RANGE
)
1308 if (wi::les_p (max
, wzero
))
1310 /* EXP is not in a strictly negative range. That means
1311 it must be in some (not necessarily strictly) positive
1312 range which includes zero. Since in signed to unsigned
1313 conversions negative values end up converted to large
1314 positive values, and otherwise they are not valid sizes,
1315 the resulting range is in both cases [0, TYPE_MAX]. */
1319 else if (wi::les_p (min
- 1, wzero
))
1321 /* EXP is not in a negative-positive range. That means EXP
1322 is either negative, or greater than max. Since negative
1323 sizes are invalid make the range [MAX + 1, TYPE_MAX]. */
1333 else if (wi::eq_p (wzero
, min
- 1))
1335 /* EXP is unsigned and not in the range [1, MAX]. That means
1336 it's either zero or greater than MAX. Even though 0 would
1337 normally be detected by -Walloc-zero set the range to
1338 [MAX, TYPE_MAX] so that when MAX is greater than the limit
1339 the whole range is diagnosed. */
1350 range
[0] = wide_int_to_tree (exptype
, min
);
1351 range
[1] = wide_int_to_tree (exptype
, max
);
1356 /* Diagnose a call EXP to function FN decorated with attribute alloc_size
1357 whose argument numbers given by IDX with values given by ARGS exceed
1358 the maximum object size or cause an unsigned oveflow (wrapping) when
1359 multiplied. When ARGS[0] is null the function does nothing. ARGS[1]
1360 may be null for functions like malloc, and non-null for those like
1361 calloc that are decorated with a two-argument attribute alloc_size. */
1364 maybe_warn_alloc_args_overflow (tree fn
, tree exp
, tree args
[2], int idx
[2])
1366 /* The range each of the (up to) two arguments is known to be in. */
1367 tree argrange
[2][2] = { { NULL_TREE
, NULL_TREE
}, { NULL_TREE
, NULL_TREE
} };
1369 /* Maximum object size set by -Walloc-size-larger-than= or SIZE_MAX / 2. */
1370 tree maxobjsize
= alloc_max_size ();
1372 location_t loc
= EXPR_LOCATION (exp
);
1374 bool warned
= false;
1376 /* Validate each argument individually. */
1377 for (unsigned i
= 0; i
!= 2 && args
[i
]; ++i
)
1379 if (TREE_CODE (args
[i
]) == INTEGER_CST
)
1381 argrange
[i
][0] = args
[i
];
1382 argrange
[i
][1] = args
[i
];
1384 if (tree_int_cst_lt (args
[i
], integer_zero_node
))
1386 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1387 "%Kargument %i value %qE is negative",
1388 exp
, idx
[i
] + 1, args
[i
]);
1390 else if (integer_zerop (args
[i
]))
1392 /* Avoid issuing -Walloc-zero for allocation functions other
1393 than __builtin_alloca that are declared with attribute
1394 returns_nonnull because there's no portability risk. This
1395 avoids warning for such calls to libiberty's xmalloc and
1397 Also avoid issuing the warning for calls to function named
1399 if ((DECL_FUNCTION_CODE (fn
) == BUILT_IN_ALLOCA
1400 && IDENTIFIER_LENGTH (DECL_NAME (fn
)) != 6)
1401 || (DECL_FUNCTION_CODE (fn
) != BUILT_IN_ALLOCA
1402 && !lookup_attribute ("returns_nonnull",
1403 TYPE_ATTRIBUTES (TREE_TYPE (fn
)))))
1404 warned
= warning_at (loc
, OPT_Walloc_zero
,
1405 "%Kargument %i value is zero",
1408 else if (tree_int_cst_lt (maxobjsize
, args
[i
]))
1410 /* G++ emits calls to ::operator new[](SIZE_MAX) in C++98
1411 mode and with -fno-exceptions as a way to indicate array
1412 size overflow. There's no good way to detect C++98 here
1413 so avoid diagnosing these calls for all C++ modes. */
1417 && DECL_IS_OPERATOR_NEW (fn
)
1418 && integer_all_onesp (args
[i
]))
1421 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1422 "%Kargument %i value %qE exceeds "
1423 "maximum object size %E",
1424 exp
, idx
[i
] + 1, args
[i
], maxobjsize
);
1427 else if (TREE_CODE (args
[i
]) == SSA_NAME
1428 && get_size_range (args
[i
], argrange
[i
]))
1430 /* Verify that the argument's range is not negative (including
1431 upper bound of zero). */
1432 if (tree_int_cst_lt (argrange
[i
][0], integer_zero_node
)
1433 && tree_int_cst_le (argrange
[i
][1], integer_zero_node
))
1435 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1436 "%Kargument %i range [%E, %E] is negative",
1438 argrange
[i
][0], argrange
[i
][1]);
1440 else if (tree_int_cst_lt (maxobjsize
, argrange
[i
][0]))
1442 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1443 "%Kargument %i range [%E, %E] exceeds "
1444 "maximum object size %E",
1446 argrange
[i
][0], argrange
[i
][1],
1455 /* For a two-argument alloc_size, validate the product of the two
1456 arguments if both of their values or ranges are known. */
1457 if (!warned
&& tree_fits_uhwi_p (argrange
[0][0])
1458 && argrange
[1][0] && tree_fits_uhwi_p (argrange
[1][0])
1459 && !integer_onep (argrange
[0][0])
1460 && !integer_onep (argrange
[1][0]))
1462 /* Check for overflow in the product of a function decorated with
1463 attribute alloc_size (X, Y). */
1464 unsigned szprec
= TYPE_PRECISION (size_type_node
);
1465 wide_int x
= wi::to_wide (argrange
[0][0], szprec
);
1466 wide_int y
= wi::to_wide (argrange
[1][0], szprec
);
1469 wide_int prod
= wi::umul (x
, y
, &vflow
);
1472 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1473 "%Kproduct %<%E * %E%> of arguments %i and %i "
1474 "exceeds %<SIZE_MAX%>",
1475 exp
, argrange
[0][0], argrange
[1][0],
1476 idx
[0] + 1, idx
[1] + 1);
1477 else if (wi::ltu_p (wi::to_wide (maxobjsize
, szprec
), prod
))
1478 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1479 "%Kproduct %<%E * %E%> of arguments %i and %i "
1480 "exceeds maximum object size %E",
1481 exp
, argrange
[0][0], argrange
[1][0],
1482 idx
[0] + 1, idx
[1] + 1,
1487 /* Print the full range of each of the two arguments to make
1488 it clear when it is, in fact, in a range and not constant. */
1489 if (argrange
[0][0] != argrange
[0][1])
1490 inform (loc
, "argument %i in the range [%E, %E]",
1491 idx
[0] + 1, argrange
[0][0], argrange
[0][1]);
1492 if (argrange
[1][0] != argrange
[1][1])
1493 inform (loc
, "argument %i in the range [%E, %E]",
1494 idx
[1] + 1, argrange
[1][0], argrange
[1][1]);
1500 location_t fnloc
= DECL_SOURCE_LOCATION (fn
);
1502 if (DECL_IS_BUILTIN (fn
))
1504 "in a call to built-in allocation function %qD", fn
);
1507 "in a call to allocation function %qD declared here", fn
);
1511 /* Issue an error if CALL_EXPR was flagged as requiring
1512 tall-call optimization. */
1515 maybe_complain_about_tail_call (tree call_expr
, const char *reason
)
1517 gcc_assert (TREE_CODE (call_expr
) == CALL_EXPR
);
1518 if (!CALL_EXPR_MUST_TAIL_CALL (call_expr
))
1521 error_at (EXPR_LOCATION (call_expr
), "cannot tail-call: %s", reason
);
1524 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1527 NUM_ACTUALS is the total number of parameters.
1529 N_NAMED_ARGS is the total number of named arguments.
1531 STRUCT_VALUE_ADDR_VALUE is the implicit argument for a struct return
1534 FNDECL is the tree code for the target of this call (if known)
1536 ARGS_SO_FAR holds state needed by the target to know where to place
1539 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1540 for arguments which are passed in registers.
1542 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1543 and may be modified by this routine.
1545 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1546 flags which may be modified by this routine.
1548 MAY_TAILCALL is cleared if we encounter an invisible pass-by-reference
1549 that requires allocation of stack space.
1551 CALL_FROM_THUNK_P is true if this call is the jump from a thunk to
1552 the thunked-to function. */
1555 initialize_argument_information (int num_actuals ATTRIBUTE_UNUSED
,
1556 struct arg_data
*args
,
1557 struct args_size
*args_size
,
1558 int n_named_args ATTRIBUTE_UNUSED
,
1559 tree exp
, tree struct_value_addr_value
,
1560 tree fndecl
, tree fntype
,
1561 cumulative_args_t args_so_far
,
1562 int reg_parm_stack_space
,
1563 rtx
*old_stack_level
, int *old_pending_adj
,
1564 int *must_preallocate
, int *ecf_flags
,
1565 bool *may_tailcall
, bool call_from_thunk_p
)
1567 CUMULATIVE_ARGS
*args_so_far_pnt
= get_cumulative_args (args_so_far
);
1568 location_t loc
= EXPR_LOCATION (exp
);
1570 /* Count arg position in order args appear. */
1575 args_size
->constant
= 0;
1578 bitmap_obstack_initialize (NULL
);
1580 /* In this loop, we consider args in the order they are written.
1581 We fill up ARGS from the back. */
1583 i
= num_actuals
- 1;
1585 int j
= i
, ptr_arg
= -1;
1586 call_expr_arg_iterator iter
;
1588 bitmap slots
= NULL
;
1590 if (struct_value_addr_value
)
1592 args
[j
].tree_value
= struct_value_addr_value
;
1595 /* If we pass structure address then we need to
1596 create bounds for it. Since created bounds is
1597 a call statement, we expand it right here to avoid
1598 fixing all other places where it may be expanded. */
1599 if (CALL_WITH_BOUNDS_P (exp
))
1601 args
[j
].value
= gen_reg_rtx (targetm
.chkp_bound_mode ());
1603 = chkp_make_bounds_for_struct_addr (struct_value_addr_value
);
1604 expand_expr_real (args
[j
].tree_value
, args
[j
].value
, VOIDmode
,
1605 EXPAND_NORMAL
, 0, false);
1606 args
[j
].pointer_arg
= j
+ 1;
1611 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
1613 tree argtype
= TREE_TYPE (arg
);
1615 /* Remember last param with pointer and associate it
1616 with following pointer bounds. */
1617 if (CALL_WITH_BOUNDS_P (exp
)
1618 && chkp_type_has_pointer (argtype
))
1621 BITMAP_FREE (slots
);
1623 if (!BOUNDED_TYPE_P (argtype
))
1625 slots
= BITMAP_ALLOC (NULL
);
1626 chkp_find_bound_slots (argtype
, slots
);
1629 else if (CALL_WITH_BOUNDS_P (exp
)
1630 && pass_by_reference (NULL
, TYPE_MODE (argtype
), argtype
,
1631 argpos
< n_named_args
))
1634 BITMAP_FREE (slots
);
1637 else if (POINTER_BOUNDS_TYPE_P (argtype
))
1639 /* We expect bounds in instrumented calls only.
1640 Otherwise it is a sign we lost flag due to some optimization
1641 and may emit call args incorrectly. */
1642 gcc_assert (CALL_WITH_BOUNDS_P (exp
));
1644 /* For structures look for the next available pointer. */
1645 if (ptr_arg
!= -1 && slots
)
1647 unsigned bnd_no
= bitmap_first_set_bit (slots
);
1648 args
[j
].pointer_offset
=
1649 bnd_no
* POINTER_SIZE
/ BITS_PER_UNIT
;
1651 bitmap_clear_bit (slots
, bnd_no
);
1653 /* Check we have no more pointers in the structure. */
1654 if (bitmap_empty_p (slots
))
1655 BITMAP_FREE (slots
);
1657 args
[j
].pointer_arg
= ptr_arg
;
1659 /* Check we covered all pointers in the previous
1667 if (targetm
.calls
.split_complex_arg
1669 && TREE_CODE (argtype
) == COMPLEX_TYPE
1670 && targetm
.calls
.split_complex_arg (argtype
))
1672 tree subtype
= TREE_TYPE (argtype
);
1673 args
[j
].tree_value
= build1 (REALPART_EXPR
, subtype
, arg
);
1675 args
[j
].tree_value
= build1 (IMAGPART_EXPR
, subtype
, arg
);
1678 args
[j
].tree_value
= arg
;
1684 BITMAP_FREE (slots
);
1687 bitmap_obstack_release (NULL
);
1689 /* Extract attribute alloc_size and if set, store the indices of
1690 the corresponding arguments in ALLOC_IDX, and then the actual
1691 argument(s) at those indices in ALLOC_ARGS. */
1692 int alloc_idx
[2] = { -1, -1 };
1694 = (fndecl
? lookup_attribute ("alloc_size",
1695 TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)))
1698 tree args
= TREE_VALUE (alloc_size
);
1699 alloc_idx
[0] = TREE_INT_CST_LOW (TREE_VALUE (args
)) - 1;
1700 if (TREE_CHAIN (args
))
1701 alloc_idx
[1] = TREE_INT_CST_LOW (TREE_VALUE (TREE_CHAIN (args
))) - 1;
1704 /* Array for up to the two attribute alloc_size arguments. */
1705 tree alloc_args
[] = { NULL_TREE
, NULL_TREE
};
1707 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1708 for (argpos
= 0; argpos
< num_actuals
; i
--, argpos
++)
1710 tree type
= TREE_TYPE (args
[i
].tree_value
);
1714 /* Replace erroneous argument with constant zero. */
1715 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
1716 args
[i
].tree_value
= integer_zero_node
, type
= integer_type_node
;
1718 /* If TYPE is a transparent union or record, pass things the way
1719 we would pass the first field of the union or record. We have
1720 already verified that the modes are the same. */
1721 if ((TREE_CODE (type
) == UNION_TYPE
|| TREE_CODE (type
) == RECORD_TYPE
)
1722 && TYPE_TRANSPARENT_AGGR (type
))
1723 type
= TREE_TYPE (first_field (type
));
1725 /* Decide where to pass this arg.
1727 args[i].reg is nonzero if all or part is passed in registers.
1729 args[i].partial is nonzero if part but not all is passed in registers,
1730 and the exact value says how many bytes are passed in registers.
1732 args[i].pass_on_stack is nonzero if the argument must at least be
1733 computed on the stack. It may then be loaded back into registers
1734 if args[i].reg is nonzero.
1736 These decisions are driven by the FUNCTION_... macros and must agree
1737 with those made by function.c. */
1739 /* See if this argument should be passed by invisible reference. */
1740 if (pass_by_reference (args_so_far_pnt
, TYPE_MODE (type
),
1741 type
, argpos
< n_named_args
))
1744 tree base
= NULL_TREE
;
1747 = reference_callee_copied (args_so_far_pnt
, TYPE_MODE (type
),
1748 type
, argpos
< n_named_args
);
1750 /* If we're compiling a thunk, pass through invisible references
1751 instead of making a copy. */
1752 if (call_from_thunk_p
1754 && !TREE_ADDRESSABLE (type
)
1755 && (base
= get_base_address (args
[i
].tree_value
))
1756 && TREE_CODE (base
) != SSA_NAME
1757 && (!DECL_P (base
) || MEM_P (DECL_RTL (base
)))))
1759 /* We may have turned the parameter value into an SSA name.
1760 Go back to the original parameter so we can take the
1762 if (TREE_CODE (args
[i
].tree_value
) == SSA_NAME
)
1764 gcc_assert (SSA_NAME_IS_DEFAULT_DEF (args
[i
].tree_value
));
1765 args
[i
].tree_value
= SSA_NAME_VAR (args
[i
].tree_value
);
1766 gcc_assert (TREE_CODE (args
[i
].tree_value
) == PARM_DECL
);
1768 /* Argument setup code may have copied the value to register. We
1769 revert that optimization now because the tail call code must
1770 use the original location. */
1771 if (TREE_CODE (args
[i
].tree_value
) == PARM_DECL
1772 && !MEM_P (DECL_RTL (args
[i
].tree_value
))
1773 && DECL_INCOMING_RTL (args
[i
].tree_value
)
1774 && MEM_P (DECL_INCOMING_RTL (args
[i
].tree_value
)))
1775 set_decl_rtl (args
[i
].tree_value
,
1776 DECL_INCOMING_RTL (args
[i
].tree_value
));
1778 mark_addressable (args
[i
].tree_value
);
1780 /* We can't use sibcalls if a callee-copied argument is
1781 stored in the current function's frame. */
1782 if (!call_from_thunk_p
&& DECL_P (base
) && !TREE_STATIC (base
))
1784 *may_tailcall
= false;
1785 maybe_complain_about_tail_call (exp
,
1786 "a callee-copied argument is"
1787 " stored in the current "
1788 " function's frame");
1791 args
[i
].tree_value
= build_fold_addr_expr_loc (loc
,
1792 args
[i
].tree_value
);
1793 type
= TREE_TYPE (args
[i
].tree_value
);
1795 if (*ecf_flags
& ECF_CONST
)
1796 *ecf_flags
&= ~(ECF_CONST
| ECF_LOOPING_CONST_OR_PURE
);
1800 /* We make a copy of the object and pass the address to the
1801 function being called. */
1804 if (!COMPLETE_TYPE_P (type
)
1805 || TREE_CODE (TYPE_SIZE_UNIT (type
)) != INTEGER_CST
1806 || (flag_stack_check
== GENERIC_STACK_CHECK
1807 && compare_tree_int (TYPE_SIZE_UNIT (type
),
1808 STACK_CHECK_MAX_VAR_SIZE
) > 0))
1810 /* This is a variable-sized object. Make space on the stack
1812 rtx size_rtx
= expr_size (args
[i
].tree_value
);
1814 if (*old_stack_level
== 0)
1816 emit_stack_save (SAVE_BLOCK
, old_stack_level
);
1817 *old_pending_adj
= pending_stack_adjust
;
1818 pending_stack_adjust
= 0;
1821 /* We can pass TRUE as the 4th argument because we just
1822 saved the stack pointer and will restore it right after
1824 copy
= allocate_dynamic_stack_space (size_rtx
,
1828 copy
= gen_rtx_MEM (BLKmode
, copy
);
1829 set_mem_attributes (copy
, type
, 1);
1832 copy
= assign_temp (type
, 1, 0);
1834 store_expr (args
[i
].tree_value
, copy
, 0, false, false);
1836 /* Just change the const function to pure and then let
1837 the next test clear the pure based on
1839 if (*ecf_flags
& ECF_CONST
)
1841 *ecf_flags
&= ~ECF_CONST
;
1842 *ecf_flags
|= ECF_PURE
;
1845 if (!callee_copies
&& *ecf_flags
& ECF_PURE
)
1846 *ecf_flags
&= ~(ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
1849 = build_fold_addr_expr_loc (loc
, make_tree (type
, copy
));
1850 type
= TREE_TYPE (args
[i
].tree_value
);
1851 *may_tailcall
= false;
1852 maybe_complain_about_tail_call (exp
,
1853 "argument must be passed"
1858 unsignedp
= TYPE_UNSIGNED (type
);
1859 mode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
1860 fndecl
? TREE_TYPE (fndecl
) : fntype
, 0);
1862 args
[i
].unsignedp
= unsignedp
;
1863 args
[i
].mode
= mode
;
1865 args
[i
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
, type
,
1866 argpos
< n_named_args
);
1868 if (args
[i
].reg
&& CONST_INT_P (args
[i
].reg
))
1870 args
[i
].special_slot
= args
[i
].reg
;
1874 /* If this is a sibling call and the machine has register windows, the
1875 register window has to be unwinded before calling the routine, so
1876 arguments have to go into the incoming registers. */
1877 if (targetm
.calls
.function_incoming_arg
!= targetm
.calls
.function_arg
)
1878 args
[i
].tail_call_reg
1879 = targetm
.calls
.function_incoming_arg (args_so_far
, mode
, type
,
1880 argpos
< n_named_args
);
1882 args
[i
].tail_call_reg
= args
[i
].reg
;
1886 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, type
,
1887 argpos
< n_named_args
);
1889 args
[i
].pass_on_stack
= targetm
.calls
.must_pass_in_stack (mode
, type
);
1891 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1892 it means that we are to pass this arg in the register(s) designated
1893 by the PARALLEL, but also to pass it in the stack. */
1894 if (args
[i
].reg
&& GET_CODE (args
[i
].reg
) == PARALLEL
1895 && XEXP (XVECEXP (args
[i
].reg
, 0, 0), 0) == 0)
1896 args
[i
].pass_on_stack
= 1;
1898 /* If this is an addressable type, we must preallocate the stack
1899 since we must evaluate the object into its final location.
1901 If this is to be passed in both registers and the stack, it is simpler
1903 if (TREE_ADDRESSABLE (type
)
1904 || (args
[i
].pass_on_stack
&& args
[i
].reg
!= 0))
1905 *must_preallocate
= 1;
1907 /* No stack allocation and padding for bounds. */
1908 if (POINTER_BOUNDS_P (args
[i
].tree_value
))
1910 /* Compute the stack-size of this argument. */
1911 else if (args
[i
].reg
== 0 || args
[i
].partial
!= 0
1912 || reg_parm_stack_space
> 0
1913 || args
[i
].pass_on_stack
)
1914 locate_and_pad_parm (mode
, type
,
1915 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1920 reg_parm_stack_space
,
1921 args
[i
].pass_on_stack
? 0 : args
[i
].partial
,
1922 fndecl
, args_size
, &args
[i
].locate
);
1923 #ifdef BLOCK_REG_PADDING
1925 /* The argument is passed entirely in registers. See at which
1926 end it should be padded. */
1927 args
[i
].locate
.where_pad
=
1928 BLOCK_REG_PADDING (mode
, type
,
1929 int_size_in_bytes (type
) <= UNITS_PER_WORD
);
1932 /* Update ARGS_SIZE, the total stack space for args so far. */
1934 args_size
->constant
+= args
[i
].locate
.size
.constant
;
1935 if (args
[i
].locate
.size
.var
)
1936 ADD_PARM_SIZE (*args_size
, args
[i
].locate
.size
.var
);
1938 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1939 have been used, etc. */
1941 targetm
.calls
.function_arg_advance (args_so_far
, TYPE_MODE (type
),
1942 type
, argpos
< n_named_args
);
1944 /* Store argument values for functions decorated with attribute
1946 if (argpos
== alloc_idx
[0])
1947 alloc_args
[0] = args
[i
].tree_value
;
1948 else if (argpos
== alloc_idx
[1])
1949 alloc_args
[1] = args
[i
].tree_value
;
1954 /* Check the arguments of functions decorated with attribute
1956 maybe_warn_alloc_args_overflow (fndecl
, exp
, alloc_args
, alloc_idx
);
1960 /* Update ARGS_SIZE to contain the total size for the argument block.
1961 Return the original constant component of the argument block's size.
1963 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1964 for arguments passed in registers. */
1967 compute_argument_block_size (int reg_parm_stack_space
,
1968 struct args_size
*args_size
,
1969 tree fndecl ATTRIBUTE_UNUSED
,
1970 tree fntype ATTRIBUTE_UNUSED
,
1971 int preferred_stack_boundary ATTRIBUTE_UNUSED
)
1973 int unadjusted_args_size
= args_size
->constant
;
1975 /* For accumulate outgoing args mode we don't need to align, since the frame
1976 will be already aligned. Align to STACK_BOUNDARY in order to prevent
1977 backends from generating misaligned frame sizes. */
1978 if (ACCUMULATE_OUTGOING_ARGS
&& preferred_stack_boundary
> STACK_BOUNDARY
)
1979 preferred_stack_boundary
= STACK_BOUNDARY
;
1981 /* Compute the actual size of the argument block required. The variable
1982 and constant sizes must be combined, the size may have to be rounded,
1983 and there may be a minimum required size. */
1987 args_size
->var
= ARGS_SIZE_TREE (*args_size
);
1988 args_size
->constant
= 0;
1990 preferred_stack_boundary
/= BITS_PER_UNIT
;
1991 if (preferred_stack_boundary
> 1)
1993 /* We don't handle this case yet. To handle it correctly we have
1994 to add the delta, round and subtract the delta.
1995 Currently no machine description requires this support. */
1996 gcc_assert (!(stack_pointer_delta
& (preferred_stack_boundary
- 1)));
1997 args_size
->var
= round_up (args_size
->var
, preferred_stack_boundary
);
2000 if (reg_parm_stack_space
> 0)
2003 = size_binop (MAX_EXPR
, args_size
->var
,
2004 ssize_int (reg_parm_stack_space
));
2006 /* The area corresponding to register parameters is not to count in
2007 the size of the block we need. So make the adjustment. */
2008 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
2010 = size_binop (MINUS_EXPR
, args_size
->var
,
2011 ssize_int (reg_parm_stack_space
));
2016 preferred_stack_boundary
/= BITS_PER_UNIT
;
2017 if (preferred_stack_boundary
< 1)
2018 preferred_stack_boundary
= 1;
2019 args_size
->constant
= (((args_size
->constant
2020 + stack_pointer_delta
2021 + preferred_stack_boundary
- 1)
2022 / preferred_stack_boundary
2023 * preferred_stack_boundary
)
2024 - stack_pointer_delta
);
2026 args_size
->constant
= MAX (args_size
->constant
,
2027 reg_parm_stack_space
);
2029 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
2030 args_size
->constant
-= reg_parm_stack_space
;
2032 return unadjusted_args_size
;
2035 /* Precompute parameters as needed for a function call.
2037 FLAGS is mask of ECF_* constants.
2039 NUM_ACTUALS is the number of arguments.
2041 ARGS is an array containing information for each argument; this
2042 routine fills in the INITIAL_VALUE and VALUE fields for each
2043 precomputed argument. */
2046 precompute_arguments (int num_actuals
, struct arg_data
*args
)
2050 /* If this is a libcall, then precompute all arguments so that we do not
2051 get extraneous instructions emitted as part of the libcall sequence. */
2053 /* If we preallocated the stack space, and some arguments must be passed
2054 on the stack, then we must precompute any parameter which contains a
2055 function call which will store arguments on the stack.
2056 Otherwise, evaluating the parameter may clobber previous parameters
2057 which have already been stored into the stack. (we have code to avoid
2058 such case by saving the outgoing stack arguments, but it results in
2060 if (!ACCUMULATE_OUTGOING_ARGS
)
2063 for (i
= 0; i
< num_actuals
; i
++)
2068 if (TREE_CODE (args
[i
].tree_value
) != CALL_EXPR
)
2071 /* If this is an addressable type, we cannot pre-evaluate it. */
2072 type
= TREE_TYPE (args
[i
].tree_value
);
2073 gcc_assert (!TREE_ADDRESSABLE (type
));
2075 args
[i
].initial_value
= args
[i
].value
2076 = expand_normal (args
[i
].tree_value
);
2078 mode
= TYPE_MODE (type
);
2079 if (mode
!= args
[i
].mode
)
2081 int unsignedp
= args
[i
].unsignedp
;
2083 = convert_modes (args
[i
].mode
, mode
,
2084 args
[i
].value
, args
[i
].unsignedp
);
2086 /* CSE will replace this only if it contains args[i].value
2087 pseudo, so convert it down to the declared mode using
2089 if (REG_P (args
[i
].value
)
2090 && GET_MODE_CLASS (args
[i
].mode
) == MODE_INT
2091 && promote_mode (type
, mode
, &unsignedp
) != args
[i
].mode
)
2093 args
[i
].initial_value
2094 = gen_lowpart_SUBREG (mode
, args
[i
].value
);
2095 SUBREG_PROMOTED_VAR_P (args
[i
].initial_value
) = 1;
2096 SUBREG_PROMOTED_SET (args
[i
].initial_value
, args
[i
].unsignedp
);
2102 /* Given the current state of MUST_PREALLOCATE and information about
2103 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
2104 compute and return the final value for MUST_PREALLOCATE. */
2107 finalize_must_preallocate (int must_preallocate
, int num_actuals
,
2108 struct arg_data
*args
, struct args_size
*args_size
)
2110 /* See if we have or want to preallocate stack space.
2112 If we would have to push a partially-in-regs parm
2113 before other stack parms, preallocate stack space instead.
2115 If the size of some parm is not a multiple of the required stack
2116 alignment, we must preallocate.
2118 If the total size of arguments that would otherwise create a copy in
2119 a temporary (such as a CALL) is more than half the total argument list
2120 size, preallocation is faster.
2122 Another reason to preallocate is if we have a machine (like the m88k)
2123 where stack alignment is required to be maintained between every
2124 pair of insns, not just when the call is made. However, we assume here
2125 that such machines either do not have push insns (and hence preallocation
2126 would occur anyway) or the problem is taken care of with
2129 if (! must_preallocate
)
2131 int partial_seen
= 0;
2132 int copy_to_evaluate_size
= 0;
2135 for (i
= 0; i
< num_actuals
&& ! must_preallocate
; i
++)
2137 if (args
[i
].partial
> 0 && ! args
[i
].pass_on_stack
)
2139 else if (partial_seen
&& args
[i
].reg
== 0)
2140 must_preallocate
= 1;
2141 /* We preallocate in case there are bounds passed
2142 in the bounds table to have precomputed address
2143 for bounds association. */
2144 else if (POINTER_BOUNDS_P (args
[i
].tree_value
)
2146 must_preallocate
= 1;
2148 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
2149 && (TREE_CODE (args
[i
].tree_value
) == CALL_EXPR
2150 || TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
2151 || TREE_CODE (args
[i
].tree_value
) == COND_EXPR
2152 || TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
))))
2153 copy_to_evaluate_size
2154 += int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
2157 if (copy_to_evaluate_size
* 2 >= args_size
->constant
2158 && args_size
->constant
> 0)
2159 must_preallocate
= 1;
2161 return must_preallocate
;
2164 /* If we preallocated stack space, compute the address of each argument
2165 and store it into the ARGS array.
2167 We need not ensure it is a valid memory address here; it will be
2168 validized when it is used.
2170 ARGBLOCK is an rtx for the address of the outgoing arguments. */
2173 compute_argument_addresses (struct arg_data
*args
, rtx argblock
, int num_actuals
)
2177 rtx arg_reg
= argblock
;
2178 int i
, arg_offset
= 0;
2180 if (GET_CODE (argblock
) == PLUS
)
2181 arg_reg
= XEXP (argblock
, 0), arg_offset
= INTVAL (XEXP (argblock
, 1));
2183 for (i
= 0; i
< num_actuals
; i
++)
2185 rtx offset
= ARGS_SIZE_RTX (args
[i
].locate
.offset
);
2186 rtx slot_offset
= ARGS_SIZE_RTX (args
[i
].locate
.slot_offset
);
2188 unsigned int align
, boundary
;
2189 unsigned int units_on_stack
= 0;
2190 machine_mode partial_mode
= VOIDmode
;
2192 /* Skip this parm if it will not be passed on the stack. */
2193 if (! args
[i
].pass_on_stack
2195 && args
[i
].partial
== 0)
2198 /* Pointer Bounds are never passed on the stack. */
2199 if (POINTER_BOUNDS_P (args
[i
].tree_value
))
2202 if (CONST_INT_P (offset
))
2203 addr
= plus_constant (Pmode
, arg_reg
, INTVAL (offset
));
2205 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, offset
);
2207 addr
= plus_constant (Pmode
, addr
, arg_offset
);
2209 if (args
[i
].partial
!= 0)
2211 /* Only part of the parameter is being passed on the stack.
2212 Generate a simple memory reference of the correct size. */
2213 units_on_stack
= args
[i
].locate
.size
.constant
;
2214 partial_mode
= mode_for_size (units_on_stack
* BITS_PER_UNIT
,
2216 args
[i
].stack
= gen_rtx_MEM (partial_mode
, addr
);
2217 set_mem_size (args
[i
].stack
, units_on_stack
);
2221 args
[i
].stack
= gen_rtx_MEM (args
[i
].mode
, addr
);
2222 set_mem_attributes (args
[i
].stack
,
2223 TREE_TYPE (args
[i
].tree_value
), 1);
2225 align
= BITS_PER_UNIT
;
2226 boundary
= args
[i
].locate
.boundary
;
2227 if (args
[i
].locate
.where_pad
!= downward
)
2229 else if (CONST_INT_P (offset
))
2231 align
= INTVAL (offset
) * BITS_PER_UNIT
| boundary
;
2232 align
= least_bit_hwi (align
);
2234 set_mem_align (args
[i
].stack
, align
);
2236 if (CONST_INT_P (slot_offset
))
2237 addr
= plus_constant (Pmode
, arg_reg
, INTVAL (slot_offset
));
2239 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, slot_offset
);
2241 addr
= plus_constant (Pmode
, addr
, arg_offset
);
2243 if (args
[i
].partial
!= 0)
2245 /* Only part of the parameter is being passed on the stack.
2246 Generate a simple memory reference of the correct size.
2248 args
[i
].stack_slot
= gen_rtx_MEM (partial_mode
, addr
);
2249 set_mem_size (args
[i
].stack_slot
, units_on_stack
);
2253 args
[i
].stack_slot
= gen_rtx_MEM (args
[i
].mode
, addr
);
2254 set_mem_attributes (args
[i
].stack_slot
,
2255 TREE_TYPE (args
[i
].tree_value
), 1);
2257 set_mem_align (args
[i
].stack_slot
, args
[i
].locate
.boundary
);
2259 /* Function incoming arguments may overlap with sibling call
2260 outgoing arguments and we cannot allow reordering of reads
2261 from function arguments with stores to outgoing arguments
2262 of sibling calls. */
2263 set_mem_alias_set (args
[i
].stack
, 0);
2264 set_mem_alias_set (args
[i
].stack_slot
, 0);
2269 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
2270 in a call instruction.
2272 FNDECL is the tree node for the target function. For an indirect call
2273 FNDECL will be NULL_TREE.
2275 ADDR is the operand 0 of CALL_EXPR for this call. */
2278 rtx_for_function_call (tree fndecl
, tree addr
)
2282 /* Get the function to call, in the form of RTL. */
2285 if (!TREE_USED (fndecl
) && fndecl
!= current_function_decl
)
2286 TREE_USED (fndecl
) = 1;
2288 /* Get a SYMBOL_REF rtx for the function address. */
2289 funexp
= XEXP (DECL_RTL (fndecl
), 0);
2292 /* Generate an rtx (probably a pseudo-register) for the address. */
2295 funexp
= expand_normal (addr
);
2296 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
2301 /* Internal state for internal_arg_pointer_based_exp and its helpers. */
2304 /* Last insn that has been scanned by internal_arg_pointer_based_exp_scan,
2305 or NULL_RTX if none has been scanned yet. */
2306 rtx_insn
*scan_start
;
2307 /* Vector indexed by REGNO - FIRST_PSEUDO_REGISTER, recording if a pseudo is
2308 based on crtl->args.internal_arg_pointer. The element is NULL_RTX if the
2309 pseudo isn't based on it, a CONST_INT offset if the pseudo is based on it
2310 with fixed offset, or PC if this is with variable or unknown offset. */
2312 } internal_arg_pointer_exp_state
;
2314 static rtx
internal_arg_pointer_based_exp (const_rtx
, bool);
2316 /* Helper function for internal_arg_pointer_based_exp. Scan insns in
2317 the tail call sequence, starting with first insn that hasn't been
2318 scanned yet, and note for each pseudo on the LHS whether it is based
2319 on crtl->args.internal_arg_pointer or not, and what offset from that
2320 that pointer it has. */
2323 internal_arg_pointer_based_exp_scan (void)
2325 rtx_insn
*insn
, *scan_start
= internal_arg_pointer_exp_state
.scan_start
;
2327 if (scan_start
== NULL_RTX
)
2328 insn
= get_insns ();
2330 insn
= NEXT_INSN (scan_start
);
2334 rtx set
= single_set (insn
);
2335 if (set
&& REG_P (SET_DEST (set
)) && !HARD_REGISTER_P (SET_DEST (set
)))
2338 unsigned int idx
= REGNO (SET_DEST (set
)) - FIRST_PSEUDO_REGISTER
;
2339 /* Punt on pseudos set multiple times. */
2340 if (idx
< internal_arg_pointer_exp_state
.cache
.length ()
2341 && (internal_arg_pointer_exp_state
.cache
[idx
]
2345 val
= internal_arg_pointer_based_exp (SET_SRC (set
), false);
2346 if (val
!= NULL_RTX
)
2348 if (idx
>= internal_arg_pointer_exp_state
.cache
.length ())
2349 internal_arg_pointer_exp_state
.cache
2350 .safe_grow_cleared (idx
+ 1);
2351 internal_arg_pointer_exp_state
.cache
[idx
] = val
;
2354 if (NEXT_INSN (insn
) == NULL_RTX
)
2356 insn
= NEXT_INSN (insn
);
2359 internal_arg_pointer_exp_state
.scan_start
= scan_start
;
2362 /* Compute whether RTL is based on crtl->args.internal_arg_pointer. Return
2363 NULL_RTX if RTL isn't based on it, a CONST_INT offset if RTL is based on
2364 it with fixed offset, or PC if this is with variable or unknown offset.
2365 TOPLEVEL is true if the function is invoked at the topmost level. */
2368 internal_arg_pointer_based_exp (const_rtx rtl
, bool toplevel
)
2370 if (CONSTANT_P (rtl
))
2373 if (rtl
== crtl
->args
.internal_arg_pointer
)
2376 if (REG_P (rtl
) && HARD_REGISTER_P (rtl
))
2379 if (GET_CODE (rtl
) == PLUS
&& CONST_INT_P (XEXP (rtl
, 1)))
2381 rtx val
= internal_arg_pointer_based_exp (XEXP (rtl
, 0), toplevel
);
2382 if (val
== NULL_RTX
|| val
== pc_rtx
)
2384 return plus_constant (Pmode
, val
, INTVAL (XEXP (rtl
, 1)));
2387 /* When called at the topmost level, scan pseudo assignments in between the
2388 last scanned instruction in the tail call sequence and the latest insn
2389 in that sequence. */
2391 internal_arg_pointer_based_exp_scan ();
2395 unsigned int idx
= REGNO (rtl
) - FIRST_PSEUDO_REGISTER
;
2396 if (idx
< internal_arg_pointer_exp_state
.cache
.length ())
2397 return internal_arg_pointer_exp_state
.cache
[idx
];
2402 subrtx_iterator::array_type array
;
2403 FOR_EACH_SUBRTX (iter
, array
, rtl
, NONCONST
)
2405 const_rtx x
= *iter
;
2406 if (REG_P (x
) && internal_arg_pointer_based_exp (x
, false) != NULL_RTX
)
2409 iter
.skip_subrtxes ();
2415 /* Return true if and only if SIZE storage units (usually bytes)
2416 starting from address ADDR overlap with already clobbered argument
2417 area. This function is used to determine if we should give up a
2421 mem_overlaps_already_clobbered_arg_p (rtx addr
, unsigned HOST_WIDE_INT size
)
2426 if (bitmap_empty_p (stored_args_map
))
2428 val
= internal_arg_pointer_based_exp (addr
, true);
2429 if (val
== NULL_RTX
)
2431 else if (val
== pc_rtx
)
2436 if (STACK_GROWS_DOWNWARD
)
2437 i
-= crtl
->args
.pretend_args_size
;
2439 i
+= crtl
->args
.pretend_args_size
;
2442 if (ARGS_GROW_DOWNWARD
)
2447 unsigned HOST_WIDE_INT k
;
2449 for (k
= 0; k
< size
; k
++)
2450 if (i
+ k
< SBITMAP_SIZE (stored_args_map
)
2451 && bitmap_bit_p (stored_args_map
, i
+ k
))
2458 /* Do the register loads required for any wholly-register parms or any
2459 parms which are passed both on the stack and in a register. Their
2460 expressions were already evaluated.
2462 Mark all register-parms as living through the call, putting these USE
2463 insns in the CALL_INSN_FUNCTION_USAGE field.
2465 When IS_SIBCALL, perform the check_sibcall_argument_overlap
2466 checking, setting *SIBCALL_FAILURE if appropriate. */
2469 load_register_parameters (struct arg_data
*args
, int num_actuals
,
2470 rtx
*call_fusage
, int flags
, int is_sibcall
,
2471 int *sibcall_failure
)
2475 for (i
= 0; i
< num_actuals
; i
++)
2477 rtx reg
= ((flags
& ECF_SIBCALL
)
2478 ? args
[i
].tail_call_reg
: args
[i
].reg
);
2481 int partial
= args
[i
].partial
;
2484 rtx_insn
*before_arg
= get_last_insn ();
2485 /* Set non-negative if we must move a word at a time, even if
2486 just one word (e.g, partial == 4 && mode == DFmode). Set
2487 to -1 if we just use a normal move insn. This value can be
2488 zero if the argument is a zero size structure. */
2490 if (GET_CODE (reg
) == PARALLEL
)
2494 gcc_assert (partial
% UNITS_PER_WORD
== 0);
2495 nregs
= partial
/ UNITS_PER_WORD
;
2497 else if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
)
2499 size
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
2500 nregs
= (size
+ (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
2503 size
= GET_MODE_SIZE (args
[i
].mode
);
2505 /* Handle calls that pass values in multiple non-contiguous
2506 locations. The Irix 6 ABI has examples of this. */
2508 if (GET_CODE (reg
) == PARALLEL
)
2509 emit_group_move (reg
, args
[i
].parallel_value
);
2511 /* If simple case, just do move. If normal partial, store_one_arg
2512 has already loaded the register for us. In all other cases,
2513 load the register(s) from memory. */
2515 else if (nregs
== -1)
2517 emit_move_insn (reg
, args
[i
].value
);
2518 #ifdef BLOCK_REG_PADDING
2519 /* Handle case where we have a value that needs shifting
2520 up to the msb. eg. a QImode value and we're padding
2521 upward on a BYTES_BIG_ENDIAN machine. */
2522 if (size
< UNITS_PER_WORD
2523 && (args
[i
].locate
.where_pad
2524 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
2527 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
2529 /* Assigning REG here rather than a temp makes CALL_FUSAGE
2530 report the whole reg as used. Strictly speaking, the
2531 call only uses SIZE bytes at the msb end, but it doesn't
2532 seem worth generating rtl to say that. */
2533 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
2534 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, shift
, reg
, 1);
2536 emit_move_insn (reg
, x
);
2541 /* If we have pre-computed the values to put in the registers in
2542 the case of non-aligned structures, copy them in now. */
2544 else if (args
[i
].n_aligned_regs
!= 0)
2545 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
2546 emit_move_insn (gen_rtx_REG (word_mode
, REGNO (reg
) + j
),
2547 args
[i
].aligned_regs
[j
]);
2549 else if (partial
== 0 || args
[i
].pass_on_stack
)
2551 rtx mem
= validize_mem (copy_rtx (args
[i
].value
));
2553 /* Check for overlap with already clobbered argument area,
2554 providing that this has non-zero size. */
2557 && (mem_overlaps_already_clobbered_arg_p
2558 (XEXP (args
[i
].value
, 0), size
)))
2559 *sibcall_failure
= 1;
2561 if (size
% UNITS_PER_WORD
== 0
2562 || MEM_ALIGN (mem
) % BITS_PER_WORD
== 0)
2563 move_block_to_reg (REGNO (reg
), mem
, nregs
, args
[i
].mode
);
2567 move_block_to_reg (REGNO (reg
), mem
, nregs
- 1,
2569 rtx dest
= gen_rtx_REG (word_mode
, REGNO (reg
) + nregs
- 1);
2570 unsigned int bitoff
= (nregs
- 1) * BITS_PER_WORD
;
2571 unsigned int bitsize
= size
* BITS_PER_UNIT
- bitoff
;
2572 rtx x
= extract_bit_field (mem
, bitsize
, bitoff
, 1, dest
,
2573 word_mode
, word_mode
, false,
2575 if (BYTES_BIG_ENDIAN
)
2576 x
= expand_shift (LSHIFT_EXPR
, word_mode
, x
,
2577 BITS_PER_WORD
- bitsize
, dest
, 1);
2579 emit_move_insn (dest
, x
);
2582 /* Handle a BLKmode that needs shifting. */
2583 if (nregs
== 1 && size
< UNITS_PER_WORD
2584 #ifdef BLOCK_REG_PADDING
2585 && args
[i
].locate
.where_pad
== downward
2591 rtx dest
= gen_rtx_REG (word_mode
, REGNO (reg
));
2592 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
2593 enum tree_code dir
= (BYTES_BIG_ENDIAN
2594 ? RSHIFT_EXPR
: LSHIFT_EXPR
);
2597 x
= expand_shift (dir
, word_mode
, dest
, shift
, dest
, 1);
2599 emit_move_insn (dest
, x
);
2603 /* When a parameter is a block, and perhaps in other cases, it is
2604 possible that it did a load from an argument slot that was
2605 already clobbered. */
2607 && check_sibcall_argument_overlap (before_arg
, &args
[i
], 0))
2608 *sibcall_failure
= 1;
2610 /* Handle calls that pass values in multiple non-contiguous
2611 locations. The Irix 6 ABI has examples of this. */
2612 if (GET_CODE (reg
) == PARALLEL
)
2613 use_group_regs (call_fusage
, reg
);
2614 else if (nregs
== -1)
2615 use_reg_mode (call_fusage
, reg
,
2616 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)));
2618 use_regs (call_fusage
, REGNO (reg
), nregs
);
2623 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
2624 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
2625 bytes, then we would need to push some additional bytes to pad the
2626 arguments. So, we compute an adjust to the stack pointer for an
2627 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
2628 bytes. Then, when the arguments are pushed the stack will be perfectly
2629 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
2630 be popped after the call. Returns the adjustment. */
2633 combine_pending_stack_adjustment_and_call (int unadjusted_args_size
,
2634 struct args_size
*args_size
,
2635 unsigned int preferred_unit_stack_boundary
)
2637 /* The number of bytes to pop so that the stack will be
2638 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
2639 HOST_WIDE_INT adjustment
;
2640 /* The alignment of the stack after the arguments are pushed, if we
2641 just pushed the arguments without adjust the stack here. */
2642 unsigned HOST_WIDE_INT unadjusted_alignment
;
2644 unadjusted_alignment
2645 = ((stack_pointer_delta
+ unadjusted_args_size
)
2646 % preferred_unit_stack_boundary
);
2648 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
2649 as possible -- leaving just enough left to cancel out the
2650 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
2651 PENDING_STACK_ADJUST is non-negative, and congruent to
2652 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
2654 /* Begin by trying to pop all the bytes. */
2655 unadjusted_alignment
2656 = (unadjusted_alignment
2657 - (pending_stack_adjust
% preferred_unit_stack_boundary
));
2658 adjustment
= pending_stack_adjust
;
2659 /* Push enough additional bytes that the stack will be aligned
2660 after the arguments are pushed. */
2661 if (preferred_unit_stack_boundary
> 1 && unadjusted_alignment
)
2662 adjustment
-= preferred_unit_stack_boundary
- unadjusted_alignment
;
2664 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
2665 bytes after the call. The right number is the entire
2666 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
2667 by the arguments in the first place. */
2669 = pending_stack_adjust
- adjustment
+ unadjusted_args_size
;
2674 /* Scan X expression if it does not dereference any argument slots
2675 we already clobbered by tail call arguments (as noted in stored_args_map
2677 Return nonzero if X expression dereferences such argument slots,
2681 check_sibcall_argument_overlap_1 (rtx x
)
2690 code
= GET_CODE (x
);
2692 /* We need not check the operands of the CALL expression itself. */
2697 return mem_overlaps_already_clobbered_arg_p (XEXP (x
, 0),
2698 GET_MODE_SIZE (GET_MODE (x
)));
2700 /* Scan all subexpressions. */
2701 fmt
= GET_RTX_FORMAT (code
);
2702 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
2706 if (check_sibcall_argument_overlap_1 (XEXP (x
, i
)))
2709 else if (*fmt
== 'E')
2711 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2712 if (check_sibcall_argument_overlap_1 (XVECEXP (x
, i
, j
)))
2719 /* Scan sequence after INSN if it does not dereference any argument slots
2720 we already clobbered by tail call arguments (as noted in stored_args_map
2721 bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
2722 stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP
2723 should be 0). Return nonzero if sequence after INSN dereferences such argument
2724 slots, zero otherwise. */
2727 check_sibcall_argument_overlap (rtx_insn
*insn
, struct arg_data
*arg
,
2728 int mark_stored_args_map
)
2732 if (insn
== NULL_RTX
)
2733 insn
= get_insns ();
2735 insn
= NEXT_INSN (insn
);
2737 for (; insn
; insn
= NEXT_INSN (insn
))
2739 && check_sibcall_argument_overlap_1 (PATTERN (insn
)))
2742 if (mark_stored_args_map
)
2744 if (ARGS_GROW_DOWNWARD
)
2745 low
= -arg
->locate
.slot_offset
.constant
- arg
->locate
.size
.constant
;
2747 low
= arg
->locate
.slot_offset
.constant
;
2749 for (high
= low
+ arg
->locate
.size
.constant
; low
< high
; low
++)
2750 bitmap_set_bit (stored_args_map
, low
);
2752 return insn
!= NULL_RTX
;
2755 /* Given that a function returns a value of mode MODE at the most
2756 significant end of hard register VALUE, shift VALUE left or right
2757 as specified by LEFT_P. Return true if some action was needed. */
2760 shift_return_value (machine_mode mode
, bool left_p
, rtx value
)
2762 HOST_WIDE_INT shift
;
2764 gcc_assert (REG_P (value
) && HARD_REGISTER_P (value
));
2765 shift
= GET_MODE_BITSIZE (GET_MODE (value
)) - GET_MODE_BITSIZE (mode
);
2769 /* Use ashr rather than lshr for right shifts. This is for the benefit
2770 of the MIPS port, which requires SImode values to be sign-extended
2771 when stored in 64-bit registers. */
2772 if (!force_expand_binop (GET_MODE (value
), left_p
? ashl_optab
: ashr_optab
,
2773 value
, GEN_INT (shift
), value
, 1, OPTAB_WIDEN
))
2778 /* If X is a likely-spilled register value, copy it to a pseudo
2779 register and return that register. Return X otherwise. */
2782 avoid_likely_spilled_reg (rtx x
)
2787 && HARD_REGISTER_P (x
)
2788 && targetm
.class_likely_spilled_p (REGNO_REG_CLASS (REGNO (x
))))
2790 /* Make sure that we generate a REG rather than a CONCAT.
2791 Moves into CONCATs can need nontrivial instructions,
2792 and the whole point of this function is to avoid
2793 using the hard register directly in such a situation. */
2794 generating_concat_p
= 0;
2795 new_rtx
= gen_reg_rtx (GET_MODE (x
));
2796 generating_concat_p
= 1;
2797 emit_move_insn (new_rtx
, x
);
2803 /* Helper function for expand_call.
2804 Return false is EXP is not implementable as a sibling call. */
2807 can_implement_as_sibling_call_p (tree exp
,
2808 rtx structure_value_addr
,
2810 int reg_parm_stack_space ATTRIBUTE_UNUSED
,
2814 const args_size
&args_size
)
2816 if (!targetm
.have_sibcall_epilogue ())
2818 maybe_complain_about_tail_call
2820 "machine description does not have"
2821 " a sibcall_epilogue instruction pattern");
2825 /* Doing sibling call optimization needs some work, since
2826 structure_value_addr can be allocated on the stack.
2827 It does not seem worth the effort since few optimizable
2828 sibling calls will return a structure. */
2829 if (structure_value_addr
!= NULL_RTX
)
2831 maybe_complain_about_tail_call (exp
, "callee returns a structure");
2835 #ifdef REG_PARM_STACK_SPACE
2836 /* If outgoing reg parm stack space changes, we can not do sibcall. */
2837 if (OUTGOING_REG_PARM_STACK_SPACE (funtype
)
2838 != OUTGOING_REG_PARM_STACK_SPACE (TREE_TYPE (current_function_decl
))
2839 || (reg_parm_stack_space
!= REG_PARM_STACK_SPACE (current_function_decl
)))
2841 maybe_complain_about_tail_call (exp
,
2842 "inconsistent size of stack space"
2843 " allocated for arguments which are"
2844 " passed in registers");
2849 /* Check whether the target is able to optimize the call
2851 if (!targetm
.function_ok_for_sibcall (fndecl
, exp
))
2853 maybe_complain_about_tail_call (exp
,
2854 "target is not able to optimize the"
2855 " call into a sibling call");
2859 /* Functions that do not return exactly once may not be sibcall
2861 if (flags
& ECF_RETURNS_TWICE
)
2863 maybe_complain_about_tail_call (exp
, "callee returns twice");
2866 if (flags
& ECF_NORETURN
)
2868 maybe_complain_about_tail_call (exp
, "callee does not return");
2872 if (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (addr
))))
2874 maybe_complain_about_tail_call (exp
, "volatile function type");
2878 /* If the called function is nested in the current one, it might access
2879 some of the caller's arguments, but could clobber them beforehand if
2880 the argument areas are shared. */
2881 if (fndecl
&& decl_function_context (fndecl
) == current_function_decl
)
2883 maybe_complain_about_tail_call (exp
, "nested function");
2887 /* If this function requires more stack slots than the current
2888 function, we cannot change it into a sibling call.
2889 crtl->args.pretend_args_size is not part of the
2890 stack allocated by our caller. */
2891 if (args_size
.constant
> (crtl
->args
.size
- crtl
->args
.pretend_args_size
))
2893 maybe_complain_about_tail_call (exp
,
2894 "callee required more stack slots"
2895 " than the caller");
2899 /* If the callee pops its own arguments, then it must pop exactly
2900 the same number of arguments as the current function. */
2901 if (targetm
.calls
.return_pops_args (fndecl
, funtype
, args_size
.constant
)
2902 != targetm
.calls
.return_pops_args (current_function_decl
,
2903 TREE_TYPE (current_function_decl
),
2906 maybe_complain_about_tail_call (exp
,
2907 "inconsistent number of"
2908 " popped arguments");
2912 if (!lang_hooks
.decls
.ok_for_sibcall (fndecl
))
2914 maybe_complain_about_tail_call (exp
, "frontend does not support"
2919 /* All checks passed. */
2923 /* Generate all the code for a CALL_EXPR exp
2924 and return an rtx for its value.
2925 Store the value in TARGET (specified as an rtx) if convenient.
2926 If the value is stored in TARGET then TARGET is returned.
2927 If IGNORE is nonzero, then we ignore the value of the function call. */
2930 expand_call (tree exp
, rtx target
, int ignore
)
2932 /* Nonzero if we are currently expanding a call. */
2933 static int currently_expanding_call
= 0;
2935 /* RTX for the function to be called. */
2937 /* Sequence of insns to perform a normal "call". */
2938 rtx_insn
*normal_call_insns
= NULL
;
2939 /* Sequence of insns to perform a tail "call". */
2940 rtx_insn
*tail_call_insns
= NULL
;
2941 /* Data type of the function. */
2943 tree type_arg_types
;
2945 /* Declaration of the function being called,
2946 or 0 if the function is computed (not known by name). */
2948 /* The type of the function being called. */
2950 bool try_tail_call
= CALL_EXPR_TAILCALL (exp
);
2951 bool must_tail_call
= CALL_EXPR_MUST_TAIL_CALL (exp
);
2954 /* Register in which non-BLKmode value will be returned,
2955 or 0 if no value or if value is BLKmode. */
2957 /* Register(s) in which bounds are returned. */
2959 /* Address where we should return a BLKmode value;
2960 0 if value not BLKmode. */
2961 rtx structure_value_addr
= 0;
2962 /* Nonzero if that address is being passed by treating it as
2963 an extra, implicit first parameter. Otherwise,
2964 it is passed by being copied directly into struct_value_rtx. */
2965 int structure_value_addr_parm
= 0;
2966 /* Holds the value of implicit argument for the struct value. */
2967 tree structure_value_addr_value
= NULL_TREE
;
2968 /* Size of aggregate value wanted, or zero if none wanted
2969 or if we are using the non-reentrant PCC calling convention
2970 or expecting the value in registers. */
2971 HOST_WIDE_INT struct_value_size
= 0;
2972 /* Nonzero if called function returns an aggregate in memory PCC style,
2973 by returning the address of where to find it. */
2974 int pcc_struct_value
= 0;
2975 rtx struct_value
= 0;
2977 /* Number of actual parameters in this call, including struct value addr. */
2979 /* Number of named args. Args after this are anonymous ones
2980 and they must all go on the stack. */
2982 /* Number of complex actual arguments that need to be split. */
2983 int num_complex_actuals
= 0;
2985 /* Vector of information about each argument.
2986 Arguments are numbered in the order they will be pushed,
2987 not the order they are written. */
2988 struct arg_data
*args
;
2990 /* Total size in bytes of all the stack-parms scanned so far. */
2991 struct args_size args_size
;
2992 struct args_size adjusted_args_size
;
2993 /* Size of arguments before any adjustments (such as rounding). */
2994 int unadjusted_args_size
;
2995 /* Data on reg parms scanned so far. */
2996 CUMULATIVE_ARGS args_so_far_v
;
2997 cumulative_args_t args_so_far
;
2998 /* Nonzero if a reg parm has been scanned. */
3000 /* Nonzero if this is an indirect function call. */
3002 /* Nonzero if we must avoid push-insns in the args for this call.
3003 If stack space is allocated for register parameters, but not by the
3004 caller, then it is preallocated in the fixed part of the stack frame.
3005 So the entire argument block must then be preallocated (i.e., we
3006 ignore PUSH_ROUNDING in that case). */
3008 int must_preallocate
= !PUSH_ARGS
;
3010 /* Size of the stack reserved for parameter registers. */
3011 int reg_parm_stack_space
= 0;
3013 /* Address of space preallocated for stack parms
3014 (on machines that lack push insns), or 0 if space not preallocated. */
3017 /* Mask of ECF_ and ERF_ flags. */
3019 int return_flags
= 0;
3020 #ifdef REG_PARM_STACK_SPACE
3021 /* Define the boundary of the register parm stack space that needs to be
3023 int low_to_save
, high_to_save
;
3024 rtx save_area
= 0; /* Place that it is saved */
3027 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
3028 char *initial_stack_usage_map
= stack_usage_map
;
3029 char *stack_usage_map_buf
= NULL
;
3031 int old_stack_allocated
;
3033 /* State variables to track stack modifications. */
3034 rtx old_stack_level
= 0;
3035 int old_stack_arg_under_construction
= 0;
3036 int old_pending_adj
= 0;
3037 int old_inhibit_defer_pop
= inhibit_defer_pop
;
3039 /* Some stack pointer alterations we make are performed via
3040 allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
3041 which we then also need to save/restore along the way. */
3042 int old_stack_pointer_delta
= 0;
3045 tree addr
= CALL_EXPR_FN (exp
);
3047 /* The alignment of the stack, in bits. */
3048 unsigned HOST_WIDE_INT preferred_stack_boundary
;
3049 /* The alignment of the stack, in bytes. */
3050 unsigned HOST_WIDE_INT preferred_unit_stack_boundary
;
3051 /* The static chain value to use for this call. */
3052 rtx static_chain_value
;
3053 /* See if this is "nothrow" function call. */
3054 if (TREE_NOTHROW (exp
))
3055 flags
|= ECF_NOTHROW
;
3057 /* See if we can find a DECL-node for the actual function, and get the
3058 function attributes (flags) from the function decl or type node. */
3059 fndecl
= get_callee_fndecl (exp
);
3062 fntype
= TREE_TYPE (fndecl
);
3063 flags
|= flags_from_decl_or_type (fndecl
);
3064 return_flags
|= decl_return_flags (fndecl
);
3068 fntype
= TREE_TYPE (TREE_TYPE (addr
));
3069 flags
|= flags_from_decl_or_type (fntype
);
3070 if (CALL_EXPR_BY_DESCRIPTOR (exp
))
3071 flags
|= ECF_BY_DESCRIPTOR
;
3073 rettype
= TREE_TYPE (exp
);
3075 struct_value
= targetm
.calls
.struct_value_rtx (fntype
, 0);
3077 /* Warn if this value is an aggregate type,
3078 regardless of which calling convention we are using for it. */
3079 if (AGGREGATE_TYPE_P (rettype
))
3080 warning (OPT_Waggregate_return
, "function call has aggregate value");
3082 /* If the result of a non looping pure or const function call is
3083 ignored (or void), and none of its arguments are volatile, we can
3084 avoid expanding the call and just evaluate the arguments for
3086 if ((flags
& (ECF_CONST
| ECF_PURE
))
3087 && (!(flags
& ECF_LOOPING_CONST_OR_PURE
))
3088 && (ignore
|| target
== const0_rtx
3089 || TYPE_MODE (rettype
) == VOIDmode
))
3091 bool volatilep
= false;
3093 call_expr_arg_iterator iter
;
3095 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
3096 if (TREE_THIS_VOLATILE (arg
))
3104 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
3105 expand_expr (arg
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3110 #ifdef REG_PARM_STACK_SPACE
3111 reg_parm_stack_space
= REG_PARM_STACK_SPACE (!fndecl
? fntype
: fndecl
);
3114 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
3115 && reg_parm_stack_space
> 0 && PUSH_ARGS
)
3116 must_preallocate
= 1;
3118 /* Set up a place to return a structure. */
3120 /* Cater to broken compilers. */
3121 if (aggregate_value_p (exp
, fntype
))
3123 /* This call returns a big structure. */
3124 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
3126 #ifdef PCC_STATIC_STRUCT_RETURN
3128 pcc_struct_value
= 1;
3130 #else /* not PCC_STATIC_STRUCT_RETURN */
3132 struct_value_size
= int_size_in_bytes (rettype
);
3134 /* Even if it is semantically safe to use the target as the return
3135 slot, it may be not sufficiently aligned for the return type. */
3136 if (CALL_EXPR_RETURN_SLOT_OPT (exp
)
3139 && !(MEM_ALIGN (target
) < TYPE_ALIGN (rettype
)
3140 && SLOW_UNALIGNED_ACCESS (TYPE_MODE (rettype
),
3141 MEM_ALIGN (target
))))
3142 structure_value_addr
= XEXP (target
, 0);
3145 /* For variable-sized objects, we must be called with a target
3146 specified. If we were to allocate space on the stack here,
3147 we would have no way of knowing when to free it. */
3148 rtx d
= assign_temp (rettype
, 1, 1);
3149 structure_value_addr
= XEXP (d
, 0);
3153 #endif /* not PCC_STATIC_STRUCT_RETURN */
3156 /* Figure out the amount to which the stack should be aligned. */
3157 preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
3160 struct cgraph_rtl_info
*i
= cgraph_node::rtl_info (fndecl
);
3161 /* Without automatic stack alignment, we can't increase preferred
3162 stack boundary. With automatic stack alignment, it is
3163 unnecessary since unless we can guarantee that all callers will
3164 align the outgoing stack properly, callee has to align its
3167 && i
->preferred_incoming_stack_boundary
3168 && i
->preferred_incoming_stack_boundary
< preferred_stack_boundary
)
3169 preferred_stack_boundary
= i
->preferred_incoming_stack_boundary
;
3172 /* Operand 0 is a pointer-to-function; get the type of the function. */
3173 funtype
= TREE_TYPE (addr
);
3174 gcc_assert (POINTER_TYPE_P (funtype
));
3175 funtype
= TREE_TYPE (funtype
);
3177 /* Count whether there are actual complex arguments that need to be split
3178 into their real and imaginary parts. Munge the type_arg_types
3179 appropriately here as well. */
3180 if (targetm
.calls
.split_complex_arg
)
3182 call_expr_arg_iterator iter
;
3184 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
3186 tree type
= TREE_TYPE (arg
);
3187 if (type
&& TREE_CODE (type
) == COMPLEX_TYPE
3188 && targetm
.calls
.split_complex_arg (type
))
3189 num_complex_actuals
++;
3191 type_arg_types
= split_complex_types (TYPE_ARG_TYPES (funtype
));
3194 type_arg_types
= TYPE_ARG_TYPES (funtype
);
3196 if (flags
& ECF_MAY_BE_ALLOCA
)
3197 cfun
->calls_alloca
= 1;
3199 /* If struct_value_rtx is 0, it means pass the address
3200 as if it were an extra parameter. Put the argument expression
3201 in structure_value_addr_value. */
3202 if (structure_value_addr
&& struct_value
== 0)
3204 /* If structure_value_addr is a REG other than
3205 virtual_outgoing_args_rtx, we can use always use it. If it
3206 is not a REG, we must always copy it into a register.
3207 If it is virtual_outgoing_args_rtx, we must copy it to another
3208 register in some cases. */
3209 rtx temp
= (!REG_P (structure_value_addr
)
3210 || (ACCUMULATE_OUTGOING_ARGS
3211 && stack_arg_under_construction
3212 && structure_value_addr
== virtual_outgoing_args_rtx
)
3213 ? copy_addr_to_reg (convert_memory_address
3214 (Pmode
, structure_value_addr
))
3215 : structure_value_addr
);
3217 structure_value_addr_value
=
3218 make_tree (build_pointer_type (TREE_TYPE (funtype
)), temp
);
3219 structure_value_addr_parm
= CALL_WITH_BOUNDS_P (exp
) ? 2 : 1;
3222 /* Count the arguments and set NUM_ACTUALS. */
3224 call_expr_nargs (exp
) + num_complex_actuals
+ structure_value_addr_parm
;
3226 /* Compute number of named args.
3227 First, do a raw count of the args for INIT_CUMULATIVE_ARGS. */
3229 if (type_arg_types
!= 0)
3231 = (list_length (type_arg_types
)
3232 /* Count the struct value address, if it is passed as a parm. */
3233 + structure_value_addr_parm
);
3235 /* If we know nothing, treat all args as named. */
3236 n_named_args
= num_actuals
;
3238 /* Start updating where the next arg would go.
3240 On some machines (such as the PA) indirect calls have a different
3241 calling convention than normal calls. The fourth argument in
3242 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
3244 INIT_CUMULATIVE_ARGS (args_so_far_v
, funtype
, NULL_RTX
, fndecl
, n_named_args
);
3245 args_so_far
= pack_cumulative_args (&args_so_far_v
);
3247 /* Now possibly adjust the number of named args.
3248 Normally, don't include the last named arg if anonymous args follow.
3249 We do include the last named arg if
3250 targetm.calls.strict_argument_naming() returns nonzero.
3251 (If no anonymous args follow, the result of list_length is actually
3252 one too large. This is harmless.)
3254 If targetm.calls.pretend_outgoing_varargs_named() returns
3255 nonzero, and targetm.calls.strict_argument_naming() returns zero,
3256 this machine will be able to place unnamed args that were passed
3257 in registers into the stack. So treat all args as named. This
3258 allows the insns emitting for a specific argument list to be
3259 independent of the function declaration.
3261 If targetm.calls.pretend_outgoing_varargs_named() returns zero,
3262 we do not have any reliable way to pass unnamed args in
3263 registers, so we must force them into memory. */
3265 if (type_arg_types
!= 0
3266 && targetm
.calls
.strict_argument_naming (args_so_far
))
3268 else if (type_arg_types
!= 0
3269 && ! targetm
.calls
.pretend_outgoing_varargs_named (args_so_far
))
3270 /* Don't include the last named arg. */
3273 /* Treat all args as named. */
3274 n_named_args
= num_actuals
;
3276 /* Make a vector to hold all the information about each arg. */
3277 args
= XCNEWVEC (struct arg_data
, num_actuals
);
3279 /* Build up entries in the ARGS array, compute the size of the
3280 arguments into ARGS_SIZE, etc. */
3281 initialize_argument_information (num_actuals
, args
, &args_size
,
3283 structure_value_addr_value
, fndecl
, fntype
,
3284 args_so_far
, reg_parm_stack_space
,
3285 &old_stack_level
, &old_pending_adj
,
3286 &must_preallocate
, &flags
,
3287 &try_tail_call
, CALL_FROM_THUNK_P (exp
));
3290 must_preallocate
= 1;
3292 /* Now make final decision about preallocating stack space. */
3293 must_preallocate
= finalize_must_preallocate (must_preallocate
,
3297 /* If the structure value address will reference the stack pointer, we
3298 must stabilize it. We don't need to do this if we know that we are
3299 not going to adjust the stack pointer in processing this call. */
3301 if (structure_value_addr
3302 && (reg_mentioned_p (virtual_stack_dynamic_rtx
, structure_value_addr
)
3303 || reg_mentioned_p (virtual_outgoing_args_rtx
,
3304 structure_value_addr
))
3306 || (!ACCUMULATE_OUTGOING_ARGS
&& args_size
.constant
)))
3307 structure_value_addr
= copy_to_reg (structure_value_addr
);
3309 /* Tail calls can make things harder to debug, and we've traditionally
3310 pushed these optimizations into -O2. Don't try if we're already
3311 expanding a call, as that means we're an argument. Don't try if
3312 there's cleanups, as we know there's code to follow the call. */
3314 if (currently_expanding_call
++ != 0
3315 || !flag_optimize_sibling_calls
3317 || dbg_cnt (tail_call
) == false)
3320 /* If the user has marked the function as requiring tail-call
3321 optimization, attempt it. */
3325 /* Rest of purposes for tail call optimizations to fail. */
3327 try_tail_call
= can_implement_as_sibling_call_p (exp
,
3328 structure_value_addr
,
3330 reg_parm_stack_space
,
3332 flags
, addr
, args_size
);
3334 /* Check if caller and callee disagree in promotion of function
3338 machine_mode caller_mode
, caller_promoted_mode
;
3339 machine_mode callee_mode
, callee_promoted_mode
;
3340 int caller_unsignedp
, callee_unsignedp
;
3341 tree caller_res
= DECL_RESULT (current_function_decl
);
3343 caller_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (caller_res
));
3344 caller_mode
= DECL_MODE (caller_res
);
3345 callee_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (funtype
));
3346 callee_mode
= TYPE_MODE (TREE_TYPE (funtype
));
3347 caller_promoted_mode
3348 = promote_function_mode (TREE_TYPE (caller_res
), caller_mode
,
3350 TREE_TYPE (current_function_decl
), 1);
3351 callee_promoted_mode
3352 = promote_function_mode (TREE_TYPE (funtype
), callee_mode
,
3355 if (caller_mode
!= VOIDmode
3356 && (caller_promoted_mode
!= callee_promoted_mode
3357 || ((caller_mode
!= caller_promoted_mode
3358 || callee_mode
!= callee_promoted_mode
)
3359 && (caller_unsignedp
!= callee_unsignedp
3360 || GET_MODE_BITSIZE (caller_mode
)
3361 < GET_MODE_BITSIZE (callee_mode
)))))
3364 maybe_complain_about_tail_call (exp
,
3365 "caller and callee disagree in"
3366 " promotion of function"
3371 /* Ensure current function's preferred stack boundary is at least
3372 what we need. Stack alignment may also increase preferred stack
3374 if (crtl
->preferred_stack_boundary
< preferred_stack_boundary
)
3375 crtl
->preferred_stack_boundary
= preferred_stack_boundary
;
3377 preferred_stack_boundary
= crtl
->preferred_stack_boundary
;
3379 preferred_unit_stack_boundary
= preferred_stack_boundary
/ BITS_PER_UNIT
;
3381 /* We want to make two insn chains; one for a sibling call, the other
3382 for a normal call. We will select one of the two chains after
3383 initial RTL generation is complete. */
3384 for (pass
= try_tail_call
? 0 : 1; pass
< 2; pass
++)
3386 int sibcall_failure
= 0;
3387 /* We want to emit any pending stack adjustments before the tail
3388 recursion "call". That way we know any adjustment after the tail
3389 recursion call can be ignored if we indeed use the tail
3391 saved_pending_stack_adjust save
;
3392 rtx_insn
*insns
, *before_call
, *after_args
;
3397 /* State variables we need to save and restore between
3399 save_pending_stack_adjust (&save
);
3402 flags
&= ~ECF_SIBCALL
;
3404 flags
|= ECF_SIBCALL
;
3406 /* Other state variables that we must reinitialize each time
3407 through the loop (that are not initialized by the loop itself). */
3411 /* Start a new sequence for the normal call case.
3413 From this point on, if the sibling call fails, we want to set
3414 sibcall_failure instead of continuing the loop. */
3417 /* Don't let pending stack adjusts add up to too much.
3418 Also, do all pending adjustments now if there is any chance
3419 this might be a call to alloca or if we are expanding a sibling
3421 Also do the adjustments before a throwing call, otherwise
3422 exception handling can fail; PR 19225. */
3423 if (pending_stack_adjust
>= 32
3424 || (pending_stack_adjust
> 0
3425 && (flags
& ECF_MAY_BE_ALLOCA
))
3426 || (pending_stack_adjust
> 0
3427 && flag_exceptions
&& !(flags
& ECF_NOTHROW
))
3429 do_pending_stack_adjust ();
3431 /* Precompute any arguments as needed. */
3433 precompute_arguments (num_actuals
, args
);
3435 /* Now we are about to start emitting insns that can be deleted
3436 if a libcall is deleted. */
3437 if (pass
&& (flags
& ECF_MALLOC
))
3441 && crtl
->stack_protect_guard
3442 && targetm
.stack_protect_runtime_enabled_p ())
3443 stack_protect_epilogue ();
3445 adjusted_args_size
= args_size
;
3446 /* Compute the actual size of the argument block required. The variable
3447 and constant sizes must be combined, the size may have to be rounded,
3448 and there may be a minimum required size. When generating a sibcall
3449 pattern, do not round up, since we'll be re-using whatever space our
3451 unadjusted_args_size
3452 = compute_argument_block_size (reg_parm_stack_space
,
3453 &adjusted_args_size
,
3456 : preferred_stack_boundary
));
3458 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
3460 /* The argument block when performing a sibling call is the
3461 incoming argument block. */
3464 argblock
= crtl
->args
.internal_arg_pointer
;
3465 if (STACK_GROWS_DOWNWARD
)
3467 = plus_constant (Pmode
, argblock
, crtl
->args
.pretend_args_size
);
3470 = plus_constant (Pmode
, argblock
, -crtl
->args
.pretend_args_size
);
3472 stored_args_map
= sbitmap_alloc (args_size
.constant
);
3473 bitmap_clear (stored_args_map
);
3476 /* If we have no actual push instructions, or shouldn't use them,
3477 make space for all args right now. */
3478 else if (adjusted_args_size
.var
!= 0)
3480 if (old_stack_level
== 0)
3482 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
3483 old_stack_pointer_delta
= stack_pointer_delta
;
3484 old_pending_adj
= pending_stack_adjust
;
3485 pending_stack_adjust
= 0;
3486 /* stack_arg_under_construction says whether a stack arg is
3487 being constructed at the old stack level. Pushing the stack
3488 gets a clean outgoing argument block. */
3489 old_stack_arg_under_construction
= stack_arg_under_construction
;
3490 stack_arg_under_construction
= 0;
3492 argblock
= push_block (ARGS_SIZE_RTX (adjusted_args_size
), 0, 0);
3493 if (flag_stack_usage_info
)
3494 current_function_has_unbounded_dynamic_stack_size
= 1;
3498 /* Note that we must go through the motions of allocating an argument
3499 block even if the size is zero because we may be storing args
3500 in the area reserved for register arguments, which may be part of
3503 int needed
= adjusted_args_size
.constant
;
3505 /* Store the maximum argument space used. It will be pushed by
3506 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
3509 if (needed
> crtl
->outgoing_args_size
)
3510 crtl
->outgoing_args_size
= needed
;
3512 if (must_preallocate
)
3514 if (ACCUMULATE_OUTGOING_ARGS
)
3516 /* Since the stack pointer will never be pushed, it is
3517 possible for the evaluation of a parm to clobber
3518 something we have already written to the stack.
3519 Since most function calls on RISC machines do not use
3520 the stack, this is uncommon, but must work correctly.
3522 Therefore, we save any area of the stack that was already
3523 written and that we are using. Here we set up to do this
3524 by making a new stack usage map from the old one. The
3525 actual save will be done by store_one_arg.
3527 Another approach might be to try to reorder the argument
3528 evaluations to avoid this conflicting stack usage. */
3530 /* Since we will be writing into the entire argument area,
3531 the map must be allocated for its entire size, not just
3532 the part that is the responsibility of the caller. */
3533 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
3534 needed
+= reg_parm_stack_space
;
3536 if (ARGS_GROW_DOWNWARD
)
3537 highest_outgoing_arg_in_use
3538 = MAX (initial_highest_arg_in_use
, needed
+ 1);
3540 highest_outgoing_arg_in_use
3541 = MAX (initial_highest_arg_in_use
, needed
);
3543 free (stack_usage_map_buf
);
3544 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
3545 stack_usage_map
= stack_usage_map_buf
;
3547 if (initial_highest_arg_in_use
)
3548 memcpy (stack_usage_map
, initial_stack_usage_map
,
3549 initial_highest_arg_in_use
);
3551 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
3552 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
3553 (highest_outgoing_arg_in_use
3554 - initial_highest_arg_in_use
));
3557 /* The address of the outgoing argument list must not be
3558 copied to a register here, because argblock would be left
3559 pointing to the wrong place after the call to
3560 allocate_dynamic_stack_space below. */
3562 argblock
= virtual_outgoing_args_rtx
;
3566 if (inhibit_defer_pop
== 0)
3568 /* Try to reuse some or all of the pending_stack_adjust
3569 to get this space. */
3571 = (combine_pending_stack_adjustment_and_call
3572 (unadjusted_args_size
,
3573 &adjusted_args_size
,
3574 preferred_unit_stack_boundary
));
3576 /* combine_pending_stack_adjustment_and_call computes
3577 an adjustment before the arguments are allocated.
3578 Account for them and see whether or not the stack
3579 needs to go up or down. */
3580 needed
= unadjusted_args_size
- needed
;
3584 /* We're releasing stack space. */
3585 /* ??? We can avoid any adjustment at all if we're
3586 already aligned. FIXME. */
3587 pending_stack_adjust
= -needed
;
3588 do_pending_stack_adjust ();
3592 /* We need to allocate space. We'll do that in
3593 push_block below. */
3594 pending_stack_adjust
= 0;
3597 /* Special case this because overhead of `push_block' in
3598 this case is non-trivial. */
3600 argblock
= virtual_outgoing_args_rtx
;
3603 argblock
= push_block (GEN_INT (needed
), 0, 0);
3604 if (ARGS_GROW_DOWNWARD
)
3605 argblock
= plus_constant (Pmode
, argblock
, needed
);
3608 /* We only really need to call `copy_to_reg' in the case
3609 where push insns are going to be used to pass ARGBLOCK
3610 to a function call in ARGS. In that case, the stack
3611 pointer changes value from the allocation point to the
3612 call point, and hence the value of
3613 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
3614 as well always do it. */
3615 argblock
= copy_to_reg (argblock
);
3620 if (ACCUMULATE_OUTGOING_ARGS
)
3622 /* The save/restore code in store_one_arg handles all
3623 cases except one: a constructor call (including a C
3624 function returning a BLKmode struct) to initialize
3626 if (stack_arg_under_construction
)
3629 = GEN_INT (adjusted_args_size
.constant
3630 + (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
3631 : TREE_TYPE (fndecl
))) ? 0
3632 : reg_parm_stack_space
));
3633 if (old_stack_level
== 0)
3635 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
3636 old_stack_pointer_delta
= stack_pointer_delta
;
3637 old_pending_adj
= pending_stack_adjust
;
3638 pending_stack_adjust
= 0;
3639 /* stack_arg_under_construction says whether a stack
3640 arg is being constructed at the old stack level.
3641 Pushing the stack gets a clean outgoing argument
3643 old_stack_arg_under_construction
3644 = stack_arg_under_construction
;
3645 stack_arg_under_construction
= 0;
3646 /* Make a new map for the new argument list. */
3647 free (stack_usage_map_buf
);
3648 stack_usage_map_buf
= XCNEWVEC (char, highest_outgoing_arg_in_use
);
3649 stack_usage_map
= stack_usage_map_buf
;
3650 highest_outgoing_arg_in_use
= 0;
3652 /* We can pass TRUE as the 4th argument because we just
3653 saved the stack pointer and will restore it right after
3655 allocate_dynamic_stack_space (push_size
, 0,
3656 BIGGEST_ALIGNMENT
, true);
3659 /* If argument evaluation might modify the stack pointer,
3660 copy the address of the argument list to a register. */
3661 for (i
= 0; i
< num_actuals
; i
++)
3662 if (args
[i
].pass_on_stack
)
3664 argblock
= copy_addr_to_reg (argblock
);
3669 compute_argument_addresses (args
, argblock
, num_actuals
);
3671 /* Stack is properly aligned, pops can't safely be deferred during
3672 the evaluation of the arguments. */
3675 /* Precompute all register parameters. It isn't safe to compute
3676 anything once we have started filling any specific hard regs.
3677 TLS symbols sometimes need a call to resolve. Precompute
3678 register parameters before any stack pointer manipulation
3679 to avoid unaligned stack in the called function. */
3680 precompute_register_parameters (num_actuals
, args
, ®_parm_seen
);
3684 /* Perform stack alignment before the first push (the last arg). */
3686 && adjusted_args_size
.constant
> reg_parm_stack_space
3687 && adjusted_args_size
.constant
!= unadjusted_args_size
)
3689 /* When the stack adjustment is pending, we get better code
3690 by combining the adjustments. */
3691 if (pending_stack_adjust
3692 && ! inhibit_defer_pop
)
3694 pending_stack_adjust
3695 = (combine_pending_stack_adjustment_and_call
3696 (unadjusted_args_size
,
3697 &adjusted_args_size
,
3698 preferred_unit_stack_boundary
));
3699 do_pending_stack_adjust ();
3701 else if (argblock
== 0)
3702 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
3703 - unadjusted_args_size
));
3705 /* Now that the stack is properly aligned, pops can't safely
3706 be deferred during the evaluation of the arguments. */
3709 /* Record the maximum pushed stack space size. We need to delay
3710 doing it this far to take into account the optimization done
3711 by combine_pending_stack_adjustment_and_call. */
3712 if (flag_stack_usage_info
3713 && !ACCUMULATE_OUTGOING_ARGS
3715 && adjusted_args_size
.var
== 0)
3717 int pushed
= adjusted_args_size
.constant
+ pending_stack_adjust
;
3718 if (pushed
> current_function_pushed_stack_size
)
3719 current_function_pushed_stack_size
= pushed
;
3722 funexp
= rtx_for_function_call (fndecl
, addr
);
3724 if (CALL_EXPR_STATIC_CHAIN (exp
))
3725 static_chain_value
= expand_normal (CALL_EXPR_STATIC_CHAIN (exp
));
3727 static_chain_value
= 0;
3729 #ifdef REG_PARM_STACK_SPACE
3730 /* Save the fixed argument area if it's part of the caller's frame and
3731 is clobbered by argument setup for this call. */
3732 if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
3733 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
3734 &low_to_save
, &high_to_save
);
3737 /* Now store (and compute if necessary) all non-register parms.
3738 These come before register parms, since they can require block-moves,
3739 which could clobber the registers used for register parms.
3740 Parms which have partial registers are not stored here,
3741 but we do preallocate space here if they want that. */
3743 for (i
= 0; i
< num_actuals
; i
++)
3745 /* Delay bounds until all other args are stored. */
3746 if (POINTER_BOUNDS_P (args
[i
].tree_value
))
3748 else if (args
[i
].reg
== 0 || args
[i
].pass_on_stack
)
3750 rtx_insn
*before_arg
= get_last_insn ();
3752 /* We don't allow passing huge (> 2^30 B) arguments
3753 by value. It would cause an overflow later on. */
3754 if (adjusted_args_size
.constant
3755 >= (1 << (HOST_BITS_PER_INT
- 2)))
3757 sorry ("passing too large argument on stack");
3761 if (store_one_arg (&args
[i
], argblock
, flags
,
3762 adjusted_args_size
.var
!= 0,
3763 reg_parm_stack_space
)
3765 && check_sibcall_argument_overlap (before_arg
,
3767 sibcall_failure
= 1;
3772 = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
3773 gen_rtx_USE (VOIDmode
, args
[i
].stack
),
3777 /* If we have a parm that is passed in registers but not in memory
3778 and whose alignment does not permit a direct copy into registers,
3779 make a group of pseudos that correspond to each register that we
3781 if (STRICT_ALIGNMENT
)
3782 store_unaligned_arguments_into_pseudos (args
, num_actuals
);
3784 /* Now store any partially-in-registers parm.
3785 This is the last place a block-move can happen. */
3787 for (i
= 0; i
< num_actuals
; i
++)
3788 if (args
[i
].partial
!= 0 && ! args
[i
].pass_on_stack
)
3790 rtx_insn
*before_arg
= get_last_insn ();
3792 /* On targets with weird calling conventions (e.g. PA) it's
3793 hard to ensure that all cases of argument overlap between
3794 stack and registers work. Play it safe and bail out. */
3795 if (ARGS_GROW_DOWNWARD
&& !STACK_GROWS_DOWNWARD
)
3797 sibcall_failure
= 1;
3801 if (store_one_arg (&args
[i
], argblock
, flags
,
3802 adjusted_args_size
.var
!= 0,
3803 reg_parm_stack_space
)
3805 && check_sibcall_argument_overlap (before_arg
,
3807 sibcall_failure
= 1;
3810 bool any_regs
= false;
3811 for (i
= 0; i
< num_actuals
; i
++)
3812 if (args
[i
].reg
!= NULL_RTX
)
3815 targetm
.calls
.call_args (args
[i
].reg
, funtype
);
3818 targetm
.calls
.call_args (pc_rtx
, funtype
);
3820 /* Figure out the register where the value, if any, will come back. */
3823 if (TYPE_MODE (rettype
) != VOIDmode
3824 && ! structure_value_addr
)
3826 if (pcc_struct_value
)
3828 valreg
= hard_function_value (build_pointer_type (rettype
),
3829 fndecl
, NULL
, (pass
== 0));
3830 if (CALL_WITH_BOUNDS_P (exp
))
3831 valbnd
= targetm
.calls
.
3832 chkp_function_value_bounds (build_pointer_type (rettype
),
3833 fndecl
, (pass
== 0));
3837 valreg
= hard_function_value (rettype
, fndecl
, fntype
,
3839 if (CALL_WITH_BOUNDS_P (exp
))
3840 valbnd
= targetm
.calls
.chkp_function_value_bounds (rettype
,
3845 /* If VALREG is a PARALLEL whose first member has a zero
3846 offset, use that. This is for targets such as m68k that
3847 return the same value in multiple places. */
3848 if (GET_CODE (valreg
) == PARALLEL
)
3850 rtx elem
= XVECEXP (valreg
, 0, 0);
3851 rtx where
= XEXP (elem
, 0);
3852 rtx offset
= XEXP (elem
, 1);
3853 if (offset
== const0_rtx
3854 && GET_MODE (where
) == GET_MODE (valreg
))
3859 /* Store all bounds not passed in registers. */
3860 for (i
= 0; i
< num_actuals
; i
++)
3862 if (POINTER_BOUNDS_P (args
[i
].tree_value
)
3864 store_bounds (&args
[i
],
3865 args
[i
].pointer_arg
== -1
3867 : &args
[args
[i
].pointer_arg
]);
3870 /* If register arguments require space on the stack and stack space
3871 was not preallocated, allocate stack space here for arguments
3872 passed in registers. */
3873 if (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
3874 && !ACCUMULATE_OUTGOING_ARGS
3875 && must_preallocate
== 0 && reg_parm_stack_space
> 0)
3876 anti_adjust_stack (GEN_INT (reg_parm_stack_space
));
3878 /* Pass the function the address in which to return a
3880 if (pass
!= 0 && structure_value_addr
&& ! structure_value_addr_parm
)
3882 structure_value_addr
3883 = convert_memory_address (Pmode
, structure_value_addr
);
3884 emit_move_insn (struct_value
,
3886 force_operand (structure_value_addr
,
3889 if (REG_P (struct_value
))
3890 use_reg (&call_fusage
, struct_value
);
3893 after_args
= get_last_insn ();
3894 funexp
= prepare_call_address (fndecl
? fndecl
: fntype
, funexp
,
3895 static_chain_value
, &call_fusage
,
3896 reg_parm_seen
, flags
);
3898 load_register_parameters (args
, num_actuals
, &call_fusage
, flags
,
3899 pass
== 0, &sibcall_failure
);
3901 /* Save a pointer to the last insn before the call, so that we can
3902 later safely search backwards to find the CALL_INSN. */
3903 before_call
= get_last_insn ();
3905 /* Set up next argument register. For sibling calls on machines
3906 with register windows this should be the incoming register. */
3908 next_arg_reg
= targetm
.calls
.function_incoming_arg (args_so_far
,
3913 next_arg_reg
= targetm
.calls
.function_arg (args_so_far
,
3914 VOIDmode
, void_type_node
,
3917 if (pass
== 1 && (return_flags
& ERF_RETURNS_ARG
))
3919 int arg_nr
= return_flags
& ERF_RETURN_ARG_MASK
;
3920 arg_nr
= num_actuals
- arg_nr
- 1;
3922 && arg_nr
< num_actuals
3926 && GET_MODE (args
[arg_nr
].reg
) == GET_MODE (valreg
))
3928 = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args
[arg_nr
].tree_value
)),
3929 gen_rtx_SET (valreg
, args
[arg_nr
].reg
),
3932 /* All arguments and registers used for the call must be set up by
3935 /* Stack must be properly aligned now. */
3937 || !(stack_pointer_delta
% preferred_unit_stack_boundary
));
3939 /* Generate the actual call instruction. */
3940 emit_call_1 (funexp
, exp
, fndecl
, funtype
, unadjusted_args_size
,
3941 adjusted_args_size
.constant
, struct_value_size
,
3942 next_arg_reg
, valreg
, old_inhibit_defer_pop
, call_fusage
,
3943 flags
, args_so_far
);
3947 rtx_call_insn
*last
;
3948 rtx datum
= NULL_RTX
;
3949 if (fndecl
!= NULL_TREE
)
3951 datum
= XEXP (DECL_RTL (fndecl
), 0);
3952 gcc_assert (datum
!= NULL_RTX
3953 && GET_CODE (datum
) == SYMBOL_REF
);
3955 last
= last_call_insn ();
3956 add_reg_note (last
, REG_CALL_DECL
, datum
);
3959 /* If the call setup or the call itself overlaps with anything
3960 of the argument setup we probably clobbered our call address.
3961 In that case we can't do sibcalls. */
3963 && check_sibcall_argument_overlap (after_args
, 0, 0))
3964 sibcall_failure
= 1;
3966 /* If a non-BLKmode value is returned at the most significant end
3967 of a register, shift the register right by the appropriate amount
3968 and update VALREG accordingly. BLKmode values are handled by the
3969 group load/store machinery below. */
3970 if (!structure_value_addr
3971 && !pcc_struct_value
3972 && TYPE_MODE (rettype
) != VOIDmode
3973 && TYPE_MODE (rettype
) != BLKmode
3975 && targetm
.calls
.return_in_msb (rettype
))
3977 if (shift_return_value (TYPE_MODE (rettype
), false, valreg
))
3978 sibcall_failure
= 1;
3979 valreg
= gen_rtx_REG (TYPE_MODE (rettype
), REGNO (valreg
));
3982 if (pass
&& (flags
& ECF_MALLOC
))
3984 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
3985 rtx_insn
*last
, *insns
;
3987 /* The return value from a malloc-like function is a pointer. */
3988 if (TREE_CODE (rettype
) == POINTER_TYPE
)
3989 mark_reg_pointer (temp
, MALLOC_ABI_ALIGNMENT
);
3991 emit_move_insn (temp
, valreg
);
3993 /* The return value from a malloc-like function can not alias
3995 last
= get_last_insn ();
3996 add_reg_note (last
, REG_NOALIAS
, temp
);
3998 /* Write out the sequence. */
3999 insns
= get_insns ();
4005 /* For calls to `setjmp', etc., inform
4006 function.c:setjmp_warnings that it should complain if
4007 nonvolatile values are live. For functions that cannot
4008 return, inform flow that control does not fall through. */
4010 if ((flags
& ECF_NORETURN
) || pass
== 0)
4012 /* The barrier must be emitted
4013 immediately after the CALL_INSN. Some ports emit more
4014 than just a CALL_INSN above, so we must search for it here. */
4016 rtx_insn
*last
= get_last_insn ();
4017 while (!CALL_P (last
))
4019 last
= PREV_INSN (last
);
4020 /* There was no CALL_INSN? */
4021 gcc_assert (last
!= before_call
);
4024 emit_barrier_after (last
);
4026 /* Stack adjustments after a noreturn call are dead code.
4027 However when NO_DEFER_POP is in effect, we must preserve
4028 stack_pointer_delta. */
4029 if (inhibit_defer_pop
== 0)
4031 stack_pointer_delta
= old_stack_allocated
;
4032 pending_stack_adjust
= 0;
4036 /* If value type not void, return an rtx for the value. */
4038 if (TYPE_MODE (rettype
) == VOIDmode
4040 target
= const0_rtx
;
4041 else if (structure_value_addr
)
4043 if (target
== 0 || !MEM_P (target
))
4046 = gen_rtx_MEM (TYPE_MODE (rettype
),
4047 memory_address (TYPE_MODE (rettype
),
4048 structure_value_addr
));
4049 set_mem_attributes (target
, rettype
, 1);
4052 else if (pcc_struct_value
)
4054 /* This is the special C++ case where we need to
4055 know what the true target was. We take care to
4056 never use this value more than once in one expression. */
4057 target
= gen_rtx_MEM (TYPE_MODE (rettype
),
4058 copy_to_reg (valreg
));
4059 set_mem_attributes (target
, rettype
, 1);
4061 /* Handle calls that return values in multiple non-contiguous locations.
4062 The Irix 6 ABI has examples of this. */
4063 else if (GET_CODE (valreg
) == PARALLEL
)
4066 target
= emit_group_move_into_temps (valreg
);
4067 else if (rtx_equal_p (target
, valreg
))
4069 else if (GET_CODE (target
) == PARALLEL
)
4070 /* Handle the result of a emit_group_move_into_temps
4071 call in the previous pass. */
4072 emit_group_move (target
, valreg
);
4074 emit_group_store (target
, valreg
, rettype
,
4075 int_size_in_bytes (rettype
));
4078 && GET_MODE (target
) == TYPE_MODE (rettype
)
4079 && GET_MODE (target
) == GET_MODE (valreg
))
4081 bool may_overlap
= false;
4083 /* We have to copy a return value in a CLASS_LIKELY_SPILLED hard
4084 reg to a plain register. */
4085 if (!REG_P (target
) || HARD_REGISTER_P (target
))
4086 valreg
= avoid_likely_spilled_reg (valreg
);
4088 /* If TARGET is a MEM in the argument area, and we have
4089 saved part of the argument area, then we can't store
4090 directly into TARGET as it may get overwritten when we
4091 restore the argument save area below. Don't work too
4092 hard though and simply force TARGET to a register if it
4093 is a MEM; the optimizer is quite likely to sort it out. */
4094 if (ACCUMULATE_OUTGOING_ARGS
&& pass
&& MEM_P (target
))
4095 for (i
= 0; i
< num_actuals
; i
++)
4096 if (args
[i
].save_area
)
4103 target
= copy_to_reg (valreg
);
4106 /* TARGET and VALREG cannot be equal at this point
4107 because the latter would not have
4108 REG_FUNCTION_VALUE_P true, while the former would if
4109 it were referring to the same register.
4111 If they refer to the same register, this move will be
4112 a no-op, except when function inlining is being
4114 emit_move_insn (target
, valreg
);
4116 /* If we are setting a MEM, this code must be executed.
4117 Since it is emitted after the call insn, sibcall
4118 optimization cannot be performed in that case. */
4120 sibcall_failure
= 1;
4124 target
= copy_to_reg (avoid_likely_spilled_reg (valreg
));
4126 /* If we promoted this return value, make the proper SUBREG.
4127 TARGET might be const0_rtx here, so be careful. */
4129 && TYPE_MODE (rettype
) != BLKmode
4130 && GET_MODE (target
) != TYPE_MODE (rettype
))
4132 tree type
= rettype
;
4133 int unsignedp
= TYPE_UNSIGNED (type
);
4137 /* Ensure we promote as expected, and get the new unsignedness. */
4138 pmode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
4140 gcc_assert (GET_MODE (target
) == pmode
);
4142 if ((WORDS_BIG_ENDIAN
|| BYTES_BIG_ENDIAN
)
4143 && (GET_MODE_SIZE (GET_MODE (target
))
4144 > GET_MODE_SIZE (TYPE_MODE (type
))))
4146 offset
= GET_MODE_SIZE (GET_MODE (target
))
4147 - GET_MODE_SIZE (TYPE_MODE (type
));
4148 if (! BYTES_BIG_ENDIAN
)
4149 offset
= (offset
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
4150 else if (! WORDS_BIG_ENDIAN
)
4151 offset
%= UNITS_PER_WORD
;
4154 target
= gen_rtx_SUBREG (TYPE_MODE (type
), target
, offset
);
4155 SUBREG_PROMOTED_VAR_P (target
) = 1;
4156 SUBREG_PROMOTED_SET (target
, unsignedp
);
4159 /* If size of args is variable or this was a constructor call for a stack
4160 argument, restore saved stack-pointer value. */
4162 if (old_stack_level
)
4164 rtx_insn
*prev
= get_last_insn ();
4166 emit_stack_restore (SAVE_BLOCK
, old_stack_level
);
4167 stack_pointer_delta
= old_stack_pointer_delta
;
4169 fixup_args_size_notes (prev
, get_last_insn (), stack_pointer_delta
);
4171 pending_stack_adjust
= old_pending_adj
;
4172 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
4173 stack_arg_under_construction
= old_stack_arg_under_construction
;
4174 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
4175 stack_usage_map
= initial_stack_usage_map
;
4176 sibcall_failure
= 1;
4178 else if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
4180 #ifdef REG_PARM_STACK_SPACE
4182 restore_fixed_argument_area (save_area
, argblock
,
4183 high_to_save
, low_to_save
);
4186 /* If we saved any argument areas, restore them. */
4187 for (i
= 0; i
< num_actuals
; i
++)
4188 if (args
[i
].save_area
)
4190 machine_mode save_mode
= GET_MODE (args
[i
].save_area
);
4192 = gen_rtx_MEM (save_mode
,
4193 memory_address (save_mode
,
4194 XEXP (args
[i
].stack_slot
, 0)));
4196 if (save_mode
!= BLKmode
)
4197 emit_move_insn (stack_area
, args
[i
].save_area
);
4199 emit_block_move (stack_area
, args
[i
].save_area
,
4200 GEN_INT (args
[i
].locate
.size
.constant
),
4201 BLOCK_OP_CALL_PARM
);
4204 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
4205 stack_usage_map
= initial_stack_usage_map
;
4208 /* If this was alloca, record the new stack level. */
4209 if (flags
& ECF_MAY_BE_ALLOCA
)
4210 record_new_stack_level ();
4212 /* Free up storage we no longer need. */
4213 for (i
= 0; i
< num_actuals
; ++i
)
4214 free (args
[i
].aligned_regs
);
4216 targetm
.calls
.end_call_args ();
4218 insns
= get_insns ();
4223 tail_call_insns
= insns
;
4225 /* Restore the pending stack adjustment now that we have
4226 finished generating the sibling call sequence. */
4228 restore_pending_stack_adjust (&save
);
4230 /* Prepare arg structure for next iteration. */
4231 for (i
= 0; i
< num_actuals
; i
++)
4234 args
[i
].aligned_regs
= 0;
4238 sbitmap_free (stored_args_map
);
4239 internal_arg_pointer_exp_state
.scan_start
= NULL
;
4240 internal_arg_pointer_exp_state
.cache
.release ();
4244 normal_call_insns
= insns
;
4246 /* Verify that we've deallocated all the stack we used. */
4247 gcc_assert ((flags
& ECF_NORETURN
)
4248 || (old_stack_allocated
4249 == stack_pointer_delta
- pending_stack_adjust
));
4252 /* If something prevents making this a sibling call,
4253 zero out the sequence. */
4254 if (sibcall_failure
)
4255 tail_call_insns
= NULL
;
4260 /* If tail call production succeeded, we need to remove REG_EQUIV notes on
4261 arguments too, as argument area is now clobbered by the call. */
4262 if (tail_call_insns
)
4264 emit_insn (tail_call_insns
);
4265 crtl
->tail_call_emit
= true;
4269 emit_insn (normal_call_insns
);
4271 /* Ideally we'd emit a message for all of the ways that it could
4273 maybe_complain_about_tail_call (exp
, "tail call production failed");
4276 currently_expanding_call
--;
4278 free (stack_usage_map_buf
);
4281 /* Join result with returned bounds so caller may use them if needed. */
4282 target
= chkp_join_splitted_slot (target
, valbnd
);
4287 /* A sibling call sequence invalidates any REG_EQUIV notes made for
4288 this function's incoming arguments.
4290 At the start of RTL generation we know the only REG_EQUIV notes
4291 in the rtl chain are those for incoming arguments, so we can look
4292 for REG_EQUIV notes between the start of the function and the
4293 NOTE_INSN_FUNCTION_BEG.
4295 This is (slight) overkill. We could keep track of the highest
4296 argument we clobber and be more selective in removing notes, but it
4297 does not seem to be worth the effort. */
4300 fixup_tail_calls (void)
4304 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4308 /* There are never REG_EQUIV notes for the incoming arguments
4309 after the NOTE_INSN_FUNCTION_BEG note, so stop if we see it. */
4311 && NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
)
4314 note
= find_reg_note (insn
, REG_EQUIV
, 0);
4316 remove_note (insn
, note
);
4317 note
= find_reg_note (insn
, REG_EQUIV
, 0);
4322 /* Traverse a list of TYPES and expand all complex types into their
4325 split_complex_types (tree types
)
4329 /* Before allocating memory, check for the common case of no complex. */
4330 for (p
= types
; p
; p
= TREE_CHAIN (p
))
4332 tree type
= TREE_VALUE (p
);
4333 if (TREE_CODE (type
) == COMPLEX_TYPE
4334 && targetm
.calls
.split_complex_arg (type
))
4340 types
= copy_list (types
);
4342 for (p
= types
; p
; p
= TREE_CHAIN (p
))
4344 tree complex_type
= TREE_VALUE (p
);
4346 if (TREE_CODE (complex_type
) == COMPLEX_TYPE
4347 && targetm
.calls
.split_complex_arg (complex_type
))
4351 /* Rewrite complex type with component type. */
4352 TREE_VALUE (p
) = TREE_TYPE (complex_type
);
4353 next
= TREE_CHAIN (p
);
4355 /* Add another component type for the imaginary part. */
4356 imag
= build_tree_list (NULL_TREE
, TREE_VALUE (p
));
4357 TREE_CHAIN (p
) = imag
;
4358 TREE_CHAIN (imag
) = next
;
4360 /* Skip the newly created node. */
4368 /* Output a library call to function FUN (a SYMBOL_REF rtx).
4369 The RETVAL parameter specifies whether return value needs to be saved, other
4370 parameters are documented in the emit_library_call function below. */
4373 emit_library_call_value_1 (int retval
, rtx orgfun
, rtx value
,
4374 enum libcall_type fn_type
,
4375 machine_mode outmode
, int nargs
, va_list p
)
4377 /* Total size in bytes of all the stack-parms scanned so far. */
4378 struct args_size args_size
;
4379 /* Size of arguments before any adjustments (such as rounding). */
4380 struct args_size original_args_size
;
4383 /* Todo, choose the correct decl type of orgfun. Sadly this information
4384 isn't present here, so we default to native calling abi here. */
4385 tree fndecl ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
4386 tree fntype ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
4389 CUMULATIVE_ARGS args_so_far_v
;
4390 cumulative_args_t args_so_far
;
4397 struct locate_and_pad_arg_data locate
;
4401 int old_inhibit_defer_pop
= inhibit_defer_pop
;
4402 rtx call_fusage
= 0;
4405 int pcc_struct_value
= 0;
4406 int struct_value_size
= 0;
4408 int reg_parm_stack_space
= 0;
4410 rtx_insn
*before_call
;
4411 bool have_push_fusage
;
4412 tree tfom
; /* type_for_mode (outmode, 0) */
4414 #ifdef REG_PARM_STACK_SPACE
4415 /* Define the boundary of the register parm stack space that needs to be
4417 int low_to_save
= 0, high_to_save
= 0;
4418 rtx save_area
= 0; /* Place that it is saved. */
4421 /* Size of the stack reserved for parameter registers. */
4422 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
4423 char *initial_stack_usage_map
= stack_usage_map
;
4424 char *stack_usage_map_buf
= NULL
;
4426 rtx struct_value
= targetm
.calls
.struct_value_rtx (0, 0);
4428 #ifdef REG_PARM_STACK_SPACE
4429 reg_parm_stack_space
= REG_PARM_STACK_SPACE ((tree
) 0);
4432 /* By default, library functions cannot throw. */
4433 flags
= ECF_NOTHROW
;
4446 flags
|= ECF_NORETURN
;
4449 flags
&= ~ECF_NOTHROW
;
4451 case LCT_RETURNS_TWICE
:
4452 flags
= ECF_RETURNS_TWICE
;
4457 /* Ensure current function's preferred stack boundary is at least
4459 if (crtl
->preferred_stack_boundary
< PREFERRED_STACK_BOUNDARY
)
4460 crtl
->preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
4462 /* If this kind of value comes back in memory,
4463 decide where in memory it should come back. */
4464 if (outmode
!= VOIDmode
)
4466 tfom
= lang_hooks
.types
.type_for_mode (outmode
, 0);
4467 if (aggregate_value_p (tfom
, 0))
4469 #ifdef PCC_STATIC_STRUCT_RETURN
4471 = hard_function_value (build_pointer_type (tfom
), 0, 0, 0);
4472 mem_value
= gen_rtx_MEM (outmode
, pointer_reg
);
4473 pcc_struct_value
= 1;
4475 value
= gen_reg_rtx (outmode
);
4476 #else /* not PCC_STATIC_STRUCT_RETURN */
4477 struct_value_size
= GET_MODE_SIZE (outmode
);
4478 if (value
!= 0 && MEM_P (value
))
4481 mem_value
= assign_temp (tfom
, 1, 1);
4483 /* This call returns a big structure. */
4484 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
4488 tfom
= void_type_node
;
4490 /* ??? Unfinished: must pass the memory address as an argument. */
4492 /* Copy all the libcall-arguments out of the varargs data
4493 and into a vector ARGVEC.
4495 Compute how to pass each argument. We only support a very small subset
4496 of the full argument passing conventions to limit complexity here since
4497 library functions shouldn't have many args. */
4499 argvec
= XALLOCAVEC (struct arg
, nargs
+ 1);
4500 memset (argvec
, 0, (nargs
+ 1) * sizeof (struct arg
));
4502 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
4503 INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far_v
, outmode
, fun
);
4505 INIT_CUMULATIVE_ARGS (args_so_far_v
, NULL_TREE
, fun
, 0, nargs
);
4507 args_so_far
= pack_cumulative_args (&args_so_far_v
);
4509 args_size
.constant
= 0;
4516 /* If there's a structure value address to be passed,
4517 either pass it in the special place, or pass it as an extra argument. */
4518 if (mem_value
&& struct_value
== 0 && ! pcc_struct_value
)
4520 rtx addr
= XEXP (mem_value
, 0);
4524 /* Make sure it is a reasonable operand for a move or push insn. */
4525 if (!REG_P (addr
) && !MEM_P (addr
)
4526 && !(CONSTANT_P (addr
)
4527 && targetm
.legitimate_constant_p (Pmode
, addr
)))
4528 addr
= force_operand (addr
, NULL_RTX
);
4530 argvec
[count
].value
= addr
;
4531 argvec
[count
].mode
= Pmode
;
4532 argvec
[count
].partial
= 0;
4534 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
,
4535 Pmode
, NULL_TREE
, true);
4536 gcc_assert (targetm
.calls
.arg_partial_bytes (args_so_far
, Pmode
,
4537 NULL_TREE
, 1) == 0);
4539 locate_and_pad_parm (Pmode
, NULL_TREE
,
4540 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4543 argvec
[count
].reg
!= 0,
4545 reg_parm_stack_space
, 0,
4546 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
4548 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
4549 || reg_parm_stack_space
> 0)
4550 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
4552 targetm
.calls
.function_arg_advance (args_so_far
, Pmode
, (tree
) 0, true);
4557 for (; count
< nargs
; count
++)
4559 rtx val
= va_arg (p
, rtx
);
4560 machine_mode mode
= (machine_mode
) va_arg (p
, int);
4563 /* We cannot convert the arg value to the mode the library wants here;
4564 must do it earlier where we know the signedness of the arg. */
4565 gcc_assert (mode
!= BLKmode
4566 && (GET_MODE (val
) == mode
|| GET_MODE (val
) == VOIDmode
));
4568 /* Make sure it is a reasonable operand for a move or push insn. */
4569 if (!REG_P (val
) && !MEM_P (val
)
4570 && !(CONSTANT_P (val
) && targetm
.legitimate_constant_p (mode
, val
)))
4571 val
= force_operand (val
, NULL_RTX
);
4573 if (pass_by_reference (&args_so_far_v
, mode
, NULL_TREE
, 1))
4577 = !reference_callee_copied (&args_so_far_v
, mode
, NULL_TREE
, 1);
4579 /* If this was a CONST function, it is now PURE since it now
4581 if (flags
& ECF_CONST
)
4583 flags
&= ~ECF_CONST
;
4587 if (MEM_P (val
) && !must_copy
)
4589 tree val_expr
= MEM_EXPR (val
);
4591 mark_addressable (val_expr
);
4596 slot
= assign_temp (lang_hooks
.types
.type_for_mode (mode
, 0),
4598 emit_move_insn (slot
, val
);
4601 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
4602 gen_rtx_USE (VOIDmode
, slot
),
4605 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
4606 gen_rtx_CLOBBER (VOIDmode
,
4611 val
= force_operand (XEXP (slot
, 0), NULL_RTX
);
4614 mode
= promote_function_mode (NULL_TREE
, mode
, &unsigned_p
, NULL_TREE
, 0);
4615 argvec
[count
].mode
= mode
;
4616 argvec
[count
].value
= convert_modes (mode
, GET_MODE (val
), val
, unsigned_p
);
4617 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
4620 argvec
[count
].partial
4621 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, NULL_TREE
, 1);
4623 if (argvec
[count
].reg
== 0
4624 || argvec
[count
].partial
!= 0
4625 || reg_parm_stack_space
> 0)
4627 locate_and_pad_parm (mode
, NULL_TREE
,
4628 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4631 argvec
[count
].reg
!= 0,
4633 reg_parm_stack_space
, argvec
[count
].partial
,
4634 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
4635 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
4636 gcc_assert (!argvec
[count
].locate
.size
.var
);
4638 #ifdef BLOCK_REG_PADDING
4640 /* The argument is passed entirely in registers. See at which
4641 end it should be padded. */
4642 argvec
[count
].locate
.where_pad
=
4643 BLOCK_REG_PADDING (mode
, NULL_TREE
,
4644 GET_MODE_SIZE (mode
) <= UNITS_PER_WORD
);
4647 targetm
.calls
.function_arg_advance (args_so_far
, mode
, (tree
) 0, true);
4650 /* If this machine requires an external definition for library
4651 functions, write one out. */
4652 assemble_external_libcall (fun
);
4654 original_args_size
= args_size
;
4655 args_size
.constant
= (((args_size
.constant
4656 + stack_pointer_delta
4660 - stack_pointer_delta
);
4662 args_size
.constant
= MAX (args_size
.constant
,
4663 reg_parm_stack_space
);
4665 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
4666 args_size
.constant
-= reg_parm_stack_space
;
4668 if (args_size
.constant
> crtl
->outgoing_args_size
)
4669 crtl
->outgoing_args_size
= args_size
.constant
;
4671 if (flag_stack_usage_info
&& !ACCUMULATE_OUTGOING_ARGS
)
4673 int pushed
= args_size
.constant
+ pending_stack_adjust
;
4674 if (pushed
> current_function_pushed_stack_size
)
4675 current_function_pushed_stack_size
= pushed
;
4678 if (ACCUMULATE_OUTGOING_ARGS
)
4680 /* Since the stack pointer will never be pushed, it is possible for
4681 the evaluation of a parm to clobber something we have already
4682 written to the stack. Since most function calls on RISC machines
4683 do not use the stack, this is uncommon, but must work correctly.
4685 Therefore, we save any area of the stack that was already written
4686 and that we are using. Here we set up to do this by making a new
4687 stack usage map from the old one.
4689 Another approach might be to try to reorder the argument
4690 evaluations to avoid this conflicting stack usage. */
4692 needed
= args_size
.constant
;
4694 /* Since we will be writing into the entire argument area, the
4695 map must be allocated for its entire size, not just the part that
4696 is the responsibility of the caller. */
4697 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
4698 needed
+= reg_parm_stack_space
;
4700 if (ARGS_GROW_DOWNWARD
)
4701 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
4704 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
, needed
);
4706 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
4707 stack_usage_map
= stack_usage_map_buf
;
4709 if (initial_highest_arg_in_use
)
4710 memcpy (stack_usage_map
, initial_stack_usage_map
,
4711 initial_highest_arg_in_use
);
4713 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
4714 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
4715 highest_outgoing_arg_in_use
- initial_highest_arg_in_use
);
4718 /* We must be careful to use virtual regs before they're instantiated,
4719 and real regs afterwards. Loop optimization, for example, can create
4720 new libcalls after we've instantiated the virtual regs, and if we
4721 use virtuals anyway, they won't match the rtl patterns. */
4723 if (virtuals_instantiated
)
4724 argblock
= plus_constant (Pmode
, stack_pointer_rtx
,
4725 STACK_POINTER_OFFSET
);
4727 argblock
= virtual_outgoing_args_rtx
;
4732 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
4735 /* We push args individually in reverse order, perform stack alignment
4736 before the first push (the last arg). */
4738 anti_adjust_stack (GEN_INT (args_size
.constant
4739 - original_args_size
.constant
));
4743 #ifdef REG_PARM_STACK_SPACE
4744 if (ACCUMULATE_OUTGOING_ARGS
)
4746 /* The argument list is the property of the called routine and it
4747 may clobber it. If the fixed area has been used for previous
4748 parameters, we must save and restore it. */
4749 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
4750 &low_to_save
, &high_to_save
);
4754 /* When expanding a normal call, args are stored in push order,
4755 which is the reverse of what we have here. */
4756 bool any_regs
= false;
4757 for (int i
= nargs
; i
-- > 0; )
4758 if (argvec
[i
].reg
!= NULL_RTX
)
4760 targetm
.calls
.call_args (argvec
[i
].reg
, NULL_TREE
);
4764 targetm
.calls
.call_args (pc_rtx
, NULL_TREE
);
4766 /* Push the args that need to be pushed. */
4768 have_push_fusage
= false;
4770 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4771 are to be pushed. */
4772 for (count
= 0; count
< nargs
; count
++, argnum
--)
4774 machine_mode mode
= argvec
[argnum
].mode
;
4775 rtx val
= argvec
[argnum
].value
;
4776 rtx reg
= argvec
[argnum
].reg
;
4777 int partial
= argvec
[argnum
].partial
;
4778 unsigned int parm_align
= argvec
[argnum
].locate
.boundary
;
4779 int lower_bound
= 0, upper_bound
= 0, i
;
4781 if (! (reg
!= 0 && partial
== 0))
4785 if (ACCUMULATE_OUTGOING_ARGS
)
4787 /* If this is being stored into a pre-allocated, fixed-size,
4788 stack area, save any previous data at that location. */
4790 if (ARGS_GROW_DOWNWARD
)
4792 /* stack_slot is negative, but we want to index stack_usage_map
4793 with positive values. */
4794 upper_bound
= -argvec
[argnum
].locate
.slot_offset
.constant
+ 1;
4795 lower_bound
= upper_bound
- argvec
[argnum
].locate
.size
.constant
;
4799 lower_bound
= argvec
[argnum
].locate
.slot_offset
.constant
;
4800 upper_bound
= lower_bound
+ argvec
[argnum
].locate
.size
.constant
;
4804 /* Don't worry about things in the fixed argument area;
4805 it has already been saved. */
4806 if (i
< reg_parm_stack_space
)
4807 i
= reg_parm_stack_space
;
4808 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
4811 if (i
< upper_bound
)
4813 /* We need to make a save area. */
4815 = argvec
[argnum
].locate
.size
.constant
* BITS_PER_UNIT
;
4816 machine_mode save_mode
4817 = mode_for_size (size
, MODE_INT
, 1);
4819 = plus_constant (Pmode
, argblock
,
4820 argvec
[argnum
].locate
.offset
.constant
);
4822 = gen_rtx_MEM (save_mode
, memory_address (save_mode
, adr
));
4824 if (save_mode
== BLKmode
)
4826 argvec
[argnum
].save_area
4827 = assign_stack_temp (BLKmode
,
4828 argvec
[argnum
].locate
.size
.constant
4831 emit_block_move (validize_mem
4832 (copy_rtx (argvec
[argnum
].save_area
)),
4834 GEN_INT (argvec
[argnum
].locate
.size
.constant
),
4835 BLOCK_OP_CALL_PARM
);
4839 argvec
[argnum
].save_area
= gen_reg_rtx (save_mode
);
4841 emit_move_insn (argvec
[argnum
].save_area
, stack_area
);
4846 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, parm_align
,
4847 partial
, reg
, 0, argblock
,
4848 GEN_INT (argvec
[argnum
].locate
.offset
.constant
),
4849 reg_parm_stack_space
,
4850 ARGS_SIZE_RTX (argvec
[argnum
].locate
.alignment_pad
), false);
4852 /* Now mark the segment we just used. */
4853 if (ACCUMULATE_OUTGOING_ARGS
)
4854 for (i
= lower_bound
; i
< upper_bound
; i
++)
4855 stack_usage_map
[i
] = 1;
4859 /* Indicate argument access so that alias.c knows that these
4862 use
= plus_constant (Pmode
, argblock
,
4863 argvec
[argnum
].locate
.offset
.constant
);
4864 else if (have_push_fusage
)
4868 /* When arguments are pushed, trying to tell alias.c where
4869 exactly this argument is won't work, because the
4870 auto-increment causes confusion. So we merely indicate
4871 that we access something with a known mode somewhere on
4873 use
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
4874 gen_rtx_SCRATCH (Pmode
));
4875 have_push_fusage
= true;
4877 use
= gen_rtx_MEM (argvec
[argnum
].mode
, use
);
4878 use
= gen_rtx_USE (VOIDmode
, use
);
4879 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
, use
, call_fusage
);
4885 fun
= prepare_call_address (NULL
, fun
, NULL
, &call_fusage
, 0, 0);
4887 /* Now load any reg parms into their regs. */
4889 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4890 are to be pushed. */
4891 for (count
= 0; count
< nargs
; count
++, argnum
--)
4893 machine_mode mode
= argvec
[argnum
].mode
;
4894 rtx val
= argvec
[argnum
].value
;
4895 rtx reg
= argvec
[argnum
].reg
;
4896 int partial
= argvec
[argnum
].partial
;
4897 #ifdef BLOCK_REG_PADDING
4901 /* Handle calls that pass values in multiple non-contiguous
4902 locations. The PA64 has examples of this for library calls. */
4903 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4904 emit_group_load (reg
, val
, NULL_TREE
, GET_MODE_SIZE (mode
));
4905 else if (reg
!= 0 && partial
== 0)
4907 emit_move_insn (reg
, val
);
4908 #ifdef BLOCK_REG_PADDING
4909 size
= GET_MODE_SIZE (argvec
[argnum
].mode
);
4911 /* Copied from load_register_parameters. */
4913 /* Handle case where we have a value that needs shifting
4914 up to the msb. eg. a QImode value and we're padding
4915 upward on a BYTES_BIG_ENDIAN machine. */
4916 if (size
< UNITS_PER_WORD
4917 && (argvec
[argnum
].locate
.where_pad
4918 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
4921 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
4923 /* Assigning REG here rather than a temp makes CALL_FUSAGE
4924 report the whole reg as used. Strictly speaking, the
4925 call only uses SIZE bytes at the msb end, but it doesn't
4926 seem worth generating rtl to say that. */
4927 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
4928 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, shift
, reg
, 1);
4930 emit_move_insn (reg
, x
);
4938 /* Any regs containing parms remain in use through the call. */
4939 for (count
= 0; count
< nargs
; count
++)
4941 rtx reg
= argvec
[count
].reg
;
4942 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4943 use_group_regs (&call_fusage
, reg
);
4946 int partial
= argvec
[count
].partial
;
4950 gcc_assert (partial
% UNITS_PER_WORD
== 0);
4951 nregs
= partial
/ UNITS_PER_WORD
;
4952 use_regs (&call_fusage
, REGNO (reg
), nregs
);
4955 use_reg (&call_fusage
, reg
);
4959 /* Pass the function the address in which to return a structure value. */
4960 if (mem_value
!= 0 && struct_value
!= 0 && ! pcc_struct_value
)
4962 emit_move_insn (struct_value
,
4964 force_operand (XEXP (mem_value
, 0),
4966 if (REG_P (struct_value
))
4967 use_reg (&call_fusage
, struct_value
);
4970 /* Don't allow popping to be deferred, since then
4971 cse'ing of library calls could delete a call and leave the pop. */
4973 valreg
= (mem_value
== 0 && outmode
!= VOIDmode
4974 ? hard_libcall_value (outmode
, orgfun
) : NULL_RTX
);
4976 /* Stack must be properly aligned now. */
4977 gcc_assert (!(stack_pointer_delta
4978 & (PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
- 1)));
4980 before_call
= get_last_insn ();
4982 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4983 will set inhibit_defer_pop to that value. */
4984 /* The return type is needed to decide how many bytes the function pops.
4985 Signedness plays no role in that, so for simplicity, we pretend it's
4986 always signed. We also assume that the list of arguments passed has
4987 no impact, so we pretend it is unknown. */
4989 emit_call_1 (fun
, NULL
,
4990 get_identifier (XSTR (orgfun
, 0)),
4991 build_function_type (tfom
, NULL_TREE
),
4992 original_args_size
.constant
, args_size
.constant
,
4994 targetm
.calls
.function_arg (args_so_far
,
4995 VOIDmode
, void_type_node
, true),
4997 old_inhibit_defer_pop
+ 1, call_fusage
, flags
, args_so_far
);
5002 gcc_assert (GET_CODE (datum
) == SYMBOL_REF
);
5003 rtx_call_insn
*last
= last_call_insn ();
5004 add_reg_note (last
, REG_CALL_DECL
, datum
);
5007 /* Right-shift returned value if necessary. */
5008 if (!pcc_struct_value
5009 && TYPE_MODE (tfom
) != BLKmode
5010 && targetm
.calls
.return_in_msb (tfom
))
5012 shift_return_value (TYPE_MODE (tfom
), false, valreg
);
5013 valreg
= gen_rtx_REG (TYPE_MODE (tfom
), REGNO (valreg
));
5016 targetm
.calls
.end_call_args ();
5018 /* For calls to `setjmp', etc., inform function.c:setjmp_warnings
5019 that it should complain if nonvolatile values are live. For
5020 functions that cannot return, inform flow that control does not
5022 if (flags
& ECF_NORETURN
)
5024 /* The barrier note must be emitted
5025 immediately after the CALL_INSN. Some ports emit more than
5026 just a CALL_INSN above, so we must search for it here. */
5027 rtx_insn
*last
= get_last_insn ();
5028 while (!CALL_P (last
))
5030 last
= PREV_INSN (last
);
5031 /* There was no CALL_INSN? */
5032 gcc_assert (last
!= before_call
);
5035 emit_barrier_after (last
);
5038 /* Consider that "regular" libcalls, i.e. all of them except for LCT_THROW
5039 and LCT_RETURNS_TWICE, cannot perform non-local gotos. */
5040 if (flags
& ECF_NOTHROW
)
5042 rtx_insn
*last
= get_last_insn ();
5043 while (!CALL_P (last
))
5045 last
= PREV_INSN (last
);
5046 /* There was no CALL_INSN? */
5047 gcc_assert (last
!= before_call
);
5050 make_reg_eh_region_note_nothrow_nononlocal (last
);
5053 /* Now restore inhibit_defer_pop to its actual original value. */
5058 /* Copy the value to the right place. */
5059 if (outmode
!= VOIDmode
&& retval
)
5065 if (value
!= mem_value
)
5066 emit_move_insn (value
, mem_value
);
5068 else if (GET_CODE (valreg
) == PARALLEL
)
5071 value
= gen_reg_rtx (outmode
);
5072 emit_group_store (value
, valreg
, NULL_TREE
, GET_MODE_SIZE (outmode
));
5076 /* Convert to the proper mode if a promotion has been active. */
5077 if (GET_MODE (valreg
) != outmode
)
5079 int unsignedp
= TYPE_UNSIGNED (tfom
);
5081 gcc_assert (promote_function_mode (tfom
, outmode
, &unsignedp
,
5082 fndecl
? TREE_TYPE (fndecl
) : fntype
, 1)
5083 == GET_MODE (valreg
));
5084 valreg
= convert_modes (outmode
, GET_MODE (valreg
), valreg
, 0);
5088 emit_move_insn (value
, valreg
);
5094 if (ACCUMULATE_OUTGOING_ARGS
)
5096 #ifdef REG_PARM_STACK_SPACE
5098 restore_fixed_argument_area (save_area
, argblock
,
5099 high_to_save
, low_to_save
);
5102 /* If we saved any argument areas, restore them. */
5103 for (count
= 0; count
< nargs
; count
++)
5104 if (argvec
[count
].save_area
)
5106 machine_mode save_mode
= GET_MODE (argvec
[count
].save_area
);
5107 rtx adr
= plus_constant (Pmode
, argblock
,
5108 argvec
[count
].locate
.offset
.constant
);
5109 rtx stack_area
= gen_rtx_MEM (save_mode
,
5110 memory_address (save_mode
, adr
));
5112 if (save_mode
== BLKmode
)
5113 emit_block_move (stack_area
,
5115 (copy_rtx (argvec
[count
].save_area
)),
5116 GEN_INT (argvec
[count
].locate
.size
.constant
),
5117 BLOCK_OP_CALL_PARM
);
5119 emit_move_insn (stack_area
, argvec
[count
].save_area
);
5122 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
5123 stack_usage_map
= initial_stack_usage_map
;
5126 free (stack_usage_map_buf
);
5132 /* Output a library call to function FUN (a SYMBOL_REF rtx)
5133 (emitting the queue unless NO_QUEUE is nonzero),
5134 for a value of mode OUTMODE,
5135 with NARGS different arguments, passed as alternating rtx values
5136 and machine_modes to convert them to.
5138 FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for
5139 `const' calls, LCT_PURE for `pure' calls, or other LCT_ value for
5140 other types of library calls. */
5143 emit_library_call (rtx orgfun
, enum libcall_type fn_type
,
5144 machine_mode outmode
, int nargs
, ...)
5148 va_start (p
, nargs
);
5149 emit_library_call_value_1 (0, orgfun
, NULL_RTX
, fn_type
, outmode
, nargs
, p
);
5153 /* Like emit_library_call except that an extra argument, VALUE,
5154 comes second and says where to store the result.
5155 (If VALUE is zero, this function chooses a convenient way
5156 to return the value.
5158 This function returns an rtx for where the value is to be found.
5159 If VALUE is nonzero, VALUE is returned. */
5162 emit_library_call_value (rtx orgfun
, rtx value
,
5163 enum libcall_type fn_type
,
5164 machine_mode outmode
, int nargs
, ...)
5169 va_start (p
, nargs
);
5170 result
= emit_library_call_value_1 (1, orgfun
, value
, fn_type
, outmode
,
5178 /* Store pointer bounds argument ARG into Bounds Table entry
5179 associated with PARM. */
5181 store_bounds (struct arg_data
*arg
, struct arg_data
*parm
)
5183 rtx slot
= NULL
, ptr
= NULL
, addr
= NULL
;
5185 /* We may pass bounds not associated with any pointer. */
5188 gcc_assert (arg
->special_slot
);
5189 slot
= arg
->special_slot
;
5192 /* Find pointer associated with bounds and where it is
5198 gcc_assert (!arg
->special_slot
);
5200 addr
= adjust_address (parm
->stack
, Pmode
, arg
->pointer_offset
);
5202 else if (REG_P (parm
->reg
))
5204 gcc_assert (arg
->special_slot
);
5205 slot
= arg
->special_slot
;
5207 if (MEM_P (parm
->value
))
5208 addr
= adjust_address (parm
->value
, Pmode
, arg
->pointer_offset
);
5209 else if (REG_P (parm
->value
))
5210 ptr
= gen_rtx_SUBREG (Pmode
, parm
->value
, arg
->pointer_offset
);
5213 gcc_assert (!arg
->pointer_offset
);
5219 gcc_assert (GET_CODE (parm
->reg
) == PARALLEL
);
5221 gcc_assert (arg
->special_slot
);
5222 slot
= arg
->special_slot
;
5224 if (parm
->parallel_value
)
5225 ptr
= chkp_get_value_with_offs (parm
->parallel_value
,
5226 GEN_INT (arg
->pointer_offset
));
5232 /* Expand bounds. */
5234 arg
->value
= expand_normal (arg
->tree_value
);
5236 targetm
.calls
.store_bounds_for_arg (ptr
, addr
, arg
->value
, slot
);
5239 /* Store a single argument for a function call
5240 into the register or memory area where it must be passed.
5241 *ARG describes the argument value and where to pass it.
5243 ARGBLOCK is the address of the stack-block for all the arguments,
5244 or 0 on a machine where arguments are pushed individually.
5246 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
5247 so must be careful about how the stack is used.
5249 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
5250 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
5251 that we need not worry about saving and restoring the stack.
5253 FNDECL is the declaration of the function we are calling.
5255 Return nonzero if this arg should cause sibcall failure,
5259 store_one_arg (struct arg_data
*arg
, rtx argblock
, int flags
,
5260 int variable_size ATTRIBUTE_UNUSED
, int reg_parm_stack_space
)
5262 tree pval
= arg
->tree_value
;
5266 int i
, lower_bound
= 0, upper_bound
= 0;
5267 int sibcall_failure
= 0;
5269 if (TREE_CODE (pval
) == ERROR_MARK
)
5272 /* Push a new temporary level for any temporaries we make for
5276 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
))
5278 /* If this is being stored into a pre-allocated, fixed-size, stack area,
5279 save any previous data at that location. */
5280 if (argblock
&& ! variable_size
&& arg
->stack
)
5282 if (ARGS_GROW_DOWNWARD
)
5284 /* stack_slot is negative, but we want to index stack_usage_map
5285 with positive values. */
5286 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
5287 upper_bound
= -INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1)) + 1;
5291 lower_bound
= upper_bound
- arg
->locate
.size
.constant
;
5295 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
5296 lower_bound
= INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1));
5300 upper_bound
= lower_bound
+ arg
->locate
.size
.constant
;
5304 /* Don't worry about things in the fixed argument area;
5305 it has already been saved. */
5306 if (i
< reg_parm_stack_space
)
5307 i
= reg_parm_stack_space
;
5308 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
5311 if (i
< upper_bound
)
5313 /* We need to make a save area. */
5314 unsigned int size
= arg
->locate
.size
.constant
* BITS_PER_UNIT
;
5315 machine_mode save_mode
= mode_for_size (size
, MODE_INT
, 1);
5316 rtx adr
= memory_address (save_mode
, XEXP (arg
->stack_slot
, 0));
5317 rtx stack_area
= gen_rtx_MEM (save_mode
, adr
);
5319 if (save_mode
== BLKmode
)
5322 = assign_temp (TREE_TYPE (arg
->tree_value
), 1, 1);
5323 preserve_temp_slots (arg
->save_area
);
5324 emit_block_move (validize_mem (copy_rtx (arg
->save_area
)),
5326 GEN_INT (arg
->locate
.size
.constant
),
5327 BLOCK_OP_CALL_PARM
);
5331 arg
->save_area
= gen_reg_rtx (save_mode
);
5332 emit_move_insn (arg
->save_area
, stack_area
);
5338 /* If this isn't going to be placed on both the stack and in registers,
5339 set up the register and number of words. */
5340 if (! arg
->pass_on_stack
)
5342 if (flags
& ECF_SIBCALL
)
5343 reg
= arg
->tail_call_reg
;
5346 partial
= arg
->partial
;
5349 /* Being passed entirely in a register. We shouldn't be called in
5351 gcc_assert (reg
== 0 || partial
!= 0);
5353 /* If this arg needs special alignment, don't load the registers
5355 if (arg
->n_aligned_regs
!= 0)
5358 /* If this is being passed partially in a register, we can't evaluate
5359 it directly into its stack slot. Otherwise, we can. */
5360 if (arg
->value
== 0)
5362 /* stack_arg_under_construction is nonzero if a function argument is
5363 being evaluated directly into the outgoing argument list and
5364 expand_call must take special action to preserve the argument list
5365 if it is called recursively.
5367 For scalar function arguments stack_usage_map is sufficient to
5368 determine which stack slots must be saved and restored. Scalar
5369 arguments in general have pass_on_stack == 0.
5371 If this argument is initialized by a function which takes the
5372 address of the argument (a C++ constructor or a C function
5373 returning a BLKmode structure), then stack_usage_map is
5374 insufficient and expand_call must push the stack around the
5375 function call. Such arguments have pass_on_stack == 1.
5377 Note that it is always safe to set stack_arg_under_construction,
5378 but this generates suboptimal code if set when not needed. */
5380 if (arg
->pass_on_stack
)
5381 stack_arg_under_construction
++;
5383 arg
->value
= expand_expr (pval
,
5385 || TYPE_MODE (TREE_TYPE (pval
)) != arg
->mode
)
5386 ? NULL_RTX
: arg
->stack
,
5387 VOIDmode
, EXPAND_STACK_PARM
);
5389 /* If we are promoting object (or for any other reason) the mode
5390 doesn't agree, convert the mode. */
5392 if (arg
->mode
!= TYPE_MODE (TREE_TYPE (pval
)))
5393 arg
->value
= convert_modes (arg
->mode
, TYPE_MODE (TREE_TYPE (pval
)),
5394 arg
->value
, arg
->unsignedp
);
5396 if (arg
->pass_on_stack
)
5397 stack_arg_under_construction
--;
5400 /* Check for overlap with already clobbered argument area. */
5401 if ((flags
& ECF_SIBCALL
)
5402 && MEM_P (arg
->value
)
5403 && mem_overlaps_already_clobbered_arg_p (XEXP (arg
->value
, 0),
5404 arg
->locate
.size
.constant
))
5405 sibcall_failure
= 1;
5407 /* Don't allow anything left on stack from computation
5408 of argument to alloca. */
5409 if (flags
& ECF_MAY_BE_ALLOCA
)
5410 do_pending_stack_adjust ();
5412 if (arg
->value
== arg
->stack
)
5413 /* If the value is already in the stack slot, we are done. */
5415 else if (arg
->mode
!= BLKmode
)
5418 unsigned int parm_align
;
5420 /* Argument is a scalar, not entirely passed in registers.
5421 (If part is passed in registers, arg->partial says how much
5422 and emit_push_insn will take care of putting it there.)
5424 Push it, and if its size is less than the
5425 amount of space allocated to it,
5426 also bump stack pointer by the additional space.
5427 Note that in C the default argument promotions
5428 will prevent such mismatches. */
5430 size
= GET_MODE_SIZE (arg
->mode
);
5431 /* Compute how much space the push instruction will push.
5432 On many machines, pushing a byte will advance the stack
5433 pointer by a halfword. */
5434 #ifdef PUSH_ROUNDING
5435 size
= PUSH_ROUNDING (size
);
5439 /* Compute how much space the argument should get:
5440 round up to a multiple of the alignment for arguments. */
5441 if (none
!= FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)))
5442 used
= (((size
+ PARM_BOUNDARY
/ BITS_PER_UNIT
- 1)
5443 / (PARM_BOUNDARY
/ BITS_PER_UNIT
))
5444 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
5446 /* Compute the alignment of the pushed argument. */
5447 parm_align
= arg
->locate
.boundary
;
5448 if (FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)) == downward
)
5450 int pad
= used
- size
;
5453 unsigned int pad_align
= least_bit_hwi (pad
) * BITS_PER_UNIT
;
5454 parm_align
= MIN (parm_align
, pad_align
);
5458 /* This isn't already where we want it on the stack, so put it there.
5459 This can either be done with push or copy insns. */
5460 if (!emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), NULL_RTX
,
5461 parm_align
, partial
, reg
, used
- size
, argblock
,
5462 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
5463 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
), true))
5464 sibcall_failure
= 1;
5466 /* Unless this is a partially-in-register argument, the argument is now
5469 arg
->value
= arg
->stack
;
5473 /* BLKmode, at least partly to be pushed. */
5475 unsigned int parm_align
;
5479 /* Pushing a nonscalar.
5480 If part is passed in registers, PARTIAL says how much
5481 and emit_push_insn will take care of putting it there. */
5483 /* Round its size up to a multiple
5484 of the allocation unit for arguments. */
5486 if (arg
->locate
.size
.var
!= 0)
5489 size_rtx
= ARGS_SIZE_RTX (arg
->locate
.size
);
5493 /* PUSH_ROUNDING has no effect on us, because emit_push_insn
5494 for BLKmode is careful to avoid it. */
5495 excess
= (arg
->locate
.size
.constant
5496 - int_size_in_bytes (TREE_TYPE (pval
))
5498 size_rtx
= expand_expr (size_in_bytes (TREE_TYPE (pval
)),
5499 NULL_RTX
, TYPE_MODE (sizetype
),
5503 parm_align
= arg
->locate
.boundary
;
5505 /* When an argument is padded down, the block is aligned to
5506 PARM_BOUNDARY, but the actual argument isn't. */
5507 if (FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)) == downward
)
5509 if (arg
->locate
.size
.var
)
5510 parm_align
= BITS_PER_UNIT
;
5513 unsigned int excess_align
= least_bit_hwi (excess
) * BITS_PER_UNIT
;
5514 parm_align
= MIN (parm_align
, excess_align
);
5518 if ((flags
& ECF_SIBCALL
) && MEM_P (arg
->value
))
5520 /* emit_push_insn might not work properly if arg->value and
5521 argblock + arg->locate.offset areas overlap. */
5525 if (XEXP (x
, 0) == crtl
->args
.internal_arg_pointer
5526 || (GET_CODE (XEXP (x
, 0)) == PLUS
5527 && XEXP (XEXP (x
, 0), 0) ==
5528 crtl
->args
.internal_arg_pointer
5529 && CONST_INT_P (XEXP (XEXP (x
, 0), 1))))
5531 if (XEXP (x
, 0) != crtl
->args
.internal_arg_pointer
)
5532 i
= INTVAL (XEXP (XEXP (x
, 0), 1));
5534 /* arg.locate doesn't contain the pretend_args_size offset,
5535 it's part of argblock. Ensure we don't count it in I. */
5536 if (STACK_GROWS_DOWNWARD
)
5537 i
-= crtl
->args
.pretend_args_size
;
5539 i
+= crtl
->args
.pretend_args_size
;
5541 /* expand_call should ensure this. */
5542 gcc_assert (!arg
->locate
.offset
.var
5543 && arg
->locate
.size
.var
== 0
5544 && CONST_INT_P (size_rtx
));
5546 if (arg
->locate
.offset
.constant
> i
)
5548 if (arg
->locate
.offset
.constant
< i
+ INTVAL (size_rtx
))
5549 sibcall_failure
= 1;
5551 else if (arg
->locate
.offset
.constant
< i
)
5553 /* Use arg->locate.size.constant instead of size_rtx
5554 because we only care about the part of the argument
5556 if (i
< (arg
->locate
.offset
.constant
5557 + arg
->locate
.size
.constant
))
5558 sibcall_failure
= 1;
5562 /* Even though they appear to be at the same location,
5563 if part of the outgoing argument is in registers,
5564 they aren't really at the same location. Check for
5565 this by making sure that the incoming size is the
5566 same as the outgoing size. */
5567 if (arg
->locate
.size
.constant
!= INTVAL (size_rtx
))
5568 sibcall_failure
= 1;
5573 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx
,
5574 parm_align
, partial
, reg
, excess
, argblock
,
5575 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
5576 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
), false);
5578 /* Unless this is a partially-in-register argument, the argument is now
5581 ??? Unlike the case above, in which we want the actual
5582 address of the data, so that we can load it directly into a
5583 register, here we want the address of the stack slot, so that
5584 it's properly aligned for word-by-word copying or something
5585 like that. It's not clear that this is always correct. */
5587 arg
->value
= arg
->stack_slot
;
5590 if (arg
->reg
&& GET_CODE (arg
->reg
) == PARALLEL
)
5592 tree type
= TREE_TYPE (arg
->tree_value
);
5594 = emit_group_load_into_temps (arg
->reg
, arg
->value
, type
,
5595 int_size_in_bytes (type
));
5598 /* Mark all slots this store used. */
5599 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
)
5600 && argblock
&& ! variable_size
&& arg
->stack
)
5601 for (i
= lower_bound
; i
< upper_bound
; i
++)
5602 stack_usage_map
[i
] = 1;
5604 /* Once we have pushed something, pops can't safely
5605 be deferred during the rest of the arguments. */
5608 /* Free any temporary slots made in processing this argument. */
5611 return sibcall_failure
;
5614 /* Nonzero if we do not know how to pass TYPE solely in registers. */
5617 must_pass_in_stack_var_size (machine_mode mode ATTRIBUTE_UNUSED
,
5623 /* If the type has variable size... */
5624 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
5627 /* If the type is marked as addressable (it is required
5628 to be constructed into the stack)... */
5629 if (TREE_ADDRESSABLE (type
))
5635 /* Another version of the TARGET_MUST_PASS_IN_STACK hook. This one
5636 takes trailing padding of a structure into account. */
5637 /* ??? Should be able to merge these two by examining BLOCK_REG_PADDING. */
5640 must_pass_in_stack_var_size_or_pad (machine_mode mode
, const_tree type
)
5645 /* If the type has variable size... */
5646 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
5649 /* If the type is marked as addressable (it is required
5650 to be constructed into the stack)... */
5651 if (TREE_ADDRESSABLE (type
))
5654 /* If the padding and mode of the type is such that a copy into
5655 a register would put it into the wrong part of the register. */
5657 && int_size_in_bytes (type
) % (PARM_BOUNDARY
/ BITS_PER_UNIT
)
5658 && (FUNCTION_ARG_PADDING (mode
, type
)
5659 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
5665 /* Tell the garbage collector about GTY markers in this source file. */
5666 #include "gt-calls.h"