1 /* Convert function calls to rtl insns, for GNU C compiler.
2 Copyright (C) 1989-2018 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"
51 #include "tree-ssanames.h"
53 #include "stringpool.h"
56 #include "gimple-fold.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 unsigned int highest_outgoing_arg_in_use
;
132 /* Assume that any stack location at this byte index is used,
133 without checking the contents of stack_usage_map. */
134 static unsigned HOST_WIDE_INT stack_usage_watermark
= HOST_WIDE_INT_M1U
;
136 /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
137 stack location's tail call argument has been already stored into the stack.
138 This bitmap is used to prevent sibling call optimization if function tries
139 to use parent's incoming argument slots when they have been already
140 overwritten with tail call arguments. */
141 static sbitmap stored_args_map
;
143 /* Assume that any virtual-incoming location at this byte index has been
144 stored, without checking the contents of stored_args_map. */
145 static unsigned HOST_WIDE_INT stored_args_watermark
;
147 /* stack_arg_under_construction is nonzero when an argument may be
148 initialized with a constructor call (including a C function that
149 returns a BLKmode struct) and expand_call must take special action
150 to make sure the object being constructed does not overlap the
151 argument list for the constructor call. */
152 static int stack_arg_under_construction
;
154 static void precompute_register_parameters (int, struct arg_data
*, int *);
155 static int store_one_arg (struct arg_data
*, rtx
, int, int, int);
156 static void store_unaligned_arguments_into_pseudos (struct arg_data
*, int);
157 static int finalize_must_preallocate (int, int, struct arg_data
*,
159 static void precompute_arguments (int, struct arg_data
*);
160 static void compute_argument_addresses (struct arg_data
*, rtx
, int);
161 static rtx
rtx_for_function_call (tree
, tree
);
162 static void load_register_parameters (struct arg_data
*, int, rtx
*, int,
164 static int special_function_p (const_tree
, int);
165 static int check_sibcall_argument_overlap_1 (rtx
);
166 static int check_sibcall_argument_overlap (rtx_insn
*, struct arg_data
*, int);
168 static tree
split_complex_types (tree
);
170 #ifdef REG_PARM_STACK_SPACE
171 static rtx
save_fixed_argument_area (int, rtx
, int *, int *);
172 static void restore_fixed_argument_area (rtx
, rtx
, int, int);
175 /* Return true if bytes [LOWER_BOUND, UPPER_BOUND) of the outgoing
176 stack region might already be in use. */
179 stack_region_maybe_used_p (poly_uint64 lower_bound
, poly_uint64 upper_bound
,
180 unsigned int reg_parm_stack_space
)
182 unsigned HOST_WIDE_INT const_lower
, const_upper
;
183 const_lower
= constant_lower_bound (lower_bound
);
184 if (!upper_bound
.is_constant (&const_upper
))
185 const_upper
= HOST_WIDE_INT_M1U
;
187 if (const_upper
> stack_usage_watermark
)
190 /* Don't worry about things in the fixed argument area;
191 it has already been saved. */
192 const_lower
= MAX (const_lower
, reg_parm_stack_space
);
193 const_upper
= MIN (const_upper
, highest_outgoing_arg_in_use
);
194 for (unsigned HOST_WIDE_INT i
= const_lower
; i
< const_upper
; ++i
)
195 if (stack_usage_map
[i
])
200 /* Record that bytes [LOWER_BOUND, UPPER_BOUND) of the outgoing
201 stack region are now in use. */
204 mark_stack_region_used (poly_uint64 lower_bound
, poly_uint64 upper_bound
)
206 unsigned HOST_WIDE_INT const_lower
, const_upper
;
207 const_lower
= constant_lower_bound (lower_bound
);
208 if (upper_bound
.is_constant (&const_upper
))
209 for (unsigned HOST_WIDE_INT i
= const_lower
; i
< const_upper
; ++i
)
210 stack_usage_map
[i
] = 1;
212 stack_usage_watermark
= MIN (stack_usage_watermark
, const_lower
);
215 /* Force FUNEXP into a form suitable for the address of a CALL,
216 and return that as an rtx. Also load the static chain register
217 if FNDECL is a nested function.
219 CALL_FUSAGE points to a variable holding the prospective
220 CALL_INSN_FUNCTION_USAGE information. */
223 prepare_call_address (tree fndecl_or_type
, rtx funexp
, rtx static_chain_value
,
224 rtx
*call_fusage
, int reg_parm_seen
, int flags
)
226 /* Make a valid memory address and copy constants through pseudo-regs,
227 but not for a constant address if -fno-function-cse. */
228 if (GET_CODE (funexp
) != SYMBOL_REF
)
230 /* If it's an indirect call by descriptor, generate code to perform
231 runtime identification of the pointer and load the descriptor. */
232 if ((flags
& ECF_BY_DESCRIPTOR
) && !flag_trampolines
)
234 const int bit_val
= targetm
.calls
.custom_function_descriptors
;
235 rtx call_lab
= gen_label_rtx ();
237 gcc_assert (fndecl_or_type
&& TYPE_P (fndecl_or_type
));
239 = build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
, NULL_TREE
,
241 DECL_STATIC_CHAIN (fndecl_or_type
) = 1;
242 rtx chain
= targetm
.calls
.static_chain (fndecl_or_type
, false);
244 if (GET_MODE (funexp
) != Pmode
)
245 funexp
= convert_memory_address (Pmode
, funexp
);
247 /* Avoid long live ranges around function calls. */
248 funexp
= copy_to_mode_reg (Pmode
, funexp
);
251 emit_insn (gen_rtx_CLOBBER (VOIDmode
, chain
));
253 /* Emit the runtime identification pattern. */
254 rtx mask
= gen_rtx_AND (Pmode
, funexp
, GEN_INT (bit_val
));
255 emit_cmp_and_jump_insns (mask
, const0_rtx
, EQ
, NULL_RTX
, Pmode
, 1,
258 /* Statically predict the branch to very likely taken. */
259 rtx_insn
*insn
= get_last_insn ();
261 predict_insn_def (insn
, PRED_BUILTIN_EXPECT
, TAKEN
);
263 /* Load the descriptor. */
264 rtx mem
= gen_rtx_MEM (ptr_mode
,
265 plus_constant (Pmode
, funexp
, - bit_val
));
266 MEM_NOTRAP_P (mem
) = 1;
267 mem
= convert_memory_address (Pmode
, mem
);
268 emit_move_insn (chain
, mem
);
270 mem
= gen_rtx_MEM (ptr_mode
,
271 plus_constant (Pmode
, funexp
,
272 POINTER_SIZE
/ BITS_PER_UNIT
274 MEM_NOTRAP_P (mem
) = 1;
275 mem
= convert_memory_address (Pmode
, mem
);
276 emit_move_insn (funexp
, mem
);
278 emit_label (call_lab
);
282 use_reg (call_fusage
, chain
);
283 STATIC_CHAIN_REG_P (chain
) = 1;
286 /* Make sure we're not going to be overwritten below. */
287 gcc_assert (!static_chain_value
);
290 /* If we are using registers for parameters, force the
291 function address into a register now. */
292 funexp
= ((reg_parm_seen
293 && targetm
.small_register_classes_for_mode_p (FUNCTION_MODE
))
294 ? force_not_mem (memory_address (FUNCTION_MODE
, funexp
))
295 : memory_address (FUNCTION_MODE
, funexp
));
299 /* funexp could be a SYMBOL_REF represents a function pointer which is
300 of ptr_mode. In this case, it should be converted into address mode
301 to be a valid address for memory rtx pattern. See PR 64971. */
302 if (GET_MODE (funexp
) != Pmode
)
303 funexp
= convert_memory_address (Pmode
, funexp
);
305 if (!(flags
& ECF_SIBCALL
))
307 if (!NO_FUNCTION_CSE
&& optimize
&& ! flag_no_function_cse
)
308 funexp
= force_reg (Pmode
, funexp
);
312 if (static_chain_value
!= 0
313 && (TREE_CODE (fndecl_or_type
) != FUNCTION_DECL
314 || DECL_STATIC_CHAIN (fndecl_or_type
)))
318 chain
= targetm
.calls
.static_chain (fndecl_or_type
, false);
319 static_chain_value
= convert_memory_address (Pmode
, static_chain_value
);
321 emit_move_insn (chain
, static_chain_value
);
324 use_reg (call_fusage
, chain
);
325 STATIC_CHAIN_REG_P (chain
) = 1;
332 /* Generate instructions to call function FUNEXP,
333 and optionally pop the results.
334 The CALL_INSN is the first insn generated.
336 FNDECL is the declaration node of the function. This is given to the
337 hook TARGET_RETURN_POPS_ARGS to determine whether this function pops
340 FUNTYPE is the data type of the function. This is given to the hook
341 TARGET_RETURN_POPS_ARGS to determine whether this function pops its
342 own args. We used to allow an identifier for library functions, but
343 that doesn't work when the return type is an aggregate type and the
344 calling convention says that the pointer to this aggregate is to be
345 popped by the callee.
347 STACK_SIZE is the number of bytes of arguments on the stack,
348 ROUNDED_STACK_SIZE is that number rounded up to
349 PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
350 both to put into the call insn and to generate explicit popping
353 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
354 It is zero if this call doesn't want a structure value.
356 NEXT_ARG_REG is the rtx that results from executing
357 targetm.calls.function_arg (&args_so_far, VOIDmode, void_type_node, true)
358 just after all the args have had their registers assigned.
359 This could be whatever you like, but normally it is the first
360 arg-register beyond those used for args in this call,
361 or 0 if all the arg-registers are used in this call.
362 It is passed on to `gen_call' so you can put this info in the call insn.
364 VALREG is a hard register in which a value is returned,
365 or 0 if the call does not return a value.
367 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
368 the args to this call were processed.
369 We restore `inhibit_defer_pop' to that value.
371 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
372 denote registers used by the called function. */
375 emit_call_1 (rtx funexp
, tree fntree ATTRIBUTE_UNUSED
, tree fndecl ATTRIBUTE_UNUSED
,
376 tree funtype ATTRIBUTE_UNUSED
,
377 poly_int64 stack_size ATTRIBUTE_UNUSED
,
378 poly_int64 rounded_stack_size
,
379 poly_int64 struct_value_size ATTRIBUTE_UNUSED
,
380 rtx next_arg_reg ATTRIBUTE_UNUSED
, rtx valreg
,
381 int old_inhibit_defer_pop
, rtx call_fusage
, int ecf_flags
,
382 cumulative_args_t args_so_far ATTRIBUTE_UNUSED
)
384 rtx rounded_stack_size_rtx
= gen_int_mode (rounded_stack_size
, Pmode
);
385 rtx call
, funmem
, pat
;
386 int already_popped
= 0;
387 poly_int64 n_popped
= 0;
389 /* Sibling call patterns never pop arguments (no sibcall(_value)_pop
390 patterns exist). Any popping that the callee does on return will
391 be from our caller's frame rather than ours. */
392 if (!(ecf_flags
& ECF_SIBCALL
))
394 n_popped
+= targetm
.calls
.return_pops_args (fndecl
, funtype
, stack_size
);
396 #ifdef CALL_POPS_ARGS
397 n_popped
+= CALL_POPS_ARGS (*get_cumulative_args (args_so_far
));
401 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
402 and we don't want to load it into a register as an optimization,
403 because prepare_call_address already did it if it should be done. */
404 if (GET_CODE (funexp
) != SYMBOL_REF
)
405 funexp
= memory_address (FUNCTION_MODE
, funexp
);
407 funmem
= gen_rtx_MEM (FUNCTION_MODE
, funexp
);
408 if (fndecl
&& TREE_CODE (fndecl
) == FUNCTION_DECL
)
412 /* Although a built-in FUNCTION_DECL and its non-__builtin
413 counterpart compare equal and get a shared mem_attrs, they
414 produce different dump output in compare-debug compilations,
415 if an entry gets garbage collected in one compilation, then
416 adds a different (but equivalent) entry, while the other
417 doesn't run the garbage collector at the same spot and then
418 shares the mem_attr with the equivalent entry. */
419 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
421 tree t2
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
426 set_mem_expr (funmem
, t
);
429 set_mem_expr (funmem
, build_simple_mem_ref (CALL_EXPR_FN (fntree
)));
431 if (ecf_flags
& ECF_SIBCALL
)
434 pat
= targetm
.gen_sibcall_value (valreg
, funmem
,
435 rounded_stack_size_rtx
,
436 next_arg_reg
, NULL_RTX
);
438 pat
= targetm
.gen_sibcall (funmem
, rounded_stack_size_rtx
,
440 gen_int_mode (struct_value_size
, Pmode
));
442 /* If the target has "call" or "call_value" insns, then prefer them
443 if no arguments are actually popped. If the target does not have
444 "call" or "call_value" insns, then we must use the popping versions
445 even if the call has no arguments to pop. */
446 else if (maybe_ne (n_popped
, 0)
448 ? targetm
.have_call_value ()
449 : targetm
.have_call ()))
451 rtx n_pop
= gen_int_mode (n_popped
, Pmode
);
453 /* If this subroutine pops its own args, record that in the call insn
454 if possible, for the sake of frame pointer elimination. */
457 pat
= targetm
.gen_call_value_pop (valreg
, funmem
,
458 rounded_stack_size_rtx
,
459 next_arg_reg
, n_pop
);
461 pat
= targetm
.gen_call_pop (funmem
, rounded_stack_size_rtx
,
462 next_arg_reg
, n_pop
);
469 pat
= targetm
.gen_call_value (valreg
, funmem
, rounded_stack_size_rtx
,
470 next_arg_reg
, NULL_RTX
);
472 pat
= targetm
.gen_call (funmem
, rounded_stack_size_rtx
, next_arg_reg
,
473 gen_int_mode (struct_value_size
, Pmode
));
477 /* Find the call we just emitted. */
478 rtx_call_insn
*call_insn
= last_call_insn ();
480 /* Some target create a fresh MEM instead of reusing the one provided
481 above. Set its MEM_EXPR. */
482 call
= get_call_rtx_from (call_insn
);
484 && MEM_EXPR (XEXP (call
, 0)) == NULL_TREE
485 && MEM_EXPR (funmem
) != NULL_TREE
)
486 set_mem_expr (XEXP (call
, 0), MEM_EXPR (funmem
));
488 /* Put the register usage information there. */
489 add_function_usage_to (call_insn
, call_fusage
);
491 /* If this is a const call, then set the insn's unchanging bit. */
492 if (ecf_flags
& ECF_CONST
)
493 RTL_CONST_CALL_P (call_insn
) = 1;
495 /* If this is a pure call, then set the insn's unchanging bit. */
496 if (ecf_flags
& ECF_PURE
)
497 RTL_PURE_CALL_P (call_insn
) = 1;
499 /* If this is a const call, then set the insn's unchanging bit. */
500 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
501 RTL_LOOPING_CONST_OR_PURE_CALL_P (call_insn
) = 1;
503 /* Create a nothrow REG_EH_REGION note, if needed. */
504 make_reg_eh_region_note (call_insn
, ecf_flags
, 0);
506 if (ecf_flags
& ECF_NORETURN
)
507 add_reg_note (call_insn
, REG_NORETURN
, const0_rtx
);
509 if (ecf_flags
& ECF_RETURNS_TWICE
)
511 add_reg_note (call_insn
, REG_SETJMP
, const0_rtx
);
512 cfun
->calls_setjmp
= 1;
515 SIBLING_CALL_P (call_insn
) = ((ecf_flags
& ECF_SIBCALL
) != 0);
517 /* Restore this now, so that we do defer pops for this call's args
518 if the context of the call as a whole permits. */
519 inhibit_defer_pop
= old_inhibit_defer_pop
;
521 if (maybe_ne (n_popped
, 0))
524 CALL_INSN_FUNCTION_USAGE (call_insn
)
525 = gen_rtx_EXPR_LIST (VOIDmode
,
526 gen_rtx_CLOBBER (VOIDmode
, stack_pointer_rtx
),
527 CALL_INSN_FUNCTION_USAGE (call_insn
));
528 rounded_stack_size
-= n_popped
;
529 rounded_stack_size_rtx
= gen_int_mode (rounded_stack_size
, Pmode
);
530 stack_pointer_delta
-= n_popped
;
532 add_args_size_note (call_insn
, stack_pointer_delta
);
534 /* If popup is needed, stack realign must use DRAP */
535 if (SUPPORTS_STACK_ALIGNMENT
)
536 crtl
->need_drap
= true;
538 /* For noreturn calls when not accumulating outgoing args force
539 REG_ARGS_SIZE note to prevent crossjumping of calls with different
541 else if (!ACCUMULATE_OUTGOING_ARGS
&& (ecf_flags
& ECF_NORETURN
) != 0)
542 add_args_size_note (call_insn
, stack_pointer_delta
);
544 if (!ACCUMULATE_OUTGOING_ARGS
)
546 /* If returning from the subroutine does not automatically pop the args,
547 we need an instruction to pop them sooner or later.
548 Perhaps do it now; perhaps just record how much space to pop later.
550 If returning from the subroutine does pop the args, indicate that the
551 stack pointer will be changed. */
553 if (maybe_ne (rounded_stack_size
, 0))
555 if (ecf_flags
& ECF_NORETURN
)
556 /* Just pretend we did the pop. */
557 stack_pointer_delta
-= rounded_stack_size
;
558 else if (flag_defer_pop
&& inhibit_defer_pop
== 0
559 && ! (ecf_flags
& (ECF_CONST
| ECF_PURE
)))
560 pending_stack_adjust
+= rounded_stack_size
;
562 adjust_stack (rounded_stack_size_rtx
);
565 /* When we accumulate outgoing args, we must avoid any stack manipulations.
566 Restore the stack pointer to its original value now. Usually
567 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
568 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
569 popping variants of functions exist as well.
571 ??? We may optimize similar to defer_pop above, but it is
572 probably not worthwhile.
574 ??? It will be worthwhile to enable combine_stack_adjustments even for
576 else if (maybe_ne (n_popped
, 0))
577 anti_adjust_stack (gen_int_mode (n_popped
, Pmode
));
580 /* Determine if the function identified by FNDECL is one with
581 special properties we wish to know about. Modify FLAGS accordingly.
583 For example, if the function might return more than one time (setjmp), then
584 set ECF_RETURNS_TWICE.
586 Set ECF_MAY_BE_ALLOCA for any memory allocation function that might allocate
587 space from the stack such as alloca. */
590 special_function_p (const_tree fndecl
, int flags
)
592 tree name_decl
= DECL_NAME (fndecl
);
594 if (fndecl
&& name_decl
595 && IDENTIFIER_LENGTH (name_decl
) <= 11
596 /* Exclude functions not at the file scope, or not `extern',
597 since they are not the magic functions we would otherwise
599 FIXME: this should be handled with attributes, not with this
600 hacky imitation of DECL_ASSEMBLER_NAME. It's (also) wrong
601 because you can declare fork() inside a function if you
603 && (DECL_CONTEXT (fndecl
) == NULL_TREE
604 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
605 && TREE_PUBLIC (fndecl
))
607 const char *name
= IDENTIFIER_POINTER (name_decl
);
608 const char *tname
= name
;
610 /* We assume that alloca will always be called by name. It
611 makes no sense to pass it as a pointer-to-function to
612 anything that does not understand its behavior. */
613 if (IDENTIFIER_LENGTH (name_decl
) == 6
615 && ! strcmp (name
, "alloca"))
616 flags
|= ECF_MAY_BE_ALLOCA
;
618 /* Disregard prefix _ or __. */
627 /* ECF_RETURNS_TWICE is safe even for -ffreestanding. */
628 if (! strcmp (tname
, "setjmp")
629 || ! strcmp (tname
, "sigsetjmp")
630 || ! strcmp (name
, "savectx")
631 || ! strcmp (name
, "vfork")
632 || ! strcmp (name
, "getcontext"))
633 flags
|= ECF_RETURNS_TWICE
;
636 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
637 && ALLOCA_FUNCTION_CODE_P (DECL_FUNCTION_CODE (fndecl
)))
638 flags
|= ECF_MAY_BE_ALLOCA
;
643 /* Similar to special_function_p; return a set of ERF_ flags for the
646 decl_return_flags (tree fndecl
)
649 tree type
= TREE_TYPE (fndecl
);
653 attr
= lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type
));
657 attr
= TREE_VALUE (TREE_VALUE (attr
));
658 if (!attr
|| TREE_STRING_LENGTH (attr
) < 1)
661 switch (TREE_STRING_POINTER (attr
)[0])
667 return ERF_RETURNS_ARG
| (TREE_STRING_POINTER (attr
)[0] - '1');
678 /* Return nonzero when FNDECL represents a call to setjmp. */
681 setjmp_call_p (const_tree fndecl
)
683 if (DECL_IS_RETURNS_TWICE (fndecl
))
684 return ECF_RETURNS_TWICE
;
685 return special_function_p (fndecl
, 0) & ECF_RETURNS_TWICE
;
689 /* Return true if STMT may be an alloca call. */
692 gimple_maybe_alloca_call_p (const gimple
*stmt
)
696 if (!is_gimple_call (stmt
))
699 fndecl
= gimple_call_fndecl (stmt
);
700 if (fndecl
&& (special_function_p (fndecl
, 0) & ECF_MAY_BE_ALLOCA
))
706 /* Return true if STMT is a builtin alloca call. */
709 gimple_alloca_call_p (const gimple
*stmt
)
713 if (!is_gimple_call (stmt
))
716 fndecl
= gimple_call_fndecl (stmt
);
717 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
718 switch (DECL_FUNCTION_CODE (fndecl
))
720 CASE_BUILT_IN_ALLOCA
:
721 return gimple_call_num_args (stmt
) > 0;
729 /* Return true when exp contains a builtin alloca call. */
732 alloca_call_p (const_tree exp
)
735 if (TREE_CODE (exp
) == CALL_EXPR
736 && (fndecl
= get_callee_fndecl (exp
))
737 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
738 switch (DECL_FUNCTION_CODE (fndecl
))
740 CASE_BUILT_IN_ALLOCA
:
749 /* Return TRUE if FNDECL is either a TM builtin or a TM cloned
750 function. Return FALSE otherwise. */
753 is_tm_builtin (const_tree fndecl
)
758 if (decl_is_tm_clone (fndecl
))
761 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
763 switch (DECL_FUNCTION_CODE (fndecl
))
765 case BUILT_IN_TM_COMMIT
:
766 case BUILT_IN_TM_COMMIT_EH
:
767 case BUILT_IN_TM_ABORT
:
768 case BUILT_IN_TM_IRREVOCABLE
:
769 case BUILT_IN_TM_GETTMCLONE_IRR
:
770 case BUILT_IN_TM_MEMCPY
:
771 case BUILT_IN_TM_MEMMOVE
:
772 case BUILT_IN_TM_MEMSET
:
773 CASE_BUILT_IN_TM_STORE (1):
774 CASE_BUILT_IN_TM_STORE (2):
775 CASE_BUILT_IN_TM_STORE (4):
776 CASE_BUILT_IN_TM_STORE (8):
777 CASE_BUILT_IN_TM_STORE (FLOAT
):
778 CASE_BUILT_IN_TM_STORE (DOUBLE
):
779 CASE_BUILT_IN_TM_STORE (LDOUBLE
):
780 CASE_BUILT_IN_TM_STORE (M64
):
781 CASE_BUILT_IN_TM_STORE (M128
):
782 CASE_BUILT_IN_TM_STORE (M256
):
783 CASE_BUILT_IN_TM_LOAD (1):
784 CASE_BUILT_IN_TM_LOAD (2):
785 CASE_BUILT_IN_TM_LOAD (4):
786 CASE_BUILT_IN_TM_LOAD (8):
787 CASE_BUILT_IN_TM_LOAD (FLOAT
):
788 CASE_BUILT_IN_TM_LOAD (DOUBLE
):
789 CASE_BUILT_IN_TM_LOAD (LDOUBLE
):
790 CASE_BUILT_IN_TM_LOAD (M64
):
791 CASE_BUILT_IN_TM_LOAD (M128
):
792 CASE_BUILT_IN_TM_LOAD (M256
):
793 case BUILT_IN_TM_LOG
:
794 case BUILT_IN_TM_LOG_1
:
795 case BUILT_IN_TM_LOG_2
:
796 case BUILT_IN_TM_LOG_4
:
797 case BUILT_IN_TM_LOG_8
:
798 case BUILT_IN_TM_LOG_FLOAT
:
799 case BUILT_IN_TM_LOG_DOUBLE
:
800 case BUILT_IN_TM_LOG_LDOUBLE
:
801 case BUILT_IN_TM_LOG_M64
:
802 case BUILT_IN_TM_LOG_M128
:
803 case BUILT_IN_TM_LOG_M256
:
812 /* Detect flags (function attributes) from the function decl or type node. */
815 flags_from_decl_or_type (const_tree exp
)
821 /* The function exp may have the `malloc' attribute. */
822 if (DECL_IS_MALLOC (exp
))
825 /* The function exp may have the `returns_twice' attribute. */
826 if (DECL_IS_RETURNS_TWICE (exp
))
827 flags
|= ECF_RETURNS_TWICE
;
829 /* Process the pure and const attributes. */
830 if (TREE_READONLY (exp
))
832 if (DECL_PURE_P (exp
))
834 if (DECL_LOOPING_CONST_OR_PURE_P (exp
))
835 flags
|= ECF_LOOPING_CONST_OR_PURE
;
837 if (DECL_IS_NOVOPS (exp
))
839 if (lookup_attribute ("leaf", DECL_ATTRIBUTES (exp
)))
841 if (lookup_attribute ("cold", DECL_ATTRIBUTES (exp
)))
844 if (TREE_NOTHROW (exp
))
845 flags
|= ECF_NOTHROW
;
849 if (is_tm_builtin (exp
))
850 flags
|= ECF_TM_BUILTIN
;
851 else if ((flags
& (ECF_CONST
|ECF_NOVOPS
)) != 0
852 || lookup_attribute ("transaction_pure",
853 TYPE_ATTRIBUTES (TREE_TYPE (exp
))))
854 flags
|= ECF_TM_PURE
;
857 flags
= special_function_p (exp
, flags
);
859 else if (TYPE_P (exp
))
861 if (TYPE_READONLY (exp
))
865 && ((flags
& ECF_CONST
) != 0
866 || lookup_attribute ("transaction_pure", TYPE_ATTRIBUTES (exp
))))
867 flags
|= ECF_TM_PURE
;
872 if (TREE_THIS_VOLATILE (exp
))
874 flags
|= ECF_NORETURN
;
875 if (flags
& (ECF_CONST
|ECF_PURE
))
876 flags
|= ECF_LOOPING_CONST_OR_PURE
;
882 /* Detect flags from a CALL_EXPR. */
885 call_expr_flags (const_tree t
)
888 tree decl
= get_callee_fndecl (t
);
891 flags
= flags_from_decl_or_type (decl
);
892 else if (CALL_EXPR_FN (t
) == NULL_TREE
)
893 flags
= internal_fn_flags (CALL_EXPR_IFN (t
));
896 tree type
= TREE_TYPE (CALL_EXPR_FN (t
));
897 if (type
&& TREE_CODE (type
) == POINTER_TYPE
)
898 flags
= flags_from_decl_or_type (TREE_TYPE (type
));
901 if (CALL_EXPR_BY_DESCRIPTOR (t
))
902 flags
|= ECF_BY_DESCRIPTOR
;
908 /* Return true if TYPE should be passed by invisible reference. */
911 pass_by_reference (CUMULATIVE_ARGS
*ca
, machine_mode mode
,
912 tree type
, bool named_arg
)
916 /* If this type contains non-trivial constructors, then it is
917 forbidden for the middle-end to create any new copies. */
918 if (TREE_ADDRESSABLE (type
))
921 /* GCC post 3.4 passes *all* variable sized types by reference. */
922 if (!TYPE_SIZE (type
) || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
925 /* If a record type should be passed the same as its first (and only)
926 member, use the type and mode of that member. */
927 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
929 type
= TREE_TYPE (first_field (type
));
930 mode
= TYPE_MODE (type
);
934 return targetm
.calls
.pass_by_reference (pack_cumulative_args (ca
), mode
,
938 /* Return true if TYPE, which is passed by reference, should be callee
939 copied instead of caller copied. */
942 reference_callee_copied (CUMULATIVE_ARGS
*ca
, machine_mode mode
,
943 tree type
, bool named_arg
)
945 if (type
&& TREE_ADDRESSABLE (type
))
947 return targetm
.calls
.callee_copies (pack_cumulative_args (ca
), mode
, type
,
952 /* Precompute all register parameters as described by ARGS, storing values
953 into fields within the ARGS array.
955 NUM_ACTUALS indicates the total number elements in the ARGS array.
957 Set REG_PARM_SEEN if we encounter a register parameter. */
960 precompute_register_parameters (int num_actuals
, struct arg_data
*args
,
967 for (i
= 0; i
< num_actuals
; i
++)
968 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
)
972 if (args
[i
].value
== 0)
975 args
[i
].value
= expand_normal (args
[i
].tree_value
);
976 preserve_temp_slots (args
[i
].value
);
980 /* If we are to promote the function arg to a wider mode,
983 if (args
[i
].mode
!= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)))
985 = convert_modes (args
[i
].mode
,
986 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
987 args
[i
].value
, args
[i
].unsignedp
);
989 /* If the value is a non-legitimate constant, force it into a
990 pseudo now. TLS symbols sometimes need a call to resolve. */
991 if (CONSTANT_P (args
[i
].value
)
992 && !targetm
.legitimate_constant_p (args
[i
].mode
, args
[i
].value
))
993 args
[i
].value
= force_reg (args
[i
].mode
, args
[i
].value
);
995 /* If we're going to have to load the value by parts, pull the
996 parts into pseudos. The part extraction process can involve
997 non-trivial computation. */
998 if (GET_CODE (args
[i
].reg
) == PARALLEL
)
1000 tree type
= TREE_TYPE (args
[i
].tree_value
);
1001 args
[i
].parallel_value
1002 = emit_group_load_into_temps (args
[i
].reg
, args
[i
].value
,
1003 type
, int_size_in_bytes (type
));
1006 /* If the value is expensive, and we are inside an appropriately
1007 short loop, put the value into a pseudo and then put the pseudo
1010 For small register classes, also do this if this call uses
1011 register parameters. This is to avoid reload conflicts while
1012 loading the parameters registers. */
1014 else if ((! (REG_P (args
[i
].value
)
1015 || (GET_CODE (args
[i
].value
) == SUBREG
1016 && REG_P (SUBREG_REG (args
[i
].value
)))))
1017 && args
[i
].mode
!= BLKmode
1018 && (set_src_cost (args
[i
].value
, args
[i
].mode
,
1019 optimize_insn_for_speed_p ())
1020 > COSTS_N_INSNS (1))
1022 && targetm
.small_register_classes_for_mode_p (args
[i
].mode
))
1024 args
[i
].value
= copy_to_mode_reg (args
[i
].mode
, args
[i
].value
);
1028 #ifdef REG_PARM_STACK_SPACE
1030 /* The argument list is the property of the called routine and it
1031 may clobber it. If the fixed area has been used for previous
1032 parameters, we must save and restore it. */
1035 save_fixed_argument_area (int reg_parm_stack_space
, rtx argblock
, int *low_to_save
, int *high_to_save
)
1040 /* Compute the boundary of the area that needs to be saved, if any. */
1041 high
= reg_parm_stack_space
;
1042 if (ARGS_GROW_DOWNWARD
)
1045 if (high
> highest_outgoing_arg_in_use
)
1046 high
= highest_outgoing_arg_in_use
;
1048 for (low
= 0; low
< high
; low
++)
1049 if (stack_usage_map
[low
] != 0 || low
>= stack_usage_watermark
)
1052 machine_mode save_mode
;
1058 while (stack_usage_map
[--high
] == 0)
1062 *high_to_save
= high
;
1064 num_to_save
= high
- low
+ 1;
1066 /* If we don't have the required alignment, must do this
1068 scalar_int_mode imode
;
1069 if (int_mode_for_size (num_to_save
* BITS_PER_UNIT
, 1).exists (&imode
)
1070 && (low
& (MIN (GET_MODE_SIZE (imode
),
1071 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)) == 0)
1074 save_mode
= BLKmode
;
1076 if (ARGS_GROW_DOWNWARD
)
1081 addr
= plus_constant (Pmode
, argblock
, delta
);
1082 stack_area
= gen_rtx_MEM (save_mode
, memory_address (save_mode
, addr
));
1084 set_mem_align (stack_area
, PARM_BOUNDARY
);
1085 if (save_mode
== BLKmode
)
1087 save_area
= assign_stack_temp (BLKmode
, num_to_save
);
1088 emit_block_move (validize_mem (save_area
), stack_area
,
1089 GEN_INT (num_to_save
), BLOCK_OP_CALL_PARM
);
1093 save_area
= gen_reg_rtx (save_mode
);
1094 emit_move_insn (save_area
, stack_area
);
1104 restore_fixed_argument_area (rtx save_area
, rtx argblock
, int high_to_save
, int low_to_save
)
1106 machine_mode save_mode
= GET_MODE (save_area
);
1108 rtx addr
, stack_area
;
1110 if (ARGS_GROW_DOWNWARD
)
1111 delta
= -high_to_save
;
1113 delta
= low_to_save
;
1115 addr
= plus_constant (Pmode
, argblock
, delta
);
1116 stack_area
= gen_rtx_MEM (save_mode
, memory_address (save_mode
, addr
));
1117 set_mem_align (stack_area
, PARM_BOUNDARY
);
1119 if (save_mode
!= BLKmode
)
1120 emit_move_insn (stack_area
, save_area
);
1122 emit_block_move (stack_area
, validize_mem (save_area
),
1123 GEN_INT (high_to_save
- low_to_save
+ 1),
1124 BLOCK_OP_CALL_PARM
);
1126 #endif /* REG_PARM_STACK_SPACE */
1128 /* If any elements in ARGS refer to parameters that are to be passed in
1129 registers, but not in memory, and whose alignment does not permit a
1130 direct copy into registers. Copy the values into a group of pseudos
1131 which we will later copy into the appropriate hard registers.
1133 Pseudos for each unaligned argument will be stored into the array
1134 args[argnum].aligned_regs. The caller is responsible for deallocating
1135 the aligned_regs array if it is nonzero. */
1138 store_unaligned_arguments_into_pseudos (struct arg_data
*args
, int num_actuals
)
1142 for (i
= 0; i
< num_actuals
; i
++)
1143 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
1144 && GET_CODE (args
[i
].reg
) != PARALLEL
1145 && args
[i
].mode
== BLKmode
1146 && MEM_P (args
[i
].value
)
1147 && (MEM_ALIGN (args
[i
].value
)
1148 < (unsigned int) MIN (BIGGEST_ALIGNMENT
, BITS_PER_WORD
)))
1150 int bytes
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1151 int endian_correction
= 0;
1153 if (args
[i
].partial
)
1155 gcc_assert (args
[i
].partial
% UNITS_PER_WORD
== 0);
1156 args
[i
].n_aligned_regs
= args
[i
].partial
/ UNITS_PER_WORD
;
1160 args
[i
].n_aligned_regs
1161 = (bytes
+ UNITS_PER_WORD
- 1) / UNITS_PER_WORD
;
1164 args
[i
].aligned_regs
= XNEWVEC (rtx
, args
[i
].n_aligned_regs
);
1166 /* Structures smaller than a word are normally aligned to the
1167 least significant byte. On a BYTES_BIG_ENDIAN machine,
1168 this means we must skip the empty high order bytes when
1169 calculating the bit offset. */
1170 if (bytes
< UNITS_PER_WORD
1171 #ifdef BLOCK_REG_PADDING
1172 && (BLOCK_REG_PADDING (args
[i
].mode
,
1173 TREE_TYPE (args
[i
].tree_value
), 1)
1179 endian_correction
= BITS_PER_WORD
- bytes
* BITS_PER_UNIT
;
1181 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1183 rtx reg
= gen_reg_rtx (word_mode
);
1184 rtx word
= operand_subword_force (args
[i
].value
, j
, BLKmode
);
1185 int bitsize
= MIN (bytes
* BITS_PER_UNIT
, BITS_PER_WORD
);
1187 args
[i
].aligned_regs
[j
] = reg
;
1188 word
= extract_bit_field (word
, bitsize
, 0, 1, NULL_RTX
,
1189 word_mode
, word_mode
, false, NULL
);
1191 /* There is no need to restrict this code to loading items
1192 in TYPE_ALIGN sized hunks. The bitfield instructions can
1193 load up entire word sized registers efficiently.
1195 ??? This may not be needed anymore.
1196 We use to emit a clobber here but that doesn't let later
1197 passes optimize the instructions we emit. By storing 0 into
1198 the register later passes know the first AND to zero out the
1199 bitfield being set in the register is unnecessary. The store
1200 of 0 will be deleted as will at least the first AND. */
1202 emit_move_insn (reg
, const0_rtx
);
1204 bytes
-= bitsize
/ BITS_PER_UNIT
;
1205 store_bit_field (reg
, bitsize
, endian_correction
, 0, 0,
1206 word_mode
, word
, false);
1211 /* The limit set by -Walloc-larger-than=. */
1212 static GTY(()) tree alloc_object_size_limit
;
1214 /* Initialize ALLOC_OBJECT_SIZE_LIMIT based on the -Walloc-size-larger-than=
1215 setting if the option is specified, or to the maximum object size if it
1216 is not. Return the initialized value. */
1219 alloc_max_size (void)
1221 if (alloc_object_size_limit
)
1222 return alloc_object_size_limit
;
1224 alloc_object_size_limit
= max_object_size ();
1226 if (!warn_alloc_size_limit
)
1227 return alloc_object_size_limit
;
1229 const char *optname
= "-Walloc-size-larger-than=";
1233 unsigned HOST_WIDE_INT unit
= 1;
1234 unsigned HOST_WIDE_INT limit
1235 = strtoull (warn_alloc_size_limit
, &end
, 10);
1237 /* If the value is too large to be represented use the maximum
1238 representable value that strtoull sets limit to (setting
1239 errno to ERANGE). */
1243 /* Numeric option arguments are at most INT_MAX. Make it
1244 possible to specify a larger value by accepting common
1246 if (!strcmp (end
, "kB"))
1248 else if (!strcasecmp (end
, "KiB") || !strcmp (end
, "KB"))
1250 else if (!strcmp (end
, "MB"))
1251 unit
= HOST_WIDE_INT_UC (1000) * 1000;
1252 else if (!strcasecmp (end
, "MiB"))
1253 unit
= HOST_WIDE_INT_UC (1024) * 1024;
1254 else if (!strcasecmp (end
, "GB"))
1255 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000;
1256 else if (!strcasecmp (end
, "GiB"))
1257 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024;
1258 else if (!strcasecmp (end
, "TB"))
1259 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000 * 1000;
1260 else if (!strcasecmp (end
, "TiB"))
1261 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024 * 1024;
1262 else if (!strcasecmp (end
, "PB"))
1263 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000 * 1000 * 1000;
1264 else if (!strcasecmp (end
, "PiB"))
1265 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024 * 1024 * 1024;
1266 else if (!strcasecmp (end
, "EB"))
1267 unit
= HOST_WIDE_INT_UC (1000) * 1000 * 1000 * 1000 * 1000
1269 else if (!strcasecmp (end
, "EiB"))
1270 unit
= HOST_WIDE_INT_UC (1024) * 1024 * 1024 * 1024 * 1024
1274 /* This could mean an unknown suffix or a bad prefix, like
1276 warning_at (UNKNOWN_LOCATION
, 0,
1277 "invalid argument %qs to %qs",
1278 warn_alloc_size_limit
, optname
);
1280 /* Ignore the limit extracted by strtoull. */
1287 widest_int w
= wi::mul (limit
, unit
);
1288 if (w
< wi::to_widest (alloc_object_size_limit
))
1289 alloc_object_size_limit
1290 = wide_int_to_tree (ptrdiff_type_node
, w
);
1292 alloc_object_size_limit
= build_all_ones_cst (size_type_node
);
1296 return alloc_object_size_limit
;
1299 /* Return true when EXP's range can be determined and set RANGE[] to it
1300 after adjusting it if necessary to make EXP a represents a valid size
1301 of object, or a valid size argument to an allocation function declared
1302 with attribute alloc_size (whose argument may be signed), or to a string
1303 manipulation function like memset. When ALLOW_ZERO is true, allow
1304 returning a range of [0, 0] for a size in an anti-range [1, N] where
1305 N > PTRDIFF_MAX. A zero range is a (nearly) invalid argument to
1306 allocation functions like malloc but it is a valid argument to
1307 functions like memset. */
1310 get_size_range (tree exp
, tree range
[2], bool allow_zero
/* = false */)
1312 if (tree_fits_uhwi_p (exp
))
1314 /* EXP is a constant. */
1315 range
[0] = range
[1] = exp
;
1319 tree exptype
= TREE_TYPE (exp
);
1320 bool integral
= INTEGRAL_TYPE_P (exptype
);
1323 enum value_range_type range_type
;
1326 range_type
= determine_value_range (exp
, &min
, &max
);
1328 range_type
= VR_VARYING
;
1330 if (range_type
== VR_VARYING
)
1334 /* Use the full range of the type of the expression when
1335 no value range information is available. */
1336 range
[0] = TYPE_MIN_VALUE (exptype
);
1337 range
[1] = TYPE_MAX_VALUE (exptype
);
1341 range
[0] = NULL_TREE
;
1342 range
[1] = NULL_TREE
;
1346 unsigned expprec
= TYPE_PRECISION (exptype
);
1348 bool signed_p
= !TYPE_UNSIGNED (exptype
);
1350 if (range_type
== VR_ANTI_RANGE
)
1354 if (wi::les_p (max
, 0))
1356 /* EXP is not in a strictly negative range. That means
1357 it must be in some (not necessarily strictly) positive
1358 range which includes zero. Since in signed to unsigned
1359 conversions negative values end up converted to large
1360 positive values, and otherwise they are not valid sizes,
1361 the resulting range is in both cases [0, TYPE_MAX]. */
1362 min
= wi::zero (expprec
);
1363 max
= wi::to_wide (TYPE_MAX_VALUE (exptype
));
1365 else if (wi::les_p (min
- 1, 0))
1367 /* EXP is not in a negative-positive range. That means EXP
1368 is either negative, or greater than max. Since negative
1369 sizes are invalid make the range [MAX + 1, TYPE_MAX]. */
1371 max
= wi::to_wide (TYPE_MAX_VALUE (exptype
));
1376 min
= wi::zero (expprec
);
1379 else if (wi::eq_p (0, min
- 1))
1381 /* EXP is unsigned and not in the range [1, MAX]. That means
1382 it's either zero or greater than MAX. Even though 0 would
1383 normally be detected by -Walloc-zero, unless ALLOW_ZERO
1384 is true, set the range to [MAX, TYPE_MAX] so that when MAX
1385 is greater than the limit the whole range is diagnosed. */
1387 min
= max
= wi::zero (expprec
);
1391 max
= wi::to_wide (TYPE_MAX_VALUE (exptype
));
1397 min
= wi::zero (expprec
);
1401 range
[0] = wide_int_to_tree (exptype
, min
);
1402 range
[1] = wide_int_to_tree (exptype
, max
);
1407 /* Diagnose a call EXP to function FN decorated with attribute alloc_size
1408 whose argument numbers given by IDX with values given by ARGS exceed
1409 the maximum object size or cause an unsigned oveflow (wrapping) when
1410 multiplied. When ARGS[0] is null the function does nothing. ARGS[1]
1411 may be null for functions like malloc, and non-null for those like
1412 calloc that are decorated with a two-argument attribute alloc_size. */
1415 maybe_warn_alloc_args_overflow (tree fn
, tree exp
, tree args
[2], int idx
[2])
1417 /* The range each of the (up to) two arguments is known to be in. */
1418 tree argrange
[2][2] = { { NULL_TREE
, NULL_TREE
}, { NULL_TREE
, NULL_TREE
} };
1420 /* Maximum object size set by -Walloc-size-larger-than= or SIZE_MAX / 2. */
1421 tree maxobjsize
= alloc_max_size ();
1423 location_t loc
= EXPR_LOCATION (exp
);
1425 bool warned
= false;
1427 /* Validate each argument individually. */
1428 for (unsigned i
= 0; i
!= 2 && args
[i
]; ++i
)
1430 if (TREE_CODE (args
[i
]) == INTEGER_CST
)
1432 argrange
[i
][0] = args
[i
];
1433 argrange
[i
][1] = args
[i
];
1435 if (tree_int_cst_lt (args
[i
], integer_zero_node
))
1437 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1438 "%Kargument %i value %qE is negative",
1439 exp
, idx
[i
] + 1, args
[i
]);
1441 else if (integer_zerop (args
[i
]))
1443 /* Avoid issuing -Walloc-zero for allocation functions other
1444 than __builtin_alloca that are declared with attribute
1445 returns_nonnull because there's no portability risk. This
1446 avoids warning for such calls to libiberty's xmalloc and
1448 Also avoid issuing the warning for calls to function named
1450 if ((DECL_FUNCTION_CODE (fn
) == BUILT_IN_ALLOCA
1451 && IDENTIFIER_LENGTH (DECL_NAME (fn
)) != 6)
1452 || (DECL_FUNCTION_CODE (fn
) != BUILT_IN_ALLOCA
1453 && !lookup_attribute ("returns_nonnull",
1454 TYPE_ATTRIBUTES (TREE_TYPE (fn
)))))
1455 warned
= warning_at (loc
, OPT_Walloc_zero
,
1456 "%Kargument %i value is zero",
1459 else if (tree_int_cst_lt (maxobjsize
, args
[i
]))
1461 /* G++ emits calls to ::operator new[](SIZE_MAX) in C++98
1462 mode and with -fno-exceptions as a way to indicate array
1463 size overflow. There's no good way to detect C++98 here
1464 so avoid diagnosing these calls for all C++ modes. */
1468 && DECL_IS_OPERATOR_NEW (fn
)
1469 && integer_all_onesp (args
[i
]))
1472 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1473 "%Kargument %i value %qE exceeds "
1474 "maximum object size %E",
1475 exp
, idx
[i
] + 1, args
[i
], maxobjsize
);
1478 else if (TREE_CODE (args
[i
]) == SSA_NAME
1479 && get_size_range (args
[i
], argrange
[i
]))
1481 /* Verify that the argument's range is not negative (including
1482 upper bound of zero). */
1483 if (tree_int_cst_lt (argrange
[i
][0], integer_zero_node
)
1484 && tree_int_cst_le (argrange
[i
][1], integer_zero_node
))
1486 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1487 "%Kargument %i range [%E, %E] is negative",
1489 argrange
[i
][0], argrange
[i
][1]);
1491 else if (tree_int_cst_lt (maxobjsize
, argrange
[i
][0]))
1493 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1494 "%Kargument %i range [%E, %E] exceeds "
1495 "maximum object size %E",
1497 argrange
[i
][0], argrange
[i
][1],
1506 /* For a two-argument alloc_size, validate the product of the two
1507 arguments if both of their values or ranges are known. */
1508 if (!warned
&& tree_fits_uhwi_p (argrange
[0][0])
1509 && argrange
[1][0] && tree_fits_uhwi_p (argrange
[1][0])
1510 && !integer_onep (argrange
[0][0])
1511 && !integer_onep (argrange
[1][0]))
1513 /* Check for overflow in the product of a function decorated with
1514 attribute alloc_size (X, Y). */
1515 unsigned szprec
= TYPE_PRECISION (size_type_node
);
1516 wide_int x
= wi::to_wide (argrange
[0][0], szprec
);
1517 wide_int y
= wi::to_wide (argrange
[1][0], szprec
);
1520 wide_int prod
= wi::umul (x
, y
, &vflow
);
1523 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1524 "%Kproduct %<%E * %E%> of arguments %i and %i "
1525 "exceeds %<SIZE_MAX%>",
1526 exp
, argrange
[0][0], argrange
[1][0],
1527 idx
[0] + 1, idx
[1] + 1);
1528 else if (wi::ltu_p (wi::to_wide (maxobjsize
, szprec
), prod
))
1529 warned
= warning_at (loc
, OPT_Walloc_size_larger_than_
,
1530 "%Kproduct %<%E * %E%> of arguments %i and %i "
1531 "exceeds maximum object size %E",
1532 exp
, argrange
[0][0], argrange
[1][0],
1533 idx
[0] + 1, idx
[1] + 1,
1538 /* Print the full range of each of the two arguments to make
1539 it clear when it is, in fact, in a range and not constant. */
1540 if (argrange
[0][0] != argrange
[0][1])
1541 inform (loc
, "argument %i in the range [%E, %E]",
1542 idx
[0] + 1, argrange
[0][0], argrange
[0][1]);
1543 if (argrange
[1][0] != argrange
[1][1])
1544 inform (loc
, "argument %i in the range [%E, %E]",
1545 idx
[1] + 1, argrange
[1][0], argrange
[1][1]);
1551 location_t fnloc
= DECL_SOURCE_LOCATION (fn
);
1553 if (DECL_IS_BUILTIN (fn
))
1555 "in a call to built-in allocation function %qD", fn
);
1558 "in a call to allocation function %qD declared here", fn
);
1562 /* If EXPR refers to a character array or pointer declared attribute
1563 nonstring return a decl for that array or pointer and set *REF to
1564 the referenced enclosing object or pointer. Otherwise returns
1568 get_attr_nonstring_decl (tree expr
, tree
*ref
)
1571 if (TREE_CODE (decl
) == SSA_NAME
)
1573 gimple
*def
= SSA_NAME_DEF_STMT (decl
);
1575 if (is_gimple_assign (def
))
1577 tree_code code
= gimple_assign_rhs_code (def
);
1578 if (code
== ADDR_EXPR
1579 || code
== COMPONENT_REF
1580 || code
== VAR_DECL
)
1581 decl
= gimple_assign_rhs1 (def
);
1583 else if (tree var
= SSA_NAME_VAR (decl
))
1587 if (TREE_CODE (decl
) == ADDR_EXPR
)
1588 decl
= TREE_OPERAND (decl
, 0);
1593 if (TREE_CODE (decl
) == ARRAY_REF
)
1594 decl
= TREE_OPERAND (decl
, 0);
1595 else if (TREE_CODE (decl
) == COMPONENT_REF
)
1596 decl
= TREE_OPERAND (decl
, 1);
1597 else if (TREE_CODE (decl
) == MEM_REF
)
1598 return get_attr_nonstring_decl (TREE_OPERAND (decl
, 0), ref
);
1601 && lookup_attribute ("nonstring", DECL_ATTRIBUTES (decl
)))
1607 /* Warn about passing a non-string array/pointer to a function that
1608 expects a nul-terminated string argument. */
1611 maybe_warn_nonstring_arg (tree fndecl
, tree exp
)
1613 if (!fndecl
|| DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
1616 unsigned nargs
= call_expr_nargs (exp
);
1618 /* The bound argument to a bounded string function like strncpy. */
1619 tree bound
= NULL_TREE
;
1621 /* The range of lengths of a string argument to one of the comparison
1622 functions. If the length is less than the bound it is used instead. */
1623 tree lenrng
[2] = { NULL_TREE
, NULL_TREE
};
1625 /* It's safe to call "bounded" string functions with a non-string
1626 argument since the functions provide an explicit bound for this
1628 switch (DECL_FUNCTION_CODE (fndecl
))
1630 case BUILT_IN_STRCMP
:
1631 case BUILT_IN_STRNCMP
:
1632 case BUILT_IN_STRNCASECMP
:
1634 /* For these, if one argument refers to one or more of a set
1635 of string constants or arrays of known size, determine
1636 the range of their known or possible lengths and use it
1637 conservatively as the bound for the unbounded function,
1638 and to adjust the range of the bound of the bounded ones. */
1639 for (unsigned argno
= 0; argno
< nargs
&& !*lenrng
; argno
++)
1641 tree arg
= CALL_EXPR_ARG (exp
, argno
);
1642 if (!get_attr_nonstring_decl (arg
))
1643 get_range_strlen (arg
, lenrng
);
1648 case BUILT_IN_STPNCPY
:
1649 case BUILT_IN_STRNCPY
:
1653 bound
= CALL_EXPR_ARG (exp
, argno
);
1657 case BUILT_IN_STRNDUP
:
1661 bound
= CALL_EXPR_ARG (exp
, argno
);
1669 /* Determine the range of the bound argument (if specified). */
1670 tree bndrng
[2] = { NULL_TREE
, NULL_TREE
};
1674 get_size_range (bound
, bndrng
);
1679 /* Add one for the nul. */
1680 lenrng
[0] = const_binop (PLUS_EXPR
, TREE_TYPE (lenrng
[0]),
1681 lenrng
[0], size_one_node
);
1682 lenrng
[1] = const_binop (PLUS_EXPR
, TREE_TYPE (lenrng
[1]),
1683 lenrng
[1], size_one_node
);
1687 /* Conservatively use the upper bound of the lengths for
1688 both the lower and the upper bound of the operation. */
1689 bndrng
[0] = lenrng
[1];
1690 bndrng
[1] = lenrng
[1];
1691 bound
= void_type_node
;
1695 /* Replace the bound on the operation with the upper bound
1696 of the length of the string if the latter is smaller. */
1697 if (tree_int_cst_lt (lenrng
[1], bndrng
[0]))
1698 bndrng
[0] = lenrng
[1];
1699 else if (tree_int_cst_lt (lenrng
[1], bndrng
[1]))
1700 bndrng
[1] = lenrng
[1];
1704 /* Iterate over the built-in function's formal arguments and check
1705 each const char* against the actual argument. If the actual
1706 argument is declared attribute non-string issue a warning unless
1707 the argument's maximum length is bounded. */
1708 function_args_iterator it
;
1709 function_args_iter_init (&it
, TREE_TYPE (fndecl
));
1711 for (unsigned argno
= 0; ; ++argno
, function_args_iter_next (&it
))
1713 /* Avoid iterating past the declared argument in a call
1714 to function declared without a prototype. */
1718 tree argtype
= function_args_iter_cond (&it
);
1722 if (TREE_CODE (argtype
) != POINTER_TYPE
)
1725 argtype
= TREE_TYPE (argtype
);
1727 if (TREE_CODE (argtype
) != INTEGER_TYPE
1728 || !TYPE_READONLY (argtype
))
1731 argtype
= TYPE_MAIN_VARIANT (argtype
);
1732 if (argtype
!= char_type_node
)
1735 tree callarg
= CALL_EXPR_ARG (exp
, argno
);
1736 if (TREE_CODE (callarg
) == ADDR_EXPR
)
1737 callarg
= TREE_OPERAND (callarg
, 0);
1739 /* See if the destination is declared with attribute "nonstring". */
1740 tree decl
= get_attr_nonstring_decl (callarg
);
1744 tree type
= TREE_TYPE (decl
);
1746 /* The maximum number of array elements accessed. */
1747 offset_int wibnd
= 0;
1749 wibnd
= wi::to_offset (bndrng
[0]);
1751 /* Size of the array. */
1752 offset_int asize
= wibnd
;
1754 /* Determine the array size. For arrays of unknown bound and
1755 pointers reset BOUND to trigger the appropriate warning. */
1756 if (TREE_CODE (type
) == ARRAY_TYPE
)
1758 if (tree arrbnd
= TYPE_DOMAIN (type
))
1760 if ((arrbnd
= TYPE_MAX_VALUE (arrbnd
)))
1761 asize
= wi::to_offset (arrbnd
) + 1;
1763 else if (bound
== void_type_node
)
1766 else if (bound
== void_type_node
)
1769 location_t loc
= EXPR_LOCATION (exp
);
1771 bool warned
= false;
1773 if (wi::ltu_p (asize
, wibnd
))
1774 warned
= warning_at (loc
, OPT_Wstringop_overflow_
,
1775 "%qD argument %i declared attribute %<nonstring%> "
1776 "is smaller than the specified bound %E",
1777 fndecl
, argno
+ 1, bndrng
[0]);
1779 warned
= warning_at (loc
, OPT_Wstringop_overflow_
,
1780 "%qD argument %i declared attribute %<nonstring%>",
1784 inform (DECL_SOURCE_LOCATION (decl
),
1785 "argument %qD declared here", decl
);
1789 /* Issue an error if CALL_EXPR was flagged as requiring
1790 tall-call optimization. */
1793 maybe_complain_about_tail_call (tree call_expr
, const char *reason
)
1795 gcc_assert (TREE_CODE (call_expr
) == CALL_EXPR
);
1796 if (!CALL_EXPR_MUST_TAIL_CALL (call_expr
))
1799 error_at (EXPR_LOCATION (call_expr
), "cannot tail-call: %s", reason
);
1802 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1805 NUM_ACTUALS is the total number of parameters.
1807 N_NAMED_ARGS is the total number of named arguments.
1809 STRUCT_VALUE_ADDR_VALUE is the implicit argument for a struct return
1812 FNDECL is the tree code for the target of this call (if known)
1814 ARGS_SO_FAR holds state needed by the target to know where to place
1817 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1818 for arguments which are passed in registers.
1820 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1821 and may be modified by this routine.
1823 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1824 flags which may be modified by this routine.
1826 MAY_TAILCALL is cleared if we encounter an invisible pass-by-reference
1827 that requires allocation of stack space.
1829 CALL_FROM_THUNK_P is true if this call is the jump from a thunk to
1830 the thunked-to function. */
1833 initialize_argument_information (int num_actuals ATTRIBUTE_UNUSED
,
1834 struct arg_data
*args
,
1835 struct args_size
*args_size
,
1836 int n_named_args ATTRIBUTE_UNUSED
,
1837 tree exp
, tree struct_value_addr_value
,
1838 tree fndecl
, tree fntype
,
1839 cumulative_args_t args_so_far
,
1840 int reg_parm_stack_space
,
1841 rtx
*old_stack_level
,
1842 poly_int64_pod
*old_pending_adj
,
1843 int *must_preallocate
, int *ecf_flags
,
1844 bool *may_tailcall
, bool call_from_thunk_p
)
1846 CUMULATIVE_ARGS
*args_so_far_pnt
= get_cumulative_args (args_so_far
);
1847 location_t loc
= EXPR_LOCATION (exp
);
1849 /* Count arg position in order args appear. */
1854 args_size
->constant
= 0;
1857 bitmap_obstack_initialize (NULL
);
1859 /* In this loop, we consider args in the order they are written.
1860 We fill up ARGS from the back. */
1862 i
= num_actuals
- 1;
1865 call_expr_arg_iterator iter
;
1867 bitmap slots
= NULL
;
1869 if (struct_value_addr_value
)
1871 args
[j
].tree_value
= struct_value_addr_value
;
1875 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
1877 tree argtype
= TREE_TYPE (arg
);
1879 if (targetm
.calls
.split_complex_arg
1881 && TREE_CODE (argtype
) == COMPLEX_TYPE
1882 && targetm
.calls
.split_complex_arg (argtype
))
1884 tree subtype
= TREE_TYPE (argtype
);
1885 args
[j
].tree_value
= build1 (REALPART_EXPR
, subtype
, arg
);
1887 args
[j
].tree_value
= build1 (IMAGPART_EXPR
, subtype
, arg
);
1890 args
[j
].tree_value
= arg
;
1896 BITMAP_FREE (slots
);
1899 bitmap_obstack_release (NULL
);
1901 /* Extract attribute alloc_size and if set, store the indices of
1902 the corresponding arguments in ALLOC_IDX, and then the actual
1903 argument(s) at those indices in ALLOC_ARGS. */
1904 int alloc_idx
[2] = { -1, -1 };
1906 = (fndecl
? lookup_attribute ("alloc_size",
1907 TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)))
1910 tree args
= TREE_VALUE (alloc_size
);
1911 alloc_idx
[0] = TREE_INT_CST_LOW (TREE_VALUE (args
)) - 1;
1912 if (TREE_CHAIN (args
))
1913 alloc_idx
[1] = TREE_INT_CST_LOW (TREE_VALUE (TREE_CHAIN (args
))) - 1;
1916 /* Array for up to the two attribute alloc_size arguments. */
1917 tree alloc_args
[] = { NULL_TREE
, NULL_TREE
};
1919 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1920 for (argpos
= 0; argpos
< num_actuals
; i
--, argpos
++)
1922 tree type
= TREE_TYPE (args
[i
].tree_value
);
1926 /* Replace erroneous argument with constant zero. */
1927 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
1928 args
[i
].tree_value
= integer_zero_node
, type
= integer_type_node
;
1930 /* If TYPE is a transparent union or record, pass things the way
1931 we would pass the first field of the union or record. We have
1932 already verified that the modes are the same. */
1933 if ((TREE_CODE (type
) == UNION_TYPE
|| TREE_CODE (type
) == RECORD_TYPE
)
1934 && TYPE_TRANSPARENT_AGGR (type
))
1935 type
= TREE_TYPE (first_field (type
));
1937 /* Decide where to pass this arg.
1939 args[i].reg is nonzero if all or part is passed in registers.
1941 args[i].partial is nonzero if part but not all is passed in registers,
1942 and the exact value says how many bytes are passed in registers.
1944 args[i].pass_on_stack is nonzero if the argument must at least be
1945 computed on the stack. It may then be loaded back into registers
1946 if args[i].reg is nonzero.
1948 These decisions are driven by the FUNCTION_... macros and must agree
1949 with those made by function.c. */
1951 /* See if this argument should be passed by invisible reference. */
1952 if (pass_by_reference (args_so_far_pnt
, TYPE_MODE (type
),
1953 type
, argpos
< n_named_args
))
1956 tree base
= NULL_TREE
;
1959 = reference_callee_copied (args_so_far_pnt
, TYPE_MODE (type
),
1960 type
, argpos
< n_named_args
);
1962 /* If we're compiling a thunk, pass through invisible references
1963 instead of making a copy. */
1964 if (call_from_thunk_p
1966 && !TREE_ADDRESSABLE (type
)
1967 && (base
= get_base_address (args
[i
].tree_value
))
1968 && TREE_CODE (base
) != SSA_NAME
1969 && (!DECL_P (base
) || MEM_P (DECL_RTL (base
)))))
1971 /* We may have turned the parameter value into an SSA name.
1972 Go back to the original parameter so we can take the
1974 if (TREE_CODE (args
[i
].tree_value
) == SSA_NAME
)
1976 gcc_assert (SSA_NAME_IS_DEFAULT_DEF (args
[i
].tree_value
));
1977 args
[i
].tree_value
= SSA_NAME_VAR (args
[i
].tree_value
);
1978 gcc_assert (TREE_CODE (args
[i
].tree_value
) == PARM_DECL
);
1980 /* Argument setup code may have copied the value to register. We
1981 revert that optimization now because the tail call code must
1982 use the original location. */
1983 if (TREE_CODE (args
[i
].tree_value
) == PARM_DECL
1984 && !MEM_P (DECL_RTL (args
[i
].tree_value
))
1985 && DECL_INCOMING_RTL (args
[i
].tree_value
)
1986 && MEM_P (DECL_INCOMING_RTL (args
[i
].tree_value
)))
1987 set_decl_rtl (args
[i
].tree_value
,
1988 DECL_INCOMING_RTL (args
[i
].tree_value
));
1990 mark_addressable (args
[i
].tree_value
);
1992 /* We can't use sibcalls if a callee-copied argument is
1993 stored in the current function's frame. */
1994 if (!call_from_thunk_p
&& DECL_P (base
) && !TREE_STATIC (base
))
1996 *may_tailcall
= false;
1997 maybe_complain_about_tail_call (exp
,
1998 "a callee-copied argument is"
1999 " stored in the current"
2000 " function's frame");
2003 args
[i
].tree_value
= build_fold_addr_expr_loc (loc
,
2004 args
[i
].tree_value
);
2005 type
= TREE_TYPE (args
[i
].tree_value
);
2007 if (*ecf_flags
& ECF_CONST
)
2008 *ecf_flags
&= ~(ECF_CONST
| ECF_LOOPING_CONST_OR_PURE
);
2012 /* We make a copy of the object and pass the address to the
2013 function being called. */
2016 if (!COMPLETE_TYPE_P (type
)
2017 || TREE_CODE (TYPE_SIZE_UNIT (type
)) != INTEGER_CST
2018 || (flag_stack_check
== GENERIC_STACK_CHECK
2019 && compare_tree_int (TYPE_SIZE_UNIT (type
),
2020 STACK_CHECK_MAX_VAR_SIZE
) > 0))
2022 /* This is a variable-sized object. Make space on the stack
2024 rtx size_rtx
= expr_size (args
[i
].tree_value
);
2026 if (*old_stack_level
== 0)
2028 emit_stack_save (SAVE_BLOCK
, old_stack_level
);
2029 *old_pending_adj
= pending_stack_adjust
;
2030 pending_stack_adjust
= 0;
2033 /* We can pass TRUE as the 4th argument because we just
2034 saved the stack pointer and will restore it right after
2036 copy
= allocate_dynamic_stack_space (size_rtx
,
2039 max_int_size_in_bytes
2042 copy
= gen_rtx_MEM (BLKmode
, copy
);
2043 set_mem_attributes (copy
, type
, 1);
2046 copy
= assign_temp (type
, 1, 0);
2048 store_expr (args
[i
].tree_value
, copy
, 0, false, false);
2050 /* Just change the const function to pure and then let
2051 the next test clear the pure based on
2053 if (*ecf_flags
& ECF_CONST
)
2055 *ecf_flags
&= ~ECF_CONST
;
2056 *ecf_flags
|= ECF_PURE
;
2059 if (!callee_copies
&& *ecf_flags
& ECF_PURE
)
2060 *ecf_flags
&= ~(ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
2063 = build_fold_addr_expr_loc (loc
, make_tree (type
, copy
));
2064 type
= TREE_TYPE (args
[i
].tree_value
);
2065 *may_tailcall
= false;
2066 maybe_complain_about_tail_call (exp
,
2067 "argument must be passed"
2072 unsignedp
= TYPE_UNSIGNED (type
);
2073 mode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
2074 fndecl
? TREE_TYPE (fndecl
) : fntype
, 0);
2076 args
[i
].unsignedp
= unsignedp
;
2077 args
[i
].mode
= mode
;
2079 targetm
.calls
.warn_parameter_passing_abi (args_so_far
, type
);
2081 args
[i
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
, type
,
2082 argpos
< n_named_args
);
2084 if (args
[i
].reg
&& CONST_INT_P (args
[i
].reg
))
2086 args
[i
].special_slot
= args
[i
].reg
;
2090 /* If this is a sibling call and the machine has register windows, the
2091 register window has to be unwinded before calling the routine, so
2092 arguments have to go into the incoming registers. */
2093 if (targetm
.calls
.function_incoming_arg
!= targetm
.calls
.function_arg
)
2094 args
[i
].tail_call_reg
2095 = targetm
.calls
.function_incoming_arg (args_so_far
, mode
, type
,
2096 argpos
< n_named_args
);
2098 args
[i
].tail_call_reg
= args
[i
].reg
;
2102 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, type
,
2103 argpos
< n_named_args
);
2105 args
[i
].pass_on_stack
= targetm
.calls
.must_pass_in_stack (mode
, type
);
2107 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
2108 it means that we are to pass this arg in the register(s) designated
2109 by the PARALLEL, but also to pass it in the stack. */
2110 if (args
[i
].reg
&& GET_CODE (args
[i
].reg
) == PARALLEL
2111 && XEXP (XVECEXP (args
[i
].reg
, 0, 0), 0) == 0)
2112 args
[i
].pass_on_stack
= 1;
2114 /* If this is an addressable type, we must preallocate the stack
2115 since we must evaluate the object into its final location.
2117 If this is to be passed in both registers and the stack, it is simpler
2119 if (TREE_ADDRESSABLE (type
)
2120 || (args
[i
].pass_on_stack
&& args
[i
].reg
!= 0))
2121 *must_preallocate
= 1;
2123 /* Compute the stack-size of this argument. */
2124 if (args
[i
].reg
== 0 || args
[i
].partial
!= 0
2125 || reg_parm_stack_space
> 0
2126 || args
[i
].pass_on_stack
)
2127 locate_and_pad_parm (mode
, type
,
2128 #ifdef STACK_PARMS_IN_REG_PARM_AREA
2133 reg_parm_stack_space
,
2134 args
[i
].pass_on_stack
? 0 : args
[i
].partial
,
2135 fndecl
, args_size
, &args
[i
].locate
);
2136 #ifdef BLOCK_REG_PADDING
2138 /* The argument is passed entirely in registers. See at which
2139 end it should be padded. */
2140 args
[i
].locate
.where_pad
=
2141 BLOCK_REG_PADDING (mode
, type
,
2142 int_size_in_bytes (type
) <= UNITS_PER_WORD
);
2145 /* Update ARGS_SIZE, the total stack space for args so far. */
2147 args_size
->constant
+= args
[i
].locate
.size
.constant
;
2148 if (args
[i
].locate
.size
.var
)
2149 ADD_PARM_SIZE (*args_size
, args
[i
].locate
.size
.var
);
2151 /* Increment ARGS_SO_FAR, which has info about which arg-registers
2152 have been used, etc. */
2154 targetm
.calls
.function_arg_advance (args_so_far
, TYPE_MODE (type
),
2155 type
, argpos
< n_named_args
);
2157 /* Store argument values for functions decorated with attribute
2159 if (argpos
== alloc_idx
[0])
2160 alloc_args
[0] = args
[i
].tree_value
;
2161 else if (argpos
== alloc_idx
[1])
2162 alloc_args
[1] = args
[i
].tree_value
;
2167 /* Check the arguments of functions decorated with attribute
2169 maybe_warn_alloc_args_overflow (fndecl
, exp
, alloc_args
, alloc_idx
);
2172 /* Detect passing non-string arguments to functions expecting
2173 nul-terminated strings. */
2174 maybe_warn_nonstring_arg (fndecl
, exp
);
2177 /* Update ARGS_SIZE to contain the total size for the argument block.
2178 Return the original constant component of the argument block's size.
2180 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
2181 for arguments passed in registers. */
2184 compute_argument_block_size (int reg_parm_stack_space
,
2185 struct args_size
*args_size
,
2186 tree fndecl ATTRIBUTE_UNUSED
,
2187 tree fntype ATTRIBUTE_UNUSED
,
2188 int preferred_stack_boundary ATTRIBUTE_UNUSED
)
2190 poly_int64 unadjusted_args_size
= args_size
->constant
;
2192 /* For accumulate outgoing args mode we don't need to align, since the frame
2193 will be already aligned. Align to STACK_BOUNDARY in order to prevent
2194 backends from generating misaligned frame sizes. */
2195 if (ACCUMULATE_OUTGOING_ARGS
&& preferred_stack_boundary
> STACK_BOUNDARY
)
2196 preferred_stack_boundary
= STACK_BOUNDARY
;
2198 /* Compute the actual size of the argument block required. The variable
2199 and constant sizes must be combined, the size may have to be rounded,
2200 and there may be a minimum required size. */
2204 args_size
->var
= ARGS_SIZE_TREE (*args_size
);
2205 args_size
->constant
= 0;
2207 preferred_stack_boundary
/= BITS_PER_UNIT
;
2208 if (preferred_stack_boundary
> 1)
2210 /* We don't handle this case yet. To handle it correctly we have
2211 to add the delta, round and subtract the delta.
2212 Currently no machine description requires this support. */
2213 gcc_assert (multiple_p (stack_pointer_delta
,
2214 preferred_stack_boundary
));
2215 args_size
->var
= round_up (args_size
->var
, preferred_stack_boundary
);
2218 if (reg_parm_stack_space
> 0)
2221 = size_binop (MAX_EXPR
, args_size
->var
,
2222 ssize_int (reg_parm_stack_space
));
2224 /* The area corresponding to register parameters is not to count in
2225 the size of the block we need. So make the adjustment. */
2226 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
2228 = size_binop (MINUS_EXPR
, args_size
->var
,
2229 ssize_int (reg_parm_stack_space
));
2234 preferred_stack_boundary
/= BITS_PER_UNIT
;
2235 if (preferred_stack_boundary
< 1)
2236 preferred_stack_boundary
= 1;
2237 args_size
->constant
= (aligned_upper_bound (args_size
->constant
2238 + stack_pointer_delta
,
2239 preferred_stack_boundary
)
2240 - stack_pointer_delta
);
2242 args_size
->constant
= upper_bound (args_size
->constant
,
2243 reg_parm_stack_space
);
2245 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
2246 args_size
->constant
-= reg_parm_stack_space
;
2248 return unadjusted_args_size
;
2251 /* Precompute parameters as needed for a function call.
2253 FLAGS is mask of ECF_* constants.
2255 NUM_ACTUALS is the number of arguments.
2257 ARGS is an array containing information for each argument; this
2258 routine fills in the INITIAL_VALUE and VALUE fields for each
2259 precomputed argument. */
2262 precompute_arguments (int num_actuals
, struct arg_data
*args
)
2266 /* If this is a libcall, then precompute all arguments so that we do not
2267 get extraneous instructions emitted as part of the libcall sequence. */
2269 /* If we preallocated the stack space, and some arguments must be passed
2270 on the stack, then we must precompute any parameter which contains a
2271 function call which will store arguments on the stack.
2272 Otherwise, evaluating the parameter may clobber previous parameters
2273 which have already been stored into the stack. (we have code to avoid
2274 such case by saving the outgoing stack arguments, but it results in
2276 if (!ACCUMULATE_OUTGOING_ARGS
)
2279 for (i
= 0; i
< num_actuals
; i
++)
2284 if (TREE_CODE (args
[i
].tree_value
) != CALL_EXPR
)
2287 /* If this is an addressable type, we cannot pre-evaluate it. */
2288 type
= TREE_TYPE (args
[i
].tree_value
);
2289 gcc_assert (!TREE_ADDRESSABLE (type
));
2291 args
[i
].initial_value
= args
[i
].value
2292 = expand_normal (args
[i
].tree_value
);
2294 mode
= TYPE_MODE (type
);
2295 if (mode
!= args
[i
].mode
)
2297 int unsignedp
= args
[i
].unsignedp
;
2299 = convert_modes (args
[i
].mode
, mode
,
2300 args
[i
].value
, args
[i
].unsignedp
);
2302 /* CSE will replace this only if it contains args[i].value
2303 pseudo, so convert it down to the declared mode using
2305 if (REG_P (args
[i
].value
)
2306 && GET_MODE_CLASS (args
[i
].mode
) == MODE_INT
2307 && promote_mode (type
, mode
, &unsignedp
) != args
[i
].mode
)
2309 args
[i
].initial_value
2310 = gen_lowpart_SUBREG (mode
, args
[i
].value
);
2311 SUBREG_PROMOTED_VAR_P (args
[i
].initial_value
) = 1;
2312 SUBREG_PROMOTED_SET (args
[i
].initial_value
, args
[i
].unsignedp
);
2318 /* Given the current state of MUST_PREALLOCATE and information about
2319 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
2320 compute and return the final value for MUST_PREALLOCATE. */
2323 finalize_must_preallocate (int must_preallocate
, int num_actuals
,
2324 struct arg_data
*args
, struct args_size
*args_size
)
2326 /* See if we have or want to preallocate stack space.
2328 If we would have to push a partially-in-regs parm
2329 before other stack parms, preallocate stack space instead.
2331 If the size of some parm is not a multiple of the required stack
2332 alignment, we must preallocate.
2334 If the total size of arguments that would otherwise create a copy in
2335 a temporary (such as a CALL) is more than half the total argument list
2336 size, preallocation is faster.
2338 Another reason to preallocate is if we have a machine (like the m88k)
2339 where stack alignment is required to be maintained between every
2340 pair of insns, not just when the call is made. However, we assume here
2341 that such machines either do not have push insns (and hence preallocation
2342 would occur anyway) or the problem is taken care of with
2345 if (! must_preallocate
)
2347 int partial_seen
= 0;
2348 poly_int64 copy_to_evaluate_size
= 0;
2351 for (i
= 0; i
< num_actuals
&& ! must_preallocate
; i
++)
2353 if (args
[i
].partial
> 0 && ! args
[i
].pass_on_stack
)
2355 else if (partial_seen
&& args
[i
].reg
== 0)
2356 must_preallocate
= 1;
2358 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
2359 && (TREE_CODE (args
[i
].tree_value
) == CALL_EXPR
2360 || TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
2361 || TREE_CODE (args
[i
].tree_value
) == COND_EXPR
2362 || TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
))))
2363 copy_to_evaluate_size
2364 += int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
2367 if (maybe_ne (args_size
->constant
, 0)
2368 && maybe_ge (copy_to_evaluate_size
* 2, args_size
->constant
))
2369 must_preallocate
= 1;
2371 return must_preallocate
;
2374 /* If we preallocated stack space, compute the address of each argument
2375 and store it into the ARGS array.
2377 We need not ensure it is a valid memory address here; it will be
2378 validized when it is used.
2380 ARGBLOCK is an rtx for the address of the outgoing arguments. */
2383 compute_argument_addresses (struct arg_data
*args
, rtx argblock
, int num_actuals
)
2387 rtx arg_reg
= argblock
;
2389 poly_int64 arg_offset
= 0;
2391 if (GET_CODE (argblock
) == PLUS
)
2393 arg_reg
= XEXP (argblock
, 0);
2394 arg_offset
= rtx_to_poly_int64 (XEXP (argblock
, 1));
2397 for (i
= 0; i
< num_actuals
; i
++)
2399 rtx offset
= ARGS_SIZE_RTX (args
[i
].locate
.offset
);
2400 rtx slot_offset
= ARGS_SIZE_RTX (args
[i
].locate
.slot_offset
);
2402 unsigned int align
, boundary
;
2403 poly_uint64 units_on_stack
= 0;
2404 machine_mode partial_mode
= VOIDmode
;
2406 /* Skip this parm if it will not be passed on the stack. */
2407 if (! args
[i
].pass_on_stack
2409 && args
[i
].partial
== 0)
2412 if (TYPE_EMPTY_P (TREE_TYPE (args
[i
].tree_value
)))
2415 addr
= simplify_gen_binary (PLUS
, Pmode
, arg_reg
, offset
);
2416 addr
= plus_constant (Pmode
, addr
, arg_offset
);
2418 if (args
[i
].partial
!= 0)
2420 /* Only part of the parameter is being passed on the stack.
2421 Generate a simple memory reference of the correct size. */
2422 units_on_stack
= args
[i
].locate
.size
.constant
;
2423 poly_uint64 bits_on_stack
= units_on_stack
* BITS_PER_UNIT
;
2424 partial_mode
= int_mode_for_size (bits_on_stack
, 1).else_blk ();
2425 args
[i
].stack
= gen_rtx_MEM (partial_mode
, addr
);
2426 set_mem_size (args
[i
].stack
, units_on_stack
);
2430 args
[i
].stack
= gen_rtx_MEM (args
[i
].mode
, addr
);
2431 set_mem_attributes (args
[i
].stack
,
2432 TREE_TYPE (args
[i
].tree_value
), 1);
2434 align
= BITS_PER_UNIT
;
2435 boundary
= args
[i
].locate
.boundary
;
2436 poly_int64 offset_val
;
2437 if (args
[i
].locate
.where_pad
!= PAD_DOWNWARD
)
2439 else if (poly_int_rtx_p (offset
, &offset_val
))
2441 align
= least_bit_hwi (boundary
);
2442 unsigned int offset_align
2443 = known_alignment (offset_val
) * BITS_PER_UNIT
;
2444 if (offset_align
!= 0)
2445 align
= MIN (align
, offset_align
);
2447 set_mem_align (args
[i
].stack
, align
);
2449 addr
= simplify_gen_binary (PLUS
, Pmode
, arg_reg
, slot_offset
);
2450 addr
= plus_constant (Pmode
, addr
, arg_offset
);
2452 if (args
[i
].partial
!= 0)
2454 /* Only part of the parameter is being passed on the stack.
2455 Generate a simple memory reference of the correct size.
2457 args
[i
].stack_slot
= gen_rtx_MEM (partial_mode
, addr
);
2458 set_mem_size (args
[i
].stack_slot
, units_on_stack
);
2462 args
[i
].stack_slot
= gen_rtx_MEM (args
[i
].mode
, addr
);
2463 set_mem_attributes (args
[i
].stack_slot
,
2464 TREE_TYPE (args
[i
].tree_value
), 1);
2466 set_mem_align (args
[i
].stack_slot
, args
[i
].locate
.boundary
);
2468 /* Function incoming arguments may overlap with sibling call
2469 outgoing arguments and we cannot allow reordering of reads
2470 from function arguments with stores to outgoing arguments
2471 of sibling calls. */
2472 set_mem_alias_set (args
[i
].stack
, 0);
2473 set_mem_alias_set (args
[i
].stack_slot
, 0);
2478 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
2479 in a call instruction.
2481 FNDECL is the tree node for the target function. For an indirect call
2482 FNDECL will be NULL_TREE.
2484 ADDR is the operand 0 of CALL_EXPR for this call. */
2487 rtx_for_function_call (tree fndecl
, tree addr
)
2491 /* Get the function to call, in the form of RTL. */
2494 if (!TREE_USED (fndecl
) && fndecl
!= current_function_decl
)
2495 TREE_USED (fndecl
) = 1;
2497 /* Get a SYMBOL_REF rtx for the function address. */
2498 funexp
= XEXP (DECL_RTL (fndecl
), 0);
2501 /* Generate an rtx (probably a pseudo-register) for the address. */
2504 funexp
= expand_normal (addr
);
2505 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
2510 /* Return the static chain for this function, if any. */
2513 rtx_for_static_chain (const_tree fndecl_or_type
, bool incoming_p
)
2515 if (DECL_P (fndecl_or_type
) && !DECL_STATIC_CHAIN (fndecl_or_type
))
2518 return targetm
.calls
.static_chain (fndecl_or_type
, incoming_p
);
2521 /* Internal state for internal_arg_pointer_based_exp and its helpers. */
2524 /* Last insn that has been scanned by internal_arg_pointer_based_exp_scan,
2525 or NULL_RTX if none has been scanned yet. */
2526 rtx_insn
*scan_start
;
2527 /* Vector indexed by REGNO - FIRST_PSEUDO_REGISTER, recording if a pseudo is
2528 based on crtl->args.internal_arg_pointer. The element is NULL_RTX if the
2529 pseudo isn't based on it, a CONST_INT offset if the pseudo is based on it
2530 with fixed offset, or PC if this is with variable or unknown offset. */
2532 } internal_arg_pointer_exp_state
;
2534 static rtx
internal_arg_pointer_based_exp (const_rtx
, bool);
2536 /* Helper function for internal_arg_pointer_based_exp. Scan insns in
2537 the tail call sequence, starting with first insn that hasn't been
2538 scanned yet, and note for each pseudo on the LHS whether it is based
2539 on crtl->args.internal_arg_pointer or not, and what offset from that
2540 that pointer it has. */
2543 internal_arg_pointer_based_exp_scan (void)
2545 rtx_insn
*insn
, *scan_start
= internal_arg_pointer_exp_state
.scan_start
;
2547 if (scan_start
== NULL_RTX
)
2548 insn
= get_insns ();
2550 insn
= NEXT_INSN (scan_start
);
2554 rtx set
= single_set (insn
);
2555 if (set
&& REG_P (SET_DEST (set
)) && !HARD_REGISTER_P (SET_DEST (set
)))
2558 unsigned int idx
= REGNO (SET_DEST (set
)) - FIRST_PSEUDO_REGISTER
;
2559 /* Punt on pseudos set multiple times. */
2560 if (idx
< internal_arg_pointer_exp_state
.cache
.length ()
2561 && (internal_arg_pointer_exp_state
.cache
[idx
]
2565 val
= internal_arg_pointer_based_exp (SET_SRC (set
), false);
2566 if (val
!= NULL_RTX
)
2568 if (idx
>= internal_arg_pointer_exp_state
.cache
.length ())
2569 internal_arg_pointer_exp_state
.cache
2570 .safe_grow_cleared (idx
+ 1);
2571 internal_arg_pointer_exp_state
.cache
[idx
] = val
;
2574 if (NEXT_INSN (insn
) == NULL_RTX
)
2576 insn
= NEXT_INSN (insn
);
2579 internal_arg_pointer_exp_state
.scan_start
= scan_start
;
2582 /* Compute whether RTL is based on crtl->args.internal_arg_pointer. Return
2583 NULL_RTX if RTL isn't based on it, a CONST_INT offset if RTL is based on
2584 it with fixed offset, or PC if this is with variable or unknown offset.
2585 TOPLEVEL is true if the function is invoked at the topmost level. */
2588 internal_arg_pointer_based_exp (const_rtx rtl
, bool toplevel
)
2590 if (CONSTANT_P (rtl
))
2593 if (rtl
== crtl
->args
.internal_arg_pointer
)
2596 if (REG_P (rtl
) && HARD_REGISTER_P (rtl
))
2600 if (GET_CODE (rtl
) == PLUS
&& poly_int_rtx_p (XEXP (rtl
, 1), &offset
))
2602 rtx val
= internal_arg_pointer_based_exp (XEXP (rtl
, 0), toplevel
);
2603 if (val
== NULL_RTX
|| val
== pc_rtx
)
2605 return plus_constant (Pmode
, val
, offset
);
2608 /* When called at the topmost level, scan pseudo assignments in between the
2609 last scanned instruction in the tail call sequence and the latest insn
2610 in that sequence. */
2612 internal_arg_pointer_based_exp_scan ();
2616 unsigned int idx
= REGNO (rtl
) - FIRST_PSEUDO_REGISTER
;
2617 if (idx
< internal_arg_pointer_exp_state
.cache
.length ())
2618 return internal_arg_pointer_exp_state
.cache
[idx
];
2623 subrtx_iterator::array_type array
;
2624 FOR_EACH_SUBRTX (iter
, array
, rtl
, NONCONST
)
2626 const_rtx x
= *iter
;
2627 if (REG_P (x
) && internal_arg_pointer_based_exp (x
, false) != NULL_RTX
)
2630 iter
.skip_subrtxes ();
2636 /* Return true if SIZE bytes starting from address ADDR might overlap an
2637 already-clobbered argument area. This function is used to determine
2638 if we should give up a sibcall. */
2641 mem_might_overlap_already_clobbered_arg_p (rtx addr
, poly_uint64 size
)
2644 unsigned HOST_WIDE_INT start
, end
;
2647 if (bitmap_empty_p (stored_args_map
)
2648 && stored_args_watermark
== HOST_WIDE_INT_M1U
)
2650 val
= internal_arg_pointer_based_exp (addr
, true);
2651 if (val
== NULL_RTX
)
2653 else if (!poly_int_rtx_p (val
, &i
))
2656 if (known_eq (size
, 0U))
2659 if (STACK_GROWS_DOWNWARD
)
2660 i
-= crtl
->args
.pretend_args_size
;
2662 i
+= crtl
->args
.pretend_args_size
;
2664 if (ARGS_GROW_DOWNWARD
)
2667 /* We can ignore any references to the function's pretend args,
2668 which at this point would manifest as negative values of I. */
2669 if (known_le (i
, 0) && known_le (size
, poly_uint64 (-i
)))
2672 start
= maybe_lt (i
, 0) ? 0 : constant_lower_bound (i
);
2673 if (!(i
+ size
).is_constant (&end
))
2674 end
= HOST_WIDE_INT_M1U
;
2676 if (end
> stored_args_watermark
)
2679 end
= MIN (end
, SBITMAP_SIZE (stored_args_map
));
2680 for (unsigned HOST_WIDE_INT k
= start
; k
< end
; ++k
)
2681 if (bitmap_bit_p (stored_args_map
, k
))
2687 /* Do the register loads required for any wholly-register parms or any
2688 parms which are passed both on the stack and in a register. Their
2689 expressions were already evaluated.
2691 Mark all register-parms as living through the call, putting these USE
2692 insns in the CALL_INSN_FUNCTION_USAGE field.
2694 When IS_SIBCALL, perform the check_sibcall_argument_overlap
2695 checking, setting *SIBCALL_FAILURE if appropriate. */
2698 load_register_parameters (struct arg_data
*args
, int num_actuals
,
2699 rtx
*call_fusage
, int flags
, int is_sibcall
,
2700 int *sibcall_failure
)
2704 for (i
= 0; i
< num_actuals
; i
++)
2706 rtx reg
= ((flags
& ECF_SIBCALL
)
2707 ? args
[i
].tail_call_reg
: args
[i
].reg
);
2710 int partial
= args
[i
].partial
;
2712 poly_int64 size
= 0;
2713 HOST_WIDE_INT const_size
= 0;
2714 rtx_insn
*before_arg
= get_last_insn ();
2715 /* Set non-negative if we must move a word at a time, even if
2716 just one word (e.g, partial == 4 && mode == DFmode). Set
2717 to -1 if we just use a normal move insn. This value can be
2718 zero if the argument is a zero size structure. */
2720 if (GET_CODE (reg
) == PARALLEL
)
2724 gcc_assert (partial
% UNITS_PER_WORD
== 0);
2725 nregs
= partial
/ UNITS_PER_WORD
;
2727 else if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
)
2729 /* Variable-sized parameters should be described by a
2730 PARALLEL instead. */
2731 const_size
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
2732 gcc_assert (const_size
>= 0);
2733 nregs
= (const_size
+ (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
2737 size
= GET_MODE_SIZE (args
[i
].mode
);
2739 /* Handle calls that pass values in multiple non-contiguous
2740 locations. The Irix 6 ABI has examples of this. */
2742 if (GET_CODE (reg
) == PARALLEL
)
2743 emit_group_move (reg
, args
[i
].parallel_value
);
2745 /* If simple case, just do move. If normal partial, store_one_arg
2746 has already loaded the register for us. In all other cases,
2747 load the register(s) from memory. */
2749 else if (nregs
== -1)
2751 emit_move_insn (reg
, args
[i
].value
);
2752 #ifdef BLOCK_REG_PADDING
2753 /* Handle case where we have a value that needs shifting
2754 up to the msb. eg. a QImode value and we're padding
2755 upward on a BYTES_BIG_ENDIAN machine. */
2756 if (args
[i
].locate
.where_pad
2757 == (BYTES_BIG_ENDIAN
? PAD_UPWARD
: PAD_DOWNWARD
))
2759 gcc_checking_assert (ordered_p (size
, UNITS_PER_WORD
));
2760 if (maybe_lt (size
, UNITS_PER_WORD
))
2764 = (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
2766 /* Assigning REG here rather than a temp makes
2767 CALL_FUSAGE report the whole reg as used.
2768 Strictly speaking, the call only uses SIZE
2769 bytes at the msb end, but it doesn't seem worth
2770 generating rtl to say that. */
2771 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
2772 x
= expand_shift (LSHIFT_EXPR
, word_mode
,
2773 reg
, shift
, reg
, 1);
2775 emit_move_insn (reg
, x
);
2781 /* If we have pre-computed the values to put in the registers in
2782 the case of non-aligned structures, copy them in now. */
2784 else if (args
[i
].n_aligned_regs
!= 0)
2785 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
2786 emit_move_insn (gen_rtx_REG (word_mode
, REGNO (reg
) + j
),
2787 args
[i
].aligned_regs
[j
]);
2789 else if (partial
== 0 || args
[i
].pass_on_stack
)
2791 /* SIZE and CONST_SIZE are 0 for partial arguments and
2792 the size of a BLKmode type otherwise. */
2793 gcc_checking_assert (known_eq (size
, const_size
));
2794 rtx mem
= validize_mem (copy_rtx (args
[i
].value
));
2796 /* Check for overlap with already clobbered argument area,
2797 providing that this has non-zero size. */
2800 && (mem_might_overlap_already_clobbered_arg_p
2801 (XEXP (args
[i
].value
, 0), const_size
)))
2802 *sibcall_failure
= 1;
2804 if (const_size
% UNITS_PER_WORD
== 0
2805 || MEM_ALIGN (mem
) % BITS_PER_WORD
== 0)
2806 move_block_to_reg (REGNO (reg
), mem
, nregs
, args
[i
].mode
);
2810 move_block_to_reg (REGNO (reg
), mem
, nregs
- 1,
2812 rtx dest
= gen_rtx_REG (word_mode
, REGNO (reg
) + nregs
- 1);
2813 unsigned int bitoff
= (nregs
- 1) * BITS_PER_WORD
;
2814 unsigned int bitsize
= const_size
* BITS_PER_UNIT
- bitoff
;
2815 rtx x
= extract_bit_field (mem
, bitsize
, bitoff
, 1, dest
,
2816 word_mode
, word_mode
, false,
2818 if (BYTES_BIG_ENDIAN
)
2819 x
= expand_shift (LSHIFT_EXPR
, word_mode
, x
,
2820 BITS_PER_WORD
- bitsize
, dest
, 1);
2822 emit_move_insn (dest
, x
);
2825 /* Handle a BLKmode that needs shifting. */
2826 if (nregs
== 1 && const_size
< UNITS_PER_WORD
2827 #ifdef BLOCK_REG_PADDING
2828 && args
[i
].locate
.where_pad
== PAD_DOWNWARD
2834 rtx dest
= gen_rtx_REG (word_mode
, REGNO (reg
));
2835 int shift
= (UNITS_PER_WORD
- const_size
) * BITS_PER_UNIT
;
2836 enum tree_code dir
= (BYTES_BIG_ENDIAN
2837 ? RSHIFT_EXPR
: LSHIFT_EXPR
);
2840 x
= expand_shift (dir
, word_mode
, dest
, shift
, dest
, 1);
2842 emit_move_insn (dest
, x
);
2846 /* When a parameter is a block, and perhaps in other cases, it is
2847 possible that it did a load from an argument slot that was
2848 already clobbered. */
2850 && check_sibcall_argument_overlap (before_arg
, &args
[i
], 0))
2851 *sibcall_failure
= 1;
2853 /* Handle calls that pass values in multiple non-contiguous
2854 locations. The Irix 6 ABI has examples of this. */
2855 if (GET_CODE (reg
) == PARALLEL
)
2856 use_group_regs (call_fusage
, reg
);
2857 else if (nregs
== -1)
2858 use_reg_mode (call_fusage
, reg
,
2859 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)));
2861 use_regs (call_fusage
, REGNO (reg
), nregs
);
2866 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
2867 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
2868 bytes, then we would need to push some additional bytes to pad the
2869 arguments. So, we try to compute an adjust to the stack pointer for an
2870 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
2871 bytes. Then, when the arguments are pushed the stack will be perfectly
2874 Return true if this optimization is possible, storing the adjustment
2875 in ADJUSTMENT_OUT and setting ARGS_SIZE->CONSTANT to the number of
2876 bytes that should be popped after the call. */
2879 combine_pending_stack_adjustment_and_call (poly_int64_pod
*adjustment_out
,
2880 poly_int64 unadjusted_args_size
,
2881 struct args_size
*args_size
,
2882 unsigned int preferred_unit_stack_boundary
)
2884 /* The number of bytes to pop so that the stack will be
2885 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
2886 poly_int64 adjustment
;
2887 /* The alignment of the stack after the arguments are pushed, if we
2888 just pushed the arguments without adjust the stack here. */
2889 unsigned HOST_WIDE_INT unadjusted_alignment
;
2891 if (!known_misalignment (stack_pointer_delta
+ unadjusted_args_size
,
2892 preferred_unit_stack_boundary
,
2893 &unadjusted_alignment
))
2896 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
2897 as possible -- leaving just enough left to cancel out the
2898 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
2899 PENDING_STACK_ADJUST is non-negative, and congruent to
2900 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
2902 /* Begin by trying to pop all the bytes. */
2903 unsigned HOST_WIDE_INT tmp_misalignment
;
2904 if (!known_misalignment (pending_stack_adjust
,
2905 preferred_unit_stack_boundary
,
2908 unadjusted_alignment
-= tmp_misalignment
;
2909 adjustment
= pending_stack_adjust
;
2910 /* Push enough additional bytes that the stack will be aligned
2911 after the arguments are pushed. */
2912 if (preferred_unit_stack_boundary
> 1 && unadjusted_alignment
)
2913 adjustment
-= preferred_unit_stack_boundary
- unadjusted_alignment
;
2915 /* We need to know whether the adjusted argument size
2916 (UNADJUSTED_ARGS_SIZE - ADJUSTMENT) constitutes an allocation
2917 or a deallocation. */
2918 if (!ordered_p (adjustment
, unadjusted_args_size
))
2921 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
2922 bytes after the call. The right number is the entire
2923 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
2924 by the arguments in the first place. */
2926 = pending_stack_adjust
- adjustment
+ unadjusted_args_size
;
2928 *adjustment_out
= adjustment
;
2932 /* Scan X expression if it does not dereference any argument slots
2933 we already clobbered by tail call arguments (as noted in stored_args_map
2935 Return nonzero if X expression dereferences such argument slots,
2939 check_sibcall_argument_overlap_1 (rtx x
)
2948 code
= GET_CODE (x
);
2950 /* We need not check the operands of the CALL expression itself. */
2955 return (mem_might_overlap_already_clobbered_arg_p
2956 (XEXP (x
, 0), GET_MODE_SIZE (GET_MODE (x
))));
2958 /* Scan all subexpressions. */
2959 fmt
= GET_RTX_FORMAT (code
);
2960 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
2964 if (check_sibcall_argument_overlap_1 (XEXP (x
, i
)))
2967 else if (*fmt
== 'E')
2969 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2970 if (check_sibcall_argument_overlap_1 (XVECEXP (x
, i
, j
)))
2977 /* Scan sequence after INSN if it does not dereference any argument slots
2978 we already clobbered by tail call arguments (as noted in stored_args_map
2979 bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
2980 stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP
2981 should be 0). Return nonzero if sequence after INSN dereferences such argument
2982 slots, zero otherwise. */
2985 check_sibcall_argument_overlap (rtx_insn
*insn
, struct arg_data
*arg
,
2986 int mark_stored_args_map
)
2988 poly_uint64 low
, high
;
2989 unsigned HOST_WIDE_INT const_low
, const_high
;
2991 if (insn
== NULL_RTX
)
2992 insn
= get_insns ();
2994 insn
= NEXT_INSN (insn
);
2996 for (; insn
; insn
= NEXT_INSN (insn
))
2998 && check_sibcall_argument_overlap_1 (PATTERN (insn
)))
3001 if (mark_stored_args_map
)
3003 if (ARGS_GROW_DOWNWARD
)
3004 low
= -arg
->locate
.slot_offset
.constant
- arg
->locate
.size
.constant
;
3006 low
= arg
->locate
.slot_offset
.constant
;
3007 high
= low
+ arg
->locate
.size
.constant
;
3009 const_low
= constant_lower_bound (low
);
3010 if (high
.is_constant (&const_high
))
3011 for (unsigned HOST_WIDE_INT i
= const_low
; i
< const_high
; ++i
)
3012 bitmap_set_bit (stored_args_map
, i
);
3014 stored_args_watermark
= MIN (stored_args_watermark
, const_low
);
3016 return insn
!= NULL_RTX
;
3019 /* Given that a function returns a value of mode MODE at the most
3020 significant end of hard register VALUE, shift VALUE left or right
3021 as specified by LEFT_P. Return true if some action was needed. */
3024 shift_return_value (machine_mode mode
, bool left_p
, rtx value
)
3026 gcc_assert (REG_P (value
) && HARD_REGISTER_P (value
));
3027 machine_mode value_mode
= GET_MODE (value
);
3028 poly_int64 shift
= GET_MODE_BITSIZE (value_mode
) - GET_MODE_BITSIZE (mode
);
3030 if (known_eq (shift
, 0))
3033 /* Use ashr rather than lshr for right shifts. This is for the benefit
3034 of the MIPS port, which requires SImode values to be sign-extended
3035 when stored in 64-bit registers. */
3036 if (!force_expand_binop (value_mode
, left_p
? ashl_optab
: ashr_optab
,
3037 value
, gen_int_shift_amount (value_mode
, shift
),
3038 value
, 1, OPTAB_WIDEN
))
3043 /* If X is a likely-spilled register value, copy it to a pseudo
3044 register and return that register. Return X otherwise. */
3047 avoid_likely_spilled_reg (rtx x
)
3052 && HARD_REGISTER_P (x
)
3053 && targetm
.class_likely_spilled_p (REGNO_REG_CLASS (REGNO (x
))))
3055 /* Make sure that we generate a REG rather than a CONCAT.
3056 Moves into CONCATs can need nontrivial instructions,
3057 and the whole point of this function is to avoid
3058 using the hard register directly in such a situation. */
3059 generating_concat_p
= 0;
3060 new_rtx
= gen_reg_rtx (GET_MODE (x
));
3061 generating_concat_p
= 1;
3062 emit_move_insn (new_rtx
, x
);
3068 /* Helper function for expand_call.
3069 Return false is EXP is not implementable as a sibling call. */
3072 can_implement_as_sibling_call_p (tree exp
,
3073 rtx structure_value_addr
,
3075 int reg_parm_stack_space ATTRIBUTE_UNUSED
,
3079 const args_size
&args_size
)
3081 if (!targetm
.have_sibcall_epilogue ())
3083 maybe_complain_about_tail_call
3085 "machine description does not have"
3086 " a sibcall_epilogue instruction pattern");
3090 /* Doing sibling call optimization needs some work, since
3091 structure_value_addr can be allocated on the stack.
3092 It does not seem worth the effort since few optimizable
3093 sibling calls will return a structure. */
3094 if (structure_value_addr
!= NULL_RTX
)
3096 maybe_complain_about_tail_call (exp
, "callee returns a structure");
3100 #ifdef REG_PARM_STACK_SPACE
3101 /* If outgoing reg parm stack space changes, we can not do sibcall. */
3102 if (OUTGOING_REG_PARM_STACK_SPACE (funtype
)
3103 != OUTGOING_REG_PARM_STACK_SPACE (TREE_TYPE (current_function_decl
))
3104 || (reg_parm_stack_space
!= REG_PARM_STACK_SPACE (current_function_decl
)))
3106 maybe_complain_about_tail_call (exp
,
3107 "inconsistent size of stack space"
3108 " allocated for arguments which are"
3109 " passed in registers");
3114 /* Check whether the target is able to optimize the call
3116 if (!targetm
.function_ok_for_sibcall (fndecl
, exp
))
3118 maybe_complain_about_tail_call (exp
,
3119 "target is not able to optimize the"
3120 " call into a sibling call");
3124 /* Functions that do not return exactly once may not be sibcall
3126 if (flags
& ECF_RETURNS_TWICE
)
3128 maybe_complain_about_tail_call (exp
, "callee returns twice");
3131 if (flags
& ECF_NORETURN
)
3133 maybe_complain_about_tail_call (exp
, "callee does not return");
3137 if (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (addr
))))
3139 maybe_complain_about_tail_call (exp
, "volatile function type");
3143 /* If the called function is nested in the current one, it might access
3144 some of the caller's arguments, but could clobber them beforehand if
3145 the argument areas are shared. */
3146 if (fndecl
&& decl_function_context (fndecl
) == current_function_decl
)
3148 maybe_complain_about_tail_call (exp
, "nested function");
3152 /* If this function requires more stack slots than the current
3153 function, we cannot change it into a sibling call.
3154 crtl->args.pretend_args_size is not part of the
3155 stack allocated by our caller. */
3156 if (maybe_gt (args_size
.constant
,
3157 crtl
->args
.size
- crtl
->args
.pretend_args_size
))
3159 maybe_complain_about_tail_call (exp
,
3160 "callee required more stack slots"
3161 " than the caller");
3165 /* If the callee pops its own arguments, then it must pop exactly
3166 the same number of arguments as the current function. */
3167 if (maybe_ne (targetm
.calls
.return_pops_args (fndecl
, funtype
,
3168 args_size
.constant
),
3169 targetm
.calls
.return_pops_args (current_function_decl
,
3171 (current_function_decl
),
3174 maybe_complain_about_tail_call (exp
,
3175 "inconsistent number of"
3176 " popped arguments");
3180 if (!lang_hooks
.decls
.ok_for_sibcall (fndecl
))
3182 maybe_complain_about_tail_call (exp
, "frontend does not support"
3187 /* All checks passed. */
3191 /* Generate all the code for a CALL_EXPR exp
3192 and return an rtx for its value.
3193 Store the value in TARGET (specified as an rtx) if convenient.
3194 If the value is stored in TARGET then TARGET is returned.
3195 If IGNORE is nonzero, then we ignore the value of the function call. */
3198 expand_call (tree exp
, rtx target
, int ignore
)
3200 /* Nonzero if we are currently expanding a call. */
3201 static int currently_expanding_call
= 0;
3203 /* RTX for the function to be called. */
3205 /* Sequence of insns to perform a normal "call". */
3206 rtx_insn
*normal_call_insns
= NULL
;
3207 /* Sequence of insns to perform a tail "call". */
3208 rtx_insn
*tail_call_insns
= NULL
;
3209 /* Data type of the function. */
3211 tree type_arg_types
;
3213 /* Declaration of the function being called,
3214 or 0 if the function is computed (not known by name). */
3216 /* The type of the function being called. */
3218 bool try_tail_call
= CALL_EXPR_TAILCALL (exp
);
3219 bool must_tail_call
= CALL_EXPR_MUST_TAIL_CALL (exp
);
3222 /* Register in which non-BLKmode value will be returned,
3223 or 0 if no value or if value is BLKmode. */
3225 /* Address where we should return a BLKmode value;
3226 0 if value not BLKmode. */
3227 rtx structure_value_addr
= 0;
3228 /* Nonzero if that address is being passed by treating it as
3229 an extra, implicit first parameter. Otherwise,
3230 it is passed by being copied directly into struct_value_rtx. */
3231 int structure_value_addr_parm
= 0;
3232 /* Holds the value of implicit argument for the struct value. */
3233 tree structure_value_addr_value
= NULL_TREE
;
3234 /* Size of aggregate value wanted, or zero if none wanted
3235 or if we are using the non-reentrant PCC calling convention
3236 or expecting the value in registers. */
3237 poly_int64 struct_value_size
= 0;
3238 /* Nonzero if called function returns an aggregate in memory PCC style,
3239 by returning the address of where to find it. */
3240 int pcc_struct_value
= 0;
3241 rtx struct_value
= 0;
3243 /* Number of actual parameters in this call, including struct value addr. */
3245 /* Number of named args. Args after this are anonymous ones
3246 and they must all go on the stack. */
3248 /* Number of complex actual arguments that need to be split. */
3249 int num_complex_actuals
= 0;
3251 /* Vector of information about each argument.
3252 Arguments are numbered in the order they will be pushed,
3253 not the order they are written. */
3254 struct arg_data
*args
;
3256 /* Total size in bytes of all the stack-parms scanned so far. */
3257 struct args_size args_size
;
3258 struct args_size adjusted_args_size
;
3259 /* Size of arguments before any adjustments (such as rounding). */
3260 poly_int64 unadjusted_args_size
;
3261 /* Data on reg parms scanned so far. */
3262 CUMULATIVE_ARGS args_so_far_v
;
3263 cumulative_args_t args_so_far
;
3264 /* Nonzero if a reg parm has been scanned. */
3266 /* Nonzero if this is an indirect function call. */
3268 /* Nonzero if we must avoid push-insns in the args for this call.
3269 If stack space is allocated for register parameters, but not by the
3270 caller, then it is preallocated in the fixed part of the stack frame.
3271 So the entire argument block must then be preallocated (i.e., we
3272 ignore PUSH_ROUNDING in that case). */
3274 int must_preallocate
= !PUSH_ARGS
;
3276 /* Size of the stack reserved for parameter registers. */
3277 int reg_parm_stack_space
= 0;
3279 /* Address of space preallocated for stack parms
3280 (on machines that lack push insns), or 0 if space not preallocated. */
3283 /* Mask of ECF_ and ERF_ flags. */
3285 int return_flags
= 0;
3286 #ifdef REG_PARM_STACK_SPACE
3287 /* Define the boundary of the register parm stack space that needs to be
3289 int low_to_save
, high_to_save
;
3290 rtx save_area
= 0; /* Place that it is saved */
3293 unsigned int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
3294 char *initial_stack_usage_map
= stack_usage_map
;
3295 unsigned HOST_WIDE_INT initial_stack_usage_watermark
= stack_usage_watermark
;
3296 char *stack_usage_map_buf
= NULL
;
3298 poly_int64 old_stack_allocated
;
3300 /* State variables to track stack modifications. */
3301 rtx old_stack_level
= 0;
3302 int old_stack_arg_under_construction
= 0;
3303 poly_int64 old_pending_adj
= 0;
3304 int old_inhibit_defer_pop
= inhibit_defer_pop
;
3306 /* Some stack pointer alterations we make are performed via
3307 allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
3308 which we then also need to save/restore along the way. */
3309 poly_int64 old_stack_pointer_delta
= 0;
3312 tree addr
= CALL_EXPR_FN (exp
);
3314 /* The alignment of the stack, in bits. */
3315 unsigned HOST_WIDE_INT preferred_stack_boundary
;
3316 /* The alignment of the stack, in bytes. */
3317 unsigned HOST_WIDE_INT preferred_unit_stack_boundary
;
3318 /* The static chain value to use for this call. */
3319 rtx static_chain_value
;
3320 /* See if this is "nothrow" function call. */
3321 if (TREE_NOTHROW (exp
))
3322 flags
|= ECF_NOTHROW
;
3324 /* See if we can find a DECL-node for the actual function, and get the
3325 function attributes (flags) from the function decl or type node. */
3326 fndecl
= get_callee_fndecl (exp
);
3329 fntype
= TREE_TYPE (fndecl
);
3330 flags
|= flags_from_decl_or_type (fndecl
);
3331 return_flags
|= decl_return_flags (fndecl
);
3335 fntype
= TREE_TYPE (TREE_TYPE (addr
));
3336 flags
|= flags_from_decl_or_type (fntype
);
3337 if (CALL_EXPR_BY_DESCRIPTOR (exp
))
3338 flags
|= ECF_BY_DESCRIPTOR
;
3340 rettype
= TREE_TYPE (exp
);
3342 struct_value
= targetm
.calls
.struct_value_rtx (fntype
, 0);
3344 /* Warn if this value is an aggregate type,
3345 regardless of which calling convention we are using for it. */
3346 if (AGGREGATE_TYPE_P (rettype
))
3347 warning (OPT_Waggregate_return
, "function call has aggregate value");
3349 /* If the result of a non looping pure or const function call is
3350 ignored (or void), and none of its arguments are volatile, we can
3351 avoid expanding the call and just evaluate the arguments for
3353 if ((flags
& (ECF_CONST
| ECF_PURE
))
3354 && (!(flags
& ECF_LOOPING_CONST_OR_PURE
))
3355 && (ignore
|| target
== const0_rtx
3356 || TYPE_MODE (rettype
) == VOIDmode
))
3358 bool volatilep
= false;
3360 call_expr_arg_iterator iter
;
3362 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
3363 if (TREE_THIS_VOLATILE (arg
))
3371 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
3372 expand_expr (arg
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3377 #ifdef REG_PARM_STACK_SPACE
3378 reg_parm_stack_space
= REG_PARM_STACK_SPACE (!fndecl
? fntype
: fndecl
);
3381 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
3382 && reg_parm_stack_space
> 0 && PUSH_ARGS
)
3383 must_preallocate
= 1;
3385 /* Set up a place to return a structure. */
3387 /* Cater to broken compilers. */
3388 if (aggregate_value_p (exp
, fntype
))
3390 /* This call returns a big structure. */
3391 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
3393 #ifdef PCC_STATIC_STRUCT_RETURN
3395 pcc_struct_value
= 1;
3397 #else /* not PCC_STATIC_STRUCT_RETURN */
3399 if (!poly_int_tree_p (TYPE_SIZE_UNIT (rettype
), &struct_value_size
))
3400 struct_value_size
= -1;
3402 /* Even if it is semantically safe to use the target as the return
3403 slot, it may be not sufficiently aligned for the return type. */
3404 if (CALL_EXPR_RETURN_SLOT_OPT (exp
)
3407 /* If rettype is addressable, we may not create a temporary.
3408 If target is properly aligned at runtime and the compiler
3409 just doesn't know about it, it will work fine, otherwise it
3411 && (TREE_ADDRESSABLE (rettype
)
3412 || !(MEM_ALIGN (target
) < TYPE_ALIGN (rettype
)
3413 && targetm
.slow_unaligned_access (TYPE_MODE (rettype
),
3414 MEM_ALIGN (target
)))))
3415 structure_value_addr
= XEXP (target
, 0);
3418 /* For variable-sized objects, we must be called with a target
3419 specified. If we were to allocate space on the stack here,
3420 we would have no way of knowing when to free it. */
3421 rtx d
= assign_temp (rettype
, 1, 1);
3422 structure_value_addr
= XEXP (d
, 0);
3426 #endif /* not PCC_STATIC_STRUCT_RETURN */
3429 /* Figure out the amount to which the stack should be aligned. */
3430 preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
3433 struct cgraph_rtl_info
*i
= cgraph_node::rtl_info (fndecl
);
3434 /* Without automatic stack alignment, we can't increase preferred
3435 stack boundary. With automatic stack alignment, it is
3436 unnecessary since unless we can guarantee that all callers will
3437 align the outgoing stack properly, callee has to align its
3440 && i
->preferred_incoming_stack_boundary
3441 && i
->preferred_incoming_stack_boundary
< preferred_stack_boundary
)
3442 preferred_stack_boundary
= i
->preferred_incoming_stack_boundary
;
3445 /* Operand 0 is a pointer-to-function; get the type of the function. */
3446 funtype
= TREE_TYPE (addr
);
3447 gcc_assert (POINTER_TYPE_P (funtype
));
3448 funtype
= TREE_TYPE (funtype
);
3450 /* Count whether there are actual complex arguments that need to be split
3451 into their real and imaginary parts. Munge the type_arg_types
3452 appropriately here as well. */
3453 if (targetm
.calls
.split_complex_arg
)
3455 call_expr_arg_iterator iter
;
3457 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, exp
)
3459 tree type
= TREE_TYPE (arg
);
3460 if (type
&& TREE_CODE (type
) == COMPLEX_TYPE
3461 && targetm
.calls
.split_complex_arg (type
))
3462 num_complex_actuals
++;
3464 type_arg_types
= split_complex_types (TYPE_ARG_TYPES (funtype
));
3467 type_arg_types
= TYPE_ARG_TYPES (funtype
);
3469 if (flags
& ECF_MAY_BE_ALLOCA
)
3470 cfun
->calls_alloca
= 1;
3472 /* If struct_value_rtx is 0, it means pass the address
3473 as if it were an extra parameter. Put the argument expression
3474 in structure_value_addr_value. */
3475 if (structure_value_addr
&& struct_value
== 0)
3477 /* If structure_value_addr is a REG other than
3478 virtual_outgoing_args_rtx, we can use always use it. If it
3479 is not a REG, we must always copy it into a register.
3480 If it is virtual_outgoing_args_rtx, we must copy it to another
3481 register in some cases. */
3482 rtx temp
= (!REG_P (structure_value_addr
)
3483 || (ACCUMULATE_OUTGOING_ARGS
3484 && stack_arg_under_construction
3485 && structure_value_addr
== virtual_outgoing_args_rtx
)
3486 ? copy_addr_to_reg (convert_memory_address
3487 (Pmode
, structure_value_addr
))
3488 : structure_value_addr
);
3490 structure_value_addr_value
=
3491 make_tree (build_pointer_type (TREE_TYPE (funtype
)), temp
);
3492 structure_value_addr_parm
= 1;
3495 /* Count the arguments and set NUM_ACTUALS. */
3497 call_expr_nargs (exp
) + num_complex_actuals
+ structure_value_addr_parm
;
3499 /* Compute number of named args.
3500 First, do a raw count of the args for INIT_CUMULATIVE_ARGS. */
3502 if (type_arg_types
!= 0)
3504 = (list_length (type_arg_types
)
3505 /* Count the struct value address, if it is passed as a parm. */
3506 + structure_value_addr_parm
);
3508 /* If we know nothing, treat all args as named. */
3509 n_named_args
= num_actuals
;
3511 /* Start updating where the next arg would go.
3513 On some machines (such as the PA) indirect calls have a different
3514 calling convention than normal calls. The fourth argument in
3515 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
3517 INIT_CUMULATIVE_ARGS (args_so_far_v
, funtype
, NULL_RTX
, fndecl
, n_named_args
);
3518 args_so_far
= pack_cumulative_args (&args_so_far_v
);
3520 /* Now possibly adjust the number of named args.
3521 Normally, don't include the last named arg if anonymous args follow.
3522 We do include the last named arg if
3523 targetm.calls.strict_argument_naming() returns nonzero.
3524 (If no anonymous args follow, the result of list_length is actually
3525 one too large. This is harmless.)
3527 If targetm.calls.pretend_outgoing_varargs_named() returns
3528 nonzero, and targetm.calls.strict_argument_naming() returns zero,
3529 this machine will be able to place unnamed args that were passed
3530 in registers into the stack. So treat all args as named. This
3531 allows the insns emitting for a specific argument list to be
3532 independent of the function declaration.
3534 If targetm.calls.pretend_outgoing_varargs_named() returns zero,
3535 we do not have any reliable way to pass unnamed args in
3536 registers, so we must force them into memory. */
3538 if (type_arg_types
!= 0
3539 && targetm
.calls
.strict_argument_naming (args_so_far
))
3541 else if (type_arg_types
!= 0
3542 && ! targetm
.calls
.pretend_outgoing_varargs_named (args_so_far
))
3543 /* Don't include the last named arg. */
3546 /* Treat all args as named. */
3547 n_named_args
= num_actuals
;
3549 /* Make a vector to hold all the information about each arg. */
3550 args
= XCNEWVEC (struct arg_data
, num_actuals
);
3552 /* Build up entries in the ARGS array, compute the size of the
3553 arguments into ARGS_SIZE, etc. */
3554 initialize_argument_information (num_actuals
, args
, &args_size
,
3556 structure_value_addr_value
, fndecl
, fntype
,
3557 args_so_far
, reg_parm_stack_space
,
3558 &old_stack_level
, &old_pending_adj
,
3559 &must_preallocate
, &flags
,
3560 &try_tail_call
, CALL_FROM_THUNK_P (exp
));
3563 must_preallocate
= 1;
3565 /* Now make final decision about preallocating stack space. */
3566 must_preallocate
= finalize_must_preallocate (must_preallocate
,
3570 /* If the structure value address will reference the stack pointer, we
3571 must stabilize it. We don't need to do this if we know that we are
3572 not going to adjust the stack pointer in processing this call. */
3574 if (structure_value_addr
3575 && (reg_mentioned_p (virtual_stack_dynamic_rtx
, structure_value_addr
)
3576 || reg_mentioned_p (virtual_outgoing_args_rtx
,
3577 structure_value_addr
))
3579 || (!ACCUMULATE_OUTGOING_ARGS
3580 && maybe_ne (args_size
.constant
, 0))))
3581 structure_value_addr
= copy_to_reg (structure_value_addr
);
3583 /* Tail calls can make things harder to debug, and we've traditionally
3584 pushed these optimizations into -O2. Don't try if we're already
3585 expanding a call, as that means we're an argument. Don't try if
3586 there's cleanups, as we know there's code to follow the call. */
3588 if (currently_expanding_call
++ != 0
3589 || !flag_optimize_sibling_calls
3591 || dbg_cnt (tail_call
) == false)
3594 /* If the user has marked the function as requiring tail-call
3595 optimization, attempt it. */
3599 /* Rest of purposes for tail call optimizations to fail. */
3601 try_tail_call
= can_implement_as_sibling_call_p (exp
,
3602 structure_value_addr
,
3604 reg_parm_stack_space
,
3606 flags
, addr
, args_size
);
3608 /* Check if caller and callee disagree in promotion of function
3612 machine_mode caller_mode
, caller_promoted_mode
;
3613 machine_mode callee_mode
, callee_promoted_mode
;
3614 int caller_unsignedp
, callee_unsignedp
;
3615 tree caller_res
= DECL_RESULT (current_function_decl
);
3617 caller_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (caller_res
));
3618 caller_mode
= DECL_MODE (caller_res
);
3619 callee_unsignedp
= TYPE_UNSIGNED (TREE_TYPE (funtype
));
3620 callee_mode
= TYPE_MODE (TREE_TYPE (funtype
));
3621 caller_promoted_mode
3622 = promote_function_mode (TREE_TYPE (caller_res
), caller_mode
,
3624 TREE_TYPE (current_function_decl
), 1);
3625 callee_promoted_mode
3626 = promote_function_mode (TREE_TYPE (funtype
), callee_mode
,
3629 if (caller_mode
!= VOIDmode
3630 && (caller_promoted_mode
!= callee_promoted_mode
3631 || ((caller_mode
!= caller_promoted_mode
3632 || callee_mode
!= callee_promoted_mode
)
3633 && (caller_unsignedp
!= callee_unsignedp
3634 || partial_subreg_p (caller_mode
, callee_mode
)))))
3637 maybe_complain_about_tail_call (exp
,
3638 "caller and callee disagree in"
3639 " promotion of function"
3644 /* Ensure current function's preferred stack boundary is at least
3645 what we need. Stack alignment may also increase preferred stack
3647 if (crtl
->preferred_stack_boundary
< preferred_stack_boundary
)
3648 crtl
->preferred_stack_boundary
= preferred_stack_boundary
;
3650 preferred_stack_boundary
= crtl
->preferred_stack_boundary
;
3652 preferred_unit_stack_boundary
= preferred_stack_boundary
/ BITS_PER_UNIT
;
3654 /* We want to make two insn chains; one for a sibling call, the other
3655 for a normal call. We will select one of the two chains after
3656 initial RTL generation is complete. */
3657 for (pass
= try_tail_call
? 0 : 1; pass
< 2; pass
++)
3659 int sibcall_failure
= 0;
3660 /* We want to emit any pending stack adjustments before the tail
3661 recursion "call". That way we know any adjustment after the tail
3662 recursion call can be ignored if we indeed use the tail
3664 saved_pending_stack_adjust save
;
3665 rtx_insn
*insns
, *before_call
, *after_args
;
3670 /* State variables we need to save and restore between
3672 save_pending_stack_adjust (&save
);
3675 flags
&= ~ECF_SIBCALL
;
3677 flags
|= ECF_SIBCALL
;
3679 /* Other state variables that we must reinitialize each time
3680 through the loop (that are not initialized by the loop itself). */
3684 /* Start a new sequence for the normal call case.
3686 From this point on, if the sibling call fails, we want to set
3687 sibcall_failure instead of continuing the loop. */
3690 /* Don't let pending stack adjusts add up to too much.
3691 Also, do all pending adjustments now if there is any chance
3692 this might be a call to alloca or if we are expanding a sibling
3694 Also do the adjustments before a throwing call, otherwise
3695 exception handling can fail; PR 19225. */
3696 if (maybe_ge (pending_stack_adjust
, 32)
3697 || (maybe_ne (pending_stack_adjust
, 0)
3698 && (flags
& ECF_MAY_BE_ALLOCA
))
3699 || (maybe_ne (pending_stack_adjust
, 0)
3700 && flag_exceptions
&& !(flags
& ECF_NOTHROW
))
3702 do_pending_stack_adjust ();
3704 /* Precompute any arguments as needed. */
3706 precompute_arguments (num_actuals
, args
);
3708 /* Now we are about to start emitting insns that can be deleted
3709 if a libcall is deleted. */
3710 if (pass
&& (flags
& ECF_MALLOC
))
3714 && crtl
->stack_protect_guard
3715 && targetm
.stack_protect_runtime_enabled_p ())
3716 stack_protect_epilogue ();
3718 adjusted_args_size
= args_size
;
3719 /* Compute the actual size of the argument block required. The variable
3720 and constant sizes must be combined, the size may have to be rounded,
3721 and there may be a minimum required size. When generating a sibcall
3722 pattern, do not round up, since we'll be re-using whatever space our
3724 unadjusted_args_size
3725 = compute_argument_block_size (reg_parm_stack_space
,
3726 &adjusted_args_size
,
3729 : preferred_stack_boundary
));
3731 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
3733 /* The argument block when performing a sibling call is the
3734 incoming argument block. */
3737 argblock
= crtl
->args
.internal_arg_pointer
;
3738 if (STACK_GROWS_DOWNWARD
)
3740 = plus_constant (Pmode
, argblock
, crtl
->args
.pretend_args_size
);
3743 = plus_constant (Pmode
, argblock
, -crtl
->args
.pretend_args_size
);
3745 HOST_WIDE_INT map_size
= constant_lower_bound (args_size
.constant
);
3746 stored_args_map
= sbitmap_alloc (map_size
);
3747 bitmap_clear (stored_args_map
);
3748 stored_args_watermark
= HOST_WIDE_INT_M1U
;
3751 /* If we have no actual push instructions, or shouldn't use them,
3752 make space for all args right now. */
3753 else if (adjusted_args_size
.var
!= 0)
3755 if (old_stack_level
== 0)
3757 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
3758 old_stack_pointer_delta
= stack_pointer_delta
;
3759 old_pending_adj
= pending_stack_adjust
;
3760 pending_stack_adjust
= 0;
3761 /* stack_arg_under_construction says whether a stack arg is
3762 being constructed at the old stack level. Pushing the stack
3763 gets a clean outgoing argument block. */
3764 old_stack_arg_under_construction
= stack_arg_under_construction
;
3765 stack_arg_under_construction
= 0;
3767 argblock
= push_block (ARGS_SIZE_RTX (adjusted_args_size
), 0, 0);
3768 if (flag_stack_usage_info
)
3769 current_function_has_unbounded_dynamic_stack_size
= 1;
3773 /* Note that we must go through the motions of allocating an argument
3774 block even if the size is zero because we may be storing args
3775 in the area reserved for register arguments, which may be part of
3778 poly_int64 needed
= adjusted_args_size
.constant
;
3780 /* Store the maximum argument space used. It will be pushed by
3781 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
3784 crtl
->outgoing_args_size
= upper_bound (crtl
->outgoing_args_size
,
3787 if (must_preallocate
)
3789 if (ACCUMULATE_OUTGOING_ARGS
)
3791 /* Since the stack pointer will never be pushed, it is
3792 possible for the evaluation of a parm to clobber
3793 something we have already written to the stack.
3794 Since most function calls on RISC machines do not use
3795 the stack, this is uncommon, but must work correctly.
3797 Therefore, we save any area of the stack that was already
3798 written and that we are using. Here we set up to do this
3799 by making a new stack usage map from the old one. The
3800 actual save will be done by store_one_arg.
3802 Another approach might be to try to reorder the argument
3803 evaluations to avoid this conflicting stack usage. */
3805 /* Since we will be writing into the entire argument area,
3806 the map must be allocated for its entire size, not just
3807 the part that is the responsibility of the caller. */
3808 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
3809 needed
+= reg_parm_stack_space
;
3811 poly_int64 limit
= needed
;
3812 if (ARGS_GROW_DOWNWARD
)
3815 /* For polynomial sizes, this is the maximum possible
3816 size needed for arguments with a constant size
3818 HOST_WIDE_INT const_limit
= constant_lower_bound (limit
);
3819 highest_outgoing_arg_in_use
3820 = MAX (initial_highest_arg_in_use
, const_limit
);
3822 free (stack_usage_map_buf
);
3823 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
3824 stack_usage_map
= stack_usage_map_buf
;
3826 if (initial_highest_arg_in_use
)
3827 memcpy (stack_usage_map
, initial_stack_usage_map
,
3828 initial_highest_arg_in_use
);
3830 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
3831 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
3832 (highest_outgoing_arg_in_use
3833 - initial_highest_arg_in_use
));
3836 /* The address of the outgoing argument list must not be
3837 copied to a register here, because argblock would be left
3838 pointing to the wrong place after the call to
3839 allocate_dynamic_stack_space below. */
3841 argblock
= virtual_outgoing_args_rtx
;
3845 /* Try to reuse some or all of the pending_stack_adjust
3846 to get this space. */
3847 if (inhibit_defer_pop
== 0
3848 && (combine_pending_stack_adjustment_and_call
3850 unadjusted_args_size
,
3851 &adjusted_args_size
,
3852 preferred_unit_stack_boundary
)))
3854 /* combine_pending_stack_adjustment_and_call computes
3855 an adjustment before the arguments are allocated.
3856 Account for them and see whether or not the stack
3857 needs to go up or down. */
3858 needed
= unadjusted_args_size
- needed
;
3861 combine_pending_stack_adjustment_and_call. */
3862 gcc_checking_assert (ordered_p (needed
, 0));
3863 if (maybe_lt (needed
, 0))
3865 /* We're releasing stack space. */
3866 /* ??? We can avoid any adjustment at all if we're
3867 already aligned. FIXME. */
3868 pending_stack_adjust
= -needed
;
3869 do_pending_stack_adjust ();
3873 /* We need to allocate space. We'll do that in
3874 push_block below. */
3875 pending_stack_adjust
= 0;
3878 /* Special case this because overhead of `push_block' in
3879 this case is non-trivial. */
3880 if (known_eq (needed
, 0))
3881 argblock
= virtual_outgoing_args_rtx
;
3884 rtx needed_rtx
= gen_int_mode (needed
, Pmode
);
3885 argblock
= push_block (needed_rtx
, 0, 0);
3886 if (ARGS_GROW_DOWNWARD
)
3887 argblock
= plus_constant (Pmode
, argblock
, needed
);
3890 /* We only really need to call `copy_to_reg' in the case
3891 where push insns are going to be used to pass ARGBLOCK
3892 to a function call in ARGS. In that case, the stack
3893 pointer changes value from the allocation point to the
3894 call point, and hence the value of
3895 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
3896 as well always do it. */
3897 argblock
= copy_to_reg (argblock
);
3902 if (ACCUMULATE_OUTGOING_ARGS
)
3904 /* The save/restore code in store_one_arg handles all
3905 cases except one: a constructor call (including a C
3906 function returning a BLKmode struct) to initialize
3908 if (stack_arg_under_construction
)
3912 (adjusted_args_size
.constant
3913 + (OUTGOING_REG_PARM_STACK_SPACE (!fndecl
? fntype
3914 : TREE_TYPE (fndecl
))
3915 ? 0 : reg_parm_stack_space
), Pmode
));
3916 if (old_stack_level
== 0)
3918 emit_stack_save (SAVE_BLOCK
, &old_stack_level
);
3919 old_stack_pointer_delta
= stack_pointer_delta
;
3920 old_pending_adj
= pending_stack_adjust
;
3921 pending_stack_adjust
= 0;
3922 /* stack_arg_under_construction says whether a stack
3923 arg is being constructed at the old stack level.
3924 Pushing the stack gets a clean outgoing argument
3926 old_stack_arg_under_construction
3927 = stack_arg_under_construction
;
3928 stack_arg_under_construction
= 0;
3929 /* Make a new map for the new argument list. */
3930 free (stack_usage_map_buf
);
3931 stack_usage_map_buf
= XCNEWVEC (char, highest_outgoing_arg_in_use
);
3932 stack_usage_map
= stack_usage_map_buf
;
3933 highest_outgoing_arg_in_use
= 0;
3934 stack_usage_watermark
= HOST_WIDE_INT_M1U
;
3936 /* We can pass TRUE as the 4th argument because we just
3937 saved the stack pointer and will restore it right after
3939 allocate_dynamic_stack_space (push_size
, 0, BIGGEST_ALIGNMENT
,
3943 /* If argument evaluation might modify the stack pointer,
3944 copy the address of the argument list to a register. */
3945 for (i
= 0; i
< num_actuals
; i
++)
3946 if (args
[i
].pass_on_stack
)
3948 argblock
= copy_addr_to_reg (argblock
);
3953 compute_argument_addresses (args
, argblock
, num_actuals
);
3955 /* Stack is properly aligned, pops can't safely be deferred during
3956 the evaluation of the arguments. */
3959 /* Precompute all register parameters. It isn't safe to compute
3960 anything once we have started filling any specific hard regs.
3961 TLS symbols sometimes need a call to resolve. Precompute
3962 register parameters before any stack pointer manipulation
3963 to avoid unaligned stack in the called function. */
3964 precompute_register_parameters (num_actuals
, args
, ®_parm_seen
);
3968 /* Perform stack alignment before the first push (the last arg). */
3970 && maybe_gt (adjusted_args_size
.constant
, reg_parm_stack_space
)
3971 && maybe_ne (adjusted_args_size
.constant
, unadjusted_args_size
))
3973 /* When the stack adjustment is pending, we get better code
3974 by combining the adjustments. */
3975 if (maybe_ne (pending_stack_adjust
, 0)
3976 && ! inhibit_defer_pop
3977 && (combine_pending_stack_adjustment_and_call
3978 (&pending_stack_adjust
,
3979 unadjusted_args_size
,
3980 &adjusted_args_size
,
3981 preferred_unit_stack_boundary
)))
3982 do_pending_stack_adjust ();
3983 else if (argblock
== 0)
3984 anti_adjust_stack (gen_int_mode (adjusted_args_size
.constant
3985 - unadjusted_args_size
,
3988 /* Now that the stack is properly aligned, pops can't safely
3989 be deferred during the evaluation of the arguments. */
3992 /* Record the maximum pushed stack space size. We need to delay
3993 doing it this far to take into account the optimization done
3994 by combine_pending_stack_adjustment_and_call. */
3995 if (flag_stack_usage_info
3996 && !ACCUMULATE_OUTGOING_ARGS
3998 && adjusted_args_size
.var
== 0)
4000 poly_int64 pushed
= (adjusted_args_size
.constant
4001 + pending_stack_adjust
);
4002 current_function_pushed_stack_size
4003 = upper_bound (current_function_pushed_stack_size
, pushed
);
4006 funexp
= rtx_for_function_call (fndecl
, addr
);
4008 if (CALL_EXPR_STATIC_CHAIN (exp
))
4009 static_chain_value
= expand_normal (CALL_EXPR_STATIC_CHAIN (exp
));
4011 static_chain_value
= 0;
4013 #ifdef REG_PARM_STACK_SPACE
4014 /* Save the fixed argument area if it's part of the caller's frame and
4015 is clobbered by argument setup for this call. */
4016 if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
4017 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
4018 &low_to_save
, &high_to_save
);
4021 /* Now store (and compute if necessary) all non-register parms.
4022 These come before register parms, since they can require block-moves,
4023 which could clobber the registers used for register parms.
4024 Parms which have partial registers are not stored here,
4025 but we do preallocate space here if they want that. */
4027 for (i
= 0; i
< num_actuals
; i
++)
4029 if (args
[i
].reg
== 0 || args
[i
].pass_on_stack
)
4031 rtx_insn
*before_arg
= get_last_insn ();
4033 /* We don't allow passing huge (> 2^30 B) arguments
4034 by value. It would cause an overflow later on. */
4035 if (constant_lower_bound (adjusted_args_size
.constant
)
4036 >= (1 << (HOST_BITS_PER_INT
- 2)))
4038 sorry ("passing too large argument on stack");
4042 if (store_one_arg (&args
[i
], argblock
, flags
,
4043 adjusted_args_size
.var
!= 0,
4044 reg_parm_stack_space
)
4046 && check_sibcall_argument_overlap (before_arg
,
4048 sibcall_failure
= 1;
4053 = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
4054 gen_rtx_USE (VOIDmode
, args
[i
].stack
),
4058 /* If we have a parm that is passed in registers but not in memory
4059 and whose alignment does not permit a direct copy into registers,
4060 make a group of pseudos that correspond to each register that we
4062 if (STRICT_ALIGNMENT
)
4063 store_unaligned_arguments_into_pseudos (args
, num_actuals
);
4065 /* Now store any partially-in-registers parm.
4066 This is the last place a block-move can happen. */
4068 for (i
= 0; i
< num_actuals
; i
++)
4069 if (args
[i
].partial
!= 0 && ! args
[i
].pass_on_stack
)
4071 rtx_insn
*before_arg
= get_last_insn ();
4073 /* On targets with weird calling conventions (e.g. PA) it's
4074 hard to ensure that all cases of argument overlap between
4075 stack and registers work. Play it safe and bail out. */
4076 if (ARGS_GROW_DOWNWARD
&& !STACK_GROWS_DOWNWARD
)
4078 sibcall_failure
= 1;
4082 if (store_one_arg (&args
[i
], argblock
, flags
,
4083 adjusted_args_size
.var
!= 0,
4084 reg_parm_stack_space
)
4086 && check_sibcall_argument_overlap (before_arg
,
4088 sibcall_failure
= 1;
4091 bool any_regs
= false;
4092 for (i
= 0; i
< num_actuals
; i
++)
4093 if (args
[i
].reg
!= NULL_RTX
)
4096 targetm
.calls
.call_args (args
[i
].reg
, funtype
);
4099 targetm
.calls
.call_args (pc_rtx
, funtype
);
4101 /* Figure out the register where the value, if any, will come back. */
4103 if (TYPE_MODE (rettype
) != VOIDmode
4104 && ! structure_value_addr
)
4106 if (pcc_struct_value
)
4107 valreg
= hard_function_value (build_pointer_type (rettype
),
4108 fndecl
, NULL
, (pass
== 0));
4110 valreg
= hard_function_value (rettype
, fndecl
, fntype
,
4113 /* If VALREG is a PARALLEL whose first member has a zero
4114 offset, use that. This is for targets such as m68k that
4115 return the same value in multiple places. */
4116 if (GET_CODE (valreg
) == PARALLEL
)
4118 rtx elem
= XVECEXP (valreg
, 0, 0);
4119 rtx where
= XEXP (elem
, 0);
4120 rtx offset
= XEXP (elem
, 1);
4121 if (offset
== const0_rtx
4122 && GET_MODE (where
) == GET_MODE (valreg
))
4127 /* If register arguments require space on the stack and stack space
4128 was not preallocated, allocate stack space here for arguments
4129 passed in registers. */
4130 if (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
)))
4131 && !ACCUMULATE_OUTGOING_ARGS
4132 && must_preallocate
== 0 && reg_parm_stack_space
> 0)
4133 anti_adjust_stack (GEN_INT (reg_parm_stack_space
));
4135 /* Pass the function the address in which to return a
4137 if (pass
!= 0 && structure_value_addr
&& ! structure_value_addr_parm
)
4139 structure_value_addr
4140 = convert_memory_address (Pmode
, structure_value_addr
);
4141 emit_move_insn (struct_value
,
4143 force_operand (structure_value_addr
,
4146 if (REG_P (struct_value
))
4147 use_reg (&call_fusage
, struct_value
);
4150 after_args
= get_last_insn ();
4151 funexp
= prepare_call_address (fndecl
? fndecl
: fntype
, funexp
,
4152 static_chain_value
, &call_fusage
,
4153 reg_parm_seen
, flags
);
4155 load_register_parameters (args
, num_actuals
, &call_fusage
, flags
,
4156 pass
== 0, &sibcall_failure
);
4158 /* Save a pointer to the last insn before the call, so that we can
4159 later safely search backwards to find the CALL_INSN. */
4160 before_call
= get_last_insn ();
4162 /* Set up next argument register. For sibling calls on machines
4163 with register windows this should be the incoming register. */
4165 next_arg_reg
= targetm
.calls
.function_incoming_arg (args_so_far
,
4170 next_arg_reg
= targetm
.calls
.function_arg (args_so_far
,
4171 VOIDmode
, void_type_node
,
4174 if (pass
== 1 && (return_flags
& ERF_RETURNS_ARG
))
4176 int arg_nr
= return_flags
& ERF_RETURN_ARG_MASK
;
4177 arg_nr
= num_actuals
- arg_nr
- 1;
4179 && arg_nr
< num_actuals
4183 && GET_MODE (args
[arg_nr
].reg
) == GET_MODE (valreg
))
4185 = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args
[arg_nr
].tree_value
)),
4186 gen_rtx_SET (valreg
, args
[arg_nr
].reg
),
4189 /* All arguments and registers used for the call must be set up by
4192 /* Stack must be properly aligned now. */
4194 || multiple_p (stack_pointer_delta
,
4195 preferred_unit_stack_boundary
));
4197 /* Generate the actual call instruction. */
4198 emit_call_1 (funexp
, exp
, fndecl
, funtype
, unadjusted_args_size
,
4199 adjusted_args_size
.constant
, struct_value_size
,
4200 next_arg_reg
, valreg
, old_inhibit_defer_pop
, call_fusage
,
4201 flags
, args_so_far
);
4205 rtx_call_insn
*last
;
4206 rtx datum
= NULL_RTX
;
4207 if (fndecl
!= NULL_TREE
)
4209 datum
= XEXP (DECL_RTL (fndecl
), 0);
4210 gcc_assert (datum
!= NULL_RTX
4211 && GET_CODE (datum
) == SYMBOL_REF
);
4213 last
= last_call_insn ();
4214 add_reg_note (last
, REG_CALL_DECL
, datum
);
4217 /* If the call setup or the call itself overlaps with anything
4218 of the argument setup we probably clobbered our call address.
4219 In that case we can't do sibcalls. */
4221 && check_sibcall_argument_overlap (after_args
, 0, 0))
4222 sibcall_failure
= 1;
4224 /* If a non-BLKmode value is returned at the most significant end
4225 of a register, shift the register right by the appropriate amount
4226 and update VALREG accordingly. BLKmode values are handled by the
4227 group load/store machinery below. */
4228 if (!structure_value_addr
4229 && !pcc_struct_value
4230 && TYPE_MODE (rettype
) != VOIDmode
4231 && TYPE_MODE (rettype
) != BLKmode
4233 && targetm
.calls
.return_in_msb (rettype
))
4235 if (shift_return_value (TYPE_MODE (rettype
), false, valreg
))
4236 sibcall_failure
= 1;
4237 valreg
= gen_rtx_REG (TYPE_MODE (rettype
), REGNO (valreg
));
4240 if (pass
&& (flags
& ECF_MALLOC
))
4242 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
4243 rtx_insn
*last
, *insns
;
4245 /* The return value from a malloc-like function is a pointer. */
4246 if (TREE_CODE (rettype
) == POINTER_TYPE
)
4247 mark_reg_pointer (temp
, MALLOC_ABI_ALIGNMENT
);
4249 emit_move_insn (temp
, valreg
);
4251 /* The return value from a malloc-like function can not alias
4253 last
= get_last_insn ();
4254 add_reg_note (last
, REG_NOALIAS
, temp
);
4256 /* Write out the sequence. */
4257 insns
= get_insns ();
4263 /* For calls to `setjmp', etc., inform
4264 function.c:setjmp_warnings that it should complain if
4265 nonvolatile values are live. For functions that cannot
4266 return, inform flow that control does not fall through. */
4268 if ((flags
& ECF_NORETURN
) || pass
== 0)
4270 /* The barrier must be emitted
4271 immediately after the CALL_INSN. Some ports emit more
4272 than just a CALL_INSN above, so we must search for it here. */
4274 rtx_insn
*last
= get_last_insn ();
4275 while (!CALL_P (last
))
4277 last
= PREV_INSN (last
);
4278 /* There was no CALL_INSN? */
4279 gcc_assert (last
!= before_call
);
4282 emit_barrier_after (last
);
4284 /* Stack adjustments after a noreturn call are dead code.
4285 However when NO_DEFER_POP is in effect, we must preserve
4286 stack_pointer_delta. */
4287 if (inhibit_defer_pop
== 0)
4289 stack_pointer_delta
= old_stack_allocated
;
4290 pending_stack_adjust
= 0;
4294 /* If value type not void, return an rtx for the value. */
4296 if (TYPE_MODE (rettype
) == VOIDmode
4298 target
= const0_rtx
;
4299 else if (structure_value_addr
)
4301 if (target
== 0 || !MEM_P (target
))
4304 = gen_rtx_MEM (TYPE_MODE (rettype
),
4305 memory_address (TYPE_MODE (rettype
),
4306 structure_value_addr
));
4307 set_mem_attributes (target
, rettype
, 1);
4310 else if (pcc_struct_value
)
4312 /* This is the special C++ case where we need to
4313 know what the true target was. We take care to
4314 never use this value more than once in one expression. */
4315 target
= gen_rtx_MEM (TYPE_MODE (rettype
),
4316 copy_to_reg (valreg
));
4317 set_mem_attributes (target
, rettype
, 1);
4319 /* Handle calls that return values in multiple non-contiguous locations.
4320 The Irix 6 ABI has examples of this. */
4321 else if (GET_CODE (valreg
) == PARALLEL
)
4324 target
= emit_group_move_into_temps (valreg
);
4325 else if (rtx_equal_p (target
, valreg
))
4327 else if (GET_CODE (target
) == PARALLEL
)
4328 /* Handle the result of a emit_group_move_into_temps
4329 call in the previous pass. */
4330 emit_group_move (target
, valreg
);
4332 emit_group_store (target
, valreg
, rettype
,
4333 int_size_in_bytes (rettype
));
4336 && GET_MODE (target
) == TYPE_MODE (rettype
)
4337 && GET_MODE (target
) == GET_MODE (valreg
))
4339 bool may_overlap
= false;
4341 /* We have to copy a return value in a CLASS_LIKELY_SPILLED hard
4342 reg to a plain register. */
4343 if (!REG_P (target
) || HARD_REGISTER_P (target
))
4344 valreg
= avoid_likely_spilled_reg (valreg
);
4346 /* If TARGET is a MEM in the argument area, and we have
4347 saved part of the argument area, then we can't store
4348 directly into TARGET as it may get overwritten when we
4349 restore the argument save area below. Don't work too
4350 hard though and simply force TARGET to a register if it
4351 is a MEM; the optimizer is quite likely to sort it out. */
4352 if (ACCUMULATE_OUTGOING_ARGS
&& pass
&& MEM_P (target
))
4353 for (i
= 0; i
< num_actuals
; i
++)
4354 if (args
[i
].save_area
)
4361 target
= copy_to_reg (valreg
);
4364 /* TARGET and VALREG cannot be equal at this point
4365 because the latter would not have
4366 REG_FUNCTION_VALUE_P true, while the former would if
4367 it were referring to the same register.
4369 If they refer to the same register, this move will be
4370 a no-op, except when function inlining is being
4372 emit_move_insn (target
, valreg
);
4374 /* If we are setting a MEM, this code must be executed.
4375 Since it is emitted after the call insn, sibcall
4376 optimization cannot be performed in that case. */
4378 sibcall_failure
= 1;
4382 target
= copy_to_reg (avoid_likely_spilled_reg (valreg
));
4384 /* If we promoted this return value, make the proper SUBREG.
4385 TARGET might be const0_rtx here, so be careful. */
4387 && TYPE_MODE (rettype
) != BLKmode
4388 && GET_MODE (target
) != TYPE_MODE (rettype
))
4390 tree type
= rettype
;
4391 int unsignedp
= TYPE_UNSIGNED (type
);
4394 /* Ensure we promote as expected, and get the new unsignedness. */
4395 pmode
= promote_function_mode (type
, TYPE_MODE (type
), &unsignedp
,
4397 gcc_assert (GET_MODE (target
) == pmode
);
4399 poly_uint64 offset
= subreg_lowpart_offset (TYPE_MODE (type
),
4401 target
= gen_rtx_SUBREG (TYPE_MODE (type
), target
, offset
);
4402 SUBREG_PROMOTED_VAR_P (target
) = 1;
4403 SUBREG_PROMOTED_SET (target
, unsignedp
);
4406 /* If size of args is variable or this was a constructor call for a stack
4407 argument, restore saved stack-pointer value. */
4409 if (old_stack_level
)
4411 rtx_insn
*prev
= get_last_insn ();
4413 emit_stack_restore (SAVE_BLOCK
, old_stack_level
);
4414 stack_pointer_delta
= old_stack_pointer_delta
;
4416 fixup_args_size_notes (prev
, get_last_insn (), stack_pointer_delta
);
4418 pending_stack_adjust
= old_pending_adj
;
4419 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
4420 stack_arg_under_construction
= old_stack_arg_under_construction
;
4421 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
4422 stack_usage_map
= initial_stack_usage_map
;
4423 stack_usage_watermark
= initial_stack_usage_watermark
;
4424 sibcall_failure
= 1;
4426 else if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
4428 #ifdef REG_PARM_STACK_SPACE
4430 restore_fixed_argument_area (save_area
, argblock
,
4431 high_to_save
, low_to_save
);
4434 /* If we saved any argument areas, restore them. */
4435 for (i
= 0; i
< num_actuals
; i
++)
4436 if (args
[i
].save_area
)
4438 machine_mode save_mode
= GET_MODE (args
[i
].save_area
);
4440 = gen_rtx_MEM (save_mode
,
4441 memory_address (save_mode
,
4442 XEXP (args
[i
].stack_slot
, 0)));
4444 if (save_mode
!= BLKmode
)
4445 emit_move_insn (stack_area
, args
[i
].save_area
);
4447 emit_block_move (stack_area
, args
[i
].save_area
,
4449 (args
[i
].locate
.size
.constant
, Pmode
)),
4450 BLOCK_OP_CALL_PARM
);
4453 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
4454 stack_usage_map
= initial_stack_usage_map
;
4455 stack_usage_watermark
= initial_stack_usage_watermark
;
4458 /* If this was alloca, record the new stack level. */
4459 if (flags
& ECF_MAY_BE_ALLOCA
)
4460 record_new_stack_level ();
4462 /* Free up storage we no longer need. */
4463 for (i
= 0; i
< num_actuals
; ++i
)
4464 free (args
[i
].aligned_regs
);
4466 targetm
.calls
.end_call_args ();
4468 insns
= get_insns ();
4473 tail_call_insns
= insns
;
4475 /* Restore the pending stack adjustment now that we have
4476 finished generating the sibling call sequence. */
4478 restore_pending_stack_adjust (&save
);
4480 /* Prepare arg structure for next iteration. */
4481 for (i
= 0; i
< num_actuals
; i
++)
4484 args
[i
].aligned_regs
= 0;
4488 sbitmap_free (stored_args_map
);
4489 internal_arg_pointer_exp_state
.scan_start
= NULL
;
4490 internal_arg_pointer_exp_state
.cache
.release ();
4494 normal_call_insns
= insns
;
4496 /* Verify that we've deallocated all the stack we used. */
4497 gcc_assert ((flags
& ECF_NORETURN
)
4498 || known_eq (old_stack_allocated
,
4500 - pending_stack_adjust
));
4503 /* If something prevents making this a sibling call,
4504 zero out the sequence. */
4505 if (sibcall_failure
)
4506 tail_call_insns
= NULL
;
4511 /* If tail call production succeeded, we need to remove REG_EQUIV notes on
4512 arguments too, as argument area is now clobbered by the call. */
4513 if (tail_call_insns
)
4515 emit_insn (tail_call_insns
);
4516 crtl
->tail_call_emit
= true;
4520 emit_insn (normal_call_insns
);
4522 /* Ideally we'd emit a message for all of the ways that it could
4524 maybe_complain_about_tail_call (exp
, "tail call production failed");
4527 currently_expanding_call
--;
4529 free (stack_usage_map_buf
);
4534 /* A sibling call sequence invalidates any REG_EQUIV notes made for
4535 this function's incoming arguments.
4537 At the start of RTL generation we know the only REG_EQUIV notes
4538 in the rtl chain are those for incoming arguments, so we can look
4539 for REG_EQUIV notes between the start of the function and the
4540 NOTE_INSN_FUNCTION_BEG.
4542 This is (slight) overkill. We could keep track of the highest
4543 argument we clobber and be more selective in removing notes, but it
4544 does not seem to be worth the effort. */
4547 fixup_tail_calls (void)
4551 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4555 /* There are never REG_EQUIV notes for the incoming arguments
4556 after the NOTE_INSN_FUNCTION_BEG note, so stop if we see it. */
4558 && NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
)
4561 note
= find_reg_note (insn
, REG_EQUIV
, 0);
4563 remove_note (insn
, note
);
4564 note
= find_reg_note (insn
, REG_EQUIV
, 0);
4569 /* Traverse a list of TYPES and expand all complex types into their
4572 split_complex_types (tree types
)
4576 /* Before allocating memory, check for the common case of no complex. */
4577 for (p
= types
; p
; p
= TREE_CHAIN (p
))
4579 tree type
= TREE_VALUE (p
);
4580 if (TREE_CODE (type
) == COMPLEX_TYPE
4581 && targetm
.calls
.split_complex_arg (type
))
4587 types
= copy_list (types
);
4589 for (p
= types
; p
; p
= TREE_CHAIN (p
))
4591 tree complex_type
= TREE_VALUE (p
);
4593 if (TREE_CODE (complex_type
) == COMPLEX_TYPE
4594 && targetm
.calls
.split_complex_arg (complex_type
))
4598 /* Rewrite complex type with component type. */
4599 TREE_VALUE (p
) = TREE_TYPE (complex_type
);
4600 next
= TREE_CHAIN (p
);
4602 /* Add another component type for the imaginary part. */
4603 imag
= build_tree_list (NULL_TREE
, TREE_VALUE (p
));
4604 TREE_CHAIN (p
) = imag
;
4605 TREE_CHAIN (imag
) = next
;
4607 /* Skip the newly created node. */
4615 /* Output a library call to function ORGFUN (a SYMBOL_REF rtx)
4616 for a value of mode OUTMODE,
4617 with NARGS different arguments, passed as ARGS.
4618 Store the return value if RETVAL is nonzero: store it in VALUE if
4619 VALUE is nonnull, otherwise pick a convenient location. In either
4620 case return the location of the stored value.
4622 FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for
4623 `const' calls, LCT_PURE for `pure' calls, or another LCT_ value for
4624 other types of library calls. */
4627 emit_library_call_value_1 (int retval
, rtx orgfun
, rtx value
,
4628 enum libcall_type fn_type
,
4629 machine_mode outmode
, int nargs
, rtx_mode_t
*args
)
4631 /* Total size in bytes of all the stack-parms scanned so far. */
4632 struct args_size args_size
;
4633 /* Size of arguments before any adjustments (such as rounding). */
4634 struct args_size original_args_size
;
4637 /* Todo, choose the correct decl type of orgfun. Sadly this information
4638 isn't present here, so we default to native calling abi here. */
4639 tree fndecl ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
4640 tree fntype ATTRIBUTE_UNUSED
= NULL_TREE
; /* library calls default to host calling abi ? */
4643 CUMULATIVE_ARGS args_so_far_v
;
4644 cumulative_args_t args_so_far
;
4651 struct locate_and_pad_arg_data locate
;
4655 int old_inhibit_defer_pop
= inhibit_defer_pop
;
4656 rtx call_fusage
= 0;
4659 int pcc_struct_value
= 0;
4660 poly_int64 struct_value_size
= 0;
4662 int reg_parm_stack_space
= 0;
4664 rtx_insn
*before_call
;
4665 bool have_push_fusage
;
4666 tree tfom
; /* type_for_mode (outmode, 0) */
4668 #ifdef REG_PARM_STACK_SPACE
4669 /* Define the boundary of the register parm stack space that needs to be
4671 int low_to_save
= 0, high_to_save
= 0;
4672 rtx save_area
= 0; /* Place that it is saved. */
4675 /* Size of the stack reserved for parameter registers. */
4676 unsigned int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
4677 char *initial_stack_usage_map
= stack_usage_map
;
4678 unsigned HOST_WIDE_INT initial_stack_usage_watermark
= stack_usage_watermark
;
4679 char *stack_usage_map_buf
= NULL
;
4681 rtx struct_value
= targetm
.calls
.struct_value_rtx (0, 0);
4683 #ifdef REG_PARM_STACK_SPACE
4684 reg_parm_stack_space
= REG_PARM_STACK_SPACE ((tree
) 0);
4687 /* By default, library functions cannot throw. */
4688 flags
= ECF_NOTHROW
;
4701 flags
|= ECF_NORETURN
;
4704 flags
&= ~ECF_NOTHROW
;
4706 case LCT_RETURNS_TWICE
:
4707 flags
= ECF_RETURNS_TWICE
;
4712 /* Ensure current function's preferred stack boundary is at least
4714 if (crtl
->preferred_stack_boundary
< PREFERRED_STACK_BOUNDARY
)
4715 crtl
->preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
4717 /* If this kind of value comes back in memory,
4718 decide where in memory it should come back. */
4719 if (outmode
!= VOIDmode
)
4721 tfom
= lang_hooks
.types
.type_for_mode (outmode
, 0);
4722 if (aggregate_value_p (tfom
, 0))
4724 #ifdef PCC_STATIC_STRUCT_RETURN
4726 = hard_function_value (build_pointer_type (tfom
), 0, 0, 0);
4727 mem_value
= gen_rtx_MEM (outmode
, pointer_reg
);
4728 pcc_struct_value
= 1;
4730 value
= gen_reg_rtx (outmode
);
4731 #else /* not PCC_STATIC_STRUCT_RETURN */
4732 struct_value_size
= GET_MODE_SIZE (outmode
);
4733 if (value
!= 0 && MEM_P (value
))
4736 mem_value
= assign_temp (tfom
, 1, 1);
4738 /* This call returns a big structure. */
4739 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
);
4743 tfom
= void_type_node
;
4745 /* ??? Unfinished: must pass the memory address as an argument. */
4747 /* Copy all the libcall-arguments out of the varargs data
4748 and into a vector ARGVEC.
4750 Compute how to pass each argument. We only support a very small subset
4751 of the full argument passing conventions to limit complexity here since
4752 library functions shouldn't have many args. */
4754 argvec
= XALLOCAVEC (struct arg
, nargs
+ 1);
4755 memset (argvec
, 0, (nargs
+ 1) * sizeof (struct arg
));
4757 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
4758 INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far_v
, outmode
, fun
);
4760 INIT_CUMULATIVE_ARGS (args_so_far_v
, NULL_TREE
, fun
, 0, nargs
);
4762 args_so_far
= pack_cumulative_args (&args_so_far_v
);
4764 args_size
.constant
= 0;
4771 /* If there's a structure value address to be passed,
4772 either pass it in the special place, or pass it as an extra argument. */
4773 if (mem_value
&& struct_value
== 0 && ! pcc_struct_value
)
4775 rtx addr
= XEXP (mem_value
, 0);
4779 /* Make sure it is a reasonable operand for a move or push insn. */
4780 if (!REG_P (addr
) && !MEM_P (addr
)
4781 && !(CONSTANT_P (addr
)
4782 && targetm
.legitimate_constant_p (Pmode
, addr
)))
4783 addr
= force_operand (addr
, NULL_RTX
);
4785 argvec
[count
].value
= addr
;
4786 argvec
[count
].mode
= Pmode
;
4787 argvec
[count
].partial
= 0;
4789 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
,
4790 Pmode
, NULL_TREE
, true);
4791 gcc_assert (targetm
.calls
.arg_partial_bytes (args_so_far
, Pmode
,
4792 NULL_TREE
, 1) == 0);
4794 locate_and_pad_parm (Pmode
, NULL_TREE
,
4795 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4798 argvec
[count
].reg
!= 0,
4800 reg_parm_stack_space
, 0,
4801 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
4803 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
4804 || reg_parm_stack_space
> 0)
4805 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
4807 targetm
.calls
.function_arg_advance (args_so_far
, Pmode
, (tree
) 0, true);
4812 for (unsigned int i
= 0; count
< nargs
; i
++, count
++)
4814 rtx val
= args
[i
].first
;
4815 machine_mode mode
= args
[i
].second
;
4818 /* We cannot convert the arg value to the mode the library wants here;
4819 must do it earlier where we know the signedness of the arg. */
4820 gcc_assert (mode
!= BLKmode
4821 && (GET_MODE (val
) == mode
|| GET_MODE (val
) == VOIDmode
));
4823 /* Make sure it is a reasonable operand for a move or push insn. */
4824 if (!REG_P (val
) && !MEM_P (val
)
4825 && !(CONSTANT_P (val
) && targetm
.legitimate_constant_p (mode
, val
)))
4826 val
= force_operand (val
, NULL_RTX
);
4828 if (pass_by_reference (&args_so_far_v
, mode
, NULL_TREE
, 1))
4832 = !reference_callee_copied (&args_so_far_v
, mode
, NULL_TREE
, 1);
4834 /* If this was a CONST function, it is now PURE since it now
4836 if (flags
& ECF_CONST
)
4838 flags
&= ~ECF_CONST
;
4842 if (MEM_P (val
) && !must_copy
)
4844 tree val_expr
= MEM_EXPR (val
);
4846 mark_addressable (val_expr
);
4851 slot
= assign_temp (lang_hooks
.types
.type_for_mode (mode
, 0),
4853 emit_move_insn (slot
, val
);
4856 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
4857 gen_rtx_USE (VOIDmode
, slot
),
4860 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
4861 gen_rtx_CLOBBER (VOIDmode
,
4866 val
= force_operand (XEXP (slot
, 0), NULL_RTX
);
4869 mode
= promote_function_mode (NULL_TREE
, mode
, &unsigned_p
, NULL_TREE
, 0);
4870 argvec
[count
].mode
= mode
;
4871 argvec
[count
].value
= convert_modes (mode
, GET_MODE (val
), val
, unsigned_p
);
4872 argvec
[count
].reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
4875 argvec
[count
].partial
4876 = targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, NULL_TREE
, 1);
4878 if (argvec
[count
].reg
== 0
4879 || argvec
[count
].partial
!= 0
4880 || reg_parm_stack_space
> 0)
4882 locate_and_pad_parm (mode
, NULL_TREE
,
4883 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4886 argvec
[count
].reg
!= 0,
4888 reg_parm_stack_space
, argvec
[count
].partial
,
4889 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
4890 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
4891 gcc_assert (!argvec
[count
].locate
.size
.var
);
4893 #ifdef BLOCK_REG_PADDING
4895 /* The argument is passed entirely in registers. See at which
4896 end it should be padded. */
4897 argvec
[count
].locate
.where_pad
=
4898 BLOCK_REG_PADDING (mode
, NULL_TREE
,
4899 known_le (GET_MODE_SIZE (mode
), UNITS_PER_WORD
));
4902 targetm
.calls
.function_arg_advance (args_so_far
, mode
, (tree
) 0, true);
4905 /* If this machine requires an external definition for library
4906 functions, write one out. */
4907 assemble_external_libcall (fun
);
4909 original_args_size
= args_size
;
4910 args_size
.constant
= (aligned_upper_bound (args_size
.constant
4911 + stack_pointer_delta
,
4913 - stack_pointer_delta
);
4915 args_size
.constant
= upper_bound (args_size
.constant
,
4916 reg_parm_stack_space
);
4918 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
4919 args_size
.constant
-= reg_parm_stack_space
;
4921 crtl
->outgoing_args_size
= upper_bound (crtl
->outgoing_args_size
,
4922 args_size
.constant
);
4924 if (flag_stack_usage_info
&& !ACCUMULATE_OUTGOING_ARGS
)
4926 poly_int64 pushed
= args_size
.constant
+ pending_stack_adjust
;
4927 current_function_pushed_stack_size
4928 = upper_bound (current_function_pushed_stack_size
, pushed
);
4931 if (ACCUMULATE_OUTGOING_ARGS
)
4933 /* Since the stack pointer will never be pushed, it is possible for
4934 the evaluation of a parm to clobber something we have already
4935 written to the stack. Since most function calls on RISC machines
4936 do not use the stack, this is uncommon, but must work correctly.
4938 Therefore, we save any area of the stack that was already written
4939 and that we are using. Here we set up to do this by making a new
4940 stack usage map from the old one.
4942 Another approach might be to try to reorder the argument
4943 evaluations to avoid this conflicting stack usage. */
4945 needed
= args_size
.constant
;
4947 /* Since we will be writing into the entire argument area, the
4948 map must be allocated for its entire size, not just the part that
4949 is the responsibility of the caller. */
4950 if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl
? fntype
: TREE_TYPE (fndecl
))))
4951 needed
+= reg_parm_stack_space
;
4953 poly_int64 limit
= needed
;
4954 if (ARGS_GROW_DOWNWARD
)
4957 /* For polynomial sizes, this is the maximum possible size needed
4958 for arguments with a constant size and offset. */
4959 HOST_WIDE_INT const_limit
= constant_lower_bound (limit
);
4960 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
4963 stack_usage_map_buf
= XNEWVEC (char, highest_outgoing_arg_in_use
);
4964 stack_usage_map
= stack_usage_map_buf
;
4966 if (initial_highest_arg_in_use
)
4967 memcpy (stack_usage_map
, initial_stack_usage_map
,
4968 initial_highest_arg_in_use
);
4970 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
4971 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
4972 highest_outgoing_arg_in_use
- initial_highest_arg_in_use
);
4975 /* We must be careful to use virtual regs before they're instantiated,
4976 and real regs afterwards. Loop optimization, for example, can create
4977 new libcalls after we've instantiated the virtual regs, and if we
4978 use virtuals anyway, they won't match the rtl patterns. */
4980 if (virtuals_instantiated
)
4981 argblock
= plus_constant (Pmode
, stack_pointer_rtx
,
4982 STACK_POINTER_OFFSET
);
4984 argblock
= virtual_outgoing_args_rtx
;
4989 argblock
= push_block (gen_int_mode (args_size
.constant
, Pmode
), 0, 0);
4992 /* We push args individually in reverse order, perform stack alignment
4993 before the first push (the last arg). */
4995 anti_adjust_stack (gen_int_mode (args_size
.constant
4996 - original_args_size
.constant
,
5001 #ifdef REG_PARM_STACK_SPACE
5002 if (ACCUMULATE_OUTGOING_ARGS
)
5004 /* The argument list is the property of the called routine and it
5005 may clobber it. If the fixed area has been used for previous
5006 parameters, we must save and restore it. */
5007 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
5008 &low_to_save
, &high_to_save
);
5012 /* When expanding a normal call, args are stored in push order,
5013 which is the reverse of what we have here. */
5014 bool any_regs
= false;
5015 for (int i
= nargs
; i
-- > 0; )
5016 if (argvec
[i
].reg
!= NULL_RTX
)
5018 targetm
.calls
.call_args (argvec
[i
].reg
, NULL_TREE
);
5022 targetm
.calls
.call_args (pc_rtx
, NULL_TREE
);
5024 /* Push the args that need to be pushed. */
5026 have_push_fusage
= false;
5028 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
5029 are to be pushed. */
5030 for (count
= 0; count
< nargs
; count
++, argnum
--)
5032 machine_mode mode
= argvec
[argnum
].mode
;
5033 rtx val
= argvec
[argnum
].value
;
5034 rtx reg
= argvec
[argnum
].reg
;
5035 int partial
= argvec
[argnum
].partial
;
5036 unsigned int parm_align
= argvec
[argnum
].locate
.boundary
;
5037 poly_int64 lower_bound
= 0, upper_bound
= 0;
5039 if (! (reg
!= 0 && partial
== 0))
5043 if (ACCUMULATE_OUTGOING_ARGS
)
5045 /* If this is being stored into a pre-allocated, fixed-size,
5046 stack area, save any previous data at that location. */
5048 if (ARGS_GROW_DOWNWARD
)
5050 /* stack_slot is negative, but we want to index stack_usage_map
5051 with positive values. */
5052 upper_bound
= -argvec
[argnum
].locate
.slot_offset
.constant
+ 1;
5053 lower_bound
= upper_bound
- argvec
[argnum
].locate
.size
.constant
;
5057 lower_bound
= argvec
[argnum
].locate
.slot_offset
.constant
;
5058 upper_bound
= lower_bound
+ argvec
[argnum
].locate
.size
.constant
;
5061 if (stack_region_maybe_used_p (lower_bound
, upper_bound
,
5062 reg_parm_stack_space
))
5064 /* We need to make a save area. */
5066 = argvec
[argnum
].locate
.size
.constant
* BITS_PER_UNIT
;
5067 machine_mode save_mode
5068 = int_mode_for_size (size
, 1).else_blk ();
5070 = plus_constant (Pmode
, argblock
,
5071 argvec
[argnum
].locate
.offset
.constant
);
5073 = gen_rtx_MEM (save_mode
, memory_address (save_mode
, adr
));
5075 if (save_mode
== BLKmode
)
5077 argvec
[argnum
].save_area
5078 = assign_stack_temp (BLKmode
,
5079 argvec
[argnum
].locate
.size
.constant
5082 emit_block_move (validize_mem
5083 (copy_rtx (argvec
[argnum
].save_area
)),
5086 (argvec
[argnum
].locate
.size
.constant
,
5088 BLOCK_OP_CALL_PARM
);
5092 argvec
[argnum
].save_area
= gen_reg_rtx (save_mode
);
5094 emit_move_insn (argvec
[argnum
].save_area
, stack_area
);
5099 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, parm_align
,
5100 partial
, reg
, 0, argblock
,
5102 (argvec
[argnum
].locate
.offset
.constant
, Pmode
)),
5103 reg_parm_stack_space
,
5104 ARGS_SIZE_RTX (argvec
[argnum
].locate
.alignment_pad
), false);
5106 /* Now mark the segment we just used. */
5107 if (ACCUMULATE_OUTGOING_ARGS
)
5108 mark_stack_region_used (lower_bound
, upper_bound
);
5112 /* Indicate argument access so that alias.c knows that these
5115 use
= plus_constant (Pmode
, argblock
,
5116 argvec
[argnum
].locate
.offset
.constant
);
5117 else if (have_push_fusage
)
5121 /* When arguments are pushed, trying to tell alias.c where
5122 exactly this argument is won't work, because the
5123 auto-increment causes confusion. So we merely indicate
5124 that we access something with a known mode somewhere on
5126 use
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
5127 gen_rtx_SCRATCH (Pmode
));
5128 have_push_fusage
= true;
5130 use
= gen_rtx_MEM (argvec
[argnum
].mode
, use
);
5131 use
= gen_rtx_USE (VOIDmode
, use
);
5132 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
, use
, call_fusage
);
5138 fun
= prepare_call_address (NULL
, fun
, NULL
, &call_fusage
, 0, 0);
5140 /* Now load any reg parms into their regs. */
5142 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
5143 are to be pushed. */
5144 for (count
= 0; count
< nargs
; count
++, argnum
--)
5146 machine_mode mode
= argvec
[argnum
].mode
;
5147 rtx val
= argvec
[argnum
].value
;
5148 rtx reg
= argvec
[argnum
].reg
;
5149 int partial
= argvec
[argnum
].partial
;
5151 /* Handle calls that pass values in multiple non-contiguous
5152 locations. The PA64 has examples of this for library calls. */
5153 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
5154 emit_group_load (reg
, val
, NULL_TREE
, GET_MODE_SIZE (mode
));
5155 else if (reg
!= 0 && partial
== 0)
5157 emit_move_insn (reg
, val
);
5158 #ifdef BLOCK_REG_PADDING
5159 poly_int64 size
= GET_MODE_SIZE (argvec
[argnum
].mode
);
5161 /* Copied from load_register_parameters. */
5163 /* Handle case where we have a value that needs shifting
5164 up to the msb. eg. a QImode value and we're padding
5165 upward on a BYTES_BIG_ENDIAN machine. */
5166 if (known_lt (size
, UNITS_PER_WORD
)
5167 && (argvec
[argnum
].locate
.where_pad
5168 == (BYTES_BIG_ENDIAN
? PAD_UPWARD
: PAD_DOWNWARD
)))
5171 poly_int64 shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
5173 /* Assigning REG here rather than a temp makes CALL_FUSAGE
5174 report the whole reg as used. Strictly speaking, the
5175 call only uses SIZE bytes at the msb end, but it doesn't
5176 seem worth generating rtl to say that. */
5177 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
5178 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, shift
, reg
, 1);
5180 emit_move_insn (reg
, x
);
5188 /* Any regs containing parms remain in use through the call. */
5189 for (count
= 0; count
< nargs
; count
++)
5191 rtx reg
= argvec
[count
].reg
;
5192 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
5193 use_group_regs (&call_fusage
, reg
);
5196 int partial
= argvec
[count
].partial
;
5200 gcc_assert (partial
% UNITS_PER_WORD
== 0);
5201 nregs
= partial
/ UNITS_PER_WORD
;
5202 use_regs (&call_fusage
, REGNO (reg
), nregs
);
5205 use_reg (&call_fusage
, reg
);
5209 /* Pass the function the address in which to return a structure value. */
5210 if (mem_value
!= 0 && struct_value
!= 0 && ! pcc_struct_value
)
5212 emit_move_insn (struct_value
,
5214 force_operand (XEXP (mem_value
, 0),
5216 if (REG_P (struct_value
))
5217 use_reg (&call_fusage
, struct_value
);
5220 /* Don't allow popping to be deferred, since then
5221 cse'ing of library calls could delete a call and leave the pop. */
5223 valreg
= (mem_value
== 0 && outmode
!= VOIDmode
5224 ? hard_libcall_value (outmode
, orgfun
) : NULL_RTX
);
5226 /* Stack must be properly aligned now. */
5227 gcc_assert (multiple_p (stack_pointer_delta
,
5228 PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
));
5230 before_call
= get_last_insn ();
5232 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
5233 will set inhibit_defer_pop to that value. */
5234 /* The return type is needed to decide how many bytes the function pops.
5235 Signedness plays no role in that, so for simplicity, we pretend it's
5236 always signed. We also assume that the list of arguments passed has
5237 no impact, so we pretend it is unknown. */
5239 emit_call_1 (fun
, NULL
,
5240 get_identifier (XSTR (orgfun
, 0)),
5241 build_function_type (tfom
, NULL_TREE
),
5242 original_args_size
.constant
, args_size
.constant
,
5244 targetm
.calls
.function_arg (args_so_far
,
5245 VOIDmode
, void_type_node
, true),
5247 old_inhibit_defer_pop
+ 1, call_fusage
, flags
, args_so_far
);
5252 gcc_assert (GET_CODE (datum
) == SYMBOL_REF
);
5253 rtx_call_insn
*last
= last_call_insn ();
5254 add_reg_note (last
, REG_CALL_DECL
, datum
);
5257 /* Right-shift returned value if necessary. */
5258 if (!pcc_struct_value
5259 && TYPE_MODE (tfom
) != BLKmode
5260 && targetm
.calls
.return_in_msb (tfom
))
5262 shift_return_value (TYPE_MODE (tfom
), false, valreg
);
5263 valreg
= gen_rtx_REG (TYPE_MODE (tfom
), REGNO (valreg
));
5266 targetm
.calls
.end_call_args ();
5268 /* For calls to `setjmp', etc., inform function.c:setjmp_warnings
5269 that it should complain if nonvolatile values are live. For
5270 functions that cannot return, inform flow that control does not
5272 if (flags
& ECF_NORETURN
)
5274 /* The barrier note must be emitted
5275 immediately after the CALL_INSN. Some ports emit more than
5276 just a CALL_INSN above, so we must search for it here. */
5277 rtx_insn
*last
= get_last_insn ();
5278 while (!CALL_P (last
))
5280 last
= PREV_INSN (last
);
5281 /* There was no CALL_INSN? */
5282 gcc_assert (last
!= before_call
);
5285 emit_barrier_after (last
);
5288 /* Consider that "regular" libcalls, i.e. all of them except for LCT_THROW
5289 and LCT_RETURNS_TWICE, cannot perform non-local gotos. */
5290 if (flags
& ECF_NOTHROW
)
5292 rtx_insn
*last
= get_last_insn ();
5293 while (!CALL_P (last
))
5295 last
= PREV_INSN (last
);
5296 /* There was no CALL_INSN? */
5297 gcc_assert (last
!= before_call
);
5300 make_reg_eh_region_note_nothrow_nononlocal (last
);
5303 /* Now restore inhibit_defer_pop to its actual original value. */
5308 /* Copy the value to the right place. */
5309 if (outmode
!= VOIDmode
&& retval
)
5315 if (value
!= mem_value
)
5316 emit_move_insn (value
, mem_value
);
5318 else if (GET_CODE (valreg
) == PARALLEL
)
5321 value
= gen_reg_rtx (outmode
);
5322 emit_group_store (value
, valreg
, NULL_TREE
, GET_MODE_SIZE (outmode
));
5326 /* Convert to the proper mode if a promotion has been active. */
5327 if (GET_MODE (valreg
) != outmode
)
5329 int unsignedp
= TYPE_UNSIGNED (tfom
);
5331 gcc_assert (promote_function_mode (tfom
, outmode
, &unsignedp
,
5332 fndecl
? TREE_TYPE (fndecl
) : fntype
, 1)
5333 == GET_MODE (valreg
));
5334 valreg
= convert_modes (outmode
, GET_MODE (valreg
), valreg
, 0);
5338 emit_move_insn (value
, valreg
);
5344 if (ACCUMULATE_OUTGOING_ARGS
)
5346 #ifdef REG_PARM_STACK_SPACE
5348 restore_fixed_argument_area (save_area
, argblock
,
5349 high_to_save
, low_to_save
);
5352 /* If we saved any argument areas, restore them. */
5353 for (count
= 0; count
< nargs
; count
++)
5354 if (argvec
[count
].save_area
)
5356 machine_mode save_mode
= GET_MODE (argvec
[count
].save_area
);
5357 rtx adr
= plus_constant (Pmode
, argblock
,
5358 argvec
[count
].locate
.offset
.constant
);
5359 rtx stack_area
= gen_rtx_MEM (save_mode
,
5360 memory_address (save_mode
, adr
));
5362 if (save_mode
== BLKmode
)
5363 emit_block_move (stack_area
,
5365 (copy_rtx (argvec
[count
].save_area
)),
5367 (argvec
[count
].locate
.size
.constant
, Pmode
)),
5368 BLOCK_OP_CALL_PARM
);
5370 emit_move_insn (stack_area
, argvec
[count
].save_area
);
5373 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
5374 stack_usage_map
= initial_stack_usage_map
;
5375 stack_usage_watermark
= initial_stack_usage_watermark
;
5378 free (stack_usage_map_buf
);
5385 /* Store a single argument for a function call
5386 into the register or memory area where it must be passed.
5387 *ARG describes the argument value and where to pass it.
5389 ARGBLOCK is the address of the stack-block for all the arguments,
5390 or 0 on a machine where arguments are pushed individually.
5392 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
5393 so must be careful about how the stack is used.
5395 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
5396 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
5397 that we need not worry about saving and restoring the stack.
5399 FNDECL is the declaration of the function we are calling.
5401 Return nonzero if this arg should cause sibcall failure,
5405 store_one_arg (struct arg_data
*arg
, rtx argblock
, int flags
,
5406 int variable_size ATTRIBUTE_UNUSED
, int reg_parm_stack_space
)
5408 tree pval
= arg
->tree_value
;
5411 poly_int64 used
= 0;
5412 poly_int64 lower_bound
= 0, upper_bound
= 0;
5413 int sibcall_failure
= 0;
5415 if (TREE_CODE (pval
) == ERROR_MARK
)
5418 /* Push a new temporary level for any temporaries we make for
5422 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
))
5424 /* If this is being stored into a pre-allocated, fixed-size, stack area,
5425 save any previous data at that location. */
5426 if (argblock
&& ! variable_size
&& arg
->stack
)
5428 if (ARGS_GROW_DOWNWARD
)
5430 /* stack_slot is negative, but we want to index stack_usage_map
5431 with positive values. */
5432 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
5434 rtx offset
= XEXP (XEXP (arg
->stack_slot
, 0), 1);
5435 upper_bound
= -rtx_to_poly_int64 (offset
) + 1;
5440 lower_bound
= upper_bound
- arg
->locate
.size
.constant
;
5444 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
5446 rtx offset
= XEXP (XEXP (arg
->stack_slot
, 0), 1);
5447 lower_bound
= rtx_to_poly_int64 (offset
);
5452 upper_bound
= lower_bound
+ arg
->locate
.size
.constant
;
5455 if (stack_region_maybe_used_p (lower_bound
, upper_bound
,
5456 reg_parm_stack_space
))
5458 /* We need to make a save area. */
5459 poly_uint64 size
= arg
->locate
.size
.constant
* BITS_PER_UNIT
;
5460 machine_mode save_mode
5461 = int_mode_for_size (size
, 1).else_blk ();
5462 rtx adr
= memory_address (save_mode
, XEXP (arg
->stack_slot
, 0));
5463 rtx stack_area
= gen_rtx_MEM (save_mode
, adr
);
5465 if (save_mode
== BLKmode
)
5468 = assign_temp (TREE_TYPE (arg
->tree_value
), 1, 1);
5469 preserve_temp_slots (arg
->save_area
);
5470 emit_block_move (validize_mem (copy_rtx (arg
->save_area
)),
5473 (arg
->locate
.size
.constant
, Pmode
)),
5474 BLOCK_OP_CALL_PARM
);
5478 arg
->save_area
= gen_reg_rtx (save_mode
);
5479 emit_move_insn (arg
->save_area
, stack_area
);
5485 /* If this isn't going to be placed on both the stack and in registers,
5486 set up the register and number of words. */
5487 if (! arg
->pass_on_stack
)
5489 if (flags
& ECF_SIBCALL
)
5490 reg
= arg
->tail_call_reg
;
5493 partial
= arg
->partial
;
5496 /* Being passed entirely in a register. We shouldn't be called in
5498 gcc_assert (reg
== 0 || partial
!= 0);
5500 /* If this arg needs special alignment, don't load the registers
5502 if (arg
->n_aligned_regs
!= 0)
5505 /* If this is being passed partially in a register, we can't evaluate
5506 it directly into its stack slot. Otherwise, we can. */
5507 if (arg
->value
== 0)
5509 /* stack_arg_under_construction is nonzero if a function argument is
5510 being evaluated directly into the outgoing argument list and
5511 expand_call must take special action to preserve the argument list
5512 if it is called recursively.
5514 For scalar function arguments stack_usage_map is sufficient to
5515 determine which stack slots must be saved and restored. Scalar
5516 arguments in general have pass_on_stack == 0.
5518 If this argument is initialized by a function which takes the
5519 address of the argument (a C++ constructor or a C function
5520 returning a BLKmode structure), then stack_usage_map is
5521 insufficient and expand_call must push the stack around the
5522 function call. Such arguments have pass_on_stack == 1.
5524 Note that it is always safe to set stack_arg_under_construction,
5525 but this generates suboptimal code if set when not needed. */
5527 if (arg
->pass_on_stack
)
5528 stack_arg_under_construction
++;
5530 arg
->value
= expand_expr (pval
,
5532 || TYPE_MODE (TREE_TYPE (pval
)) != arg
->mode
)
5533 ? NULL_RTX
: arg
->stack
,
5534 VOIDmode
, EXPAND_STACK_PARM
);
5536 /* If we are promoting object (or for any other reason) the mode
5537 doesn't agree, convert the mode. */
5539 if (arg
->mode
!= TYPE_MODE (TREE_TYPE (pval
)))
5540 arg
->value
= convert_modes (arg
->mode
, TYPE_MODE (TREE_TYPE (pval
)),
5541 arg
->value
, arg
->unsignedp
);
5543 if (arg
->pass_on_stack
)
5544 stack_arg_under_construction
--;
5547 /* Check for overlap with already clobbered argument area. */
5548 if ((flags
& ECF_SIBCALL
)
5549 && MEM_P (arg
->value
)
5550 && mem_might_overlap_already_clobbered_arg_p (XEXP (arg
->value
, 0),
5551 arg
->locate
.size
.constant
))
5552 sibcall_failure
= 1;
5554 /* Don't allow anything left on stack from computation
5555 of argument to alloca. */
5556 if (flags
& ECF_MAY_BE_ALLOCA
)
5557 do_pending_stack_adjust ();
5559 if (arg
->value
== arg
->stack
)
5560 /* If the value is already in the stack slot, we are done. */
5562 else if (arg
->mode
!= BLKmode
)
5564 unsigned int parm_align
;
5566 /* Argument is a scalar, not entirely passed in registers.
5567 (If part is passed in registers, arg->partial says how much
5568 and emit_push_insn will take care of putting it there.)
5570 Push it, and if its size is less than the
5571 amount of space allocated to it,
5572 also bump stack pointer by the additional space.
5573 Note that in C the default argument promotions
5574 will prevent such mismatches. */
5576 poly_int64 size
= (TYPE_EMPTY_P (TREE_TYPE (pval
))
5577 ? 0 : GET_MODE_SIZE (arg
->mode
));
5579 /* Compute how much space the push instruction will push.
5580 On many machines, pushing a byte will advance the stack
5581 pointer by a halfword. */
5582 #ifdef PUSH_ROUNDING
5583 size
= PUSH_ROUNDING (size
);
5587 /* Compute how much space the argument should get:
5588 round up to a multiple of the alignment for arguments. */
5589 if (targetm
.calls
.function_arg_padding (arg
->mode
, TREE_TYPE (pval
))
5591 /* At the moment we don't (need to) support ABIs for which the
5592 padding isn't known at compile time. In principle it should
5593 be easy to add though. */
5594 used
= force_align_up (size
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
5596 /* Compute the alignment of the pushed argument. */
5597 parm_align
= arg
->locate
.boundary
;
5598 if (targetm
.calls
.function_arg_padding (arg
->mode
, TREE_TYPE (pval
))
5601 poly_int64 pad
= used
- size
;
5602 unsigned int pad_align
= known_alignment (pad
) * BITS_PER_UNIT
;
5604 parm_align
= MIN (parm_align
, pad_align
);
5607 /* This isn't already where we want it on the stack, so put it there.
5608 This can either be done with push or copy insns. */
5609 if (maybe_ne (used
, 0)
5610 && !emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
),
5611 NULL_RTX
, parm_align
, partial
, reg
, used
- size
,
5612 argblock
, ARGS_SIZE_RTX (arg
->locate
.offset
),
5613 reg_parm_stack_space
,
5614 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
), true))
5615 sibcall_failure
= 1;
5617 /* Unless this is a partially-in-register argument, the argument is now
5620 arg
->value
= arg
->stack
;
5624 /* BLKmode, at least partly to be pushed. */
5626 unsigned int parm_align
;
5630 /* Pushing a nonscalar.
5631 If part is passed in registers, PARTIAL says how much
5632 and emit_push_insn will take care of putting it there. */
5634 /* Round its size up to a multiple
5635 of the allocation unit for arguments. */
5637 if (arg
->locate
.size
.var
!= 0)
5640 size_rtx
= ARGS_SIZE_RTX (arg
->locate
.size
);
5644 /* PUSH_ROUNDING has no effect on us, because emit_push_insn
5645 for BLKmode is careful to avoid it. */
5646 excess
= (arg
->locate
.size
.constant
5647 - arg_int_size_in_bytes (TREE_TYPE (pval
))
5649 size_rtx
= expand_expr (arg_size_in_bytes (TREE_TYPE (pval
)),
5650 NULL_RTX
, TYPE_MODE (sizetype
),
5654 parm_align
= arg
->locate
.boundary
;
5656 /* When an argument is padded down, the block is aligned to
5657 PARM_BOUNDARY, but the actual argument isn't. */
5658 if (targetm
.calls
.function_arg_padding (arg
->mode
, TREE_TYPE (pval
))
5661 if (arg
->locate
.size
.var
)
5662 parm_align
= BITS_PER_UNIT
;
5665 unsigned int excess_align
5666 = known_alignment (excess
) * BITS_PER_UNIT
;
5667 if (excess_align
!= 0)
5668 parm_align
= MIN (parm_align
, excess_align
);
5672 if ((flags
& ECF_SIBCALL
) && MEM_P (arg
->value
))
5674 /* emit_push_insn might not work properly if arg->value and
5675 argblock + arg->locate.offset areas overlap. */
5679 if (XEXP (x
, 0) == crtl
->args
.internal_arg_pointer
5680 || (GET_CODE (XEXP (x
, 0)) == PLUS
5681 && XEXP (XEXP (x
, 0), 0) ==
5682 crtl
->args
.internal_arg_pointer
5683 && CONST_INT_P (XEXP (XEXP (x
, 0), 1))))
5685 if (XEXP (x
, 0) != crtl
->args
.internal_arg_pointer
)
5686 i
= rtx_to_poly_int64 (XEXP (XEXP (x
, 0), 1));
5688 /* arg.locate doesn't contain the pretend_args_size offset,
5689 it's part of argblock. Ensure we don't count it in I. */
5690 if (STACK_GROWS_DOWNWARD
)
5691 i
-= crtl
->args
.pretend_args_size
;
5693 i
+= crtl
->args
.pretend_args_size
;
5695 /* expand_call should ensure this. */
5696 gcc_assert (!arg
->locate
.offset
.var
5697 && arg
->locate
.size
.var
== 0);
5698 poly_int64 size_val
= rtx_to_poly_int64 (size_rtx
);
5700 if (known_eq (arg
->locate
.offset
.constant
, i
))
5702 /* Even though they appear to be at the same location,
5703 if part of the outgoing argument is in registers,
5704 they aren't really at the same location. Check for
5705 this by making sure that the incoming size is the
5706 same as the outgoing size. */
5707 if (maybe_ne (arg
->locate
.size
.constant
, size_val
))
5708 sibcall_failure
= 1;
5710 else if (maybe_in_range_p (arg
->locate
.offset
.constant
,
5712 sibcall_failure
= 1;
5713 /* Use arg->locate.size.constant instead of size_rtx
5714 because we only care about the part of the argument
5716 else if (maybe_in_range_p (i
, arg
->locate
.offset
.constant
,
5717 arg
->locate
.size
.constant
))
5718 sibcall_failure
= 1;
5722 if (!CONST_INT_P (size_rtx
) || INTVAL (size_rtx
) != 0)
5723 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx
,
5724 parm_align
, partial
, reg
, excess
, argblock
,
5725 ARGS_SIZE_RTX (arg
->locate
.offset
),
5726 reg_parm_stack_space
,
5727 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
), false);
5729 /* Unless this is a partially-in-register argument, the argument is now
5732 ??? Unlike the case above, in which we want the actual
5733 address of the data, so that we can load it directly into a
5734 register, here we want the address of the stack slot, so that
5735 it's properly aligned for word-by-word copying or something
5736 like that. It's not clear that this is always correct. */
5738 arg
->value
= arg
->stack_slot
;
5741 if (arg
->reg
&& GET_CODE (arg
->reg
) == PARALLEL
)
5743 tree type
= TREE_TYPE (arg
->tree_value
);
5745 = emit_group_load_into_temps (arg
->reg
, arg
->value
, type
,
5746 int_size_in_bytes (type
));
5749 /* Mark all slots this store used. */
5750 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
)
5751 && argblock
&& ! variable_size
&& arg
->stack
)
5752 mark_stack_region_used (lower_bound
, upper_bound
);
5754 /* Once we have pushed something, pops can't safely
5755 be deferred during the rest of the arguments. */
5758 /* Free any temporary slots made in processing this argument. */
5761 return sibcall_failure
;
5764 /* Nonzero if we do not know how to pass TYPE solely in registers. */
5767 must_pass_in_stack_var_size (machine_mode mode ATTRIBUTE_UNUSED
,
5773 /* If the type has variable size... */
5774 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
5777 /* If the type is marked as addressable (it is required
5778 to be constructed into the stack)... */
5779 if (TREE_ADDRESSABLE (type
))
5785 /* Another version of the TARGET_MUST_PASS_IN_STACK hook. This one
5786 takes trailing padding of a structure into account. */
5787 /* ??? Should be able to merge these two by examining BLOCK_REG_PADDING. */
5790 must_pass_in_stack_var_size_or_pad (machine_mode mode
, const_tree type
)
5795 /* If the type has variable size... */
5796 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
5799 /* If the type is marked as addressable (it is required
5800 to be constructed into the stack)... */
5801 if (TREE_ADDRESSABLE (type
))
5804 if (TYPE_EMPTY_P (type
))
5807 /* If the padding and mode of the type is such that a copy into
5808 a register would put it into the wrong part of the register. */
5810 && int_size_in_bytes (type
) % (PARM_BOUNDARY
/ BITS_PER_UNIT
)
5811 && (targetm
.calls
.function_arg_padding (mode
, type
)
5812 == (BYTES_BIG_ENDIAN
? PAD_UPWARD
: PAD_DOWNWARD
)))
5818 /* Tell the garbage collector about GTY markers in this source file. */
5819 #include "gt-calls.h"