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 int special_function_p (const_tree
, int);
168 static int check_sibcall_argument_overlap_1 (rtx
);
169 static int check_sibcall_argument_overlap (rtx_insn
*, struct arg_data
*, int);
171 static int combine_pending_stack_adjustment_and_call (int, struct args_size
*,
173 static tree
split_complex_types (tree
);
175 #ifdef REG_PARM_STACK_SPACE
176 static rtx
save_fixed_argument_area (int, rtx
, int *, int *);
177 static void restore_fixed_argument_area (rtx
, rtx
, int, int);
180 /* Force FUNEXP into a form suitable for the address of a CALL,
181 and return that as an rtx. Also load the static chain register
182 if FNDECL is a nested function.
184 CALL_FUSAGE points to a variable holding the prospective
185 CALL_INSN_FUNCTION_USAGE information. */
188 prepare_call_address (tree fndecl_or_type
, rtx funexp
, rtx static_chain_value
,
189 rtx
*call_fusage
, int reg_parm_seen
, int flags
)
191 /* Make a valid memory address and copy constants through pseudo-regs,
192 but not for a constant address if -fno-function-cse. */
193 if (GET_CODE (funexp
) != SYMBOL_REF
)
195 /* If it's an indirect call by descriptor, generate code to perform
196 runtime identification of the pointer and load the descriptor. */
197 if ((flags
& ECF_BY_DESCRIPTOR
) && !flag_trampolines
)
199 const int bit_val
= targetm
.calls
.custom_function_descriptors
;
200 rtx call_lab
= gen_label_rtx ();
202 gcc_assert (fndecl_or_type
&& TYPE_P (fndecl_or_type
));
204 = build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
, NULL_TREE
,
206 DECL_STATIC_CHAIN (fndecl_or_type
) = 1;
207 rtx chain
= targetm
.calls
.static_chain (fndecl_or_type
, false);
209 if (GET_MODE (funexp
) != Pmode
)
210 funexp
= convert_memory_address (Pmode
, funexp
);
212 /* Avoid long live ranges around function calls. */
213 funexp
= copy_to_mode_reg (Pmode
, funexp
);
216 emit_insn (gen_rtx_CLOBBER (VOIDmode
, chain
));
218 /* Emit the runtime identification pattern. */
219 rtx mask
= gen_rtx_AND (Pmode
, funexp
, GEN_INT (bit_val
));
220 emit_cmp_and_jump_insns (mask
, const0_rtx
, EQ
, NULL_RTX
, Pmode
, 1,
223 /* Statically predict the branch to very likely taken. */
224 rtx_insn
*insn
= get_last_insn ();
226 predict_insn_def (insn
, PRED_BUILTIN_EXPECT
, TAKEN
);
228 /* Load the descriptor. */
229 rtx mem
= gen_rtx_MEM (ptr_mode
,
230 plus_constant (Pmode
, funexp
, - bit_val
));
231 MEM_NOTRAP_P (mem
) = 1;
232 mem
= convert_memory_address (Pmode
, mem
);
233 emit_move_insn (chain
, mem
);
235 mem
= gen_rtx_MEM (ptr_mode
,
236 plus_constant (Pmode
, funexp
,
237 POINTER_SIZE
/ BITS_PER_UNIT
239 MEM_NOTRAP_P (mem
) = 1;
240 mem
= convert_memory_address (Pmode
, mem
);
241 emit_move_insn (funexp
, mem
);
243 emit_label (call_lab
);
247 use_reg (call_fusage
, chain
);
248 STATIC_CHAIN_REG_P (chain
) = 1;
251 /* Make sure we're not going to be overwritten below. */
252 gcc_assert (!static_chain_value
);
255 /* If we are using registers for parameters, force the
256 function address into a register now. */
257 funexp
= ((reg_parm_seen
258 && targetm
.small_register_classes_for_mode_p (FUNCTION_MODE
))
259 ? force_not_mem (memory_address (FUNCTION_MODE
, funexp
))
260 : memory_address (FUNCTION_MODE
, funexp
));
264 /* funexp could be a SYMBOL_REF represents a function pointer which is
265 of ptr_mode. In this case, it should be converted into address mode
266 to be a valid address for memory rtx pattern. See PR 64971. */
267 if (GET_MODE (funexp
) != Pmode
)
268 funexp
= convert_memory_address (Pmode
, funexp
);
270 if (!(flags
& ECF_SIBCALL
))
272 if (!NO_FUNCTION_CSE
&& optimize
&& ! flag_no_function_cse
)
273 funexp
= force_reg (Pmode
, funexp
);
277 if (static_chain_value
!= 0
278 && (TREE_CODE (fndecl_or_type
) != FUNCTION_DECL
279 || DECL_STATIC_CHAIN (fndecl_or_type
)))
283 chain
= targetm
.calls
.static_chain (fndecl_or_type
, false);
284 static_chain_value
= convert_memory_address (Pmode
, static_chain_value
);
286 emit_move_insn (chain
, static_chain_value
);
289 use_reg (call_fusage
, chain
);
290 STATIC_CHAIN_REG_P (chain
) = 1;
297 /* Generate instructions to call function FUNEXP,
298 and optionally pop the results.
299 The CALL_INSN is the first insn generated.
301 FNDECL is the declaration node of the function. This is given to the
302 hook TARGET_RETURN_POPS_ARGS to determine whether this function pops
305 FUNTYPE is the data type of the function. This is given to the hook
306 TARGET_RETURN_POPS_ARGS to determine whether this function pops its
307 own args. We used to allow an identifier for library functions, but
308 that doesn't work when the return type is an aggregate type and the
309 calling convention says that the pointer to this aggregate is to be
310 popped by the callee.
312 STACK_SIZE is the number of bytes of arguments on the stack,
313 ROUNDED_STACK_SIZE is that number rounded up to
314 PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
315 both to put into the call insn and to generate explicit popping
318 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
319 It is zero if this call doesn't want a structure value.
321 NEXT_ARG_REG is the rtx that results from executing
322 targetm.calls.function_arg (&args_so_far, VOIDmode, void_type_node, true)
323 just after all the args have had their registers assigned.
324 This could be whatever you like, but normally it is the first
325 arg-register beyond those used for args in this call,
326 or 0 if all the arg-registers are used in this call.
327 It is passed on to `gen_call' so you can put this info in the call insn.
329 VALREG is a hard register in which a value is returned,
330 or 0 if the call does not return a value.
332 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
333 the args to this call were processed.
334 We restore `inhibit_defer_pop' to that value.
336 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
337 denote registers used by the called function. */
340 emit_call_1 (rtx funexp
, tree fntree ATTRIBUTE_UNUSED
, tree fndecl ATTRIBUTE_UNUSED
,
341 tree funtype ATTRIBUTE_UNUSED
,
342 HOST_WIDE_INT stack_size ATTRIBUTE_UNUSED
,
343 HOST_WIDE_INT rounded_stack_size
,
344 HOST_WIDE_INT struct_value_size ATTRIBUTE_UNUSED
,
345 rtx next_arg_reg ATTRIBUTE_UNUSED
, rtx valreg
,
346 int old_inhibit_defer_pop
, rtx call_fusage
, int ecf_flags
,
347 cumulative_args_t args_so_far ATTRIBUTE_UNUSED
)
349 rtx rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
350 rtx call
, funmem
, pat
;
351 int already_popped
= 0;
352 HOST_WIDE_INT n_popped
= 0;
354 /* Sibling call patterns never pop arguments (no sibcall(_value)_pop
355 patterns exist). Any popping that the callee does on return will
356 be from our caller's frame rather than ours. */
357 if (!(ecf_flags
& ECF_SIBCALL
))
359 n_popped
+= targetm
.calls
.return_pops_args (fndecl
, funtype
, stack_size
);
361 #ifdef CALL_POPS_ARGS
362 n_popped
+= CALL_POPS_ARGS (*get_cumulative_args (args_so_far
));
366 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
367 and we don't want to load it into a register as an optimization,
368 because prepare_call_address already did it if it should be done. */
369 if (GET_CODE (funexp
) != SYMBOL_REF
)
370 funexp
= memory_address (FUNCTION_MODE
, funexp
);
372 funmem
= gen_rtx_MEM (FUNCTION_MODE
, funexp
);
373 if (fndecl
&& TREE_CODE (fndecl
) == FUNCTION_DECL
)
377 /* Although a built-in FUNCTION_DECL and its non-__builtin
378 counterpart compare equal and get a shared mem_attrs, they
379 produce different dump output in compare-debug compilations,
380 if an entry gets garbage collected in one compilation, then
381 adds a different (but equivalent) entry, while the other
382 doesn't run the garbage collector at the same spot and then
383 shares the mem_attr with the equivalent entry. */
384 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
386 tree t2
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
391 set_mem_expr (funmem
, t
);
394 set_mem_expr (funmem
, build_simple_mem_ref (CALL_EXPR_FN (fntree
)));
396 if (ecf_flags
& ECF_SIBCALL
)
399 pat
= targetm
.gen_sibcall_value (valreg
, funmem
,
400 rounded_stack_size_rtx
,
401 next_arg_reg
, NULL_RTX
);
403 pat
= targetm
.gen_sibcall (funmem
, rounded_stack_size_rtx
,
404 next_arg_reg
, GEN_INT (struct_value_size
));
406 /* If the target has "call" or "call_value" insns, then prefer them
407 if no arguments are actually popped. If the target does not have
408 "call" or "call_value" insns, then we must use the popping versions
409 even if the call has no arguments to pop. */
410 else if (n_popped
> 0
412 ? targetm
.have_call_value ()
413 : targetm
.have_call ()))
415 rtx n_pop
= GEN_INT (n_popped
);
417 /* If this subroutine pops its own args, record that in the call insn
418 if possible, for the sake of frame pointer elimination. */
421 pat
= targetm
.gen_call_value_pop (valreg
, funmem
,
422 rounded_stack_size_rtx
,
423 next_arg_reg
, n_pop
);
425 pat
= targetm
.gen_call_pop (funmem
, rounded_stack_size_rtx
,
426 next_arg_reg
, n_pop
);
433 pat
= targetm
.gen_call_value (valreg
, funmem
, rounded_stack_size_rtx
,
434 next_arg_reg
, NULL_RTX
);
436 pat
= targetm
.gen_call (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
437 GEN_INT (struct_value_size
));
441 /* Find the call we just emitted. */
442 rtx_call_insn
*call_insn
= last_call_insn ();
444 /* Some target create a fresh MEM instead of reusing the one provided
445 above. Set its MEM_EXPR. */
446 call
= get_call_rtx_from (call_insn
);
448 && MEM_EXPR (XEXP (call
, 0)) == NULL_TREE
449 && MEM_EXPR (funmem
) != NULL_TREE
)
450 set_mem_expr (XEXP (call
, 0), MEM_EXPR (funmem
));
452 /* Mark instrumented calls. */
454 CALL_EXPR_WITH_BOUNDS_P (call
) = CALL_WITH_BOUNDS_P (fntree
);
456 /* Put the register usage information there. */
457 add_function_usage_to (call_insn
, call_fusage
);
459 /* If this is a const call, then set the insn's unchanging bit. */
460 if (ecf_flags
& ECF_CONST
)
461 RTL_CONST_CALL_P (call_insn
) = 1;
463 /* If this is a pure call, then set the insn's unchanging bit. */
464 if (ecf_flags
& ECF_PURE
)
465 RTL_PURE_CALL_P (call_insn
) = 1;
467 /* If this is a const call, then set the insn's unchanging bit. */
468 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
469 RTL_LOOPING_CONST_OR_PURE_CALL_P (call_insn
) = 1;
471 /* Create a nothrow REG_EH_REGION note, if needed. */
472 make_reg_eh_region_note (call_insn
, ecf_flags
, 0);
474 if (ecf_flags
& ECF_NORETURN
)
475 add_reg_note (call_insn
, REG_NORETURN
, const0_rtx
);
477 if (ecf_flags
& ECF_RETURNS_TWICE
)
479 add_reg_note (call_insn
, REG_SETJMP
, const0_rtx
);
480 cfun
->calls_setjmp
= 1;
483 SIBLING_CALL_P (call_insn
) = ((ecf_flags
& ECF_SIBCALL
) != 0);
485 /* Restore this now, so that we do defer pops for this call's args
486 if the context of the call as a whole permits. */
487 inhibit_defer_pop
= old_inhibit_defer_pop
;
492 CALL_INSN_FUNCTION_USAGE (call_insn
)
493 = gen_rtx_EXPR_LIST (VOIDmode
,
494 gen_rtx_CLOBBER (VOIDmode
, stack_pointer_rtx
),
495 CALL_INSN_FUNCTION_USAGE (call_insn
));
496 rounded_stack_size
-= n_popped
;
497 rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
498 stack_pointer_delta
-= n_popped
;
500 add_reg_note (call_insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
502 /* If popup is needed, stack realign must use DRAP */
503 if (SUPPORTS_STACK_ALIGNMENT
)
504 crtl
->need_drap
= true;
506 /* For noreturn calls when not accumulating outgoing args force
507 REG_ARGS_SIZE note to prevent crossjumping of calls with different
509 else if (!ACCUMULATE_OUTGOING_ARGS
&& (ecf_flags
& ECF_NORETURN
) != 0)
510 add_reg_note (call_insn
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
512 if (!ACCUMULATE_OUTGOING_ARGS
)
514 /* If returning from the subroutine does not automatically pop the args,
515 we need an instruction to pop them sooner or later.
516 Perhaps do it now; perhaps just record how much space to pop later.
518 If returning from the subroutine does pop the args, indicate that the
519 stack pointer will be changed. */
521 if (rounded_stack_size
!= 0)
523 if (ecf_flags
& ECF_NORETURN
)
524 /* Just pretend we did the pop. */
525 stack_pointer_delta
-= rounded_stack_size
;
526 else if (flag_defer_pop
&& inhibit_defer_pop
== 0
527 && ! (ecf_flags
& (ECF_CONST
| ECF_PURE
)))
528 pending_stack_adjust
+= rounded_stack_size
;
530 adjust_stack (rounded_stack_size_rtx
);
533 /* When we accumulate outgoing args, we must avoid any stack manipulations.
534 Restore the stack pointer to its original value now. Usually
535 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
536 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
537 popping variants of functions exist as well.
539 ??? We may optimize similar to defer_pop above, but it is
540 probably not worthwhile.
542 ??? It will be worthwhile to enable combine_stack_adjustments even for
545 anti_adjust_stack (GEN_INT (n_popped
));
548 /* Determine if the function identified by FNDECL is one with
549 special properties we wish to know about. Modify FLAGS accordingly.
551 For example, if the function might return more than one time (setjmp), then
552 set ECF_RETURNS_TWICE.
554 Set ECF_MAY_BE_ALLOCA for any memory allocation function that might allocate
555 space from the stack such as alloca. */
558 special_function_p (const_tree fndecl
, int flags
)
560 tree name_decl
= DECL_NAME (fndecl
);
562 /* For instrumentation clones we want to derive flags
563 from the original name. */
564 if (cgraph_node::get (fndecl
)
565 && cgraph_node::get (fndecl
)->instrumentation_clone
)
566 name_decl
= DECL_NAME (cgraph_node::get (fndecl
)->orig_decl
);
568 if (fndecl
&& name_decl
569 && IDENTIFIER_LENGTH (name_decl
) <= 11
570 /* Exclude functions not at the file scope, or not `extern',
571 since they are not the magic functions we would otherwise
573 FIXME: this should be handled with attributes, not with this
574 hacky imitation of DECL_ASSEMBLER_NAME. It's (also) wrong
575 because you can declare fork() inside a function if you
577 && (DECL_CONTEXT (fndecl
) == NULL_TREE
578 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
579 && TREE_PUBLIC (fndecl
))
581 const char *name
= IDENTIFIER_POINTER (name_decl
);
582 const char *tname
= name
;
584 /* We assume that alloca will always be called by name. It
585 makes no sense to pass it as a pointer-to-function to
586 anything that does not understand its behavior. */
587 if (IDENTIFIER_LENGTH (name_decl
) == 6
589 && ! strcmp (name
, "alloca"))
590 flags
|= ECF_MAY_BE_ALLOCA
;
592 /* Disregard prefix _ or __. */
601 /* ECF_RETURNS_TWICE is safe even for -ffreestanding. */
602 if (! strcmp (tname
, "setjmp")
603 || ! strcmp (tname
, "sigsetjmp")
604 || ! strcmp (name
, "savectx")
605 || ! strcmp (name
, "vfork")
606 || ! strcmp (name
, "getcontext"))
607 flags
|= ECF_RETURNS_TWICE
;
610 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
611 && ALLOCA_FUNCTION_CODE_P (DECL_FUNCTION_CODE (fndecl
)))
612 flags
|= ECF_MAY_BE_ALLOCA
;
617 /* Similar to special_function_p; return a set of ERF_ flags for the
620 decl_return_flags (tree fndecl
)
623 tree type
= TREE_TYPE (fndecl
);
627 attr
= lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type
));
631 attr
= TREE_VALUE (TREE_VALUE (attr
));
632 if (!attr
|| TREE_STRING_LENGTH (attr
) < 1)
635 switch (TREE_STRING_POINTER (attr
)[0])
641 return ERF_RETURNS_ARG
| (TREE_STRING_POINTER (attr
)[0] - '1');
652 /* Return nonzero when FNDECL represents a call to setjmp. */
655 setjmp_call_p (const_tree fndecl
)
657 if (DECL_IS_RETURNS_TWICE (fndecl
))
658 return ECF_RETURNS_TWICE
;
659 return special_function_p (fndecl
, 0) & ECF_RETURNS_TWICE
;
663 /* Return true if STMT may be an alloca call. */
666 gimple_maybe_alloca_call_p (const gimple
*stmt
)
670 if (!is_gimple_call (stmt
))
673 fndecl
= gimple_call_fndecl (stmt
);
674 if (fndecl
&& (special_function_p (fndecl
, 0) & ECF_MAY_BE_ALLOCA
))
680 /* Return true if STMT is a builtin alloca call. */
683 gimple_alloca_call_p (const gimple
*stmt
)
687 if (!is_gimple_call (stmt
))
690 fndecl
= gimple_call_fndecl (stmt
);
691 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
692 switch (DECL_FUNCTION_CODE (fndecl
))
694 CASE_BUILT_IN_ALLOCA
:
703 /* Return true when exp contains a builtin alloca call. */
706 alloca_call_p (const_tree exp
)
709 if (TREE_CODE (exp
) == CALL_EXPR
710 && (fndecl
= get_callee_fndecl (exp
))
711 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
712 switch (DECL_FUNCTION_CODE (fndecl
))
714 CASE_BUILT_IN_ALLOCA
:
723 /* Return TRUE if FNDECL is either a TM builtin or a TM cloned
724 function. Return FALSE otherwise. */
727 is_tm_builtin (const_tree fndecl
)
732 if (decl_is_tm_clone (fndecl
))
735 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
737 switch (DECL_FUNCTION_CODE (fndecl
))
739 case BUILT_IN_TM_COMMIT
:
740 case BUILT_IN_TM_COMMIT_EH
:
741 case BUILT_IN_TM_ABORT
:
742 case BUILT_IN_TM_IRREVOCABLE
:
743 case BUILT_IN_TM_GETTMCLONE_IRR
:
744 case BUILT_IN_TM_MEMCPY
:
745 case BUILT_IN_TM_MEMMOVE
:
746 case BUILT_IN_TM_MEMSET
:
747 CASE_BUILT_IN_TM_STORE (1):
748 CASE_BUILT_IN_TM_STORE (2):
749 CASE_BUILT_IN_TM_STORE (4):
750 CASE_BUILT_IN_TM_STORE (8):
751 CASE_BUILT_IN_TM_STORE (FLOAT
):
752 CASE_BUILT_IN_TM_STORE (DOUBLE
):
753 CASE_BUILT_IN_TM_STORE (LDOUBLE
):
754 CASE_BUILT_IN_TM_STORE (M64
):
755 CASE_BUILT_IN_TM_STORE (M128
):
756 CASE_BUILT_IN_TM_STORE (M256
):
757 CASE_BUILT_IN_TM_LOAD (1):
758 CASE_BUILT_IN_TM_LOAD (2):
759 CASE_BUILT_IN_TM_LOAD (4):
760 CASE_BUILT_IN_TM_LOAD (8):
761 CASE_BUILT_IN_TM_LOAD (FLOAT
):
762 CASE_BUILT_IN_TM_LOAD (DOUBLE
):
763 CASE_BUILT_IN_TM_LOAD (LDOUBLE
):
764 CASE_BUILT_IN_TM_LOAD (M64
):
765 CASE_BUILT_IN_TM_LOAD (M128
):
766 CASE_BUILT_IN_TM_LOAD (M256
):
767 case BUILT_IN_TM_LOG
:
768 case BUILT_IN_TM_LOG_1
:
769 case BUILT_IN_TM_LOG_2
:
770 case BUILT_IN_TM_LOG_4
:
771 case BUILT_IN_TM_LOG_8
:
772 case BUILT_IN_TM_LOG_FLOAT
:
773 case BUILT_IN_TM_LOG_DOUBLE
:
774 case BUILT_IN_TM_LOG_LDOUBLE
:
775 case BUILT_IN_TM_LOG_M64
:
776 case BUILT_IN_TM_LOG_M128
:
777 case BUILT_IN_TM_LOG_M256
:
786 /* Detect flags (function attributes) from the function decl or type node. */
789 flags_from_decl_or_type (const_tree exp
)
795 /* The function exp may have the `malloc' attribute. */
796 if (DECL_IS_MALLOC (exp
))
799 /* The function exp may have the `returns_twice' attribute. */
800 if (DECL_IS_RETURNS_TWICE (exp
))
801 flags
|= ECF_RETURNS_TWICE
;
803 /* Process the pure and const attributes. */
804 if (TREE_READONLY (exp
))
806 if (DECL_PURE_P (exp
))
808 if (DECL_LOOPING_CONST_OR_PURE_P (exp
))
809 flags
|= ECF_LOOPING_CONST_OR_PURE
;
811 if (DECL_IS_NOVOPS (exp
))
813 if (lookup_attribute ("leaf", DECL_ATTRIBUTES (exp
)))
815 if (lookup_attribute ("cold", DECL_ATTRIBUTES (exp
)))
818 if (TREE_NOTHROW (exp
))
819 flags
|= ECF_NOTHROW
;
823 if (is_tm_builtin (exp
))
824 flags
|= ECF_TM_BUILTIN
;
825 else if ((flags
& (ECF_CONST
|ECF_NOVOPS
)) != 0
826 || lookup_attribute ("transaction_pure",
827 TYPE_ATTRIBUTES (TREE_TYPE (exp
))))
828 flags
|= ECF_TM_PURE
;
831 flags
= special_function_p (exp
, flags
);
833 else if (TYPE_P (exp
))
835 if (TYPE_READONLY (exp
))
839 && ((flags
& ECF_CONST
) != 0
840 || lookup_attribute ("transaction_pure", TYPE_ATTRIBUTES (exp
))))
841 flags
|= ECF_TM_PURE
;
846 if (TREE_THIS_VOLATILE (exp
))
848 flags
|= ECF_NORETURN
;
849 if (flags
& (ECF_CONST
|ECF_PURE
))
850 flags
|= ECF_LOOPING_CONST_OR_PURE
;
856 /* Detect flags from a CALL_EXPR. */
859 call_expr_flags (const_tree t
)
862 tree decl
= get_callee_fndecl (t
);
865 flags
= flags_from_decl_or_type (decl
);
866 else if (CALL_EXPR_FN (t
) == NULL_TREE
)
867 flags
= internal_fn_flags (CALL_EXPR_IFN (t
));
870 tree type
= TREE_TYPE (CALL_EXPR_FN (t
));
871 if (type
&& TREE_CODE (type
) == POINTER_TYPE
)
872 flags
= flags_from_decl_or_type (TREE_TYPE (type
));
875 if (CALL_EXPR_BY_DESCRIPTOR (t
))
876 flags
|= ECF_BY_DESCRIPTOR
;
882 /* Return true if TYPE should be passed by invisible reference. */
885 pass_by_reference (CUMULATIVE_ARGS
*ca
, machine_mode mode
,
886 tree type
, bool named_arg
)
890 /* If this type contains non-trivial constructors, then it is
891 forbidden for the middle-end to create any new copies. */
892 if (TREE_ADDRESSABLE (type
))
895 /* GCC post 3.4 passes *all* variable sized types by reference. */
896 if (!TYPE_SIZE (type
) || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
899 /* If a record type should be passed the same as its first (and only)
900 member, use the type and mode of that member. */
901 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
903 type
= TREE_TYPE (first_field (type
));
904 mode
= TYPE_MODE (type
);
908 return targetm
.calls
.pass_by_reference (pack_cumulative_args (ca
), mode
,
912 /* Return true if TYPE, which is passed by reference, should be callee
913 copied instead of caller copied. */
916 reference_callee_copied (CUMULATIVE_ARGS
*ca
, machine_mode mode
,
917 tree type
, bool named_arg
)
919 if (type
&& TREE_ADDRESSABLE (type
))
921 return targetm
.calls
.callee_copies (pack_cumulative_args (ca
), mode
, type
,
926 /* Precompute all register parameters as described by ARGS, storing values
927 into fields within the ARGS array.
929 NUM_ACTUALS indicates the total number elements in the ARGS array.
931 Set REG_PARM_SEEN if we encounter a register parameter. */
934 precompute_register_parameters (int num_actuals
, struct arg_data
*args
,
941 for (i
= 0; i
< num_actuals
; i
++)
942 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
)
946 if (args
[i
].value
== 0)
949 args
[i
].value
= expand_normal (args
[i
].tree_value
);
950 preserve_temp_slots (args
[i
].value
);
954 /* If we are to promote the function arg to a wider mode,
957 if (args
[i
].mode
!= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)))
959 = convert_modes (args
[i
].mode
,
960 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
961 args
[i
].value
, args
[i
].unsignedp
);
963 /* If the value is a non-legitimate constant, force it into a
964 pseudo now. TLS symbols sometimes need a call to resolve. */
965 if (CONSTANT_P (args
[i
].value
)
966 && !targetm
.legitimate_constant_p (args
[i
].mode
, args
[i
].value
))
967 args
[i
].value
= force_reg (args
[i
].mode
, args
[i
].value
);
969 /* If we're going to have to load the value by parts, pull the
970 parts into pseudos. The part extraction process can involve
971 non-trivial computation. */
972 if (GET_CODE (args
[i
].reg
) == PARALLEL
)
974 tree type
= TREE_TYPE (args
[i
].tree_value
);
975 args
[i
].parallel_value
976 = emit_group_load_into_temps (args
[i
].reg
, args
[i
].value
,
977 type
, int_size_in_bytes (type
));
980 /* If the value is expensive, and we are inside an appropriately
981 short loop, put the value into a pseudo and then put the pseudo
984 For small register classes, also do this if this call uses
985 register parameters. This is to avoid reload conflicts while
986 loading the parameters registers. */
988 else if ((! (REG_P (args
[i
].value
)
989 || (GET_CODE (args
[i
].value
) == SUBREG
990 && REG_P (SUBREG_REG (args
[i
].value
)))))
991 && args
[i
].mode
!= BLKmode
992 && (set_src_cost (args
[i
].value
, args
[i
].mode
,
993 optimize_insn_for_speed_p ())
996 && targetm
.small_register_classes_for_mode_p (args
[i
].mode
))
998 args
[i
].value
= copy_to_mode_reg (args
[i
].mode
, args
[i
].value
);
1002 #ifdef REG_PARM_STACK_SPACE
1004 /* The argument list is the property of the called routine and it
1005 may clobber it. If the fixed area has been used for previous
1006 parameters, we must save and restore it. */
1009 save_fixed_argument_area (int reg_parm_stack_space
, rtx argblock
, int *low_to_save
, int *high_to_save
)
1014 /* Compute the boundary of the area that needs to be saved, if any. */
1015 high
= reg_parm_stack_space
;
1016 if (ARGS_GROW_DOWNWARD
)
1019 if (high
> highest_outgoing_arg_in_use
)
1020 high
= highest_outgoing_arg_in_use
;
1022 for (low
= 0; low
< high
; low
++)
1023 if (stack_usage_map
[low
] != 0)
1026 machine_mode save_mode
;
1032 while (stack_usage_map
[--high
] == 0)
1036 *high_to_save
= high
;
1038 num_to_save
= high
- low
+ 1;
1040 /* If we don't have the required alignment, must do this
1042 scalar_int_mode imode
;
1043 if (int_mode_for_size (num_to_save
* BITS_PER_UNIT
, 1).exists (&imode
)
1044 && (low
& (MIN (GET_MODE_SIZE (imode
),
1045 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)) == 0)
1048 save_mode
= BLKmode
;
1050 if (ARGS_GROW_DOWNWARD
)
1055 addr
= plus_constant (Pmode
, argblock
, delta
);
1056 stack_area
= gen_rtx_MEM (save_mode
, memory_address (save_mode
, addr
));
1058 set_mem_align (stack_area
, PARM_BOUNDARY
);
1059 if (save_mode
== BLKmode
)
1061 save_area
= assign_stack_temp (BLKmode
, num_to_save
);
1062 emit_block_move (validize_mem (save_area
), stack_area
,
1063 GEN_INT (num_to_save
), BLOCK_OP_CALL_PARM
);
1067 save_area
= gen_reg_rtx (save_mode
);
1068 emit_move_insn (save_area
, stack_area
);
1078 restore_fixed_argument_area (rtx save_area
, rtx argblock
, int high_to_save
, int low_to_save
)
1080 machine_mode save_mode
= GET_MODE (save_area
);
1082 rtx addr
, stack_area
;
1084 if (ARGS_GROW_DOWNWARD
)
1085 delta
= -high_to_save
;
1087 delta
= low_to_save
;
1089 addr
= plus_constant (Pmode
, argblock
, delta
);
1090 stack_area
= gen_rtx_MEM (save_mode
, memory_address (save_mode
, addr
));
1091 set_mem_align (stack_area
, PARM_BOUNDARY
);
1093 if (save_mode
!= BLKmode
)
1094 emit_move_insn (stack_area
, save_area
);
1096 emit_block_move (stack_area
, validize_mem (save_area
),
1097 GEN_INT (high_to_save
- low_to_save
+ 1),
1098 BLOCK_OP_CALL_PARM
);
1100 #endif /* REG_PARM_STACK_SPACE */
1102 /* If any elements in ARGS refer to parameters that are to be passed in
1103 registers, but not in memory, and whose alignment does not permit a
1104 direct copy into registers. Copy the values into a group of pseudos
1105 which we will later copy into the appropriate hard registers.
1107 Pseudos for each unaligned argument will be stored into the array
1108 args[argnum].aligned_regs. The caller is responsible for deallocating
1109 the aligned_regs array if it is nonzero. */
1112 store_unaligned_arguments_into_pseudos (struct arg_data
*args
, int num_actuals
)
1116 for (i
= 0; i
< num_actuals
; i
++)
1117 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
1118 && GET_CODE (args
[i
].reg
) != PARALLEL
1119 && args
[i
].mode
== BLKmode
1120 && MEM_P (args
[i
].value
)
1121 && (MEM_ALIGN (args
[i
].value
)
1122 < (unsigned int) MIN (BIGGEST_ALIGNMENT
, BITS_PER_WORD
)))
1124 int bytes
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1125 int endian_correction
= 0;
1127 if (args
[i
].partial
)
1129 gcc_assert (args
[i
].partial
% UNITS_PER_WORD
== 0);
1130 args
[i
].n_aligned_regs
= args
[i
].partial
/ UNITS_PER_WORD
;
1134 args
[i
].n_aligned_regs
1135 = (bytes
+ UNITS_PER_WORD
- 1) / UNITS_PER_WORD
;
1138 args
[i
].aligned_regs
= XNEWVEC (rtx
, args
[i
].n_aligned_regs
);
1140 /* Structures smaller than a word are normally aligned to the
1141 least significant byte. On a BYTES_BIG_ENDIAN machine,
1142 this means we must skip the empty high order bytes when
1143 calculating the bit offset. */
1144 if (bytes
< UNITS_PER_WORD
1145 #ifdef BLOCK_REG_PADDING
1146 && (BLOCK_REG_PADDING (args
[i
].mode
,
1147 TREE_TYPE (args
[i
].tree_value
), 1)
1153 endian_correction
= BITS_PER_WORD
- bytes
* BITS_PER_UNIT
;
1155 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1157 rtx reg
= gen_reg_rtx (word_mode
);
1158 rtx word
= operand_subword_force (args
[i
].value
, j
, BLKmode
);
1159 int bitsize
= MIN (bytes
* BITS_PER_UNIT
, BITS_PER_WORD
);
1161 args
[i
].aligned_regs
[j
] = reg
;
1162 word
= extract_bit_field (word
, bitsize
, 0, 1, NULL_RTX
,
1163 word_mode
, word_mode
, false, NULL
);
1165 /* There is no need to restrict this code to loading items
1166 in TYPE_ALIGN sized hunks. The bitfield instructions can
1167 load up entire word sized registers efficiently.
1169 ??? This may not be needed anymore.
1170 We use to emit a clobber here but that doesn't let later
1171 passes optimize the instructions we emit. By storing 0 into
1172 the register later passes know the first AND to zero out the
1173 bitfield being set in the register is unnecessary. The store
1174 of 0 will be deleted as will at least the first AND. */
1176 emit_move_insn (reg
, const0_rtx
);
1178 bytes
-= bitsize
/ BITS_PER_UNIT
;
1179 store_bit_field (reg
, bitsize
, endian_correction
, 0, 0,
1180 word_mode
, word
, false);
1185 /* The limit set by -Walloc-larger-than=. */
1186 static GTY(()) tree alloc_object_size_limit
;
1188 /* Initialize ALLOC_OBJECT_SIZE_LIMIT based on the -Walloc-size-larger-than=
1189 setting if the option is specified, or to the maximum object size if it
1190 is not. Return the initialized value. */
1193 alloc_max_size (void)
1195 if (!alloc_object_size_limit
)
1197 alloc_object_size_limit
= TYPE_MAX_VALUE (ssizetype
);
1199 if (warn_alloc_size_limit
)
1203 unsigned HOST_WIDE_INT unit
= 1;
1204 unsigned HOST_WIDE_INT limit
1205 = strtoull (warn_alloc_size_limit
, &end
, 10);
1211 /* Numeric option arguments are at most INT_MAX. Make it
1212 possible to specify a larger value by accepting common
1214 if (!strcmp (end
, "kB"))
1216 else if (!strcasecmp (end
, "KiB") || strcmp (end
, "KB"))
1218 else if (!strcmp (end
, "MB"))
1219 unit
= HOST_WIDE_INT_UC (1000) * 1000;
1220 else if (!strcasecmp (end
, "MiB"))
1221 unit
= HOST_WIDE_INT_UC (1024) * 1024;
1222 else if (!strcasecmp (end
, "GB"))
1223 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000;
1224 else if (!strcasecmp (end
, "GiB"))
1225 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024;
1226 else if (!strcasecmp (end
, "TB"))
1227 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000 * 1000;
1228 else if (!strcasecmp (end
, "TiB"))
1229 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024 * 1024;
1230 else if (!strcasecmp (end
, "PB"))
1231 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000 * 1000 * 1000;
1232 else if (!strcasecmp (end
, "PiB"))
1233 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024 * 1024 * 1024;
1234 else if (!strcasecmp (end
, "EB"))
1235 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000 * 1000 * 1000
1237 else if (!strcasecmp (end
, "EiB"))
1238 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024 * 1024 * 1024
1246 widest_int w
= wi::mul (limit
, unit
);
1247 if (w
< wi::to_widest (alloc_object_size_limit
))
1248 alloc_object_size_limit
= wide_int_to_tree (ssizetype
, w
);
1253 return alloc_object_size_limit
;
1256 /* Return true when EXP's range can be determined and set RANGE[] to it
1257 after adjusting it if necessary to make EXP a valid size argument to
1258 an allocation function declared with attribute alloc_size (whose
1259 argument may be signed), or to a string manipulation function like
1263 get_size_range (tree exp
, tree range
[2])
1265 if (tree_fits_uhwi_p (exp
))
1267 /* EXP is a constant. */
1268 range
[0] = range
[1] = exp
;
1273 enum value_range_type range_type
1274 = ((TREE_CODE (exp
) == SSA_NAME
&& INTEGRAL_TYPE_P (TREE_TYPE (exp
)))
1275 ? get_range_info (exp
, &min
, &max
) : VR_VARYING
);
1277 if (range_type
== VR_VARYING
)
1279 /* No range information available. */
1280 range
[0] = NULL_TREE
;
1281 range
[1] = NULL_TREE
;
1285 tree exptype
= TREE_TYPE (exp
);
1286 unsigned expprec
= TYPE_PRECISION (exptype
);
1288 bool signed_p
= !TYPE_UNSIGNED (exptype
);
1290 if (range_type
== VR_ANTI_RANGE
)
1294 if (wi::les_p (max
, 0))
1296 /* EXP is not in a strictly negative range. That means
1297 it must be in some (not necessarily strictly) positive
1298 range which includes zero. Since in signed to unsigned
1299 conversions negative values end up converted to large
1300 positive values, and otherwise they are not valid sizes,
1301 the resulting range is in both cases [0, TYPE_MAX]. */
1302 min
= wi::zero (expprec
);
1303 max
= wi::to_wide (TYPE_MAX_VALUE (exptype
));
1305 else if (wi::les_p (min
- 1, 0))
1307 /* EXP is not in a negative-positive range. That means EXP
1308 is either negative, or greater than max. Since negative
1309 sizes are invalid make the range [MAX + 1, TYPE_MAX]. */
1311 max
= wi::to_wide (TYPE_MAX_VALUE (exptype
));
1316 min
= wi::zero (expprec
);
1319 else if (wi::eq_p (0, min
- 1))
1321 /* EXP is unsigned and not in the range [1, MAX]. That means
1322 it's either zero or greater than MAX. Even though 0 would
1323 normally be detected by -Walloc-zero set the range to
1324 [MAX, TYPE_MAX] so that when MAX is greater than the limit
1325 the whole range is diagnosed. */
1327 max
= wi::to_wide (TYPE_MAX_VALUE (exptype
));
1332 min
= wi::zero (expprec
);
1336 range
[0] = wide_int_to_tree (exptype
, min
);
1337 range
[1] = wide_int_to_tree (exptype
, max
);
1342 /* Diagnose a call EXP to function FN decorated with attribute alloc_size
1343 whose argument numbers given by IDX with values given by ARGS exceed
1344 the maximum object size or cause an unsigned oveflow (wrapping) when
1345 multiplied. When ARGS[0] is null the function does nothing. ARGS[1]
1346 may be null for functions like malloc, and non-null for those like
1347 calloc that are decorated with a two-argument attribute alloc_size. */
1350 maybe_warn_alloc_args_overflow (tree fn
, tree exp
, tree args
[2], int idx
[2])
1352 /* The range each of the (up to) two arguments is known to be in. */
1353 tree argrange
[2][2] = { { NULL_TREE
, NULL_TREE
}, { NULL_TREE
, NULL_TREE
} };
1355 /* Maximum object size set by -Walloc-size-larger-than= or SIZE_MAX / 2. */
1356 tree maxobjsize
= alloc_max_size ();
1358 location_t loc
= EXPR_LOCATION (exp
);
1360 bool warned
= false;
1362 /* Validate each argument individually. */
1363 for (unsigned i
= 0; i
!= 2 && args
[i
]; ++i
)
1365 if (TREE_CODE (args
[i
]) == INTEGER_CST
)
1367 argrange
[i
][0] = args
[i
];
1368 argrange
[i
][1] = args
[i
];
1370 if (tree_int_cst_lt (args
[i
], integer_zero_node
))
1372 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1373 "%Kargument %i value %qE is negative",
1374 exp
, idx
[i
] + 1, args
[i
]);
1376 else if (integer_zerop (args
[i
]))
1378 /* Avoid issuing -Walloc-zero for allocation functions other
1379 than __builtin_alloca that are declared with attribute
1380 returns_nonnull because there's no portability risk. This
1381 avoids warning for such calls to libiberty's xmalloc and
1383 Also avoid issuing the warning for calls to function named
1385 if ((DECL_FUNCTION_CODE (fn
) == BUILT_IN_ALLOCA
1386 && IDENTIFIER_LENGTH (DECL_NAME (fn
)) != 6)
1387 || (DECL_FUNCTION_CODE (fn
) != BUILT_IN_ALLOCA
1388 && !lookup_attribute ("returns_nonnull",
1389 TYPE_ATTRIBUTES (TREE_TYPE (fn
)))))
1390 warned
= warning_at (loc
, OPT_Walloc_zero
,
1391 "%Kargument %i value is zero",
1394 else if (tree_int_cst_lt (maxobjsize
, args
[i
]))
1396 /* G++ emits calls to ::operator new[](SIZE_MAX) in C++98
1397 mode and with -fno-exceptions as a way to indicate array
1398 size overflow. There's no good way to detect C++98 here
1399 so avoid diagnosing these calls for all C++ modes. */
1403 && DECL_IS_OPERATOR_NEW (fn
)
1404 && integer_all_onesp (args
[i
]))
1407 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1408 "%Kargument %i value %qE exceeds "
1409 "maximum object size %E",
1410 exp
, idx
[i
] + 1, args
[i
], maxobjsize
);
1413 else if (TREE_CODE (args
[i
]) == SSA_NAME
1414 && get_size_range (args
[i
], argrange
[i
]))
1416 /* Verify that the argument's range is not negative (including
1417 upper bound of zero). */
1418 if (tree_int_cst_lt (argrange
[i
][0], integer_zero_node
)
1419 && tree_int_cst_le (argrange
[i
][1], integer_zero_node
))
1421 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1422 "%Kargument %i range [%E, %E] is negative",
1424 argrange
[i
][0], argrange
[i
][1]);
1426 else if (tree_int_cst_lt (maxobjsize
, argrange
[i
][0]))
1428 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1429 "%Kargument %i range [%E, %E] exceeds "
1430 "maximum object size %E",
1432 argrange
[i
][0], argrange
[i
][1],
1441 /* For a two-argument alloc_size, validate the product of the two
1442 arguments if both of their values or ranges are known. */
1443 if (!warned
&& tree_fits_uhwi_p (argrange
[0][0])
1444 && argrange
[1][0] && tree_fits_uhwi_p (argrange
[1][0])
1445 && !integer_onep (argrange
[0][0])
1446 && !integer_onep (argrange
[1][0]))
1448 /* Check for overflow in the product of a function decorated with
1449 attribute alloc_size (X, Y). */
1450 unsigned szprec
= TYPE_PRECISION (size_type_node
);
1451 wide_int x
= wi::to_wide (argrange
[0][0], szprec
);
1452 wide_int y
= wi::to_wide (argrange
[1][0], szprec
);
1455 wide_int prod
= wi::umul (x
, y
, &vflow
);
1458 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1459 "%Kproduct %<%E * %E%> of arguments %i and %i "
1460 "exceeds %<SIZE_MAX%>",
1461 exp
, argrange
[0][0], argrange
[1][0],
1462 idx
[0] + 1, idx
[1] + 1);
1463 else if (wi::ltu_p (wi::to_wide (maxobjsize
, szprec
), prod
))
1464 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1465 "%Kproduct %<%E * %E%> of arguments %i and %i "
1466 "exceeds maximum object size %E",
1467 exp
, argrange
[0][0], argrange
[1][0],
1468 idx
[0] + 1, idx
[1] + 1,
1473 /* Print the full range of each of the two arguments to make
1474 it clear when it is, in fact, in a range and not constant. */
1475 if (argrange
[0][0] != argrange
[0][1])
1476 inform (loc
, "argument %i in the range [%E, %E]",
1477 idx
[0] + 1, argrange
[0][0], argrange
[0][1]);
1478 if (argrange
[1][0] != argrange
[1][1])
1479 inform (loc
, "argument %i in the range [%E, %E]",
1480 idx
[1] + 1, argrange
[1][0], argrange
[1][1]);
1486 location_t fnloc
= DECL_SOURCE_LOCATION (fn
);
1488 if (DECL_IS_BUILTIN (fn
))
1490 "in a call to built-in allocation function %qD", fn
);
1493 "in a call to allocation function %qD declared here", fn
);
1497 /* If EXPR refers to a character array or pointer declared attribute
1498 nonstring return a decl for that array or pointer and set *REF to
1499 the referenced enclosing object or pointer. Otherwise returns
1503 get_attr_nonstring_decl (tree expr
, tree
*ref
)
1506 if (TREE_CODE (decl
) == SSA_NAME
)
1508 gimple
*def
= SSA_NAME_DEF_STMT (decl
);
1510 if (is_gimple_assign (def
))
1512 tree_code code
= gimple_assign_rhs_code (def
);
1513 if (code
== ADDR_EXPR
1514 || code
== COMPONENT_REF
1515 || code
== VAR_DECL
)
1516 decl
= gimple_assign_rhs1 (def
);
1518 else if (tree var
= SSA_NAME_VAR (decl
))
1522 if (TREE_CODE (decl
) == ADDR_EXPR
)
1523 decl
= TREE_OPERAND (decl
, 0);
1528 if (TREE_CODE (decl
) == COMPONENT_REF
)
1529 decl
= TREE_OPERAND (decl
, 1);
1532 && lookup_attribute ("nonstring", DECL_ATTRIBUTES (decl
)))
1538 /* Warn about passing a non-string array/pointer to a function that
1539 expects a nul-terminated string argument. */
1542 maybe_warn_nonstring_arg (tree fndecl
, tree exp
)
1544 if (!fndecl
|| DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
1547 bool with_bounds
= CALL_WITH_BOUNDS_P (exp
);
1549 /* The bound argument to a bounded string function like strncpy. */
1550 tree bound
= NULL_TREE
;
1552 /* It's safe to call "bounded" string functions with a non-string
1553 argument since the functions provide an explicit bound for this
1555 switch (DECL_FUNCTION_CODE (fndecl
))
1557 case BUILT_IN_STPNCPY
:
1558 case BUILT_IN_STPNCPY_CHK
:
1559 case BUILT_IN_STRNCMP
:
1560 case BUILT_IN_STRNCASECMP
:
1561 case BUILT_IN_STRNCPY
:
1562 case BUILT_IN_STRNCPY_CHK
:
1563 bound
= CALL_EXPR_ARG (exp
, with_bounds
? 4 : 2);
1566 case BUILT_IN_STRNDUP
:
1567 bound
= CALL_EXPR_ARG (exp
, with_bounds
? 2 : 1);
1574 /* Determine the range of the bound argument (if specified). */
1575 tree bndrng
[2] = { NULL_TREE
, NULL_TREE
};
1577 get_size_range (bound
, bndrng
);
1579 /* Iterate over the built-in function's formal arguments and check
1580 each const char* against the actual argument. If the actual
1581 argument is declared attribute non-string issue a warning unless
1582 the argument's maximum length is bounded. */
1583 function_args_iterator it
;
1584 function_args_iter_init (&it
, TREE_TYPE (fndecl
));
1586 for (unsigned argno
= 0; ; ++argno
, function_args_iter_next (&it
))
1588 tree argtype
= function_args_iter_cond (&it
);
1592 if (TREE_CODE (argtype
) != POINTER_TYPE
)
1595 argtype
= TREE_TYPE (argtype
);
1597 if (TREE_CODE (argtype
) != INTEGER_TYPE
1598 || !TYPE_READONLY (argtype
))
1601 argtype
= TYPE_MAIN_VARIANT (argtype
);
1602 if (argtype
!= char_type_node
)
1605 tree callarg
= CALL_EXPR_ARG (exp
, argno
);
1606 if (TREE_CODE (callarg
) == ADDR_EXPR
)
1607 callarg
= TREE_OPERAND (callarg
, 0);
1609 /* See if the destination is declared with attribute "nonstring". */
1610 tree decl
= get_attr_nonstring_decl (callarg
);
1614 tree type
= TREE_TYPE (decl
);
1616 offset_int wibnd
= 0;
1618 wibnd
= wi::to_offset (bndrng
[0]);
1620 offset_int asize
= wibnd
;
1622 if (TREE_CODE (type
) == ARRAY_TYPE
)
1623 if (tree arrbnd
= TYPE_DOMAIN (type
))
1625 if ((arrbnd
= TYPE_MAX_VALUE (arrbnd
)))
1626 asize
= wi::to_offset (arrbnd
) + 1;
1629 location_t loc
= EXPR_LOCATION (exp
);
1631 bool warned
= false;
1633 if (wi::ltu_p (asize
, wibnd
))
1634 warned
= warning_at (loc
, OPT_Wstringop_overflow_
,
1635 "%qD argument %i declared attribute %<nonstring%> "
1636 "is smaller than the specified bound %E",
1637 fndecl
, argno
+ 1, bndrng
[0]);
1639 warned
= warning_at (loc
, OPT_Wstringop_overflow_
,
1640 "%qD argument %i declared attribute %<nonstring%>",
1644 inform (DECL_SOURCE_LOCATION (decl
),
1645 "argument %qD declared here", decl
);
1649 /* Issue an error if CALL_EXPR was flagged as requiring
1650 tall-call optimization. */
1653 maybe_complain_about_tail_call (tree call_expr
, const char *reason
)
1655 gcc_assert (TREE_CODE (call_expr
) == CALL_EXPR
);
1656 if (!CALL_EXPR_MUST_TAIL_CALL (call_expr
))
1659 error_at (EXPR_LOCATION (call_expr
), "cannot tail-call: %s", reason
);
1662 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1665 NUM_ACTUALS is the total number of parameters.
1667 N_NAMED_ARGS is the total number of named arguments.
1669 STRUCT_VALUE_ADDR_VALUE is the implicit argument for a struct return
1672 FNDECL is the tree code for the target of this call (if known)
1674 ARGS_SO_FAR holds state needed by the target to know where to place
1677 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1678 for arguments which are passed in registers.
1680 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1681 and may be modified by this routine.
1683 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1684 flags which may be modified by this routine.
1686 MAY_TAILCALL is cleared if we encounter an invisible pass-by-reference
1687 that requires allocation of stack space.
1689 CALL_FROM_THUNK_P is true if this call is the jump from a thunk to
1690 the thunked-to function. */
1693 initialize_argument_information (int num_actuals ATTRIBUTE_UNUSED
,
1694 struct arg_data
*args
,
1695 struct args_size
*args_size
,
1696 int n_named_args ATTRIBUTE_UNUSED
,
1697 tree exp
, tree struct_value_addr_value
,
1698 tree fndecl
, tree fntype
,
1699 cumulative_args_t args_so_far
,
1700 int reg_parm_stack_space
,
1701 rtx
*old_stack_level
, int *old_pending_adj
,
1702 int *must_preallocate
, int *ecf_flags
,
1703 bool *may_tailcall
, bool call_from_thunk_p
)
1705 CUMULATIVE_ARGS
*args_so_far_pnt
= get_cumulative_args (args_so_far
);
1706 location_t loc
= EXPR_LOCATION (exp
);
1708 /* Count arg position in order args appear. */
1713 args_size
->constant
= 0;
1716 bitmap_obstack_initialize (NULL
);
1718 /* In this loop, we consider args in the order they are written.
1719 We fill up ARGS from the back. */
1721 i
= num_actuals
- 1;
1723 int j
= i
, ptr_arg
= -1;
1724 call_expr_arg_iterator iter
;
1726 bitmap slots
= NULL
;
1728 if (struct_value_addr_value
)
1730 args
[j
].tree_value
= struct_value_addr_value
;
1733 /* If we pass structure address then we need to
1734 create bounds for it. Since created bounds is
1735 a call statement, we expand it right here to avoid
1736 fixing all other places where it may be expanded. */
1737 if (CALL_WITH_BOUNDS_P (exp
))
1739 args
[j
].value
= gen_reg_rtx (targetm
.chkp_bound_mode ());
1741 = chkp_make_bounds_for_struct_addr (struct_value_addr_value
);
1742 expand_expr_real (args
[j
].tree_value
, args
[j
].value
, VOIDmode
,
1743 EXPAND_NORMAL
, 0, false);
1744 args
[j
].pointer_arg
= j
+ 1;
1749 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
1751 tree argtype
= TREE_TYPE (arg
);
1753 /* Remember last param with pointer and associate it
1754 with following pointer bounds. */
1755 if (CALL_WITH_BOUNDS_P (exp
)
1756 && chkp_type_has_pointer (argtype
))
1759 BITMAP_FREE (slots
);
1761 if (!BOUNDED_TYPE_P (argtype
))
1763 slots
= BITMAP_ALLOC (NULL
);
1764 chkp_find_bound_slots (argtype
, slots
);
1767 else if (CALL_WITH_BOUNDS_P (exp
)
1768 && pass_by_reference (NULL
, TYPE_MODE (argtype
), argtype
,
1769 argpos
< n_named_args
))
1772 BITMAP_FREE (slots
);
1775 else if (POINTER_BOUNDS_TYPE_P (argtype
))
1777 /* We expect bounds in instrumented calls only.
1778 Otherwise it is a sign we lost flag due to some optimization
1779 and may emit call args incorrectly. */
1780 gcc_assert (CALL_WITH_BOUNDS_P (exp
));
1782 /* For structures look for the next available pointer. */
1783 if (ptr_arg
!= -1 && slots
)
1785 unsigned bnd_no
= bitmap_first_set_bit (slots
);
1786 args
[j
].pointer_offset
=
1787 bnd_no
* POINTER_SIZE
/ BITS_PER_UNIT
;
1789 bitmap_clear_bit (slots
, bnd_no
);
1791 /* Check we have no more pointers in the structure. */
1792 if (bitmap_empty_p (slots
))
1793 BITMAP_FREE (slots
);
1795 args
[j
].pointer_arg
= ptr_arg
;
1797 /* Check we covered all pointers in the previous
1805 if (targetm
.calls
.split_complex_arg
1807 && TREE_CODE (argtype
) == COMPLEX_TYPE
1808 && targetm
.calls
.split_complex_arg (argtype
))
1810 tree subtype
= TREE_TYPE (argtype
);
1811 args
[j
].tree_value
= build1 (REALPART_EXPR
, subtype
, arg
);
1813 args
[j
].tree_value
= build1 (IMAGPART_EXPR
, subtype
, arg
);
1816 args
[j
].tree_value
= arg
;
1822 BITMAP_FREE (slots
);
1825 bitmap_obstack_release (NULL
);
1827 /* Extract attribute alloc_size and if set, store the indices of
1828 the corresponding arguments in ALLOC_IDX, and then the actual
1829 argument(s) at those indices in ALLOC_ARGS. */
1830 int alloc_idx
[2] = { -1, -1 };
1832 = (fndecl
? lookup_attribute ("alloc_size",
1833 TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)))
1836 tree args
= TREE_VALUE (alloc_size
);
1837 alloc_idx
[0] = TREE_INT_CST_LOW (TREE_VALUE (args
)) - 1;
1838 if (TREE_CHAIN (args
))
1839 alloc_idx
[1] = TREE_INT_CST_LOW (TREE_VALUE (TREE_CHAIN (args
))) - 1;
1842 /* Array for up to the two attribute alloc_size arguments. */
1843 tree alloc_args
[] = { NULL_TREE
, NULL_TREE
};
1845 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1846 for (argpos
= 0; argpos
< num_actuals
; i
--, argpos
++)
1848 tree type
= TREE_TYPE (args
[i
].tree_value
);
1852 /* Replace erroneous argument with constant zero. */
1853 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
1854 args
[i
].tree_value
= integer_zero_node
, type
= integer_type_node
;
1856 /* If TYPE is a transparent union or record, pass things the way
1857 we would pass the first field of the union or record. We have
1858 already verified that the modes are the same. */
1859 if ((TREE_CODE (type
) == UNION_TYPE
|| TREE_CODE (type
) == RECORD_TYPE
)
1860 && TYPE_TRANSPARENT_AGGR (type
))
1861 type
= TREE_TYPE (first_field (type
));
1863 /* Decide where to pass this arg.
1865 args[i].reg is nonzero if all or part is passed in registers.
1867 args[i].partial is nonzero if part but not all is passed in registers,
1868 and the exact value says how many bytes are passed in registers.
1870 args[i].pass_on_stack is nonzero if the argument must at least be
1871 computed on the stack. It may then be loaded back into registers
1872 if args[i].reg is nonzero.
1874 These decisions are driven by the FUNCTION_... macros and must agree
1875 with those made by function.c. */
1877 /* See if this argument should be passed by invisible reference. */
1878 if (pass_by_reference (args_so_far_pnt
, TYPE_MODE (type
),
1879 type
, argpos
< n_named_args
))
1882 tree base
= NULL_TREE
;
1885 = reference_callee_copied (args_so_far_pnt
, TYPE_MODE (type
),
1886 type
, argpos
< n_named_args
);
1888 /* If we're compiling a thunk, pass through invisible references
1889 instead of making a copy. */
1890 if (call_from_thunk_p
1892 && !TREE_ADDRESSABLE (type
)
1893 && (base
= get_base_address (args
[i
].tree_value
))
1894 && TREE_CODE (base
) != SSA_NAME
1895 && (!DECL_P (base
) || MEM_P (DECL_RTL (base
)))))
1897 /* We may have turned the parameter value into an SSA name.
1898 Go back to the original parameter so we can take the
1900 if (TREE_CODE (args
[i
].tree_value
) == SSA_NAME
)
1902 gcc_assert (SSA_NAME_IS_DEFAULT_DEF (args
[i
].tree_value
));
1903 args
[i
].tree_value
= SSA_NAME_VAR (args
[i
].tree_value
);
1904 gcc_assert (TREE_CODE (args
[i
].tree_value
) == PARM_DECL
);
1906 /* Argument setup code may have copied the value to register. We
1907 revert that optimization now because the tail call code must
1908 use the original location. */
1909 if (TREE_CODE (args
[i
].tree_value
) == PARM_DECL
1910 && !MEM_P (DECL_RTL (args
[i
].tree_value
))
1911 && DECL_INCOMING_RTL (args
[i
].tree_value
)
1912 && MEM_P (DECL_INCOMING_RTL (args
[i
].tree_value
)))
1913 set_decl_rtl (args
[i
].tree_value
,
1914 DECL_INCOMING_RTL (args
[i
].tree_value
));
1916 mark_addressable (args
[i
].tree_value
);
1918 /* We can't use sibcalls if a callee-copied argument is
1919 stored in the current function's frame. */
1920 if (!call_from_thunk_p
&& DECL_P (base
) && !TREE_STATIC (base
))
1922 *may_tailcall
= false;
1923 maybe_complain_about_tail_call (exp
,
1924 "a callee-copied argument is"
1925 " stored in the current "
1926 " function's frame");
1929 args
[i
].tree_value
= build_fold_addr_expr_loc (loc
,
1930 args
[i
].tree_value
);
1931 type
= TREE_TYPE (args
[i
].tree_value
);
1933 if (*ecf_flags
& ECF_CONST
)
1934 *ecf_flags
&= ~(ECF_CONST
| ECF_LOOPING_CONST_OR_PURE
);
1938 /* We make a copy of the object and pass the address to the
1939 function being called. */
1942 if (!COMPLETE_TYPE_P (type
)
1943 || TREE_CODE (TYPE_SIZE_UNIT (type
)) != INTEGER_CST
1944 || (flag_stack_check
== GENERIC_STACK_CHECK
1945 && compare_tree_int (TYPE_SIZE_UNIT (type
),
1946 STACK_CHECK_MAX_VAR_SIZE
) > 0))
1948 /* This is a variable-sized object. Make space on the stack
1950 rtx size_rtx
= expr_size (args
[i
].tree_value
);
1952 if (*old_stack_level
== 0)
1954 emit_stack_save (SAVE_BLOCK
, old_stack_level
);
1955 *old_pending_adj
= pending_stack_adjust
;
1956 pending_stack_adjust
= 0;
1959 /* We can pass TRUE as the 4th argument because we just
1960 saved the stack pointer and will restore it right after
1962 copy
= allocate_dynamic_stack_space (size_rtx
,
1965 max_int_size_in_bytes
1968 copy
= gen_rtx_MEM (BLKmode
, copy
);
1969 set_mem_attributes (copy
, type
, 1);
1972 copy
= assign_temp (type
, 1, 0);
1974 store_expr (args
[i
].tree_value
, copy
, 0, false, false);
1976 /* Just change the const function to pure and then let
1977 the next test clear the pure based on
1979 if (*ecf_flags
& ECF_CONST
)
1981 *ecf_flags
&= ~ECF_CONST
;
1982 *ecf_flags
|= ECF_PURE
;
1985 if (!callee_copies
&& *ecf_flags
& ECF_PURE
)
1986 *ecf_flags
&= ~(ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
1989 = build_fold_addr_expr_loc (loc
, make_tree (type
, copy
));
1990 type
= TREE_TYPE (args
[i
].tree_value
);
1991 *may_tailcall
= false;
1992 maybe_complain_about_tail_call (exp
,
1993 "argument must be passed"
1998 unsignedp
= TYPE_UNSIGNED (type
);
1999 mode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
2000 fndecl
? TREE_TYPE (fndecl
) : fntype
, 0);
2002 args
[i
].unsignedp
= unsignedp
;
2003 args
[i
].mode
= mode
;
2005 targetm
.calls
.warn_parameter_passing_abi (args_so_far
, type
);
2007 args
[i
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
, type
,
2008 argpos
< n_named_args
);
2010 if (args
[i
].reg
&& CONST_INT_P (args
[i
].reg
))
2012 args
[i
].special_slot
= args
[i
].reg
;
2016 /* If this is a sibling call and the machine has register windows, the
2017 register window has to be unwinded before calling the routine, so
2018 arguments have to go into the incoming registers. */
2019 if (targetm
.calls
.function_incoming_arg
!= targetm
.calls
.function_arg
)
2020 args
[i
].tail_call_reg
2021 = targetm
.calls
.function_incoming_arg (args_so_far
, mode
, type
,
2022 argpos
< n_named_args
);
2024 args
[i
].tail_call_reg
= args
[i
].reg
;
2028 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, type
,
2029 argpos
< n_named_args
);
2031 args
[i
].pass_on_stack
= targetm
.calls
.must_pass_in_stack (mode
, type
);
2033 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
2034 it means that we are to pass this arg in the register(s) designated
2035 by the PARALLEL, but also to pass it in the stack. */
2036 if (args
[i
].reg
&& GET_CODE (args
[i
].reg
) == PARALLEL
2037 && XEXP (XVECEXP (args
[i
].reg
, 0, 0), 0) == 0)
2038 args
[i
].pass_on_stack
= 1;
2040 /* If this is an addressable type, we must preallocate the stack
2041 since we must evaluate the object into its final location.
2043 If this is to be passed in both registers and the stack, it is simpler
2045 if (TREE_ADDRESSABLE (type
)
2046 || (args
[i
].pass_on_stack
&& args
[i
].reg
!= 0))
2047 *must_preallocate
= 1;
2049 /* No stack allocation and padding for bounds. */
2050 if (POINTER_BOUNDS_P (args
[i
].tree_value
))
2052 /* Compute the stack-size of this argument. */
2053 else if (args
[i
].reg
== 0 || args
[i
].partial
!= 0
2054 || reg_parm_stack_space
> 0
2055 || args
[i
].pass_on_stack
)
2056 locate_and_pad_parm (mode
, type
,
2057 #ifdef STACK_PARMS_IN_REG_PARM_AREA
2062 reg_parm_stack_space
,
2063 args
[i
].pass_on_stack
? 0 : args
[i
].partial
,
2064 fndecl
, args_size
, &args
[i
].locate
);
2065 #ifdef BLOCK_REG_PADDING
2067 /* The argument is passed entirely in registers. See at which
2068 end it should be padded. */
2069 args
[i
].locate
.where_pad
=
2070 BLOCK_REG_PADDING (mode
, type
,
2071 int_size_in_bytes (type
) <= UNITS_PER_WORD
);
2074 /* Update ARGS_SIZE, the total stack space for args so far. */
2076 args_size
->constant
+= args
[i
].locate
.size
.constant
;
2077 if (args
[i
].locate
.size
.var
)
2078 ADD_PARM_SIZE (*args_size
, args
[i
].locate
.size
.var
);
2080 /* Increment ARGS_SO_FAR, which has info about which arg-registers
2081 have been used, etc. */
2083 targetm
.calls
.function_arg_advance (args_so_far
, TYPE_MODE (type
),
2084 type
, argpos
< n_named_args
);
2086 /* Store argument values for functions decorated with attribute
2088 if (argpos
== alloc_idx
[0])
2089 alloc_args
[0] = args
[i
].tree_value
;
2090 else if (argpos
== alloc_idx
[1])
2091 alloc_args
[1] = args
[i
].tree_value
;
2096 /* Check the arguments of functions decorated with attribute
2098 maybe_warn_alloc_args_overflow (fndecl
, exp
, alloc_args
, alloc_idx
);
2101 /* Detect passing non-string arguments to functions expecting
2102 nul-terminated strings. */
2103 maybe_warn_nonstring_arg (fndecl
, exp
);
2106 /* Update ARGS_SIZE to contain the total size for the argument block.
2107 Return the original constant component of the argument block's size.
2109 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
2110 for arguments passed in registers. */
2113 compute_argument_block_size (int reg_parm_stack_space
,
2114 struct args_size
*args_size
,
2115 tree fndecl ATTRIBUTE_UNUSED
,
2116 tree fntype ATTRIBUTE_UNUSED
,
2117 int preferred_stack_boundary ATTRIBUTE_UNUSED
)
2119 int unadjusted_args_size
= args_size
->constant
;
2121 /* For accumulate outgoing args mode we don't need to align, since the frame
2122 will be already aligned. Align to STACK_BOUNDARY in order to prevent
2123 backends from generating misaligned frame sizes. */
2124 if (ACCUMULATE_OUTGOING_ARGS
&& preferred_stack_boundary
> STACK_BOUNDARY
)
2125 preferred_stack_boundary
= STACK_BOUNDARY
;
2127 /* Compute the actual size of the argument block required. The variable
2128 and constant sizes must be combined, the size may have to be rounded,
2129 and there may be a minimum required size. */
2133 args_size
->var
= ARGS_SIZE_TREE (*args_size
);
2134 args_size
->constant
= 0;
2136 preferred_stack_boundary
/= BITS_PER_UNIT
;
2137 if (preferred_stack_boundary
> 1)
2139 /* We don't handle this case yet. To handle it correctly we have
2140 to add the delta, round and subtract the delta.
2141 Currently no machine description requires this support. */
2142 gcc_assert (!(stack_pointer_delta
& (preferred_stack_boundary
- 1)));
2143 args_size
->var
= round_up (args_size
->var
, preferred_stack_boundary
);
2146 if (reg_parm_stack_space
> 0)
2149 = size_binop (MAX_EXPR
, args_size
->var
,
2150 ssize_int (reg_parm_stack_space
));
2152 /* The area corresponding to register parameters is not to count in
2153 the size of the block we need. So make the adjustment. */
2154 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
2156 = size_binop (MINUS_EXPR
, args_size
->var
,
2157 ssize_int (reg_parm_stack_space
));
2162 preferred_stack_boundary
/= BITS_PER_UNIT
;
2163 if (preferred_stack_boundary
< 1)
2164 preferred_stack_boundary
= 1;
2165 args_size
->constant
= (((args_size
->constant
2166 + stack_pointer_delta
2167 + preferred_stack_boundary
- 1)
2168 / preferred_stack_boundary
2169 * preferred_stack_boundary
)
2170 - stack_pointer_delta
);
2172 args_size
->constant
= MAX (args_size
->constant
,
2173 reg_parm_stack_space
);
2175 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
2176 args_size
->constant
-= reg_parm_stack_space
;
2178 return unadjusted_args_size
;
2181 /* Precompute parameters as needed for a function call.
2183 FLAGS is mask of ECF_* constants.
2185 NUM_ACTUALS is the number of arguments.
2187 ARGS is an array containing information for each argument; this
2188 routine fills in the INITIAL_VALUE and VALUE fields for each
2189 precomputed argument. */
2192 precompute_arguments (int num_actuals
, struct arg_data
*args
)
2196 /* If this is a libcall, then precompute all arguments so that we do not
2197 get extraneous instructions emitted as part of the libcall sequence. */
2199 /* If we preallocated the stack space, and some arguments must be passed
2200 on the stack, then we must precompute any parameter which contains a
2201 function call which will store arguments on the stack.
2202 Otherwise, evaluating the parameter may clobber previous parameters
2203 which have already been stored into the stack. (we have code to avoid
2204 such case by saving the outgoing stack arguments, but it results in
2206 if (!ACCUMULATE_OUTGOING_ARGS
)
2209 for (i
= 0; i
< num_actuals
; i
++)
2214 if (TREE_CODE (args
[i
].tree_value
) != CALL_EXPR
)
2217 /* If this is an addressable type, we cannot pre-evaluate it. */
2218 type
= TREE_TYPE (args
[i
].tree_value
);
2219 gcc_assert (!TREE_ADDRESSABLE (type
));
2221 args
[i
].initial_value
= args
[i
].value
2222 = expand_normal (args
[i
].tree_value
);
2224 mode
= TYPE_MODE (type
);
2225 if (mode
!= args
[i
].mode
)
2227 int unsignedp
= args
[i
].unsignedp
;
2229 = convert_modes (args
[i
].mode
, mode
,
2230 args
[i
].value
, args
[i
].unsignedp
);
2232 /* CSE will replace this only if it contains args[i].value
2233 pseudo, so convert it down to the declared mode using
2235 if (REG_P (args
[i
].value
)
2236 && GET_MODE_CLASS (args
[i
].mode
) == MODE_INT
2237 && promote_mode (type
, mode
, &unsignedp
) != args
[i
].mode
)
2239 args
[i
].initial_value
2240 = gen_lowpart_SUBREG (mode
, args
[i
].value
);
2241 SUBREG_PROMOTED_VAR_P (args
[i
].initial_value
) = 1;
2242 SUBREG_PROMOTED_SET (args
[i
].initial_value
, args
[i
].unsignedp
);
2248 /* Given the current state of MUST_PREALLOCATE and information about
2249 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
2250 compute and return the final value for MUST_PREALLOCATE. */
2253 finalize_must_preallocate (int must_preallocate
, int num_actuals
,
2254 struct arg_data
*args
, struct args_size
*args_size
)
2256 /* See if we have or want to preallocate stack space.
2258 If we would have to push a partially-in-regs parm
2259 before other stack parms, preallocate stack space instead.
2261 If the size of some parm is not a multiple of the required stack
2262 alignment, we must preallocate.
2264 If the total size of arguments that would otherwise create a copy in
2265 a temporary (such as a CALL) is more than half the total argument list
2266 size, preallocation is faster.
2268 Another reason to preallocate is if we have a machine (like the m88k)
2269 where stack alignment is required to be maintained between every
2270 pair of insns, not just when the call is made. However, we assume here
2271 that such machines either do not have push insns (and hence preallocation
2272 would occur anyway) or the problem is taken care of with
2275 if (! must_preallocate
)
2277 int partial_seen
= 0;
2278 int copy_to_evaluate_size
= 0;
2281 for (i
= 0; i
< num_actuals
&& ! must_preallocate
; i
++)
2283 if (args
[i
].partial
> 0 && ! args
[i
].pass_on_stack
)
2285 else if (partial_seen
&& args
[i
].reg
== 0)
2286 must_preallocate
= 1;
2287 /* We preallocate in case there are bounds passed
2288 in the bounds table to have precomputed address
2289 for bounds association. */
2290 else if (POINTER_BOUNDS_P (args
[i
].tree_value
)
2292 must_preallocate
= 1;
2294 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
2295 && (TREE_CODE (args
[i
].tree_value
) == CALL_EXPR
2296 || TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
2297 || TREE_CODE (args
[i
].tree_value
) == COND_EXPR
2298 || TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
))))
2299 copy_to_evaluate_size
2300 += int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
2303 if (copy_to_evaluate_size
* 2 >= args_size
->constant
2304 && args_size
->constant
> 0)
2305 must_preallocate
= 1;
2307 return must_preallocate
;
2310 /* If we preallocated stack space, compute the address of each argument
2311 and store it into the ARGS array.
2313 We need not ensure it is a valid memory address here; it will be
2314 validized when it is used.
2316 ARGBLOCK is an rtx for the address of the outgoing arguments. */
2319 compute_argument_addresses (struct arg_data
*args
, rtx argblock
, int num_actuals
)
2323 rtx arg_reg
= argblock
;
2324 int i
, arg_offset
= 0;
2326 if (GET_CODE (argblock
) == PLUS
)
2327 arg_reg
= XEXP (argblock
, 0), arg_offset
= INTVAL (XEXP (argblock
, 1));
2329 for (i
= 0; i
< num_actuals
; i
++)
2331 rtx offset
= ARGS_SIZE_RTX (args
[i
].locate
.offset
);
2332 rtx slot_offset
= ARGS_SIZE_RTX (args
[i
].locate
.slot_offset
);
2334 unsigned int align
, boundary
;
2335 unsigned int units_on_stack
= 0;
2336 machine_mode partial_mode
= VOIDmode
;
2338 /* Skip this parm if it will not be passed on the stack. */
2339 if (! args
[i
].pass_on_stack
2341 && args
[i
].partial
== 0)
2344 /* Pointer Bounds are never passed on the stack. */
2345 if (POINTER_BOUNDS_P (args
[i
].tree_value
))
2348 addr
= simplify_gen_binary (PLUS
, Pmode
, arg_reg
, offset
);
2349 addr
= plus_constant (Pmode
, addr
, arg_offset
);
2351 if (args
[i
].partial
!= 0)
2353 /* Only part of the parameter is being passed on the stack.
2354 Generate a simple memory reference of the correct size. */
2355 units_on_stack
= args
[i
].locate
.size
.constant
;
2356 unsigned int bits_on_stack
= units_on_stack
* BITS_PER_UNIT
;
2357 partial_mode
= int_mode_for_size (bits_on_stack
, 1).else_blk ();
2358 args
[i
].stack
= gen_rtx_MEM (partial_mode
, addr
);
2359 set_mem_size (args
[i
].stack
, units_on_stack
);
2363 args
[i
].stack
= gen_rtx_MEM (args
[i
].mode
, addr
);
2364 set_mem_attributes (args
[i
].stack
,
2365 TREE_TYPE (args
[i
].tree_value
), 1);
2367 align
= BITS_PER_UNIT
;
2368 boundary
= args
[i
].locate
.boundary
;
2369 if (args
[i
].locate
.where_pad
!= PAD_DOWNWARD
)
2371 else if (CONST_INT_P (offset
))
2373 align
= INTVAL (offset
) * BITS_PER_UNIT
| boundary
;
2374 align
= least_bit_hwi (align
);
2376 set_mem_align (args
[i
].stack
, align
);
2378 addr
= simplify_gen_binary (PLUS
, Pmode
, arg_reg
, slot_offset
);
2379 addr
= plus_constant (Pmode
, addr
, arg_offset
);
2381 if (args
[i
].partial
!= 0)
2383 /* Only part of the parameter is being passed on the stack.
2384 Generate a simple memory reference of the correct size.
2386 args
[i
].stack_slot
= gen_rtx_MEM (partial_mode
, addr
);
2387 set_mem_size (args
[i
].stack_slot
, units_on_stack
);
2391 args
[i
].stack_slot
= gen_rtx_MEM (args
[i
].mode
, addr
);
2392 set_mem_attributes (args
[i
].stack_slot
,
2393 TREE_TYPE (args
[i
].tree_value
), 1);
2395 set_mem_align (args
[i
].stack_slot
, args
[i
].locate
.boundary
);
2397 /* Function incoming arguments may overlap with sibling call
2398 outgoing arguments and we cannot allow reordering of reads
2399 from function arguments with stores to outgoing arguments
2400 of sibling calls. */
2401 set_mem_alias_set (args
[i
].stack
, 0);
2402 set_mem_alias_set (args
[i
].stack_slot
, 0);
2407 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
2408 in a call instruction.
2410 FNDECL is the tree node for the target function. For an indirect call
2411 FNDECL will be NULL_TREE.
2413 ADDR is the operand 0 of CALL_EXPR for this call. */
2416 rtx_for_function_call (tree fndecl
, tree addr
)
2420 /* Get the function to call, in the form of RTL. */
2423 if (!TREE_USED (fndecl
) && fndecl
!= current_function_decl
)
2424 TREE_USED (fndecl
) = 1;
2426 /* Get a SYMBOL_REF rtx for the function address. */
2427 funexp
= XEXP (DECL_RTL (fndecl
), 0);
2430 /* Generate an rtx (probably a pseudo-register) for the address. */
2433 funexp
= expand_normal (addr
);
2434 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
2439 /* Internal state for internal_arg_pointer_based_exp and its helpers. */
2442 /* Last insn that has been scanned by internal_arg_pointer_based_exp_scan,
2443 or NULL_RTX if none has been scanned yet. */
2444 rtx_insn
*scan_start
;
2445 /* Vector indexed by REGNO - FIRST_PSEUDO_REGISTER, recording if a pseudo is
2446 based on crtl->args.internal_arg_pointer. The element is NULL_RTX if the
2447 pseudo isn't based on it, a CONST_INT offset if the pseudo is based on it
2448 with fixed offset, or PC if this is with variable or unknown offset. */
2450 } internal_arg_pointer_exp_state
;
2452 static rtx
internal_arg_pointer_based_exp (const_rtx
, bool);
2454 /* Helper function for internal_arg_pointer_based_exp. Scan insns in
2455 the tail call sequence, starting with first insn that hasn't been
2456 scanned yet, and note for each pseudo on the LHS whether it is based
2457 on crtl->args.internal_arg_pointer or not, and what offset from that
2458 that pointer it has. */
2461 internal_arg_pointer_based_exp_scan (void)
2463 rtx_insn
*insn
, *scan_start
= internal_arg_pointer_exp_state
.scan_start
;
2465 if (scan_start
== NULL_RTX
)
2466 insn
= get_insns ();
2468 insn
= NEXT_INSN (scan_start
);
2472 rtx set
= single_set (insn
);
2473 if (set
&& REG_P (SET_DEST (set
)) && !HARD_REGISTER_P (SET_DEST (set
)))
2476 unsigned int idx
= REGNO (SET_DEST (set
)) - FIRST_PSEUDO_REGISTER
;
2477 /* Punt on pseudos set multiple times. */
2478 if (idx
< internal_arg_pointer_exp_state
.cache
.length ()
2479 && (internal_arg_pointer_exp_state
.cache
[idx
]
2483 val
= internal_arg_pointer_based_exp (SET_SRC (set
), false);
2484 if (val
!= NULL_RTX
)
2486 if (idx
>= internal_arg_pointer_exp_state
.cache
.length ())
2487 internal_arg_pointer_exp_state
.cache
2488 .safe_grow_cleared (idx
+ 1);
2489 internal_arg_pointer_exp_state
.cache
[idx
] = val
;
2492 if (NEXT_INSN (insn
) == NULL_RTX
)
2494 insn
= NEXT_INSN (insn
);
2497 internal_arg_pointer_exp_state
.scan_start
= scan_start
;
2500 /* Compute whether RTL is based on crtl->args.internal_arg_pointer. Return
2501 NULL_RTX if RTL isn't based on it, a CONST_INT offset if RTL is based on
2502 it with fixed offset, or PC if this is with variable or unknown offset.
2503 TOPLEVEL is true if the function is invoked at the topmost level. */
2506 internal_arg_pointer_based_exp (const_rtx rtl
, bool toplevel
)
2508 if (CONSTANT_P (rtl
))
2511 if (rtl
== crtl
->args
.internal_arg_pointer
)
2514 if (REG_P (rtl
) && HARD_REGISTER_P (rtl
))
2517 if (GET_CODE (rtl
) == PLUS
&& CONST_INT_P (XEXP (rtl
, 1)))
2519 rtx val
= internal_arg_pointer_based_exp (XEXP (rtl
, 0), toplevel
);
2520 if (val
== NULL_RTX
|| val
== pc_rtx
)
2522 return plus_constant (Pmode
, val
, INTVAL (XEXP (rtl
, 1)));
2525 /* When called at the topmost level, scan pseudo assignments in between the
2526 last scanned instruction in the tail call sequence and the latest insn
2527 in that sequence. */
2529 internal_arg_pointer_based_exp_scan ();
2533 unsigned int idx
= REGNO (rtl
) - FIRST_PSEUDO_REGISTER
;
2534 if (idx
< internal_arg_pointer_exp_state
.cache
.length ())
2535 return internal_arg_pointer_exp_state
.cache
[idx
];
2540 subrtx_iterator::array_type array
;
2541 FOR_EACH_SUBRTX (iter
, array
, rtl
, NONCONST
)
2543 const_rtx x
= *iter
;
2544 if (REG_P (x
) && internal_arg_pointer_based_exp (x
, false) != NULL_RTX
)
2547 iter
.skip_subrtxes ();
2553 /* Return true if and only if SIZE storage units (usually bytes)
2554 starting from address ADDR overlap with already clobbered argument
2555 area. This function is used to determine if we should give up a
2559 mem_overlaps_already_clobbered_arg_p (rtx addr
, unsigned HOST_WIDE_INT size
)
2564 if (bitmap_empty_p (stored_args_map
))
2566 val
= internal_arg_pointer_based_exp (addr
, true);
2567 if (val
== NULL_RTX
)
2569 else if (val
== pc_rtx
)
2574 if (STACK_GROWS_DOWNWARD
)
2575 i
-= crtl
->args
.pretend_args_size
;
2577 i
+= crtl
->args
.pretend_args_size
;
2580 if (ARGS_GROW_DOWNWARD
)
2585 unsigned HOST_WIDE_INT k
;
2587 for (k
= 0; k
< size
; k
++)
2588 if (i
+ k
< SBITMAP_SIZE (stored_args_map
)
2589 && bitmap_bit_p (stored_args_map
, i
+ k
))
2596 /* Do the register loads required for any wholly-register parms or any
2597 parms which are passed both on the stack and in a register. Their
2598 expressions were already evaluated.
2600 Mark all register-parms as living through the call, putting these USE
2601 insns in the CALL_INSN_FUNCTION_USAGE field.
2603 When IS_SIBCALL, perform the check_sibcall_argument_overlap
2604 checking, setting *SIBCALL_FAILURE if appropriate. */
2607 load_register_parameters (struct arg_data
*args
, int num_actuals
,
2608 rtx
*call_fusage
, int flags
, int is_sibcall
,
2609 int *sibcall_failure
)
2613 for (i
= 0; i
< num_actuals
; i
++)
2615 rtx reg
= ((flags
& ECF_SIBCALL
)
2616 ? args
[i
].tail_call_reg
: args
[i
].reg
);
2619 int partial
= args
[i
].partial
;
2622 rtx_insn
*before_arg
= get_last_insn ();
2623 /* Set non-negative if we must move a word at a time, even if
2624 just one word (e.g, partial == 4 && mode == DFmode). Set
2625 to -1 if we just use a normal move insn. This value can be
2626 zero if the argument is a zero size structure. */
2628 if (GET_CODE (reg
) == PARALLEL
)
2632 gcc_assert (partial
% UNITS_PER_WORD
== 0);
2633 nregs
= partial
/ UNITS_PER_WORD
;
2635 else if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
)
2637 size
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
2638 nregs
= (size
+ (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
2641 size
= GET_MODE_SIZE (args
[i
].mode
);
2643 /* Handle calls that pass values in multiple non-contiguous
2644 locations. The Irix 6 ABI has examples of this. */
2646 if (GET_CODE (reg
) == PARALLEL
)
2647 emit_group_move (reg
, args
[i
].parallel_value
);
2649 /* If simple case, just do move. If normal partial, store_one_arg
2650 has already loaded the register for us. In all other cases,
2651 load the register(s) from memory. */
2653 else if (nregs
== -1)
2655 emit_move_insn (reg
, args
[i
].value
);
2656 #ifdef BLOCK_REG_PADDING
2657 /* Handle case where we have a value that needs shifting
2658 up to the msb. eg. a QImode value and we're padding
2659 upward on a BYTES_BIG_ENDIAN machine. */
2660 if (size
< UNITS_PER_WORD
2661 && (args
[i
].locate
.where_pad
2662 == (BYTES_BIG_ENDIAN
? PAD_UPWARD
: PAD_DOWNWARD
)))
2665 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
2667 /* Assigning REG here rather than a temp makes CALL_FUSAGE
2668 report the whole reg as used. Strictly speaking, the
2669 call only uses SIZE bytes at the msb end, but it doesn't
2670 seem worth generating rtl to say that. */
2671 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
2672 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, shift
, reg
, 1);
2674 emit_move_insn (reg
, x
);
2679 /* If we have pre-computed the values to put in the registers in
2680 the case of non-aligned structures, copy them in now. */
2682 else if (args
[i
].n_aligned_regs
!= 0)
2683 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
2684 emit_move_insn (gen_rtx_REG (word_mode
, REGNO (reg
) + j
),
2685 args
[i
].aligned_regs
[j
]);
2687 else if (partial
== 0 || args
[i
].pass_on_stack
)
2689 rtx mem
= validize_mem (copy_rtx (args
[i
].value
));
2691 /* Check for overlap with already clobbered argument area,
2692 providing that this has non-zero size. */
2695 && (mem_overlaps_already_clobbered_arg_p
2696 (XEXP (args
[i
].value
, 0), size
)))
2697 *sibcall_failure
= 1;
2699 if (size
% UNITS_PER_WORD
== 0
2700 || MEM_ALIGN (mem
) % BITS_PER_WORD
== 0)
2701 move_block_to_reg (REGNO (reg
), mem
, nregs
, args
[i
].mode
);
2705 move_block_to_reg (REGNO (reg
), mem
, nregs
- 1,
2707 rtx dest
= gen_rtx_REG (word_mode
, REGNO (reg
) + nregs
- 1);
2708 unsigned int bitoff
= (nregs
- 1) * BITS_PER_WORD
;
2709 unsigned int bitsize
= size
* BITS_PER_UNIT
- bitoff
;
2710 rtx x
= extract_bit_field (mem
, bitsize
, bitoff
, 1, dest
,
2711 word_mode
, word_mode
, false,
2713 if (BYTES_BIG_ENDIAN
)
2714 x
= expand_shift (LSHIFT_EXPR
, word_mode
, x
,
2715 BITS_PER_WORD
- bitsize
, dest
, 1);
2717 emit_move_insn (dest
, x
);
2720 /* Handle a BLKmode that needs shifting. */
2721 if (nregs
== 1 && size
< UNITS_PER_WORD
2722 #ifdef BLOCK_REG_PADDING
2723 && args
[i
].locate
.where_pad
== PAD_DOWNWARD
2729 rtx dest
= gen_rtx_REG (word_mode
, REGNO (reg
));
2730 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
2731 enum tree_code dir
= (BYTES_BIG_ENDIAN
2732 ? RSHIFT_EXPR
: LSHIFT_EXPR
);
2735 x
= expand_shift (dir
, word_mode
, dest
, shift
, dest
, 1);
2737 emit_move_insn (dest
, x
);
2741 /* When a parameter is a block, and perhaps in other cases, it is
2742 possible that it did a load from an argument slot that was
2743 already clobbered. */
2745 && check_sibcall_argument_overlap (before_arg
, &args
[i
], 0))
2746 *sibcall_failure
= 1;
2748 /* Handle calls that pass values in multiple non-contiguous
2749 locations. The Irix 6 ABI has examples of this. */
2750 if (GET_CODE (reg
) == PARALLEL
)
2751 use_group_regs (call_fusage
, reg
);
2752 else if (nregs
== -1)
2753 use_reg_mode (call_fusage
, reg
,
2754 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)));
2756 use_regs (call_fusage
, REGNO (reg
), nregs
);
2761 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
2762 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
2763 bytes, then we would need to push some additional bytes to pad the
2764 arguments. So, we compute an adjust to the stack pointer for an
2765 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
2766 bytes. Then, when the arguments are pushed the stack will be perfectly
2767 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
2768 be popped after the call. Returns the adjustment. */
2771 combine_pending_stack_adjustment_and_call (int unadjusted_args_size
,
2772 struct args_size
*args_size
,
2773 unsigned int preferred_unit_stack_boundary
)
2775 /* The number of bytes to pop so that the stack will be
2776 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
2777 HOST_WIDE_INT adjustment
;
2778 /* The alignment of the stack after the arguments are pushed, if we
2779 just pushed the arguments without adjust the stack here. */
2780 unsigned HOST_WIDE_INT unadjusted_alignment
;
2782 unadjusted_alignment
2783 = ((stack_pointer_delta
+ unadjusted_args_size
)
2784 % preferred_unit_stack_boundary
);
2786 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
2787 as possible -- leaving just enough left to cancel out the
2788 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
2789 PENDING_STACK_ADJUST is non-negative, and congruent to
2790 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
2792 /* Begin by trying to pop all the bytes. */
2793 unadjusted_alignment
2794 = (unadjusted_alignment
2795 - (pending_stack_adjust
% preferred_unit_stack_boundary
));
2796 adjustment
= pending_stack_adjust
;
2797 /* Push enough additional bytes that the stack will be aligned
2798 after the arguments are pushed. */
2799 if (preferred_unit_stack_boundary
> 1 && unadjusted_alignment
)
2800 adjustment
-= preferred_unit_stack_boundary
- unadjusted_alignment
;
2802 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
2803 bytes after the call. The right number is the entire
2804 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
2805 by the arguments in the first place. */
2807 = pending_stack_adjust
- adjustment
+ unadjusted_args_size
;
2812 /* Scan X expression if it does not dereference any argument slots
2813 we already clobbered by tail call arguments (as noted in stored_args_map
2815 Return nonzero if X expression dereferences such argument slots,
2819 check_sibcall_argument_overlap_1 (rtx x
)
2828 code
= GET_CODE (x
);
2830 /* We need not check the operands of the CALL expression itself. */
2835 return mem_overlaps_already_clobbered_arg_p (XEXP (x
, 0),
2836 GET_MODE_SIZE (GET_MODE (x
)));
2838 /* Scan all subexpressions. */
2839 fmt
= GET_RTX_FORMAT (code
);
2840 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
2844 if (check_sibcall_argument_overlap_1 (XEXP (x
, i
)))
2847 else if (*fmt
== 'E')
2849 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2850 if (check_sibcall_argument_overlap_1 (XVECEXP (x
, i
, j
)))
2857 /* Scan sequence after INSN if it does not dereference any argument slots
2858 we already clobbered by tail call arguments (as noted in stored_args_map
2859 bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
2860 stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP
2861 should be 0). Return nonzero if sequence after INSN dereferences such argument
2862 slots, zero otherwise. */
2865 check_sibcall_argument_overlap (rtx_insn
*insn
, struct arg_data
*arg
,
2866 int mark_stored_args_map
)
2870 if (insn
== NULL_RTX
)
2871 insn
= get_insns ();
2873 insn
= NEXT_INSN (insn
);
2875 for (; insn
; insn
= NEXT_INSN (insn
))
2877 && check_sibcall_argument_overlap_1 (PATTERN (insn
)))
2880 if (mark_stored_args_map
)
2882 if (ARGS_GROW_DOWNWARD
)
2883 low
= -arg
->locate
.slot_offset
.constant
- arg
->locate
.size
.constant
;
2885 low
= arg
->locate
.slot_offset
.constant
;
2887 for (high
= low
+ arg
->locate
.size
.constant
; low
< high
; low
++)
2888 bitmap_set_bit (stored_args_map
, low
);
2890 return insn
!= NULL_RTX
;
2893 /* Given that a function returns a value of mode MODE at the most
2894 significant end of hard register VALUE, shift VALUE left or right
2895 as specified by LEFT_P. Return true if some action was needed. */
2898 shift_return_value (machine_mode mode
, bool left_p
, rtx value
)
2900 HOST_WIDE_INT shift
;
2902 gcc_assert (REG_P (value
) && HARD_REGISTER_P (value
));
2903 machine_mode value_mode
= GET_MODE (value
);
2904 shift
= GET_MODE_BITSIZE (value_mode
) - GET_MODE_BITSIZE (mode
);
2908 /* Use ashr rather than lshr for right shifts. This is for the benefit
2909 of the MIPS port, which requires SImode values to be sign-extended
2910 when stored in 64-bit registers. */
2911 if (!force_expand_binop (value_mode
, left_p
? ashl_optab
: ashr_optab
,
2912 value
, gen_int_shift_amount (value_mode
, shift
),
2913 value
, 1, OPTAB_WIDEN
))
2918 /* If X is a likely-spilled register value, copy it to a pseudo
2919 register and return that register. Return X otherwise. */
2922 avoid_likely_spilled_reg (rtx x
)
2927 && HARD_REGISTER_P (x
)
2928 && targetm
.class_likely_spilled_p (REGNO_REG_CLASS (REGNO (x
))))
2930 /* Make sure that we generate a REG rather than a CONCAT.
2931 Moves into CONCATs can need nontrivial instructions,
2932 and the whole point of this function is to avoid
2933 using the hard register directly in such a situation. */
2934 generating_concat_p
= 0;
2935 new_rtx
= gen_reg_rtx (GET_MODE (x
));
2936 generating_concat_p
= 1;
2937 emit_move_insn (new_rtx
, x
);
2943 /* Helper function for expand_call.
2944 Return false is EXP is not implementable as a sibling call. */
2947 can_implement_as_sibling_call_p (tree exp
,
2948 rtx structure_value_addr
,
2950 int reg_parm_stack_space ATTRIBUTE_UNUSED
,
2954 const args_size
&args_size
)
2956 if (!targetm
.have_sibcall_epilogue ())
2958 maybe_complain_about_tail_call
2960 "machine description does not have"
2961 " a sibcall_epilogue instruction pattern");
2965 /* Doing sibling call optimization needs some work, since
2966 structure_value_addr can be allocated on the stack.
2967 It does not seem worth the effort since few optimizable
2968 sibling calls will return a structure. */
2969 if (structure_value_addr
!= NULL_RTX
)
2971 maybe_complain_about_tail_call (exp
, "callee returns a structure");
2975 #ifdef REG_PARM_STACK_SPACE
2976 /* If outgoing reg parm stack space changes, we can not do sibcall. */
2977 if (OUTGOING_REG_PARM_STACK_SPACE (funtype
)
2978 != OUTGOING_REG_PARM_STACK_SPACE (TREE_TYPE (current_function_decl
))
2979 || (reg_parm_stack_space
!= REG_PARM_STACK_SPACE (current_function_decl
)))
2981 maybe_complain_about_tail_call (exp
,
2982 "inconsistent size of stack space"
2983 " allocated for arguments which are"
2984 " passed in registers");
2989 /* Check whether the target is able to optimize the call
2991 if (!targetm
.function_ok_for_sibcall (fndecl
, exp
))
2993 maybe_complain_about_tail_call (exp
,
2994 "target is not able to optimize the"
2995 " call into a sibling call");
2999 /* Functions that do not return exactly once may not be sibcall
3001 if (flags
& ECF_RETURNS_TWICE
)
3003 maybe_complain_about_tail_call (exp
, "callee returns twice");
3006 if (flags
& ECF_NORETURN
)
3008 maybe_complain_about_tail_call (exp
, "callee does not return");
3012 if (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (addr
))))
3014 maybe_complain_about_tail_call (exp
, "volatile function type");
3018 /* If the called function is nested in the current one, it might access
3019 some of the caller's arguments, but could clobber them beforehand if
3020 the argument areas are shared. */
3021 if (fndecl
&& decl_function_context (fndecl
) == current_function_decl
)
3023 maybe_complain_about_tail_call (exp
, "nested function");
3027 /* If this function requires more stack slots than the current
3028 function, we cannot change it into a sibling call.
3029 crtl->args.pretend_args_size is not part of the
3030 stack allocated by our caller. */
3031 if (args_size
.constant
> (crtl
->args
.size
- crtl
->args
.pretend_args_size
))
3033 maybe_complain_about_tail_call (exp
,
3034 "callee required more stack slots"
3035 " than the caller");
3039 /* If the callee pops its own arguments, then it must pop exactly
3040 the same number of arguments as the current function. */
3041 if (targetm
.calls
.return_pops_args (fndecl
, funtype
, args_size
.constant
)
3042 != targetm
.calls
.return_pops_args (current_function_decl
,
3043 TREE_TYPE (current_function_decl
),
3046 maybe_complain_about_tail_call (exp
,
3047 "inconsistent number of"
3048 " popped arguments");
3052 if (!lang_hooks
.decls
.ok_for_sibcall (fndecl
))
3054 maybe_complain_about_tail_call (exp
, "frontend does not support"
3059 /* All checks passed. */
3063 /* Generate all the code for a CALL_EXPR exp
3064 and return an rtx for its value.
3065 Store the value in TARGET (specified as an rtx) if convenient.
3066 If the value is stored in TARGET then TARGET is returned.
3067 If IGNORE is nonzero, then we ignore the value of the function call. */
3070 expand_call (tree exp
, rtx target
, int ignore
)
3072 /* Nonzero if we are currently expanding a call. */
3073 static int currently_expanding_call
= 0;
3075 /* RTX for the function to be called. */
3077 /* Sequence of insns to perform a normal "call". */
3078 rtx_insn
*normal_call_insns
= NULL
;
3079 /* Sequence of insns to perform a tail "call". */
3080 rtx_insn
*tail_call_insns
= NULL
;
3081 /* Data type of the function. */
3083 tree type_arg_types
;
3085 /* Declaration of the function being called,
3086 or 0 if the function is computed (not known by name). */
3088 /* The type of the function being called. */
3090 bool try_tail_call
= CALL_EXPR_TAILCALL (exp
);
3091 bool must_tail_call
= CALL_EXPR_MUST_TAIL_CALL (exp
);
3094 /* Register in which non-BLKmode value will be returned,
3095 or 0 if no value or if value is BLKmode. */
3097 /* Register(s) in which bounds are returned. */
3099 /* Address where we should return a BLKmode value;
3100 0 if value not BLKmode. */
3101 rtx structure_value_addr
= 0;
3102 /* Nonzero if that address is being passed by treating it as
3103 an extra, implicit first parameter. Otherwise,
3104 it is passed by being copied directly into struct_value_rtx. */
3105 int structure_value_addr_parm
= 0;
3106 /* Holds the value of implicit argument for the struct value. */
3107 tree structure_value_addr_value
= NULL_TREE
;
3108 /* Size of aggregate value wanted, or zero if none wanted
3109 or if we are using the non-reentrant PCC calling convention
3110 or expecting the value in registers. */
3111 HOST_WIDE_INT struct_value_size
= 0;
3112 /* Nonzero if called function returns an aggregate in memory PCC style,
3113 by returning the address of where to find it. */
3114 int pcc_struct_value
= 0;
3115 rtx struct_value
= 0;
3117 /* Number of actual parameters in this call, including struct value addr. */
3119 /* Number of named args. Args after this are anonymous ones
3120 and they must all go on the stack. */
3122 /* Number of complex actual arguments that need to be split. */
3123 int num_complex_actuals
= 0;
3125 /* Vector of information about each argument.
3126 Arguments are numbered in the order they will be pushed,
3127 not the order they are written. */
3128 struct arg_data
*args
;
3130 /* Total size in bytes of all the stack-parms scanned so far. */
3131 struct args_size args_size
;
3132 struct args_size adjusted_args_size
;
3133 /* Size of arguments before any adjustments (such as rounding). */
3134 int unadjusted_args_size
;
3135 /* Data on reg parms scanned so far. */
3136 CUMULATIVE_ARGS args_so_far_v
;
3137 cumulative_args_t args_so_far
;
3138 /* Nonzero if a reg parm has been scanned. */
3140 /* Nonzero if this is an indirect function call. */
3142 /* Nonzero if we must avoid push-insns in the args for this call.
3143 If stack space is allocated for register parameters, but not by the
3144 caller, then it is preallocated in the fixed part of the stack frame.
3145 So the entire argument block must then be preallocated (i.e., we
3146 ignore PUSH_ROUNDING in that case). */
3148 int must_preallocate
= !PUSH_ARGS
;
3150 /* Size of the stack reserved for parameter registers. */
3151 int reg_parm_stack_space
= 0;
3153 /* Address of space preallocated for stack parms
3154 (on machines that lack push insns), or 0 if space not preallocated. */
3157 /* Mask of ECF_ and ERF_ flags. */
3159 int return_flags
= 0;
3160 #ifdef REG_PARM_STACK_SPACE
3161 /* Define the boundary of the register parm stack space that needs to be
3163 int low_to_save
, high_to_save
;
3164 rtx save_area
= 0; /* Place that it is saved */
3167 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
3168 char *initial_stack_usage_map
= stack_usage_map
;
3169 char *stack_usage_map_buf
= NULL
;
3171 int old_stack_allocated
;
3173 /* State variables to track stack modifications. */
3174 rtx old_stack_level
= 0;
3175 int old_stack_arg_under_construction
= 0;
3176 int old_pending_adj
= 0;
3177 int old_inhibit_defer_pop
= inhibit_defer_pop
;
3179 /* Some stack pointer alterations we make are performed via
3180 allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
3181 which we then also need to save/restore along the way. */
3182 int old_stack_pointer_delta
= 0;
3185 tree addr
= CALL_EXPR_FN (exp
);
3187 /* The alignment of the stack, in bits. */
3188 unsigned HOST_WIDE_INT preferred_stack_boundary
;
3189 /* The alignment of the stack, in bytes. */
3190 unsigned HOST_WIDE_INT preferred_unit_stack_boundary
;
3191 /* The static chain value to use for this call. */
3192 rtx static_chain_value
;
3193 /* See if this is "nothrow" function call. */
3194 if (TREE_NOTHROW (exp
))
3195 flags
|= ECF_NOTHROW
;
3197 /* See if we can find a DECL-node for the actual function, and get the
3198 function attributes (flags) from the function decl or type node. */
3199 fndecl
= get_callee_fndecl (exp
);
3202 fntype
= TREE_TYPE (fndecl
);
3203 flags
|= flags_from_decl_or_type (fndecl
);
3204 return_flags
|= decl_return_flags (fndecl
);
3208 fntype
= TREE_TYPE (TREE_TYPE (addr
));
3209 flags
|= flags_from_decl_or_type (fntype
);
3210 if (CALL_EXPR_BY_DESCRIPTOR (exp
))
3211 flags
|= ECF_BY_DESCRIPTOR
;
3213 rettype
= TREE_TYPE (exp
);
3215 struct_value
= targetm
.calls
.struct_value_rtx (fntype
, 0);
3217 /* Warn if this value is an aggregate type,
3218 regardless of which calling convention we are using for it. */
3219 if (AGGREGATE_TYPE_P (rettype
))
3220 warning (OPT_Waggregate_return
, "function call has aggregate value");
3222 /* If the result of a non looping pure or const function call is
3223 ignored (or void), and none of its arguments are volatile, we can
3224 avoid expanding the call and just evaluate the arguments for
3226 if ((flags
& (ECF_CONST
| ECF_PURE
))
3227 && (!(flags
& ECF_LOOPING_CONST_OR_PURE
))
3228 && (ignore
|| target
== const0_rtx
3229 || TYPE_MODE (rettype
) == VOIDmode
))
3231 bool volatilep
= false;
3233 call_expr_arg_iterator iter
;
3235 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
3236 if (TREE_THIS_VOLATILE (arg
))
3244 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
3245 expand_expr (arg
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3250 #ifdef REG_PARM_STACK_SPACE
3251 reg_parm_stack_space
= REG_PARM_STACK_SPACE (!fndecl
? fntype
: fndecl
);
3254 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
3255 && reg_parm_stack_space
> 0 && PUSH_ARGS
)
3256 must_preallocate
= 1;
3258 /* Set up a place to return a structure. */
3260 /* Cater to broken compilers. */
3261 if (aggregate_value_p (exp
, fntype
))
3263 /* This call returns a big structure. */
3264 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
3266 #ifdef PCC_STATIC_STRUCT_RETURN
3268 pcc_struct_value
= 1;
3270 #else /* not PCC_STATIC_STRUCT_RETURN */
3272 struct_value_size
= int_size_in_bytes (rettype
);
3274 /* Even if it is semantically safe to use the target as the return
3275 slot, it may be not sufficiently aligned for the return type. */
3276 if (CALL_EXPR_RETURN_SLOT_OPT (exp
)
3279 && !(MEM_ALIGN (target
) < TYPE_ALIGN (rettype
)
3280 && targetm
.slow_unaligned_access (TYPE_MODE (rettype
),
3281 MEM_ALIGN (target
))))
3282 structure_value_addr
= XEXP (target
, 0);
3285 /* For variable-sized objects, we must be called with a target
3286 specified. If we were to allocate space on the stack here,
3287 we would have no way of knowing when to free it. */
3288 rtx d
= assign_temp (rettype
, 1, 1);
3289 structure_value_addr
= XEXP (d
, 0);
3293 #endif /* not PCC_STATIC_STRUCT_RETURN */
3296 /* Figure out the amount to which the stack should be aligned. */
3297 preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
3300 struct cgraph_rtl_info
*i
= cgraph_node::rtl_info (fndecl
);
3301 /* Without automatic stack alignment, we can't increase preferred
3302 stack boundary. With automatic stack alignment, it is
3303 unnecessary since unless we can guarantee that all callers will
3304 align the outgoing stack properly, callee has to align its
3307 && i
->preferred_incoming_stack_boundary
3308 && i
->preferred_incoming_stack_boundary
< preferred_stack_boundary
)
3309 preferred_stack_boundary
= i
->preferred_incoming_stack_boundary
;
3312 /* Operand 0 is a pointer-to-function; get the type of the function. */
3313 funtype
= TREE_TYPE (addr
);
3314 gcc_assert (POINTER_TYPE_P (funtype
));
3315 funtype
= TREE_TYPE (funtype
);
3317 /* Count whether there are actual complex arguments that need to be split
3318 into their real and imaginary parts. Munge the type_arg_types
3319 appropriately here as well. */
3320 if (targetm
.calls
.split_complex_arg
)
3322 call_expr_arg_iterator iter
;
3324 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
3326 tree type
= TREE_TYPE (arg
);
3327 if (type
&& TREE_CODE (type
) == COMPLEX_TYPE
3328 && targetm
.calls
.split_complex_arg (type
))
3329 num_complex_actuals
++;
3331 type_arg_types
= split_complex_types (TYPE_ARG_TYPES (funtype
));
3334 type_arg_types
= TYPE_ARG_TYPES (funtype
);
3336 if (flags
& ECF_MAY_BE_ALLOCA
)
3337 cfun
->calls_alloca
= 1;
3339 /* If struct_value_rtx is 0, it means pass the address
3340 as if it were an extra parameter. Put the argument expression
3341 in structure_value_addr_value. */
3342 if (structure_value_addr
&& struct_value
== 0)
3344 /* If structure_value_addr is a REG other than
3345 virtual_outgoing_args_rtx, we can use always use it. If it
3346 is not a REG, we must always copy it into a register.
3347 If it is virtual_outgoing_args_rtx, we must copy it to another
3348 register in some cases. */
3349 rtx temp
= (!REG_P (structure_value_addr
)
3350 || (ACCUMULATE_OUTGOING_ARGS
3351 && stack_arg_under_construction
3352 && structure_value_addr
== virtual_outgoing_args_rtx
)
3353 ? copy_addr_to_reg (convert_memory_address
3354 (Pmode
, structure_value_addr
))
3355 : structure_value_addr
);
3357 structure_value_addr_value
=
3358 make_tree (build_pointer_type (TREE_TYPE (funtype
)), temp
);
3359 structure_value_addr_parm
= CALL_WITH_BOUNDS_P (exp
) ? 2 : 1;
3362 /* Count the arguments and set NUM_ACTUALS. */
3364 call_expr_nargs (exp
) + num_complex_actuals
+ structure_value_addr_parm
;
3366 /* Compute number of named args.
3367 First, do a raw count of the args for INIT_CUMULATIVE_ARGS. */
3369 if (type_arg_types
!= 0)
3371 = (list_length (type_arg_types
)
3372 /* Count the struct value address, if it is passed as a parm. */
3373 + structure_value_addr_parm
);
3375 /* If we know nothing, treat all args as named. */
3376 n_named_args
= num_actuals
;
3378 /* Start updating where the next arg would go.
3380 On some machines (such as the PA) indirect calls have a different
3381 calling convention than normal calls. The fourth argument in
3382 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
3384 INIT_CUMULATIVE_ARGS (args_so_far_v
, funtype
, NULL_RTX
, fndecl
, n_named_args
);
3385 args_so_far
= pack_cumulative_args (&args_so_far_v
);
3387 /* Now possibly adjust the number of named args.
3388 Normally, don't include the last named arg if anonymous args follow.
3389 We do include the last named arg if
3390 targetm.calls.strict_argument_naming() returns nonzero.
3391 (If no anonymous args follow, the result of list_length is actually
3392 one too large. This is harmless.)
3394 If targetm.calls.pretend_outgoing_varargs_named() returns
3395 nonzero, and targetm.calls.strict_argument_naming() returns zero,
3396 this machine will be able to place unnamed args that were passed
3397 in registers into the stack. So treat all args as named. This
3398 allows the insns emitting for a specific argument list to be
3399 independent of the function declaration.
3401 If targetm.calls.pretend_outgoing_varargs_named() returns zero,
3402 we do not have any reliable way to pass unnamed args in
3403 registers, so we must force them into memory. */
3405 if (type_arg_types
!= 0
3406 && targetm
.calls
.strict_argument_naming (args_so_far
))
3408 else if (type_arg_types
!= 0
3409 && ! targetm
.calls
.pretend_outgoing_varargs_named (args_so_far
))
3410 /* Don't include the last named arg. */
3413 /* Treat all args as named. */
3414 n_named_args
= num_actuals
;
3416 /* Make a vector to hold all the information about each arg. */
3417 args
= XCNEWVEC (struct arg_data
, num_actuals
);
3419 /* Build up entries in the ARGS array, compute the size of the
3420 arguments into ARGS_SIZE, etc. */
3421 initialize_argument_information (num_actuals
, args
, &args_size
,
3423 structure_value_addr_value
, fndecl
, fntype
,
3424 args_so_far
, reg_parm_stack_space
,
3425 &old_stack_level
, &old_pending_adj
,
3426 &must_preallocate
, &flags
,
3427 &try_tail_call
, CALL_FROM_THUNK_P (exp
));
3430 must_preallocate
= 1;
3432 /* Now make final decision about preallocating stack space. */
3433 must_preallocate
= finalize_must_preallocate (must_preallocate
,
3437 /* If the structure value address will reference the stack pointer, we
3438 must stabilize it. We don't need to do this if we know that we are
3439 not going to adjust the stack pointer in processing this call. */
3441 if (structure_value_addr
3442 && (reg_mentioned_p (virtual_stack_dynamic_rtx
, structure_value_addr
)
3443 || reg_mentioned_p (virtual_outgoing_args_rtx
,
3444 structure_value_addr
))
3446 || (!ACCUMULATE_OUTGOING_ARGS
&& args_size
.constant
)))
3447 structure_value_addr
= copy_to_reg (structure_value_addr
);
3449 /* Tail calls can make things harder to debug, and we've traditionally
3450 pushed these optimizations into -O2. Don't try if we're already
3451 expanding a call, as that means we're an argument. Don't try if
3452 there's cleanups, as we know there's code to follow the call. */
3454 if (currently_expanding_call
++ != 0
3455 || !flag_optimize_sibling_calls
3457 || dbg_cnt (tail_call
) == false)
3460 /* If the user has marked the function as requiring tail-call
3461 optimization, attempt it. */
3465 /* Rest of purposes for tail call optimizations to fail. */
3467 try_tail_call
= can_implement_as_sibling_call_p (exp
,
3468 structure_value_addr
,
3470 reg_parm_stack_space
,
3472 flags
, addr
, args_size
);
3474 /* Check if caller and callee disagree in promotion of function
3478 machine_mode caller_mode
, caller_promoted_mode
;
3479 machine_mode callee_mode
, callee_promoted_mode
;
3480 int caller_unsignedp
, callee_unsignedp
;
3481 tree caller_res
= DECL_RESULT (current_function_decl
);
3483 caller_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (caller_res
));
3484 caller_mode
= DECL_MODE (caller_res
);
3485 callee_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (funtype
));
3486 callee_mode
= TYPE_MODE (TREE_TYPE (funtype
));
3487 caller_promoted_mode
3488 = promote_function_mode (TREE_TYPE (caller_res
), caller_mode
,
3490 TREE_TYPE (current_function_decl
), 1);
3491 callee_promoted_mode
3492 = promote_function_mode (TREE_TYPE (funtype
), callee_mode
,
3495 if (caller_mode
!= VOIDmode
3496 && (caller_promoted_mode
!= callee_promoted_mode
3497 || ((caller_mode
!= caller_promoted_mode
3498 || callee_mode
!= callee_promoted_mode
)
3499 && (caller_unsignedp
!= callee_unsignedp
3500 || partial_subreg_p (caller_mode
, callee_mode
)))))
3503 maybe_complain_about_tail_call (exp
,
3504 "caller and callee disagree in"
3505 " promotion of function"
3510 /* Ensure current function's preferred stack boundary is at least
3511 what we need. Stack alignment may also increase preferred stack
3513 if (crtl
->preferred_stack_boundary
< preferred_stack_boundary
)
3514 crtl
->preferred_stack_boundary
= preferred_stack_boundary
;
3516 preferred_stack_boundary
= crtl
->preferred_stack_boundary
;
3518 preferred_unit_stack_boundary
= preferred_stack_boundary
/ BITS_PER_UNIT
;
3520 /* We want to make two insn chains; one for a sibling call, the other
3521 for a normal call. We will select one of the two chains after
3522 initial RTL generation is complete. */
3523 for (pass
= try_tail_call
? 0 : 1; pass
< 2; pass
++)
3525 int sibcall_failure
= 0;
3526 /* We want to emit any pending stack adjustments before the tail
3527 recursion "call". That way we know any adjustment after the tail
3528 recursion call can be ignored if we indeed use the tail
3530 saved_pending_stack_adjust save
;
3531 rtx_insn
*insns
, *before_call
, *after_args
;
3536 /* State variables we need to save and restore between
3538 save_pending_stack_adjust (&save
);
3541 flags
&= ~ECF_SIBCALL
;
3543 flags
|= ECF_SIBCALL
;
3545 /* Other state variables that we must reinitialize each time
3546 through the loop (that are not initialized by the loop itself). */
3550 /* Start a new sequence for the normal call case.
3552 From this point on, if the sibling call fails, we want to set
3553 sibcall_failure instead of continuing the loop. */
3556 /* Don't let pending stack adjusts add up to too much.
3557 Also, do all pending adjustments now if there is any chance
3558 this might be a call to alloca or if we are expanding a sibling
3560 Also do the adjustments before a throwing call, otherwise
3561 exception handling can fail; PR 19225. */
3562 if (pending_stack_adjust
>= 32
3563 || (pending_stack_adjust
> 0
3564 && (flags
& ECF_MAY_BE_ALLOCA
))
3565 || (pending_stack_adjust
> 0
3566 && flag_exceptions
&& !(flags
& ECF_NOTHROW
))
3568 do_pending_stack_adjust ();
3570 /* Precompute any arguments as needed. */
3572 precompute_arguments (num_actuals
, args
);
3574 /* Now we are about to start emitting insns that can be deleted
3575 if a libcall is deleted. */
3576 if (pass
&& (flags
& ECF_MALLOC
))
3580 && crtl
->stack_protect_guard
3581 && targetm
.stack_protect_runtime_enabled_p ())
3582 stack_protect_epilogue ();
3584 adjusted_args_size
= args_size
;
3585 /* Compute the actual size of the argument block required. The variable
3586 and constant sizes must be combined, the size may have to be rounded,
3587 and there may be a minimum required size. When generating a sibcall
3588 pattern, do not round up, since we'll be re-using whatever space our
3590 unadjusted_args_size
3591 = compute_argument_block_size (reg_parm_stack_space
,
3592 &adjusted_args_size
,
3595 : preferred_stack_boundary
));
3597 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
3599 /* The argument block when performing a sibling call is the
3600 incoming argument block. */
3603 argblock
= crtl
->args
.internal_arg_pointer
;
3604 if (STACK_GROWS_DOWNWARD
)
3606 = plus_constant (Pmode
, argblock
, crtl
->args
.pretend_args_size
);
3609 = plus_constant (Pmode
, argblock
, -crtl
->args
.pretend_args_size
);
3611 stored_args_map
= sbitmap_alloc (args_size
.constant
);
3612 bitmap_clear (stored_args_map
);
3615 /* If we have no actual push instructions, or shouldn't use them,
3616 make space for all args right now. */
3617 else if (adjusted_args_size
.var
!= 0)
3619 if (old_stack_level
== 0)
3621 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
3622 old_stack_pointer_delta
= stack_pointer_delta
;
3623 old_pending_adj
= pending_stack_adjust
;
3624 pending_stack_adjust
= 0;
3625 /* stack_arg_under_construction says whether a stack arg is
3626 being constructed at the old stack level. Pushing the stack
3627 gets a clean outgoing argument block. */
3628 old_stack_arg_under_construction
= stack_arg_under_construction
;
3629 stack_arg_under_construction
= 0;
3631 argblock
= push_block (ARGS_SIZE_RTX (adjusted_args_size
), 0, 0);
3632 if (flag_stack_usage_info
)
3633 current_function_has_unbounded_dynamic_stack_size
= 1;
3637 /* Note that we must go through the motions of allocating an argument
3638 block even if the size is zero because we may be storing args
3639 in the area reserved for register arguments, which may be part of
3642 int needed
= adjusted_args_size
.constant
;
3644 /* Store the maximum argument space used. It will be pushed by
3645 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
3648 if (needed
> crtl
->outgoing_args_size
)
3649 crtl
->outgoing_args_size
= needed
;
3651 if (must_preallocate
)
3653 if (ACCUMULATE_OUTGOING_ARGS
)
3655 /* Since the stack pointer will never be pushed, it is
3656 possible for the evaluation of a parm to clobber
3657 something we have already written to the stack.
3658 Since most function calls on RISC machines do not use
3659 the stack, this is uncommon, but must work correctly.
3661 Therefore, we save any area of the stack that was already
3662 written and that we are using. Here we set up to do this
3663 by making a new stack usage map from the old one. The
3664 actual save will be done by store_one_arg.
3666 Another approach might be to try to reorder the argument
3667 evaluations to avoid this conflicting stack usage. */
3669 /* Since we will be writing into the entire argument area,
3670 the map must be allocated for its entire size, not just
3671 the part that is the responsibility of the caller. */
3672 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
3673 needed
+= reg_parm_stack_space
;
3675 if (ARGS_GROW_DOWNWARD
)
3676 highest_outgoing_arg_in_use
3677 = MAX (initial_highest_arg_in_use
, needed
+ 1);
3679 highest_outgoing_arg_in_use
3680 = MAX (initial_highest_arg_in_use
, needed
);
3682 free (stack_usage_map_buf
);
3683 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
3684 stack_usage_map
= stack_usage_map_buf
;
3686 if (initial_highest_arg_in_use
)
3687 memcpy (stack_usage_map
, initial_stack_usage_map
,
3688 initial_highest_arg_in_use
);
3690 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
3691 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
3692 (highest_outgoing_arg_in_use
3693 - initial_highest_arg_in_use
));
3696 /* The address of the outgoing argument list must not be
3697 copied to a register here, because argblock would be left
3698 pointing to the wrong place after the call to
3699 allocate_dynamic_stack_space below. */
3701 argblock
= virtual_outgoing_args_rtx
;
3705 if (inhibit_defer_pop
== 0)
3707 /* Try to reuse some or all of the pending_stack_adjust
3708 to get this space. */
3710 = (combine_pending_stack_adjustment_and_call
3711 (unadjusted_args_size
,
3712 &adjusted_args_size
,
3713 preferred_unit_stack_boundary
));
3715 /* combine_pending_stack_adjustment_and_call computes
3716 an adjustment before the arguments are allocated.
3717 Account for them and see whether or not the stack
3718 needs to go up or down. */
3719 needed
= unadjusted_args_size
- needed
;
3723 /* We're releasing stack space. */
3724 /* ??? We can avoid any adjustment at all if we're
3725 already aligned. FIXME. */
3726 pending_stack_adjust
= -needed
;
3727 do_pending_stack_adjust ();
3731 /* We need to allocate space. We'll do that in
3732 push_block below. */
3733 pending_stack_adjust
= 0;
3736 /* Special case this because overhead of `push_block' in
3737 this case is non-trivial. */
3739 argblock
= virtual_outgoing_args_rtx
;
3742 argblock
= push_block (GEN_INT (needed
), 0, 0);
3743 if (ARGS_GROW_DOWNWARD
)
3744 argblock
= plus_constant (Pmode
, argblock
, needed
);
3747 /* We only really need to call `copy_to_reg' in the case
3748 where push insns are going to be used to pass ARGBLOCK
3749 to a function call in ARGS. In that case, the stack
3750 pointer changes value from the allocation point to the
3751 call point, and hence the value of
3752 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
3753 as well always do it. */
3754 argblock
= copy_to_reg (argblock
);
3759 if (ACCUMULATE_OUTGOING_ARGS
)
3761 /* The save/restore code in store_one_arg handles all
3762 cases except one: a constructor call (including a C
3763 function returning a BLKmode struct) to initialize
3765 if (stack_arg_under_construction
)
3768 = GEN_INT (adjusted_args_size
.constant
3769 + (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
3770 : TREE_TYPE (fndecl
))) ? 0
3771 : reg_parm_stack_space
));
3772 if (old_stack_level
== 0)
3774 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
3775 old_stack_pointer_delta
= stack_pointer_delta
;
3776 old_pending_adj
= pending_stack_adjust
;
3777 pending_stack_adjust
= 0;
3778 /* stack_arg_under_construction says whether a stack
3779 arg is being constructed at the old stack level.
3780 Pushing the stack gets a clean outgoing argument
3782 old_stack_arg_under_construction
3783 = stack_arg_under_construction
;
3784 stack_arg_under_construction
= 0;
3785 /* Make a new map for the new argument list. */
3786 free (stack_usage_map_buf
);
3787 stack_usage_map_buf
= XCNEWVEC (char, highest_outgoing_arg_in_use
);
3788 stack_usage_map
= stack_usage_map_buf
;
3789 highest_outgoing_arg_in_use
= 0;
3791 /* We can pass TRUE as the 4th argument because we just
3792 saved the stack pointer and will restore it right after
3794 allocate_dynamic_stack_space (push_size
, 0, BIGGEST_ALIGNMENT
,
3798 /* If argument evaluation might modify the stack pointer,
3799 copy the address of the argument list to a register. */
3800 for (i
= 0; i
< num_actuals
; i
++)
3801 if (args
[i
].pass_on_stack
)
3803 argblock
= copy_addr_to_reg (argblock
);
3808 compute_argument_addresses (args
, argblock
, num_actuals
);
3810 /* Stack is properly aligned, pops can't safely be deferred during
3811 the evaluation of the arguments. */
3814 /* Precompute all register parameters. It isn't safe to compute
3815 anything once we have started filling any specific hard regs.
3816 TLS symbols sometimes need a call to resolve. Precompute
3817 register parameters before any stack pointer manipulation
3818 to avoid unaligned stack in the called function. */
3819 precompute_register_parameters (num_actuals
, args
, ®_parm_seen
);
3823 /* Perform stack alignment before the first push (the last arg). */
3825 && adjusted_args_size
.constant
> reg_parm_stack_space
3826 && adjusted_args_size
.constant
!= unadjusted_args_size
)
3828 /* When the stack adjustment is pending, we get better code
3829 by combining the adjustments. */
3830 if (pending_stack_adjust
3831 && ! inhibit_defer_pop
)
3833 pending_stack_adjust
3834 = (combine_pending_stack_adjustment_and_call
3835 (unadjusted_args_size
,
3836 &adjusted_args_size
,
3837 preferred_unit_stack_boundary
));
3838 do_pending_stack_adjust ();
3840 else if (argblock
== 0)
3841 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
3842 - unadjusted_args_size
));
3844 /* Now that the stack is properly aligned, pops can't safely
3845 be deferred during the evaluation of the arguments. */
3848 /* Record the maximum pushed stack space size. We need to delay
3849 doing it this far to take into account the optimization done
3850 by combine_pending_stack_adjustment_and_call. */
3851 if (flag_stack_usage_info
3852 && !ACCUMULATE_OUTGOING_ARGS
3854 && adjusted_args_size
.var
== 0)
3856 int pushed
= adjusted_args_size
.constant
+ pending_stack_adjust
;
3857 if (pushed
> current_function_pushed_stack_size
)
3858 current_function_pushed_stack_size
= pushed
;
3861 funexp
= rtx_for_function_call (fndecl
, addr
);
3863 if (CALL_EXPR_STATIC_CHAIN (exp
))
3864 static_chain_value
= expand_normal (CALL_EXPR_STATIC_CHAIN (exp
));
3866 static_chain_value
= 0;
3868 #ifdef REG_PARM_STACK_SPACE
3869 /* Save the fixed argument area if it's part of the caller's frame and
3870 is clobbered by argument setup for this call. */
3871 if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
3872 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
3873 &low_to_save
, &high_to_save
);
3876 /* Now store (and compute if necessary) all non-register parms.
3877 These come before register parms, since they can require block-moves,
3878 which could clobber the registers used for register parms.
3879 Parms which have partial registers are not stored here,
3880 but we do preallocate space here if they want that. */
3882 for (i
= 0; i
< num_actuals
; i
++)
3884 /* Delay bounds until all other args are stored. */
3885 if (POINTER_BOUNDS_P (args
[i
].tree_value
))
3887 else if (args
[i
].reg
== 0 || args
[i
].pass_on_stack
)
3889 rtx_insn
*before_arg
= get_last_insn ();
3891 /* We don't allow passing huge (> 2^30 B) arguments
3892 by value. It would cause an overflow later on. */
3893 if (adjusted_args_size
.constant
3894 >= (1 << (HOST_BITS_PER_INT
- 2)))
3896 sorry ("passing too large argument on stack");
3900 if (store_one_arg (&args
[i
], argblock
, flags
,
3901 adjusted_args_size
.var
!= 0,
3902 reg_parm_stack_space
)
3904 && check_sibcall_argument_overlap (before_arg
,
3906 sibcall_failure
= 1;
3911 = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
3912 gen_rtx_USE (VOIDmode
, args
[i
].stack
),
3916 /* If we have a parm that is passed in registers but not in memory
3917 and whose alignment does not permit a direct copy into registers,
3918 make a group of pseudos that correspond to each register that we
3920 if (STRICT_ALIGNMENT
)
3921 store_unaligned_arguments_into_pseudos (args
, num_actuals
);
3923 /* Now store any partially-in-registers parm.
3924 This is the last place a block-move can happen. */
3926 for (i
= 0; i
< num_actuals
; i
++)
3927 if (args
[i
].partial
!= 0 && ! args
[i
].pass_on_stack
)
3929 rtx_insn
*before_arg
= get_last_insn ();
3931 /* On targets with weird calling conventions (e.g. PA) it's
3932 hard to ensure that all cases of argument overlap between
3933 stack and registers work. Play it safe and bail out. */
3934 if (ARGS_GROW_DOWNWARD
&& !STACK_GROWS_DOWNWARD
)
3936 sibcall_failure
= 1;
3940 if (store_one_arg (&args
[i
], argblock
, flags
,
3941 adjusted_args_size
.var
!= 0,
3942 reg_parm_stack_space
)
3944 && check_sibcall_argument_overlap (before_arg
,
3946 sibcall_failure
= 1;
3949 bool any_regs
= false;
3950 for (i
= 0; i
< num_actuals
; i
++)
3951 if (args
[i
].reg
!= NULL_RTX
)
3954 targetm
.calls
.call_args (args
[i
].reg
, funtype
);
3957 targetm
.calls
.call_args (pc_rtx
, funtype
);
3959 /* Figure out the register where the value, if any, will come back. */
3962 if (TYPE_MODE (rettype
) != VOIDmode
3963 && ! structure_value_addr
)
3965 if (pcc_struct_value
)
3967 valreg
= hard_function_value (build_pointer_type (rettype
),
3968 fndecl
, NULL
, (pass
== 0));
3969 if (CALL_WITH_BOUNDS_P (exp
))
3970 valbnd
= targetm
.calls
.
3971 chkp_function_value_bounds (build_pointer_type (rettype
),
3972 fndecl
, (pass
== 0));
3976 valreg
= hard_function_value (rettype
, fndecl
, fntype
,
3978 if (CALL_WITH_BOUNDS_P (exp
))
3979 valbnd
= targetm
.calls
.chkp_function_value_bounds (rettype
,
3984 /* If VALREG is a PARALLEL whose first member has a zero
3985 offset, use that. This is for targets such as m68k that
3986 return the same value in multiple places. */
3987 if (GET_CODE (valreg
) == PARALLEL
)
3989 rtx elem
= XVECEXP (valreg
, 0, 0);
3990 rtx where
= XEXP (elem
, 0);
3991 rtx offset
= XEXP (elem
, 1);
3992 if (offset
== const0_rtx
3993 && GET_MODE (where
) == GET_MODE (valreg
))
3998 /* Store all bounds not passed in registers. */
3999 for (i
= 0; i
< num_actuals
; i
++)
4001 if (POINTER_BOUNDS_P (args
[i
].tree_value
)
4003 store_bounds (&args
[i
],
4004 args
[i
].pointer_arg
== -1
4006 : &args
[args
[i
].pointer_arg
]);
4009 /* If register arguments require space on the stack and stack space
4010 was not preallocated, allocate stack space here for arguments
4011 passed in registers. */
4012 if (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
4013 && !ACCUMULATE_OUTGOING_ARGS
4014 && must_preallocate
== 0 && reg_parm_stack_space
> 0)
4015 anti_adjust_stack (GEN_INT (reg_parm_stack_space
));
4017 /* Pass the function the address in which to return a
4019 if (pass
!= 0 && structure_value_addr
&& ! structure_value_addr_parm
)
4021 structure_value_addr
4022 = convert_memory_address (Pmode
, structure_value_addr
);
4023 emit_move_insn (struct_value
,
4025 force_operand (structure_value_addr
,
4028 if (REG_P (struct_value
))
4029 use_reg (&call_fusage
, struct_value
);
4032 after_args
= get_last_insn ();
4033 funexp
= prepare_call_address (fndecl
? fndecl
: fntype
, funexp
,
4034 static_chain_value
, &call_fusage
,
4035 reg_parm_seen
, flags
);
4037 load_register_parameters (args
, num_actuals
, &call_fusage
, flags
,
4038 pass
== 0, &sibcall_failure
);
4040 /* Save a pointer to the last insn before the call, so that we can
4041 later safely search backwards to find the CALL_INSN. */
4042 before_call
= get_last_insn ();
4044 /* Set up next argument register. For sibling calls on machines
4045 with register windows this should be the incoming register. */
4047 next_arg_reg
= targetm
.calls
.function_incoming_arg (args_so_far
,
4052 next_arg_reg
= targetm
.calls
.function_arg (args_so_far
,
4053 VOIDmode
, void_type_node
,
4056 if (pass
== 1 && (return_flags
& ERF_RETURNS_ARG
))
4058 int arg_nr
= return_flags
& ERF_RETURN_ARG_MASK
;
4059 arg_nr
= num_actuals
- arg_nr
- 1;
4061 && arg_nr
< num_actuals
4065 && GET_MODE (args
[arg_nr
].reg
) == GET_MODE (valreg
))
4067 = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args
[arg_nr
].tree_value
)),
4068 gen_rtx_SET (valreg
, args
[arg_nr
].reg
),
4071 /* All arguments and registers used for the call must be set up by
4074 /* Stack must be properly aligned now. */
4076 || !(stack_pointer_delta
% preferred_unit_stack_boundary
));
4078 /* Generate the actual call instruction. */
4079 emit_call_1 (funexp
, exp
, fndecl
, funtype
, unadjusted_args_size
,
4080 adjusted_args_size
.constant
, struct_value_size
,
4081 next_arg_reg
, valreg
, old_inhibit_defer_pop
, call_fusage
,
4082 flags
, args_so_far
);
4086 rtx_call_insn
*last
;
4087 rtx datum
= NULL_RTX
;
4088 if (fndecl
!= NULL_TREE
)
4090 datum
= XEXP (DECL_RTL (fndecl
), 0);
4091 gcc_assert (datum
!= NULL_RTX
4092 && GET_CODE (datum
) == SYMBOL_REF
);
4094 last
= last_call_insn ();
4095 add_reg_note (last
, REG_CALL_DECL
, datum
);
4098 /* If the call setup or the call itself overlaps with anything
4099 of the argument setup we probably clobbered our call address.
4100 In that case we can't do sibcalls. */
4102 && check_sibcall_argument_overlap (after_args
, 0, 0))
4103 sibcall_failure
= 1;
4105 /* If a non-BLKmode value is returned at the most significant end
4106 of a register, shift the register right by the appropriate amount
4107 and update VALREG accordingly. BLKmode values are handled by the
4108 group load/store machinery below. */
4109 if (!structure_value_addr
4110 && !pcc_struct_value
4111 && TYPE_MODE (rettype
) != VOIDmode
4112 && TYPE_MODE (rettype
) != BLKmode
4114 && targetm
.calls
.return_in_msb (rettype
))
4116 if (shift_return_value (TYPE_MODE (rettype
), false, valreg
))
4117 sibcall_failure
= 1;
4118 valreg
= gen_rtx_REG (TYPE_MODE (rettype
), REGNO (valreg
));
4121 if (pass
&& (flags
& ECF_MALLOC
))
4123 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
4124 rtx_insn
*last
, *insns
;
4126 /* The return value from a malloc-like function is a pointer. */
4127 if (TREE_CODE (rettype
) == POINTER_TYPE
)
4128 mark_reg_pointer (temp
, MALLOC_ABI_ALIGNMENT
);
4130 emit_move_insn (temp
, valreg
);
4132 /* The return value from a malloc-like function can not alias
4134 last
= get_last_insn ();
4135 add_reg_note (last
, REG_NOALIAS
, temp
);
4137 /* Write out the sequence. */
4138 insns
= get_insns ();
4144 /* For calls to `setjmp', etc., inform
4145 function.c:setjmp_warnings that it should complain if
4146 nonvolatile values are live. For functions that cannot
4147 return, inform flow that control does not fall through. */
4149 if ((flags
& ECF_NORETURN
) || pass
== 0)
4151 /* The barrier must be emitted
4152 immediately after the CALL_INSN. Some ports emit more
4153 than just a CALL_INSN above, so we must search for it here. */
4155 rtx_insn
*last
= get_last_insn ();
4156 while (!CALL_P (last
))
4158 last
= PREV_INSN (last
);
4159 /* There was no CALL_INSN? */
4160 gcc_assert (last
!= before_call
);
4163 emit_barrier_after (last
);
4165 /* Stack adjustments after a noreturn call are dead code.
4166 However when NO_DEFER_POP is in effect, we must preserve
4167 stack_pointer_delta. */
4168 if (inhibit_defer_pop
== 0)
4170 stack_pointer_delta
= old_stack_allocated
;
4171 pending_stack_adjust
= 0;
4175 /* If value type not void, return an rtx for the value. */
4177 if (TYPE_MODE (rettype
) == VOIDmode
4179 target
= const0_rtx
;
4180 else if (structure_value_addr
)
4182 if (target
== 0 || !MEM_P (target
))
4185 = gen_rtx_MEM (TYPE_MODE (rettype
),
4186 memory_address (TYPE_MODE (rettype
),
4187 structure_value_addr
));
4188 set_mem_attributes (target
, rettype
, 1);
4191 else if (pcc_struct_value
)
4193 /* This is the special C++ case where we need to
4194 know what the true target was. We take care to
4195 never use this value more than once in one expression. */
4196 target
= gen_rtx_MEM (TYPE_MODE (rettype
),
4197 copy_to_reg (valreg
));
4198 set_mem_attributes (target
, rettype
, 1);
4200 /* Handle calls that return values in multiple non-contiguous locations.
4201 The Irix 6 ABI has examples of this. */
4202 else if (GET_CODE (valreg
) == PARALLEL
)
4205 target
= emit_group_move_into_temps (valreg
);
4206 else if (rtx_equal_p (target
, valreg
))
4208 else if (GET_CODE (target
) == PARALLEL
)
4209 /* Handle the result of a emit_group_move_into_temps
4210 call in the previous pass. */
4211 emit_group_move (target
, valreg
);
4213 emit_group_store (target
, valreg
, rettype
,
4214 int_size_in_bytes (rettype
));
4217 && GET_MODE (target
) == TYPE_MODE (rettype
)
4218 && GET_MODE (target
) == GET_MODE (valreg
))
4220 bool may_overlap
= false;
4222 /* We have to copy a return value in a CLASS_LIKELY_SPILLED hard
4223 reg to a plain register. */
4224 if (!REG_P (target
) || HARD_REGISTER_P (target
))
4225 valreg
= avoid_likely_spilled_reg (valreg
);
4227 /* If TARGET is a MEM in the argument area, and we have
4228 saved part of the argument area, then we can't store
4229 directly into TARGET as it may get overwritten when we
4230 restore the argument save area below. Don't work too
4231 hard though and simply force TARGET to a register if it
4232 is a MEM; the optimizer is quite likely to sort it out. */
4233 if (ACCUMULATE_OUTGOING_ARGS
&& pass
&& MEM_P (target
))
4234 for (i
= 0; i
< num_actuals
; i
++)
4235 if (args
[i
].save_area
)
4242 target
= copy_to_reg (valreg
);
4245 /* TARGET and VALREG cannot be equal at this point
4246 because the latter would not have
4247 REG_FUNCTION_VALUE_P true, while the former would if
4248 it were referring to the same register.
4250 If they refer to the same register, this move will be
4251 a no-op, except when function inlining is being
4253 emit_move_insn (target
, valreg
);
4255 /* If we are setting a MEM, this code must be executed.
4256 Since it is emitted after the call insn, sibcall
4257 optimization cannot be performed in that case. */
4259 sibcall_failure
= 1;
4263 target
= copy_to_reg (avoid_likely_spilled_reg (valreg
));
4265 /* If we promoted this return value, make the proper SUBREG.
4266 TARGET might be const0_rtx here, so be careful. */
4268 && TYPE_MODE (rettype
) != BLKmode
4269 && GET_MODE (target
) != TYPE_MODE (rettype
))
4271 tree type
= rettype
;
4272 int unsignedp
= TYPE_UNSIGNED (type
);
4275 /* Ensure we promote as expected, and get the new unsignedness. */
4276 pmode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
4278 gcc_assert (GET_MODE (target
) == pmode
);
4280 unsigned int offset
= subreg_lowpart_offset (TYPE_MODE (type
),
4282 target
= gen_rtx_SUBREG (TYPE_MODE (type
), target
, offset
);
4283 SUBREG_PROMOTED_VAR_P (target
) = 1;
4284 SUBREG_PROMOTED_SET (target
, unsignedp
);
4287 /* If size of args is variable or this was a constructor call for a stack
4288 argument, restore saved stack-pointer value. */
4290 if (old_stack_level
)
4292 rtx_insn
*prev
= get_last_insn ();
4294 emit_stack_restore (SAVE_BLOCK
, old_stack_level
);
4295 stack_pointer_delta
= old_stack_pointer_delta
;
4297 fixup_args_size_notes (prev
, get_last_insn (), stack_pointer_delta
);
4299 pending_stack_adjust
= old_pending_adj
;
4300 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
4301 stack_arg_under_construction
= old_stack_arg_under_construction
;
4302 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
4303 stack_usage_map
= initial_stack_usage_map
;
4304 sibcall_failure
= 1;
4306 else if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
4308 #ifdef REG_PARM_STACK_SPACE
4310 restore_fixed_argument_area (save_area
, argblock
,
4311 high_to_save
, low_to_save
);
4314 /* If we saved any argument areas, restore them. */
4315 for (i
= 0; i
< num_actuals
; i
++)
4316 if (args
[i
].save_area
)
4318 machine_mode save_mode
= GET_MODE (args
[i
].save_area
);
4320 = gen_rtx_MEM (save_mode
,
4321 memory_address (save_mode
,
4322 XEXP (args
[i
].stack_slot
, 0)));
4324 if (save_mode
!= BLKmode
)
4325 emit_move_insn (stack_area
, args
[i
].save_area
);
4327 emit_block_move (stack_area
, args
[i
].save_area
,
4328 GEN_INT (args
[i
].locate
.size
.constant
),
4329 BLOCK_OP_CALL_PARM
);
4332 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
4333 stack_usage_map
= initial_stack_usage_map
;
4336 /* If this was alloca, record the new stack level. */
4337 if (flags
& ECF_MAY_BE_ALLOCA
)
4338 record_new_stack_level ();
4340 /* Free up storage we no longer need. */
4341 for (i
= 0; i
< num_actuals
; ++i
)
4342 free (args
[i
].aligned_regs
);
4344 targetm
.calls
.end_call_args ();
4346 insns
= get_insns ();
4351 tail_call_insns
= insns
;
4353 /* Restore the pending stack adjustment now that we have
4354 finished generating the sibling call sequence. */
4356 restore_pending_stack_adjust (&save
);
4358 /* Prepare arg structure for next iteration. */
4359 for (i
= 0; i
< num_actuals
; i
++)
4362 args
[i
].aligned_regs
= 0;
4366 sbitmap_free (stored_args_map
);
4367 internal_arg_pointer_exp_state
.scan_start
= NULL
;
4368 internal_arg_pointer_exp_state
.cache
.release ();
4372 normal_call_insns
= insns
;
4374 /* Verify that we've deallocated all the stack we used. */
4375 gcc_assert ((flags
& ECF_NORETURN
)
4376 || (old_stack_allocated
4377 == stack_pointer_delta
- pending_stack_adjust
));
4380 /* If something prevents making this a sibling call,
4381 zero out the sequence. */
4382 if (sibcall_failure
)
4383 tail_call_insns
= NULL
;
4388 /* If tail call production succeeded, we need to remove REG_EQUIV notes on
4389 arguments too, as argument area is now clobbered by the call. */
4390 if (tail_call_insns
)
4392 emit_insn (tail_call_insns
);
4393 crtl
->tail_call_emit
= true;
4397 emit_insn (normal_call_insns
);
4399 /* Ideally we'd emit a message for all of the ways that it could
4401 maybe_complain_about_tail_call (exp
, "tail call production failed");
4404 currently_expanding_call
--;
4406 free (stack_usage_map_buf
);
4409 /* Join result with returned bounds so caller may use them if needed. */
4410 target
= chkp_join_splitted_slot (target
, valbnd
);
4415 /* A sibling call sequence invalidates any REG_EQUIV notes made for
4416 this function's incoming arguments.
4418 At the start of RTL generation we know the only REG_EQUIV notes
4419 in the rtl chain are those for incoming arguments, so we can look
4420 for REG_EQUIV notes between the start of the function and the
4421 NOTE_INSN_FUNCTION_BEG.
4423 This is (slight) overkill. We could keep track of the highest
4424 argument we clobber and be more selective in removing notes, but it
4425 does not seem to be worth the effort. */
4428 fixup_tail_calls (void)
4432 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4436 /* There are never REG_EQUIV notes for the incoming arguments
4437 after the NOTE_INSN_FUNCTION_BEG note, so stop if we see it. */
4439 && NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
)
4442 note
= find_reg_note (insn
, REG_EQUIV
, 0);
4444 remove_note (insn
, note
);
4445 note
= find_reg_note (insn
, REG_EQUIV
, 0);
4450 /* Traverse a list of TYPES and expand all complex types into their
4453 split_complex_types (tree types
)
4457 /* Before allocating memory, check for the common case of no complex. */
4458 for (p
= types
; p
; p
= TREE_CHAIN (p
))
4460 tree type
= TREE_VALUE (p
);
4461 if (TREE_CODE (type
) == COMPLEX_TYPE
4462 && targetm
.calls
.split_complex_arg (type
))
4468 types
= copy_list (types
);
4470 for (p
= types
; p
; p
= TREE_CHAIN (p
))
4472 tree complex_type
= TREE_VALUE (p
);
4474 if (TREE_CODE (complex_type
) == COMPLEX_TYPE
4475 && targetm
.calls
.split_complex_arg (complex_type
))
4479 /* Rewrite complex type with component type. */
4480 TREE_VALUE (p
) = TREE_TYPE (complex_type
);
4481 next
= TREE_CHAIN (p
);
4483 /* Add another component type for the imaginary part. */
4484 imag
= build_tree_list (NULL_TREE
, TREE_VALUE (p
));
4485 TREE_CHAIN (p
) = imag
;
4486 TREE_CHAIN (imag
) = next
;
4488 /* Skip the newly created node. */
4496 /* Output a library call to function ORGFUN (a SYMBOL_REF rtx)
4497 for a value of mode OUTMODE,
4498 with NARGS different arguments, passed as ARGS.
4499 Store the return value if RETVAL is nonzero: store it in VALUE if
4500 VALUE is nonnull, otherwise pick a convenient location. In either
4501 case return the location of the stored value.
4503 FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for
4504 `const' calls, LCT_PURE for `pure' calls, or another LCT_ value for
4505 other types of library calls. */
4508 emit_library_call_value_1 (int retval
, rtx orgfun
, rtx value
,
4509 enum libcall_type fn_type
,
4510 machine_mode outmode
, int nargs
, rtx_mode_t
*args
)
4512 /* Total size in bytes of all the stack-parms scanned so far. */
4513 struct args_size args_size
;
4514 /* Size of arguments before any adjustments (such as rounding). */
4515 struct args_size original_args_size
;
4518 /* Todo, choose the correct decl type of orgfun. Sadly this information
4519 isn't present here, so we default to native calling abi here. */
4520 tree fndecl ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
4521 tree fntype ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
4524 CUMULATIVE_ARGS args_so_far_v
;
4525 cumulative_args_t args_so_far
;
4532 struct locate_and_pad_arg_data locate
;
4536 int old_inhibit_defer_pop
= inhibit_defer_pop
;
4537 rtx call_fusage
= 0;
4540 int pcc_struct_value
= 0;
4541 int struct_value_size
= 0;
4543 int reg_parm_stack_space
= 0;
4545 rtx_insn
*before_call
;
4546 bool have_push_fusage
;
4547 tree tfom
; /* type_for_mode (outmode, 0) */
4549 #ifdef REG_PARM_STACK_SPACE
4550 /* Define the boundary of the register parm stack space that needs to be
4552 int low_to_save
= 0, high_to_save
= 0;
4553 rtx save_area
= 0; /* Place that it is saved. */
4556 /* Size of the stack reserved for parameter registers. */
4557 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
4558 char *initial_stack_usage_map
= stack_usage_map
;
4559 char *stack_usage_map_buf
= NULL
;
4561 rtx struct_value
= targetm
.calls
.struct_value_rtx (0, 0);
4563 #ifdef REG_PARM_STACK_SPACE
4564 reg_parm_stack_space
= REG_PARM_STACK_SPACE ((tree
) 0);
4567 /* By default, library functions cannot throw. */
4568 flags
= ECF_NOTHROW
;
4581 flags
|= ECF_NORETURN
;
4584 flags
&= ~ECF_NOTHROW
;
4586 case LCT_RETURNS_TWICE
:
4587 flags
= ECF_RETURNS_TWICE
;
4592 /* Ensure current function's preferred stack boundary is at least
4594 if (crtl
->preferred_stack_boundary
< PREFERRED_STACK_BOUNDARY
)
4595 crtl
->preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
4597 /* If this kind of value comes back in memory,
4598 decide where in memory it should come back. */
4599 if (outmode
!= VOIDmode
)
4601 tfom
= lang_hooks
.types
.type_for_mode (outmode
, 0);
4602 if (aggregate_value_p (tfom
, 0))
4604 #ifdef PCC_STATIC_STRUCT_RETURN
4606 = hard_function_value (build_pointer_type (tfom
), 0, 0, 0);
4607 mem_value
= gen_rtx_MEM (outmode
, pointer_reg
);
4608 pcc_struct_value
= 1;
4610 value
= gen_reg_rtx (outmode
);
4611 #else /* not PCC_STATIC_STRUCT_RETURN */
4612 struct_value_size
= GET_MODE_SIZE (outmode
);
4613 if (value
!= 0 && MEM_P (value
))
4616 mem_value
= assign_temp (tfom
, 1, 1);
4618 /* This call returns a big structure. */
4619 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
4623 tfom
= void_type_node
;
4625 /* ??? Unfinished: must pass the memory address as an argument. */
4627 /* Copy all the libcall-arguments out of the varargs data
4628 and into a vector ARGVEC.
4630 Compute how to pass each argument. We only support a very small subset
4631 of the full argument passing conventions to limit complexity here since
4632 library functions shouldn't have many args. */
4634 argvec
= XALLOCAVEC (struct arg
, nargs
+ 1);
4635 memset (argvec
, 0, (nargs
+ 1) * sizeof (struct arg
));
4637 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
4638 INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far_v
, outmode
, fun
);
4640 INIT_CUMULATIVE_ARGS (args_so_far_v
, NULL_TREE
, fun
, 0, nargs
);
4642 args_so_far
= pack_cumulative_args (&args_so_far_v
);
4644 args_size
.constant
= 0;
4651 /* If there's a structure value address to be passed,
4652 either pass it in the special place, or pass it as an extra argument. */
4653 if (mem_value
&& struct_value
== 0 && ! pcc_struct_value
)
4655 rtx addr
= XEXP (mem_value
, 0);
4659 /* Make sure it is a reasonable operand for a move or push insn. */
4660 if (!REG_P (addr
) && !MEM_P (addr
)
4661 && !(CONSTANT_P (addr
)
4662 && targetm
.legitimate_constant_p (Pmode
, addr
)))
4663 addr
= force_operand (addr
, NULL_RTX
);
4665 argvec
[count
].value
= addr
;
4666 argvec
[count
].mode
= Pmode
;
4667 argvec
[count
].partial
= 0;
4669 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
,
4670 Pmode
, NULL_TREE
, true);
4671 gcc_assert (targetm
.calls
.arg_partial_bytes (args_so_far
, Pmode
,
4672 NULL_TREE
, 1) == 0);
4674 locate_and_pad_parm (Pmode
, NULL_TREE
,
4675 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4678 argvec
[count
].reg
!= 0,
4680 reg_parm_stack_space
, 0,
4681 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
4683 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
4684 || reg_parm_stack_space
> 0)
4685 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
4687 targetm
.calls
.function_arg_advance (args_so_far
, Pmode
, (tree
) 0, true);
4692 for (unsigned int i
= 0; count
< nargs
; i
++, count
++)
4694 rtx val
= args
[i
].first
;
4695 machine_mode mode
= args
[i
].second
;
4698 /* We cannot convert the arg value to the mode the library wants here;
4699 must do it earlier where we know the signedness of the arg. */
4700 gcc_assert (mode
!= BLKmode
4701 && (GET_MODE (val
) == mode
|| GET_MODE (val
) == VOIDmode
));
4703 /* Make sure it is a reasonable operand for a move or push insn. */
4704 if (!REG_P (val
) && !MEM_P (val
)
4705 && !(CONSTANT_P (val
) && targetm
.legitimate_constant_p (mode
, val
)))
4706 val
= force_operand (val
, NULL_RTX
);
4708 if (pass_by_reference (&args_so_far_v
, mode
, NULL_TREE
, 1))
4712 = !reference_callee_copied (&args_so_far_v
, mode
, NULL_TREE
, 1);
4714 /* If this was a CONST function, it is now PURE since it now
4716 if (flags
& ECF_CONST
)
4718 flags
&= ~ECF_CONST
;
4722 if (MEM_P (val
) && !must_copy
)
4724 tree val_expr
= MEM_EXPR (val
);
4726 mark_addressable (val_expr
);
4731 slot
= assign_temp (lang_hooks
.types
.type_for_mode (mode
, 0),
4733 emit_move_insn (slot
, val
);
4736 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
4737 gen_rtx_USE (VOIDmode
, slot
),
4740 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
4741 gen_rtx_CLOBBER (VOIDmode
,
4746 val
= force_operand (XEXP (slot
, 0), NULL_RTX
);
4749 mode
= promote_function_mode (NULL_TREE
, mode
, &unsigned_p
, NULL_TREE
, 0);
4750 argvec
[count
].mode
= mode
;
4751 argvec
[count
].value
= convert_modes (mode
, GET_MODE (val
), val
, unsigned_p
);
4752 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
4755 argvec
[count
].partial
4756 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, NULL_TREE
, 1);
4758 if (argvec
[count
].reg
== 0
4759 || argvec
[count
].partial
!= 0
4760 || reg_parm_stack_space
> 0)
4762 locate_and_pad_parm (mode
, NULL_TREE
,
4763 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4766 argvec
[count
].reg
!= 0,
4768 reg_parm_stack_space
, argvec
[count
].partial
,
4769 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
4770 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
4771 gcc_assert (!argvec
[count
].locate
.size
.var
);
4773 #ifdef BLOCK_REG_PADDING
4775 /* The argument is passed entirely in registers. See at which
4776 end it should be padded. */
4777 argvec
[count
].locate
.where_pad
=
4778 BLOCK_REG_PADDING (mode
, NULL_TREE
,
4779 GET_MODE_SIZE (mode
) <= UNITS_PER_WORD
);
4782 targetm
.calls
.function_arg_advance (args_so_far
, mode
, (tree
) 0, true);
4785 /* If this machine requires an external definition for library
4786 functions, write one out. */
4787 assemble_external_libcall (fun
);
4789 original_args_size
= args_size
;
4790 args_size
.constant
= (((args_size
.constant
4791 + stack_pointer_delta
4795 - stack_pointer_delta
);
4797 args_size
.constant
= MAX (args_size
.constant
,
4798 reg_parm_stack_space
);
4800 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
4801 args_size
.constant
-= reg_parm_stack_space
;
4803 if (args_size
.constant
> crtl
->outgoing_args_size
)
4804 crtl
->outgoing_args_size
= args_size
.constant
;
4806 if (flag_stack_usage_info
&& !ACCUMULATE_OUTGOING_ARGS
)
4808 int pushed
= args_size
.constant
+ pending_stack_adjust
;
4809 if (pushed
> current_function_pushed_stack_size
)
4810 current_function_pushed_stack_size
= pushed
;
4813 if (ACCUMULATE_OUTGOING_ARGS
)
4815 /* Since the stack pointer will never be pushed, it is possible for
4816 the evaluation of a parm to clobber something we have already
4817 written to the stack. Since most function calls on RISC machines
4818 do not use the stack, this is uncommon, but must work correctly.
4820 Therefore, we save any area of the stack that was already written
4821 and that we are using. Here we set up to do this by making a new
4822 stack usage map from the old one.
4824 Another approach might be to try to reorder the argument
4825 evaluations to avoid this conflicting stack usage. */
4827 needed
= args_size
.constant
;
4829 /* Since we will be writing into the entire argument area, the
4830 map must be allocated for its entire size, not just the part that
4831 is the responsibility of the caller. */
4832 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
4833 needed
+= reg_parm_stack_space
;
4835 if (ARGS_GROW_DOWNWARD
)
4836 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
4839 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
, needed
);
4841 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
4842 stack_usage_map
= stack_usage_map_buf
;
4844 if (initial_highest_arg_in_use
)
4845 memcpy (stack_usage_map
, initial_stack_usage_map
,
4846 initial_highest_arg_in_use
);
4848 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
4849 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
4850 highest_outgoing_arg_in_use
- initial_highest_arg_in_use
);
4853 /* We must be careful to use virtual regs before they're instantiated,
4854 and real regs afterwards. Loop optimization, for example, can create
4855 new libcalls after we've instantiated the virtual regs, and if we
4856 use virtuals anyway, they won't match the rtl patterns. */
4858 if (virtuals_instantiated
)
4859 argblock
= plus_constant (Pmode
, stack_pointer_rtx
,
4860 STACK_POINTER_OFFSET
);
4862 argblock
= virtual_outgoing_args_rtx
;
4867 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
4870 /* We push args individually in reverse order, perform stack alignment
4871 before the first push (the last arg). */
4873 anti_adjust_stack (GEN_INT (args_size
.constant
4874 - original_args_size
.constant
));
4878 #ifdef REG_PARM_STACK_SPACE
4879 if (ACCUMULATE_OUTGOING_ARGS
)
4881 /* The argument list is the property of the called routine and it
4882 may clobber it. If the fixed area has been used for previous
4883 parameters, we must save and restore it. */
4884 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
4885 &low_to_save
, &high_to_save
);
4889 /* When expanding a normal call, args are stored in push order,
4890 which is the reverse of what we have here. */
4891 bool any_regs
= false;
4892 for (int i
= nargs
; i
-- > 0; )
4893 if (argvec
[i
].reg
!= NULL_RTX
)
4895 targetm
.calls
.call_args (argvec
[i
].reg
, NULL_TREE
);
4899 targetm
.calls
.call_args (pc_rtx
, NULL_TREE
);
4901 /* Push the args that need to be pushed. */
4903 have_push_fusage
= false;
4905 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4906 are to be pushed. */
4907 for (count
= 0; count
< nargs
; count
++, argnum
--)
4909 machine_mode mode
= argvec
[argnum
].mode
;
4910 rtx val
= argvec
[argnum
].value
;
4911 rtx reg
= argvec
[argnum
].reg
;
4912 int partial
= argvec
[argnum
].partial
;
4913 unsigned int parm_align
= argvec
[argnum
].locate
.boundary
;
4914 int lower_bound
= 0, upper_bound
= 0, i
;
4916 if (! (reg
!= 0 && partial
== 0))
4920 if (ACCUMULATE_OUTGOING_ARGS
)
4922 /* If this is being stored into a pre-allocated, fixed-size,
4923 stack area, save any previous data at that location. */
4925 if (ARGS_GROW_DOWNWARD
)
4927 /* stack_slot is negative, but we want to index stack_usage_map
4928 with positive values. */
4929 upper_bound
= -argvec
[argnum
].locate
.slot_offset
.constant
+ 1;
4930 lower_bound
= upper_bound
- argvec
[argnum
].locate
.size
.constant
;
4934 lower_bound
= argvec
[argnum
].locate
.slot_offset
.constant
;
4935 upper_bound
= lower_bound
+ argvec
[argnum
].locate
.size
.constant
;
4939 /* Don't worry about things in the fixed argument area;
4940 it has already been saved. */
4941 if (i
< reg_parm_stack_space
)
4942 i
= reg_parm_stack_space
;
4943 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
4946 if (i
< upper_bound
)
4948 /* We need to make a save area. */
4950 = argvec
[argnum
].locate
.size
.constant
* BITS_PER_UNIT
;
4951 machine_mode save_mode
4952 = int_mode_for_size (size
, 1).else_blk ();
4954 = plus_constant (Pmode
, argblock
,
4955 argvec
[argnum
].locate
.offset
.constant
);
4957 = gen_rtx_MEM (save_mode
, memory_address (save_mode
, adr
));
4959 if (save_mode
== BLKmode
)
4961 argvec
[argnum
].save_area
4962 = assign_stack_temp (BLKmode
,
4963 argvec
[argnum
].locate
.size
.constant
4966 emit_block_move (validize_mem
4967 (copy_rtx (argvec
[argnum
].save_area
)),
4969 GEN_INT (argvec
[argnum
].locate
.size
.constant
),
4970 BLOCK_OP_CALL_PARM
);
4974 argvec
[argnum
].save_area
= gen_reg_rtx (save_mode
);
4976 emit_move_insn (argvec
[argnum
].save_area
, stack_area
);
4981 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, parm_align
,
4982 partial
, reg
, 0, argblock
,
4983 GEN_INT (argvec
[argnum
].locate
.offset
.constant
),
4984 reg_parm_stack_space
,
4985 ARGS_SIZE_RTX (argvec
[argnum
].locate
.alignment_pad
), false);
4987 /* Now mark the segment we just used. */
4988 if (ACCUMULATE_OUTGOING_ARGS
)
4989 for (i
= lower_bound
; i
< upper_bound
; i
++)
4990 stack_usage_map
[i
] = 1;
4994 /* Indicate argument access so that alias.c knows that these
4997 use
= plus_constant (Pmode
, argblock
,
4998 argvec
[argnum
].locate
.offset
.constant
);
4999 else if (have_push_fusage
)
5003 /* When arguments are pushed, trying to tell alias.c where
5004 exactly this argument is won't work, because the
5005 auto-increment causes confusion. So we merely indicate
5006 that we access something with a known mode somewhere on
5008 use
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
5009 gen_rtx_SCRATCH (Pmode
));
5010 have_push_fusage
= true;
5012 use
= gen_rtx_MEM (argvec
[argnum
].mode
, use
);
5013 use
= gen_rtx_USE (VOIDmode
, use
);
5014 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
, use
, call_fusage
);
5020 fun
= prepare_call_address (NULL
, fun
, NULL
, &call_fusage
, 0, 0);
5022 /* Now load any reg parms into their regs. */
5024 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
5025 are to be pushed. */
5026 for (count
= 0; count
< nargs
; count
++, argnum
--)
5028 machine_mode mode
= argvec
[argnum
].mode
;
5029 rtx val
= argvec
[argnum
].value
;
5030 rtx reg
= argvec
[argnum
].reg
;
5031 int partial
= argvec
[argnum
].partial
;
5032 #ifdef BLOCK_REG_PADDING
5036 /* Handle calls that pass values in multiple non-contiguous
5037 locations. The PA64 has examples of this for library calls. */
5038 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
5039 emit_group_load (reg
, val
, NULL_TREE
, GET_MODE_SIZE (mode
));
5040 else if (reg
!= 0 && partial
== 0)
5042 emit_move_insn (reg
, val
);
5043 #ifdef BLOCK_REG_PADDING
5044 size
= GET_MODE_SIZE (argvec
[argnum
].mode
);
5046 /* Copied from load_register_parameters. */
5048 /* Handle case where we have a value that needs shifting
5049 up to the msb. eg. a QImode value and we're padding
5050 upward on a BYTES_BIG_ENDIAN machine. */
5051 if (size
< UNITS_PER_WORD
5052 && (argvec
[argnum
].locate
.where_pad
5053 == (BYTES_BIG_ENDIAN
? PAD_UPWARD
: PAD_DOWNWARD
)))
5056 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
5058 /* Assigning REG here rather than a temp makes CALL_FUSAGE
5059 report the whole reg as used. Strictly speaking, the
5060 call only uses SIZE bytes at the msb end, but it doesn't
5061 seem worth generating rtl to say that. */
5062 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
5063 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, shift
, reg
, 1);
5065 emit_move_insn (reg
, x
);
5073 /* Any regs containing parms remain in use through the call. */
5074 for (count
= 0; count
< nargs
; count
++)
5076 rtx reg
= argvec
[count
].reg
;
5077 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
5078 use_group_regs (&call_fusage
, reg
);
5081 int partial
= argvec
[count
].partial
;
5085 gcc_assert (partial
% UNITS_PER_WORD
== 0);
5086 nregs
= partial
/ UNITS_PER_WORD
;
5087 use_regs (&call_fusage
, REGNO (reg
), nregs
);
5090 use_reg (&call_fusage
, reg
);
5094 /* Pass the function the address in which to return a structure value. */
5095 if (mem_value
!= 0 && struct_value
!= 0 && ! pcc_struct_value
)
5097 emit_move_insn (struct_value
,
5099 force_operand (XEXP (mem_value
, 0),
5101 if (REG_P (struct_value
))
5102 use_reg (&call_fusage
, struct_value
);
5105 /* Don't allow popping to be deferred, since then
5106 cse'ing of library calls could delete a call and leave the pop. */
5108 valreg
= (mem_value
== 0 && outmode
!= VOIDmode
5109 ? hard_libcall_value (outmode
, orgfun
) : NULL_RTX
);
5111 /* Stack must be properly aligned now. */
5112 gcc_assert (!(stack_pointer_delta
5113 & (PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
- 1)));
5115 before_call
= get_last_insn ();
5117 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
5118 will set inhibit_defer_pop to that value. */
5119 /* The return type is needed to decide how many bytes the function pops.
5120 Signedness plays no role in that, so for simplicity, we pretend it's
5121 always signed. We also assume that the list of arguments passed has
5122 no impact, so we pretend it is unknown. */
5124 emit_call_1 (fun
, NULL
,
5125 get_identifier (XSTR (orgfun
, 0)),
5126 build_function_type (tfom
, NULL_TREE
),
5127 original_args_size
.constant
, args_size
.constant
,
5129 targetm
.calls
.function_arg (args_so_far
,
5130 VOIDmode
, void_type_node
, true),
5132 old_inhibit_defer_pop
+ 1, call_fusage
, flags
, args_so_far
);
5137 gcc_assert (GET_CODE (datum
) == SYMBOL_REF
);
5138 rtx_call_insn
*last
= last_call_insn ();
5139 add_reg_note (last
, REG_CALL_DECL
, datum
);
5142 /* Right-shift returned value if necessary. */
5143 if (!pcc_struct_value
5144 && TYPE_MODE (tfom
) != BLKmode
5145 && targetm
.calls
.return_in_msb (tfom
))
5147 shift_return_value (TYPE_MODE (tfom
), false, valreg
);
5148 valreg
= gen_rtx_REG (TYPE_MODE (tfom
), REGNO (valreg
));
5151 targetm
.calls
.end_call_args ();
5153 /* For calls to `setjmp', etc., inform function.c:setjmp_warnings
5154 that it should complain if nonvolatile values are live. For
5155 functions that cannot return, inform flow that control does not
5157 if (flags
& ECF_NORETURN
)
5159 /* The barrier note must be emitted
5160 immediately after the CALL_INSN. Some ports emit more than
5161 just a CALL_INSN above, so we must search for it here. */
5162 rtx_insn
*last
= get_last_insn ();
5163 while (!CALL_P (last
))
5165 last
= PREV_INSN (last
);
5166 /* There was no CALL_INSN? */
5167 gcc_assert (last
!= before_call
);
5170 emit_barrier_after (last
);
5173 /* Consider that "regular" libcalls, i.e. all of them except for LCT_THROW
5174 and LCT_RETURNS_TWICE, cannot perform non-local gotos. */
5175 if (flags
& ECF_NOTHROW
)
5177 rtx_insn
*last
= get_last_insn ();
5178 while (!CALL_P (last
))
5180 last
= PREV_INSN (last
);
5181 /* There was no CALL_INSN? */
5182 gcc_assert (last
!= before_call
);
5185 make_reg_eh_region_note_nothrow_nononlocal (last
);
5188 /* Now restore inhibit_defer_pop to its actual original value. */
5193 /* Copy the value to the right place. */
5194 if (outmode
!= VOIDmode
&& retval
)
5200 if (value
!= mem_value
)
5201 emit_move_insn (value
, mem_value
);
5203 else if (GET_CODE (valreg
) == PARALLEL
)
5206 value
= gen_reg_rtx (outmode
);
5207 emit_group_store (value
, valreg
, NULL_TREE
, GET_MODE_SIZE (outmode
));
5211 /* Convert to the proper mode if a promotion has been active. */
5212 if (GET_MODE (valreg
) != outmode
)
5214 int unsignedp
= TYPE_UNSIGNED (tfom
);
5216 gcc_assert (promote_function_mode (tfom
, outmode
, &unsignedp
,
5217 fndecl
? TREE_TYPE (fndecl
) : fntype
, 1)
5218 == GET_MODE (valreg
));
5219 valreg
= convert_modes (outmode
, GET_MODE (valreg
), valreg
, 0);
5223 emit_move_insn (value
, valreg
);
5229 if (ACCUMULATE_OUTGOING_ARGS
)
5231 #ifdef REG_PARM_STACK_SPACE
5233 restore_fixed_argument_area (save_area
, argblock
,
5234 high_to_save
, low_to_save
);
5237 /* If we saved any argument areas, restore them. */
5238 for (count
= 0; count
< nargs
; count
++)
5239 if (argvec
[count
].save_area
)
5241 machine_mode save_mode
= GET_MODE (argvec
[count
].save_area
);
5242 rtx adr
= plus_constant (Pmode
, argblock
,
5243 argvec
[count
].locate
.offset
.constant
);
5244 rtx stack_area
= gen_rtx_MEM (save_mode
,
5245 memory_address (save_mode
, adr
));
5247 if (save_mode
== BLKmode
)
5248 emit_block_move (stack_area
,
5250 (copy_rtx (argvec
[count
].save_area
)),
5251 GEN_INT (argvec
[count
].locate
.size
.constant
),
5252 BLOCK_OP_CALL_PARM
);
5254 emit_move_insn (stack_area
, argvec
[count
].save_area
);
5257 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
5258 stack_usage_map
= initial_stack_usage_map
;
5261 free (stack_usage_map_buf
);
5268 /* Store pointer bounds argument ARG into Bounds Table entry
5269 associated with PARM. */
5271 store_bounds (struct arg_data
*arg
, struct arg_data
*parm
)
5273 rtx slot
= NULL
, ptr
= NULL
, addr
= NULL
;
5275 /* We may pass bounds not associated with any pointer. */
5278 gcc_assert (arg
->special_slot
);
5279 slot
= arg
->special_slot
;
5282 /* Find pointer associated with bounds and where it is
5288 gcc_assert (!arg
->special_slot
);
5290 addr
= adjust_address (parm
->stack
, Pmode
, arg
->pointer_offset
);
5292 else if (REG_P (parm
->reg
))
5294 gcc_assert (arg
->special_slot
);
5295 slot
= arg
->special_slot
;
5297 if (MEM_P (parm
->value
))
5298 addr
= adjust_address (parm
->value
, Pmode
, arg
->pointer_offset
);
5299 else if (REG_P (parm
->value
))
5300 ptr
= gen_rtx_SUBREG (Pmode
, parm
->value
, arg
->pointer_offset
);
5303 gcc_assert (!arg
->pointer_offset
);
5309 gcc_assert (GET_CODE (parm
->reg
) == PARALLEL
);
5311 gcc_assert (arg
->special_slot
);
5312 slot
= arg
->special_slot
;
5314 if (parm
->parallel_value
)
5315 ptr
= chkp_get_value_with_offs (parm
->parallel_value
,
5316 GEN_INT (arg
->pointer_offset
));
5322 /* Expand bounds. */
5324 arg
->value
= expand_normal (arg
->tree_value
);
5326 targetm
.calls
.store_bounds_for_arg (ptr
, addr
, arg
->value
, slot
);
5329 /* Store a single argument for a function call
5330 into the register or memory area where it must be passed.
5331 *ARG describes the argument value and where to pass it.
5333 ARGBLOCK is the address of the stack-block for all the arguments,
5334 or 0 on a machine where arguments are pushed individually.
5336 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
5337 so must be careful about how the stack is used.
5339 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
5340 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
5341 that we need not worry about saving and restoring the stack.
5343 FNDECL is the declaration of the function we are calling.
5345 Return nonzero if this arg should cause sibcall failure,
5349 store_one_arg (struct arg_data
*arg
, rtx argblock
, int flags
,
5350 int variable_size ATTRIBUTE_UNUSED
, int reg_parm_stack_space
)
5352 tree pval
= arg
->tree_value
;
5356 int i
, lower_bound
= 0, upper_bound
= 0;
5357 int sibcall_failure
= 0;
5359 if (TREE_CODE (pval
) == ERROR_MARK
)
5362 /* Push a new temporary level for any temporaries we make for
5366 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
))
5368 /* If this is being stored into a pre-allocated, fixed-size, stack area,
5369 save any previous data at that location. */
5370 if (argblock
&& ! variable_size
&& arg
->stack
)
5372 if (ARGS_GROW_DOWNWARD
)
5374 /* stack_slot is negative, but we want to index stack_usage_map
5375 with positive values. */
5376 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
5377 upper_bound
= -INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1)) + 1;
5381 lower_bound
= upper_bound
- arg
->locate
.size
.constant
;
5385 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
5386 lower_bound
= INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1));
5390 upper_bound
= lower_bound
+ arg
->locate
.size
.constant
;
5394 /* Don't worry about things in the fixed argument area;
5395 it has already been saved. */
5396 if (i
< reg_parm_stack_space
)
5397 i
= reg_parm_stack_space
;
5398 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
5401 if (i
< upper_bound
)
5403 /* We need to make a save area. */
5404 unsigned int size
= arg
->locate
.size
.constant
* BITS_PER_UNIT
;
5405 machine_mode save_mode
5406 = int_mode_for_size (size
, 1).else_blk ();
5407 rtx adr
= memory_address (save_mode
, XEXP (arg
->stack_slot
, 0));
5408 rtx stack_area
= gen_rtx_MEM (save_mode
, adr
);
5410 if (save_mode
== BLKmode
)
5413 = assign_temp (TREE_TYPE (arg
->tree_value
), 1, 1);
5414 preserve_temp_slots (arg
->save_area
);
5415 emit_block_move (validize_mem (copy_rtx (arg
->save_area
)),
5417 GEN_INT (arg
->locate
.size
.constant
),
5418 BLOCK_OP_CALL_PARM
);
5422 arg
->save_area
= gen_reg_rtx (save_mode
);
5423 emit_move_insn (arg
->save_area
, stack_area
);
5429 /* If this isn't going to be placed on both the stack and in registers,
5430 set up the register and number of words. */
5431 if (! arg
->pass_on_stack
)
5433 if (flags
& ECF_SIBCALL
)
5434 reg
= arg
->tail_call_reg
;
5437 partial
= arg
->partial
;
5440 /* Being passed entirely in a register. We shouldn't be called in
5442 gcc_assert (reg
== 0 || partial
!= 0);
5444 /* If this arg needs special alignment, don't load the registers
5446 if (arg
->n_aligned_regs
!= 0)
5449 /* If this is being passed partially in a register, we can't evaluate
5450 it directly into its stack slot. Otherwise, we can. */
5451 if (arg
->value
== 0)
5453 /* stack_arg_under_construction is nonzero if a function argument is
5454 being evaluated directly into the outgoing argument list and
5455 expand_call must take special action to preserve the argument list
5456 if it is called recursively.
5458 For scalar function arguments stack_usage_map is sufficient to
5459 determine which stack slots must be saved and restored. Scalar
5460 arguments in general have pass_on_stack == 0.
5462 If this argument is initialized by a function which takes the
5463 address of the argument (a C++ constructor or a C function
5464 returning a BLKmode structure), then stack_usage_map is
5465 insufficient and expand_call must push the stack around the
5466 function call. Such arguments have pass_on_stack == 1.
5468 Note that it is always safe to set stack_arg_under_construction,
5469 but this generates suboptimal code if set when not needed. */
5471 if (arg
->pass_on_stack
)
5472 stack_arg_under_construction
++;
5474 arg
->value
= expand_expr (pval
,
5476 || TYPE_MODE (TREE_TYPE (pval
)) != arg
->mode
)
5477 ? NULL_RTX
: arg
->stack
,
5478 VOIDmode
, EXPAND_STACK_PARM
);
5480 /* If we are promoting object (or for any other reason) the mode
5481 doesn't agree, convert the mode. */
5483 if (arg
->mode
!= TYPE_MODE (TREE_TYPE (pval
)))
5484 arg
->value
= convert_modes (arg
->mode
, TYPE_MODE (TREE_TYPE (pval
)),
5485 arg
->value
, arg
->unsignedp
);
5487 if (arg
->pass_on_stack
)
5488 stack_arg_under_construction
--;
5491 /* Check for overlap with already clobbered argument area. */
5492 if ((flags
& ECF_SIBCALL
)
5493 && MEM_P (arg
->value
)
5494 && mem_overlaps_already_clobbered_arg_p (XEXP (arg
->value
, 0),
5495 arg
->locate
.size
.constant
))
5496 sibcall_failure
= 1;
5498 /* Don't allow anything left on stack from computation
5499 of argument to alloca. */
5500 if (flags
& ECF_MAY_BE_ALLOCA
)
5501 do_pending_stack_adjust ();
5503 if (arg
->value
== arg
->stack
)
5504 /* If the value is already in the stack slot, we are done. */
5506 else if (arg
->mode
!= BLKmode
)
5509 unsigned int parm_align
;
5511 /* Argument is a scalar, not entirely passed in registers.
5512 (If part is passed in registers, arg->partial says how much
5513 and emit_push_insn will take care of putting it there.)
5515 Push it, and if its size is less than the
5516 amount of space allocated to it,
5517 also bump stack pointer by the additional space.
5518 Note that in C the default argument promotions
5519 will prevent such mismatches. */
5521 if (TYPE_EMPTY_P (TREE_TYPE (pval
)))
5524 size
= GET_MODE_SIZE (arg
->mode
);
5526 /* Compute how much space the push instruction will push.
5527 On many machines, pushing a byte will advance the stack
5528 pointer by a halfword. */
5529 #ifdef PUSH_ROUNDING
5530 size
= PUSH_ROUNDING (size
);
5534 /* Compute how much space the argument should get:
5535 round up to a multiple of the alignment for arguments. */
5536 if (targetm
.calls
.function_arg_padding (arg
->mode
, TREE_TYPE (pval
))
5538 used
= (((size
+ PARM_BOUNDARY
/ BITS_PER_UNIT
- 1)
5539 / (PARM_BOUNDARY
/ BITS_PER_UNIT
))
5540 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
5542 /* Compute the alignment of the pushed argument. */
5543 parm_align
= arg
->locate
.boundary
;
5544 if (targetm
.calls
.function_arg_padding (arg
->mode
, TREE_TYPE (pval
))
5547 int pad
= used
- size
;
5550 unsigned int pad_align
= least_bit_hwi (pad
) * BITS_PER_UNIT
;
5551 parm_align
= MIN (parm_align
, pad_align
);
5555 /* This isn't already where we want it on the stack, so put it there.
5556 This can either be done with push or copy insns. */
5558 && !emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
),
5559 NULL_RTX
, parm_align
, partial
, reg
, used
- size
,
5560 argblock
, ARGS_SIZE_RTX (arg
->locate
.offset
),
5561 reg_parm_stack_space
,
5562 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
), true))
5563 sibcall_failure
= 1;
5565 /* Unless this is a partially-in-register argument, the argument is now
5568 arg
->value
= arg
->stack
;
5572 /* BLKmode, at least partly to be pushed. */
5574 unsigned int parm_align
;
5578 /* Pushing a nonscalar.
5579 If part is passed in registers, PARTIAL says how much
5580 and emit_push_insn will take care of putting it there. */
5582 /* Round its size up to a multiple
5583 of the allocation unit for arguments. */
5585 if (arg
->locate
.size
.var
!= 0)
5588 size_rtx
= ARGS_SIZE_RTX (arg
->locate
.size
);
5592 /* PUSH_ROUNDING has no effect on us, because emit_push_insn
5593 for BLKmode is careful to avoid it. */
5594 excess
= (arg
->locate
.size
.constant
5595 - arg_int_size_in_bytes (TREE_TYPE (pval
))
5597 size_rtx
= expand_expr (arg_size_in_bytes (TREE_TYPE (pval
)),
5598 NULL_RTX
, TYPE_MODE (sizetype
),
5602 parm_align
= arg
->locate
.boundary
;
5604 /* When an argument is padded down, the block is aligned to
5605 PARM_BOUNDARY, but the actual argument isn't. */
5606 if (targetm
.calls
.function_arg_padding (arg
->mode
, TREE_TYPE (pval
))
5609 if (arg
->locate
.size
.var
)
5610 parm_align
= BITS_PER_UNIT
;
5613 unsigned int excess_align
= least_bit_hwi (excess
) * BITS_PER_UNIT
;
5614 parm_align
= MIN (parm_align
, excess_align
);
5618 if ((flags
& ECF_SIBCALL
) && MEM_P (arg
->value
))
5620 /* emit_push_insn might not work properly if arg->value and
5621 argblock + arg->locate.offset areas overlap. */
5625 if (XEXP (x
, 0) == crtl
->args
.internal_arg_pointer
5626 || (GET_CODE (XEXP (x
, 0)) == PLUS
5627 && XEXP (XEXP (x
, 0), 0) ==
5628 crtl
->args
.internal_arg_pointer
5629 && CONST_INT_P (XEXP (XEXP (x
, 0), 1))))
5631 if (XEXP (x
, 0) != crtl
->args
.internal_arg_pointer
)
5632 i
= INTVAL (XEXP (XEXP (x
, 0), 1));
5634 /* arg.locate doesn't contain the pretend_args_size offset,
5635 it's part of argblock. Ensure we don't count it in I. */
5636 if (STACK_GROWS_DOWNWARD
)
5637 i
-= crtl
->args
.pretend_args_size
;
5639 i
+= crtl
->args
.pretend_args_size
;
5641 /* expand_call should ensure this. */
5642 gcc_assert (!arg
->locate
.offset
.var
5643 && arg
->locate
.size
.var
== 0
5644 && CONST_INT_P (size_rtx
));
5646 if (arg
->locate
.offset
.constant
> i
)
5648 if (arg
->locate
.offset
.constant
< i
+ INTVAL (size_rtx
))
5649 sibcall_failure
= 1;
5651 else if (arg
->locate
.offset
.constant
< i
)
5653 /* Use arg->locate.size.constant instead of size_rtx
5654 because we only care about the part of the argument
5656 if (i
< (arg
->locate
.offset
.constant
5657 + arg
->locate
.size
.constant
))
5658 sibcall_failure
= 1;
5662 /* Even though they appear to be at the same location,
5663 if part of the outgoing argument is in registers,
5664 they aren't really at the same location. Check for
5665 this by making sure that the incoming size is the
5666 same as the outgoing size. */
5667 if (arg
->locate
.size
.constant
!= INTVAL (size_rtx
))
5668 sibcall_failure
= 1;
5673 if (!CONST_INT_P (size_rtx
) || INTVAL (size_rtx
) != 0)
5674 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx
,
5675 parm_align
, partial
, reg
, excess
, argblock
,
5676 ARGS_SIZE_RTX (arg
->locate
.offset
),
5677 reg_parm_stack_space
,
5678 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
), false);
5680 /* Unless this is a partially-in-register argument, the argument is now
5683 ??? Unlike the case above, in which we want the actual
5684 address of the data, so that we can load it directly into a
5685 register, here we want the address of the stack slot, so that
5686 it's properly aligned for word-by-word copying or something
5687 like that. It's not clear that this is always correct. */
5689 arg
->value
= arg
->stack_slot
;
5692 if (arg
->reg
&& GET_CODE (arg
->reg
) == PARALLEL
)
5694 tree type
= TREE_TYPE (arg
->tree_value
);
5696 = emit_group_load_into_temps (arg
->reg
, arg
->value
, type
,
5697 int_size_in_bytes (type
));
5700 /* Mark all slots this store used. */
5701 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
)
5702 && argblock
&& ! variable_size
&& arg
->stack
)
5703 for (i
= lower_bound
; i
< upper_bound
; i
++)
5704 stack_usage_map
[i
] = 1;
5706 /* Once we have pushed something, pops can't safely
5707 be deferred during the rest of the arguments. */
5710 /* Free any temporary slots made in processing this argument. */
5713 return sibcall_failure
;
5716 /* Nonzero if we do not know how to pass TYPE solely in registers. */
5719 must_pass_in_stack_var_size (machine_mode mode ATTRIBUTE_UNUSED
,
5725 /* If the type has variable size... */
5726 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
5729 /* If the type is marked as addressable (it is required
5730 to be constructed into the stack)... */
5731 if (TREE_ADDRESSABLE (type
))
5737 /* Another version of the TARGET_MUST_PASS_IN_STACK hook. This one
5738 takes trailing padding of a structure into account. */
5739 /* ??? Should be able to merge these two by examining BLOCK_REG_PADDING. */
5742 must_pass_in_stack_var_size_or_pad (machine_mode mode
, const_tree type
)
5747 /* If the type has variable size... */
5748 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
5751 /* If the type is marked as addressable (it is required
5752 to be constructed into the stack)... */
5753 if (TREE_ADDRESSABLE (type
))
5756 if (TYPE_EMPTY_P (type
))
5759 /* If the padding and mode of the type is such that a copy into
5760 a register would put it into the wrong part of the register. */
5762 && int_size_in_bytes (type
) % (PARM_BOUNDARY
/ BITS_PER_UNIT
)
5763 && (targetm
.calls
.function_arg_padding (mode
, type
)
5764 == (BYTES_BIG_ENDIAN
? PAD_UPWARD
: PAD_DOWNWARD
)))
5770 /* Tell the garbage collector about GTY markers in this source file. */
5771 #include "gt-calls.h"