Line data Source code
1 : /* Convert function calls to rtl insns, for GNU C compiler.
2 : Copyright (C) 1989-2026 Free Software Foundation, Inc.
3 :
4 : This file is part of GCC.
5 :
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
9 : version.
10 :
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
14 : for more details.
15 :
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/>. */
19 :
20 : #include "config.h"
21 : #include "system.h"
22 : #include "coretypes.h"
23 : #include "backend.h"
24 : #include "target.h"
25 : #include "rtl.h"
26 : #include "tree.h"
27 : #include "gimple.h"
28 : #include "predict.h"
29 : #include "memmodel.h"
30 : #include "tm_p.h"
31 : #include "stringpool.h"
32 : #include "expmed.h"
33 : #include "optabs.h"
34 : #include "emit-rtl.h"
35 : #include "cgraph.h"
36 : #include "diagnostic-core.h"
37 : #include "fold-const.h"
38 : #include "stor-layout.h"
39 : #include "varasm.h"
40 : #include "internal-fn.h"
41 : #include "dojump.h"
42 : #include "explow.h"
43 : #include "calls.h"
44 : #include "expr.h"
45 : #include "output.h"
46 : #include "langhooks.h"
47 : #include "except.h"
48 : #include "dbgcnt.h"
49 : #include "rtl-iter.h"
50 : #include "tree-vrp.h"
51 : #include "tree-ssanames.h"
52 : #include "intl.h"
53 : #include "stringpool.h"
54 : #include "hash-map.h"
55 : #include "hash-traits.h"
56 : #include "attribs.h"
57 : #include "builtins.h"
58 : #include "gimple-iterator.h"
59 : #include "gimple-fold.h"
60 : #include "attr-fnspec.h"
61 : #include "value-query.h"
62 : #include "tree-pretty-print.h"
63 : #include "tree-eh.h"
64 :
65 : /* Like PREFERRED_STACK_BOUNDARY but in units of bytes, not bits. */
66 : #define STACK_BYTES (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)
67 :
68 : /* Data structure and subroutines used within expand_call. */
69 :
70 : struct arg_data
71 : {
72 : /* Tree node for this argument. */
73 : tree tree_value;
74 : /* Mode for value; TYPE_MODE unless promoted. */
75 : machine_mode mode;
76 : /* Current RTL value for argument, or 0 if it isn't precomputed. */
77 : rtx value;
78 : /* Initially-compute RTL value for argument; only for const functions. */
79 : rtx initial_value;
80 : /* Register to pass this argument in, 0 if passed on stack, or an
81 : PARALLEL if the arg is to be copied into multiple non-contiguous
82 : registers. */
83 : rtx reg;
84 : /* Register to pass this argument in when generating tail call sequence.
85 : This is not the same register as for normal calls on machines with
86 : register windows. */
87 : rtx tail_call_reg;
88 : /* If REG is a PARALLEL, this is a copy of VALUE pulled into the correct
89 : form for emit_group_move. */
90 : rtx parallel_value;
91 : /* If REG was promoted from the actual mode of the argument expression,
92 : indicates whether the promotion is sign- or zero-extended. */
93 : int unsignedp;
94 : /* Number of bytes to put in registers. 0 means put the whole arg
95 : in registers. Also 0 if not passed in registers. */
96 : int partial;
97 : /* True if argument must be passed on stack.
98 : Note that some arguments may be passed on the stack
99 : even though pass_on_stack is false, just because FUNCTION_ARG says so.
100 : pass_on_stack identifies arguments that *cannot* go in registers. */
101 : bool pass_on_stack;
102 : /* Some fields packaged up for locate_and_pad_parm. */
103 : struct locate_and_pad_arg_data locate;
104 : /* Location on the stack at which parameter should be stored. The store
105 : has already been done if STACK == VALUE. */
106 : rtx stack;
107 : /* Location on the stack of the start of this argument slot. This can
108 : differ from STACK if this arg pads downward. This location is known
109 : to be aligned to TARGET_FUNCTION_ARG_BOUNDARY. */
110 : rtx stack_slot;
111 : /* Place that this stack area has been saved, if needed. */
112 : rtx save_area;
113 : /* If an argument's alignment does not permit direct copying into registers,
114 : copy in smaller-sized pieces into pseudos. These are stored in a
115 : block pointed to by this field. The next field says how many
116 : word-sized pseudos we made. */
117 : rtx *aligned_regs;
118 : int n_aligned_regs;
119 : };
120 :
121 : /* A vector of one char per byte of stack space. A byte if nonzero if
122 : the corresponding stack location has been used.
123 : This vector is used to prevent a function call within an argument from
124 : clobbering any stack already set up. */
125 : static char *stack_usage_map;
126 :
127 : /* Size of STACK_USAGE_MAP. */
128 : static unsigned int highest_outgoing_arg_in_use;
129 :
130 : /* Assume that any stack location at this byte index is used,
131 : without checking the contents of stack_usage_map. */
132 : static unsigned HOST_WIDE_INT stack_usage_watermark = HOST_WIDE_INT_M1U;
133 :
134 : /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
135 : stack location's tail call argument has been already stored into the stack.
136 : This bitmap is used to prevent sibling call optimization if function tries
137 : to use parent's incoming argument slots when they have been already
138 : overwritten with tail call arguments. */
139 : static sbitmap stored_args_map;
140 :
141 : /* Assume that any virtual-incoming location at this byte index has been
142 : stored, without checking the contents of stored_args_map. */
143 : static unsigned HOST_WIDE_INT stored_args_watermark;
144 :
145 : /* stack_arg_under_construction is nonzero when an argument may be
146 : initialized with a constructor call (including a C function that
147 : returns a BLKmode struct) and expand_call must take special action
148 : to make sure the object being constructed does not overlap the
149 : argument list for the constructor call. */
150 : static int stack_arg_under_construction;
151 :
152 : static void precompute_register_parameters (int, struct arg_data *, int *);
153 : static bool store_one_arg (struct arg_data *, rtx, int, int, int);
154 : static void store_unaligned_arguments_into_pseudos (struct arg_data *, int);
155 : static bool finalize_must_preallocate (bool, int, struct arg_data *,
156 : struct args_size *);
157 : static void precompute_arguments (int, struct arg_data *);
158 : static void compute_argument_addresses (struct arg_data *, rtx, int);
159 : static rtx rtx_for_function_call (tree, tree);
160 : static void load_register_parameters (struct arg_data *, int, rtx *, int,
161 : int, bool *);
162 : static int special_function_p (const_tree, int);
163 : static bool check_sibcall_argument_overlap_1 (rtx);
164 : static bool check_sibcall_argument_overlap (rtx_insn *, struct arg_data *,
165 : bool);
166 : static tree split_complex_types (tree);
167 :
168 : #ifdef REG_PARM_STACK_SPACE
169 : static rtx save_fixed_argument_area (int, rtx, int *, int *);
170 : static void restore_fixed_argument_area (rtx, rtx, int, int);
171 : #endif
172 :
173 : /* Return true if bytes [LOWER_BOUND, UPPER_BOUND) of the outgoing
174 : stack region might already be in use. */
175 :
176 : static bool
177 53816 : stack_region_maybe_used_p (poly_uint64 lower_bound, poly_uint64 upper_bound,
178 : unsigned int reg_parm_stack_space)
179 : {
180 53816 : unsigned HOST_WIDE_INT const_lower, const_upper;
181 53816 : const_lower = constant_lower_bound (lower_bound);
182 53816 : if (!upper_bound.is_constant (&const_upper))
183 : const_upper = HOST_WIDE_INT_M1U;
184 :
185 53816 : if (const_upper > stack_usage_watermark)
186 : return true;
187 :
188 : /* Don't worry about things in the fixed argument area;
189 : it has already been saved. */
190 53816 : const_lower = MAX (const_lower, reg_parm_stack_space);
191 53816 : const_upper = MIN (const_upper, highest_outgoing_arg_in_use);
192 486712 : for (unsigned HOST_WIDE_INT i = const_lower; i < const_upper; ++i)
193 432896 : if (stack_usage_map[i])
194 : return true;
195 : return false;
196 : }
197 :
198 : /* Record that bytes [LOWER_BOUND, UPPER_BOUND) of the outgoing
199 : stack region are now in use. */
200 :
201 : static void
202 53816 : mark_stack_region_used (poly_uint64 lower_bound, poly_uint64 upper_bound)
203 : {
204 53816 : unsigned HOST_WIDE_INT const_lower, const_upper;
205 53816 : const_lower = constant_lower_bound (lower_bound);
206 53816 : if (upper_bound.is_constant (&const_upper)
207 53816 : && const_upper <= highest_outgoing_arg_in_use)
208 486712 : for (unsigned HOST_WIDE_INT i = const_lower; i < const_upper; ++i)
209 432896 : stack_usage_map[i] = 1;
210 : else
211 0 : stack_usage_watermark = MIN (stack_usage_watermark, const_lower);
212 53816 : }
213 :
214 : /* Force FUNEXP into a form suitable for the address of a CALL,
215 : and return that as an rtx. Also load the static chain register
216 : if FNDECL is a nested function.
217 :
218 : CALL_FUSAGE points to a variable holding the prospective
219 : CALL_INSN_FUNCTION_USAGE information. */
220 :
221 : rtx
222 5935504 : prepare_call_address (tree fndecl_or_type, rtx funexp, rtx static_chain_value,
223 : rtx *call_fusage, int reg_parm_seen, int flags)
224 : {
225 : /* Make a valid memory address and copy constants through pseudo-regs,
226 : but not for a constant address if -fno-function-cse. */
227 5935504 : if (GET_CODE (funexp) != SYMBOL_REF)
228 : {
229 : /* If it's an indirect call by descriptor, generate code to perform
230 : runtime identification of the pointer and load the descriptor. */
231 188199 : if ((flags & ECF_BY_DESCRIPTOR) && !flag_trampolines)
232 : {
233 0 : const int bit_val = targetm.calls.custom_function_descriptors;
234 0 : rtx call_lab = gen_label_rtx ();
235 :
236 0 : gcc_assert (fndecl_or_type && TYPE_P (fndecl_or_type));
237 0 : fndecl_or_type
238 0 : = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, NULL_TREE,
239 : fndecl_or_type);
240 0 : DECL_STATIC_CHAIN (fndecl_or_type) = 1;
241 0 : rtx chain = targetm.calls.static_chain (fndecl_or_type, false);
242 :
243 0 : if (GET_MODE (funexp) != Pmode)
244 0 : funexp = convert_memory_address (Pmode, funexp);
245 :
246 : /* Avoid long live ranges around function calls. */
247 0 : funexp = copy_to_mode_reg (Pmode, funexp);
248 :
249 0 : if (REG_P (chain))
250 0 : emit_insn (gen_rtx_CLOBBER (VOIDmode, chain));
251 :
252 : /* Emit the runtime identification pattern. */
253 0 : rtx mask = gen_rtx_AND (Pmode, funexp, GEN_INT (bit_val));
254 0 : emit_cmp_and_jump_insns (mask, const0_rtx, EQ, NULL_RTX, Pmode, 1,
255 : call_lab);
256 :
257 : /* Statically predict the branch to very likely taken. */
258 0 : rtx_insn *insn = get_last_insn ();
259 0 : if (JUMP_P (insn))
260 0 : predict_insn_def (insn, PRED_BUILTIN_EXPECT, TAKEN);
261 :
262 : /* Load the descriptor. */
263 0 : rtx mem = gen_rtx_MEM (ptr_mode,
264 0 : plus_constant (Pmode, funexp, - bit_val));
265 0 : MEM_NOTRAP_P (mem) = 1;
266 0 : mem = convert_memory_address (Pmode, mem);
267 0 : emit_move_insn (chain, mem);
268 :
269 0 : mem = gen_rtx_MEM (ptr_mode,
270 0 : plus_constant (Pmode, funexp,
271 0 : POINTER_SIZE / BITS_PER_UNIT
272 0 : - bit_val));
273 0 : MEM_NOTRAP_P (mem) = 1;
274 0 : mem = convert_memory_address (Pmode, mem);
275 0 : emit_move_insn (funexp, mem);
276 :
277 0 : emit_label (call_lab);
278 :
279 0 : if (REG_P (chain))
280 : {
281 0 : use_reg (call_fusage, chain);
282 0 : STATIC_CHAIN_REG_P (chain) = 1;
283 : }
284 :
285 : /* Make sure we're not going to be overwritten below. */
286 0 : gcc_assert (!static_chain_value);
287 : }
288 :
289 : /* If we are using registers for parameters, force the
290 : function address into a register now. */
291 143430 : funexp = ((reg_parm_seen
292 143430 : && targetm.small_register_classes_for_mode_p (FUNCTION_MODE))
293 331629 : ? force_not_mem (memory_address (FUNCTION_MODE, funexp))
294 44769 : : memory_address (FUNCTION_MODE, funexp));
295 : }
296 : else
297 : {
298 : /* funexp could be a SYMBOL_REF represents a function pointer which is
299 : of ptr_mode. In this case, it should be converted into address mode
300 : to be a valid address for memory rtx pattern. See PR 64971. */
301 6453320 : if (GET_MODE (funexp) != Pmode)
302 0 : funexp = convert_memory_address (Pmode, funexp);
303 :
304 5747305 : if (!(flags & ECF_SIBCALL))
305 : {
306 5747305 : if (!NO_FUNCTION_CSE && optimize && ! flag_no_function_cse)
307 : funexp = force_reg (Pmode, funexp);
308 : }
309 : }
310 :
311 5935504 : if (static_chain_value != 0
312 5935504 : && (TREE_CODE (fndecl_or_type) != FUNCTION_DECL
313 15325 : || DECL_STATIC_CHAIN (fndecl_or_type)))
314 : {
315 37674 : rtx chain;
316 :
317 37674 : chain = targetm.calls.static_chain (fndecl_or_type, false);
318 37674 : static_chain_value = convert_memory_address (Pmode, static_chain_value);
319 :
320 37674 : emit_move_insn (chain, static_chain_value);
321 37674 : if (REG_P (chain))
322 : {
323 37674 : use_reg (call_fusage, chain);
324 37674 : STATIC_CHAIN_REG_P (chain) = 1;
325 : }
326 : }
327 :
328 5935504 : return funexp;
329 : }
330 :
331 : /* Generate instructions to call function FUNEXP,
332 : and optionally pop the results.
333 : The CALL_INSN is the first insn generated.
334 :
335 : FNDECL is the declaration node of the function. This is given to the
336 : hook TARGET_RETURN_POPS_ARGS to determine whether this function pops
337 : its own args.
338 :
339 : FUNTYPE is the data type of the function. This is given to the hook
340 : TARGET_RETURN_POPS_ARGS to determine whether this function pops its
341 : own args. We used to allow an identifier for library functions, but
342 : that doesn't work when the return type is an aggregate type and the
343 : calling convention says that the pointer to this aggregate is to be
344 : popped by the callee.
345 :
346 : STACK_SIZE is the number of bytes of arguments on the stack,
347 : ROUNDED_STACK_SIZE is that number rounded up to
348 : PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
349 : both to put into the call insn and to generate explicit popping
350 : code if necessary.
351 :
352 : STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
353 : It is zero if this call doesn't want a structure value.
354 :
355 : NEXT_ARG_REG is the rtx that results from executing
356 : targetm.calls.function_arg (&args_so_far,
357 : function_arg_info::end_marker ());
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.
363 :
364 : VALREG is a hard register in which a value is returned,
365 : or 0 if the call does not return a value.
366 :
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.
370 :
371 : CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
372 : denote registers used by the called function. */
373 :
374 : static void
375 5935021 : 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)
383 : {
384 6675045 : rtx rounded_stack_size_rtx = gen_int_mode (rounded_stack_size, Pmode);
385 5935021 : rtx call, funmem, pat;
386 5935021 : bool already_popped = false;
387 5935021 : poly_int64 n_popped = 0;
388 :
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 5935021 : if (!(ecf_flags & ECF_SIBCALL))
393 : {
394 5805671 : n_popped += targetm.calls.return_pops_args (fndecl, funtype, stack_size);
395 :
396 : #ifdef CALL_POPS_ARGS
397 : n_popped += CALL_POPS_ARGS (*get_cumulative_args (args_so_far));
398 : #endif
399 : }
400 :
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 5935021 : if (GET_CODE (funexp) != SYMBOL_REF)
405 188170 : funexp = memory_address (FUNCTION_MODE, funexp);
406 :
407 5935021 : funmem = gen_rtx_MEM (FUNCTION_MODE, funexp);
408 5935021 : if (fndecl && TREE_CODE (fndecl) == FUNCTION_DECL)
409 : {
410 5629438 : tree t = fndecl;
411 :
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 5629438 : if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
420 : {
421 1187555 : tree t2 = builtin_decl_explicit (DECL_FUNCTION_CODE (t));
422 1187555 : if (t2)
423 5629438 : t = t2;
424 : }
425 :
426 5629438 : set_mem_expr (funmem, t);
427 5629438 : }
428 305583 : else if (fntree)
429 188187 : set_mem_expr (funmem, build_simple_mem_ref (CALL_EXPR_FN (fntree)));
430 :
431 5935021 : if (ecf_flags & ECF_SIBCALL)
432 : {
433 129350 : if (valreg)
434 37765 : pat = targetm.gen_sibcall_value (valreg, funmem,
435 : rounded_stack_size_rtx,
436 : next_arg_reg, NULL_RTX);
437 : else
438 91585 : pat = targetm.gen_sibcall (funmem, rounded_stack_size_rtx,
439 : next_arg_reg,
440 91585 : gen_int_mode (struct_value_size, Pmode));
441 : }
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 5805671 : else if (maybe_ne (n_popped, 0)
447 11484380 : || !(valreg
448 2413357 : ? targetm.have_call_value ()
449 3265352 : : targetm.have_call ()))
450 : {
451 253924 : rtx n_pop = gen_int_mode (n_popped, Pmode);
452 :
453 : /* If this subroutine pops its own args, record that in the call insn
454 : if possible, for the sake of frame pointer elimination. */
455 :
456 126962 : if (valreg)
457 0 : pat = targetm.gen_call_value_pop (valreg, funmem,
458 : rounded_stack_size_rtx,
459 : next_arg_reg, n_pop);
460 : else
461 126962 : pat = targetm.gen_call_pop (funmem, rounded_stack_size_rtx,
462 : next_arg_reg, n_pop);
463 :
464 : already_popped = true;
465 : }
466 : else
467 : {
468 5678709 : if (valreg)
469 2413357 : pat = targetm.gen_call_value (valreg, funmem, rounded_stack_size_rtx,
470 : next_arg_reg, NULL_RTX);
471 : else
472 3265352 : pat = targetm.gen_call (funmem, rounded_stack_size_rtx, next_arg_reg,
473 3265352 : gen_int_mode (struct_value_size, Pmode));
474 : }
475 5935021 : emit_insn (pat);
476 :
477 : /* Find the call we just emitted. */
478 5935021 : rtx_call_insn *call_insn = last_call_insn ();
479 :
480 : /* Some target create a fresh MEM instead of reusing the one provided
481 : above. Set its MEM_EXPR. */
482 5935021 : call = get_call_rtx_from (call_insn);
483 5935021 : if (call
484 6053018 : && MEM_EXPR (XEXP (call, 0)) == NULL_TREE
485 6053018 : && MEM_EXPR (funmem) != NULL_TREE)
486 601 : set_mem_expr (XEXP (call, 0), MEM_EXPR (funmem));
487 :
488 : /* Put the register usage information there. */
489 5935021 : add_function_usage_to (call_insn, call_fusage);
490 :
491 : /* If this is a const call, then set the insn's unchanging bit. */
492 5935021 : if (ecf_flags & ECF_CONST)
493 205405 : RTL_CONST_CALL_P (call_insn) = 1;
494 :
495 : /* If this is a pure call, then set the insn's unchanging bit. */
496 5935021 : if (ecf_flags & ECF_PURE)
497 312335 : RTL_PURE_CALL_P (call_insn) = 1;
498 :
499 : /* If this is a const call, then set the insn's unchanging bit. */
500 5935021 : if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
501 39110 : RTL_LOOPING_CONST_OR_PURE_CALL_P (call_insn) = 1;
502 :
503 : /* Create a nothrow REG_EH_REGION note, if needed. */
504 5935021 : make_reg_eh_region_note (call_insn, ecf_flags, 0);
505 :
506 5935021 : if (ecf_flags & ECF_NORETURN)
507 759278 : add_reg_note (call_insn, REG_NORETURN, const0_rtx);
508 :
509 5935021 : if (ecf_flags & ECF_RETURNS_TWICE)
510 : {
511 1609 : add_reg_note (call_insn, REG_SETJMP, const0_rtx);
512 1609 : cfun->calls_setjmp = 1;
513 : }
514 :
515 5935021 : SIBLING_CALL_P (call_insn) = ((ecf_flags & ECF_SIBCALL) != 0);
516 :
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 5935021 : inhibit_defer_pop = old_inhibit_defer_pop;
520 :
521 5935021 : if (maybe_ne (n_popped, 0))
522 : {
523 126962 : if (!already_popped)
524 0 : CALL_INSN_FUNCTION_USAGE (call_insn)
525 0 : = gen_rtx_EXPR_LIST (VOIDmode,
526 : gen_rtx_CLOBBER (VOIDmode, stack_pointer_rtx),
527 : CALL_INSN_FUNCTION_USAGE (call_insn));
528 126962 : rounded_stack_size -= n_popped;
529 253924 : rounded_stack_size_rtx = gen_int_mode (rounded_stack_size, Pmode);
530 126962 : stack_pointer_delta -= n_popped;
531 :
532 126962 : add_args_size_note (call_insn, stack_pointer_delta);
533 :
534 : /* If popup is needed, stack realign must use DRAP */
535 126962 : if (SUPPORTS_STACK_ALIGNMENT)
536 126962 : crtl->need_drap = true;
537 : }
538 : /* For noreturn calls when not accumulating outgoing args force
539 : REG_ARGS_SIZE note to prevent crossjumping of calls with different
540 : args sizes. */
541 5808059 : else if (!ACCUMULATE_OUTGOING_ARGS && (ecf_flags & ECF_NORETURN) != 0)
542 759098 : add_args_size_note (call_insn, stack_pointer_delta);
543 :
544 5935021 : if (!ACCUMULATE_OUTGOING_ARGS)
545 : {
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.
549 :
550 : If returning from the subroutine does pop the args, indicate that the
551 : stack pointer will be changed. */
552 :
553 5860467 : if (maybe_ne (rounded_stack_size, 0))
554 : {
555 940045 : if (ecf_flags & ECF_NORETURN)
556 : /* Just pretend we did the pop. */
557 5935021 : stack_pointer_delta -= rounded_stack_size;
558 886052 : else if (flag_defer_pop && inhibit_defer_pop == 0
559 780123 : && ! (ecf_flags & (ECF_CONST | ECF_PURE)))
560 5935021 : pending_stack_adjust += rounded_stack_size;
561 : else
562 122315 : adjust_stack (rounded_stack_size_rtx);
563 : }
564 : }
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.
570 :
571 : ??? We may optimize similar to defer_pop above, but it is
572 : probably not worthwhile.
573 :
574 : ??? It will be worthwhile to enable combine_stack_adjustments even for
575 : such machines. */
576 74554 : else if (maybe_ne (n_popped, 0))
577 0 : anti_adjust_stack (gen_int_mode (n_popped, Pmode));
578 5935021 : }
579 :
580 : /* Determine if the function identified by FNDECL is one with
581 : special properties we wish to know about. Modify FLAGS accordingly.
582 :
583 : For example, if the function might return more than one time (setjmp), then
584 : set ECF_RETURNS_TWICE.
585 :
586 : Set ECF_MAY_BE_ALLOCA for any memory allocation function that might allocate
587 : space from the stack such as alloca. */
588 :
589 : static int
590 4501025014 : special_function_p (const_tree fndecl, int flags)
591 : {
592 4501025014 : tree name_decl = DECL_NAME (fndecl);
593 :
594 4501025014 : if (maybe_special_function_p (fndecl)
595 7579999719 : && IDENTIFIER_LENGTH (name_decl) <= 11)
596 : {
597 565112253 : const char *name = IDENTIFIER_POINTER (name_decl);
598 565112253 : const char *tname = name;
599 :
600 : /* We assume that alloca will always be called by name. It
601 : makes no sense to pass it as a pointer-to-function to
602 : anything that does not understand its behavior. */
603 565112253 : if (IDENTIFIER_LENGTH (name_decl) == 6
604 144876516 : && name[0] == 'a'
605 565782569 : && ! strcmp (name, "alloca"))
606 79139 : flags |= ECF_MAY_BE_ALLOCA;
607 :
608 : /* Disregard prefix _ or __. */
609 565112253 : if (name[0] == '_')
610 : {
611 38766678 : if (name[1] == '_')
612 12058406 : tname += 2;
613 : else
614 26708272 : tname += 1;
615 : }
616 :
617 : /* ECF_RETURNS_TWICE is safe even for -ffreestanding. */
618 565112253 : if (! strcmp (tname, "setjmp")
619 564760217 : || ! strcmp (tname, "sigsetjmp")
620 564732725 : || ! strcmp (name, "savectx")
621 564732725 : || ! strcmp (name, "vfork")
622 564711417 : || ! strcmp (name, "getcontext"))
623 426958 : flags |= ECF_RETURNS_TWICE;
624 : }
625 :
626 4501025014 : if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
627 4501025014 : && ALLOCA_FUNCTION_CODE_P (DECL_FUNCTION_CODE (fndecl)))
628 13651041 : flags |= ECF_MAY_BE_ALLOCA;
629 :
630 4501025014 : return flags;
631 : }
632 :
633 : /* Return fnspec for DECL. */
634 :
635 : static attr_fnspec
636 5629435 : decl_fnspec (tree fndecl)
637 : {
638 5629435 : tree attr;
639 5629435 : tree type = TREE_TYPE (fndecl);
640 5629435 : if (type)
641 : {
642 5629435 : attr = lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type));
643 5629435 : if (attr)
644 : {
645 348626 : return TREE_VALUE (TREE_VALUE (attr));
646 : }
647 : }
648 5280809 : if (fndecl_built_in_p (fndecl, BUILT_IN_NORMAL))
649 1175564 : return builtin_fnspec (fndecl);
650 4105245 : return "";
651 : }
652 :
653 : /* Similar to special_function_p; return a set of ERF_ flags for the
654 : function FNDECL. */
655 : static int
656 5629435 : decl_return_flags (tree fndecl)
657 : {
658 5629435 : attr_fnspec fnspec = decl_fnspec (fndecl);
659 :
660 5629435 : unsigned int arg;
661 5629435 : if (fnspec.returns_arg (&arg))
662 161534 : return ERF_RETURNS_ARG | arg;
663 :
664 5467901 : if (fnspec.returns_noalias_p ())
665 59992 : return ERF_NOALIAS;
666 : return 0;
667 : }
668 :
669 : /* Return true when FNDECL represents a call to setjmp. */
670 :
671 : bool
672 32004938 : setjmp_call_p (const_tree fndecl)
673 : {
674 32004938 : if (DECL_IS_RETURNS_TWICE (fndecl))
675 : return true;
676 32003540 : if (special_function_p (fndecl, 0) & ECF_RETURNS_TWICE)
677 2270 : return true;
678 :
679 : return false;
680 : }
681 :
682 :
683 : /* Return true if STMT may be an alloca call. */
684 :
685 : bool
686 18492909 : gimple_maybe_alloca_call_p (const gimple *stmt)
687 : {
688 18492909 : tree fndecl;
689 :
690 18492909 : if (!is_gimple_call (stmt))
691 : return false;
692 :
693 18492909 : fndecl = gimple_call_fndecl (stmt);
694 18492909 : if (fndecl && (special_function_p (fndecl, 0) & ECF_MAY_BE_ALLOCA))
695 : return true;
696 :
697 : return false;
698 : }
699 :
700 : /* Return true if STMT is a builtin alloca call. */
701 :
702 : bool
703 161844940 : gimple_alloca_call_p (const gimple *stmt)
704 : {
705 161844940 : tree fndecl;
706 :
707 161844940 : if (!is_gimple_call (stmt))
708 : return false;
709 :
710 27212833 : fndecl = gimple_call_fndecl (stmt);
711 27212833 : if (fndecl && fndecl_built_in_p (fndecl, BUILT_IN_NORMAL))
712 7191710 : switch (DECL_FUNCTION_CODE (fndecl))
713 : {
714 170766 : CASE_BUILT_IN_ALLOCA:
715 170766 : return gimple_call_num_args (stmt) > 0;
716 : default:
717 : break;
718 : }
719 :
720 : return false;
721 : }
722 :
723 : /* Return true when exp contains a builtin alloca call. */
724 :
725 : bool
726 3391751 : alloca_call_p (const_tree exp)
727 : {
728 3391751 : tree fndecl;
729 3391751 : if (TREE_CODE (exp) == CALL_EXPR
730 3391751 : && (fndecl = get_callee_fndecl (exp))
731 6783502 : && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
732 1889095 : switch (DECL_FUNCTION_CODE (fndecl))
733 : {
734 : CASE_BUILT_IN_ALLOCA:
735 : return true;
736 : default:
737 : break;
738 : }
739 :
740 : return false;
741 : }
742 :
743 : /* Return TRUE if FNDECL is either a TM builtin or a TM cloned
744 : function. Return FALSE otherwise. */
745 :
746 : static bool
747 868487 : is_tm_builtin (const_tree fndecl)
748 : {
749 868487 : if (fndecl == NULL)
750 : return false;
751 :
752 1639241 : if (decl_is_tm_clone (fndecl))
753 : return true;
754 :
755 845959 : if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
756 : {
757 458773 : switch (DECL_FUNCTION_CODE (fndecl))
758 : {
759 316760 : case BUILT_IN_TM_COMMIT:
760 316760 : case BUILT_IN_TM_COMMIT_EH:
761 316760 : case BUILT_IN_TM_ABORT:
762 316760 : case BUILT_IN_TM_IRREVOCABLE:
763 316760 : case BUILT_IN_TM_GETTMCLONE_IRR:
764 316760 : case BUILT_IN_TM_MEMCPY:
765 316760 : case BUILT_IN_TM_MEMMOVE:
766 316760 : case BUILT_IN_TM_MEMSET:
767 316760 : CASE_BUILT_IN_TM_STORE (1):
768 316760 : CASE_BUILT_IN_TM_STORE (2):
769 316760 : CASE_BUILT_IN_TM_STORE (4):
770 316760 : CASE_BUILT_IN_TM_STORE (8):
771 316760 : CASE_BUILT_IN_TM_STORE (FLOAT):
772 316760 : CASE_BUILT_IN_TM_STORE (DOUBLE):
773 316760 : CASE_BUILT_IN_TM_STORE (LDOUBLE):
774 316760 : CASE_BUILT_IN_TM_STORE (M64):
775 316760 : CASE_BUILT_IN_TM_STORE (M128):
776 316760 : CASE_BUILT_IN_TM_STORE (M256):
777 316760 : CASE_BUILT_IN_TM_LOAD (1):
778 316760 : CASE_BUILT_IN_TM_LOAD (2):
779 316760 : CASE_BUILT_IN_TM_LOAD (4):
780 316760 : CASE_BUILT_IN_TM_LOAD (8):
781 316760 : CASE_BUILT_IN_TM_LOAD (FLOAT):
782 316760 : CASE_BUILT_IN_TM_LOAD (DOUBLE):
783 316760 : CASE_BUILT_IN_TM_LOAD (LDOUBLE):
784 316760 : CASE_BUILT_IN_TM_LOAD (M64):
785 316760 : CASE_BUILT_IN_TM_LOAD (M128):
786 316760 : CASE_BUILT_IN_TM_LOAD (M256):
787 316760 : case BUILT_IN_TM_LOG:
788 316760 : case BUILT_IN_TM_LOG_1:
789 316760 : case BUILT_IN_TM_LOG_2:
790 316760 : case BUILT_IN_TM_LOG_4:
791 316760 : case BUILT_IN_TM_LOG_8:
792 316760 : case BUILT_IN_TM_LOG_FLOAT:
793 316760 : case BUILT_IN_TM_LOG_DOUBLE:
794 316760 : case BUILT_IN_TM_LOG_LDOUBLE:
795 316760 : case BUILT_IN_TM_LOG_M64:
796 316760 : case BUILT_IN_TM_LOG_M128:
797 316760 : case BUILT_IN_TM_LOG_M256:
798 316760 : return true;
799 : default:
800 : break;
801 : }
802 : }
803 : return false;
804 : }
805 :
806 : /* Detect flags (function attributes) from the function decl or type node. */
807 :
808 : int
809 8496705949 : flags_from_decl_or_type (const_tree exp)
810 : {
811 8496705949 : int flags = 0;
812 :
813 8496705949 : if (DECL_P (exp))
814 : {
815 : /* The function exp may have the `malloc' attribute. */
816 4451176176 : if (DECL_IS_MALLOC (exp))
817 97154771 : flags |= ECF_MALLOC;
818 :
819 : /* The function exp may have the `returns_twice' attribute. */
820 4451176176 : if (DECL_IS_RETURNS_TWICE (exp))
821 243888 : flags |= ECF_RETURNS_TWICE;
822 :
823 : /* Process the pure and const attributes. */
824 4451176176 : if (TREE_READONLY (exp))
825 278182454 : flags |= ECF_CONST;
826 4451176176 : if (DECL_PURE_P (exp))
827 253551412 : flags |= ECF_PURE;
828 4451176176 : if (DECL_LOOPING_CONST_OR_PURE_P (exp))
829 21881624 : flags |= ECF_LOOPING_CONST_OR_PURE;
830 :
831 4451176176 : if (DECL_IS_NOVOPS (exp))
832 633540 : flags |= ECF_NOVOPS;
833 4451176176 : if (lookup_attribute ("leaf", DECL_ATTRIBUTES (exp)))
834 857624532 : flags |= ECF_LEAF;
835 4451176176 : if (lookup_attribute ("cold", DECL_ATTRIBUTES (exp)))
836 366984767 : flags |= ECF_COLD;
837 :
838 4451176176 : if (TREE_NOTHROW (exp))
839 1976497905 : flags |= ECF_NOTHROW;
840 :
841 4451176176 : if (flag_tm)
842 : {
843 868487 : if (is_tm_builtin (exp))
844 339288 : flags |= ECF_TM_BUILTIN;
845 529199 : else if ((flags & (ECF_CONST|ECF_NOVOPS)) != 0
846 1042910 : || lookup_attribute ("transaction_pure",
847 513711 : TYPE_ATTRIBUTES (TREE_TYPE (exp))))
848 122855 : flags |= ECF_TM_PURE;
849 : }
850 :
851 4451176176 : if (lookup_attribute ("expected_throw", DECL_ATTRIBUTES (exp)))
852 14506230 : flags |= ECF_XTHROW;
853 :
854 4451176176 : flags = special_function_p (exp, flags);
855 :
856 4451176176 : if ((flags & ECF_CONST) == 0
857 8624169898 : && lookup_attribute ("unsequenced noptr",
858 4172993722 : TYPE_ATTRIBUTES (TREE_TYPE (exp))))
859 : {
860 : /* [[unsequenced]] with no pointers in arguments is like
861 : [[gnu::const]] without finite guarantee. */
862 120856 : flags |= ECF_CONST;
863 120856 : if ((flags & ECF_PURE) == 0)
864 120856 : flags |= ECF_LOOPING_CONST_OR_PURE;
865 : }
866 120856 : if ((flags & (ECF_CONST | ECF_PURE)) == 0
867 8370376774 : && lookup_attribute ("reproducible noptr",
868 3919321454 : TYPE_ATTRIBUTES (TREE_TYPE (exp))))
869 : /* [[reproducible]] with no pointers in arguments is like
870 : [[gnu::pure]] without finite guarantee. */
871 145392 : flags |= ECF_PURE | ECF_LOOPING_CONST_OR_PURE;
872 : }
873 4045529773 : else if (TYPE_P (exp))
874 : {
875 4045529773 : if (TYPE_READONLY (exp))
876 40608171 : flags |= ECF_CONST;
877 :
878 4045529773 : if (flag_tm
879 4045529773 : && ((flags & ECF_CONST) != 0
880 823745 : || lookup_attribute ("transaction_pure", TYPE_ATTRIBUTES (exp))))
881 107209 : flags |= ECF_TM_PURE;
882 :
883 4045529773 : if ((flags & ECF_CONST) == 0
884 4045529773 : && lookup_attribute ("unsequenced noptr", TYPE_ATTRIBUTES (exp)))
885 : /* [[unsequenced]] with no pointers in arguments is like
886 : [[gnu::const]] without finite guarantee. */
887 119175 : flags |= ECF_CONST | ECF_LOOPING_CONST_OR_PURE;
888 119175 : if ((flags & ECF_CONST) == 0
889 4045410598 : && lookup_attribute ("reproducible noptr", TYPE_ATTRIBUTES (exp)))
890 : /* [[reproducible]] with no pointers in arguments is like
891 : [[gnu::pure]] without finite guarantee. */
892 149615 : flags |= ECF_PURE | ECF_LOOPING_CONST_OR_PURE;
893 : }
894 : else
895 0 : gcc_unreachable ();
896 :
897 8496705949 : if (TREE_THIS_VOLATILE (exp))
898 : {
899 782068229 : flags |= ECF_NORETURN;
900 782068229 : if (flags & (ECF_CONST|ECF_PURE))
901 121267635 : flags |= ECF_LOOPING_CONST_OR_PURE;
902 : }
903 :
904 8496705949 : return flags;
905 : }
906 :
907 : /* Detect flags from a CALL_EXPR. */
908 :
909 : int
910 387030306 : call_expr_flags (const_tree t)
911 : {
912 387030306 : int flags;
913 387030306 : tree decl = get_callee_fndecl (t);
914 :
915 387030306 : if (decl)
916 353932958 : flags = flags_from_decl_or_type (decl);
917 33097348 : else if (CALL_EXPR_FN (t) == NULL_TREE)
918 996510 : flags = internal_fn_flags (CALL_EXPR_IFN (t));
919 : else
920 : {
921 32100838 : tree type = TREE_TYPE (CALL_EXPR_FN (t));
922 32100838 : if (type && TREE_CODE (type) == POINTER_TYPE)
923 8151772 : flags = flags_from_decl_or_type (TREE_TYPE (type));
924 : else
925 : flags = 0;
926 32100838 : if (CALL_EXPR_BY_DESCRIPTOR (t))
927 0 : flags |= ECF_BY_DESCRIPTOR;
928 : }
929 :
930 387030306 : return flags;
931 : }
932 :
933 : /* Return true if ARG should be passed by invisible reference. */
934 :
935 : bool
936 21394135 : pass_by_reference (CUMULATIVE_ARGS *ca, function_arg_info arg)
937 : {
938 21394135 : if (tree type = arg.type)
939 : {
940 : /* If this type contains non-trivial constructors, then it is
941 : forbidden for the middle-end to create any new copies. */
942 21189649 : if (TREE_ADDRESSABLE (type))
943 : return true;
944 :
945 : /* GCC post 3.4 passes *all* variable sized types by reference. */
946 21189518 : if (!TYPE_SIZE (type) || !poly_int_tree_p (TYPE_SIZE (type)))
947 : return true;
948 :
949 : /* If a record type should be passed the same as its first (and only)
950 : member, use the type and mode of that member. */
951 21189004 : if (TREE_CODE (type) == RECORD_TYPE && TYPE_TRANSPARENT_AGGR (type))
952 : {
953 18 : arg.type = TREE_TYPE (first_field (type));
954 18 : arg.mode = TYPE_MODE (arg.type);
955 : }
956 : }
957 :
958 21393490 : return targetm.calls.pass_by_reference (pack_cumulative_args (ca), arg);
959 : }
960 :
961 : /* Return true if TYPE should be passed by reference when passed to
962 : the "..." arguments of a function. */
963 :
964 : bool
965 52093 : pass_va_arg_by_reference (tree type)
966 : {
967 52093 : return pass_by_reference (NULL, function_arg_info (type, /*named=*/false));
968 : }
969 :
970 : /* Decide whether ARG, which occurs in the state described by CA,
971 : should be passed by reference. Return true if so and update
972 : ARG accordingly. */
973 :
974 : bool
975 9180022 : apply_pass_by_reference_rules (CUMULATIVE_ARGS *ca, function_arg_info &arg)
976 : {
977 9180022 : if (pass_by_reference (ca, arg))
978 : {
979 10063 : arg.type = build_pointer_type (arg.type);
980 10063 : arg.mode = TYPE_MODE (arg.type);
981 10063 : arg.pass_by_reference = true;
982 10063 : return true;
983 : }
984 : return false;
985 : }
986 :
987 : /* Return true if ARG, which is passed by reference, should be callee
988 : copied instead of caller copied. */
989 :
990 : bool
991 5313 : reference_callee_copied (CUMULATIVE_ARGS *ca, const function_arg_info &arg)
992 : {
993 5313 : if (arg.type && TREE_ADDRESSABLE (arg.type))
994 : return false;
995 5300 : return targetm.calls.callee_copies (pack_cumulative_args (ca), arg);
996 : }
997 :
998 :
999 : /* Precompute all register parameters as described by ARGS, storing values
1000 : into fields within the ARGS array.
1001 :
1002 : NUM_ACTUALS indicates the total number elements in the ARGS array.
1003 :
1004 : Set REG_PARM_SEEN if we encounter a register parameter. */
1005 :
1006 : static void
1007 5817626 : precompute_register_parameters (int num_actuals, struct arg_data *args,
1008 : int *reg_parm_seen)
1009 : {
1010 5817626 : int i;
1011 :
1012 5817626 : *reg_parm_seen = 0;
1013 :
1014 17775199 : for (i = 0; i < num_actuals; i++)
1015 11957574 : if (args[i].reg != 0 && ! args[i].pass_on_stack)
1016 : {
1017 9815883 : *reg_parm_seen = 1;
1018 :
1019 9815883 : if (args[i].value == 0)
1020 : {
1021 9815883 : push_temp_slots ();
1022 9815883 : args[i].value = expand_normal (args[i].tree_value);
1023 9815882 : preserve_temp_slots (args[i].value);
1024 9815882 : pop_temp_slots ();
1025 : }
1026 :
1027 : /* If we are to promote the function arg to a wider mode,
1028 : do it now. */
1029 :
1030 9815882 : machine_mode old_mode = TYPE_MODE (TREE_TYPE (args[i].tree_value));
1031 :
1032 : /* Some ABIs require scalar floating point modes to be returned
1033 : in a wider scalar integer mode. We need to explicitly
1034 : reinterpret to an integer mode of the correct precision
1035 : before extending to the desired result. */
1036 9815882 : if (SCALAR_INT_MODE_P (args[i].mode)
1037 9428041 : && SCALAR_FLOAT_MODE_P (old_mode)
1038 9815882 : && known_gt (GET_MODE_SIZE (args[i].mode),
1039 : GET_MODE_SIZE (old_mode)))
1040 0 : args[i].value = convert_float_to_wider_int (args[i].mode, old_mode,
1041 : args[i].value);
1042 9815882 : else if (args[i].mode != old_mode)
1043 306960 : args[i].value = convert_modes (args[i].mode, old_mode,
1044 : args[i].value, args[i].unsignedp);
1045 :
1046 : /* If the value is a non-legitimate constant, force it into a
1047 : pseudo now. TLS symbols sometimes need a call to resolve. */
1048 9815882 : if (CONSTANT_P (args[i].value)
1049 9815882 : && (!targetm.legitimate_constant_p (args[i].mode, args[i].value)
1050 4260287 : || targetm.precompute_tls_p (args[i].mode, args[i].value)))
1051 3909 : args[i].value = force_reg (args[i].mode, args[i].value);
1052 :
1053 : /* If we're going to have to load the value by parts, pull the
1054 : parts into pseudos. The part extraction process can involve
1055 : non-trivial computation. */
1056 9815882 : if (GET_CODE (args[i].reg) == PARALLEL)
1057 : {
1058 283576 : tree type = TREE_TYPE (args[i].tree_value);
1059 283576 : args[i].parallel_value
1060 283576 : = emit_group_load_into_temps (args[i].reg, args[i].value,
1061 283576 : type, int_size_in_bytes (type));
1062 : }
1063 :
1064 : /* If the value is expensive, and we are inside an appropriately
1065 : short loop, put the value into a pseudo and then put the pseudo
1066 : into the hard reg.
1067 :
1068 : For small register classes, also do this if this call uses
1069 : register parameters. This is to avoid reload conflicts while
1070 : loading the parameters registers. */
1071 :
1072 5002910 : else if ((! (REG_P (args[i].value)
1073 : || (GET_CODE (args[i].value) == SUBREG
1074 18033 : && REG_P (SUBREG_REG (args[i].value)))))
1075 4984877 : && args[i].mode != BLKmode
1076 4983269 : && (set_src_cost (args[i].value, args[i].mode,
1077 4983269 : optimize_insn_for_speed_p ())
1078 : > COSTS_N_INSNS (1))
1079 10372095 : && ((*reg_parm_seen
1080 839789 : && targetm.small_register_classes_for_mode_p (args[i].mode))
1081 0 : || optimize))
1082 839789 : args[i].value = copy_to_mode_reg (args[i].mode, args[i].value);
1083 : }
1084 5817625 : }
1085 :
1086 : #ifdef REG_PARM_STACK_SPACE
1087 :
1088 : /* The argument list is the property of the called routine and it
1089 : may clobber it. If the fixed area has been used for previous
1090 : parameters, we must save and restore it. */
1091 :
1092 : static rtx
1093 73368 : save_fixed_argument_area (int reg_parm_stack_space, rtx argblock, int *low_to_save, int *high_to_save)
1094 : {
1095 73368 : unsigned int low;
1096 73368 : unsigned int high;
1097 :
1098 : /* Compute the boundary of the area that needs to be saved, if any. */
1099 73368 : high = reg_parm_stack_space;
1100 73368 : if (ARGS_GROW_DOWNWARD)
1101 : high += 1;
1102 :
1103 73368 : if (high > highest_outgoing_arg_in_use)
1104 : high = highest_outgoing_arg_in_use;
1105 :
1106 264248 : for (low = 0; low < high; low++)
1107 190880 : if (stack_usage_map[low] != 0 || low >= stack_usage_watermark)
1108 : {
1109 : int num_to_save;
1110 : machine_mode save_mode;
1111 : int delta;
1112 : rtx addr;
1113 : rtx stack_area;
1114 : rtx save_area;
1115 :
1116 0 : while (stack_usage_map[--high] == 0)
1117 : ;
1118 :
1119 0 : *low_to_save = low;
1120 0 : *high_to_save = high;
1121 :
1122 0 : num_to_save = high - low + 1;
1123 :
1124 : /* If we don't have the required alignment, must do this
1125 : in BLKmode. */
1126 0 : scalar_int_mode imode;
1127 0 : if (int_mode_for_size (num_to_save * BITS_PER_UNIT, 1).exists (&imode)
1128 0 : && (low & (MIN (GET_MODE_SIZE (imode),
1129 0 : BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1)) == 0)
1130 0 : save_mode = imode;
1131 : else
1132 : save_mode = BLKmode;
1133 :
1134 0 : if (ARGS_GROW_DOWNWARD)
1135 : delta = -high;
1136 : else
1137 0 : delta = low;
1138 :
1139 0 : addr = plus_constant (Pmode, argblock, delta);
1140 0 : stack_area = gen_rtx_MEM (save_mode, memory_address (save_mode, addr));
1141 :
1142 0 : set_mem_align (stack_area, PARM_BOUNDARY);
1143 0 : if (save_mode == BLKmode)
1144 : {
1145 0 : save_area = assign_stack_temp (BLKmode, num_to_save);
1146 0 : emit_block_move (validize_mem (save_area), stack_area,
1147 : GEN_INT (num_to_save), BLOCK_OP_CALL_PARM);
1148 : }
1149 : else
1150 : {
1151 0 : save_area = gen_reg_rtx (save_mode);
1152 0 : emit_move_insn (save_area, stack_area);
1153 : }
1154 :
1155 0 : return save_area;
1156 : }
1157 :
1158 : return NULL_RTX;
1159 : }
1160 :
1161 : static void
1162 0 : restore_fixed_argument_area (rtx save_area, rtx argblock, int high_to_save, int low_to_save)
1163 : {
1164 0 : machine_mode save_mode = GET_MODE (save_area);
1165 0 : int delta;
1166 0 : rtx addr, stack_area;
1167 :
1168 0 : if (ARGS_GROW_DOWNWARD)
1169 : delta = -high_to_save;
1170 : else
1171 0 : delta = low_to_save;
1172 :
1173 0 : addr = plus_constant (Pmode, argblock, delta);
1174 0 : stack_area = gen_rtx_MEM (save_mode, memory_address (save_mode, addr));
1175 0 : set_mem_align (stack_area, PARM_BOUNDARY);
1176 :
1177 0 : if (save_mode != BLKmode)
1178 0 : emit_move_insn (stack_area, save_area);
1179 : else
1180 0 : emit_block_move (stack_area, validize_mem (save_area),
1181 0 : GEN_INT (high_to_save - low_to_save + 1),
1182 : BLOCK_OP_CALL_PARM);
1183 0 : }
1184 : #endif /* REG_PARM_STACK_SPACE */
1185 :
1186 : /* If any elements in ARGS refer to parameters that are to be passed in
1187 : registers, but not in memory, and whose alignment does not permit a
1188 : direct copy into registers. Copy the values into a group of pseudos
1189 : which we will later copy into the appropriate hard registers.
1190 :
1191 : Pseudos for each unaligned argument will be stored into the array
1192 : args[argnum].aligned_regs. The caller is responsible for deallocating
1193 : the aligned_regs array if it is nonzero. */
1194 :
1195 : static void
1196 0 : store_unaligned_arguments_into_pseudos (struct arg_data *args, int num_actuals)
1197 : {
1198 0 : int i, j;
1199 :
1200 0 : for (i = 0; i < num_actuals; i++)
1201 0 : if (args[i].reg != 0 && ! args[i].pass_on_stack
1202 0 : && GET_CODE (args[i].reg) != PARALLEL
1203 0 : && args[i].mode == BLKmode
1204 0 : && MEM_P (args[i].value)
1205 0 : && (MEM_ALIGN (args[i].value)
1206 0 : < (unsigned int) MIN (BIGGEST_ALIGNMENT, BITS_PER_WORD)))
1207 : {
1208 0 : int bytes = int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1209 0 : int endian_correction = 0;
1210 :
1211 0 : if (args[i].partial)
1212 : {
1213 0 : gcc_assert (args[i].partial % UNITS_PER_WORD == 0);
1214 0 : args[i].n_aligned_regs = args[i].partial / UNITS_PER_WORD;
1215 : }
1216 : else
1217 : {
1218 0 : args[i].n_aligned_regs
1219 0 : = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD;
1220 : }
1221 :
1222 0 : args[i].aligned_regs = XNEWVEC (rtx, args[i].n_aligned_regs);
1223 :
1224 : /* Structures smaller than a word are normally aligned to the
1225 : least significant byte. On a BYTES_BIG_ENDIAN machine,
1226 : this means we must skip the empty high order bytes when
1227 : calculating the bit offset. */
1228 0 : if (bytes < UNITS_PER_WORD
1229 : #ifdef BLOCK_REG_PADDING
1230 : && (BLOCK_REG_PADDING (args[i].mode,
1231 : TREE_TYPE (args[i].tree_value), 1)
1232 : == PAD_DOWNWARD)
1233 : #else
1234 : && BYTES_BIG_ENDIAN
1235 : #endif
1236 : )
1237 : endian_correction = BITS_PER_WORD - bytes * BITS_PER_UNIT;
1238 :
1239 0 : for (j = 0; j < args[i].n_aligned_regs; j++)
1240 : {
1241 0 : rtx reg = gen_reg_rtx (word_mode);
1242 0 : rtx word = operand_subword_force (args[i].value, j, BLKmode);
1243 0 : int bitsize = MIN (bytes * BITS_PER_UNIT, BITS_PER_WORD);
1244 :
1245 0 : args[i].aligned_regs[j] = reg;
1246 0 : word = extract_bit_field (word, bitsize, 0, 1, NULL_RTX,
1247 : word_mode, word_mode, false, NULL);
1248 :
1249 : /* There is no need to restrict this code to loading items
1250 : in TYPE_ALIGN sized hunks. The bitfield instructions can
1251 : load up entire word sized registers efficiently.
1252 :
1253 : ??? This may not be needed anymore.
1254 : We use to emit a clobber here but that doesn't let later
1255 : passes optimize the instructions we emit. By storing 0 into
1256 : the register later passes know the first AND to zero out the
1257 : bitfield being set in the register is unnecessary. The store
1258 : of 0 will be deleted as will at least the first AND. */
1259 :
1260 0 : emit_move_insn (reg, const0_rtx);
1261 :
1262 0 : bytes -= bitsize / BITS_PER_UNIT;
1263 0 : store_bit_field (reg, bitsize, endian_correction, 0, 0,
1264 : word_mode, word, false, false);
1265 : }
1266 : }
1267 0 : }
1268 :
1269 : /* Issue an error if CALL_EXPR was flagged as requiring
1270 : tall-call optimization. */
1271 :
1272 : void
1273 5695810 : maybe_complain_about_tail_call (tree call_expr, const char *reason)
1274 : {
1275 5695810 : gcc_assert (TREE_CODE (call_expr) == CALL_EXPR);
1276 5695810 : if (CALL_EXPR_TAILCALL (call_expr)
1277 11016 : && dump_file
1278 5695810 : && (dump_flags & TDF_DETAILS))
1279 : {
1280 0 : fprintf (dump_file, ";; Cannot tail-call: %s: ", reason);
1281 0 : print_generic_expr (dump_file, call_expr, TDF_SLIM);
1282 0 : fprintf (dump_file, "\n");
1283 : }
1284 5695810 : if (CALL_EXPR_MUST_TAIL_CALL (call_expr))
1285 : {
1286 20 : error_at (EXPR_LOCATION (call_expr), "cannot tail-call: %s", reason);
1287 20 : CALL_EXPR_MUST_TAIL_CALL (call_expr) = 0;
1288 : }
1289 5695810 : }
1290 :
1291 : /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1292 : CALL_EXPR EXP.
1293 :
1294 : NUM_ACTUALS is the total number of parameters.
1295 :
1296 : N_NAMED_ARGS is the total number of named arguments.
1297 :
1298 : STRUCT_VALUE_ADDR_VALUE is the implicit argument for a struct return
1299 : value, or null.
1300 :
1301 : FNDECL is the tree code for the target of this call (if known)
1302 :
1303 : ARGS_SO_FAR holds state needed by the target to know where to place
1304 : the next argument.
1305 :
1306 : REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1307 : for arguments which are passed in registers.
1308 :
1309 : OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1310 : and may be modified by this routine.
1311 :
1312 : OLD_PENDING_ADJ and FLAGS are pointers to integer flags which
1313 : may be modified by this routine.
1314 :
1315 : MUST_PREALLOCATE is a pointer to bool which may be
1316 : modified by this routine.
1317 :
1318 : MAY_TAILCALL is cleared if we encounter an invisible pass-by-reference
1319 : that requires allocation of stack space.
1320 :
1321 : CALL_FROM_THUNK_P is true if this call is the jump from a thunk to
1322 : the thunked-to function. */
1323 :
1324 : static void
1325 5817622 : initialize_argument_information (int num_actuals ATTRIBUTE_UNUSED,
1326 : struct arg_data *args,
1327 : struct args_size *args_size,
1328 : int n_named_args ATTRIBUTE_UNUSED,
1329 : tree exp, tree struct_value_addr_value,
1330 : tree fndecl, tree fntype,
1331 : cumulative_args_t args_so_far,
1332 : int reg_parm_stack_space,
1333 : rtx *old_stack_level,
1334 : poly_int64 *old_pending_adj,
1335 : bool *must_preallocate, int *ecf_flags,
1336 : bool *may_tailcall, bool call_from_thunk_p)
1337 : {
1338 5817622 : CUMULATIVE_ARGS *args_so_far_pnt = get_cumulative_args (args_so_far);
1339 5817622 : location_t loc = EXPR_LOCATION (exp);
1340 :
1341 : /* Count arg position in order args appear. */
1342 5817622 : int argpos;
1343 :
1344 5817622 : int i;
1345 :
1346 5817622 : args_size->constant = 0;
1347 5817622 : args_size->var = 0;
1348 :
1349 : /* In this loop, we consider args in the order they are written.
1350 : We fill up ARGS from the back. */
1351 :
1352 5817622 : i = num_actuals - 1;
1353 5817622 : {
1354 5817622 : int j = i;
1355 5817622 : call_expr_arg_iterator iter;
1356 5817622 : tree arg;
1357 :
1358 5817622 : if (struct_value_addr_value)
1359 : {
1360 225052 : args[j].tree_value = struct_value_addr_value;
1361 225052 : j--;
1362 : }
1363 5817622 : argpos = 0;
1364 17550104 : FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
1365 : {
1366 11732482 : tree argtype = TREE_TYPE (arg);
1367 :
1368 11732482 : if (targetm.calls.split_complex_arg
1369 0 : && argtype
1370 0 : && TREE_CODE (argtype) == COMPLEX_TYPE
1371 11732482 : && targetm.calls.split_complex_arg (argtype))
1372 : {
1373 0 : tree subtype = TREE_TYPE (argtype);
1374 0 : args[j].tree_value = build1 (REALPART_EXPR, subtype, arg);
1375 0 : j--;
1376 0 : args[j].tree_value = build1 (IMAGPART_EXPR, subtype, arg);
1377 : }
1378 : else
1379 11732482 : args[j].tree_value = arg;
1380 11732482 : j--;
1381 11732482 : argpos++;
1382 : }
1383 : }
1384 :
1385 5817622 : bool promote_p
1386 11447057 : = targetm.calls.promote_prototypes (fndecl
1387 5629435 : ? TREE_TYPE (fndecl)
1388 : : fntype);
1389 :
1390 : /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1391 17775156 : for (argpos = 0; argpos < num_actuals; i--, argpos++)
1392 : {
1393 11957534 : tree type = TREE_TYPE (args[i].tree_value);
1394 11957534 : int unsignedp;
1395 :
1396 : /* Replace erroneous argument with constant zero. */
1397 11957534 : if (type == error_mark_node || !COMPLETE_TYPE_P (type))
1398 0 : args[i].tree_value = integer_zero_node, type = integer_type_node;
1399 11957534 : else if (promote_p
1400 11957534 : && INTEGRAL_TYPE_P (type)
1401 15903602 : && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
1402 : type = integer_type_node;
1403 :
1404 : /* If TYPE is a transparent union or record, pass things the way
1405 : we would pass the first field of the union or record. We have
1406 : already verified that the modes are the same. */
1407 11957534 : if (RECORD_OR_UNION_TYPE_P (type) && TYPE_TRANSPARENT_AGGR (type))
1408 3635 : type = TREE_TYPE (first_field (type));
1409 :
1410 : /* Decide where to pass this arg.
1411 :
1412 : args[i].reg is nonzero if all or part is passed in registers.
1413 :
1414 : args[i].partial is nonzero if part but not all is passed in registers,
1415 : and the exact value says how many bytes are passed in registers.
1416 :
1417 : args[i].pass_on_stack is true if the argument must at least be
1418 : computed on the stack. It may then be loaded back into registers
1419 : if args[i].reg is nonzero.
1420 :
1421 : These decisions are driven by the FUNCTION_... macros and must agree
1422 : with those made by function.cc. */
1423 :
1424 : /* See if this argument should be passed by invisible reference. */
1425 11957534 : function_arg_info arg (type, argpos < n_named_args);
1426 11957534 : if (pass_by_reference (args_so_far_pnt, arg))
1427 : {
1428 375 : const bool callee_copies
1429 375 : = reference_callee_copied (args_so_far_pnt, arg);
1430 375 : tree base;
1431 :
1432 : /* If we're compiling a thunk, pass directly the address of an object
1433 : already in memory, instead of making a copy. Likewise if we want
1434 : to make the copy in the callee instead of the caller. */
1435 375 : if ((call_from_thunk_p || callee_copies)
1436 13 : && TREE_CODE (args[i].tree_value) != WITH_SIZE_EXPR
1437 13 : && ((base = get_base_address (args[i].tree_value)), true)
1438 13 : && TREE_CODE (base) != SSA_NAME
1439 388 : && (!DECL_P (base) || MEM_P (DECL_RTL (base))))
1440 : {
1441 : /* We may have turned the parameter value into an SSA name.
1442 : Go back to the original parameter so we can take the
1443 : address. */
1444 13 : if (TREE_CODE (args[i].tree_value) == SSA_NAME)
1445 : {
1446 0 : gcc_assert (SSA_NAME_IS_DEFAULT_DEF (args[i].tree_value));
1447 0 : args[i].tree_value = SSA_NAME_VAR (args[i].tree_value);
1448 0 : gcc_assert (TREE_CODE (args[i].tree_value) == PARM_DECL);
1449 : }
1450 : /* Argument setup code may have copied the value to register. We
1451 : revert that optimization now because the tail call code must
1452 : use the original location. */
1453 13 : if (TREE_CODE (args[i].tree_value) == PARM_DECL
1454 0 : && !MEM_P (DECL_RTL (args[i].tree_value))
1455 0 : && DECL_INCOMING_RTL (args[i].tree_value)
1456 13 : && MEM_P (DECL_INCOMING_RTL (args[i].tree_value)))
1457 0 : set_decl_rtl (args[i].tree_value,
1458 0 : DECL_INCOMING_RTL (args[i].tree_value));
1459 :
1460 13 : mark_addressable (args[i].tree_value);
1461 :
1462 : /* We can't use sibcalls if a callee-copied argument is
1463 : stored in the current function's frame. */
1464 13 : if (!call_from_thunk_p && DECL_P (base) && !TREE_STATIC (base))
1465 : {
1466 0 : *may_tailcall = false;
1467 0 : maybe_complain_about_tail_call (exp, _("a callee-copied "
1468 : "argument is stored "
1469 : "in the current "
1470 : "function's frame"));
1471 : }
1472 :
1473 13 : args[i].tree_value = build_fold_addr_expr_loc (loc,
1474 : args[i].tree_value);
1475 13 : type = TREE_TYPE (args[i].tree_value);
1476 :
1477 13 : if (*ecf_flags & ECF_CONST)
1478 0 : *ecf_flags &= ~(ECF_CONST | ECF_LOOPING_CONST_OR_PURE);
1479 : }
1480 : else
1481 : {
1482 : /* We make a copy of the object and pass the address to the
1483 : function being called. */
1484 362 : rtx copy;
1485 :
1486 362 : if (!COMPLETE_TYPE_P (type)
1487 362 : || TREE_CODE (TYPE_SIZE_UNIT (type)) != INTEGER_CST
1488 467 : || (flag_stack_check == GENERIC_STACK_CHECK
1489 0 : && compare_tree_int (TYPE_SIZE_UNIT (type),
1490 : STACK_CHECK_MAX_VAR_SIZE) > 0))
1491 : {
1492 : /* This is a variable-sized object. Make space on the stack
1493 : for it. */
1494 257 : rtx size_rtx = expr_size (args[i].tree_value);
1495 :
1496 257 : if (*old_stack_level == 0)
1497 : {
1498 158 : emit_stack_save (SAVE_BLOCK, old_stack_level);
1499 158 : *old_pending_adj = pending_stack_adjust;
1500 158 : pending_stack_adjust = 0;
1501 : }
1502 :
1503 : /* We can pass TRUE as the 4th argument because we just
1504 : saved the stack pointer and will restore it right after
1505 : the call. */
1506 514 : copy = allocate_dynamic_stack_space (size_rtx,
1507 257 : TYPE_ALIGN (type),
1508 257 : TYPE_ALIGN (type),
1509 : max_int_size_in_bytes
1510 : (type),
1511 : true);
1512 257 : copy = gen_rtx_MEM (BLKmode, copy);
1513 257 : set_mem_attributes (copy, type, 1);
1514 : }
1515 : else
1516 105 : copy = assign_temp (type, 1, 0);
1517 :
1518 362 : store_expr (args[i].tree_value, copy, 0, false, false);
1519 :
1520 : /* Just change the const function to pure and then let
1521 : the next test clear the pure based on
1522 : callee_copies. */
1523 362 : if (*ecf_flags & ECF_CONST)
1524 : {
1525 1 : *ecf_flags &= ~ECF_CONST;
1526 1 : *ecf_flags |= ECF_PURE;
1527 : }
1528 :
1529 362 : if (!callee_copies && *ecf_flags & ECF_PURE)
1530 3 : *ecf_flags &= ~(ECF_PURE | ECF_LOOPING_CONST_OR_PURE);
1531 :
1532 362 : args[i].tree_value
1533 362 : = build_fold_addr_expr_loc (loc, make_tree (type, copy));
1534 362 : type = TREE_TYPE (args[i].tree_value);
1535 362 : *may_tailcall = false;
1536 362 : maybe_complain_about_tail_call (exp,
1537 362 : _("argument must be passed"
1538 : " by copying"));
1539 : }
1540 375 : arg.pass_by_reference = true;
1541 : }
1542 :
1543 11957534 : unsignedp = TYPE_UNSIGNED (type);
1544 11957534 : arg.type = type;
1545 11957534 : arg.mode
1546 23533427 : = promote_function_mode (type, TYPE_MODE (type), &unsignedp,
1547 11575893 : fndecl ? TREE_TYPE (fndecl) : fntype, 0);
1548 :
1549 11957534 : args[i].unsignedp = unsignedp;
1550 11957534 : args[i].mode = arg.mode;
1551 :
1552 11957534 : targetm.calls.warn_parameter_passing_abi (args_so_far, type);
1553 :
1554 11957534 : args[i].reg = targetm.calls.function_arg (args_so_far, arg);
1555 :
1556 : /* If this is a sibling call and the machine has register windows, the
1557 : register window has to be unwinded before calling the routine, so
1558 : arguments have to go into the incoming registers. */
1559 11957534 : if (targetm.calls.function_incoming_arg != targetm.calls.function_arg)
1560 0 : args[i].tail_call_reg
1561 0 : = targetm.calls.function_incoming_arg (args_so_far, arg);
1562 : else
1563 11957534 : args[i].tail_call_reg = args[i].reg;
1564 :
1565 11957534 : if (args[i].reg)
1566 9815871 : args[i].partial = targetm.calls.arg_partial_bytes (args_so_far, arg);
1567 :
1568 11957534 : args[i].pass_on_stack = targetm.calls.must_pass_in_stack (arg);
1569 :
1570 : /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1571 : it means that we are to pass this arg in the register(s) designated
1572 : by the PARALLEL, but also to pass it in the stack. */
1573 11957534 : if (args[i].reg && GET_CODE (args[i].reg) == PARALLEL
1574 283576 : && XEXP (XVECEXP (args[i].reg, 0, 0), 0) == 0)
1575 0 : args[i].pass_on_stack = true;
1576 :
1577 : /* If this is an addressable type, we must preallocate the stack
1578 : since we must evaluate the object into its final location.
1579 :
1580 : If this is to be passed in both registers and the stack, it is simpler
1581 : to preallocate. */
1582 11957534 : if (TREE_ADDRESSABLE (type)
1583 11957534 : || (args[i].pass_on_stack && args[i].reg != 0))
1584 0 : *must_preallocate = true;
1585 :
1586 : /* Compute the stack-size of this argument. */
1587 11957534 : if (args[i].reg == 0 || args[i].partial != 0
1588 9815871 : || reg_parm_stack_space > 0
1589 9749774 : || args[i].pass_on_stack)
1590 2207760 : locate_and_pad_parm (arg.mode, type,
1591 : #ifdef STACK_PARMS_IN_REG_PARM_AREA
1592 : 1,
1593 : #else
1594 : args[i].reg != 0,
1595 : #endif
1596 : reg_parm_stack_space,
1597 2207760 : args[i].pass_on_stack ? 0 : args[i].partial,
1598 : fndecl, args_size, &args[i].locate);
1599 : #ifdef BLOCK_REG_PADDING
1600 : else
1601 : /* The argument is passed entirely in registers. See at which
1602 : end it should be padded. */
1603 : args[i].locate.where_pad =
1604 : BLOCK_REG_PADDING (arg.mode, type,
1605 : int_size_in_bytes (type) <= UNITS_PER_WORD);
1606 : #endif
1607 :
1608 : /* Update ARGS_SIZE, the total stack space for args so far. */
1609 :
1610 11957534 : args_size->constant += args[i].locate.size.constant;
1611 11957534 : if (args[i].locate.size.var)
1612 0 : ADD_PARM_SIZE (*args_size, args[i].locate.size.var);
1613 :
1614 : /* Increment ARGS_SO_FAR, which has info about which arg-registers
1615 : have been used, etc. */
1616 :
1617 : /* ??? Traditionally we've passed TYPE_MODE here, instead of the
1618 : promoted_mode used for function_arg above. However, the
1619 : corresponding handling of incoming arguments in function.cc
1620 : does pass the promoted mode. */
1621 11957534 : arg.mode = TYPE_MODE (type);
1622 11957534 : targetm.calls.function_arg_advance (args_so_far, arg);
1623 : }
1624 5817622 : }
1625 :
1626 : /* Update ARGS_SIZE to contain the total size for the argument block.
1627 : Return the original constant component of the argument block's size.
1628 :
1629 : REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1630 : for arguments passed in registers. */
1631 :
1632 : static poly_int64
1633 5817626 : compute_argument_block_size (int reg_parm_stack_space,
1634 : struct args_size *args_size,
1635 : tree fndecl ATTRIBUTE_UNUSED,
1636 : tree fntype ATTRIBUTE_UNUSED,
1637 : int preferred_stack_boundary ATTRIBUTE_UNUSED)
1638 : {
1639 5817626 : poly_int64 unadjusted_args_size = args_size->constant;
1640 :
1641 : /* For accumulate outgoing args mode we don't need to align, since the frame
1642 : will be already aligned. Align to STACK_BOUNDARY in order to prevent
1643 : backends from generating misaligned frame sizes. */
1644 5817626 : if (ACCUMULATE_OUTGOING_ARGS && preferred_stack_boundary > STACK_BOUNDARY)
1645 1069 : preferred_stack_boundary = STACK_BOUNDARY;
1646 :
1647 : /* Compute the actual size of the argument block required. The variable
1648 : and constant sizes must be combined, the size may have to be rounded,
1649 : and there may be a minimum required size. */
1650 :
1651 5817626 : if (args_size->var)
1652 : {
1653 0 : args_size->var = ARGS_SIZE_TREE (*args_size);
1654 0 : args_size->constant = 0;
1655 :
1656 0 : preferred_stack_boundary /= BITS_PER_UNIT;
1657 0 : if (preferred_stack_boundary > 1)
1658 : {
1659 : /* We don't handle this case yet. To handle it correctly we have
1660 : to add the delta, round and subtract the delta.
1661 : Currently no machine description requires this support. */
1662 0 : gcc_assert (multiple_p (stack_pointer_delta,
1663 : preferred_stack_boundary));
1664 0 : args_size->var = round_up (args_size->var, preferred_stack_boundary);
1665 : }
1666 :
1667 0 : if (reg_parm_stack_space > 0)
1668 : {
1669 0 : args_size->var
1670 0 : = size_binop (MAX_EXPR, args_size->var,
1671 : ssize_int (reg_parm_stack_space));
1672 :
1673 : /* The area corresponding to register parameters is not to count in
1674 : the size of the block we need. So make the adjustment. */
1675 0 : if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl))))
1676 0 : args_size->var
1677 0 : = size_binop (MINUS_EXPR, args_size->var,
1678 : ssize_int (reg_parm_stack_space));
1679 : }
1680 : }
1681 : else
1682 : {
1683 5817626 : preferred_stack_boundary /= BITS_PER_UNIT;
1684 5817626 : if (preferred_stack_boundary < 1)
1685 129350 : preferred_stack_boundary = 1;
1686 5817626 : args_size->constant = (aligned_upper_bound (args_size->constant
1687 5817626 : + stack_pointer_delta,
1688 : preferred_stack_boundary)
1689 5817626 : - stack_pointer_delta);
1690 :
1691 5817626 : args_size->constant = upper_bound (args_size->constant,
1692 : reg_parm_stack_space);
1693 :
1694 5817626 : if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl))))
1695 5781333 : args_size->constant -= reg_parm_stack_space;
1696 : }
1697 5817626 : return unadjusted_args_size;
1698 : }
1699 :
1700 : /* Precompute parameters as needed for a function call.
1701 :
1702 : FLAGS is mask of ECF_* constants.
1703 :
1704 : NUM_ACTUALS is the number of arguments.
1705 :
1706 : ARGS is an array containing information for each argument; this
1707 : routine fills in the INITIAL_VALUE and VALUE fields for each
1708 : precomputed argument. */
1709 :
1710 : static void
1711 5688276 : precompute_arguments (int num_actuals, struct arg_data *args)
1712 : {
1713 5688276 : int i;
1714 :
1715 : /* If this is a libcall, then precompute all arguments so that we do not
1716 : get extraneous instructions emitted as part of the libcall sequence. */
1717 :
1718 : /* If we preallocated the stack space, and some arguments must be passed
1719 : on the stack, then we must precompute any parameter which contains a
1720 : function call which will store arguments on the stack.
1721 : Otherwise, evaluating the parameter may clobber previous parameters
1722 : which have already been stored into the stack. (we have code to avoid
1723 : such case by saving the outgoing stack arguments, but it results in
1724 : worse code) */
1725 5688276 : if (!ACCUMULATE_OUTGOING_ARGS)
1726 5614920 : return;
1727 :
1728 366508 : for (i = 0; i < num_actuals; i++)
1729 : {
1730 293152 : tree type;
1731 293152 : machine_mode mode;
1732 :
1733 293152 : if (TREE_CODE (args[i].tree_value) != CALL_EXPR)
1734 293152 : continue;
1735 :
1736 : /* If this is an addressable type, we cannot pre-evaluate it. */
1737 0 : type = TREE_TYPE (args[i].tree_value);
1738 0 : gcc_assert (!TREE_ADDRESSABLE (type));
1739 :
1740 0 : args[i].initial_value = args[i].value
1741 0 : = expand_normal (args[i].tree_value);
1742 :
1743 0 : mode = TYPE_MODE (type);
1744 0 : if (mode != args[i].mode)
1745 : {
1746 0 : int unsignedp = args[i].unsignedp;
1747 0 : args[i].value
1748 0 : = convert_modes (args[i].mode, mode,
1749 : args[i].value, args[i].unsignedp);
1750 :
1751 : /* CSE will replace this only if it contains args[i].value
1752 : pseudo, so convert it down to the declared mode using
1753 : a SUBREG. */
1754 0 : if (REG_P (args[i].value)
1755 0 : && GET_MODE_CLASS (args[i].mode) == MODE_INT
1756 0 : && promote_mode (type, mode, &unsignedp) != args[i].mode)
1757 : {
1758 0 : args[i].initial_value
1759 0 : = gen_lowpart_SUBREG (mode, args[i].value);
1760 0 : SUBREG_PROMOTED_VAR_P (args[i].initial_value) = 1;
1761 0 : SUBREG_PROMOTED_SET (args[i].initial_value, args[i].unsignedp);
1762 : }
1763 : }
1764 : }
1765 : }
1766 :
1767 : /* Given the current state of MUST_PREALLOCATE and information about
1768 : arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
1769 : compute and return the final value for MUST_PREALLOCATE. */
1770 :
1771 : static bool
1772 5817622 : finalize_must_preallocate (bool must_preallocate, int num_actuals,
1773 : struct arg_data *args, struct args_size *args_size)
1774 : {
1775 : /* See if we have or want to preallocate stack space.
1776 :
1777 : If we would have to push a partially-in-regs parm
1778 : before other stack parms, preallocate stack space instead.
1779 :
1780 : If the size of some parm is not a multiple of the required stack
1781 : alignment, we must preallocate.
1782 :
1783 : If the total size of arguments that would otherwise create a copy in
1784 : a temporary (such as a CALL) is more than half the total argument list
1785 : size, preallocation is faster.
1786 :
1787 : Another reason to preallocate is if we have a machine (like the m88k)
1788 : where stack alignment is required to be maintained between every
1789 : pair of insns, not just when the call is made. However, we assume here
1790 : that such machines either do not have push insns (and hence preallocation
1791 : would occur anyway) or the problem is taken care of with
1792 : PUSH_ROUNDING. */
1793 :
1794 5817622 : if (! must_preallocate)
1795 : {
1796 : bool partial_seen = false;
1797 : poly_int64 copy_to_evaluate_size = 0;
1798 : int i;
1799 :
1800 17406242 : for (i = 0; i < num_actuals && ! must_preallocate; i++)
1801 : {
1802 11663169 : if (args[i].partial > 0 && ! args[i].pass_on_stack)
1803 : partial_seen = true;
1804 11663169 : else if (partial_seen && args[i].reg == 0)
1805 0 : must_preallocate = true;
1806 :
1807 11663169 : if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode
1808 11663169 : && (TREE_CODE (args[i].tree_value) == CALL_EXPR
1809 278290 : || TREE_CODE (args[i].tree_value) == TARGET_EXPR
1810 278290 : || TREE_CODE (args[i].tree_value) == COND_EXPR
1811 278290 : || TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value))))
1812 0 : copy_to_evaluate_size
1813 0 : += int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1814 : }
1815 :
1816 5743073 : if (maybe_ne (args_size->constant, 0)
1817 5743073 : && maybe_ge (copy_to_evaluate_size * 2, args_size->constant))
1818 : must_preallocate = true;
1819 : }
1820 5817622 : return must_preallocate;
1821 : }
1822 :
1823 : /* If we preallocated stack space, compute the address of each argument
1824 : and store it into the ARGS array.
1825 :
1826 : We need not ensure it is a valid memory address here; it will be
1827 : validized when it is used.
1828 :
1829 : ARGBLOCK is an rtx for the address of the outgoing arguments. */
1830 :
1831 : static void
1832 5817626 : compute_argument_addresses (struct arg_data *args, rtx argblock, int num_actuals)
1833 : {
1834 5817626 : if (argblock)
1835 : {
1836 202712 : rtx arg_reg = argblock;
1837 202712 : int i;
1838 202712 : poly_int64 arg_offset = 0;
1839 :
1840 202712 : if (GET_CODE (argblock) == PLUS)
1841 : {
1842 0 : arg_reg = XEXP (argblock, 0);
1843 0 : arg_offset = rtx_to_poly_int64 (XEXP (argblock, 1));
1844 : }
1845 :
1846 727011 : for (i = 0; i < num_actuals; i++)
1847 : {
1848 536652 : rtx offset = ARGS_SIZE_RTX (args[i].locate.offset);
1849 536652 : rtx slot_offset = ARGS_SIZE_RTX (args[i].locate.slot_offset);
1850 524299 : rtx addr;
1851 524299 : unsigned int align, boundary;
1852 524299 : poly_uint64 units_on_stack = 0;
1853 524299 : machine_mode partial_mode = VOIDmode;
1854 :
1855 : /* Skip this parm if it will not be passed on the stack. */
1856 524299 : if (! args[i].pass_on_stack
1857 524299 : && args[i].reg != 0
1858 459930 : && args[i].partial == 0)
1859 524299 : continue;
1860 :
1861 64369 : if (TYPE_EMPTY_P (TREE_TYPE (args[i].tree_value)))
1862 311 : continue;
1863 :
1864 72384 : addr = simplify_gen_binary (PLUS, Pmode, arg_reg, offset);
1865 72384 : addr = plus_constant (Pmode, addr, arg_offset);
1866 :
1867 64058 : if (args[i].partial != 0)
1868 : {
1869 : /* Only part of the parameter is being passed on the stack.
1870 : Generate a simple memory reference of the correct size. */
1871 0 : units_on_stack = args[i].locate.size.constant;
1872 0 : poly_uint64 bits_on_stack = units_on_stack * BITS_PER_UNIT;
1873 0 : partial_mode = int_mode_for_size (bits_on_stack, 1).else_blk ();
1874 0 : args[i].stack = gen_rtx_MEM (partial_mode, addr);
1875 0 : set_mem_size (args[i].stack, units_on_stack);
1876 : }
1877 : else
1878 : {
1879 64058 : args[i].stack = gen_rtx_MEM (args[i].mode, addr);
1880 64058 : set_mem_attributes (args[i].stack,
1881 64058 : TREE_TYPE (args[i].tree_value), 1);
1882 : }
1883 64058 : align = BITS_PER_UNIT;
1884 64058 : boundary = args[i].locate.boundary;
1885 64058 : poly_int64 offset_val;
1886 64058 : if (args[i].locate.where_pad != PAD_DOWNWARD)
1887 : align = boundary;
1888 0 : else if (poly_int_rtx_p (offset, &offset_val))
1889 : {
1890 0 : align = least_bit_hwi (boundary);
1891 0 : unsigned int offset_align
1892 0 : = known_alignment (offset_val) * BITS_PER_UNIT;
1893 0 : if (offset_align != 0)
1894 0 : align = MIN (align, offset_align);
1895 : }
1896 64058 : set_mem_align (args[i].stack, align);
1897 :
1898 72384 : addr = simplify_gen_binary (PLUS, Pmode, arg_reg, slot_offset);
1899 72384 : addr = plus_constant (Pmode, addr, arg_offset);
1900 :
1901 64058 : if (args[i].partial != 0)
1902 : {
1903 : /* Only part of the parameter is being passed on the stack.
1904 : Generate a simple memory reference of the correct size.
1905 : */
1906 0 : args[i].stack_slot = gen_rtx_MEM (partial_mode, addr);
1907 0 : set_mem_size (args[i].stack_slot, units_on_stack);
1908 : }
1909 : else
1910 : {
1911 64058 : args[i].stack_slot = gen_rtx_MEM (args[i].mode, addr);
1912 64058 : set_mem_attributes (args[i].stack_slot,
1913 64058 : TREE_TYPE (args[i].tree_value), 1);
1914 : }
1915 64058 : set_mem_align (args[i].stack_slot, args[i].locate.boundary);
1916 :
1917 : /* Function incoming arguments may overlap with sibling call
1918 : outgoing arguments and we cannot allow reordering of reads
1919 : from function arguments with stores to outgoing arguments
1920 : of sibling calls. */
1921 64058 : set_mem_alias_set (args[i].stack, 0);
1922 64058 : set_mem_alias_set (args[i].stack_slot, 0);
1923 : }
1924 : }
1925 5817626 : }
1926 :
1927 : /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
1928 : in a call instruction.
1929 :
1930 : FNDECL is the tree node for the target function. For an indirect call
1931 : FNDECL will be NULL_TREE.
1932 :
1933 : ADDR is the operand 0 of CALL_EXPR for this call. */
1934 :
1935 : static rtx
1936 5817625 : rtx_for_function_call (tree fndecl, tree addr)
1937 : {
1938 5817625 : rtx funexp;
1939 :
1940 : /* Get the function to call, in the form of RTL. */
1941 5817625 : if (fndecl)
1942 : {
1943 5629438 : if (!TREE_USED (fndecl) && fndecl != current_function_decl)
1944 542637 : TREE_USED (fndecl) = 1;
1945 :
1946 : /* Get a SYMBOL_REF rtx for the function address. */
1947 5629438 : funexp = XEXP (DECL_RTL (fndecl), 0);
1948 : }
1949 : else
1950 : /* Generate an rtx (probably a pseudo-register) for the address. */
1951 : {
1952 188187 : push_temp_slots ();
1953 188187 : funexp = expand_normal (addr);
1954 188187 : pop_temp_slots (); /* FUNEXP can't be BLKmode. */
1955 : }
1956 5817625 : return funexp;
1957 : }
1958 :
1959 : /* Return the static chain for this function, if any. */
1960 :
1961 : rtx
1962 15781643 : rtx_for_static_chain (const_tree fndecl_or_type, bool incoming_p)
1963 : {
1964 31563286 : if (DECL_P (fndecl_or_type) && !DECL_STATIC_CHAIN (fndecl_or_type))
1965 : return NULL;
1966 :
1967 212239 : return targetm.calls.static_chain (fndecl_or_type, incoming_p);
1968 : }
1969 :
1970 : /* Internal state for internal_arg_pointer_based_exp and its helpers. */
1971 : static struct
1972 : {
1973 : /* Last insn that has been scanned by internal_arg_pointer_based_exp_scan,
1974 : or NULL_RTX if none has been scanned yet. */
1975 : rtx_insn *scan_start;
1976 : /* Vector indexed by REGNO - FIRST_PSEUDO_REGISTER, recording if a pseudo is
1977 : based on crtl->args.internal_arg_pointer. The element is NULL_RTX if the
1978 : pseudo isn't based on it, a CONST_INT offset if the pseudo is based on it
1979 : with fixed offset, or PC if this is with variable or unknown offset. */
1980 : vec<rtx> cache;
1981 : } internal_arg_pointer_exp_state;
1982 :
1983 : static rtx internal_arg_pointer_based_exp (const_rtx, bool);
1984 :
1985 : /* Helper function for internal_arg_pointer_based_exp. Scan insns in
1986 : the tail call sequence, starting with first insn that hasn't been
1987 : scanned yet, and note for each pseudo on the LHS whether it is based
1988 : on crtl->args.internal_arg_pointer or not, and what offset from that
1989 : that pointer it has. */
1990 :
1991 : static void
1992 1492 : internal_arg_pointer_based_exp_scan (void)
1993 : {
1994 1492 : rtx_insn *insn, *scan_start = internal_arg_pointer_exp_state.scan_start;
1995 :
1996 1492 : if (scan_start == NULL_RTX)
1997 1285 : insn = get_insns ();
1998 : else
1999 207 : insn = NEXT_INSN (scan_start);
2000 :
2001 8902 : while (insn)
2002 : {
2003 7410 : rtx set = single_set (insn);
2004 7410 : if (set && REG_P (SET_DEST (set)) && !HARD_REGISTER_P (SET_DEST (set)))
2005 : {
2006 2025 : rtx val = NULL_RTX;
2007 2025 : unsigned int idx = REGNO (SET_DEST (set)) - FIRST_PSEUDO_REGISTER;
2008 : /* Punt on pseudos set multiple times. */
2009 2025 : if (idx < internal_arg_pointer_exp_state.cache.length ()
2010 0 : && (internal_arg_pointer_exp_state.cache[idx]
2011 0 : != NULL_RTX))
2012 0 : val = pc_rtx;
2013 : else
2014 2025 : val = internal_arg_pointer_based_exp (SET_SRC (set), false);
2015 2025 : if (val != NULL_RTX)
2016 : {
2017 0 : if (idx >= internal_arg_pointer_exp_state.cache.length ())
2018 0 : internal_arg_pointer_exp_state.cache
2019 0 : .safe_grow_cleared (idx + 1, true);
2020 0 : internal_arg_pointer_exp_state.cache[idx] = val;
2021 : }
2022 : }
2023 7410 : if (NEXT_INSN (insn) == NULL_RTX)
2024 1444 : scan_start = insn;
2025 : insn = NEXT_INSN (insn);
2026 : }
2027 :
2028 1492 : internal_arg_pointer_exp_state.scan_start = scan_start;
2029 1492 : }
2030 :
2031 : /* Compute whether RTL is based on crtl->args.internal_arg_pointer. Return
2032 : NULL_RTX if RTL isn't based on it, a CONST_INT offset if RTL is based on
2033 : it with fixed offset, or PC if this is with variable or unknown offset.
2034 : TOPLEVEL is true if the function is invoked at the topmost level. */
2035 :
2036 : static rtx
2037 13368 : internal_arg_pointer_based_exp (const_rtx rtl, bool toplevel)
2038 : {
2039 13368 : if (CONSTANT_P (rtl))
2040 : return NULL_RTX;
2041 :
2042 13278 : if (rtl == crtl->args.internal_arg_pointer)
2043 5425 : return const0_rtx;
2044 :
2045 7853 : if (REG_P (rtl) && HARD_REGISTER_P (rtl))
2046 : return NULL_RTX;
2047 :
2048 7835 : poly_int64 offset;
2049 7835 : if (GET_CODE (rtl) == PLUS && poly_int_rtx_p (XEXP (rtl, 1), &offset))
2050 : {
2051 3277 : rtx val = internal_arg_pointer_based_exp (XEXP (rtl, 0), toplevel);
2052 3277 : if (val == NULL_RTX || val == pc_rtx)
2053 : return val;
2054 5361 : return plus_constant (Pmode, val, offset);
2055 : }
2056 :
2057 : /* When called at the topmost level, scan pseudo assignments in between the
2058 : last scanned instruction in the tail call sequence and the latest insn
2059 : in that sequence. */
2060 4558 : if (toplevel)
2061 1492 : internal_arg_pointer_based_exp_scan ();
2062 :
2063 4558 : if (REG_P (rtl))
2064 : {
2065 1783 : unsigned int idx = REGNO (rtl) - FIRST_PSEUDO_REGISTER;
2066 1891 : if (idx < internal_arg_pointer_exp_state.cache.length ())
2067 0 : return internal_arg_pointer_exp_state.cache[idx];
2068 :
2069 : return NULL_RTX;
2070 : }
2071 :
2072 2775 : subrtx_iterator::array_type array;
2073 7502 : FOR_EACH_SUBRTX (iter, array, rtl, NONCONST)
2074 : {
2075 4727 : const_rtx x = *iter;
2076 4727 : if (REG_P (x) && internal_arg_pointer_based_exp (x, false) != NULL_RTX)
2077 0 : return pc_rtx;
2078 4727 : if (MEM_P (x))
2079 1712 : iter.skip_subrtxes ();
2080 : }
2081 :
2082 2775 : return NULL_RTX;
2083 2775 : }
2084 :
2085 : /* Return true if SIZE bytes starting from address ADDR might overlap an
2086 : already-clobbered argument area. This function is used to determine
2087 : if we should give up a sibcall. */
2088 :
2089 : static bool
2090 18540 : mem_might_overlap_already_clobbered_arg_p (rtx addr, poly_uint64 size)
2091 : {
2092 18540 : poly_int64 i;
2093 18540 : unsigned HOST_WIDE_INT start, end;
2094 18540 : rtx val;
2095 :
2096 18540 : if (bitmap_empty_p (stored_args_map)
2097 18540 : && stored_args_watermark == HOST_WIDE_INT_M1U)
2098 : return false;
2099 6959 : val = internal_arg_pointer_based_exp (addr, true);
2100 6959 : if (val == NULL_RTX)
2101 : return false;
2102 5429 : else if (!poly_int_rtx_p (val, &i))
2103 : return true;
2104 :
2105 5425 : if (known_eq (size, 0U))
2106 : return false;
2107 :
2108 5425 : if (STACK_GROWS_DOWNWARD)
2109 5425 : i -= crtl->args.pretend_args_size;
2110 : else
2111 : i += crtl->args.pretend_args_size;
2112 :
2113 5425 : if (ARGS_GROW_DOWNWARD)
2114 : i = -i - size;
2115 :
2116 : /* We can ignore any references to the function's pretend args,
2117 : which at this point would manifest as negative values of I. */
2118 5425 : if (known_le (i, 0) && known_le (size, poly_uint64 (-i)))
2119 : return false;
2120 :
2121 5425 : start = maybe_lt (i, 0) ? 0 : constant_lower_bound (i);
2122 5425 : if (!(i + size).is_constant (&end))
2123 : end = HOST_WIDE_INT_M1U;
2124 :
2125 5425 : if (end > stored_args_watermark)
2126 : return true;
2127 :
2128 5425 : end = MIN (end, SBITMAP_SIZE (stored_args_map));
2129 31481 : for (unsigned HOST_WIDE_INT k = start; k < end; ++k)
2130 26060 : if (bitmap_bit_p (stored_args_map, k))
2131 : return true;
2132 :
2133 : return false;
2134 : }
2135 :
2136 : /* Do the register loads required for any wholly-register parms or any
2137 : parms which are passed both on the stack and in a register. Their
2138 : expressions were already evaluated.
2139 :
2140 : Mark all register-parms as living through the call, putting these USE
2141 : insns in the CALL_INSN_FUNCTION_USAGE field.
2142 :
2143 : When IS_SIBCALL, perform the check_sibcall_argument_overlap
2144 : checking, setting *SIBCALL_FAILURE if appropriate. */
2145 :
2146 : static void
2147 5817625 : load_register_parameters (struct arg_data *args, int num_actuals,
2148 : rtx *call_fusage, int flags, int is_sibcall,
2149 : bool *sibcall_failure)
2150 : {
2151 5817625 : int i, j;
2152 :
2153 17775198 : for (i = 0; i < num_actuals; i++)
2154 : {
2155 23915146 : rtx reg = ((flags & ECF_SIBCALL)
2156 11957573 : ? args[i].tail_call_reg : args[i].reg);
2157 11957573 : if (reg)
2158 : {
2159 9815882 : int partial = args[i].partial;
2160 9815882 : int nregs;
2161 9815882 : poly_int64 size = 0;
2162 9815882 : HOST_WIDE_INT const_size = 0;
2163 9815882 : rtx_insn *before_arg = get_last_insn ();
2164 9815882 : tree tree_value = args[i].tree_value;
2165 9815882 : tree type = TREE_TYPE (tree_value);
2166 9815882 : if (RECORD_OR_UNION_TYPE_P (type) && TYPE_TRANSPARENT_AGGR (type))
2167 3078 : type = TREE_TYPE (first_field (type));
2168 : /* Set non-negative if we must move a word at a time, even if
2169 : just one word (e.g, partial == 4 && mode == DFmode). Set
2170 : to -1 if we just use a normal move insn. This value can be
2171 : zero if the argument is a zero size structure. */
2172 9815882 : nregs = -1;
2173 9815882 : if (GET_CODE (reg) == PARALLEL)
2174 : ;
2175 9532306 : else if (partial)
2176 : {
2177 0 : gcc_assert (partial % UNITS_PER_WORD == 0);
2178 0 : nregs = partial / UNITS_PER_WORD;
2179 : }
2180 9532306 : else if (TYPE_MODE (type) == BLKmode)
2181 : {
2182 : /* Variable-sized parameters should be described by a
2183 : PARALLEL instead. */
2184 1608 : const_size = int_size_in_bytes (type);
2185 1608 : gcc_assert (const_size >= 0);
2186 1626 : nregs = (const_size + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
2187 1608 : size = const_size;
2188 : }
2189 : else
2190 19061396 : size = GET_MODE_SIZE (args[i].mode);
2191 :
2192 : /* Handle calls that pass values in multiple non-contiguous
2193 : locations. The Irix 6 ABI has examples of this. */
2194 :
2195 9815882 : if (GET_CODE (reg) == PARALLEL)
2196 283576 : emit_group_move (reg, args[i].parallel_value);
2197 :
2198 : /* If simple case, just do move. If normal partial, store_one_arg
2199 : has already loaded the register for us. In all other cases,
2200 : load the register(s) from memory. */
2201 :
2202 9532306 : else if (nregs == -1)
2203 : {
2204 9530698 : emit_move_insn (reg, args[i].value);
2205 : #ifdef BLOCK_REG_PADDING
2206 : /* Handle case where we have a value that needs shifting
2207 : up to the msb. eg. a QImode value and we're padding
2208 : upward on a BYTES_BIG_ENDIAN machine. */
2209 : if (args[i].locate.where_pad
2210 : == (BYTES_BIG_ENDIAN ? PAD_UPWARD : PAD_DOWNWARD))
2211 : {
2212 : gcc_checking_assert (ordered_p (size, UNITS_PER_WORD));
2213 : if (maybe_lt (size, UNITS_PER_WORD))
2214 : {
2215 : rtx x;
2216 : poly_int64 shift
2217 : = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
2218 :
2219 : /* Assigning REG here rather than a temp makes
2220 : CALL_FUSAGE report the whole reg as used.
2221 : Strictly speaking, the call only uses SIZE
2222 : bytes at the msb end, but it doesn't seem worth
2223 : generating rtl to say that. */
2224 : reg = gen_rtx_REG (word_mode, REGNO (reg));
2225 : x = expand_shift (LSHIFT_EXPR, word_mode,
2226 : reg, shift, reg, 1);
2227 : if (x != reg)
2228 : emit_move_insn (reg, x);
2229 : }
2230 : }
2231 : #endif
2232 : }
2233 :
2234 : /* If we have pre-computed the values to put in the registers in
2235 : the case of non-aligned structures, copy them in now. */
2236 :
2237 1608 : else if (args[i].n_aligned_regs != 0)
2238 0 : for (j = 0; j < args[i].n_aligned_regs; j++)
2239 0 : emit_move_insn (gen_rtx_REG (word_mode, REGNO (reg) + j),
2240 0 : args[i].aligned_regs[j]);
2241 :
2242 : /* If we need a single register and the source is a constant
2243 : VAR_DECL with a simple constructor, expand that constructor
2244 : via a pseudo rather than read from (possibly misaligned)
2245 : memory. PR middle-end/95126. */
2246 1608 : else if (nregs == 1
2247 1608 : && partial == 0
2248 1590 : && !args[i].pass_on_stack
2249 1590 : && VAR_P (tree_value)
2250 1127 : && TREE_READONLY (tree_value)
2251 16 : && !TREE_SIDE_EFFECTS (tree_value)
2252 1624 : && immediate_const_ctor_p (DECL_INITIAL (tree_value)))
2253 : {
2254 16 : rtx target = gen_reg_rtx (word_mode);
2255 16 : store_constructor (DECL_INITIAL (tree_value), target, 0,
2256 16 : int_expr_size (DECL_INITIAL (tree_value)),
2257 : false);
2258 16 : reg = gen_rtx_REG (word_mode, REGNO (reg));
2259 16 : emit_move_insn (reg, target);
2260 : }
2261 1592 : else if (partial == 0 || args[i].pass_on_stack)
2262 : {
2263 : /* SIZE and CONST_SIZE are 0 for partial arguments and
2264 : the size of a BLKmode type otherwise. */
2265 1592 : gcc_checking_assert (known_eq (size, const_size));
2266 1592 : rtx mem = validize_mem (copy_rtx (args[i].value));
2267 :
2268 : /* Check for overlap with already clobbered argument area,
2269 : providing that this has non-zero size. */
2270 1592 : if (is_sibcall
2271 38 : && const_size != 0
2272 1630 : && (mem_might_overlap_already_clobbered_arg_p
2273 1630 : (XEXP (args[i].value, 0), const_size)))
2274 0 : *sibcall_failure = true;
2275 :
2276 1592 : if (const_size % UNITS_PER_WORD == 0
2277 2963 : || MEM_ALIGN (mem) % BITS_PER_WORD == 0)
2278 434 : move_block_to_reg (REGNO (reg), mem, nregs, args[i].mode);
2279 : else
2280 : {
2281 1158 : if (nregs > 1)
2282 0 : move_block_to_reg (REGNO (reg), mem, nregs - 1,
2283 : args[i].mode);
2284 1158 : rtx dest = gen_rtx_REG (word_mode, REGNO (reg) + nregs - 1);
2285 1158 : unsigned int bitoff = (nregs - 1) * BITS_PER_WORD;
2286 1158 : unsigned int bitsize = const_size * BITS_PER_UNIT - bitoff;
2287 1158 : rtx x = extract_bit_field (mem, bitsize, bitoff, 1, dest,
2288 : word_mode, word_mode, false,
2289 : NULL);
2290 1158 : if (BYTES_BIG_ENDIAN)
2291 : x = expand_shift (LSHIFT_EXPR, word_mode, x,
2292 : BITS_PER_WORD - bitsize, dest, 1);
2293 1158 : if (x != dest)
2294 1126 : emit_move_insn (dest, x);
2295 : }
2296 :
2297 : /* Handle a BLKmode that needs shifting. */
2298 : if (nregs == 1 && const_size < UNITS_PER_WORD
2299 : #ifdef BLOCK_REG_PADDING
2300 : && args[i].locate.where_pad == PAD_DOWNWARD
2301 : #else
2302 : && BYTES_BIG_ENDIAN
2303 : #endif
2304 : )
2305 : {
2306 : rtx dest = gen_rtx_REG (word_mode, REGNO (reg));
2307 : int shift = (UNITS_PER_WORD - const_size) * BITS_PER_UNIT;
2308 : enum tree_code dir = (BYTES_BIG_ENDIAN
2309 : ? RSHIFT_EXPR : LSHIFT_EXPR);
2310 : rtx x;
2311 :
2312 : x = expand_shift (dir, word_mode, dest, shift, dest, 1);
2313 : if (x != dest)
2314 : emit_move_insn (dest, x);
2315 : }
2316 : }
2317 :
2318 : /* When a parameter is a block, and perhaps in other cases, it is
2319 : possible that it did a load from an argument slot that was
2320 : already clobbered. */
2321 9815882 : if (is_sibcall
2322 9815882 : && check_sibcall_argument_overlap (before_arg, &args[i], false))
2323 0 : *sibcall_failure = true;
2324 :
2325 : /* Handle calls that pass values in multiple non-contiguous
2326 : locations. The Irix 6 ABI has examples of this. */
2327 9815882 : if (GET_CODE (reg) == PARALLEL)
2328 283576 : use_group_regs (call_fusage, reg);
2329 9532306 : else if (nregs == -1)
2330 9530698 : use_reg_mode (call_fusage, reg, TYPE_MODE (type));
2331 1608 : else if (nregs > 0)
2332 1594 : use_regs (call_fusage, REGNO (reg), nregs);
2333 : }
2334 : }
2335 5817625 : }
2336 :
2337 : /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
2338 : wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
2339 : bytes, then we would need to push some additional bytes to pad the
2340 : arguments. So, we try to compute an adjust to the stack pointer for an
2341 : amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
2342 : bytes. Then, when the arguments are pushed the stack will be perfectly
2343 : aligned.
2344 :
2345 : Return true if this optimization is possible, storing the adjustment
2346 : in ADJUSTMENT_OUT and setting ARGS_SIZE->CONSTANT to the number of
2347 : bytes that should be popped after the call. */
2348 :
2349 : static bool
2350 13951 : combine_pending_stack_adjustment_and_call (poly_int64 *adjustment_out,
2351 : poly_int64 unadjusted_args_size,
2352 : struct args_size *args_size,
2353 : unsigned int preferred_unit_stack_boundary)
2354 : {
2355 : /* The number of bytes to pop so that the stack will be
2356 : under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
2357 13951 : poly_int64 adjustment;
2358 : /* The alignment of the stack after the arguments are pushed, if we
2359 : just pushed the arguments without adjust the stack here. */
2360 13951 : unsigned HOST_WIDE_INT unadjusted_alignment;
2361 :
2362 13951 : if (!known_misalignment (stack_pointer_delta + unadjusted_args_size,
2363 : preferred_unit_stack_boundary,
2364 : &unadjusted_alignment))
2365 : return false;
2366 :
2367 : /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
2368 : as possible -- leaving just enough left to cancel out the
2369 : UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
2370 : PENDING_STACK_ADJUST is non-negative, and congruent to
2371 : -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
2372 :
2373 : /* Begin by trying to pop all the bytes. */
2374 13951 : unsigned HOST_WIDE_INT tmp_misalignment;
2375 13951 : if (!known_misalignment (pending_stack_adjust,
2376 : preferred_unit_stack_boundary,
2377 : &tmp_misalignment))
2378 : return false;
2379 13951 : unadjusted_alignment -= tmp_misalignment;
2380 13951 : adjustment = pending_stack_adjust;
2381 : /* Push enough additional bytes that the stack will be aligned
2382 : after the arguments are pushed. */
2383 13951 : if (preferred_unit_stack_boundary > 1 && unadjusted_alignment)
2384 13758 : adjustment -= preferred_unit_stack_boundary - unadjusted_alignment;
2385 :
2386 : /* We need to know whether the adjusted argument size
2387 : (UNADJUSTED_ARGS_SIZE - ADJUSTMENT) constitutes an allocation
2388 : or a deallocation. */
2389 13951 : if (!ordered_p (adjustment, unadjusted_args_size))
2390 : return false;
2391 :
2392 : /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
2393 : bytes after the call. The right number is the entire
2394 : PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
2395 : by the arguments in the first place. */
2396 : args_size->constant
2397 13951 : = pending_stack_adjust - adjustment + unadjusted_args_size;
2398 :
2399 13951 : *adjustment_out = adjustment;
2400 13951 : return true;
2401 : }
2402 :
2403 : /* Scan X expression if it does not dereference any argument slots
2404 : we already clobbered by tail call arguments (as noted in stored_args_map
2405 : bitmap).
2406 : Return true if X expression dereferences such argument slots,
2407 : false otherwise. */
2408 :
2409 : static bool
2410 1618484 : check_sibcall_argument_overlap_1 (rtx x)
2411 : {
2412 1618484 : RTX_CODE code;
2413 1618484 : int i, j;
2414 1618484 : const char *fmt;
2415 :
2416 1618484 : if (x == NULL_RTX)
2417 : return false;
2418 :
2419 1618484 : code = GET_CODE (x);
2420 :
2421 : /* We need not check the operands of the CALL expression itself. */
2422 1618484 : if (code == CALL)
2423 : return false;
2424 :
2425 1489134 : if (code == MEM)
2426 18066 : return (mem_might_overlap_already_clobbered_arg_p
2427 36132 : (XEXP (x, 0), GET_MODE_SIZE (GET_MODE (x))));
2428 :
2429 : /* Scan all subexpressions. */
2430 1471068 : fmt = GET_RTX_FORMAT (code);
2431 3537349 : for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
2432 : {
2433 2066281 : if (*fmt == 'e')
2434 : {
2435 1018869 : if (check_sibcall_argument_overlap_1 (XEXP (x, i)))
2436 : return true;
2437 : }
2438 1047412 : else if (*fmt == 'E')
2439 : {
2440 2420 : for (j = 0; j < XVECLEN (x, i); j++)
2441 1564 : if (check_sibcall_argument_overlap_1 (XVECEXP (x, i, j)))
2442 : return true;
2443 : }
2444 : }
2445 : return false;
2446 : }
2447 :
2448 : /* Scan sequence after INSN if it does not dereference any argument slots
2449 : we already clobbered by tail call arguments (as noted in stored_args_map
2450 : bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
2451 : stored_args_map bitmap afterwards (when ARG is a register
2452 : MARK_STORED_ARGS_MAP should be false). Return true if sequence after
2453 : INSN dereferences such argument slots, false otherwise. */
2454 :
2455 : static bool
2456 360488 : check_sibcall_argument_overlap (rtx_insn *insn, struct arg_data *arg,
2457 : bool mark_stored_args_map)
2458 : {
2459 360488 : poly_uint64 low, high;
2460 360488 : unsigned HOST_WIDE_INT const_low, const_high;
2461 :
2462 360488 : if (insn == NULL_RTX)
2463 168705 : insn = get_insns ();
2464 : else
2465 191783 : insn = NEXT_INSN (insn);
2466 :
2467 958539 : for (; insn; insn = NEXT_INSN (insn))
2468 598051 : if (INSN_P (insn)
2469 598051 : && check_sibcall_argument_overlap_1 (PATTERN (insn)))
2470 : break;
2471 :
2472 360488 : if (mark_stored_args_map)
2473 : {
2474 10467 : if (ARGS_GROW_DOWNWARD)
2475 : low = -arg->locate.slot_offset.constant - arg->locate.size.constant;
2476 : else
2477 10467 : low = arg->locate.slot_offset.constant;
2478 10467 : high = low + arg->locate.size.constant;
2479 :
2480 10467 : const_low = constant_lower_bound (low);
2481 10467 : if (high.is_constant (&const_high))
2482 72523 : for (unsigned HOST_WIDE_INT i = const_low; i < const_high; ++i)
2483 62056 : bitmap_set_bit (stored_args_map, i);
2484 : else
2485 : stored_args_watermark = MIN (stored_args_watermark, const_low);
2486 : }
2487 360488 : return insn != NULL_RTX;
2488 : }
2489 :
2490 : /* Given that a function returns a value of mode MODE at the most
2491 : significant end of hard register VALUE, shift VALUE left or right
2492 : as specified by LEFT_P. Return true if some action was needed. */
2493 :
2494 : bool
2495 0 : shift_return_value (machine_mode mode, bool left_p, rtx value)
2496 : {
2497 0 : gcc_assert (REG_P (value) && HARD_REGISTER_P (value));
2498 0 : machine_mode value_mode = GET_MODE (value);
2499 0 : poly_int64 shift = GET_MODE_BITSIZE (value_mode) - GET_MODE_BITSIZE (mode);
2500 :
2501 0 : if (known_eq (shift, 0))
2502 : return false;
2503 :
2504 : /* Use ashr rather than lshr for right shifts. This is for the benefit
2505 : of the MIPS port, which requires SImode values to be sign-extended
2506 : when stored in 64-bit registers. */
2507 0 : if (!force_expand_binop (value_mode, left_p ? ashl_optab : ashr_optab,
2508 : value, gen_int_shift_amount (value_mode, shift),
2509 : value, 1, OPTAB_WIDEN))
2510 0 : gcc_unreachable ();
2511 : return true;
2512 : }
2513 :
2514 : /* If X is a likely-spilled register value, copy it to a pseudo
2515 : register and return that register. Return X otherwise. */
2516 :
2517 : static rtx
2518 188935 : avoid_likely_spilled_reg (rtx x)
2519 : {
2520 188935 : rtx new_rtx;
2521 :
2522 188935 : if (REG_P (x)
2523 188935 : && HARD_REGISTER_P (x)
2524 371257 : && targetm.class_likely_spilled_p (REGNO_REG_CLASS (REGNO (x))))
2525 : {
2526 : /* Make sure that we generate a REG rather than a CONCAT.
2527 : Moves into CONCATs can need nontrivial instructions,
2528 : and the whole point of this function is to avoid
2529 : using the hard register directly in such a situation. */
2530 182322 : generating_concat_p = 0;
2531 182322 : new_rtx = gen_reg_rtx (GET_MODE (x));
2532 182322 : generating_concat_p = 1;
2533 182322 : emit_move_insn (new_rtx, x);
2534 182322 : return new_rtx;
2535 : }
2536 : return x;
2537 : }
2538 :
2539 : /* Helper function for expand_call.
2540 : Return false is EXP is not implementable as a sibling call. */
2541 :
2542 : static bool
2543 139636 : can_implement_as_sibling_call_p (tree exp,
2544 : rtx structure_value_addr,
2545 : tree funtype,
2546 : tree fndecl,
2547 : int flags,
2548 : tree addr,
2549 : const args_size &args_size)
2550 : {
2551 139636 : if (!targetm.have_sibcall_epilogue ()
2552 139636 : && !targetm.emit_epilogue_for_sibcall)
2553 : {
2554 0 : maybe_complain_about_tail_call (exp, _("machine description does not "
2555 : "have a sibcall_epilogue "
2556 : "instruction pattern"));
2557 0 : return false;
2558 : }
2559 :
2560 : /* Doing sibling call optimization needs some work, since
2561 : structure_value_addr can be allocated on the stack.
2562 : It does not seem worth the effort since few optimizable
2563 : sibling calls will return a structure. */
2564 139636 : if (structure_value_addr != NULL_RTX)
2565 : {
2566 483 : maybe_complain_about_tail_call (exp, _("callee returns a structure"));
2567 483 : return false;
2568 : }
2569 :
2570 : /* Check whether the target is able to optimize the call
2571 : into a sibcall. */
2572 139153 : if (!targetm.function_ok_for_sibcall (fndecl, exp))
2573 : {
2574 6395 : maybe_complain_about_tail_call (exp, _("target is not able to optimize "
2575 : "the call into a sibling call"));
2576 6395 : return false;
2577 : }
2578 :
2579 : /* Functions that do not return exactly once may not be sibcall
2580 : optimized. */
2581 132758 : if (flags & ECF_RETURNS_TWICE)
2582 : {
2583 0 : maybe_complain_about_tail_call (exp, _("callee returns twice"));
2584 0 : return false;
2585 : }
2586 133021 : if ((flags & ECF_NORETURN) && !CALL_EXPR_MUST_TAIL_CALL (exp))
2587 : {
2588 251 : maybe_complain_about_tail_call (exp, _("callee does not return"));
2589 251 : return false;
2590 : }
2591 :
2592 132507 : if (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (addr)))
2593 132509 : && !CALL_EXPR_MUST_TAIL_CALL (exp))
2594 : {
2595 0 : maybe_complain_about_tail_call (exp, _("volatile function type"));
2596 0 : return false;
2597 : }
2598 :
2599 : /* __sanitizer_cov_trace_pc is supposed to inspect its return address
2600 : to identify the caller, and therefore should not be tailcalled. */
2601 122130 : if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2602 149854 : && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_SANITIZER_COV_TRACE_PC)
2603 : {
2604 : /* No need for maybe_complain_about_tail_call here:
2605 : the call is synthesized by the compiler. */
2606 : return false;
2607 : }
2608 :
2609 : /* If the called function is nested in the current one, it might access
2610 : some of the caller's arguments, but could clobber them beforehand if
2611 : the argument areas are shared. */
2612 132471 : if (fndecl && decl_function_context (fndecl) == current_function_decl)
2613 : {
2614 111 : maybe_complain_about_tail_call (exp, _("nested function"));
2615 111 : return false;
2616 : }
2617 :
2618 : /* If this function requires more stack slots than the current
2619 : function, we cannot change it into a sibling call.
2620 : crtl->args.pretend_args_size is not part of the
2621 : stack allocated by our caller. */
2622 132360 : if (maybe_gt (args_size.constant,
2623 : crtl->args.size - crtl->args.pretend_args_size))
2624 : {
2625 3010 : maybe_complain_about_tail_call (exp, _("callee required more stack "
2626 : "slots than the caller"));
2627 3010 : return false;
2628 : }
2629 :
2630 : /* If the callee pops its own arguments, then it must pop exactly
2631 : the same number of arguments as the current function. */
2632 129350 : if (maybe_ne (targetm.calls.return_pops_args (fndecl, funtype,
2633 : args_size.constant),
2634 258700 : targetm.calls.return_pops_args (current_function_decl,
2635 129350 : TREE_TYPE
2636 : (current_function_decl),
2637 : crtl->args.size)))
2638 : {
2639 0 : maybe_complain_about_tail_call (exp, _("inconsistent number of"
2640 : " popped arguments"));
2641 0 : return false;
2642 : }
2643 :
2644 129350 : if (!lang_hooks.decls.ok_for_sibcall (fndecl))
2645 : {
2646 0 : maybe_complain_about_tail_call (exp, _("frontend does not support"
2647 : " sibling call"));
2648 0 : return false;
2649 : }
2650 :
2651 : /* All checks passed. */
2652 : return true;
2653 : }
2654 :
2655 : /* Update stack alignment when the parameter is passed in the stack
2656 : since the outgoing parameter requires extra alignment on the calling
2657 : function side. */
2658 :
2659 : static void
2660 2245601 : update_stack_alignment_for_call (struct locate_and_pad_arg_data *locate)
2661 : {
2662 2245601 : if (crtl->stack_alignment_needed < locate->boundary)
2663 2239 : crtl->stack_alignment_needed = locate->boundary;
2664 2245601 : if (crtl->preferred_stack_boundary < locate->boundary)
2665 5412 : crtl->preferred_stack_boundary = locate->boundary;
2666 2245601 : }
2667 :
2668 : /* Generate all the code for a CALL_EXPR exp
2669 : and return an rtx for its value.
2670 : Store the value in TARGET (specified as an rtx) if convenient.
2671 : If the value is stored in TARGET then TARGET is returned.
2672 : If IGNORE is nonzero, then we ignore the value of the function call. */
2673 :
2674 : rtx
2675 5817622 : expand_call (tree exp, rtx target, int ignore)
2676 : {
2677 : /* Nonzero if we are currently expanding a call. */
2678 5817622 : static int currently_expanding_call = 0;
2679 :
2680 : /* RTX for the function to be called. */
2681 5817622 : rtx funexp;
2682 : /* Sequence of insns to perform a normal "call". */
2683 5817622 : rtx_insn *normal_call_insns = NULL;
2684 : /* Sequence of insns to perform a tail "call". */
2685 5817622 : rtx_insn *tail_call_insns = NULL;
2686 : /* Data type of the function. */
2687 5817622 : tree funtype;
2688 5817622 : tree type_arg_types;
2689 5817622 : tree rettype;
2690 : /* Declaration of the function being called,
2691 : or 0 if the function is computed (not known by name). */
2692 5817622 : tree fndecl = 0;
2693 : /* The type of the function being called. */
2694 5817622 : tree fntype;
2695 5817622 : bool try_tail_call = CALL_EXPR_TAILCALL (exp);
2696 : /* tree-tailcall decided not to do tail calls. Error for the musttail case,
2697 : unfortunately we don't know the reason so it's fairly vague.
2698 : When tree-tailcall reported an error it already cleared the flag,
2699 : so this shouldn't really happen unless the
2700 : the musttail pass gave up walking before finding the call. */
2701 5817622 : if (!try_tail_call)
2702 5677942 : maybe_complain_about_tail_call (exp, _("other reasons"));
2703 5817622 : int pass;
2704 :
2705 : /* Register in which non-BLKmode value will be returned,
2706 : or 0 if no value or if value is BLKmode. */
2707 5817622 : rtx valreg;
2708 : /* Address where we should return a BLKmode value;
2709 : 0 if value not BLKmode. */
2710 5817622 : rtx structure_value_addr = 0;
2711 : /* Nonzero if that address is being passed by treating it as
2712 : an extra, implicit first parameter. Otherwise,
2713 : it is passed by being copied directly into struct_value_rtx. */
2714 5817622 : int structure_value_addr_parm = 0;
2715 : /* Holds the value of implicit argument for the struct value. */
2716 5817622 : tree structure_value_addr_value = NULL_TREE;
2717 : /* Size of aggregate value wanted, or zero if none wanted
2718 : or if we are using the non-reentrant PCC calling convention
2719 : or expecting the value in registers. */
2720 5817622 : poly_int64 struct_value_size = 0;
2721 : /* True if called function returns an aggregate in memory PCC style,
2722 : by returning the address of where to find it. */
2723 5817622 : bool pcc_struct_value = false;
2724 5817622 : rtx struct_value = 0;
2725 :
2726 : /* Number of actual parameters in this call, including struct value addr. */
2727 5817622 : int num_actuals;
2728 : /* Number of named args. Args after this are anonymous ones
2729 : and they must all go on the stack. */
2730 5817622 : int n_named_args;
2731 : /* Number of complex actual arguments that need to be split. */
2732 5817622 : int num_complex_actuals = 0;
2733 :
2734 : /* Vector of information about each argument.
2735 : Arguments are numbered in the order they will be pushed,
2736 : not the order they are written. */
2737 5817622 : struct arg_data *args;
2738 :
2739 : /* Total size in bytes of all the stack-parms scanned so far. */
2740 5817622 : struct args_size args_size;
2741 5817622 : struct args_size adjusted_args_size;
2742 : /* Size of arguments before any adjustments (such as rounding). */
2743 5817622 : poly_int64 unadjusted_args_size;
2744 : /* Data on reg parms scanned so far. */
2745 5817622 : CUMULATIVE_ARGS args_so_far_v;
2746 5817622 : cumulative_args_t args_so_far;
2747 : /* Nonzero if a reg parm has been scanned. */
2748 5817622 : int reg_parm_seen;
2749 :
2750 : /* True if we must avoid push-insns in the args for this call.
2751 : If stack space is allocated for register parameters, but not by the
2752 : caller, then it is preallocated in the fixed part of the stack frame.
2753 : So the entire argument block must then be preallocated (i.e., we
2754 : ignore PUSH_ROUNDING in that case). */
2755 5817622 : bool must_preallocate = !targetm.calls.push_argument (0);
2756 :
2757 : /* Size of the stack reserved for parameter registers. */
2758 5817622 : int reg_parm_stack_space = 0;
2759 :
2760 : /* Address of space preallocated for stack parms
2761 : (on machines that lack push insns), or 0 if space not preallocated. */
2762 5817622 : rtx argblock = 0;
2763 :
2764 : /* Mask of ECF_ and ERF_ flags. */
2765 5817622 : int flags = 0;
2766 5817622 : int return_flags = 0;
2767 : #ifdef REG_PARM_STACK_SPACE
2768 : /* Define the boundary of the register parm stack space that needs to be
2769 : saved, if any. */
2770 5817622 : int low_to_save, high_to_save;
2771 5817622 : rtx save_area = 0; /* Place that it is saved */
2772 : #endif
2773 :
2774 5817622 : unsigned int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
2775 5817622 : char *initial_stack_usage_map = stack_usage_map;
2776 5817622 : unsigned HOST_WIDE_INT initial_stack_usage_watermark = stack_usage_watermark;
2777 5817622 : char *stack_usage_map_buf = NULL;
2778 :
2779 5817622 : poly_int64 old_stack_allocated;
2780 :
2781 : /* State variables to track stack modifications. */
2782 5817622 : rtx old_stack_level = 0;
2783 5817622 : int old_stack_arg_under_construction = 0;
2784 5817622 : poly_int64 old_pending_adj = 0;
2785 5817622 : int old_inhibit_defer_pop = inhibit_defer_pop;
2786 :
2787 : /* Some stack pointer alterations we make are performed via
2788 : allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
2789 : which we then also need to save/restore along the way. */
2790 5817622 : poly_int64 old_stack_pointer_delta = 0;
2791 :
2792 5817622 : rtx call_fusage;
2793 5817622 : tree addr = CALL_EXPR_FN (exp);
2794 5817622 : int i;
2795 : /* The alignment of the stack, in bits. */
2796 5817622 : unsigned HOST_WIDE_INT preferred_stack_boundary;
2797 : /* The alignment of the stack, in bytes. */
2798 5817622 : unsigned HOST_WIDE_INT preferred_unit_stack_boundary;
2799 : /* The static chain value to use for this call. */
2800 5817622 : rtx static_chain_value;
2801 : /* See if this is "nothrow" function call. */
2802 5817622 : if (TREE_NOTHROW (exp))
2803 2010546 : flags |= ECF_NOTHROW;
2804 :
2805 : /* See if we can find a DECL-node for the actual function, and get the
2806 : function attributes (flags) from the function decl or type node. */
2807 5817622 : fndecl = get_callee_fndecl (exp);
2808 5817622 : if (fndecl)
2809 : {
2810 5629435 : fntype = TREE_TYPE (fndecl);
2811 5629435 : flags |= flags_from_decl_or_type (fndecl);
2812 5629435 : return_flags |= decl_return_flags (fndecl);
2813 : }
2814 : else
2815 : {
2816 188187 : fntype = TREE_TYPE (TREE_TYPE (addr));
2817 188187 : flags |= flags_from_decl_or_type (fntype);
2818 188187 : if (CALL_EXPR_BY_DESCRIPTOR (exp))
2819 0 : flags |= ECF_BY_DESCRIPTOR;
2820 : }
2821 5817622 : rettype = TREE_TYPE (exp);
2822 :
2823 5817622 : struct_value = targetm.calls.struct_value_rtx (fntype, 0);
2824 :
2825 : /* Warn if this value is an aggregate type,
2826 : regardless of which calling convention we are using for it. */
2827 5817622 : if (AGGREGATE_TYPE_P (rettype))
2828 357665 : warning (OPT_Waggregate_return, "function call has aggregate value");
2829 :
2830 : /* If the result of a non looping pure or const function call is
2831 : ignored (or void), and none of its arguments are volatile, we can
2832 : avoid expanding the call and just evaluate the arguments for
2833 : side-effects. */
2834 5817622 : if ((flags & (ECF_CONST | ECF_PURE))
2835 418539 : && (!(flags & ECF_LOOPING_CONST_OR_PURE))
2836 378997 : && (flags & ECF_NOTHROW)
2837 6189482 : && (ignore || target == const0_rtx
2838 371859 : || TYPE_MODE (rettype) == VOIDmode))
2839 : {
2840 1 : bool volatilep = false;
2841 1 : tree arg;
2842 1 : call_expr_arg_iterator iter;
2843 :
2844 4 : FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
2845 3 : if (TREE_THIS_VOLATILE (arg))
2846 : {
2847 : volatilep = true;
2848 : break;
2849 : }
2850 :
2851 1 : if (! volatilep)
2852 : {
2853 0 : FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
2854 0 : expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL);
2855 0 : return const0_rtx;
2856 : }
2857 : }
2858 :
2859 : #ifdef REG_PARM_STACK_SPACE
2860 11447057 : reg_parm_stack_space = REG_PARM_STACK_SPACE (!fndecl ? fntype : fndecl);
2861 : #endif
2862 :
2863 5090807 : if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl)))
2864 10872136 : && reg_parm_stack_space > 0 && targetm.calls.push_argument (0))
2865 0 : must_preallocate = true;
2866 :
2867 : /* Set up a place to return a structure. */
2868 :
2869 : /* Cater to broken compilers. */
2870 5817622 : if (aggregate_value_p (exp, fntype))
2871 : {
2872 : /* This call returns a big structure. */
2873 225052 : flags &= ~(ECF_CONST | ECF_PURE | ECF_LOOPING_CONST_OR_PURE);
2874 :
2875 : #ifdef PCC_STATIC_STRUCT_RETURN
2876 : {
2877 : pcc_struct_value = true;
2878 : }
2879 : #else /* not PCC_STATIC_STRUCT_RETURN */
2880 225052 : {
2881 225052 : if (!poly_int_tree_p (TYPE_SIZE_UNIT (rettype), &struct_value_size))
2882 53 : struct_value_size = -1;
2883 :
2884 : /* Even if it is semantically safe to use the target as the return
2885 : slot, it may be not sufficiently aligned for the return type. */
2886 225052 : if (CALL_EXPR_RETURN_SLOT_OPT (exp)
2887 215285 : && target
2888 200164 : && MEM_P (target)
2889 : /* If rettype is addressable, we may not create a temporary.
2890 : If target is properly aligned at runtime and the compiler
2891 : just doesn't know about it, it will work fine, otherwise it
2892 : will be UB. */
2893 372063 : && (TREE_ADDRESSABLE (rettype)
2894 124527 : || !(MEM_ALIGN (target) < TYPE_ALIGN (rettype)
2895 0 : && targetm.slow_unaligned_access (TYPE_MODE (rettype),
2896 0 : MEM_ALIGN (target)))))
2897 147011 : structure_value_addr = XEXP (target, 0);
2898 : else
2899 : {
2900 : /* For variable-sized objects, we must be called with a target
2901 : specified. If we were to allocate space on the stack here,
2902 : we would have no way of knowing when to free it. */
2903 78041 : rtx d = assign_temp (rettype, 1, 1);
2904 78041 : structure_value_addr = XEXP (d, 0);
2905 78041 : target = 0;
2906 : }
2907 : }
2908 : #endif /* not PCC_STATIC_STRUCT_RETURN */
2909 : }
2910 :
2911 : /* Figure out the amount to which the stack should be aligned. */
2912 5817622 : preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
2913 5817622 : if (fndecl)
2914 : {
2915 5629435 : struct cgraph_rtl_info *i = cgraph_node::rtl_info (fndecl);
2916 : /* Without automatic stack alignment, we can't increase preferred
2917 : stack boundary. With automatic stack alignment, it is
2918 : unnecessary since unless we can guarantee that all callers will
2919 : align the outgoing stack properly, callee has to align its
2920 : stack anyway. */
2921 5629435 : if (i
2922 1349721 : && i->preferred_incoming_stack_boundary
2923 962940 : && i->preferred_incoming_stack_boundary < preferred_stack_boundary)
2924 301643 : preferred_stack_boundary = i->preferred_incoming_stack_boundary;
2925 : }
2926 :
2927 : /* Operand 0 is a pointer-to-function; get the type of the function. */
2928 5817622 : funtype = TREE_TYPE (addr);
2929 5817622 : gcc_assert (POINTER_TYPE_P (funtype));
2930 5817622 : funtype = TREE_TYPE (funtype);
2931 :
2932 : /* Count whether there are actual complex arguments that need to be split
2933 : into their real and imaginary parts. Munge the type_arg_types
2934 : appropriately here as well. */
2935 5817622 : if (targetm.calls.split_complex_arg)
2936 : {
2937 0 : call_expr_arg_iterator iter;
2938 0 : tree arg;
2939 0 : FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
2940 : {
2941 0 : tree type = TREE_TYPE (arg);
2942 0 : if (type && TREE_CODE (type) == COMPLEX_TYPE
2943 0 : && targetm.calls.split_complex_arg (type))
2944 0 : num_complex_actuals++;
2945 : }
2946 0 : type_arg_types = split_complex_types (TYPE_ARG_TYPES (funtype));
2947 : }
2948 : else
2949 5817622 : type_arg_types = TYPE_ARG_TYPES (funtype);
2950 :
2951 5817622 : if (flags & ECF_MAY_BE_ALLOCA)
2952 29 : cfun->calls_alloca = 1;
2953 :
2954 : /* If struct_value_rtx is 0, it means pass the address
2955 : as if it were an extra parameter. Put the argument expression
2956 : in structure_value_addr_value. */
2957 5817622 : if (structure_value_addr && struct_value == 0)
2958 : {
2959 : /* If structure_value_addr is a REG other than
2960 : virtual_outgoing_args_rtx, we can use always use it. If it
2961 : is not a REG, we must always copy it into a register.
2962 : If it is virtual_outgoing_args_rtx, we must copy it to another
2963 : register in some cases. */
2964 225052 : rtx temp = (!REG_P (structure_value_addr)
2965 6687 : || (ACCUMULATE_OUTGOING_ARGS
2966 0 : && stack_arg_under_construction
2967 0 : && structure_value_addr == virtual_outgoing_args_rtx)
2968 225052 : ? copy_addr_to_reg (convert_memory_address
2969 : (Pmode, structure_value_addr))
2970 218365 : : structure_value_addr);
2971 :
2972 225052 : structure_value_addr_value =
2973 225052 : make_tree (build_pointer_type (TREE_TYPE (funtype)), temp);
2974 225052 : structure_value_addr_parm = 1;
2975 : }
2976 :
2977 : /* Count the arguments and set NUM_ACTUALS. */
2978 5817622 : num_actuals
2979 5817622 : = call_expr_nargs (exp) + num_complex_actuals + structure_value_addr_parm;
2980 :
2981 : /* Compute number of named args.
2982 : First, do a raw count of the args for INIT_CUMULATIVE_ARGS. */
2983 :
2984 5817622 : if (type_arg_types != 0)
2985 5794073 : n_named_args
2986 5794073 : = (list_length (type_arg_types)
2987 : /* Count the struct value address, if it is passed as a parm. */
2988 : + structure_value_addr_parm);
2989 23549 : else if (TYPE_NO_NAMED_ARGS_STDARG_P (funtype))
2990 531 : n_named_args = structure_value_addr_parm;
2991 : else
2992 : /* If we know nothing, treat all args as named. */
2993 : n_named_args = num_actuals;
2994 :
2995 : /* Start updating where the next arg would go.
2996 :
2997 : On some machines (such as the PA) indirect calls have a different
2998 : calling convention than normal calls. The fourth argument in
2999 : INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
3000 : or not. */
3001 5817622 : INIT_CUMULATIVE_ARGS (args_so_far_v, funtype, NULL_RTX, fndecl, n_named_args);
3002 5817622 : args_so_far = pack_cumulative_args (&args_so_far_v);
3003 :
3004 : /* Now possibly adjust the number of named args.
3005 : Normally, don't include the last named arg if anonymous args follow.
3006 : We do include the last named arg if
3007 : targetm.calls.strict_argument_naming() returns nonzero.
3008 : (If no anonymous args follow, the result of list_length is actually
3009 : one too large. This is harmless.)
3010 :
3011 : If targetm.calls.pretend_outgoing_varargs_named() returns
3012 : nonzero, and targetm.calls.strict_argument_naming() returns zero,
3013 : this machine will be able to place unnamed args that were passed
3014 : in registers into the stack. So treat all args as named. This
3015 : allows the insns emitting for a specific argument list to be
3016 : independent of the function declaration.
3017 :
3018 : If targetm.calls.pretend_outgoing_varargs_named() returns zero,
3019 : we do not have any reliable way to pass unnamed args in
3020 : registers, so we must force them into memory. */
3021 :
3022 23549 : if ((type_arg_types != 0 || TYPE_NO_NAMED_ARGS_STDARG_P (funtype))
3023 5818153 : && targetm.calls.strict_argument_naming (args_so_far))
3024 : ;
3025 23018 : else if (type_arg_types != 0
3026 23018 : && ! targetm.calls.pretend_outgoing_varargs_named (args_so_far))
3027 : /* Don't include the last named arg. */
3028 0 : --n_named_args;
3029 23018 : else if (TYPE_NO_NAMED_ARGS_STDARG_P (funtype)
3030 23018 : && ! targetm.calls.pretend_outgoing_varargs_named (args_so_far))
3031 : n_named_args = 0;
3032 : else
3033 : /* Treat all args as named. */
3034 : n_named_args = num_actuals;
3035 :
3036 : /* Make a vector to hold all the information about each arg. */
3037 5817622 : args = XCNEWVEC (struct arg_data, num_actuals);
3038 :
3039 : /* Build up entries in the ARGS array, compute the size of the
3040 : arguments into ARGS_SIZE, etc. */
3041 5817622 : initialize_argument_information (num_actuals, args, &args_size,
3042 : n_named_args, exp,
3043 : structure_value_addr_value, fndecl, fntype,
3044 : args_so_far, reg_parm_stack_space,
3045 : &old_stack_level, &old_pending_adj,
3046 : &must_preallocate, &flags,
3047 5817622 : &try_tail_call, CALL_FROM_THUNK_P (exp));
3048 :
3049 5817622 : if (args_size.var)
3050 0 : must_preallocate = true;
3051 :
3052 : /* Now make final decision about preallocating stack space. */
3053 5817622 : must_preallocate = finalize_must_preallocate (must_preallocate,
3054 : num_actuals, args,
3055 : &args_size);
3056 :
3057 : /* If the structure value address will reference the stack pointer, we
3058 : must stabilize it. We don't need to do this if we know that we are
3059 : not going to adjust the stack pointer in processing this call. */
3060 :
3061 5817622 : if (structure_value_addr
3062 225052 : && (reg_mentioned_p (virtual_stack_dynamic_rtx, structure_value_addr)
3063 225052 : || reg_mentioned_p (virtual_outgoing_args_rtx,
3064 : structure_value_addr))
3065 5817622 : && (args_size.var
3066 0 : || (!ACCUMULATE_OUTGOING_ARGS
3067 0 : && maybe_ne (args_size.constant, 0))))
3068 0 : structure_value_addr = copy_to_reg (structure_value_addr);
3069 :
3070 : /* Tail calls can make things harder to debug, and we've traditionally
3071 : pushed these optimizations into -O2. Don't try if we're already
3072 : expanding a call, as that means we're an argument. Don't try if
3073 : there's cleanups, as we know there's code to follow the call. */
3074 5817622 : if (currently_expanding_call++ != 0)
3075 : {
3076 6505 : maybe_complain_about_tail_call (exp, _("inside another call"));
3077 6505 : try_tail_call = 0;
3078 : }
3079 5817622 : if (!flag_optimize_sibling_calls
3080 2905254 : && !CALL_FROM_THUNK_P (exp)
3081 8722463 : && !CALL_EXPR_MUST_TAIL_CALL (exp))
3082 2904524 : try_tail_call = 0;
3083 5817622 : if (args_size.var)
3084 : {
3085 0 : maybe_complain_about_tail_call (exp, _("variable size arguments"));
3086 0 : try_tail_call = 0;
3087 : }
3088 5817622 : if (dbg_cnt (tail_call) == false)
3089 0 : try_tail_call = 0;
3090 :
3091 : /* Workaround buggy C/C++ wrappers around Fortran routines with
3092 : character(len=constant) arguments if the hidden string length arguments
3093 : are passed on the stack; if the callers forget to pass those arguments,
3094 : attempting to tail call in such routines leads to stack corruption.
3095 : Avoid tail calls in functions where at least one such hidden string
3096 : length argument is passed (partially or fully) on the stack in the
3097 : caller and the callee needs to pass any arguments on the stack.
3098 : See PR90329. */
3099 5817622 : if (try_tail_call && maybe_ne (args_size.constant, 0))
3100 14571 : for (tree arg = DECL_ARGUMENTS (current_function_decl);
3101 51777 : arg; arg = DECL_CHAIN (arg))
3102 37206 : if (DECL_HIDDEN_STRING_LENGTH (arg) && DECL_INCOMING_RTL (arg))
3103 : {
3104 0 : subrtx_iterator::array_type array;
3105 0 : FOR_EACH_SUBRTX (iter, array, DECL_INCOMING_RTL (arg), NONCONST)
3106 0 : if (MEM_P (*iter))
3107 : {
3108 0 : try_tail_call = 0;
3109 0 : maybe_complain_about_tail_call (exp, _("hidden string length "
3110 : "argument passed on "
3111 : "stack"));
3112 0 : break;
3113 : }
3114 0 : }
3115 :
3116 : /* If the user has marked the function as requiring tail-call
3117 : optimization, attempt it. */
3118 5817622 : if (CALL_EXPR_MUST_TAIL_CALL (exp))
3119 700 : try_tail_call = 1;
3120 :
3121 : /* Rest of purposes for tail call optimizations to fail. */
3122 5817622 : if (try_tail_call)
3123 139636 : try_tail_call = can_implement_as_sibling_call_p (exp,
3124 : structure_value_addr,
3125 : funtype,
3126 : fndecl,
3127 : flags, addr, args_size);
3128 :
3129 : /* Check if caller and callee disagree in promotion of function
3130 : return value. */
3131 5817622 : if (try_tail_call)
3132 : {
3133 129350 : machine_mode caller_mode, caller_promoted_mode;
3134 129350 : machine_mode callee_mode, callee_promoted_mode;
3135 129350 : int caller_unsignedp, callee_unsignedp;
3136 129350 : tree caller_res = DECL_RESULT (current_function_decl);
3137 :
3138 129350 : caller_unsignedp = TYPE_UNSIGNED (TREE_TYPE (caller_res));
3139 129350 : caller_mode = DECL_MODE (caller_res);
3140 129350 : callee_unsignedp = TYPE_UNSIGNED (TREE_TYPE (funtype));
3141 129350 : callee_mode = TYPE_MODE (TREE_TYPE (funtype));
3142 129350 : caller_promoted_mode
3143 129350 : = promote_function_mode (TREE_TYPE (caller_res), caller_mode,
3144 : &caller_unsignedp,
3145 129350 : TREE_TYPE (current_function_decl), 1);
3146 129350 : callee_promoted_mode
3147 129350 : = promote_function_mode (TREE_TYPE (funtype), callee_mode,
3148 : &callee_unsignedp,
3149 : funtype, 1);
3150 129350 : if (caller_mode != VOIDmode
3151 129350 : && (caller_promoted_mode != callee_promoted_mode
3152 24771 : || ((caller_mode != caller_promoted_mode
3153 24771 : || callee_mode != callee_promoted_mode)
3154 0 : && (caller_unsignedp != callee_unsignedp
3155 0 : || partial_subreg_p (caller_mode, callee_mode)))))
3156 : {
3157 0 : try_tail_call = 0;
3158 0 : maybe_complain_about_tail_call (exp, _("caller and callee disagree "
3159 : "in promotion of function "
3160 : "return value"));
3161 : }
3162 : }
3163 :
3164 : /* Ensure current function's preferred stack boundary is at least
3165 : what we need. Stack alignment may also increase preferred stack
3166 : boundary. */
3167 17775156 : for (i = 0; i < num_actuals; i++)
3168 11957534 : if (reg_parm_stack_space > 0
3169 11878730 : || args[i].reg == 0
3170 9749774 : || args[i].partial != 0
3171 9749774 : || args[i].pass_on_stack)
3172 2207760 : update_stack_alignment_for_call (&args[i].locate);
3173 5817622 : if (crtl->preferred_stack_boundary < preferred_stack_boundary)
3174 860682 : crtl->preferred_stack_boundary = preferred_stack_boundary;
3175 : else
3176 : preferred_stack_boundary = crtl->preferred_stack_boundary;
3177 :
3178 5817622 : preferred_unit_stack_boundary = preferred_stack_boundary / BITS_PER_UNIT;
3179 :
3180 5817622 : if (flag_callgraph_info)
3181 0 : record_final_call (fndecl, EXPR_LOCATION (exp));
3182 :
3183 : /* We want to make two insn chains; one for a sibling call, the other
3184 : for a normal call. We will select one of the two chains after
3185 : initial RTL generation is complete. */
3186 11681885 : for (pass = try_tail_call ? 0 : 1; pass < 2; pass++)
3187 : {
3188 5817626 : bool sibcall_failure = false;
3189 5817626 : bool normal_failure = false;
3190 : /* We want to emit any pending stack adjustments before the tail
3191 : recursion "call". That way we know any adjustment after the tail
3192 : recursion call can be ignored if we indeed use the tail
3193 : call expansion. */
3194 5817626 : saved_pending_stack_adjust save;
3195 5817626 : rtx_insn *insns, *before_call, *after_args;
3196 5817626 : rtx next_arg_reg;
3197 :
3198 5817626 : if (pass == 0)
3199 : {
3200 : /* State variables we need to save and restore between
3201 : iterations. */
3202 129350 : save_pending_stack_adjust (&save);
3203 : }
3204 5817626 : if (pass)
3205 5688276 : flags &= ~ECF_SIBCALL;
3206 : else
3207 129350 : flags |= ECF_SIBCALL;
3208 :
3209 : /* Other state variables that we must reinitialize each time
3210 : through the loop (that are not initialized by the loop itself). */
3211 5817626 : argblock = 0;
3212 5817626 : call_fusage = 0;
3213 :
3214 : /* Start a new sequence for the normal call case.
3215 :
3216 : From this point on, if the sibling call fails, we want to set
3217 : sibcall_failure instead of continuing the loop. */
3218 5817626 : start_sequence ();
3219 :
3220 : /* Don't let pending stack adjusts add up to too much.
3221 : Also, do all pending adjustments now if there is any chance
3222 : this might be a call to alloca or if we are expanding a sibling
3223 : call sequence.
3224 : Also do the adjustments before a throwing call, otherwise
3225 : exception handling can fail; PR 19225. */
3226 5817626 : if (maybe_ge (pending_stack_adjust, 32)
3227 5754472 : || (maybe_ne (pending_stack_adjust, 0)
3228 138512 : && (flags & ECF_MAY_BE_ALLOCA))
3229 5754472 : || (maybe_ne (pending_stack_adjust, 0)
3230 138512 : && flag_exceptions && !(flags & ECF_NOTHROW))
3231 11465961 : || pass == 0)
3232 298162 : do_pending_stack_adjust ();
3233 :
3234 : /* Precompute any arguments as needed. */
3235 5817626 : if (pass)
3236 5688276 : precompute_arguments (num_actuals, args);
3237 :
3238 : /* Check the canary value for sibcall or function which doesn't
3239 : return and could throw. */
3240 5688276 : if ((pass == 0
3241 5688276 : || ((flags & ECF_NORETURN) != 0 && tree_could_throw_p (exp)))
3242 461745 : && crtl->stack_protect_guard
3243 26 : && targetm.stack_protect_runtime_enabled_p ())
3244 26 : stack_protect_epilogue ();
3245 :
3246 5817626 : adjusted_args_size = args_size;
3247 : /* Compute the actual size of the argument block required. The variable
3248 : and constant sizes must be combined, the size may have to be rounded,
3249 : and there may be a minimum required size. When generating a sibcall
3250 : pattern, do not round up, since we'll be re-using whatever space our
3251 : caller provided. */
3252 5817626 : unadjusted_args_size
3253 11505902 : = compute_argument_block_size (reg_parm_stack_space,
3254 : &adjusted_args_size,
3255 : fndecl, fntype,
3256 : (pass == 0 ? 0
3257 : : preferred_stack_boundary));
3258 :
3259 5817626 : old_stack_allocated = stack_pointer_delta - pending_stack_adjust;
3260 :
3261 : /* The argument block when performing a sibling call is the
3262 : incoming argument block. */
3263 5817626 : if (pass == 0)
3264 : {
3265 129350 : argblock = crtl->args.internal_arg_pointer;
3266 129350 : if (STACK_GROWS_DOWNWARD)
3267 129350 : argblock
3268 134273 : = plus_constant (Pmode, argblock, crtl->args.pretend_args_size);
3269 : else
3270 : argblock
3271 : = plus_constant (Pmode, argblock, -crtl->args.pretend_args_size);
3272 :
3273 129350 : HOST_WIDE_INT map_size = constant_lower_bound (args_size.constant);
3274 129350 : stored_args_map = sbitmap_alloc (map_size);
3275 129350 : bitmap_clear (stored_args_map);
3276 129350 : stored_args_watermark = HOST_WIDE_INT_M1U;
3277 : }
3278 :
3279 : /* If we have no actual push instructions, or shouldn't use them,
3280 : make space for all args right now. */
3281 5688276 : else if (adjusted_args_size.var != 0)
3282 : {
3283 0 : if (old_stack_level == 0)
3284 : {
3285 0 : emit_stack_save (SAVE_BLOCK, &old_stack_level);
3286 0 : old_stack_pointer_delta = stack_pointer_delta;
3287 0 : old_pending_adj = pending_stack_adjust;
3288 0 : pending_stack_adjust = 0;
3289 : /* stack_arg_under_construction says whether a stack arg is
3290 : being constructed at the old stack level. Pushing the stack
3291 : gets a clean outgoing argument block. */
3292 0 : old_stack_arg_under_construction = stack_arg_under_construction;
3293 0 : stack_arg_under_construction = 0;
3294 : }
3295 0 : argblock = push_block (ARGS_SIZE_RTX (adjusted_args_size), 0, 0);
3296 0 : if (flag_stack_usage_info)
3297 0 : current_function_has_unbounded_dynamic_stack_size = 1;
3298 : }
3299 : else
3300 : {
3301 : /* Note that we must go through the motions of allocating an argument
3302 : block even if the size is zero because we may be storing args
3303 : in the area reserved for register arguments, which may be part of
3304 : the stack frame. */
3305 :
3306 5688276 : poly_int64 needed = adjusted_args_size.constant;
3307 :
3308 : /* Store the maximum argument space used. It will be pushed by
3309 : the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
3310 : checking). */
3311 :
3312 5688276 : crtl->outgoing_args_size = upper_bound (crtl->outgoing_args_size,
3313 : needed);
3314 :
3315 5688276 : if (must_preallocate)
3316 : {
3317 73362 : if (ACCUMULATE_OUTGOING_ARGS)
3318 : {
3319 : /* Since the stack pointer will never be pushed, it is
3320 : possible for the evaluation of a parm to clobber
3321 : something we have already written to the stack.
3322 : Since most function calls on RISC machines do not use
3323 : the stack, this is uncommon, but must work correctly.
3324 :
3325 : Therefore, we save any area of the stack that was already
3326 : written and that we are using. Here we set up to do this
3327 : by making a new stack usage map from the old one. The
3328 : actual save will be done by store_one_arg.
3329 :
3330 : Another approach might be to try to reorder the argument
3331 : evaluations to avoid this conflicting stack usage. */
3332 :
3333 : /* Since we will be writing into the entire argument area,
3334 : the map must be allocated for its entire size, not just
3335 : the part that is the responsibility of the caller. */
3336 73356 : if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl))))
3337 67391 : needed += reg_parm_stack_space;
3338 :
3339 73356 : poly_int64 limit = needed;
3340 73356 : if (ARGS_GROW_DOWNWARD)
3341 : limit += 1;
3342 :
3343 : /* For polynomial sizes, this is the maximum possible
3344 : size needed for arguments with a constant size
3345 : and offset. */
3346 73356 : HOST_WIDE_INT const_limit = constant_lower_bound (limit);
3347 73356 : highest_outgoing_arg_in_use
3348 73356 : = MAX (initial_highest_arg_in_use, const_limit);
3349 :
3350 73356 : free (stack_usage_map_buf);
3351 73356 : stack_usage_map_buf = XNEWVEC (char, highest_outgoing_arg_in_use);
3352 73356 : stack_usage_map = stack_usage_map_buf;
3353 :
3354 73356 : if (initial_highest_arg_in_use)
3355 0 : memcpy (stack_usage_map, initial_stack_usage_map,
3356 : initial_highest_arg_in_use);
3357 :
3358 73356 : if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
3359 17653 : memset (&stack_usage_map[initial_highest_arg_in_use], 0,
3360 : (highest_outgoing_arg_in_use
3361 17653 : - initial_highest_arg_in_use));
3362 73356 : needed = 0;
3363 :
3364 : /* The address of the outgoing argument list must not be
3365 : copied to a register here, because argblock would be left
3366 : pointing to the wrong place after the call to
3367 : allocate_dynamic_stack_space below. */
3368 :
3369 73356 : argblock = virtual_outgoing_args_rtx;
3370 : }
3371 : else
3372 : {
3373 : /* Try to reuse some or all of the pending_stack_adjust
3374 : to get this space. */
3375 6 : if (inhibit_defer_pop == 0
3376 12 : && (combine_pending_stack_adjustment_and_call
3377 6 : (&needed,
3378 : unadjusted_args_size,
3379 : &adjusted_args_size,
3380 : preferred_unit_stack_boundary)))
3381 : {
3382 : /* combine_pending_stack_adjustment_and_call computes
3383 : an adjustment before the arguments are allocated.
3384 : Account for them and see whether or not the stack
3385 : needs to go up or down. */
3386 6 : needed = unadjusted_args_size - needed;
3387 :
3388 : /* Checked by
3389 : combine_pending_stack_adjustment_and_call. */
3390 6 : gcc_checking_assert (ordered_p (needed, 0));
3391 6 : if (maybe_lt (needed, 0))
3392 : {
3393 : /* We're releasing stack space. */
3394 : /* ??? We can avoid any adjustment at all if we're
3395 : already aligned. FIXME. */
3396 0 : pending_stack_adjust = -needed;
3397 0 : do_pending_stack_adjust ();
3398 0 : needed = 0;
3399 : }
3400 : else
3401 : /* We need to allocate space. We'll do that in
3402 : push_block below. */
3403 6 : pending_stack_adjust = 0;
3404 : }
3405 :
3406 : /* Special case this because overhead of `push_block' in
3407 : this case is non-trivial. */
3408 6 : if (known_eq (needed, 0))
3409 4 : argblock = virtual_outgoing_args_rtx;
3410 : else
3411 : {
3412 2 : rtx needed_rtx = gen_int_mode (needed, Pmode);
3413 2 : argblock = push_block (needed_rtx, 0, 0);
3414 2 : if (ARGS_GROW_DOWNWARD)
3415 : argblock = plus_constant (Pmode, argblock, needed);
3416 : }
3417 :
3418 : /* We only really need to call `copy_to_reg' in the case
3419 : where push insns are going to be used to pass ARGBLOCK
3420 : to a function call in ARGS. In that case, the stack
3421 : pointer changes value from the allocation point to the
3422 : call point, and hence the value of
3423 : VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
3424 : as well always do it. */
3425 6 : argblock = copy_to_reg (argblock);
3426 : }
3427 : }
3428 : }
3429 :
3430 5817626 : if (ACCUMULATE_OUTGOING_ARGS)
3431 : {
3432 : /* The save/restore code in store_one_arg handles all
3433 : cases except one: a constructor call (including a C
3434 : function returning a BLKmode struct) to initialize
3435 : an argument. */
3436 74542 : if (stack_arg_under_construction)
3437 : {
3438 0 : rtx push_size
3439 : = (gen_int_mode
3440 0 : (adjusted_args_size.constant
3441 0 : + (OUTGOING_REG_PARM_STACK_SPACE (!fndecl ? fntype
3442 : : TREE_TYPE (fndecl))
3443 0 : ? 0 : reg_parm_stack_space), Pmode));
3444 0 : if (old_stack_level == 0)
3445 : {
3446 0 : emit_stack_save (SAVE_BLOCK, &old_stack_level);
3447 0 : old_stack_pointer_delta = stack_pointer_delta;
3448 0 : old_pending_adj = pending_stack_adjust;
3449 0 : pending_stack_adjust = 0;
3450 : /* stack_arg_under_construction says whether a stack
3451 : arg is being constructed at the old stack level.
3452 : Pushing the stack gets a clean outgoing argument
3453 : block. */
3454 0 : old_stack_arg_under_construction
3455 0 : = stack_arg_under_construction;
3456 0 : stack_arg_under_construction = 0;
3457 : /* Make a new map for the new argument list. */
3458 0 : free (stack_usage_map_buf);
3459 0 : stack_usage_map_buf = XCNEWVEC (char, highest_outgoing_arg_in_use);
3460 0 : stack_usage_map = stack_usage_map_buf;
3461 0 : highest_outgoing_arg_in_use = 0;
3462 0 : stack_usage_watermark = HOST_WIDE_INT_M1U;
3463 : }
3464 : /* We can pass TRUE as the 4th argument because we just
3465 : saved the stack pointer and will restore it right after
3466 : the call. */
3467 0 : allocate_dynamic_stack_space (push_size, 0, BIGGEST_ALIGNMENT,
3468 : -1, true);
3469 : }
3470 :
3471 : /* If argument evaluation might modify the stack pointer,
3472 : copy the address of the argument list to a register. */
3473 368900 : for (i = 0; i < num_actuals; i++)
3474 294358 : if (args[i].pass_on_stack)
3475 : {
3476 0 : argblock = copy_addr_to_reg (argblock);
3477 0 : break;
3478 : }
3479 : }
3480 :
3481 5817626 : compute_argument_addresses (args, argblock, num_actuals);
3482 :
3483 : /* Stack is properly aligned, pops can't safely be deferred during
3484 : the evaluation of the arguments. */
3485 5817626 : NO_DEFER_POP;
3486 :
3487 : /* Precompute all register parameters. It isn't safe to compute
3488 : anything once we have started filling any specific hard regs.
3489 : TLS symbols sometimes need a call to resolve. Precompute
3490 : register parameters before any stack pointer manipulation
3491 : to avoid unaligned stack in the called function. */
3492 5817626 : precompute_register_parameters (num_actuals, args, ®_parm_seen);
3493 :
3494 5817625 : OK_DEFER_POP;
3495 :
3496 : /* Perform stack alignment before the first push (the last arg). */
3497 5817625 : if (argblock == 0
3498 5614913 : && maybe_gt (adjusted_args_size.constant, reg_parm_stack_space)
3499 6720505 : && maybe_ne (adjusted_args_size.constant, unadjusted_args_size))
3500 : {
3501 : /* When the stack adjustment is pending, we get better code
3502 : by combining the adjustments. */
3503 723593 : if (maybe_ne (pending_stack_adjust, 0)
3504 13945 : && ! inhibit_defer_pop
3505 737538 : && (combine_pending_stack_adjustment_and_call
3506 13945 : (&pending_stack_adjust,
3507 : unadjusted_args_size,
3508 : &adjusted_args_size,
3509 : preferred_unit_stack_boundary)))
3510 13945 : do_pending_stack_adjust ();
3511 709648 : else if (argblock == 0)
3512 709648 : anti_adjust_stack (gen_int_mode (adjusted_args_size.constant
3513 : - unadjusted_args_size,
3514 709648 : Pmode));
3515 : }
3516 : /* Now that the stack is properly aligned, pops can't safely
3517 : be deferred during the evaluation of the arguments. */
3518 5817625 : NO_DEFER_POP;
3519 :
3520 : /* Record the maximum pushed stack space size. We need to delay
3521 : doing it this far to take into account the optimization done
3522 : by combine_pending_stack_adjustment_and_call. */
3523 5817625 : if (flag_stack_usage_info
3524 1044 : && !ACCUMULATE_OUTGOING_ARGS
3525 1044 : && pass
3526 5818669 : && adjusted_args_size.var == 0)
3527 : {
3528 : poly_int64 pushed = (adjusted_args_size.constant
3529 1044 : + pending_stack_adjust);
3530 1044 : current_function_pushed_stack_size
3531 2088 : = upper_bound (current_function_pushed_stack_size, pushed);
3532 : }
3533 :
3534 5817625 : funexp = rtx_for_function_call (fndecl, addr);
3535 :
3536 5817625 : if (CALL_EXPR_STATIC_CHAIN (exp))
3537 37674 : static_chain_value = expand_normal (CALL_EXPR_STATIC_CHAIN (exp));
3538 : else
3539 : static_chain_value = 0;
3540 :
3541 : #ifdef REG_PARM_STACK_SPACE
3542 : /* Save the fixed argument area if it's part of the caller's frame and
3543 : is clobbered by argument setup for this call. */
3544 5817625 : if (ACCUMULATE_OUTGOING_ARGS && pass)
3545 73356 : save_area = save_fixed_argument_area (reg_parm_stack_space, argblock,
3546 : &low_to_save, &high_to_save);
3547 : #endif
3548 :
3549 : /* Now store (and compute if necessary) all non-register parms.
3550 : These come before register parms, since they can require block-moves,
3551 : which could clobber the registers used for register parms.
3552 : Parms which have partial registers are not stored here,
3553 : but we do preallocate space here if they want that. */
3554 :
3555 17775198 : for (i = 0; i < num_actuals; i++)
3556 : {
3557 11957573 : if (args[i].reg == 0 || args[i].pass_on_stack)
3558 : {
3559 2141691 : rtx_insn *before_arg = get_last_insn ();
3560 :
3561 : /* We don't allow passing huge (> 2^30 B) arguments
3562 : by value. It would cause an overflow later on. */
3563 2141691 : if (constant_lower_bound (adjusted_args_size.constant)
3564 : >= (1 << (HOST_BITS_PER_INT - 2)))
3565 : {
3566 6 : sorry ("passing too large argument on stack");
3567 : /* Don't worry about stack clean-up. */
3568 6 : if (pass == 0)
3569 0 : sibcall_failure = true;
3570 : else
3571 : normal_failure = true;
3572 6 : continue;
3573 : }
3574 :
3575 2141685 : if (store_one_arg (&args[i], argblock, flags,
3576 2141685 : adjusted_args_size.var != 0,
3577 : reg_parm_stack_space)
3578 2141685 : || (pass == 0
3579 10467 : && check_sibcall_argument_overlap (before_arg,
3580 : &args[i], true)))
3581 4 : sibcall_failure = true;
3582 2141685 : gcc_checking_assert (!args[i].stack || argblock);
3583 : }
3584 :
3585 11957567 : if (args[i].stack)
3586 64058 : call_fusage
3587 64058 : = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args[i].tree_value)),
3588 : gen_rtx_USE (VOIDmode, args[i].stack),
3589 : call_fusage);
3590 : }
3591 :
3592 : /* If we have a parm that is passed in registers but not in memory
3593 : and whose alignment does not permit a direct copy into registers,
3594 : make a group of pseudos that correspond to each register that we
3595 : will later fill. */
3596 5817625 : if (STRICT_ALIGNMENT)
3597 : store_unaligned_arguments_into_pseudos (args, num_actuals);
3598 :
3599 : /* Now store any partially-in-registers parm.
3600 : This is the last place a block-move can happen. */
3601 5817625 : if (reg_parm_seen)
3602 14781896 : for (i = 0; i < num_actuals; i++)
3603 10451064 : if (args[i].partial != 0 && ! args[i].pass_on_stack)
3604 : {
3605 0 : rtx_insn *before_arg = get_last_insn ();
3606 :
3607 : /* On targets with weird calling conventions (e.g. PA) it's
3608 : hard to ensure that all cases of argument overlap between
3609 : stack and registers work. Play it safe and bail out. */
3610 0 : if (ARGS_GROW_DOWNWARD && !STACK_GROWS_DOWNWARD)
3611 : {
3612 : sibcall_failure = true;
3613 : break;
3614 : }
3615 :
3616 0 : if (store_one_arg (&args[i], argblock, flags,
3617 0 : adjusted_args_size.var != 0,
3618 : reg_parm_stack_space)
3619 0 : || (pass == 0
3620 0 : && check_sibcall_argument_overlap (before_arg,
3621 : &args[i], true)))
3622 0 : sibcall_failure = true;
3623 : }
3624 :
3625 : /* Set up the next argument register. For sibling calls on machines
3626 : with register windows this should be the incoming register. */
3627 5817625 : if (pass == 0)
3628 129350 : next_arg_reg = targetm.calls.function_incoming_arg
3629 129350 : (args_so_far, function_arg_info::end_marker ());
3630 : else
3631 5688275 : next_arg_reg = targetm.calls.function_arg
3632 5688275 : (args_so_far, function_arg_info::end_marker ());
3633 :
3634 5817625 : targetm.calls.start_call_args (args_so_far);
3635 :
3636 5817625 : bool any_regs = false;
3637 23592823 : for (i = 0; i < num_actuals; i++)
3638 11957573 : if (args[i].reg != NULL_RTX)
3639 : {
3640 9815882 : any_regs = true;
3641 9815882 : targetm.calls.call_args (args_so_far, args[i].reg, funtype);
3642 : }
3643 5817625 : if (!any_regs)
3644 1486793 : targetm.calls.call_args (args_so_far, pc_rtx, funtype);
3645 :
3646 : /* Figure out the register where the value, if any, will come back. */
3647 5817625 : valreg = 0;
3648 5817625 : if (TYPE_MODE (rettype) != VOIDmode
3649 5817625 : && ! structure_value_addr)
3650 : {
3651 2345847 : if (pcc_struct_value)
3652 : valreg = hard_function_value (build_pointer_type (rettype),
3653 : fndecl, NULL, (pass == 0));
3654 : else
3655 2345847 : valreg = hard_function_value (rettype, fndecl, fntype,
3656 : (pass == 0));
3657 :
3658 : /* If VALREG is a PARALLEL whose first member has a zero
3659 : offset, use that. This is for targets such as m68k that
3660 : return the same value in multiple places. */
3661 2345847 : if (GET_CODE (valreg) == PARALLEL)
3662 : {
3663 11169 : rtx elem = XVECEXP (valreg, 0, 0);
3664 11169 : rtx where = XEXP (elem, 0);
3665 11169 : rtx offset = XEXP (elem, 1);
3666 11169 : if (offset == const0_rtx
3667 11152 : && GET_MODE (where) == GET_MODE (valreg))
3668 5817625 : valreg = where;
3669 : }
3670 : }
3671 :
3672 : /* If register arguments require space on the stack and stack space
3673 : was not preallocated, allocate stack space here for arguments
3674 : passed in registers. */
3675 5090806 : if (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl)))
3676 36293 : && !ACCUMULATE_OUTGOING_ARGS
3677 5846801 : && !must_preallocate && reg_parm_stack_space > 0)
3678 29176 : anti_adjust_stack (GEN_INT (reg_parm_stack_space));
3679 :
3680 : /* Cover pushed arguments with call usage, so that cselib knows to
3681 : invalidate the stores in them at the call insn. */
3682 5817625 : if (pass == 1 && !argblock
3683 5817625 : && (maybe_ne (adjusted_args_size.constant, 0)
3684 4694574 : || adjusted_args_size.var))
3685 : {
3686 920339 : rtx addr = virtual_outgoing_args_rtx;
3687 920339 : poly_int64 size = adjusted_args_size.constant;
3688 920339 : if (!STACK_GROWS_DOWNWARD)
3689 : {
3690 : if (adjusted_args_size.var)
3691 : /* ??? We can't compute the exact base address. */
3692 : addr = gen_rtx_PLUS (GET_MODE (addr), addr,
3693 : gen_rtx_SCRATCH (GET_MODE (addr)));
3694 : else
3695 : addr = plus_constant (GET_MODE (addr), addr, -size);
3696 : }
3697 920339 : rtx fu = gen_rtx_MEM (BLKmode, addr);
3698 920339 : if (adjusted_args_size.var == 0)
3699 920339 : set_mem_size (fu, size);
3700 920339 : call_fusage
3701 920339 : = gen_rtx_EXPR_LIST (BLKmode,
3702 : gen_rtx_USE (VOIDmode, fu),
3703 : call_fusage);
3704 : }
3705 :
3706 : /* Pass the function the address in which to return a
3707 : structure value. */
3708 5817625 : if (pass != 0 && structure_value_addr && ! structure_value_addr_parm)
3709 : {
3710 0 : structure_value_addr
3711 0 : = convert_memory_address (Pmode, structure_value_addr);
3712 0 : emit_move_insn (struct_value,
3713 0 : force_reg (Pmode,
3714 : force_operand (structure_value_addr,
3715 : NULL_RTX)));
3716 :
3717 0 : if (REG_P (struct_value))
3718 0 : use_reg (&call_fusage, struct_value);
3719 : }
3720 :
3721 5817625 : after_args = get_last_insn ();
3722 6005812 : funexp = prepare_call_address (fndecl ? fndecl : fntype, funexp,
3723 : static_chain_value, &call_fusage,
3724 : reg_parm_seen, flags);
3725 :
3726 5817625 : load_register_parameters (args, num_actuals, &call_fusage, flags,
3727 : pass == 0, &sibcall_failure);
3728 :
3729 : /* Save a pointer to the last insn before the call, so that we can
3730 : later safely search backwards to find the CALL_INSN. */
3731 5817625 : before_call = get_last_insn ();
3732 :
3733 5817625 : if (pass == 1 && (return_flags & ERF_RETURNS_ARG))
3734 : {
3735 158045 : int arg_nr = return_flags & ERF_RETURN_ARG_MASK;
3736 158045 : arg_nr = num_actuals - arg_nr - 1;
3737 158045 : if (arg_nr >= 0
3738 158045 : && arg_nr < num_actuals
3739 158039 : && args[arg_nr].reg
3740 151383 : && valreg
3741 146088 : && REG_P (valreg)
3742 146088 : && GET_MODE (args[arg_nr].reg) == GET_MODE (valreg))
3743 146088 : call_fusage
3744 146088 : = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args[arg_nr].tree_value)),
3745 : gen_rtx_SET (valreg, args[arg_nr].reg),
3746 : call_fusage);
3747 : }
3748 : /* All arguments and registers used for the call must be set up by
3749 : now! */
3750 :
3751 : /* Stack must be properly aligned now. */
3752 11505900 : gcc_assert (!pass
3753 : || multiple_p (stack_pointer_delta,
3754 : preferred_unit_stack_boundary));
3755 :
3756 : /* Generate the actual call instruction. */
3757 5817625 : emit_call_1 (funexp, exp, fndecl, funtype, unadjusted_args_size,
3758 : adjusted_args_size.constant, struct_value_size,
3759 : next_arg_reg, valreg, old_inhibit_defer_pop, call_fusage,
3760 : flags, args_so_far);
3761 :
3762 5817625 : rtx_call_insn *last;
3763 5817625 : rtx datum = NULL_RTX;
3764 5817625 : if (fndecl != NULL_TREE)
3765 : {
3766 5629438 : datum = XEXP (DECL_RTL (fndecl), 0);
3767 5629438 : gcc_assert (datum != NULL_RTX
3768 : && GET_CODE (datum) == SYMBOL_REF);
3769 : }
3770 5817625 : last = last_call_insn ();
3771 5817625 : add_reg_note (last, REG_CALL_DECL, datum);
3772 :
3773 : /* If the call setup or the call itself overlaps with anything
3774 : of the argument setup we probably clobbered our call address.
3775 : In that case we can't do sibcalls. */
3776 5817625 : if (pass == 0
3777 5817625 : && check_sibcall_argument_overlap (after_args, 0, false))
3778 0 : sibcall_failure = true;
3779 :
3780 : /* If a non-BLKmode value is returned at the most significant end
3781 : of a register, shift the register right by the appropriate amount
3782 : and update VALREG accordingly. BLKmode values are handled by the
3783 : group load/store machinery below. */
3784 5817625 : if (!structure_value_addr
3785 : && !pcc_struct_value
3786 5592573 : && TYPE_MODE (rettype) != VOIDmode
3787 2345847 : && TYPE_MODE (rettype) != BLKmode
3788 2343349 : && REG_P (valreg)
3789 8151327 : && targetm.calls.return_in_msb (rettype))
3790 : {
3791 0 : if (shift_return_value (TYPE_MODE (rettype), false, valreg))
3792 0 : sibcall_failure = true;
3793 0 : valreg = gen_rtx_REG (TYPE_MODE (rettype), REGNO (valreg));
3794 : }
3795 :
3796 : /* If the return register exists, for malloc like
3797 : function calls, mark the return register with the
3798 : alignment and noalias reg note. */
3799 5817625 : if (pass && (flags & ECF_MALLOC) && valreg)
3800 : {
3801 135548 : rtx temp = gen_reg_rtx (GET_MODE (valreg));
3802 135548 : rtx_insn *last;
3803 :
3804 : /* The return value from a malloc-like function is a pointer. */
3805 135548 : if (TREE_CODE (rettype) == POINTER_TYPE)
3806 139699 : mark_reg_pointer (temp, MALLOC_ABI_ALIGNMENT);
3807 :
3808 135548 : last = emit_move_insn (temp, valreg);
3809 :
3810 : /* The return value from a malloc-like function cannot alias
3811 : anything else. */
3812 135548 : add_reg_note (last, REG_NOALIAS, temp);
3813 135548 : valreg = temp;
3814 : }
3815 :
3816 : /* For calls to `setjmp', etc., inform
3817 : function.cc:setjmp_warnings that it should complain if
3818 : nonvolatile values are live. For functions that cannot
3819 : return, inform flow that control does not fall through. */
3820 :
3821 5817625 : if ((flags & ECF_NORETURN) || pass == 0)
3822 : {
3823 : /* The barrier must be emitted
3824 : immediately after the CALL_INSN. Some ports emit more
3825 : than just a CALL_INSN above, so we must search for it here. */
3826 :
3827 888616 : rtx_insn *last = get_last_insn ();
3828 888730 : while (!CALL_P (last))
3829 : {
3830 114 : last = PREV_INSN (last);
3831 : /* There was no CALL_INSN? */
3832 114 : gcc_assert (last != before_call);
3833 : }
3834 :
3835 888616 : emit_barrier_after (last);
3836 :
3837 : /* Stack adjustments after a noreturn call are dead code.
3838 : However when NO_DEFER_POP is in effect, we must preserve
3839 : stack_pointer_delta. */
3840 888616 : if (inhibit_defer_pop == 0)
3841 : {
3842 888616 : stack_pointer_delta = old_stack_allocated;
3843 888616 : pending_stack_adjust = 0;
3844 : }
3845 : }
3846 :
3847 : /* If value type not void, return an rtx for the value. */
3848 :
3849 5817625 : if (TYPE_MODE (rettype) == VOIDmode
3850 5817625 : || ignore)
3851 3877590 : target = const0_rtx;
3852 1940035 : else if (structure_value_addr)
3853 : {
3854 204023 : if (target == 0 || !MEM_P (target))
3855 : {
3856 57012 : target
3857 57012 : = gen_rtx_MEM (TYPE_MODE (rettype),
3858 57012 : memory_address (TYPE_MODE (rettype),
3859 : structure_value_addr));
3860 57012 : set_mem_attributes (target, rettype, 1);
3861 : }
3862 : }
3863 1736012 : else if (pcc_struct_value)
3864 : {
3865 : /* This is the special C++ case where we need to
3866 : know what the true target was. We take care to
3867 : never use this value more than once in one expression. */
3868 : target = gen_rtx_MEM (TYPE_MODE (rettype),
3869 : copy_to_reg (valreg));
3870 : set_mem_attributes (target, rettype, 1);
3871 : }
3872 : /* Handle calls that return values in multiple non-contiguous locations.
3873 : The Irix 6 ABI has examples of this. */
3874 1736012 : else if (GET_CODE (valreg) == PARALLEL)
3875 : {
3876 10901 : if (target == 0)
3877 1835 : target = emit_group_move_into_temps (valreg);
3878 9066 : else if (rtx_equal_p (target, valreg))
3879 : ;
3880 9066 : else if (GET_CODE (target) == PARALLEL)
3881 : /* Handle the result of a emit_group_move_into_temps
3882 : call in the previous pass. */
3883 0 : emit_group_move (target, valreg);
3884 : else
3885 9066 : emit_group_store (target, valreg, rettype,
3886 9066 : int_size_in_bytes (rettype));
3887 : }
3888 1725111 : else if (target
3889 1584230 : && GET_MODE (target) == TYPE_MODE (rettype)
3890 3309341 : && GET_MODE (target) == GET_MODE (valreg))
3891 : {
3892 1584227 : bool may_overlap = false;
3893 :
3894 : /* We have to copy a return value in a CLASS_LIKELY_SPILLED hard
3895 : reg to a plain register. */
3896 1584227 : if (!REG_P (target) || HARD_REGISTER_P (target))
3897 48051 : valreg = avoid_likely_spilled_reg (valreg);
3898 :
3899 : /* If TARGET is a MEM in the argument area, and we have
3900 : saved part of the argument area, then we can't store
3901 : directly into TARGET as it may get overwritten when we
3902 : restore the argument save area below. Don't work too
3903 : hard though and simply force TARGET to a register if it
3904 : is a MEM; the optimizer is quite likely to sort it out. */
3905 1584227 : if (ACCUMULATE_OUTGOING_ARGS && pass && MEM_P (target))
3906 1063 : for (i = 0; i < num_actuals; i++)
3907 669 : if (args[i].save_area)
3908 : {
3909 : may_overlap = true;
3910 : break;
3911 : }
3912 :
3913 394 : if (may_overlap)
3914 0 : target = copy_to_reg (valreg);
3915 : else
3916 : {
3917 : /* TARGET and VALREG cannot be equal at this point
3918 : because the latter would not have
3919 : REG_FUNCTION_VALUE_P true, while the former would if
3920 : it were referring to the same register.
3921 :
3922 : If they refer to the same register, this move will be
3923 : a no-op, except when function inlining is being
3924 : done. */
3925 1584227 : emit_move_insn (target, valreg);
3926 :
3927 : /* If we are setting a MEM, this code must be executed.
3928 : Since it is emitted after the call insn, sibcall
3929 : optimization cannot be performed in that case. */
3930 1584227 : if (MEM_P (target))
3931 46479 : sibcall_failure = true;
3932 : }
3933 : }
3934 : else
3935 140884 : target = copy_to_reg (avoid_likely_spilled_reg (valreg));
3936 :
3937 : /* If we promoted this return value, make the proper SUBREG.
3938 : TARGET might be const0_rtx here, so be careful. */
3939 5817625 : if (REG_P (target)
3940 1679872 : && TYPE_MODE (rettype) != BLKmode
3941 7497248 : && GET_MODE (target) != TYPE_MODE (rettype))
3942 : {
3943 1 : tree type = rettype;
3944 1 : int unsignedp = TYPE_UNSIGNED (type);
3945 1 : machine_mode ret_mode = TYPE_MODE (type);
3946 1 : machine_mode pmode;
3947 :
3948 : /* Ensure we promote as expected, and get the new unsignedness. */
3949 1 : pmode = promote_function_mode (type, ret_mode, &unsignedp,
3950 : funtype, 1);
3951 1 : gcc_assert (GET_MODE (target) == pmode);
3952 :
3953 1 : if (SCALAR_INT_MODE_P (pmode)
3954 1 : && SCALAR_FLOAT_MODE_P (ret_mode)
3955 1 : && known_gt (GET_MODE_SIZE (pmode), GET_MODE_SIZE (ret_mode)))
3956 0 : target = convert_wider_int_to_float (ret_mode, pmode, target);
3957 : else
3958 : {
3959 1 : target = gen_lowpart_SUBREG (ret_mode, target);
3960 1 : SUBREG_PROMOTED_VAR_P (target) = 1;
3961 2 : SUBREG_PROMOTED_SET (target, unsignedp);
3962 : }
3963 : }
3964 :
3965 : /* If size of args is variable or this was a constructor call for a stack
3966 : argument, restore saved stack-pointer value. */
3967 :
3968 5817625 : if (old_stack_level)
3969 : {
3970 158 : rtx_insn *prev = get_last_insn ();
3971 :
3972 158 : emit_stack_restore (SAVE_BLOCK, old_stack_level);
3973 158 : stack_pointer_delta = old_stack_pointer_delta;
3974 :
3975 158 : fixup_args_size_notes (prev, get_last_insn (), stack_pointer_delta);
3976 :
3977 158 : pending_stack_adjust = old_pending_adj;
3978 158 : old_stack_allocated = stack_pointer_delta - pending_stack_adjust;
3979 158 : stack_arg_under_construction = old_stack_arg_under_construction;
3980 158 : highest_outgoing_arg_in_use = initial_highest_arg_in_use;
3981 158 : stack_usage_map = initial_stack_usage_map;
3982 158 : stack_usage_watermark = initial_stack_usage_watermark;
3983 158 : sibcall_failure = true;
3984 : }
3985 5817467 : else if (ACCUMULATE_OUTGOING_ARGS && pass)
3986 : {
3987 : #ifdef REG_PARM_STACK_SPACE
3988 73356 : if (save_area)
3989 0 : restore_fixed_argument_area (save_area, argblock,
3990 : high_to_save, low_to_save);
3991 : #endif
3992 :
3993 : /* If we saved any argument areas, restore them. */
3994 366508 : for (i = 0; i < num_actuals; i++)
3995 293152 : if (args[i].save_area)
3996 : {
3997 0 : machine_mode save_mode = GET_MODE (args[i].save_area);
3998 0 : rtx stack_area
3999 0 : = gen_rtx_MEM (save_mode,
4000 0 : memory_address (save_mode,
4001 : XEXP (args[i].stack_slot, 0)));
4002 :
4003 0 : if (save_mode != BLKmode)
4004 0 : emit_move_insn (stack_area, args[i].save_area);
4005 : else
4006 0 : emit_block_move (stack_area, args[i].save_area,
4007 : (gen_int_mode
4008 0 : (args[i].locate.size.constant, Pmode)),
4009 : BLOCK_OP_CALL_PARM);
4010 : }
4011 :
4012 73356 : highest_outgoing_arg_in_use = initial_highest_arg_in_use;
4013 73356 : stack_usage_map = initial_stack_usage_map;
4014 73356 : stack_usage_watermark = initial_stack_usage_watermark;
4015 : }
4016 :
4017 : /* If this was alloca, record the new stack level. */
4018 5817625 : if (flags & ECF_MAY_BE_ALLOCA)
4019 29 : record_new_stack_level ();
4020 :
4021 : /* Free up storage we no longer need. */
4022 17775198 : for (i = 0; i < num_actuals; ++i)
4023 11957573 : free (args[i].aligned_regs);
4024 :
4025 5817625 : targetm.calls.end_call_args (args_so_far);
4026 :
4027 5817625 : insns = end_sequence ();
4028 :
4029 5817625 : if (pass == 0)
4030 : {
4031 129350 : tail_call_insns = insns;
4032 :
4033 : /* Restore the pending stack adjustment now that we have
4034 : finished generating the sibling call sequence. */
4035 :
4036 129350 : restore_pending_stack_adjust (&save);
4037 :
4038 : /* Prepare arg structure for next iteration. */
4039 489842 : for (i = 0; i < num_actuals; i++)
4040 : {
4041 231142 : args[i].value = 0;
4042 231142 : args[i].aligned_regs = 0;
4043 231142 : args[i].stack = 0;
4044 : }
4045 :
4046 129350 : sbitmap_free (stored_args_map);
4047 129350 : internal_arg_pointer_exp_state.scan_start = NULL;
4048 129350 : internal_arg_pointer_exp_state.cache.release ();
4049 : }
4050 : else
4051 : {
4052 5688275 : normal_call_insns = insns;
4053 :
4054 : /* Verify that we've deallocated all the stack we used. */
4055 5688275 : gcc_assert ((flags & ECF_NORETURN)
4056 : || normal_failure
4057 : || known_eq (old_stack_allocated,
4058 : stack_pointer_delta
4059 : - pending_stack_adjust));
4060 5688269 : if (normal_failure)
4061 : normal_call_insns = NULL;
4062 : }
4063 :
4064 : /* If something prevents making this a sibling call,
4065 : zero out the sequence. */
4066 5817625 : if (sibcall_failure)
4067 46641 : tail_call_insns = NULL;
4068 : else
4069 : break;
4070 : }
4071 :
4072 : /* If tail call production succeeded, we need to remove REG_EQUIV notes on
4073 : arguments too, as argument area is now clobbered by the call. */
4074 5817621 : if (tail_call_insns)
4075 : {
4076 129346 : emit_insn (tail_call_insns);
4077 129346 : crtl->tail_call_emit = true;
4078 : }
4079 : else
4080 : {
4081 5688275 : emit_insn (normal_call_insns);
4082 5688275 : if (try_tail_call)
4083 : /* Ideally we'd emit a message for all of the ways that it could
4084 : have failed. */
4085 4 : maybe_complain_about_tail_call (exp, _("tail call production failed"));
4086 : }
4087 :
4088 5817621 : currently_expanding_call--;
4089 :
4090 5817621 : free (stack_usage_map_buf);
4091 5817621 : free (args);
4092 5817621 : return target;
4093 : }
4094 :
4095 : /* A sibling call sequence invalidates any REG_EQUIV notes made for
4096 : this function's incoming arguments.
4097 :
4098 : At the start of RTL generation we know the only REG_EQUIV notes
4099 : in the rtl chain are those for incoming arguments, so we can look
4100 : for REG_EQUIV notes between the start of the function and the
4101 : NOTE_INSN_FUNCTION_BEG.
4102 :
4103 : This is (slight) overkill. We could keep track of the highest
4104 : argument we clobber and be more selective in removing notes, but it
4105 : does not seem to be worth the effort. */
4106 :
4107 : void
4108 124074 : fixup_tail_calls (void)
4109 : {
4110 124074 : rtx_insn *insn;
4111 :
4112 572689 : for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4113 : {
4114 572689 : rtx note;
4115 :
4116 : /* There are never REG_EQUIV notes for the incoming arguments
4117 : after the NOTE_INSN_FUNCTION_BEG note, so stop if we see it. */
4118 572689 : if (NOTE_P (insn)
4119 372719 : && NOTE_KIND (insn) == NOTE_INSN_FUNCTION_BEG)
4120 : break;
4121 :
4122 448615 : note = find_reg_note (insn, REG_EQUIV, 0);
4123 448615 : if (note)
4124 19510 : remove_note (insn, note);
4125 448615 : note = find_reg_note (insn, REG_EQUIV, 0);
4126 448615 : gcc_assert (!note);
4127 : }
4128 124074 : }
4129 :
4130 : /* Traverse a list of TYPES and expand all complex types into their
4131 : components. */
4132 : static tree
4133 0 : split_complex_types (tree types)
4134 : {
4135 0 : tree p;
4136 :
4137 : /* Before allocating memory, check for the common case of no complex. */
4138 0 : for (p = types; p; p = TREE_CHAIN (p))
4139 : {
4140 0 : tree type = TREE_VALUE (p);
4141 0 : if (TREE_CODE (type) == COMPLEX_TYPE
4142 0 : && targetm.calls.split_complex_arg (type))
4143 0 : goto found;
4144 : }
4145 : return types;
4146 :
4147 0 : found:
4148 0 : types = copy_list (types);
4149 :
4150 0 : for (p = types; p; p = TREE_CHAIN (p))
4151 : {
4152 0 : tree complex_type = TREE_VALUE (p);
4153 :
4154 0 : if (TREE_CODE (complex_type) == COMPLEX_TYPE
4155 0 : && targetm.calls.split_complex_arg (complex_type))
4156 : {
4157 0 : tree next, imag;
4158 :
4159 : /* Rewrite complex type with component type. */
4160 0 : TREE_VALUE (p) = TREE_TYPE (complex_type);
4161 0 : next = TREE_CHAIN (p);
4162 :
4163 : /* Add another component type for the imaginary part. */
4164 0 : imag = build_tree_list (NULL_TREE, TREE_VALUE (p));
4165 0 : TREE_CHAIN (p) = imag;
4166 0 : TREE_CHAIN (imag) = next;
4167 :
4168 : /* Skip the newly created node. */
4169 0 : p = TREE_CHAIN (p);
4170 : }
4171 : }
4172 :
4173 : return types;
4174 : }
4175 :
4176 : /* Output a library call to function ORGFUN (a SYMBOL_REF rtx)
4177 : for a value of mode OUTMODE,
4178 : with NARGS different arguments, passed as ARGS.
4179 : Store the return value if RETVAL is nonzero: store it in VALUE if
4180 : VALUE is nonnull, otherwise pick a convenient location. In either
4181 : case return the location of the stored value.
4182 :
4183 : FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for
4184 : `const' calls, LCT_PURE for `pure' calls, or another LCT_ value for
4185 : other types of library calls. */
4186 :
4187 : rtx
4188 117396 : emit_library_call_value_1 (int retval, rtx orgfun, rtx value,
4189 : enum libcall_type fn_type,
4190 : machine_mode outmode, int nargs, rtx_mode_t *args)
4191 : {
4192 : /* Total size in bytes of all the stack-parms scanned so far. */
4193 117396 : struct args_size args_size;
4194 : /* Size of arguments before any adjustments (such as rounding). */
4195 117396 : struct args_size original_args_size;
4196 117396 : int argnum;
4197 117396 : rtx fun;
4198 : /* Todo, choose the correct decl type of orgfun. Sadly this information
4199 : isn't present here, so we default to native calling abi here. */
4200 117396 : tree fndecl ATTRIBUTE_UNUSED = NULL_TREE; /* library calls default to host calling abi ? */
4201 117396 : tree fntype ATTRIBUTE_UNUSED = NULL_TREE; /* library calls default to host calling abi ? */
4202 117396 : int count;
4203 117396 : rtx argblock = 0;
4204 117396 : CUMULATIVE_ARGS args_so_far_v;
4205 117396 : cumulative_args_t args_so_far;
4206 117396 : struct arg
4207 : {
4208 : rtx value;
4209 : machine_mode mode;
4210 : rtx reg;
4211 : int partial;
4212 : struct locate_and_pad_arg_data locate;
4213 : rtx save_area;
4214 : };
4215 117396 : struct arg *argvec;
4216 117396 : int old_inhibit_defer_pop = inhibit_defer_pop;
4217 117396 : rtx call_fusage = 0;
4218 117396 : rtx mem_value = 0;
4219 117396 : rtx valreg;
4220 117396 : bool pcc_struct_value = false;
4221 117396 : poly_int64 struct_value_size = 0;
4222 117396 : int flags;
4223 117396 : int reg_parm_stack_space = 0;
4224 117396 : poly_int64 needed;
4225 117396 : rtx_insn *before_call;
4226 117396 : bool have_push_fusage;
4227 117396 : tree tfom; /* type_for_mode (outmode, 0) */
4228 :
4229 : #ifdef REG_PARM_STACK_SPACE
4230 : /* Define the boundary of the register parm stack space that needs to be
4231 : save, if any. */
4232 117396 : int low_to_save = 0, high_to_save = 0;
4233 117396 : rtx save_area = 0; /* Place that it is saved. */
4234 : #endif
4235 :
4236 : /* Size of the stack reserved for parameter registers. */
4237 117396 : unsigned int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
4238 117396 : char *initial_stack_usage_map = stack_usage_map;
4239 117396 : unsigned HOST_WIDE_INT initial_stack_usage_watermark = stack_usage_watermark;
4240 117396 : char *stack_usage_map_buf = NULL;
4241 :
4242 117396 : rtx struct_value = targetm.calls.struct_value_rtx (0, 0);
4243 :
4244 : #ifdef REG_PARM_STACK_SPACE
4245 117396 : reg_parm_stack_space = REG_PARM_STACK_SPACE ((tree) 0);
4246 : #endif
4247 :
4248 : /* By default, library functions cannot throw. */
4249 117396 : flags = ECF_NOTHROW;
4250 :
4251 117396 : switch (fn_type)
4252 : {
4253 : case LCT_NORMAL:
4254 : break;
4255 : case LCT_CONST:
4256 : flags |= ECF_CONST;
4257 : break;
4258 : case LCT_PURE:
4259 : flags |= ECF_PURE;
4260 : break;
4261 : case LCT_NORETURN:
4262 : flags |= ECF_NORETURN;
4263 : break;
4264 : case LCT_THROW:
4265 : flags &= ~ECF_NOTHROW;
4266 : break;
4267 : case LCT_RETURNS_TWICE:
4268 : flags = ECF_RETURNS_TWICE;
4269 : break;
4270 : }
4271 117396 : fun = orgfun;
4272 :
4273 : /* Ensure current function's preferred stack boundary is at least
4274 : what we need. */
4275 117396 : if (crtl->preferred_stack_boundary < PREFERRED_STACK_BOUNDARY)
4276 12278 : crtl->preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
4277 :
4278 : /* If this kind of value comes back in memory,
4279 : decide where in memory it should come back. */
4280 117396 : if (outmode != VOIDmode)
4281 : {
4282 115370 : tfom = lang_hooks.types.type_for_mode (outmode, 0);
4283 115370 : if (aggregate_value_p (tfom, 0))
4284 : {
4285 : #ifdef PCC_STATIC_STRUCT_RETURN
4286 : rtx pointer_reg
4287 : = hard_function_value (build_pointer_type (tfom), 0, 0, 0);
4288 : mem_value = gen_rtx_MEM (outmode, pointer_reg);
4289 : pcc_struct_value = true;
4290 : if (value == 0)
4291 : value = gen_reg_rtx (outmode);
4292 : #else /* not PCC_STATIC_STRUCT_RETURN */
4293 20190 : struct_value_size = GET_MODE_SIZE (outmode);
4294 10095 : if (value != 0 && MEM_P (value))
4295 : mem_value = value;
4296 : else
4297 10095 : mem_value = assign_temp (tfom, 1, 1);
4298 : #endif
4299 : /* This call returns a big structure. */
4300 10095 : flags &= ~(ECF_CONST | ECF_PURE | ECF_LOOPING_CONST_OR_PURE);
4301 : }
4302 : }
4303 : else
4304 2026 : tfom = void_type_node;
4305 :
4306 : /* ??? Unfinished: must pass the memory address as an argument. */
4307 :
4308 : /* Copy all the libcall-arguments out of the varargs data
4309 : and into a vector ARGVEC.
4310 :
4311 : Compute how to pass each argument. We only support a very small subset
4312 : of the full argument passing conventions to limit complexity here since
4313 : library functions shouldn't have many args. */
4314 :
4315 117396 : argvec = XALLOCAVEC (struct arg, nargs + 1);
4316 117396 : memset (argvec, 0, (nargs + 1) * sizeof (struct arg));
4317 :
4318 : #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
4319 : INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far_v, outmode, fun);
4320 : #else
4321 117396 : INIT_CUMULATIVE_ARGS (args_so_far_v, NULL_TREE, fun, 0, nargs);
4322 : #endif
4323 117396 : args_so_far = pack_cumulative_args (&args_so_far_v);
4324 :
4325 117396 : args_size.constant = 0;
4326 117396 : args_size.var = 0;
4327 :
4328 117396 : count = 0;
4329 :
4330 117396 : push_temp_slots ();
4331 :
4332 : /* If there's a structure value address to be passed,
4333 : either pass it in the special place, or pass it as an extra argument. */
4334 117396 : if (mem_value && struct_value == 0 && ! pcc_struct_value)
4335 : {
4336 10095 : rtx addr = XEXP (mem_value, 0);
4337 :
4338 10095 : nargs++;
4339 :
4340 : /* Make sure it is a reasonable operand for a move or push insn. */
4341 10095 : if (!REG_P (addr) && !MEM_P (addr)
4342 20190 : && !(CONSTANT_P (addr)
4343 0 : && targetm.legitimate_constant_p (Pmode, addr)))
4344 10095 : addr = force_operand (addr, NULL_RTX);
4345 :
4346 10095 : argvec[count].value = addr;
4347 10095 : argvec[count].mode = Pmode;
4348 10095 : argvec[count].partial = 0;
4349 :
4350 10095 : function_arg_info ptr_arg (Pmode, /*named=*/true);
4351 10095 : argvec[count].reg = targetm.calls.function_arg (args_so_far, ptr_arg);
4352 10095 : gcc_assert (targetm.calls.arg_partial_bytes (args_so_far, ptr_arg) == 0);
4353 :
4354 10095 : locate_and_pad_parm (Pmode, NULL_TREE,
4355 : #ifdef STACK_PARMS_IN_REG_PARM_AREA
4356 : 1,
4357 : #else
4358 10095 : argvec[count].reg != 0,
4359 : #endif
4360 : reg_parm_stack_space, 0,
4361 : NULL_TREE, &args_size, &argvec[count].locate);
4362 :
4363 10095 : if (argvec[count].reg == 0 || argvec[count].partial != 0
4364 0 : || reg_parm_stack_space > 0)
4365 10095 : args_size.constant += argvec[count].locate.size.constant;
4366 :
4367 10095 : targetm.calls.function_arg_advance (args_so_far, ptr_arg);
4368 :
4369 10095 : count++;
4370 : }
4371 :
4372 321882 : for (unsigned int i = 0; count < nargs; i++, count++)
4373 : {
4374 204486 : rtx val = args[i].first;
4375 204486 : function_arg_info arg (args[i].second, /*named=*/true);
4376 204486 : int unsigned_p = 0;
4377 :
4378 : /* We cannot convert the arg value to the mode the library wants here;
4379 : must do it earlier where we know the signedness of the arg. */
4380 204486 : gcc_assert (arg.mode != BLKmode
4381 : && (GET_MODE (val) == arg.mode
4382 : || GET_MODE (val) == VOIDmode));
4383 :
4384 : /* Make sure it is a reasonable operand for a move or push insn. */
4385 43767 : if (!REG_P (val) && !MEM_P (val)
4386 278161 : && !(CONSTANT_P (val)
4387 36275 : && targetm.legitimate_constant_p (arg.mode, val)))
4388 1129 : val = force_operand (val, NULL_RTX);
4389 :
4390 204486 : if (pass_by_reference (&args_so_far_v, arg))
4391 : {
4392 0 : rtx slot;
4393 0 : int must_copy = !reference_callee_copied (&args_so_far_v, arg);
4394 :
4395 : /* If this was a CONST function, it is now PURE since it now
4396 : reads memory. */
4397 0 : if (flags & ECF_CONST)
4398 : {
4399 0 : flags &= ~ECF_CONST;
4400 0 : flags |= ECF_PURE;
4401 : }
4402 :
4403 0 : if (MEM_P (val) && !must_copy)
4404 : {
4405 0 : tree val_expr = MEM_EXPR (val);
4406 0 : if (val_expr)
4407 0 : mark_addressable (val_expr);
4408 : slot = val;
4409 : }
4410 : else
4411 : {
4412 0 : slot = assign_temp (lang_hooks.types.type_for_mode (arg.mode, 0),
4413 : 1, 1);
4414 0 : emit_move_insn (slot, val);
4415 : }
4416 :
4417 0 : call_fusage = gen_rtx_EXPR_LIST (VOIDmode,
4418 : gen_rtx_USE (VOIDmode, slot),
4419 : call_fusage);
4420 0 : if (must_copy)
4421 0 : call_fusage = gen_rtx_EXPR_LIST (VOIDmode,
4422 : gen_rtx_CLOBBER (VOIDmode,
4423 : slot),
4424 : call_fusage);
4425 :
4426 0 : arg.mode = Pmode;
4427 0 : arg.pass_by_reference = true;
4428 0 : val = force_operand (XEXP (slot, 0), NULL_RTX);
4429 : }
4430 :
4431 204486 : arg.mode = promote_function_mode (NULL_TREE, arg.mode, &unsigned_p,
4432 : NULL_TREE, 0);
4433 204486 : argvec[count].mode = arg.mode;
4434 204486 : argvec[count].value = convert_modes (arg.mode, GET_MODE (val), val,
4435 : unsigned_p);
4436 204486 : argvec[count].reg = targetm.calls.function_arg (args_so_far, arg);
4437 :
4438 204486 : argvec[count].partial
4439 204486 : = targetm.calls.arg_partial_bytes (args_so_far, arg);
4440 :
4441 204486 : if (argvec[count].reg == 0
4442 176740 : || argvec[count].partial != 0
4443 176740 : || reg_parm_stack_space > 0)
4444 : {
4445 27746 : locate_and_pad_parm (arg.mode, NULL_TREE,
4446 : #ifdef STACK_PARMS_IN_REG_PARM_AREA
4447 : 1,
4448 : #else
4449 : argvec[count].reg != 0,
4450 : #endif
4451 : reg_parm_stack_space, argvec[count].partial,
4452 : NULL_TREE, &args_size, &argvec[count].locate);
4453 27746 : args_size.constant += argvec[count].locate.size.constant;
4454 27746 : gcc_assert (!argvec[count].locate.size.var);
4455 : }
4456 : #ifdef BLOCK_REG_PADDING
4457 : else
4458 : /* The argument is passed entirely in registers. See at which
4459 : end it should be padded. */
4460 : argvec[count].locate.where_pad =
4461 : BLOCK_REG_PADDING (arg.mode, NULL_TREE,
4462 : known_le (GET_MODE_SIZE (arg.mode),
4463 : UNITS_PER_WORD));
4464 : #endif
4465 :
4466 204486 : targetm.calls.function_arg_advance (args_so_far, arg);
4467 : }
4468 :
4469 331977 : for (int i = 0; i < nargs; i++)
4470 214581 : if (reg_parm_stack_space > 0
4471 214581 : || argvec[i].reg == 0
4472 176740 : || argvec[i].partial != 0)
4473 37841 : update_stack_alignment_for_call (&argvec[i].locate);
4474 :
4475 : /* If this machine requires an external definition for library
4476 : functions, write one out. */
4477 117396 : assemble_external_libcall (fun);
4478 :
4479 117396 : original_args_size = args_size;
4480 117396 : args_size.constant = (aligned_upper_bound (args_size.constant
4481 117396 : + stack_pointer_delta,
4482 : STACK_BYTES)
4483 117396 : - stack_pointer_delta);
4484 :
4485 117396 : args_size.constant = upper_bound (args_size.constant,
4486 : reg_parm_stack_space);
4487 :
4488 117396 : if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl))))
4489 117396 : args_size.constant -= reg_parm_stack_space;
4490 :
4491 117396 : crtl->outgoing_args_size = upper_bound (crtl->outgoing_args_size,
4492 : args_size.constant);
4493 :
4494 117396 : if (flag_stack_usage_info && !ACCUMULATE_OUTGOING_ARGS)
4495 : {
4496 0 : poly_int64 pushed = args_size.constant + pending_stack_adjust;
4497 0 : current_function_pushed_stack_size
4498 0 : = upper_bound (current_function_pushed_stack_size, pushed);
4499 : }
4500 :
4501 117396 : if (ACCUMULATE_OUTGOING_ARGS)
4502 : {
4503 : /* Since the stack pointer will never be pushed, it is possible for
4504 : the evaluation of a parm to clobber something we have already
4505 : written to the stack. Since most function calls on RISC machines
4506 : do not use the stack, this is uncommon, but must work correctly.
4507 :
4508 : Therefore, we save any area of the stack that was already written
4509 : and that we are using. Here we set up to do this by making a new
4510 : stack usage map from the old one.
4511 :
4512 : Another approach might be to try to reorder the argument
4513 : evaluations to avoid this conflicting stack usage. */
4514 :
4515 12 : needed = args_size.constant;
4516 :
4517 : /* Since we will be writing into the entire argument area, the
4518 : map must be allocated for its entire size, not just the part that
4519 : is the responsibility of the caller. */
4520 12 : if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl))))
4521 12 : needed += reg_parm_stack_space;
4522 :
4523 12 : poly_int64 limit = needed;
4524 12 : if (ARGS_GROW_DOWNWARD)
4525 : limit += 1;
4526 :
4527 : /* For polynomial sizes, this is the maximum possible size needed
4528 : for arguments with a constant size and offset. */
4529 12 : HOST_WIDE_INT const_limit = constant_lower_bound (limit);
4530 12 : highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
4531 : const_limit);
4532 :
4533 12 : stack_usage_map_buf = XNEWVEC (char, highest_outgoing_arg_in_use);
4534 12 : stack_usage_map = stack_usage_map_buf;
4535 :
4536 12 : if (initial_highest_arg_in_use)
4537 0 : memcpy (stack_usage_map, initial_stack_usage_map,
4538 : initial_highest_arg_in_use);
4539 :
4540 12 : if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
4541 0 : memset (&stack_usage_map[initial_highest_arg_in_use], 0,
4542 0 : highest_outgoing_arg_in_use - initial_highest_arg_in_use);
4543 12 : needed = 0;
4544 :
4545 : /* We must be careful to use virtual regs before they're instantiated,
4546 : and real regs afterwards. Loop optimization, for example, can create
4547 : new libcalls after we've instantiated the virtual regs, and if we
4548 : use virtuals anyway, they won't match the rtl patterns. */
4549 :
4550 12 : if (virtuals_instantiated)
4551 0 : argblock = plus_constant (Pmode, stack_pointer_rtx,
4552 : STACK_POINTER_OFFSET);
4553 : else
4554 12 : argblock = virtual_outgoing_args_rtx;
4555 : }
4556 : else
4557 : {
4558 117384 : if (!targetm.calls.push_argument (0))
4559 0 : argblock = push_block (gen_int_mode (args_size.constant, Pmode), 0, 0);
4560 : }
4561 :
4562 : /* We push args individually in reverse order, perform stack alignment
4563 : before the first push (the last arg). */
4564 12 : if (argblock == 0)
4565 117384 : anti_adjust_stack (gen_int_mode (args_size.constant
4566 : - original_args_size.constant,
4567 117384 : Pmode));
4568 :
4569 117396 : argnum = nargs - 1;
4570 :
4571 : #ifdef REG_PARM_STACK_SPACE
4572 117396 : if (ACCUMULATE_OUTGOING_ARGS)
4573 : {
4574 : /* The argument list is the property of the called routine and it
4575 : may clobber it. If the fixed area has been used for previous
4576 : parameters, we must save and restore it. */
4577 12 : save_area = save_fixed_argument_area (reg_parm_stack_space, argblock,
4578 : &low_to_save, &high_to_save);
4579 : }
4580 : #endif
4581 :
4582 117396 : rtx call_cookie
4583 117396 : = targetm.calls.function_arg (args_so_far,
4584 117396 : function_arg_info::end_marker ());
4585 :
4586 : /* Push the args that need to be pushed. */
4587 :
4588 117396 : have_push_fusage = false;
4589 :
4590 : /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4591 : are to be pushed. */
4592 331977 : for (count = 0; count < nargs; count++, argnum--)
4593 : {
4594 214581 : machine_mode mode = argvec[argnum].mode;
4595 214581 : rtx val = argvec[argnum].value;
4596 214581 : rtx reg = argvec[argnum].reg;
4597 214581 : int partial = argvec[argnum].partial;
4598 214581 : unsigned int parm_align = argvec[argnum].locate.boundary;
4599 214581 : poly_int64 lower_bound = 0, upper_bound = 0;
4600 :
4601 214581 : if (! (reg != 0 && partial == 0))
4602 : {
4603 37841 : rtx use;
4604 :
4605 37841 : if (ACCUMULATE_OUTGOING_ARGS)
4606 : {
4607 : /* If this is being stored into a pre-allocated, fixed-size,
4608 : stack area, save any previous data at that location. */
4609 :
4610 0 : if (ARGS_GROW_DOWNWARD)
4611 : {
4612 : /* stack_slot is negative, but we want to index stack_usage_map
4613 : with positive values. */
4614 : upper_bound = -argvec[argnum].locate.slot_offset.constant + 1;
4615 : lower_bound = upper_bound - argvec[argnum].locate.size.constant;
4616 : }
4617 : else
4618 : {
4619 0 : lower_bound = argvec[argnum].locate.slot_offset.constant;
4620 0 : upper_bound = lower_bound + argvec[argnum].locate.size.constant;
4621 : }
4622 :
4623 0 : if (stack_region_maybe_used_p (lower_bound, upper_bound,
4624 : reg_parm_stack_space))
4625 : {
4626 : /* We need to make a save area. */
4627 0 : poly_uint64 size
4628 0 : = argvec[argnum].locate.size.constant * BITS_PER_UNIT;
4629 0 : machine_mode save_mode
4630 0 : = int_mode_for_size (size, 1).else_blk ();
4631 0 : rtx adr
4632 0 : = plus_constant (Pmode, argblock,
4633 : argvec[argnum].locate.offset.constant);
4634 0 : rtx stack_area
4635 0 : = gen_rtx_MEM (save_mode, memory_address (save_mode, adr));
4636 :
4637 0 : if (save_mode == BLKmode)
4638 : {
4639 0 : argvec[argnum].save_area
4640 0 : = assign_stack_temp (BLKmode,
4641 : argvec[argnum].locate.size.constant
4642 : );
4643 :
4644 0 : emit_block_move (validize_mem
4645 : (copy_rtx (argvec[argnum].save_area)),
4646 : stack_area,
4647 : (gen_int_mode
4648 : (argvec[argnum].locate.size.constant,
4649 0 : Pmode)),
4650 : BLOCK_OP_CALL_PARM);
4651 : }
4652 : else
4653 : {
4654 0 : argvec[argnum].save_area = gen_reg_rtx (save_mode);
4655 :
4656 0 : emit_move_insn (argvec[argnum].save_area, stack_area);
4657 : }
4658 : }
4659 : }
4660 :
4661 37841 : emit_push_insn (val, mode, lang_hooks.types.type_for_mode (mode, 0),
4662 : NULL_RTX, parm_align, partial, reg, 0, argblock,
4663 : (gen_int_mode
4664 37841 : (argvec[argnum].locate.offset.constant, Pmode)),
4665 : reg_parm_stack_space,
4666 73852 : ARGS_SIZE_RTX (argvec[argnum].locate.alignment_pad), false);
4667 :
4668 : /* Now mark the segment we just used. */
4669 37841 : if (ACCUMULATE_OUTGOING_ARGS)
4670 0 : mark_stack_region_used (lower_bound, upper_bound);
4671 :
4672 37841 : NO_DEFER_POP;
4673 :
4674 : /* Indicate argument access so that alias.cc knows that these
4675 : values are live. */
4676 37841 : if (argblock)
4677 0 : use = plus_constant (Pmode, argblock,
4678 : argvec[argnum].locate.offset.constant);
4679 37841 : else if (have_push_fusage)
4680 23001 : continue;
4681 : else
4682 : {
4683 : /* When arguments are pushed, trying to tell alias.cc where
4684 : exactly this argument is won't work, because the
4685 : auto-increment causes confusion. So we merely indicate
4686 : that we access something with a known mode somewhere on
4687 : the stack. */
4688 41160 : use = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
4689 : gen_rtx_SCRATCH (Pmode));
4690 14840 : have_push_fusage = true;
4691 : }
4692 14840 : use = gen_rtx_MEM (argvec[argnum].mode, use);
4693 14840 : use = gen_rtx_USE (VOIDmode, use);
4694 14840 : call_fusage = gen_rtx_EXPR_LIST (VOIDmode, use, call_fusage);
4695 : }
4696 : }
4697 :
4698 117396 : argnum = nargs - 1;
4699 :
4700 117396 : fun = prepare_call_address (NULL, fun, NULL, &call_fusage, 0, 0);
4701 :
4702 117396 : targetm.calls.start_call_args (args_so_far);
4703 :
4704 : /* When expanding a normal call, args are stored in push order,
4705 : which is the reverse of what we have here. */
4706 117396 : bool any_regs = false;
4707 331977 : for (int i = nargs; i-- > 0; )
4708 214581 : if (argvec[i].reg != NULL_RTX)
4709 : {
4710 176740 : targetm.calls.call_args (args_so_far, argvec[i].reg, NULL_TREE);
4711 176740 : any_regs = true;
4712 : }
4713 117396 : if (!any_regs)
4714 14687 : targetm.calls.call_args (args_so_far, pc_rtx, NULL_TREE);
4715 :
4716 : /* Now load any reg parms into their regs. */
4717 :
4718 : /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4719 : are to be pushed. */
4720 331977 : for (count = 0; count < nargs; count++, argnum--)
4721 : {
4722 214581 : machine_mode mode = argvec[argnum].mode;
4723 214581 : rtx val = argvec[argnum].value;
4724 214581 : rtx reg = argvec[argnum].reg;
4725 214581 : int partial = argvec[argnum].partial;
4726 :
4727 : /* Handle calls that pass values in multiple non-contiguous
4728 : locations. The PA64 has examples of this for library calls. */
4729 214581 : if (reg != 0 && GET_CODE (reg) == PARALLEL)
4730 13916 : emit_group_load (reg, val, NULL_TREE, GET_MODE_SIZE (mode));
4731 207623 : else if (reg != 0 && partial == 0)
4732 : {
4733 169782 : emit_move_insn (reg, val);
4734 : #ifdef BLOCK_REG_PADDING
4735 : poly_int64 size = GET_MODE_SIZE (argvec[argnum].mode);
4736 :
4737 : /* Copied from load_register_parameters. */
4738 :
4739 : /* Handle case where we have a value that needs shifting
4740 : up to the msb. eg. a QImode value and we're padding
4741 : upward on a BYTES_BIG_ENDIAN machine. */
4742 : if (known_lt (size, UNITS_PER_WORD)
4743 : && (argvec[argnum].locate.where_pad
4744 : == (BYTES_BIG_ENDIAN ? PAD_UPWARD : PAD_DOWNWARD)))
4745 : {
4746 : rtx x;
4747 : poly_int64 shift = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
4748 :
4749 : /* Assigning REG here rather than a temp makes CALL_FUSAGE
4750 : report the whole reg as used. Strictly speaking, the
4751 : call only uses SIZE bytes at the msb end, but it doesn't
4752 : seem worth generating rtl to say that. */
4753 : reg = gen_rtx_REG (word_mode, REGNO (reg));
4754 : x = expand_shift (LSHIFT_EXPR, word_mode, reg, shift, reg, 1);
4755 : if (x != reg)
4756 : emit_move_insn (reg, x);
4757 : }
4758 : #endif
4759 : }
4760 :
4761 214581 : NO_DEFER_POP;
4762 : }
4763 :
4764 : /* Any regs containing parms remain in use through the call. */
4765 331977 : for (count = 0; count < nargs; count++)
4766 : {
4767 214581 : rtx reg = argvec[count].reg;
4768 214581 : if (reg != 0 && GET_CODE (reg) == PARALLEL)
4769 6958 : use_group_regs (&call_fusage, reg);
4770 169782 : else if (reg != 0)
4771 : {
4772 169782 : int partial = argvec[count].partial;
4773 169782 : if (partial)
4774 : {
4775 0 : int nregs;
4776 0 : gcc_assert (partial % UNITS_PER_WORD == 0);
4777 0 : nregs = partial / UNITS_PER_WORD;
4778 0 : use_regs (&call_fusage, REGNO (reg), nregs);
4779 : }
4780 : else
4781 169782 : use_reg (&call_fusage, reg);
4782 : }
4783 : }
4784 :
4785 : /* Pass the function the address in which to return a structure value. */
4786 117396 : if (mem_value != 0 && struct_value != 0 && ! pcc_struct_value)
4787 : {
4788 0 : emit_move_insn (struct_value,
4789 0 : force_reg (Pmode,
4790 : force_operand (XEXP (mem_value, 0),
4791 : NULL_RTX)));
4792 0 : if (REG_P (struct_value))
4793 0 : use_reg (&call_fusage, struct_value);
4794 : }
4795 :
4796 : /* Don't allow popping to be deferred, since then
4797 : cse'ing of library calls could delete a call and leave the pop. */
4798 117396 : NO_DEFER_POP;
4799 212576 : valreg = (mem_value == 0 && outmode != VOIDmode
4800 222671 : ? hard_libcall_value (outmode, orgfun) : NULL_RTX);
4801 :
4802 : /* Stack must be properly aligned now. */
4803 234792 : gcc_assert (multiple_p (stack_pointer_delta,
4804 : PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT));
4805 :
4806 117396 : before_call = get_last_insn ();
4807 :
4808 117396 : if (flag_callgraph_info)
4809 0 : record_final_call (SYMBOL_REF_DECL (orgfun), UNKNOWN_LOCATION);
4810 :
4811 : /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4812 : will set inhibit_defer_pop to that value. */
4813 : /* The return type is needed to decide how many bytes the function pops.
4814 : Signedness plays no role in that, so for simplicity, we pretend it's
4815 : always signed. We also assume that the list of arguments passed has
4816 : no impact, so we pretend it is unknown. */
4817 :
4818 117396 : emit_call_1 (fun, NULL,
4819 : get_identifier (XSTR (orgfun, 0)),
4820 : build_function_type (tfom, NULL_TREE),
4821 : original_args_size.constant, args_size.constant,
4822 : struct_value_size, call_cookie, valreg,
4823 : old_inhibit_defer_pop + 1, call_fusage, flags, args_so_far);
4824 :
4825 117396 : rtx datum = orgfun;
4826 117396 : gcc_assert (GET_CODE (datum) == SYMBOL_REF);
4827 117396 : rtx_call_insn *last = last_call_insn ();
4828 117396 : add_reg_note (last, REG_CALL_DECL, datum);
4829 :
4830 : /* Right-shift returned value if necessary. */
4831 117396 : if (!pcc_struct_value
4832 117396 : && TYPE_MODE (tfom) != BLKmode
4833 117396 : && targetm.calls.return_in_msb (tfom))
4834 : {
4835 0 : shift_return_value (TYPE_MODE (tfom), false, valreg);
4836 0 : valreg = gen_rtx_REG (TYPE_MODE (tfom), REGNO (valreg));
4837 : }
4838 :
4839 117396 : targetm.calls.end_call_args (args_so_far);
4840 :
4841 : /* For calls to `setjmp', etc., inform function.cc:setjmp_warnings
4842 : that it should complain if nonvolatile values are live. For
4843 : functions that cannot return, inform flow that control does not
4844 : fall through. */
4845 117396 : if (flags & ECF_NORETURN)
4846 : {
4847 : /* The barrier note must be emitted
4848 : immediately after the CALL_INSN. Some ports emit more than
4849 : just a CALL_INSN above, so we must search for it here. */
4850 0 : rtx_insn *last = get_last_insn ();
4851 0 : while (!CALL_P (last))
4852 : {
4853 0 : last = PREV_INSN (last);
4854 : /* There was no CALL_INSN? */
4855 0 : gcc_assert (last != before_call);
4856 : }
4857 :
4858 0 : emit_barrier_after (last);
4859 : }
4860 :
4861 : /* Consider that "regular" libcalls, i.e. all of them except for LCT_THROW
4862 : and LCT_RETURNS_TWICE, cannot perform non-local gotos. */
4863 117396 : if (flags & ECF_NOTHROW)
4864 : {
4865 117396 : rtx_insn *last = get_last_insn ();
4866 132237 : while (!CALL_P (last))
4867 : {
4868 14841 : last = PREV_INSN (last);
4869 : /* There was no CALL_INSN? */
4870 14841 : gcc_assert (last != before_call);
4871 : }
4872 :
4873 117396 : make_reg_eh_region_note_nothrow_nononlocal (last);
4874 : }
4875 :
4876 : /* Now restore inhibit_defer_pop to its actual original value. */
4877 117396 : OK_DEFER_POP;
4878 :
4879 117396 : pop_temp_slots ();
4880 :
4881 : /* Copy the value to the right place. */
4882 117396 : if (outmode != VOIDmode && retval)
4883 : {
4884 115086 : if (mem_value)
4885 : {
4886 10095 : if (value == 0)
4887 10095 : value = mem_value;
4888 10095 : if (value != mem_value)
4889 0 : emit_move_insn (value, mem_value);
4890 : }
4891 104991 : else if (GET_CODE (valreg) == PARALLEL)
4892 : {
4893 0 : if (value == 0)
4894 0 : value = gen_reg_rtx (outmode);
4895 0 : emit_group_store (value, valreg, NULL_TREE, GET_MODE_SIZE (outmode));
4896 : }
4897 : else
4898 : {
4899 : /* Convert to the proper mode if a promotion has been active. */
4900 104991 : if (GET_MODE (valreg) != outmode)
4901 : {
4902 0 : int unsignedp = TYPE_UNSIGNED (tfom);
4903 :
4904 0 : gcc_assert (promote_function_mode (tfom, outmode, &unsignedp,
4905 : fndecl ? TREE_TYPE (fndecl) : fntype, 1)
4906 : == GET_MODE (valreg));
4907 0 : valreg = convert_modes (outmode, GET_MODE (valreg), valreg, 0);
4908 : }
4909 :
4910 104991 : if (value != 0)
4911 440 : emit_move_insn (value, valreg);
4912 : else
4913 : value = valreg;
4914 : }
4915 : }
4916 :
4917 117396 : if (ACCUMULATE_OUTGOING_ARGS)
4918 : {
4919 : #ifdef REG_PARM_STACK_SPACE
4920 12 : if (save_area)
4921 0 : restore_fixed_argument_area (save_area, argblock,
4922 : high_to_save, low_to_save);
4923 : #endif
4924 :
4925 : /* If we saved any argument areas, restore them. */
4926 24 : for (count = 0; count < nargs; count++)
4927 12 : if (argvec[count].save_area)
4928 : {
4929 0 : machine_mode save_mode = GET_MODE (argvec[count].save_area);
4930 0 : rtx adr = plus_constant (Pmode, argblock,
4931 : argvec[count].locate.offset.constant);
4932 0 : rtx stack_area = gen_rtx_MEM (save_mode,
4933 : memory_address (save_mode, adr));
4934 :
4935 0 : if (save_mode == BLKmode)
4936 0 : emit_block_move (stack_area,
4937 : validize_mem
4938 : (copy_rtx (argvec[count].save_area)),
4939 : (gen_int_mode
4940 0 : (argvec[count].locate.size.constant, Pmode)),
4941 : BLOCK_OP_CALL_PARM);
4942 : else
4943 0 : emit_move_insn (stack_area, argvec[count].save_area);
4944 : }
4945 :
4946 12 : highest_outgoing_arg_in_use = initial_highest_arg_in_use;
4947 12 : stack_usage_map = initial_stack_usage_map;
4948 12 : stack_usage_watermark = initial_stack_usage_watermark;
4949 : }
4950 :
4951 117396 : free (stack_usage_map_buf);
4952 :
4953 117396 : return value;
4954 :
4955 : }
4956 :
4957 :
4958 : /* Store a single argument for a function call
4959 : into the register or memory area where it must be passed.
4960 : *ARG describes the argument value and where to pass it.
4961 :
4962 : ARGBLOCK is the address of the stack-block for all the arguments,
4963 : or 0 on a machine where arguments are pushed individually.
4964 :
4965 : MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
4966 : so must be careful about how the stack is used.
4967 :
4968 : VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
4969 : argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
4970 : that we need not worry about saving and restoring the stack.
4971 :
4972 : FNDECL is the declaration of the function we are calling.
4973 :
4974 : Return true if this arg should cause sibcall failure,
4975 : false otherwise. */
4976 :
4977 : static bool
4978 2141685 : store_one_arg (struct arg_data *arg, rtx argblock, int flags,
4979 : int variable_size ATTRIBUTE_UNUSED, int reg_parm_stack_space)
4980 : {
4981 2141685 : tree pval = arg->tree_value;
4982 2141685 : rtx reg = 0;
4983 2141685 : int partial = 0;
4984 2141685 : poly_int64 used = 0;
4985 2141685 : poly_int64 lower_bound = 0, upper_bound = 0;
4986 2141685 : bool sibcall_failure = false;
4987 :
4988 2141685 : if (TREE_CODE (pval) == ERROR_MARK)
4989 : return true;
4990 :
4991 : /* Push a new temporary level for any temporaries we make for
4992 : this argument. */
4993 2141685 : push_temp_slots ();
4994 :
4995 2141685 : if (ACCUMULATE_OUTGOING_ARGS && !(flags & ECF_SIBCALL))
4996 : {
4997 : /* If this is being stored into a pre-allocated, fixed-size, stack area,
4998 : save any previous data at that location. */
4999 53895 : if (argblock && ! variable_size && arg->stack)
5000 : {
5001 53816 : if (ARGS_GROW_DOWNWARD)
5002 : {
5003 : /* stack_slot is negative, but we want to index stack_usage_map
5004 : with positive values. */
5005 : if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
5006 : {
5007 : rtx offset = XEXP (XEXP (arg->stack_slot, 0), 1);
5008 : upper_bound = -rtx_to_poly_int64 (offset) + 1;
5009 : }
5010 : else
5011 : upper_bound = 0;
5012 :
5013 : lower_bound = upper_bound - arg->locate.size.constant;
5014 : }
5015 : else
5016 : {
5017 53816 : if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
5018 : {
5019 42128 : rtx offset = XEXP (XEXP (arg->stack_slot, 0), 1);
5020 42128 : lower_bound = rtx_to_poly_int64 (offset);
5021 : }
5022 : else
5023 : lower_bound = 0;
5024 :
5025 53816 : upper_bound = lower_bound + arg->locate.size.constant;
5026 : }
5027 :
5028 53816 : if (stack_region_maybe_used_p (lower_bound, upper_bound,
5029 : reg_parm_stack_space))
5030 : {
5031 : /* We need to make a save area. */
5032 0 : poly_uint64 size = arg->locate.size.constant * BITS_PER_UNIT;
5033 0 : machine_mode save_mode
5034 0 : = int_mode_for_size (size, 1).else_blk ();
5035 0 : rtx adr = memory_address (save_mode, XEXP (arg->stack_slot, 0));
5036 0 : rtx stack_area = gen_rtx_MEM (save_mode, adr);
5037 :
5038 0 : if (save_mode == BLKmode)
5039 : {
5040 0 : arg->save_area
5041 0 : = assign_temp (TREE_TYPE (arg->tree_value), 1, 1);
5042 0 : preserve_temp_slots (arg->save_area);
5043 0 : emit_block_move (validize_mem (copy_rtx (arg->save_area)),
5044 : stack_area,
5045 : (gen_int_mode
5046 0 : (arg->locate.size.constant, Pmode)),
5047 : BLOCK_OP_CALL_PARM);
5048 : }
5049 : else
5050 : {
5051 0 : arg->save_area = gen_reg_rtx (save_mode);
5052 0 : emit_move_insn (arg->save_area, stack_area);
5053 : }
5054 : }
5055 : }
5056 : }
5057 :
5058 : /* If this isn't going to be placed on both the stack and in registers,
5059 : set up the register and number of words. */
5060 2141685 : if (! arg->pass_on_stack)
5061 : {
5062 2141685 : if (flags & ECF_SIBCALL)
5063 10471 : reg = arg->tail_call_reg;
5064 : else
5065 2131214 : reg = arg->reg;
5066 2141685 : partial = arg->partial;
5067 : }
5068 :
5069 : /* Being passed entirely in a register. We shouldn't be called in
5070 : this case. */
5071 2141685 : gcc_assert (reg == 0 || partial != 0);
5072 :
5073 : /* If this arg needs special alignment, don't load the registers
5074 : here. */
5075 2141685 : if (arg->n_aligned_regs != 0)
5076 0 : reg = 0;
5077 :
5078 : /* If this is being passed partially in a register, we can't evaluate
5079 : it directly into its stack slot. Otherwise, we can. */
5080 2141685 : if (arg->value == 0)
5081 : {
5082 : /* stack_arg_under_construction is nonzero if a function argument is
5083 : being evaluated directly into the outgoing argument list and
5084 : expand_call must take special action to preserve the argument list
5085 : if it is called recursively.
5086 :
5087 : For scalar function arguments stack_usage_map is sufficient to
5088 : determine which stack slots must be saved and restored. Scalar
5089 : arguments in general have pass_on_stack == false.
5090 :
5091 : If this argument is initialized by a function which takes the
5092 : address of the argument (a C++ constructor or a C function
5093 : returning a BLKmode structure), then stack_usage_map is
5094 : insufficient and expand_call must push the stack around the
5095 : function call. Such arguments have pass_on_stack == true.
5096 :
5097 : Note that it is always safe to set stack_arg_under_construction,
5098 : but this generates suboptimal code if set when not needed. */
5099 :
5100 2141685 : if (arg->pass_on_stack)
5101 0 : stack_arg_under_construction++;
5102 :
5103 4247841 : arg->value = expand_expr (pval,
5104 : (partial
5105 2141685 : || TYPE_MODE (TREE_TYPE (pval)) != arg->mode)
5106 : ? NULL_RTX : arg->stack,
5107 : VOIDmode, EXPAND_STACK_PARM);
5108 :
5109 : /* If we are promoting object (or for any other reason) the mode
5110 : doesn't agree, convert the mode. */
5111 :
5112 2141685 : if (arg->mode != TYPE_MODE (TREE_TYPE (pval)))
5113 35529 : arg->value = convert_modes (arg->mode, TYPE_MODE (TREE_TYPE (pval)),
5114 : arg->value, arg->unsignedp);
5115 :
5116 2141685 : if (arg->pass_on_stack)
5117 0 : stack_arg_under_construction--;
5118 : }
5119 :
5120 : /* Check for overlap with already clobbered argument area. */
5121 2141685 : if ((flags & ECF_SIBCALL)
5122 10471 : && MEM_P (arg->value)
5123 2152156 : && mem_might_overlap_already_clobbered_arg_p (XEXP (arg->value, 0),
5124 436 : arg->locate.size.constant))
5125 4 : sibcall_failure = true;
5126 :
5127 : /* Don't allow anything left on stack from computation
5128 : of argument to alloca. */
5129 2141685 : if (flags & ECF_MAY_BE_ALLOCA)
5130 0 : do_pending_stack_adjust ();
5131 :
5132 2141685 : if (arg->value == arg->stack)
5133 : /* If the value is already in the stack slot, we are done. */
5134 : ;
5135 2133069 : else if (arg->mode != BLKmode)
5136 : {
5137 1862768 : unsigned int parm_align;
5138 :
5139 : /* Argument is a scalar, not entirely passed in registers.
5140 : (If part is passed in registers, arg->partial says how much
5141 : and emit_push_insn will take care of putting it there.)
5142 :
5143 : Push it, and if its size is less than the
5144 : amount of space allocated to it,
5145 : also bump stack pointer by the additional space.
5146 : Note that in C the default argument promotions
5147 : will prevent such mismatches. */
5148 :
5149 1862768 : poly_int64 size = (TYPE_EMPTY_P (TREE_TYPE (pval))
5150 3725536 : ? 0 : GET_MODE_SIZE (arg->mode));
5151 :
5152 : /* Compute how much space the push instruction will push.
5153 : On many machines, pushing a byte will advance the stack
5154 : pointer by a halfword. */
5155 : #ifdef PUSH_ROUNDING
5156 1862768 : size = PUSH_ROUNDING (size);
5157 : #endif
5158 1862768 : used = size;
5159 :
5160 : /* Compute how much space the argument should get:
5161 : round up to a multiple of the alignment for arguments. */
5162 1862768 : if (targetm.calls.function_arg_padding (arg->mode, TREE_TYPE (pval))
5163 : != PAD_NONE)
5164 : /* At the moment we don't (need to) support ABIs for which the
5165 : padding isn't known at compile time. In principle it should
5166 : be easy to add though. */
5167 3276937 : used = force_align_up (size, PARM_BOUNDARY / BITS_PER_UNIT);
5168 :
5169 : /* Compute the alignment of the pushed argument. */
5170 1862768 : parm_align = arg->locate.boundary;
5171 1862768 : if (targetm.calls.function_arg_padding (arg->mode, TREE_TYPE (pval))
5172 : == PAD_DOWNWARD)
5173 : {
5174 0 : poly_int64 pad = used - size;
5175 0 : unsigned int pad_align = known_alignment (pad) * BITS_PER_UNIT;
5176 0 : if (pad_align != 0)
5177 0 : parm_align = MIN (parm_align, pad_align);
5178 : }
5179 :
5180 : /* This isn't already where we want it on the stack, so put it there.
5181 : This can either be done with push or copy insns. */
5182 1862768 : if (maybe_ne (used, 0)
5183 3717092 : && !emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval),
5184 : NULL_RTX, parm_align, partial, reg, used - size,
5185 3268497 : argblock, ARGS_SIZE_RTX (arg->locate.offset),
5186 : reg_parm_stack_space,
5187 3268497 : ARGS_SIZE_RTX (arg->locate.alignment_pad), true))
5188 : sibcall_failure = true;
5189 :
5190 : /* Unless this is a partially-in-register argument, the argument is now
5191 : in the stack. */
5192 1862768 : if (partial == 0)
5193 1862768 : arg->value = arg->stack;
5194 : }
5195 : else
5196 : {
5197 : /* BLKmode, at least partly to be pushed. */
5198 :
5199 270301 : unsigned int parm_align;
5200 270301 : poly_int64 excess;
5201 270301 : rtx size_rtx;
5202 :
5203 : /* Pushing a nonscalar.
5204 : If part is passed in registers, PARTIAL says how much
5205 : and emit_push_insn will take care of putting it there. */
5206 :
5207 : /* Round its size up to a multiple
5208 : of the allocation unit for arguments. */
5209 :
5210 270301 : if (arg->locate.size.var != 0)
5211 : {
5212 0 : excess = 0;
5213 0 : size_rtx = ARGS_SIZE_RTX (arg->locate.size);
5214 : }
5215 : else
5216 : {
5217 : /* PUSH_ROUNDING has no effect on us, because emit_push_insn
5218 : for BLKmode is careful to avoid it. */
5219 270301 : excess = (arg->locate.size.constant
5220 270301 : - arg_int_size_in_bytes (TREE_TYPE (pval))
5221 270301 : + partial);
5222 270301 : size_rtx = expand_expr (arg_size_in_bytes (TREE_TYPE (pval)),
5223 270301 : NULL_RTX, TYPE_MODE (sizetype),
5224 : EXPAND_NORMAL);
5225 : }
5226 :
5227 270301 : parm_align = arg->locate.boundary;
5228 :
5229 : /* When an argument is padded down, the block is aligned to
5230 : PARM_BOUNDARY, but the actual argument isn't. */
5231 270301 : if (targetm.calls.function_arg_padding (arg->mode, TREE_TYPE (pval))
5232 : == PAD_DOWNWARD)
5233 : {
5234 0 : if (arg->locate.size.var)
5235 : parm_align = BITS_PER_UNIT;
5236 : else
5237 : {
5238 0 : unsigned int excess_align
5239 0 : = known_alignment (excess) * BITS_PER_UNIT;
5240 0 : if (excess_align != 0)
5241 0 : parm_align = MIN (parm_align, excess_align);
5242 : }
5243 : }
5244 :
5245 270301 : if ((flags & ECF_SIBCALL) && MEM_P (arg->value))
5246 : {
5247 : /* emit_push_insn might not work properly if arg->value and
5248 : argblock + arg->locate.offset areas overlap. */
5249 87 : rtx x = arg->value;
5250 87 : poly_int64 i = 0;
5251 :
5252 87 : if (strip_offset (XEXP (x, 0), &i)
5253 87 : == crtl->args.internal_arg_pointer)
5254 : {
5255 : /* arg.locate doesn't contain the pretend_args_size offset,
5256 : it's part of argblock. Ensure we don't count it in I. */
5257 28 : if (STACK_GROWS_DOWNWARD)
5258 28 : i -= crtl->args.pretend_args_size;
5259 : else
5260 : i += crtl->args.pretend_args_size;
5261 :
5262 : /* expand_call should ensure this. */
5263 28 : gcc_assert (!arg->locate.offset.var
5264 : && arg->locate.size.var == 0);
5265 28 : poly_int64 size_val = rtx_to_poly_int64 (size_rtx);
5266 :
5267 28 : if (known_eq (arg->locate.offset.constant, i))
5268 : {
5269 : /* Even though they appear to be at the same location,
5270 : if part of the outgoing argument is in registers,
5271 : they aren't really at the same location. Check for
5272 : this by making sure that the incoming size is the
5273 : same as the outgoing size. */
5274 19 : if (partial != 0)
5275 87 : sibcall_failure = true;
5276 : }
5277 12 : else if (maybe_in_range_p (arg->locate.offset.constant,
5278 : i, size_val))
5279 : sibcall_failure = true;
5280 : /* Use arg->locate.size.constant instead of size_rtx
5281 : because we only care about the part of the argument
5282 : on the stack. */
5283 6 : else if (maybe_in_range_p (i, arg->locate.offset.constant,
5284 9 : arg->locate.size.constant))
5285 87 : sibcall_failure = true;
5286 : }
5287 : }
5288 :
5289 270301 : if (!CONST_INT_P (size_rtx) || INTVAL (size_rtx) != 0)
5290 268233 : emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), size_rtx,
5291 : parm_align, partial, reg, excess, argblock,
5292 333444 : ARGS_SIZE_RTX (arg->locate.offset),
5293 : reg_parm_stack_space,
5294 333444 : ARGS_SIZE_RTX (arg->locate.alignment_pad), false);
5295 : /* If we bypass emit_push_insn because it is a zero sized argument,
5296 : we still might need to adjust stack if such argument requires
5297 : extra alignment. See PR104558. */
5298 2068 : else if ((arg->locate.alignment_pad.var
5299 2068 : || maybe_ne (arg->locate.alignment_pad.constant, 0))
5300 2069 : && !argblock)
5301 1 : anti_adjust_stack (ARGS_SIZE_RTX (arg->locate.alignment_pad));
5302 :
5303 : /* Unless this is a partially-in-register argument, the argument is now
5304 : in the stack.
5305 :
5306 : ??? Unlike the case above, in which we want the actual
5307 : address of the data, so that we can load it directly into a
5308 : register, here we want the address of the stack slot, so that
5309 : it's properly aligned for word-by-word copying or something
5310 : like that. It's not clear that this is always correct. */
5311 270301 : if (partial == 0)
5312 270301 : arg->value = arg->stack_slot;
5313 : }
5314 :
5315 2141685 : if (arg->reg && GET_CODE (arg->reg) == PARALLEL)
5316 : {
5317 0 : tree type = TREE_TYPE (arg->tree_value);
5318 0 : arg->parallel_value
5319 0 : = emit_group_load_into_temps (arg->reg, arg->value, type,
5320 0 : int_size_in_bytes (type));
5321 : }
5322 :
5323 : /* Mark all slots this store used. */
5324 2141685 : if (ACCUMULATE_OUTGOING_ARGS && !(flags & ECF_SIBCALL)
5325 2195580 : && argblock && ! variable_size && arg->stack)
5326 53816 : mark_stack_region_used (lower_bound, upper_bound);
5327 :
5328 : /* Once we have pushed something, pops can't safely
5329 : be deferred during the rest of the arguments. */
5330 2141685 : NO_DEFER_POP;
5331 :
5332 : /* Free any temporary slots made in processing this argument. */
5333 2141685 : pop_temp_slots ();
5334 :
5335 2141685 : return sibcall_failure;
5336 : }
5337 :
5338 : /* Nonzero if we do not know how to pass ARG solely in registers. */
5339 :
5340 : bool
5341 0 : must_pass_in_stack_var_size (const function_arg_info &arg)
5342 : {
5343 0 : if (!arg.type)
5344 : return false;
5345 :
5346 : /* If the type has variable size... */
5347 0 : if (!poly_int_tree_p (TYPE_SIZE (arg.type)))
5348 : return true;
5349 :
5350 : /* If the type is marked as addressable (it is required
5351 : to be constructed into the stack)... */
5352 0 : if (TREE_ADDRESSABLE (arg.type))
5353 0 : return true;
5354 :
5355 : return false;
5356 : }
5357 :
5358 : /* Another version of the TARGET_MUST_PASS_IN_STACK hook. This one
5359 : takes trailing padding of a structure into account. */
5360 : /* ??? Should be able to merge these two by examining BLOCK_REG_PADDING. */
5361 :
5362 : bool
5363 427359253 : must_pass_in_stack_var_size_or_pad (const function_arg_info &arg)
5364 : {
5365 427359253 : if (!arg.type)
5366 : return false;
5367 :
5368 : /* If the type has variable size... */
5369 426517865 : if (TREE_CODE (TYPE_SIZE (arg.type)) != INTEGER_CST)
5370 : return true;
5371 :
5372 : /* If the type is marked as addressable (it is required
5373 : to be constructed into the stack)... */
5374 426517865 : if (TREE_ADDRESSABLE (arg.type))
5375 : return true;
5376 :
5377 426517828 : if (TYPE_EMPTY_P (arg.type))
5378 : return false;
5379 :
5380 : /* If the padding and mode of the type is such that a copy into
5381 : a register would put it into the wrong part of the register. */
5382 424551527 : if (arg.mode == BLKmode
5383 6751466 : && int_size_in_bytes (arg.type) % (PARM_BOUNDARY / BITS_PER_UNIT)
5384 425198470 : && (targetm.calls.function_arg_padding (arg.mode, arg.type)
5385 : == (BYTES_BIG_ENDIAN ? PAD_UPWARD : PAD_DOWNWARD)))
5386 : return true;
5387 :
5388 : return false;
5389 : }
5390 :
5391 : /* Return true if TYPE must be passed on the stack when passed to
5392 : the "..." arguments of a function. */
5393 :
5394 : bool
5395 0 : must_pass_va_arg_in_stack (tree type)
5396 : {
5397 0 : function_arg_info arg (type, /*named=*/false);
5398 0 : return targetm.calls.must_pass_in_stack (arg);
5399 : }
5400 :
5401 : /* Return true if FIELD is the C++17 empty base field that should
5402 : be ignored for ABI calling convention decisions in order to
5403 : maintain ABI compatibility between C++14 and earlier, which doesn't
5404 : add this FIELD to classes with empty bases, and C++17 and later
5405 : which does. */
5406 :
5407 : bool
5408 0 : cxx17_empty_base_field_p (const_tree field)
5409 : {
5410 0 : return (DECL_FIELD_ABI_IGNORED (field)
5411 0 : && DECL_ARTIFICIAL (field)
5412 0 : && RECORD_OR_UNION_TYPE_P (TREE_TYPE (field))
5413 0 : && !lookup_attribute ("no_unique_address", DECL_ATTRIBUTES (field)));
5414 : }
|
