]>
Commit | Line | Data |
---|---|---|
51bbfa0c | 1 | /* Convert function calls to rtl insns, for GNU C compiler. |
a5544970 | 2 | Copyright (C) 1989-2019 Free Software Foundation, Inc. |
51bbfa0c | 3 | |
1322177d | 4 | This file is part of GCC. |
51bbfa0c | 5 | |
1322177d LB |
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 | |
9dcd6f09 | 8 | Software Foundation; either version 3, or (at your option) any later |
1322177d | 9 | version. |
51bbfa0c | 10 | |
1322177d LB |
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. | |
51bbfa0c RS |
15 | |
16 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
51bbfa0c RS |
19 | |
20 | #include "config.h" | |
670ee920 | 21 | #include "system.h" |
4977bab6 | 22 | #include "coretypes.h" |
c7131fb2 | 23 | #include "backend.h" |
957060b5 AM |
24 | #include "target.h" |
25 | #include "rtl.h" | |
c7131fb2 AM |
26 | #include "tree.h" |
27 | #include "gimple.h" | |
957060b5 | 28 | #include "predict.h" |
4d0cdd0c | 29 | #include "memmodel.h" |
957060b5 AM |
30 | #include "tm_p.h" |
31 | #include "stringpool.h" | |
32 | #include "expmed.h" | |
33 | #include "optabs.h" | |
957060b5 AM |
34 | #include "emit-rtl.h" |
35 | #include "cgraph.h" | |
36 | #include "diagnostic-core.h" | |
40e23961 | 37 | #include "fold-const.h" |
d8a2d370 DN |
38 | #include "stor-layout.h" |
39 | #include "varasm.h" | |
2fb9a547 | 40 | #include "internal-fn.h" |
36566b39 PK |
41 | #include "dojump.h" |
42 | #include "explow.h" | |
43 | #include "calls.h" | |
670ee920 | 44 | #include "expr.h" |
d6f4ec51 | 45 | #include "output.h" |
b0c48229 | 46 | #include "langhooks.h" |
b2dd096b | 47 | #include "except.h" |
6fb5fa3c | 48 | #include "dbgcnt.h" |
e9f56944 | 49 | #include "rtl-iter.h" |
8bd9f164 MS |
50 | #include "tree-vrp.h" |
51 | #include "tree-ssanames.h" | |
4252ccd7 | 52 | #include "tree-ssa-strlen.h" |
8bd9f164 | 53 | #include "intl.h" |
314e6352 ML |
54 | #include "stringpool.h" |
55 | #include "attribs.h" | |
cc8bea0a | 56 | #include "builtins.h" |
d677a8b6 | 57 | #include "gimple-fold.h" |
76e048a8 | 58 | |
c795bca9 BS |
59 | /* Like PREFERRED_STACK_BOUNDARY but in units of bytes, not bits. */ |
60 | #define STACK_BYTES (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT) | |
51bbfa0c RS |
61 | |
62 | /* Data structure and subroutines used within expand_call. */ | |
63 | ||
64 | struct arg_data | |
65 | { | |
66 | /* Tree node for this argument. */ | |
67 | tree tree_value; | |
1efe6448 | 68 | /* Mode for value; TYPE_MODE unless promoted. */ |
ef4bddc2 | 69 | machine_mode mode; |
51bbfa0c RS |
70 | /* Current RTL value for argument, or 0 if it isn't precomputed. */ |
71 | rtx value; | |
72 | /* Initially-compute RTL value for argument; only for const functions. */ | |
73 | rtx initial_value; | |
74 | /* Register to pass this argument in, 0 if passed on stack, or an | |
cacbd532 | 75 | PARALLEL if the arg is to be copied into multiple non-contiguous |
51bbfa0c RS |
76 | registers. */ |
77 | rtx reg; | |
099e9712 JH |
78 | /* Register to pass this argument in when generating tail call sequence. |
79 | This is not the same register as for normal calls on machines with | |
80 | register windows. */ | |
81 | rtx tail_call_reg; | |
8df3dbb7 RH |
82 | /* If REG is a PARALLEL, this is a copy of VALUE pulled into the correct |
83 | form for emit_group_move. */ | |
84 | rtx parallel_value; | |
84b55618 RK |
85 | /* If REG was promoted from the actual mode of the argument expression, |
86 | indicates whether the promotion is sign- or zero-extended. */ | |
87 | int unsignedp; | |
f0078f86 AM |
88 | /* Number of bytes to put in registers. 0 means put the whole arg |
89 | in registers. Also 0 if not passed in registers. */ | |
51bbfa0c | 90 | int partial; |
da7d8304 | 91 | /* Nonzero if argument must be passed on stack. |
d64f5a78 RS |
92 | Note that some arguments may be passed on the stack |
93 | even though pass_on_stack is zero, just because FUNCTION_ARG says so. | |
94 | pass_on_stack identifies arguments that *cannot* go in registers. */ | |
51bbfa0c | 95 | int pass_on_stack; |
e7949876 AM |
96 | /* Some fields packaged up for locate_and_pad_parm. */ |
97 | struct locate_and_pad_arg_data locate; | |
51bbfa0c RS |
98 | /* Location on the stack at which parameter should be stored. The store |
99 | has already been done if STACK == VALUE. */ | |
100 | rtx stack; | |
101 | /* Location on the stack of the start of this argument slot. This can | |
102 | differ from STACK if this arg pads downward. This location is known | |
c2ed6cf8 | 103 | to be aligned to TARGET_FUNCTION_ARG_BOUNDARY. */ |
51bbfa0c | 104 | rtx stack_slot; |
51bbfa0c RS |
105 | /* Place that this stack area has been saved, if needed. */ |
106 | rtx save_area; | |
4ab56118 RK |
107 | /* If an argument's alignment does not permit direct copying into registers, |
108 | copy in smaller-sized pieces into pseudos. These are stored in a | |
109 | block pointed to by this field. The next field says how many | |
110 | word-sized pseudos we made. */ | |
111 | rtx *aligned_regs; | |
112 | int n_aligned_regs; | |
51bbfa0c RS |
113 | }; |
114 | ||
da7d8304 | 115 | /* A vector of one char per byte of stack space. A byte if nonzero if |
51bbfa0c RS |
116 | the corresponding stack location has been used. |
117 | This vector is used to prevent a function call within an argument from | |
118 | clobbering any stack already set up. */ | |
119 | static char *stack_usage_map; | |
120 | ||
121 | /* Size of STACK_USAGE_MAP. */ | |
a20c5714 RS |
122 | static unsigned int highest_outgoing_arg_in_use; |
123 | ||
124 | /* Assume that any stack location at this byte index is used, | |
125 | without checking the contents of stack_usage_map. */ | |
126 | static unsigned HOST_WIDE_INT stack_usage_watermark = HOST_WIDE_INT_M1U; | |
2f4aa534 | 127 | |
c67846f2 JJ |
128 | /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding |
129 | stack location's tail call argument has been already stored into the stack. | |
130 | This bitmap is used to prevent sibling call optimization if function tries | |
131 | to use parent's incoming argument slots when they have been already | |
132 | overwritten with tail call arguments. */ | |
133 | static sbitmap stored_args_map; | |
134 | ||
a20c5714 RS |
135 | /* Assume that any virtual-incoming location at this byte index has been |
136 | stored, without checking the contents of stored_args_map. */ | |
137 | static unsigned HOST_WIDE_INT stored_args_watermark; | |
138 | ||
2f4aa534 RS |
139 | /* stack_arg_under_construction is nonzero when an argument may be |
140 | initialized with a constructor call (including a C function that | |
141 | returns a BLKmode struct) and expand_call must take special action | |
142 | to make sure the object being constructed does not overlap the | |
143 | argument list for the constructor call. */ | |
0405cc0e | 144 | static int stack_arg_under_construction; |
51bbfa0c | 145 | |
d329e058 AJ |
146 | static void precompute_register_parameters (int, struct arg_data *, int *); |
147 | static int store_one_arg (struct arg_data *, rtx, int, int, int); | |
148 | static void store_unaligned_arguments_into_pseudos (struct arg_data *, int); | |
149 | static int finalize_must_preallocate (int, int, struct arg_data *, | |
150 | struct args_size *); | |
84b8030f | 151 | static void precompute_arguments (int, struct arg_data *); |
d329e058 AJ |
152 | static void compute_argument_addresses (struct arg_data *, rtx, int); |
153 | static rtx rtx_for_function_call (tree, tree); | |
154 | static void load_register_parameters (struct arg_data *, int, rtx *, int, | |
155 | int, int *); | |
6ea2b70d | 156 | static int special_function_p (const_tree, int); |
d329e058 | 157 | static int check_sibcall_argument_overlap_1 (rtx); |
48810515 | 158 | static int check_sibcall_argument_overlap (rtx_insn *, struct arg_data *, int); |
d329e058 | 159 | |
2f2b4a02 | 160 | static tree split_complex_types (tree); |
21a3b983 | 161 | |
f73ad30e | 162 | #ifdef REG_PARM_STACK_SPACE |
d329e058 AJ |
163 | static rtx save_fixed_argument_area (int, rtx, int *, int *); |
164 | static void restore_fixed_argument_area (rtx, rtx, int, int); | |
20efdf74 | 165 | #endif |
51bbfa0c | 166 | \f |
a20c5714 RS |
167 | /* Return true if bytes [LOWER_BOUND, UPPER_BOUND) of the outgoing |
168 | stack region might already be in use. */ | |
169 | ||
170 | static bool | |
171 | stack_region_maybe_used_p (poly_uint64 lower_bound, poly_uint64 upper_bound, | |
172 | unsigned int reg_parm_stack_space) | |
173 | { | |
174 | unsigned HOST_WIDE_INT const_lower, const_upper; | |
175 | const_lower = constant_lower_bound (lower_bound); | |
176 | if (!upper_bound.is_constant (&const_upper)) | |
177 | const_upper = HOST_WIDE_INT_M1U; | |
178 | ||
179 | if (const_upper > stack_usage_watermark) | |
180 | return true; | |
181 | ||
182 | /* Don't worry about things in the fixed argument area; | |
183 | it has already been saved. */ | |
184 | const_lower = MAX (const_lower, reg_parm_stack_space); | |
185 | const_upper = MIN (const_upper, highest_outgoing_arg_in_use); | |
186 | for (unsigned HOST_WIDE_INT i = const_lower; i < const_upper; ++i) | |
187 | if (stack_usage_map[i]) | |
188 | return true; | |
189 | return false; | |
190 | } | |
191 | ||
192 | /* Record that bytes [LOWER_BOUND, UPPER_BOUND) of the outgoing | |
193 | stack region are now in use. */ | |
194 | ||
195 | static void | |
196 | mark_stack_region_used (poly_uint64 lower_bound, poly_uint64 upper_bound) | |
197 | { | |
198 | unsigned HOST_WIDE_INT const_lower, const_upper; | |
199 | const_lower = constant_lower_bound (lower_bound); | |
200 | if (upper_bound.is_constant (&const_upper)) | |
201 | for (unsigned HOST_WIDE_INT i = const_lower; i < const_upper; ++i) | |
202 | stack_usage_map[i] = 1; | |
203 | else | |
204 | stack_usage_watermark = MIN (stack_usage_watermark, const_lower); | |
205 | } | |
206 | ||
51bbfa0c RS |
207 | /* Force FUNEXP into a form suitable for the address of a CALL, |
208 | and return that as an rtx. Also load the static chain register | |
209 | if FNDECL is a nested function. | |
210 | ||
77cac2f2 RK |
211 | CALL_FUSAGE points to a variable holding the prospective |
212 | CALL_INSN_FUNCTION_USAGE information. */ | |
51bbfa0c | 213 | |
03dacb02 | 214 | rtx |
f2d3d07e | 215 | prepare_call_address (tree fndecl_or_type, rtx funexp, rtx static_chain_value, |
4c640e26 | 216 | rtx *call_fusage, int reg_parm_seen, int flags) |
51bbfa0c | 217 | { |
ba228239 | 218 | /* Make a valid memory address and copy constants through pseudo-regs, |
51bbfa0c RS |
219 | but not for a constant address if -fno-function-cse. */ |
220 | if (GET_CODE (funexp) != SYMBOL_REF) | |
4c640e26 EB |
221 | { |
222 | /* If it's an indirect call by descriptor, generate code to perform | |
223 | runtime identification of the pointer and load the descriptor. */ | |
224 | if ((flags & ECF_BY_DESCRIPTOR) && !flag_trampolines) | |
225 | { | |
226 | const int bit_val = targetm.calls.custom_function_descriptors; | |
227 | rtx call_lab = gen_label_rtx (); | |
228 | ||
229 | gcc_assert (fndecl_or_type && TYPE_P (fndecl_or_type)); | |
230 | fndecl_or_type | |
231 | = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, NULL_TREE, | |
232 | fndecl_or_type); | |
233 | DECL_STATIC_CHAIN (fndecl_or_type) = 1; | |
234 | rtx chain = targetm.calls.static_chain (fndecl_or_type, false); | |
235 | ||
84355514 AS |
236 | if (GET_MODE (funexp) != Pmode) |
237 | funexp = convert_memory_address (Pmode, funexp); | |
238 | ||
4c640e26 EB |
239 | /* Avoid long live ranges around function calls. */ |
240 | funexp = copy_to_mode_reg (Pmode, funexp); | |
241 | ||
242 | if (REG_P (chain)) | |
243 | emit_insn (gen_rtx_CLOBBER (VOIDmode, chain)); | |
244 | ||
245 | /* Emit the runtime identification pattern. */ | |
246 | rtx mask = gen_rtx_AND (Pmode, funexp, GEN_INT (bit_val)); | |
247 | emit_cmp_and_jump_insns (mask, const0_rtx, EQ, NULL_RTX, Pmode, 1, | |
248 | call_lab); | |
249 | ||
250 | /* Statically predict the branch to very likely taken. */ | |
251 | rtx_insn *insn = get_last_insn (); | |
252 | if (JUMP_P (insn)) | |
253 | predict_insn_def (insn, PRED_BUILTIN_EXPECT, TAKEN); | |
254 | ||
255 | /* Load the descriptor. */ | |
256 | rtx mem = gen_rtx_MEM (ptr_mode, | |
257 | plus_constant (Pmode, funexp, - bit_val)); | |
258 | MEM_NOTRAP_P (mem) = 1; | |
259 | mem = convert_memory_address (Pmode, mem); | |
260 | emit_move_insn (chain, mem); | |
261 | ||
262 | mem = gen_rtx_MEM (ptr_mode, | |
263 | plus_constant (Pmode, funexp, | |
264 | POINTER_SIZE / BITS_PER_UNIT | |
265 | - bit_val)); | |
266 | MEM_NOTRAP_P (mem) = 1; | |
267 | mem = convert_memory_address (Pmode, mem); | |
268 | emit_move_insn (funexp, mem); | |
269 | ||
270 | emit_label (call_lab); | |
271 | ||
272 | if (REG_P (chain)) | |
273 | { | |
274 | use_reg (call_fusage, chain); | |
275 | STATIC_CHAIN_REG_P (chain) = 1; | |
276 | } | |
277 | ||
278 | /* Make sure we're not going to be overwritten below. */ | |
279 | gcc_assert (!static_chain_value); | |
280 | } | |
281 | ||
282 | /* If we are using registers for parameters, force the | |
283 | function address into a register now. */ | |
284 | funexp = ((reg_parm_seen | |
285 | && targetm.small_register_classes_for_mode_p (FUNCTION_MODE)) | |
286 | ? force_not_mem (memory_address (FUNCTION_MODE, funexp)) | |
287 | : memory_address (FUNCTION_MODE, funexp)); | |
288 | } | |
408702b4 | 289 | else |
51bbfa0c | 290 | { |
408702b4 RL |
291 | /* funexp could be a SYMBOL_REF represents a function pointer which is |
292 | of ptr_mode. In this case, it should be converted into address mode | |
293 | to be a valid address for memory rtx pattern. See PR 64971. */ | |
294 | if (GET_MODE (funexp) != Pmode) | |
295 | funexp = convert_memory_address (Pmode, funexp); | |
296 | ||
4c640e26 | 297 | if (!(flags & ECF_SIBCALL)) |
408702b4 RL |
298 | { |
299 | if (!NO_FUNCTION_CSE && optimize && ! flag_no_function_cse) | |
300 | funexp = force_reg (Pmode, funexp); | |
301 | } | |
51bbfa0c RS |
302 | } |
303 | ||
f2d3d07e RH |
304 | if (static_chain_value != 0 |
305 | && (TREE_CODE (fndecl_or_type) != FUNCTION_DECL | |
306 | || DECL_STATIC_CHAIN (fndecl_or_type))) | |
51bbfa0c | 307 | { |
531ca746 RH |
308 | rtx chain; |
309 | ||
f2d3d07e | 310 | chain = targetm.calls.static_chain (fndecl_or_type, false); |
5e89a381 | 311 | static_chain_value = convert_memory_address (Pmode, static_chain_value); |
51bbfa0c | 312 | |
531ca746 RH |
313 | emit_move_insn (chain, static_chain_value); |
314 | if (REG_P (chain)) | |
4c640e26 EB |
315 | { |
316 | use_reg (call_fusage, chain); | |
317 | STATIC_CHAIN_REG_P (chain) = 1; | |
318 | } | |
51bbfa0c RS |
319 | } |
320 | ||
321 | return funexp; | |
322 | } | |
323 | ||
324 | /* Generate instructions to call function FUNEXP, | |
325 | and optionally pop the results. | |
326 | The CALL_INSN is the first insn generated. | |
327 | ||
607ea900 | 328 | FNDECL is the declaration node of the function. This is given to the |
079e7538 NF |
329 | hook TARGET_RETURN_POPS_ARGS to determine whether this function pops |
330 | its own args. | |
2c8da025 | 331 | |
079e7538 NF |
332 | FUNTYPE is the data type of the function. This is given to the hook |
333 | TARGET_RETURN_POPS_ARGS to determine whether this function pops its | |
334 | own args. We used to allow an identifier for library functions, but | |
335 | that doesn't work when the return type is an aggregate type and the | |
336 | calling convention says that the pointer to this aggregate is to be | |
337 | popped by the callee. | |
51bbfa0c RS |
338 | |
339 | STACK_SIZE is the number of bytes of arguments on the stack, | |
c2732da3 JM |
340 | ROUNDED_STACK_SIZE is that number rounded up to |
341 | PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is | |
342 | both to put into the call insn and to generate explicit popping | |
343 | code if necessary. | |
51bbfa0c RS |
344 | |
345 | STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value. | |
346 | It is zero if this call doesn't want a structure value. | |
347 | ||
348 | NEXT_ARG_REG is the rtx that results from executing | |
3c07301f | 349 | targetm.calls.function_arg (&args_so_far, VOIDmode, void_type_node, true) |
51bbfa0c RS |
350 | just after all the args have had their registers assigned. |
351 | This could be whatever you like, but normally it is the first | |
352 | arg-register beyond those used for args in this call, | |
353 | or 0 if all the arg-registers are used in this call. | |
354 | It is passed on to `gen_call' so you can put this info in the call insn. | |
355 | ||
356 | VALREG is a hard register in which a value is returned, | |
357 | or 0 if the call does not return a value. | |
358 | ||
359 | OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before | |
360 | the args to this call were processed. | |
361 | We restore `inhibit_defer_pop' to that value. | |
362 | ||
94b25f81 | 363 | CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that |
6d2f8887 | 364 | denote registers used by the called function. */ |
f725a3ec | 365 | |
322e3e34 | 366 | static void |
28ed065e | 367 | emit_call_1 (rtx funexp, tree fntree ATTRIBUTE_UNUSED, tree fndecl ATTRIBUTE_UNUSED, |
6de9cd9a | 368 | tree funtype ATTRIBUTE_UNUSED, |
a20c5714 RS |
369 | poly_int64 stack_size ATTRIBUTE_UNUSED, |
370 | poly_int64 rounded_stack_size, | |
5c8e61cf | 371 | poly_int64 struct_value_size ATTRIBUTE_UNUSED, |
d329e058 AJ |
372 | rtx next_arg_reg ATTRIBUTE_UNUSED, rtx valreg, |
373 | int old_inhibit_defer_pop, rtx call_fusage, int ecf_flags, | |
d5cc9181 | 374 | cumulative_args_t args_so_far ATTRIBUTE_UNUSED) |
51bbfa0c | 375 | { |
a20c5714 | 376 | rtx rounded_stack_size_rtx = gen_int_mode (rounded_stack_size, Pmode); |
58d745ec | 377 | rtx call, funmem, pat; |
51bbfa0c | 378 | int already_popped = 0; |
a20c5714 | 379 | poly_int64 n_popped = 0; |
a00fe3b7 RS |
380 | |
381 | /* Sibling call patterns never pop arguments (no sibcall(_value)_pop | |
382 | patterns exist). Any popping that the callee does on return will | |
383 | be from our caller's frame rather than ours. */ | |
384 | if (!(ecf_flags & ECF_SIBCALL)) | |
385 | { | |
386 | n_popped += targetm.calls.return_pops_args (fndecl, funtype, stack_size); | |
51bbfa0c | 387 | |
fa5322fa | 388 | #ifdef CALL_POPS_ARGS |
a00fe3b7 | 389 | n_popped += CALL_POPS_ARGS (*get_cumulative_args (args_so_far)); |
fa5322fa | 390 | #endif |
a00fe3b7 | 391 | } |
d329e058 | 392 | |
51bbfa0c RS |
393 | /* Ensure address is valid. SYMBOL_REF is already valid, so no need, |
394 | and we don't want to load it into a register as an optimization, | |
395 | because prepare_call_address already did it if it should be done. */ | |
396 | if (GET_CODE (funexp) != SYMBOL_REF) | |
397 | funexp = memory_address (FUNCTION_MODE, funexp); | |
398 | ||
325f5379 JJ |
399 | funmem = gen_rtx_MEM (FUNCTION_MODE, funexp); |
400 | if (fndecl && TREE_CODE (fndecl) == FUNCTION_DECL) | |
047d33a0 AO |
401 | { |
402 | tree t = fndecl; | |
e79983f4 | 403 | |
047d33a0 AO |
404 | /* Although a built-in FUNCTION_DECL and its non-__builtin |
405 | counterpart compare equal and get a shared mem_attrs, they | |
406 | produce different dump output in compare-debug compilations, | |
407 | if an entry gets garbage collected in one compilation, then | |
408 | adds a different (but equivalent) entry, while the other | |
409 | doesn't run the garbage collector at the same spot and then | |
410 | shares the mem_attr with the equivalent entry. */ | |
e79983f4 MM |
411 | if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL) |
412 | { | |
413 | tree t2 = builtin_decl_explicit (DECL_FUNCTION_CODE (t)); | |
414 | if (t2) | |
415 | t = t2; | |
416 | } | |
417 | ||
418 | set_mem_expr (funmem, t); | |
047d33a0 | 419 | } |
325f5379 | 420 | else if (fntree) |
e19f6650 | 421 | set_mem_expr (funmem, build_simple_mem_ref (CALL_EXPR_FN (fntree))); |
325f5379 | 422 | |
58d745ec | 423 | if (ecf_flags & ECF_SIBCALL) |
0a1c58a2 | 424 | { |
0a1c58a2 | 425 | if (valreg) |
58d745ec RS |
426 | pat = targetm.gen_sibcall_value (valreg, funmem, |
427 | rounded_stack_size_rtx, | |
428 | next_arg_reg, NULL_RTX); | |
0a1c58a2 | 429 | else |
58d745ec | 430 | pat = targetm.gen_sibcall (funmem, rounded_stack_size_rtx, |
5c8e61cf RS |
431 | next_arg_reg, |
432 | gen_int_mode (struct_value_size, Pmode)); | |
0a1c58a2 | 433 | } |
8ac61af7 RK |
434 | /* If the target has "call" or "call_value" insns, then prefer them |
435 | if no arguments are actually popped. If the target does not have | |
436 | "call" or "call_value" insns, then we must use the popping versions | |
437 | even if the call has no arguments to pop. */ | |
a20c5714 | 438 | else if (maybe_ne (n_popped, 0) |
58d745ec RS |
439 | || !(valreg |
440 | ? targetm.have_call_value () | |
441 | : targetm.have_call ())) | |
51bbfa0c | 442 | { |
a20c5714 | 443 | rtx n_pop = gen_int_mode (n_popped, Pmode); |
51bbfa0c RS |
444 | |
445 | /* If this subroutine pops its own args, record that in the call insn | |
446 | if possible, for the sake of frame pointer elimination. */ | |
2c8da025 | 447 | |
51bbfa0c | 448 | if (valreg) |
58d745ec RS |
449 | pat = targetm.gen_call_value_pop (valreg, funmem, |
450 | rounded_stack_size_rtx, | |
451 | next_arg_reg, n_pop); | |
51bbfa0c | 452 | else |
58d745ec RS |
453 | pat = targetm.gen_call_pop (funmem, rounded_stack_size_rtx, |
454 | next_arg_reg, n_pop); | |
51bbfa0c | 455 | |
51bbfa0c RS |
456 | already_popped = 1; |
457 | } | |
458 | else | |
0a1c58a2 JL |
459 | { |
460 | if (valreg) | |
58d745ec RS |
461 | pat = targetm.gen_call_value (valreg, funmem, rounded_stack_size_rtx, |
462 | next_arg_reg, NULL_RTX); | |
0a1c58a2 | 463 | else |
58d745ec | 464 | pat = targetm.gen_call (funmem, rounded_stack_size_rtx, next_arg_reg, |
5c8e61cf | 465 | gen_int_mode (struct_value_size, Pmode)); |
0a1c58a2 | 466 | } |
58d745ec | 467 | emit_insn (pat); |
51bbfa0c | 468 | |
ee960939 | 469 | /* Find the call we just emitted. */ |
e67d1102 | 470 | rtx_call_insn *call_insn = last_call_insn (); |
51bbfa0c | 471 | |
325f5379 JJ |
472 | /* Some target create a fresh MEM instead of reusing the one provided |
473 | above. Set its MEM_EXPR. */ | |
da4fdf2d SB |
474 | call = get_call_rtx_from (call_insn); |
475 | if (call | |
325f5379 JJ |
476 | && MEM_EXPR (XEXP (call, 0)) == NULL_TREE |
477 | && MEM_EXPR (funmem) != NULL_TREE) | |
478 | set_mem_expr (XEXP (call, 0), MEM_EXPR (funmem)); | |
479 | ||
ee960939 OH |
480 | /* Put the register usage information there. */ |
481 | add_function_usage_to (call_insn, call_fusage); | |
51bbfa0c RS |
482 | |
483 | /* If this is a const call, then set the insn's unchanging bit. */ | |
becfd6e5 KZ |
484 | if (ecf_flags & ECF_CONST) |
485 | RTL_CONST_CALL_P (call_insn) = 1; | |
486 | ||
487 | /* If this is a pure call, then set the insn's unchanging bit. */ | |
488 | if (ecf_flags & ECF_PURE) | |
489 | RTL_PURE_CALL_P (call_insn) = 1; | |
490 | ||
491 | /* If this is a const call, then set the insn's unchanging bit. */ | |
492 | if (ecf_flags & ECF_LOOPING_CONST_OR_PURE) | |
493 | RTL_LOOPING_CONST_OR_PURE_CALL_P (call_insn) = 1; | |
51bbfa0c | 494 | |
1d65f45c RH |
495 | /* Create a nothrow REG_EH_REGION note, if needed. */ |
496 | make_reg_eh_region_note (call_insn, ecf_flags, 0); | |
12a22e76 | 497 | |
ca3920ad | 498 | if (ecf_flags & ECF_NORETURN) |
65c5f2a6 | 499 | add_reg_note (call_insn, REG_NORETURN, const0_rtx); |
ca3920ad | 500 | |
570a98eb | 501 | if (ecf_flags & ECF_RETURNS_TWICE) |
9defc9b7 | 502 | { |
65c5f2a6 | 503 | add_reg_note (call_insn, REG_SETJMP, const0_rtx); |
e3b5732b | 504 | cfun->calls_setjmp = 1; |
9defc9b7 | 505 | } |
570a98eb | 506 | |
0a1c58a2 JL |
507 | SIBLING_CALL_P (call_insn) = ((ecf_flags & ECF_SIBCALL) != 0); |
508 | ||
b1e64e0d RS |
509 | /* Restore this now, so that we do defer pops for this call's args |
510 | if the context of the call as a whole permits. */ | |
511 | inhibit_defer_pop = old_inhibit_defer_pop; | |
512 | ||
a20c5714 | 513 | if (maybe_ne (n_popped, 0)) |
51bbfa0c RS |
514 | { |
515 | if (!already_popped) | |
e3da301d | 516 | CALL_INSN_FUNCTION_USAGE (call_insn) |
38a448ca RH |
517 | = gen_rtx_EXPR_LIST (VOIDmode, |
518 | gen_rtx_CLOBBER (VOIDmode, stack_pointer_rtx), | |
519 | CALL_INSN_FUNCTION_USAGE (call_insn)); | |
fb5eebb9 | 520 | rounded_stack_size -= n_popped; |
a20c5714 | 521 | rounded_stack_size_rtx = gen_int_mode (rounded_stack_size, Pmode); |
1503a7ec | 522 | stack_pointer_delta -= n_popped; |
2e3f842f | 523 | |
68184180 | 524 | add_args_size_note (call_insn, stack_pointer_delta); |
9a08d230 | 525 | |
2e3f842f L |
526 | /* If popup is needed, stack realign must use DRAP */ |
527 | if (SUPPORTS_STACK_ALIGNMENT) | |
528 | crtl->need_drap = true; | |
51bbfa0c | 529 | } |
f8f75b16 JJ |
530 | /* For noreturn calls when not accumulating outgoing args force |
531 | REG_ARGS_SIZE note to prevent crossjumping of calls with different | |
532 | args sizes. */ | |
533 | else if (!ACCUMULATE_OUTGOING_ARGS && (ecf_flags & ECF_NORETURN) != 0) | |
68184180 | 534 | add_args_size_note (call_insn, stack_pointer_delta); |
51bbfa0c | 535 | |
f73ad30e | 536 | if (!ACCUMULATE_OUTGOING_ARGS) |
51bbfa0c | 537 | { |
f73ad30e JH |
538 | /* If returning from the subroutine does not automatically pop the args, |
539 | we need an instruction to pop them sooner or later. | |
540 | Perhaps do it now; perhaps just record how much space to pop later. | |
541 | ||
542 | If returning from the subroutine does pop the args, indicate that the | |
543 | stack pointer will be changed. */ | |
544 | ||
a20c5714 | 545 | if (maybe_ne (rounded_stack_size, 0)) |
f73ad30e | 546 | { |
9dd9bf80 | 547 | if (ecf_flags & ECF_NORETURN) |
f79a65c0 RK |
548 | /* Just pretend we did the pop. */ |
549 | stack_pointer_delta -= rounded_stack_size; | |
550 | else if (flag_defer_pop && inhibit_defer_pop == 0 | |
7393c642 | 551 | && ! (ecf_flags & (ECF_CONST | ECF_PURE))) |
f73ad30e JH |
552 | pending_stack_adjust += rounded_stack_size; |
553 | else | |
554 | adjust_stack (rounded_stack_size_rtx); | |
555 | } | |
51bbfa0c | 556 | } |
f73ad30e JH |
557 | /* When we accumulate outgoing args, we must avoid any stack manipulations. |
558 | Restore the stack pointer to its original value now. Usually | |
559 | ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions. | |
560 | On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and | |
561 | popping variants of functions exist as well. | |
562 | ||
563 | ??? We may optimize similar to defer_pop above, but it is | |
564 | probably not worthwhile. | |
f725a3ec | 565 | |
f73ad30e JH |
566 | ??? It will be worthwhile to enable combine_stack_adjustments even for |
567 | such machines. */ | |
a20c5714 RS |
568 | else if (maybe_ne (n_popped, 0)) |
569 | anti_adjust_stack (gen_int_mode (n_popped, Pmode)); | |
51bbfa0c RS |
570 | } |
571 | ||
25f0609b BE |
572 | /* Determine if the function identified by FNDECL is one with |
573 | special properties we wish to know about. Modify FLAGS accordingly. | |
20efdf74 JL |
574 | |
575 | For example, if the function might return more than one time (setjmp), then | |
25f0609b | 576 | set ECF_RETURNS_TWICE. |
20efdf74 | 577 | |
25f0609b | 578 | Set ECF_MAY_BE_ALLOCA for any memory allocation function that might allocate |
20efdf74 JL |
579 | space from the stack such as alloca. */ |
580 | ||
f2d33f13 | 581 | static int |
6ea2b70d | 582 | special_function_p (const_tree fndecl, int flags) |
20efdf74 | 583 | { |
d5e254e1 IE |
584 | tree name_decl = DECL_NAME (fndecl); |
585 | ||
d5e254e1 | 586 | if (fndecl && name_decl |
25f0609b | 587 | && IDENTIFIER_LENGTH (name_decl) <= 11 |
20efdf74 JL |
588 | /* Exclude functions not at the file scope, or not `extern', |
589 | since they are not the magic functions we would otherwise | |
d1bd0ded | 590 | think they are. |
c22cacf3 MS |
591 | FIXME: this should be handled with attributes, not with this |
592 | hacky imitation of DECL_ASSEMBLER_NAME. It's (also) wrong | |
593 | because you can declare fork() inside a function if you | |
594 | wish. */ | |
7ae4ad28 | 595 | && (DECL_CONTEXT (fndecl) == NULL_TREE |
d1bd0ded GK |
596 | || TREE_CODE (DECL_CONTEXT (fndecl)) == TRANSLATION_UNIT_DECL) |
597 | && TREE_PUBLIC (fndecl)) | |
20efdf74 | 598 | { |
d5e254e1 | 599 | const char *name = IDENTIFIER_POINTER (name_decl); |
63ad61ed | 600 | const char *tname = name; |
20efdf74 | 601 | |
ca54603f JL |
602 | /* We assume that alloca will always be called by name. It |
603 | makes no sense to pass it as a pointer-to-function to | |
604 | anything that does not understand its behavior. */ | |
4e722cf1 JJ |
605 | if (IDENTIFIER_LENGTH (name_decl) == 6 |
606 | && name[0] == 'a' | |
607 | && ! strcmp (name, "alloca")) | |
f2d33f13 | 608 | flags |= ECF_MAY_BE_ALLOCA; |
ca54603f | 609 | |
25f0609b | 610 | /* Disregard prefix _ or __. */ |
20efdf74 JL |
611 | if (name[0] == '_') |
612 | { | |
25f0609b | 613 | if (name[1] == '_') |
20efdf74 JL |
614 | tname += 2; |
615 | else | |
616 | tname += 1; | |
617 | } | |
618 | ||
25f0609b BE |
619 | /* ECF_RETURNS_TWICE is safe even for -ffreestanding. */ |
620 | if (! strcmp (tname, "setjmp") | |
621 | || ! strcmp (tname, "sigsetjmp") | |
622 | || ! strcmp (name, "savectx") | |
623 | || ! strcmp (name, "vfork") | |
624 | || ! strcmp (name, "getcontext")) | |
625 | flags |= ECF_RETURNS_TWICE; | |
20efdf74 | 626 | } |
d1c38823 | 627 | |
9e878cf1 EB |
628 | if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL |
629 | && ALLOCA_FUNCTION_CODE_P (DECL_FUNCTION_CODE (fndecl))) | |
630 | flags |= ECF_MAY_BE_ALLOCA; | |
4e722cf1 | 631 | |
f2d33f13 | 632 | return flags; |
20efdf74 JL |
633 | } |
634 | ||
e384e6b5 BS |
635 | /* Similar to special_function_p; return a set of ERF_ flags for the |
636 | function FNDECL. */ | |
637 | static int | |
638 | decl_return_flags (tree fndecl) | |
639 | { | |
640 | tree attr; | |
641 | tree type = TREE_TYPE (fndecl); | |
642 | if (!type) | |
643 | return 0; | |
644 | ||
645 | attr = lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type)); | |
646 | if (!attr) | |
647 | return 0; | |
648 | ||
649 | attr = TREE_VALUE (TREE_VALUE (attr)); | |
650 | if (!attr || TREE_STRING_LENGTH (attr) < 1) | |
651 | return 0; | |
652 | ||
653 | switch (TREE_STRING_POINTER (attr)[0]) | |
654 | { | |
655 | case '1': | |
656 | case '2': | |
657 | case '3': | |
658 | case '4': | |
659 | return ERF_RETURNS_ARG | (TREE_STRING_POINTER (attr)[0] - '1'); | |
660 | ||
661 | case 'm': | |
662 | return ERF_NOALIAS; | |
663 | ||
664 | case '.': | |
665 | default: | |
666 | return 0; | |
667 | } | |
668 | } | |
669 | ||
bae802f9 | 670 | /* Return nonzero when FNDECL represents a call to setjmp. */ |
7393c642 | 671 | |
f2d33f13 | 672 | int |
6ea2b70d | 673 | setjmp_call_p (const_tree fndecl) |
f2d33f13 | 674 | { |
275311c4 MP |
675 | if (DECL_IS_RETURNS_TWICE (fndecl)) |
676 | return ECF_RETURNS_TWICE; | |
f2d33f13 JH |
677 | return special_function_p (fndecl, 0) & ECF_RETURNS_TWICE; |
678 | } | |
679 | ||
726a989a | 680 | |
159e8ef0 | 681 | /* Return true if STMT may be an alloca call. */ |
726a989a RB |
682 | |
683 | bool | |
159e8ef0 | 684 | gimple_maybe_alloca_call_p (const gimple *stmt) |
726a989a RB |
685 | { |
686 | tree fndecl; | |
687 | ||
688 | if (!is_gimple_call (stmt)) | |
689 | return false; | |
690 | ||
691 | fndecl = gimple_call_fndecl (stmt); | |
692 | if (fndecl && (special_function_p (fndecl, 0) & ECF_MAY_BE_ALLOCA)) | |
693 | return true; | |
694 | ||
695 | return false; | |
696 | } | |
697 | ||
159e8ef0 BE |
698 | /* Return true if STMT is a builtin alloca call. */ |
699 | ||
700 | bool | |
701 | gimple_alloca_call_p (const gimple *stmt) | |
702 | { | |
703 | tree fndecl; | |
704 | ||
705 | if (!is_gimple_call (stmt)) | |
706 | return false; | |
707 | ||
708 | fndecl = gimple_call_fndecl (stmt); | |
3d78e008 | 709 | if (fndecl && fndecl_built_in_p (fndecl, BUILT_IN_NORMAL)) |
159e8ef0 BE |
710 | switch (DECL_FUNCTION_CODE (fndecl)) |
711 | { | |
9e878cf1 | 712 | CASE_BUILT_IN_ALLOCA: |
eacac712 | 713 | return gimple_call_num_args (stmt) > 0; |
159e8ef0 BE |
714 | default: |
715 | break; | |
716 | } | |
717 | ||
718 | return false; | |
719 | } | |
720 | ||
721 | /* Return true when exp contains a builtin alloca call. */ | |
726a989a | 722 | |
c986baf6 | 723 | bool |
6ea2b70d | 724 | alloca_call_p (const_tree exp) |
c986baf6 | 725 | { |
2284b034 | 726 | tree fndecl; |
c986baf6 | 727 | if (TREE_CODE (exp) == CALL_EXPR |
2284b034 | 728 | && (fndecl = get_callee_fndecl (exp)) |
159e8ef0 BE |
729 | && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) |
730 | switch (DECL_FUNCTION_CODE (fndecl)) | |
731 | { | |
9e878cf1 | 732 | CASE_BUILT_IN_ALLOCA: |
159e8ef0 BE |
733 | return true; |
734 | default: | |
735 | break; | |
736 | } | |
737 | ||
c986baf6 JH |
738 | return false; |
739 | } | |
740 | ||
0a35513e AH |
741 | /* Return TRUE if FNDECL is either a TM builtin or a TM cloned |
742 | function. Return FALSE otherwise. */ | |
743 | ||
744 | static bool | |
745 | is_tm_builtin (const_tree fndecl) | |
746 | { | |
747 | if (fndecl == NULL) | |
748 | return false; | |
749 | ||
750 | if (decl_is_tm_clone (fndecl)) | |
751 | return true; | |
752 | ||
753 | if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) | |
754 | { | |
755 | switch (DECL_FUNCTION_CODE (fndecl)) | |
756 | { | |
757 | case BUILT_IN_TM_COMMIT: | |
758 | case BUILT_IN_TM_COMMIT_EH: | |
759 | case BUILT_IN_TM_ABORT: | |
760 | case BUILT_IN_TM_IRREVOCABLE: | |
761 | case BUILT_IN_TM_GETTMCLONE_IRR: | |
762 | case BUILT_IN_TM_MEMCPY: | |
763 | case BUILT_IN_TM_MEMMOVE: | |
764 | case BUILT_IN_TM_MEMSET: | |
765 | CASE_BUILT_IN_TM_STORE (1): | |
766 | CASE_BUILT_IN_TM_STORE (2): | |
767 | CASE_BUILT_IN_TM_STORE (4): | |
768 | CASE_BUILT_IN_TM_STORE (8): | |
769 | CASE_BUILT_IN_TM_STORE (FLOAT): | |
770 | CASE_BUILT_IN_TM_STORE (DOUBLE): | |
771 | CASE_BUILT_IN_TM_STORE (LDOUBLE): | |
772 | CASE_BUILT_IN_TM_STORE (M64): | |
773 | CASE_BUILT_IN_TM_STORE (M128): | |
774 | CASE_BUILT_IN_TM_STORE (M256): | |
775 | CASE_BUILT_IN_TM_LOAD (1): | |
776 | CASE_BUILT_IN_TM_LOAD (2): | |
777 | CASE_BUILT_IN_TM_LOAD (4): | |
778 | CASE_BUILT_IN_TM_LOAD (8): | |
779 | CASE_BUILT_IN_TM_LOAD (FLOAT): | |
780 | CASE_BUILT_IN_TM_LOAD (DOUBLE): | |
781 | CASE_BUILT_IN_TM_LOAD (LDOUBLE): | |
782 | CASE_BUILT_IN_TM_LOAD (M64): | |
783 | CASE_BUILT_IN_TM_LOAD (M128): | |
784 | CASE_BUILT_IN_TM_LOAD (M256): | |
785 | case BUILT_IN_TM_LOG: | |
786 | case BUILT_IN_TM_LOG_1: | |
787 | case BUILT_IN_TM_LOG_2: | |
788 | case BUILT_IN_TM_LOG_4: | |
789 | case BUILT_IN_TM_LOG_8: | |
790 | case BUILT_IN_TM_LOG_FLOAT: | |
791 | case BUILT_IN_TM_LOG_DOUBLE: | |
792 | case BUILT_IN_TM_LOG_LDOUBLE: | |
793 | case BUILT_IN_TM_LOG_M64: | |
794 | case BUILT_IN_TM_LOG_M128: | |
795 | case BUILT_IN_TM_LOG_M256: | |
796 | return true; | |
797 | default: | |
798 | break; | |
799 | } | |
800 | } | |
801 | return false; | |
802 | } | |
803 | ||
b5cd4ed4 | 804 | /* Detect flags (function attributes) from the function decl or type node. */ |
7393c642 | 805 | |
4977bab6 | 806 | int |
6ea2b70d | 807 | flags_from_decl_or_type (const_tree exp) |
f2d33f13 JH |
808 | { |
809 | int flags = 0; | |
36dbb93d | 810 | |
f2d33f13 JH |
811 | if (DECL_P (exp)) |
812 | { | |
813 | /* The function exp may have the `malloc' attribute. */ | |
36dbb93d | 814 | if (DECL_IS_MALLOC (exp)) |
f2d33f13 JH |
815 | flags |= ECF_MALLOC; |
816 | ||
6e9a3221 AN |
817 | /* The function exp may have the `returns_twice' attribute. */ |
818 | if (DECL_IS_RETURNS_TWICE (exp)) | |
819 | flags |= ECF_RETURNS_TWICE; | |
820 | ||
becfd6e5 | 821 | /* Process the pure and const attributes. */ |
9e3920e9 | 822 | if (TREE_READONLY (exp)) |
becfd6e5 KZ |
823 | flags |= ECF_CONST; |
824 | if (DECL_PURE_P (exp)) | |
e238ccac | 825 | flags |= ECF_PURE; |
becfd6e5 KZ |
826 | if (DECL_LOOPING_CONST_OR_PURE_P (exp)) |
827 | flags |= ECF_LOOPING_CONST_OR_PURE; | |
2a8f6b90 | 828 | |
dcd6de6d ZD |
829 | if (DECL_IS_NOVOPS (exp)) |
830 | flags |= ECF_NOVOPS; | |
46a4da10 JH |
831 | if (lookup_attribute ("leaf", DECL_ATTRIBUTES (exp))) |
832 | flags |= ECF_LEAF; | |
cb59f689 JH |
833 | if (lookup_attribute ("cold", DECL_ATTRIBUTES (exp))) |
834 | flags |= ECF_COLD; | |
dcd6de6d | 835 | |
f2d33f13 JH |
836 | if (TREE_NOTHROW (exp)) |
837 | flags |= ECF_NOTHROW; | |
2b187c63 | 838 | |
0a35513e AH |
839 | if (flag_tm) |
840 | { | |
841 | if (is_tm_builtin (exp)) | |
842 | flags |= ECF_TM_BUILTIN; | |
fe924d9f | 843 | else if ((flags & (ECF_CONST|ECF_NOVOPS)) != 0 |
0a35513e AH |
844 | || lookup_attribute ("transaction_pure", |
845 | TYPE_ATTRIBUTES (TREE_TYPE (exp)))) | |
846 | flags |= ECF_TM_PURE; | |
847 | } | |
848 | ||
6de9cd9a | 849 | flags = special_function_p (exp, flags); |
f2d33f13 | 850 | } |
0a35513e AH |
851 | else if (TYPE_P (exp)) |
852 | { | |
853 | if (TYPE_READONLY (exp)) | |
854 | flags |= ECF_CONST; | |
855 | ||
856 | if (flag_tm | |
857 | && ((flags & ECF_CONST) != 0 | |
858 | || lookup_attribute ("transaction_pure", TYPE_ATTRIBUTES (exp)))) | |
859 | flags |= ECF_TM_PURE; | |
860 | } | |
17fc8d6f AH |
861 | else |
862 | gcc_unreachable (); | |
f2d33f13 JH |
863 | |
864 | if (TREE_THIS_VOLATILE (exp)) | |
9e3920e9 JJ |
865 | { |
866 | flags |= ECF_NORETURN; | |
867 | if (flags & (ECF_CONST|ECF_PURE)) | |
868 | flags |= ECF_LOOPING_CONST_OR_PURE; | |
869 | } | |
f2d33f13 JH |
870 | |
871 | return flags; | |
872 | } | |
873 | ||
f027e0a2 JM |
874 | /* Detect flags from a CALL_EXPR. */ |
875 | ||
876 | int | |
fa233e34 | 877 | call_expr_flags (const_tree t) |
f027e0a2 JM |
878 | { |
879 | int flags; | |
880 | tree decl = get_callee_fndecl (t); | |
881 | ||
882 | if (decl) | |
883 | flags = flags_from_decl_or_type (decl); | |
1691b2e1 TV |
884 | else if (CALL_EXPR_FN (t) == NULL_TREE) |
885 | flags = internal_fn_flags (CALL_EXPR_IFN (t)); | |
f027e0a2 JM |
886 | else |
887 | { | |
4c640e26 EB |
888 | tree type = TREE_TYPE (CALL_EXPR_FN (t)); |
889 | if (type && TREE_CODE (type) == POINTER_TYPE) | |
890 | flags = flags_from_decl_or_type (TREE_TYPE (type)); | |
f027e0a2 JM |
891 | else |
892 | flags = 0; | |
4c640e26 EB |
893 | if (CALL_EXPR_BY_DESCRIPTOR (t)) |
894 | flags |= ECF_BY_DESCRIPTOR; | |
f027e0a2 JM |
895 | } |
896 | ||
897 | return flags; | |
898 | } | |
899 | ||
16a16ec7 AM |
900 | /* Return true if TYPE should be passed by invisible reference. */ |
901 | ||
902 | bool | |
903 | pass_by_reference (CUMULATIVE_ARGS *ca, machine_mode mode, | |
904 | tree type, bool named_arg) | |
905 | { | |
906 | if (type) | |
907 | { | |
908 | /* If this type contains non-trivial constructors, then it is | |
909 | forbidden for the middle-end to create any new copies. */ | |
910 | if (TREE_ADDRESSABLE (type)) | |
911 | return true; | |
912 | ||
913 | /* GCC post 3.4 passes *all* variable sized types by reference. */ | |
914 | if (!TYPE_SIZE (type) || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST) | |
915 | return true; | |
916 | ||
917 | /* If a record type should be passed the same as its first (and only) | |
918 | member, use the type and mode of that member. */ | |
919 | if (TREE_CODE (type) == RECORD_TYPE && TYPE_TRANSPARENT_AGGR (type)) | |
920 | { | |
921 | type = TREE_TYPE (first_field (type)); | |
922 | mode = TYPE_MODE (type); | |
923 | } | |
924 | } | |
925 | ||
926 | return targetm.calls.pass_by_reference (pack_cumulative_args (ca), mode, | |
927 | type, named_arg); | |
928 | } | |
929 | ||
fde65a89 RS |
930 | /* Return true if TYPE should be passed by reference when passed to |
931 | the "..." arguments of a function. */ | |
932 | ||
933 | bool | |
934 | pass_va_arg_by_reference (tree type) | |
935 | { | |
936 | return pass_by_reference (NULL, TYPE_MODE (type), type, false); | |
937 | } | |
938 | ||
16a16ec7 AM |
939 | /* Return true if TYPE, which is passed by reference, should be callee |
940 | copied instead of caller copied. */ | |
941 | ||
942 | bool | |
943 | reference_callee_copied (CUMULATIVE_ARGS *ca, machine_mode mode, | |
944 | tree type, bool named_arg) | |
945 | { | |
946 | if (type && TREE_ADDRESSABLE (type)) | |
947 | return false; | |
948 | return targetm.calls.callee_copies (pack_cumulative_args (ca), mode, type, | |
949 | named_arg); | |
950 | } | |
951 | ||
952 | ||
20efdf74 JL |
953 | /* Precompute all register parameters as described by ARGS, storing values |
954 | into fields within the ARGS array. | |
955 | ||
956 | NUM_ACTUALS indicates the total number elements in the ARGS array. | |
957 | ||
958 | Set REG_PARM_SEEN if we encounter a register parameter. */ | |
959 | ||
960 | static void | |
27e29549 RH |
961 | precompute_register_parameters (int num_actuals, struct arg_data *args, |
962 | int *reg_parm_seen) | |
20efdf74 JL |
963 | { |
964 | int i; | |
965 | ||
966 | *reg_parm_seen = 0; | |
967 | ||
968 | for (i = 0; i < num_actuals; i++) | |
969 | if (args[i].reg != 0 && ! args[i].pass_on_stack) | |
970 | { | |
971 | *reg_parm_seen = 1; | |
972 | ||
973 | if (args[i].value == 0) | |
974 | { | |
975 | push_temp_slots (); | |
84217346 | 976 | args[i].value = expand_normal (args[i].tree_value); |
20efdf74 JL |
977 | preserve_temp_slots (args[i].value); |
978 | pop_temp_slots (); | |
20efdf74 JL |
979 | } |
980 | ||
981 | /* If we are to promote the function arg to a wider mode, | |
982 | do it now. */ | |
983 | ||
984 | if (args[i].mode != TYPE_MODE (TREE_TYPE (args[i].tree_value))) | |
985 | args[i].value | |
986 | = convert_modes (args[i].mode, | |
987 | TYPE_MODE (TREE_TYPE (args[i].tree_value)), | |
988 | args[i].value, args[i].unsignedp); | |
989 | ||
a7adbbcb L |
990 | /* If the value is a non-legitimate constant, force it into a |
991 | pseudo now. TLS symbols sometimes need a call to resolve. */ | |
992 | if (CONSTANT_P (args[i].value) | |
993 | && !targetm.legitimate_constant_p (args[i].mode, args[i].value)) | |
994 | args[i].value = force_reg (args[i].mode, args[i].value); | |
995 | ||
27e29549 RH |
996 | /* If we're going to have to load the value by parts, pull the |
997 | parts into pseudos. The part extraction process can involve | |
998 | non-trivial computation. */ | |
999 | if (GET_CODE (args[i].reg) == PARALLEL) | |
1000 | { | |
1001 | tree type = TREE_TYPE (args[i].tree_value); | |
8df3dbb7 | 1002 | args[i].parallel_value |
27e29549 RH |
1003 | = emit_group_load_into_temps (args[i].reg, args[i].value, |
1004 | type, int_size_in_bytes (type)); | |
1005 | } | |
1006 | ||
f725a3ec | 1007 | /* If the value is expensive, and we are inside an appropriately |
20efdf74 JL |
1008 | short loop, put the value into a pseudo and then put the pseudo |
1009 | into the hard reg. | |
1010 | ||
1011 | For small register classes, also do this if this call uses | |
1012 | register parameters. This is to avoid reload conflicts while | |
1013 | loading the parameters registers. */ | |
1014 | ||
27e29549 RH |
1015 | else if ((! (REG_P (args[i].value) |
1016 | || (GET_CODE (args[i].value) == SUBREG | |
1017 | && REG_P (SUBREG_REG (args[i].value))))) | |
1018 | && args[i].mode != BLKmode | |
e548c9df AM |
1019 | && (set_src_cost (args[i].value, args[i].mode, |
1020 | optimize_insn_for_speed_p ()) | |
1021 | > COSTS_N_INSNS (1)) | |
42db504c SB |
1022 | && ((*reg_parm_seen |
1023 | && targetm.small_register_classes_for_mode_p (args[i].mode)) | |
27e29549 | 1024 | || optimize)) |
20efdf74 JL |
1025 | args[i].value = copy_to_mode_reg (args[i].mode, args[i].value); |
1026 | } | |
1027 | } | |
1028 | ||
f73ad30e | 1029 | #ifdef REG_PARM_STACK_SPACE |
20efdf74 JL |
1030 | |
1031 | /* The argument list is the property of the called routine and it | |
1032 | may clobber it. If the fixed area has been used for previous | |
1033 | parameters, we must save and restore it. */ | |
3bdf5ad1 | 1034 | |
20efdf74 | 1035 | static rtx |
d329e058 | 1036 | save_fixed_argument_area (int reg_parm_stack_space, rtx argblock, int *low_to_save, int *high_to_save) |
20efdf74 | 1037 | { |
a20c5714 RS |
1038 | unsigned int low; |
1039 | unsigned int high; | |
20efdf74 | 1040 | |
b820d2b8 AM |
1041 | /* Compute the boundary of the area that needs to be saved, if any. */ |
1042 | high = reg_parm_stack_space; | |
6dad9361 TS |
1043 | if (ARGS_GROW_DOWNWARD) |
1044 | high += 1; | |
1045 | ||
b820d2b8 AM |
1046 | if (high > highest_outgoing_arg_in_use) |
1047 | high = highest_outgoing_arg_in_use; | |
20efdf74 | 1048 | |
b820d2b8 | 1049 | for (low = 0; low < high; low++) |
a20c5714 | 1050 | if (stack_usage_map[low] != 0 || low >= stack_usage_watermark) |
b820d2b8 AM |
1051 | { |
1052 | int num_to_save; | |
ef4bddc2 | 1053 | machine_mode save_mode; |
b820d2b8 | 1054 | int delta; |
0a81f074 | 1055 | rtx addr; |
b820d2b8 AM |
1056 | rtx stack_area; |
1057 | rtx save_area; | |
20efdf74 | 1058 | |
b820d2b8 AM |
1059 | while (stack_usage_map[--high] == 0) |
1060 | ; | |
20efdf74 | 1061 | |
b820d2b8 AM |
1062 | *low_to_save = low; |
1063 | *high_to_save = high; | |
1064 | ||
1065 | num_to_save = high - low + 1; | |
20efdf74 | 1066 | |
b820d2b8 AM |
1067 | /* If we don't have the required alignment, must do this |
1068 | in BLKmode. */ | |
fffbab82 RS |
1069 | scalar_int_mode imode; |
1070 | if (int_mode_for_size (num_to_save * BITS_PER_UNIT, 1).exists (&imode) | |
1071 | && (low & (MIN (GET_MODE_SIZE (imode), | |
1072 | BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1)) == 0) | |
1073 | save_mode = imode; | |
1074 | else | |
b820d2b8 | 1075 | save_mode = BLKmode; |
20efdf74 | 1076 | |
6dad9361 TS |
1077 | if (ARGS_GROW_DOWNWARD) |
1078 | delta = -high; | |
1079 | else | |
1080 | delta = low; | |
1081 | ||
0a81f074 RS |
1082 | addr = plus_constant (Pmode, argblock, delta); |
1083 | stack_area = gen_rtx_MEM (save_mode, memory_address (save_mode, addr)); | |
8ac61af7 | 1084 | |
b820d2b8 AM |
1085 | set_mem_align (stack_area, PARM_BOUNDARY); |
1086 | if (save_mode == BLKmode) | |
1087 | { | |
9474e8ab | 1088 | save_area = assign_stack_temp (BLKmode, num_to_save); |
b820d2b8 AM |
1089 | emit_block_move (validize_mem (save_area), stack_area, |
1090 | GEN_INT (num_to_save), BLOCK_OP_CALL_PARM); | |
1091 | } | |
1092 | else | |
1093 | { | |
1094 | save_area = gen_reg_rtx (save_mode); | |
1095 | emit_move_insn (save_area, stack_area); | |
1096 | } | |
8ac61af7 | 1097 | |
b820d2b8 AM |
1098 | return save_area; |
1099 | } | |
1100 | ||
1101 | return NULL_RTX; | |
20efdf74 JL |
1102 | } |
1103 | ||
1104 | static void | |
d329e058 | 1105 | restore_fixed_argument_area (rtx save_area, rtx argblock, int high_to_save, int low_to_save) |
20efdf74 | 1106 | { |
ef4bddc2 | 1107 | machine_mode save_mode = GET_MODE (save_area); |
b820d2b8 | 1108 | int delta; |
0a81f074 | 1109 | rtx addr, stack_area; |
b820d2b8 | 1110 | |
6dad9361 TS |
1111 | if (ARGS_GROW_DOWNWARD) |
1112 | delta = -high_to_save; | |
1113 | else | |
1114 | delta = low_to_save; | |
1115 | ||
0a81f074 RS |
1116 | addr = plus_constant (Pmode, argblock, delta); |
1117 | stack_area = gen_rtx_MEM (save_mode, memory_address (save_mode, addr)); | |
b820d2b8 | 1118 | set_mem_align (stack_area, PARM_BOUNDARY); |
20efdf74 JL |
1119 | |
1120 | if (save_mode != BLKmode) | |
1121 | emit_move_insn (stack_area, save_area); | |
1122 | else | |
44bb111a RH |
1123 | emit_block_move (stack_area, validize_mem (save_area), |
1124 | GEN_INT (high_to_save - low_to_save + 1), | |
1125 | BLOCK_OP_CALL_PARM); | |
20efdf74 | 1126 | } |
19652adf | 1127 | #endif /* REG_PARM_STACK_SPACE */ |
f725a3ec | 1128 | |
20efdf74 JL |
1129 | /* If any elements in ARGS refer to parameters that are to be passed in |
1130 | registers, but not in memory, and whose alignment does not permit a | |
1131 | direct copy into registers. Copy the values into a group of pseudos | |
f725a3ec | 1132 | which we will later copy into the appropriate hard registers. |
8e6a59fe MM |
1133 | |
1134 | Pseudos for each unaligned argument will be stored into the array | |
1135 | args[argnum].aligned_regs. The caller is responsible for deallocating | |
1136 | the aligned_regs array if it is nonzero. */ | |
1137 | ||
20efdf74 | 1138 | static void |
d329e058 | 1139 | store_unaligned_arguments_into_pseudos (struct arg_data *args, int num_actuals) |
20efdf74 JL |
1140 | { |
1141 | int i, j; | |
f725a3ec | 1142 | |
20efdf74 JL |
1143 | for (i = 0; i < num_actuals; i++) |
1144 | if (args[i].reg != 0 && ! args[i].pass_on_stack | |
a7973050 | 1145 | && GET_CODE (args[i].reg) != PARALLEL |
20efdf74 | 1146 | && args[i].mode == BLKmode |
852d22b4 EB |
1147 | && MEM_P (args[i].value) |
1148 | && (MEM_ALIGN (args[i].value) | |
20efdf74 JL |
1149 | < (unsigned int) MIN (BIGGEST_ALIGNMENT, BITS_PER_WORD))) |
1150 | { | |
1151 | int bytes = int_size_in_bytes (TREE_TYPE (args[i].tree_value)); | |
6e985040 | 1152 | int endian_correction = 0; |
20efdf74 | 1153 | |
78a52f11 RH |
1154 | if (args[i].partial) |
1155 | { | |
1156 | gcc_assert (args[i].partial % UNITS_PER_WORD == 0); | |
1157 | args[i].n_aligned_regs = args[i].partial / UNITS_PER_WORD; | |
1158 | } | |
1159 | else | |
1160 | { | |
1161 | args[i].n_aligned_regs | |
1162 | = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD; | |
1163 | } | |
1164 | ||
5ed6ace5 | 1165 | args[i].aligned_regs = XNEWVEC (rtx, args[i].n_aligned_regs); |
20efdf74 | 1166 | |
6e985040 AM |
1167 | /* Structures smaller than a word are normally aligned to the |
1168 | least significant byte. On a BYTES_BIG_ENDIAN machine, | |
20efdf74 JL |
1169 | this means we must skip the empty high order bytes when |
1170 | calculating the bit offset. */ | |
6e985040 AM |
1171 | if (bytes < UNITS_PER_WORD |
1172 | #ifdef BLOCK_REG_PADDING | |
1173 | && (BLOCK_REG_PADDING (args[i].mode, | |
1174 | TREE_TYPE (args[i].tree_value), 1) | |
76b0cbf8 | 1175 | == PAD_DOWNWARD) |
6e985040 AM |
1176 | #else |
1177 | && BYTES_BIG_ENDIAN | |
1178 | #endif | |
1179 | ) | |
1180 | endian_correction = BITS_PER_WORD - bytes * BITS_PER_UNIT; | |
20efdf74 JL |
1181 | |
1182 | for (j = 0; j < args[i].n_aligned_regs; j++) | |
1183 | { | |
1184 | rtx reg = gen_reg_rtx (word_mode); | |
1185 | rtx word = operand_subword_force (args[i].value, j, BLKmode); | |
1186 | int bitsize = MIN (bytes * BITS_PER_UNIT, BITS_PER_WORD); | |
20efdf74 JL |
1187 | |
1188 | args[i].aligned_regs[j] = reg; | |
c6285bd7 | 1189 | word = extract_bit_field (word, bitsize, 0, 1, NULL_RTX, |
f96bf49a | 1190 | word_mode, word_mode, false, NULL); |
20efdf74 JL |
1191 | |
1192 | /* There is no need to restrict this code to loading items | |
1193 | in TYPE_ALIGN sized hunks. The bitfield instructions can | |
1194 | load up entire word sized registers efficiently. | |
1195 | ||
1196 | ??? This may not be needed anymore. | |
1197 | We use to emit a clobber here but that doesn't let later | |
1198 | passes optimize the instructions we emit. By storing 0 into | |
1199 | the register later passes know the first AND to zero out the | |
1200 | bitfield being set in the register is unnecessary. The store | |
1201 | of 0 will be deleted as will at least the first AND. */ | |
1202 | ||
1203 | emit_move_insn (reg, const0_rtx); | |
1204 | ||
1205 | bytes -= bitsize / BITS_PER_UNIT; | |
1169e45d | 1206 | store_bit_field (reg, bitsize, endian_correction, 0, 0, |
ee45a32d | 1207 | word_mode, word, false); |
20efdf74 JL |
1208 | } |
1209 | } | |
1210 | } | |
1211 | ||
8bd9f164 MS |
1212 | /* The limit set by -Walloc-larger-than=. */ |
1213 | static GTY(()) tree alloc_object_size_limit; | |
1214 | ||
1215 | /* Initialize ALLOC_OBJECT_SIZE_LIMIT based on the -Walloc-size-larger-than= | |
1216 | setting if the option is specified, or to the maximum object size if it | |
1217 | is not. Return the initialized value. */ | |
1218 | ||
1219 | static tree | |
1220 | alloc_max_size (void) | |
1221 | { | |
d258f4aa MS |
1222 | if (alloc_object_size_limit) |
1223 | return alloc_object_size_limit; | |
8bd9f164 | 1224 | |
0aaafa5e MS |
1225 | HOST_WIDE_INT limit = warn_alloc_size_limit; |
1226 | if (limit == HOST_WIDE_INT_MAX) | |
1227 | limit = tree_to_shwi (TYPE_MAX_VALUE (ptrdiff_type_node)); | |
1228 | ||
1229 | alloc_object_size_limit = build_int_cst (size_type_node, limit); | |
d258f4aa | 1230 | |
8bd9f164 MS |
1231 | return alloc_object_size_limit; |
1232 | } | |
1233 | ||
c16880ef | 1234 | /* Return true when EXP's range can be determined and set RANGE[] to it |
cc8bea0a MS |
1235 | after adjusting it if necessary to make EXP a represents a valid size |
1236 | of object, or a valid size argument to an allocation function declared | |
1237 | with attribute alloc_size (whose argument may be signed), or to a string | |
1238 | manipulation function like memset. When ALLOW_ZERO is true, allow | |
1239 | returning a range of [0, 0] for a size in an anti-range [1, N] where | |
1240 | N > PTRDIFF_MAX. A zero range is a (nearly) invalid argument to | |
1241 | allocation functions like malloc but it is a valid argument to | |
1242 | functions like memset. */ | |
8bd9f164 | 1243 | |
c16880ef | 1244 | bool |
cc8bea0a | 1245 | get_size_range (tree exp, tree range[2], bool allow_zero /* = false */) |
8bd9f164 | 1246 | { |
c16880ef | 1247 | if (tree_fits_uhwi_p (exp)) |
8bd9f164 | 1248 | { |
c16880ef MS |
1249 | /* EXP is a constant. */ |
1250 | range[0] = range[1] = exp; | |
1251 | return true; | |
1252 | } | |
1253 | ||
cc8bea0a MS |
1254 | tree exptype = TREE_TYPE (exp); |
1255 | bool integral = INTEGRAL_TYPE_P (exptype); | |
1256 | ||
c16880ef | 1257 | wide_int min, max; |
54994253 | 1258 | enum value_range_kind range_type; |
cc8bea0a | 1259 | |
72930d9f MS |
1260 | if (integral) |
1261 | range_type = determine_value_range (exp, &min, &max); | |
cc8bea0a MS |
1262 | else |
1263 | range_type = VR_VARYING; | |
c16880ef MS |
1264 | |
1265 | if (range_type == VR_VARYING) | |
1266 | { | |
cc8bea0a MS |
1267 | if (integral) |
1268 | { | |
1269 | /* Use the full range of the type of the expression when | |
1270 | no value range information is available. */ | |
1271 | range[0] = TYPE_MIN_VALUE (exptype); | |
1272 | range[1] = TYPE_MAX_VALUE (exptype); | |
1273 | return true; | |
1274 | } | |
1275 | ||
c16880ef MS |
1276 | range[0] = NULL_TREE; |
1277 | range[1] = NULL_TREE; | |
1278 | return false; | |
1279 | } | |
1280 | ||
c16880ef | 1281 | unsigned expprec = TYPE_PRECISION (exptype); |
c16880ef MS |
1282 | |
1283 | bool signed_p = !TYPE_UNSIGNED (exptype); | |
1284 | ||
1285 | if (range_type == VR_ANTI_RANGE) | |
1286 | { | |
1287 | if (signed_p) | |
8bd9f164 | 1288 | { |
8e6cdc90 | 1289 | if (wi::les_p (max, 0)) |
8bd9f164 | 1290 | { |
c16880ef MS |
1291 | /* EXP is not in a strictly negative range. That means |
1292 | it must be in some (not necessarily strictly) positive | |
1293 | range which includes zero. Since in signed to unsigned | |
1294 | conversions negative values end up converted to large | |
1295 | positive values, and otherwise they are not valid sizes, | |
1296 | the resulting range is in both cases [0, TYPE_MAX]. */ | |
8e6cdc90 RS |
1297 | min = wi::zero (expprec); |
1298 | max = wi::to_wide (TYPE_MAX_VALUE (exptype)); | |
8bd9f164 | 1299 | } |
8e6cdc90 | 1300 | else if (wi::les_p (min - 1, 0)) |
c16880ef MS |
1301 | { |
1302 | /* EXP is not in a negative-positive range. That means EXP | |
1303 | is either negative, or greater than max. Since negative | |
1304 | sizes are invalid make the range [MAX + 1, TYPE_MAX]. */ | |
1305 | min = max + 1; | |
8e6cdc90 | 1306 | max = wi::to_wide (TYPE_MAX_VALUE (exptype)); |
c16880ef MS |
1307 | } |
1308 | else | |
1309 | { | |
1310 | max = min - 1; | |
8e6cdc90 | 1311 | min = wi::zero (expprec); |
c16880ef MS |
1312 | } |
1313 | } | |
8e6cdc90 | 1314 | else if (wi::eq_p (0, min - 1)) |
c16880ef MS |
1315 | { |
1316 | /* EXP is unsigned and not in the range [1, MAX]. That means | |
1317 | it's either zero or greater than MAX. Even though 0 would | |
cc8bea0a MS |
1318 | normally be detected by -Walloc-zero, unless ALLOW_ZERO |
1319 | is true, set the range to [MAX, TYPE_MAX] so that when MAX | |
1320 | is greater than the limit the whole range is diagnosed. */ | |
1321 | if (allow_zero) | |
1322 | min = max = wi::zero (expprec); | |
1323 | else | |
1324 | { | |
1325 | min = max + 1; | |
1326 | max = wi::to_wide (TYPE_MAX_VALUE (exptype)); | |
1327 | } | |
c16880ef MS |
1328 | } |
1329 | else | |
1330 | { | |
1331 | max = min - 1; | |
8e6cdc90 | 1332 | min = wi::zero (expprec); |
8bd9f164 MS |
1333 | } |
1334 | } | |
1335 | ||
c16880ef MS |
1336 | range[0] = wide_int_to_tree (exptype, min); |
1337 | range[1] = wide_int_to_tree (exptype, max); | |
1338 | ||
1339 | return true; | |
8bd9f164 MS |
1340 | } |
1341 | ||
1342 | /* Diagnose a call EXP to function FN decorated with attribute alloc_size | |
1343 | whose argument numbers given by IDX with values given by ARGS exceed | |
1344 | the maximum object size or cause an unsigned oveflow (wrapping) when | |
302db8ba MS |
1345 | multiplied. FN is null when EXP is a call via a function pointer. |
1346 | When ARGS[0] is null the function does nothing. ARGS[1] may be null | |
1347 | for functions like malloc, and non-null for those like calloc that | |
1348 | are decorated with a two-argument attribute alloc_size. */ | |
8bd9f164 MS |
1349 | |
1350 | void | |
1351 | maybe_warn_alloc_args_overflow (tree fn, tree exp, tree args[2], int idx[2]) | |
1352 | { | |
1353 | /* The range each of the (up to) two arguments is known to be in. */ | |
1354 | tree argrange[2][2] = { { NULL_TREE, NULL_TREE }, { NULL_TREE, NULL_TREE } }; | |
1355 | ||
1356 | /* Maximum object size set by -Walloc-size-larger-than= or SIZE_MAX / 2. */ | |
1357 | tree maxobjsize = alloc_max_size (); | |
1358 | ||
1359 | location_t loc = EXPR_LOCATION (exp); | |
1360 | ||
302db8ba | 1361 | tree fntype = fn ? TREE_TYPE (fn) : TREE_TYPE (TREE_TYPE (exp)); |
8bd9f164 MS |
1362 | bool warned = false; |
1363 | ||
1364 | /* Validate each argument individually. */ | |
1365 | for (unsigned i = 0; i != 2 && args[i]; ++i) | |
1366 | { | |
1367 | if (TREE_CODE (args[i]) == INTEGER_CST) | |
1368 | { | |
1369 | argrange[i][0] = args[i]; | |
1370 | argrange[i][1] = args[i]; | |
1371 | ||
1372 | if (tree_int_cst_lt (args[i], integer_zero_node)) | |
1373 | { | |
1374 | warned = warning_at (loc, OPT_Walloc_size_larger_than_, | |
c16880ef MS |
1375 | "%Kargument %i value %qE is negative", |
1376 | exp, idx[i] + 1, args[i]); | |
8bd9f164 MS |
1377 | } |
1378 | else if (integer_zerop (args[i])) | |
1379 | { | |
1380 | /* Avoid issuing -Walloc-zero for allocation functions other | |
1381 | than __builtin_alloca that are declared with attribute | |
1382 | returns_nonnull because there's no portability risk. This | |
1383 | avoids warning for such calls to libiberty's xmalloc and | |
1384 | friends. | |
1385 | Also avoid issuing the warning for calls to function named | |
1386 | "alloca". */ | |
cb1180d5 RS |
1387 | if (fn && fndecl_built_in_p (fn, BUILT_IN_ALLOCA) |
1388 | ? IDENTIFIER_LENGTH (DECL_NAME (fn)) != 6 | |
1389 | : !lookup_attribute ("returns_nonnull", | |
1390 | TYPE_ATTRIBUTES (fntype))) | |
8bd9f164 | 1391 | warned = warning_at (loc, OPT_Walloc_zero, |
c16880ef MS |
1392 | "%Kargument %i value is zero", |
1393 | exp, idx[i] + 1); | |
8bd9f164 MS |
1394 | } |
1395 | else if (tree_int_cst_lt (maxobjsize, args[i])) | |
1396 | { | |
1397 | /* G++ emits calls to ::operator new[](SIZE_MAX) in C++98 | |
1398 | mode and with -fno-exceptions as a way to indicate array | |
1399 | size overflow. There's no good way to detect C++98 here | |
1400 | so avoid diagnosing these calls for all C++ modes. */ | |
1401 | if (i == 0 | |
302db8ba | 1402 | && fn |
8bd9f164 MS |
1403 | && !args[1] |
1404 | && lang_GNU_CXX () | |
cb50701e | 1405 | && DECL_IS_OPERATOR_NEW_P (fn) |
8bd9f164 MS |
1406 | && integer_all_onesp (args[i])) |
1407 | continue; | |
1408 | ||
1409 | warned = warning_at (loc, OPT_Walloc_size_larger_than_, | |
c16880ef | 1410 | "%Kargument %i value %qE exceeds " |
8bd9f164 | 1411 | "maximum object size %E", |
c16880ef | 1412 | exp, idx[i] + 1, args[i], maxobjsize); |
8bd9f164 MS |
1413 | } |
1414 | } | |
c16880ef MS |
1415 | else if (TREE_CODE (args[i]) == SSA_NAME |
1416 | && get_size_range (args[i], argrange[i])) | |
8bd9f164 | 1417 | { |
8bd9f164 MS |
1418 | /* Verify that the argument's range is not negative (including |
1419 | upper bound of zero). */ | |
1420 | if (tree_int_cst_lt (argrange[i][0], integer_zero_node) | |
1421 | && tree_int_cst_le (argrange[i][1], integer_zero_node)) | |
1422 | { | |
1423 | warned = warning_at (loc, OPT_Walloc_size_larger_than_, | |
c16880ef MS |
1424 | "%Kargument %i range [%E, %E] is negative", |
1425 | exp, idx[i] + 1, | |
1426 | argrange[i][0], argrange[i][1]); | |
8bd9f164 MS |
1427 | } |
1428 | else if (tree_int_cst_lt (maxobjsize, argrange[i][0])) | |
1429 | { | |
1430 | warned = warning_at (loc, OPT_Walloc_size_larger_than_, | |
c16880ef | 1431 | "%Kargument %i range [%E, %E] exceeds " |
8bd9f164 | 1432 | "maximum object size %E", |
c16880ef MS |
1433 | exp, idx[i] + 1, |
1434 | argrange[i][0], argrange[i][1], | |
8bd9f164 MS |
1435 | maxobjsize); |
1436 | } | |
1437 | } | |
1438 | } | |
1439 | ||
1440 | if (!argrange[0]) | |
1441 | return; | |
1442 | ||
1443 | /* For a two-argument alloc_size, validate the product of the two | |
1444 | arguments if both of their values or ranges are known. */ | |
1445 | if (!warned && tree_fits_uhwi_p (argrange[0][0]) | |
1446 | && argrange[1][0] && tree_fits_uhwi_p (argrange[1][0]) | |
1447 | && !integer_onep (argrange[0][0]) | |
1448 | && !integer_onep (argrange[1][0])) | |
1449 | { | |
1450 | /* Check for overflow in the product of a function decorated with | |
1451 | attribute alloc_size (X, Y). */ | |
1452 | unsigned szprec = TYPE_PRECISION (size_type_node); | |
1453 | wide_int x = wi::to_wide (argrange[0][0], szprec); | |
1454 | wide_int y = wi::to_wide (argrange[1][0], szprec); | |
1455 | ||
4a669ac3 | 1456 | wi::overflow_type vflow; |
8bd9f164 MS |
1457 | wide_int prod = wi::umul (x, y, &vflow); |
1458 | ||
1459 | if (vflow) | |
1460 | warned = warning_at (loc, OPT_Walloc_size_larger_than_, | |
c16880ef | 1461 | "%Kproduct %<%E * %E%> of arguments %i and %i " |
8bd9f164 | 1462 | "exceeds %<SIZE_MAX%>", |
c16880ef | 1463 | exp, argrange[0][0], argrange[1][0], |
8bd9f164 MS |
1464 | idx[0] + 1, idx[1] + 1); |
1465 | else if (wi::ltu_p (wi::to_wide (maxobjsize, szprec), prod)) | |
1466 | warned = warning_at (loc, OPT_Walloc_size_larger_than_, | |
c16880ef | 1467 | "%Kproduct %<%E * %E%> of arguments %i and %i " |
8bd9f164 | 1468 | "exceeds maximum object size %E", |
c16880ef | 1469 | exp, argrange[0][0], argrange[1][0], |
8bd9f164 MS |
1470 | idx[0] + 1, idx[1] + 1, |
1471 | maxobjsize); | |
1472 | ||
1473 | if (warned) | |
1474 | { | |
1475 | /* Print the full range of each of the two arguments to make | |
1476 | it clear when it is, in fact, in a range and not constant. */ | |
1477 | if (argrange[0][0] != argrange [0][1]) | |
1478 | inform (loc, "argument %i in the range [%E, %E]", | |
1479 | idx[0] + 1, argrange[0][0], argrange[0][1]); | |
1480 | if (argrange[1][0] != argrange [1][1]) | |
1481 | inform (loc, "argument %i in the range [%E, %E]", | |
1482 | idx[1] + 1, argrange[1][0], argrange[1][1]); | |
1483 | } | |
1484 | } | |
1485 | ||
302db8ba | 1486 | if (warned && fn) |
8bd9f164 MS |
1487 | { |
1488 | location_t fnloc = DECL_SOURCE_LOCATION (fn); | |
1489 | ||
1490 | if (DECL_IS_BUILTIN (fn)) | |
1491 | inform (loc, | |
1492 | "in a call to built-in allocation function %qD", fn); | |
1493 | else | |
1494 | inform (fnloc, | |
1495 | "in a call to allocation function %qD declared here", fn); | |
1496 | } | |
1497 | } | |
1498 | ||
6a33d0ff MS |
1499 | /* If EXPR refers to a character array or pointer declared attribute |
1500 | nonstring return a decl for that array or pointer and set *REF to | |
1501 | the referenced enclosing object or pointer. Otherwise returns | |
1502 | null. */ | |
1503 | ||
1504 | tree | |
1505 | get_attr_nonstring_decl (tree expr, tree *ref) | |
1506 | { | |
1507 | tree decl = expr; | |
665db3ae | 1508 | tree var = NULL_TREE; |
6a33d0ff MS |
1509 | if (TREE_CODE (decl) == SSA_NAME) |
1510 | { | |
1511 | gimple *def = SSA_NAME_DEF_STMT (decl); | |
1512 | ||
1513 | if (is_gimple_assign (def)) | |
1514 | { | |
1515 | tree_code code = gimple_assign_rhs_code (def); | |
1516 | if (code == ADDR_EXPR | |
1517 | || code == COMPONENT_REF | |
1518 | || code == VAR_DECL) | |
1519 | decl = gimple_assign_rhs1 (def); | |
1520 | } | |
665db3ae JL |
1521 | else |
1522 | var = SSA_NAME_VAR (decl); | |
6a33d0ff MS |
1523 | } |
1524 | ||
1525 | if (TREE_CODE (decl) == ADDR_EXPR) | |
1526 | decl = TREE_OPERAND (decl, 0); | |
1527 | ||
665db3ae JL |
1528 | /* To simplify calling code, store the referenced DECL regardless of |
1529 | the attribute determined below, but avoid storing the SSA_NAME_VAR | |
1530 | obtained above (it's not useful for dataflow purposes). */ | |
6a33d0ff MS |
1531 | if (ref) |
1532 | *ref = decl; | |
1533 | ||
665db3ae JL |
1534 | /* Use the SSA_NAME_VAR that was determined above to see if it's |
1535 | declared nonstring. Otherwise drill down into the referenced | |
1536 | DECL. */ | |
1537 | if (var) | |
1538 | decl = var; | |
1539 | else if (TREE_CODE (decl) == ARRAY_REF) | |
27560569 MS |
1540 | decl = TREE_OPERAND (decl, 0); |
1541 | else if (TREE_CODE (decl) == COMPONENT_REF) | |
6a33d0ff | 1542 | decl = TREE_OPERAND (decl, 1); |
27560569 MS |
1543 | else if (TREE_CODE (decl) == MEM_REF) |
1544 | return get_attr_nonstring_decl (TREE_OPERAND (decl, 0), ref); | |
6a33d0ff MS |
1545 | |
1546 | if (DECL_P (decl) | |
1547 | && lookup_attribute ("nonstring", DECL_ATTRIBUTES (decl))) | |
1548 | return decl; | |
1549 | ||
1550 | return NULL_TREE; | |
1551 | } | |
1552 | ||
6a33d0ff MS |
1553 | /* Warn about passing a non-string array/pointer to a function that |
1554 | expects a nul-terminated string argument. */ | |
1555 | ||
1556 | void | |
1557 | maybe_warn_nonstring_arg (tree fndecl, tree exp) | |
1558 | { | |
3d78e008 | 1559 | if (!fndecl || !fndecl_built_in_p (fndecl, BUILT_IN_NORMAL)) |
6a33d0ff MS |
1560 | return; |
1561 | ||
2c8861b7 | 1562 | if (TREE_NO_WARNING (exp) || !warn_stringop_overflow) |
781ff3d8 MS |
1563 | return; |
1564 | ||
1a9b15a7 | 1565 | /* Avoid clearly invalid calls (more checking done below). */ |
2438cb6a | 1566 | unsigned nargs = call_expr_nargs (exp); |
1a9b15a7 MS |
1567 | if (!nargs) |
1568 | return; | |
2438cb6a | 1569 | |
6a33d0ff MS |
1570 | /* The bound argument to a bounded string function like strncpy. */ |
1571 | tree bound = NULL_TREE; | |
1572 | ||
5d6655eb MS |
1573 | /* The longest known or possible string argument to one of the comparison |
1574 | functions. If the length is less than the bound it is used instead. | |
1575 | Since the length is only used for warning and not for code generation | |
1576 | disable strict mode in the calls to get_range_strlen below. */ | |
1577 | tree maxlen = NULL_TREE; | |
d677a8b6 | 1578 | |
6a33d0ff MS |
1579 | /* It's safe to call "bounded" string functions with a non-string |
1580 | argument since the functions provide an explicit bound for this | |
4252ccd7 MS |
1581 | purpose. The exception is strncat where the bound may refer to |
1582 | either the destination or the source. */ | |
1583 | int fncode = DECL_FUNCTION_CODE (fndecl); | |
1584 | switch (fncode) | |
6a33d0ff | 1585 | { |
d677a8b6 | 1586 | case BUILT_IN_STRCMP: |
6a33d0ff MS |
1587 | case BUILT_IN_STRNCMP: |
1588 | case BUILT_IN_STRNCASECMP: | |
d677a8b6 MS |
1589 | { |
1590 | /* For these, if one argument refers to one or more of a set | |
1591 | of string constants or arrays of known size, determine | |
1592 | the range of their known or possible lengths and use it | |
1593 | conservatively as the bound for the unbounded function, | |
1594 | and to adjust the range of the bound of the bounded ones. */ | |
2c8861b7 JJ |
1595 | for (unsigned argno = 0; |
1596 | argno < MIN (nargs, 2) | |
5d6655eb | 1597 | && !(maxlen && TREE_CODE (maxlen) == INTEGER_CST); argno++) |
d677a8b6 MS |
1598 | { |
1599 | tree arg = CALL_EXPR_ARG (exp, argno); | |
1600 | if (!get_attr_nonstring_decl (arg)) | |
5d6655eb MS |
1601 | { |
1602 | c_strlen_data lendata = { }; | |
1603 | get_range_strlen (arg, &lendata, /* eltsize = */ 1); | |
1604 | maxlen = lendata.maxbound; | |
1605 | } | |
d677a8b6 MS |
1606 | } |
1607 | } | |
1608 | /* Fall through. */ | |
1609 | ||
4252ccd7 | 1610 | case BUILT_IN_STRNCAT: |
d677a8b6 | 1611 | case BUILT_IN_STPNCPY: |
6a33d0ff | 1612 | case BUILT_IN_STRNCPY: |
2c8861b7 | 1613 | if (nargs > 2) |
781ff3d8 MS |
1614 | bound = CALL_EXPR_ARG (exp, 2); |
1615 | break; | |
6a33d0ff MS |
1616 | |
1617 | case BUILT_IN_STRNDUP: | |
2c8861b7 | 1618 | if (nargs > 1) |
781ff3d8 MS |
1619 | bound = CALL_EXPR_ARG (exp, 1); |
1620 | break; | |
1621 | ||
1622 | case BUILT_IN_STRNLEN: | |
2438cb6a | 1623 | { |
781ff3d8 MS |
1624 | tree arg = CALL_EXPR_ARG (exp, 0); |
1625 | if (!get_attr_nonstring_decl (arg)) | |
5d6655eb MS |
1626 | { |
1627 | c_strlen_data lendata = { }; | |
1628 | get_range_strlen (arg, &lendata, /* eltsize = */ 1); | |
1629 | maxlen = lendata.maxbound; | |
1630 | } | |
2c8861b7 | 1631 | if (nargs > 1) |
781ff3d8 | 1632 | bound = CALL_EXPR_ARG (exp, 1); |
2438cb6a MS |
1633 | break; |
1634 | } | |
6a33d0ff MS |
1635 | |
1636 | default: | |
1637 | break; | |
1638 | } | |
1639 | ||
1640 | /* Determine the range of the bound argument (if specified). */ | |
1641 | tree bndrng[2] = { NULL_TREE, NULL_TREE }; | |
1642 | if (bound) | |
36537a1c MS |
1643 | { |
1644 | STRIP_NOPS (bound); | |
1645 | get_size_range (bound, bndrng); | |
1646 | } | |
6a33d0ff | 1647 | |
781ff3d8 MS |
1648 | location_t loc = EXPR_LOCATION (exp); |
1649 | ||
1650 | if (bndrng[0]) | |
1651 | { | |
1652 | /* Diagnose excessive bound prior the adjustment below and | |
1653 | regardless of attribute nonstring. */ | |
1654 | tree maxobjsize = max_object_size (); | |
1655 | if (tree_int_cst_lt (maxobjsize, bndrng[0])) | |
1656 | { | |
1657 | if (tree_int_cst_equal (bndrng[0], bndrng[1])) | |
1658 | warning_at (loc, OPT_Wstringop_overflow_, | |
1659 | "%K%qD specified bound %E " | |
1660 | "exceeds maximum object size %E", | |
1661 | exp, fndecl, bndrng[0], maxobjsize); | |
1662 | else | |
1663 | warning_at (loc, OPT_Wstringop_overflow_, | |
1664 | "%K%qD specified bound [%E, %E] " | |
1665 | "exceeds maximum object size %E", | |
1666 | exp, fndecl, bndrng[0], bndrng[1], maxobjsize); | |
1667 | return; | |
1668 | } | |
1669 | } | |
1670 | ||
5d6655eb | 1671 | if (maxlen && !integer_all_onesp (maxlen)) |
d677a8b6 MS |
1672 | { |
1673 | /* Add one for the nul. */ | |
5d6655eb MS |
1674 | maxlen = const_binop (PLUS_EXPR, TREE_TYPE (maxlen), maxlen, |
1675 | size_one_node); | |
d677a8b6 MS |
1676 | |
1677 | if (!bndrng[0]) | |
1678 | { | |
1679 | /* Conservatively use the upper bound of the lengths for | |
1680 | both the lower and the upper bound of the operation. */ | |
5d6655eb MS |
1681 | bndrng[0] = maxlen; |
1682 | bndrng[1] = maxlen; | |
d677a8b6 MS |
1683 | bound = void_type_node; |
1684 | } | |
df161fc2 | 1685 | else if (maxlen) |
d677a8b6 | 1686 | { |
39c71bc3 | 1687 | /* Replace the bound on the operation with the upper bound |
d677a8b6 | 1688 | of the length of the string if the latter is smaller. */ |
5d6655eb MS |
1689 | if (tree_int_cst_lt (maxlen, bndrng[0])) |
1690 | bndrng[0] = maxlen; | |
1691 | else if (tree_int_cst_lt (maxlen, bndrng[1])) | |
1692 | bndrng[1] = maxlen; | |
d677a8b6 MS |
1693 | } |
1694 | } | |
1695 | ||
6a33d0ff MS |
1696 | /* Iterate over the built-in function's formal arguments and check |
1697 | each const char* against the actual argument. If the actual | |
1698 | argument is declared attribute non-string issue a warning unless | |
1699 | the argument's maximum length is bounded. */ | |
1700 | function_args_iterator it; | |
1701 | function_args_iter_init (&it, TREE_TYPE (fndecl)); | |
1702 | ||
1703 | for (unsigned argno = 0; ; ++argno, function_args_iter_next (&it)) | |
1704 | { | |
2438cb6a MS |
1705 | /* Avoid iterating past the declared argument in a call |
1706 | to function declared without a prototype. */ | |
1707 | if (argno >= nargs) | |
1708 | break; | |
1709 | ||
6a33d0ff MS |
1710 | tree argtype = function_args_iter_cond (&it); |
1711 | if (!argtype) | |
1712 | break; | |
1713 | ||
1714 | if (TREE_CODE (argtype) != POINTER_TYPE) | |
1715 | continue; | |
1716 | ||
1717 | argtype = TREE_TYPE (argtype); | |
1718 | ||
1719 | if (TREE_CODE (argtype) != INTEGER_TYPE | |
1720 | || !TYPE_READONLY (argtype)) | |
1721 | continue; | |
1722 | ||
1723 | argtype = TYPE_MAIN_VARIANT (argtype); | |
1724 | if (argtype != char_type_node) | |
1725 | continue; | |
1726 | ||
1727 | tree callarg = CALL_EXPR_ARG (exp, argno); | |
1728 | if (TREE_CODE (callarg) == ADDR_EXPR) | |
1729 | callarg = TREE_OPERAND (callarg, 0); | |
1730 | ||
1731 | /* See if the destination is declared with attribute "nonstring". */ | |
1732 | tree decl = get_attr_nonstring_decl (callarg); | |
1733 | if (!decl) | |
1734 | continue; | |
1735 | ||
d677a8b6 | 1736 | /* The maximum number of array elements accessed. */ |
6a33d0ff | 1737 | offset_int wibnd = 0; |
4252ccd7 MS |
1738 | |
1739 | if (argno && fncode == BUILT_IN_STRNCAT) | |
1740 | { | |
1741 | /* See if the bound in strncat is derived from the length | |
1742 | of the strlen of the destination (as it's expected to be). | |
1743 | If so, reset BOUND and FNCODE to trigger a warning. */ | |
1744 | tree dstarg = CALL_EXPR_ARG (exp, 0); | |
1745 | if (is_strlen_related_p (dstarg, bound)) | |
1746 | { | |
1747 | /* The bound applies to the destination, not to the source, | |
1748 | so reset these to trigger a warning without mentioning | |
1749 | the bound. */ | |
1750 | bound = NULL; | |
1751 | fncode = 0; | |
1752 | } | |
1753 | else if (bndrng[1]) | |
1754 | /* Use the upper bound of the range for strncat. */ | |
1755 | wibnd = wi::to_offset (bndrng[1]); | |
1756 | } | |
1757 | else if (bndrng[0]) | |
1758 | /* Use the lower bound of the range for functions other than | |
1759 | strncat. */ | |
6a33d0ff MS |
1760 | wibnd = wi::to_offset (bndrng[0]); |
1761 | ||
4252ccd7 | 1762 | /* Determine the size of the argument array if it is one. */ |
6a33d0ff | 1763 | offset_int asize = wibnd; |
4252ccd7 MS |
1764 | bool known_size = false; |
1765 | tree type = TREE_TYPE (decl); | |
6a33d0ff | 1766 | |
d677a8b6 MS |
1767 | /* Determine the array size. For arrays of unknown bound and |
1768 | pointers reset BOUND to trigger the appropriate warning. */ | |
6a33d0ff | 1769 | if (TREE_CODE (type) == ARRAY_TYPE) |
d677a8b6 MS |
1770 | { |
1771 | if (tree arrbnd = TYPE_DOMAIN (type)) | |
1772 | { | |
1773 | if ((arrbnd = TYPE_MAX_VALUE (arrbnd))) | |
4252ccd7 MS |
1774 | { |
1775 | asize = wi::to_offset (arrbnd) + 1; | |
1776 | known_size = true; | |
1777 | } | |
d677a8b6 MS |
1778 | } |
1779 | else if (bound == void_type_node) | |
1780 | bound = NULL_TREE; | |
1781 | } | |
1782 | else if (bound == void_type_node) | |
1783 | bound = NULL_TREE; | |
6a33d0ff | 1784 | |
4252ccd7 MS |
1785 | /* In a call to strncat with a bound in a range whose lower but |
1786 | not upper bound is less than the array size, reset ASIZE to | |
1787 | be the same as the bound and the other variable to trigger | |
1788 | the apprpriate warning below. */ | |
1789 | if (fncode == BUILT_IN_STRNCAT | |
1790 | && bndrng[0] != bndrng[1] | |
1791 | && wi::ltu_p (wi::to_offset (bndrng[0]), asize) | |
1792 | && (!known_size | |
1793 | || wi::ltu_p (asize, wibnd))) | |
1794 | { | |
1795 | asize = wibnd; | |
1796 | bound = NULL_TREE; | |
1797 | fncode = 0; | |
1798 | } | |
1799 | ||
6a33d0ff MS |
1800 | bool warned = false; |
1801 | ||
097f82ec | 1802 | auto_diagnostic_group d; |
6a33d0ff | 1803 | if (wi::ltu_p (asize, wibnd)) |
4252ccd7 MS |
1804 | { |
1805 | if (bndrng[0] == bndrng[1]) | |
1806 | warned = warning_at (loc, OPT_Wstringop_overflow_, | |
1807 | "%qD argument %i declared attribute " | |
1808 | "%<nonstring%> is smaller than the specified " | |
1809 | "bound %wu", | |
1810 | fndecl, argno + 1, wibnd.to_uhwi ()); | |
1811 | else if (wi::ltu_p (asize, wi::to_offset (bndrng[0]))) | |
1812 | warned = warning_at (loc, OPT_Wstringop_overflow_, | |
1813 | "%qD argument %i declared attribute " | |
1814 | "%<nonstring%> is smaller than " | |
1815 | "the specified bound [%E, %E]", | |
1816 | fndecl, argno + 1, bndrng[0], bndrng[1]); | |
1817 | else | |
1818 | warned = warning_at (loc, OPT_Wstringop_overflow_, | |
1819 | "%qD argument %i declared attribute " | |
1820 | "%<nonstring%> may be smaller than " | |
1821 | "the specified bound [%E, %E]", | |
1822 | fndecl, argno + 1, bndrng[0], bndrng[1]); | |
1823 | } | |
1824 | else if (fncode == BUILT_IN_STRNCAT) | |
1825 | ; /* Avoid warning for calls to strncat() when the bound | |
1826 | is equal to the size of the non-string argument. */ | |
6a33d0ff MS |
1827 | else if (!bound) |
1828 | warned = warning_at (loc, OPT_Wstringop_overflow_, | |
1829 | "%qD argument %i declared attribute %<nonstring%>", | |
1830 | fndecl, argno + 1); | |
1831 | ||
1832 | if (warned) | |
1833 | inform (DECL_SOURCE_LOCATION (decl), | |
1834 | "argument %qD declared here", decl); | |
1835 | } | |
1836 | } | |
1837 | ||
9a385c2d DM |
1838 | /* Issue an error if CALL_EXPR was flagged as requiring |
1839 | tall-call optimization. */ | |
1840 | ||
1841 | static void | |
1842 | maybe_complain_about_tail_call (tree call_expr, const char *reason) | |
1843 | { | |
1844 | gcc_assert (TREE_CODE (call_expr) == CALL_EXPR); | |
1845 | if (!CALL_EXPR_MUST_TAIL_CALL (call_expr)) | |
1846 | return; | |
1847 | ||
1848 | error_at (EXPR_LOCATION (call_expr), "cannot tail-call: %s", reason); | |
1849 | } | |
1850 | ||
d7cdf113 | 1851 | /* Fill in ARGS_SIZE and ARGS array based on the parameters found in |
b8698a0f | 1852 | CALL_EXPR EXP. |
d7cdf113 JL |
1853 | |
1854 | NUM_ACTUALS is the total number of parameters. | |
1855 | ||
1856 | N_NAMED_ARGS is the total number of named arguments. | |
1857 | ||
078a18a4 SL |
1858 | STRUCT_VALUE_ADDR_VALUE is the implicit argument for a struct return |
1859 | value, or null. | |
1860 | ||
d7cdf113 JL |
1861 | FNDECL is the tree code for the target of this call (if known) |
1862 | ||
1863 | ARGS_SO_FAR holds state needed by the target to know where to place | |
1864 | the next argument. | |
1865 | ||
1866 | REG_PARM_STACK_SPACE is the number of bytes of stack space reserved | |
1867 | for arguments which are passed in registers. | |
1868 | ||
1869 | OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level | |
1870 | and may be modified by this routine. | |
1871 | ||
f2d33f13 | 1872 | OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer |
026c3cfd | 1873 | flags which may be modified by this routine. |
dd292d0a | 1874 | |
6de9cd9a DN |
1875 | MAY_TAILCALL is cleared if we encounter an invisible pass-by-reference |
1876 | that requires allocation of stack space. | |
1877 | ||
dd292d0a MM |
1878 | CALL_FROM_THUNK_P is true if this call is the jump from a thunk to |
1879 | the thunked-to function. */ | |
d7cdf113 JL |
1880 | |
1881 | static void | |
d329e058 AJ |
1882 | initialize_argument_information (int num_actuals ATTRIBUTE_UNUSED, |
1883 | struct arg_data *args, | |
1884 | struct args_size *args_size, | |
1885 | int n_named_args ATTRIBUTE_UNUSED, | |
078a18a4 | 1886 | tree exp, tree struct_value_addr_value, |
45769134 | 1887 | tree fndecl, tree fntype, |
d5cc9181 | 1888 | cumulative_args_t args_so_far, |
d329e058 | 1889 | int reg_parm_stack_space, |
a20c5714 RS |
1890 | rtx *old_stack_level, |
1891 | poly_int64_pod *old_pending_adj, | |
dd292d0a | 1892 | int *must_preallocate, int *ecf_flags, |
6de9cd9a | 1893 | bool *may_tailcall, bool call_from_thunk_p) |
d7cdf113 | 1894 | { |
d5cc9181 | 1895 | CUMULATIVE_ARGS *args_so_far_pnt = get_cumulative_args (args_so_far); |
db3927fb | 1896 | location_t loc = EXPR_LOCATION (exp); |
d7cdf113 JL |
1897 | |
1898 | /* Count arg position in order args appear. */ | |
1899 | int argpos; | |
1900 | ||
1901 | int i; | |
f725a3ec | 1902 | |
d7cdf113 JL |
1903 | args_size->constant = 0; |
1904 | args_size->var = 0; | |
1905 | ||
d5e254e1 IE |
1906 | bitmap_obstack_initialize (NULL); |
1907 | ||
d7cdf113 | 1908 | /* In this loop, we consider args in the order they are written. |
3d9684ae | 1909 | We fill up ARGS from the back. */ |
d7cdf113 | 1910 | |
3d9684ae | 1911 | i = num_actuals - 1; |
078a18a4 | 1912 | { |
31db0fe0 | 1913 | int j = i; |
078a18a4 SL |
1914 | call_expr_arg_iterator iter; |
1915 | tree arg; | |
d5e254e1 | 1916 | bitmap slots = NULL; |
078a18a4 SL |
1917 | |
1918 | if (struct_value_addr_value) | |
1919 | { | |
1920 | args[j].tree_value = struct_value_addr_value; | |
3d9684ae | 1921 | j--; |
078a18a4 | 1922 | } |
afc610db | 1923 | argpos = 0; |
078a18a4 SL |
1924 | FOR_EACH_CALL_EXPR_ARG (arg, iter, exp) |
1925 | { | |
1926 | tree argtype = TREE_TYPE (arg); | |
d5e254e1 | 1927 | |
078a18a4 SL |
1928 | if (targetm.calls.split_complex_arg |
1929 | && argtype | |
1930 | && TREE_CODE (argtype) == COMPLEX_TYPE | |
1931 | && targetm.calls.split_complex_arg (argtype)) | |
1932 | { | |
1933 | tree subtype = TREE_TYPE (argtype); | |
078a18a4 | 1934 | args[j].tree_value = build1 (REALPART_EXPR, subtype, arg); |
3d9684ae | 1935 | j--; |
078a18a4 SL |
1936 | args[j].tree_value = build1 (IMAGPART_EXPR, subtype, arg); |
1937 | } | |
1938 | else | |
1939 | args[j].tree_value = arg; | |
3d9684ae | 1940 | j--; |
afc610db | 1941 | argpos++; |
078a18a4 | 1942 | } |
d5e254e1 IE |
1943 | |
1944 | if (slots) | |
1945 | BITMAP_FREE (slots); | |
078a18a4 SL |
1946 | } |
1947 | ||
d5e254e1 IE |
1948 | bitmap_obstack_release (NULL); |
1949 | ||
302db8ba MS |
1950 | /* Extract attribute alloc_size from the type of the called expression |
1951 | (which could be a function or a function pointer) and if set, store | |
1952 | the indices of the corresponding arguments in ALLOC_IDX, and then | |
1953 | the actual argument(s) at those indices in ALLOC_ARGS. */ | |
8bd9f164 | 1954 | int alloc_idx[2] = { -1, -1 }; |
302db8ba MS |
1955 | if (tree alloc_size = lookup_attribute ("alloc_size", |
1956 | TYPE_ATTRIBUTES (fntype))) | |
8bd9f164 MS |
1957 | { |
1958 | tree args = TREE_VALUE (alloc_size); | |
1959 | alloc_idx[0] = TREE_INT_CST_LOW (TREE_VALUE (args)) - 1; | |
1960 | if (TREE_CHAIN (args)) | |
1961 | alloc_idx[1] = TREE_INT_CST_LOW (TREE_VALUE (TREE_CHAIN (args))) - 1; | |
1962 | } | |
1963 | ||
1964 | /* Array for up to the two attribute alloc_size arguments. */ | |
1965 | tree alloc_args[] = { NULL_TREE, NULL_TREE }; | |
1966 | ||
d7cdf113 | 1967 | /* I counts args in order (to be) pushed; ARGPOS counts in order written. */ |
3d9684ae | 1968 | for (argpos = 0; argpos < num_actuals; i--, argpos++) |
d7cdf113 | 1969 | { |
078a18a4 | 1970 | tree type = TREE_TYPE (args[i].tree_value); |
d7cdf113 | 1971 | int unsignedp; |
ef4bddc2 | 1972 | machine_mode mode; |
d7cdf113 | 1973 | |
d7cdf113 | 1974 | /* Replace erroneous argument with constant zero. */ |
d0f062fb | 1975 | if (type == error_mark_node || !COMPLETE_TYPE_P (type)) |
d7cdf113 JL |
1976 | args[i].tree_value = integer_zero_node, type = integer_type_node; |
1977 | ||
ebf0bf7f JJ |
1978 | /* If TYPE is a transparent union or record, pass things the way |
1979 | we would pass the first field of the union or record. We have | |
1980 | already verified that the modes are the same. */ | |
1981 | if ((TREE_CODE (type) == UNION_TYPE || TREE_CODE (type) == RECORD_TYPE) | |
1982 | && TYPE_TRANSPARENT_AGGR (type)) | |
1983 | type = TREE_TYPE (first_field (type)); | |
d7cdf113 JL |
1984 | |
1985 | /* Decide where to pass this arg. | |
1986 | ||
1987 | args[i].reg is nonzero if all or part is passed in registers. | |
1988 | ||
1989 | args[i].partial is nonzero if part but not all is passed in registers, | |
78a52f11 | 1990 | and the exact value says how many bytes are passed in registers. |
d7cdf113 JL |
1991 | |
1992 | args[i].pass_on_stack is nonzero if the argument must at least be | |
1993 | computed on the stack. It may then be loaded back into registers | |
1994 | if args[i].reg is nonzero. | |
1995 | ||
1996 | These decisions are driven by the FUNCTION_... macros and must agree | |
1997 | with those made by function.c. */ | |
1998 | ||
1999 | /* See if this argument should be passed by invisible reference. */ | |
d5cc9181 | 2000 | if (pass_by_reference (args_so_far_pnt, TYPE_MODE (type), |
0976078c | 2001 | type, argpos < n_named_args)) |
d7cdf113 | 2002 | { |
9969aaf6 | 2003 | bool callee_copies; |
d6e1acf6 | 2004 | tree base = NULL_TREE; |
9969aaf6 RH |
2005 | |
2006 | callee_copies | |
d5cc9181 | 2007 | = reference_callee_copied (args_so_far_pnt, TYPE_MODE (type), |
6cdd5672 | 2008 | type, argpos < n_named_args); |
9969aaf6 RH |
2009 | |
2010 | /* If we're compiling a thunk, pass through invisible references | |
2011 | instead of making a copy. */ | |
dd292d0a | 2012 | if (call_from_thunk_p |
9969aaf6 RH |
2013 | || (callee_copies |
2014 | && !TREE_ADDRESSABLE (type) | |
2015 | && (base = get_base_address (args[i].tree_value)) | |
9c3d55b4 | 2016 | && TREE_CODE (base) != SSA_NAME |
9969aaf6 | 2017 | && (!DECL_P (base) || MEM_P (DECL_RTL (base))))) |
d7cdf113 | 2018 | { |
006e317a JH |
2019 | /* We may have turned the parameter value into an SSA name. |
2020 | Go back to the original parameter so we can take the | |
2021 | address. */ | |
2022 | if (TREE_CODE (args[i].tree_value) == SSA_NAME) | |
2023 | { | |
2024 | gcc_assert (SSA_NAME_IS_DEFAULT_DEF (args[i].tree_value)); | |
2025 | args[i].tree_value = SSA_NAME_VAR (args[i].tree_value); | |
2026 | gcc_assert (TREE_CODE (args[i].tree_value) == PARM_DECL); | |
2027 | } | |
fe8dd12e JH |
2028 | /* Argument setup code may have copied the value to register. We |
2029 | revert that optimization now because the tail call code must | |
2030 | use the original location. */ | |
2031 | if (TREE_CODE (args[i].tree_value) == PARM_DECL | |
2032 | && !MEM_P (DECL_RTL (args[i].tree_value)) | |
2033 | && DECL_INCOMING_RTL (args[i].tree_value) | |
2034 | && MEM_P (DECL_INCOMING_RTL (args[i].tree_value))) | |
2035 | set_decl_rtl (args[i].tree_value, | |
2036 | DECL_INCOMING_RTL (args[i].tree_value)); | |
2037 | ||
c4b9a87e ER |
2038 | mark_addressable (args[i].tree_value); |
2039 | ||
9969aaf6 RH |
2040 | /* We can't use sibcalls if a callee-copied argument is |
2041 | stored in the current function's frame. */ | |
2042 | if (!call_from_thunk_p && DECL_P (base) && !TREE_STATIC (base)) | |
9a385c2d DM |
2043 | { |
2044 | *may_tailcall = false; | |
2045 | maybe_complain_about_tail_call (exp, | |
2046 | "a callee-copied argument is" | |
cefc0906 | 2047 | " stored in the current" |
9a385c2d DM |
2048 | " function's frame"); |
2049 | } | |
9fd47435 | 2050 | |
db3927fb AH |
2051 | args[i].tree_value = build_fold_addr_expr_loc (loc, |
2052 | args[i].tree_value); | |
9969aaf6 RH |
2053 | type = TREE_TYPE (args[i].tree_value); |
2054 | ||
becfd6e5 KZ |
2055 | if (*ecf_flags & ECF_CONST) |
2056 | *ecf_flags &= ~(ECF_CONST | ECF_LOOPING_CONST_OR_PURE); | |
f21add07 | 2057 | } |
d7cdf113 JL |
2058 | else |
2059 | { | |
2060 | /* We make a copy of the object and pass the address to the | |
2061 | function being called. */ | |
2062 | rtx copy; | |
2063 | ||
d0f062fb | 2064 | if (!COMPLETE_TYPE_P (type) |
b38f3813 EB |
2065 | || TREE_CODE (TYPE_SIZE_UNIT (type)) != INTEGER_CST |
2066 | || (flag_stack_check == GENERIC_STACK_CHECK | |
2067 | && compare_tree_int (TYPE_SIZE_UNIT (type), | |
2068 | STACK_CHECK_MAX_VAR_SIZE) > 0)) | |
d7cdf113 JL |
2069 | { |
2070 | /* This is a variable-sized object. Make space on the stack | |
2071 | for it. */ | |
078a18a4 | 2072 | rtx size_rtx = expr_size (args[i].tree_value); |
d7cdf113 JL |
2073 | |
2074 | if (*old_stack_level == 0) | |
2075 | { | |
9eac0f2a | 2076 | emit_stack_save (SAVE_BLOCK, old_stack_level); |
d7cdf113 JL |
2077 | *old_pending_adj = pending_stack_adjust; |
2078 | pending_stack_adjust = 0; | |
2079 | } | |
2080 | ||
d3c12306 EB |
2081 | /* We can pass TRUE as the 4th argument because we just |
2082 | saved the stack pointer and will restore it right after | |
2083 | the call. */ | |
3a42502d RH |
2084 | copy = allocate_dynamic_stack_space (size_rtx, |
2085 | TYPE_ALIGN (type), | |
2086 | TYPE_ALIGN (type), | |
9e878cf1 EB |
2087 | max_int_size_in_bytes |
2088 | (type), | |
3a42502d RH |
2089 | true); |
2090 | copy = gen_rtx_MEM (BLKmode, copy); | |
3bdf5ad1 | 2091 | set_mem_attributes (copy, type, 1); |
d7cdf113 JL |
2092 | } |
2093 | else | |
9474e8ab | 2094 | copy = assign_temp (type, 1, 0); |
d7cdf113 | 2095 | |
ee45a32d | 2096 | store_expr (args[i].tree_value, copy, 0, false, false); |
d7cdf113 | 2097 | |
becfd6e5 KZ |
2098 | /* Just change the const function to pure and then let |
2099 | the next test clear the pure based on | |
2100 | callee_copies. */ | |
2101 | if (*ecf_flags & ECF_CONST) | |
2102 | { | |
2103 | *ecf_flags &= ~ECF_CONST; | |
2104 | *ecf_flags |= ECF_PURE; | |
2105 | } | |
2106 | ||
2107 | if (!callee_copies && *ecf_flags & ECF_PURE) | |
2108 | *ecf_flags &= ~(ECF_PURE | ECF_LOOPING_CONST_OR_PURE); | |
9969aaf6 RH |
2109 | |
2110 | args[i].tree_value | |
db3927fb | 2111 | = build_fold_addr_expr_loc (loc, make_tree (type, copy)); |
9969aaf6 | 2112 | type = TREE_TYPE (args[i].tree_value); |
6de9cd9a | 2113 | *may_tailcall = false; |
9a385c2d DM |
2114 | maybe_complain_about_tail_call (exp, |
2115 | "argument must be passed" | |
2116 | " by copying"); | |
d7cdf113 JL |
2117 | } |
2118 | } | |
2119 | ||
8df83eae | 2120 | unsignedp = TYPE_UNSIGNED (type); |
cde0f3fd PB |
2121 | mode = promote_function_mode (type, TYPE_MODE (type), &unsignedp, |
2122 | fndecl ? TREE_TYPE (fndecl) : fntype, 0); | |
d7cdf113 JL |
2123 | |
2124 | args[i].unsignedp = unsignedp; | |
2125 | args[i].mode = mode; | |
7d167afd | 2126 | |
974aedcc MP |
2127 | targetm.calls.warn_parameter_passing_abi (args_so_far, type); |
2128 | ||
3c07301f NF |
2129 | args[i].reg = targetm.calls.function_arg (args_so_far, mode, type, |
2130 | argpos < n_named_args); | |
2131 | ||
d5e254e1 | 2132 | if (args[i].reg && CONST_INT_P (args[i].reg)) |
dbcdd561 | 2133 | args[i].reg = NULL; |
d5e254e1 | 2134 | |
7d167afd JJ |
2135 | /* If this is a sibling call and the machine has register windows, the |
2136 | register window has to be unwinded before calling the routine, so | |
2137 | arguments have to go into the incoming registers. */ | |
3c07301f NF |
2138 | if (targetm.calls.function_incoming_arg != targetm.calls.function_arg) |
2139 | args[i].tail_call_reg | |
2140 | = targetm.calls.function_incoming_arg (args_so_far, mode, type, | |
2141 | argpos < n_named_args); | |
2142 | else | |
2143 | args[i].tail_call_reg = args[i].reg; | |
7d167afd | 2144 | |
d7cdf113 JL |
2145 | if (args[i].reg) |
2146 | args[i].partial | |
78a52f11 RH |
2147 | = targetm.calls.arg_partial_bytes (args_so_far, mode, type, |
2148 | argpos < n_named_args); | |
d7cdf113 | 2149 | |
fe984136 | 2150 | args[i].pass_on_stack = targetm.calls.must_pass_in_stack (mode, type); |
d7cdf113 JL |
2151 | |
2152 | /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]), | |
2153 | it means that we are to pass this arg in the register(s) designated | |
2154 | by the PARALLEL, but also to pass it in the stack. */ | |
2155 | if (args[i].reg && GET_CODE (args[i].reg) == PARALLEL | |
2156 | && XEXP (XVECEXP (args[i].reg, 0, 0), 0) == 0) | |
2157 | args[i].pass_on_stack = 1; | |
2158 | ||
2159 | /* If this is an addressable type, we must preallocate the stack | |
2160 | since we must evaluate the object into its final location. | |
2161 | ||
2162 | If this is to be passed in both registers and the stack, it is simpler | |
2163 | to preallocate. */ | |
2164 | if (TREE_ADDRESSABLE (type) | |
2165 | || (args[i].pass_on_stack && args[i].reg != 0)) | |
2166 | *must_preallocate = 1; | |
2167 | ||
d7cdf113 | 2168 | /* Compute the stack-size of this argument. */ |
31db0fe0 | 2169 | if (args[i].reg == 0 || args[i].partial != 0 |
d5e254e1 IE |
2170 | || reg_parm_stack_space > 0 |
2171 | || args[i].pass_on_stack) | |
d7cdf113 JL |
2172 | locate_and_pad_parm (mode, type, |
2173 | #ifdef STACK_PARMS_IN_REG_PARM_AREA | |
2174 | 1, | |
2175 | #else | |
2176 | args[i].reg != 0, | |
2177 | #endif | |
2e4ceca5 | 2178 | reg_parm_stack_space, |
e7949876 AM |
2179 | args[i].pass_on_stack ? 0 : args[i].partial, |
2180 | fndecl, args_size, &args[i].locate); | |
648bb159 RS |
2181 | #ifdef BLOCK_REG_PADDING |
2182 | else | |
2183 | /* The argument is passed entirely in registers. See at which | |
2184 | end it should be padded. */ | |
2185 | args[i].locate.where_pad = | |
2186 | BLOCK_REG_PADDING (mode, type, | |
2187 | int_size_in_bytes (type) <= UNITS_PER_WORD); | |
2188 | #endif | |
f725a3ec | 2189 | |
d7cdf113 JL |
2190 | /* Update ARGS_SIZE, the total stack space for args so far. */ |
2191 | ||
e7949876 AM |
2192 | args_size->constant += args[i].locate.size.constant; |
2193 | if (args[i].locate.size.var) | |
2194 | ADD_PARM_SIZE (*args_size, args[i].locate.size.var); | |
d7cdf113 JL |
2195 | |
2196 | /* Increment ARGS_SO_FAR, which has info about which arg-registers | |
2197 | have been used, etc. */ | |
2198 | ||
3c07301f NF |
2199 | targetm.calls.function_arg_advance (args_so_far, TYPE_MODE (type), |
2200 | type, argpos < n_named_args); | |
8bd9f164 MS |
2201 | |
2202 | /* Store argument values for functions decorated with attribute | |
2203 | alloc_size. */ | |
2204 | if (argpos == alloc_idx[0]) | |
2205 | alloc_args[0] = args[i].tree_value; | |
2206 | else if (argpos == alloc_idx[1]) | |
2207 | alloc_args[1] = args[i].tree_value; | |
2208 | } | |
2209 | ||
2210 | if (alloc_args[0]) | |
2211 | { | |
2212 | /* Check the arguments of functions decorated with attribute | |
2213 | alloc_size. */ | |
2214 | maybe_warn_alloc_args_overflow (fndecl, exp, alloc_args, alloc_idx); | |
d7cdf113 | 2215 | } |
6a33d0ff MS |
2216 | |
2217 | /* Detect passing non-string arguments to functions expecting | |
2218 | nul-terminated strings. */ | |
2219 | maybe_warn_nonstring_arg (fndecl, exp); | |
d7cdf113 JL |
2220 | } |
2221 | ||
599f37b6 JL |
2222 | /* Update ARGS_SIZE to contain the total size for the argument block. |
2223 | Return the original constant component of the argument block's size. | |
2224 | ||
2225 | REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved | |
2226 | for arguments passed in registers. */ | |
2227 | ||
a20c5714 | 2228 | static poly_int64 |
d329e058 AJ |
2229 | compute_argument_block_size (int reg_parm_stack_space, |
2230 | struct args_size *args_size, | |
033df0b9 | 2231 | tree fndecl ATTRIBUTE_UNUSED, |
5d059ed9 | 2232 | tree fntype ATTRIBUTE_UNUSED, |
d329e058 | 2233 | int preferred_stack_boundary ATTRIBUTE_UNUSED) |
599f37b6 | 2234 | { |
a20c5714 | 2235 | poly_int64 unadjusted_args_size = args_size->constant; |
599f37b6 | 2236 | |
f73ad30e JH |
2237 | /* For accumulate outgoing args mode we don't need to align, since the frame |
2238 | will be already aligned. Align to STACK_BOUNDARY in order to prevent | |
f5143c46 | 2239 | backends from generating misaligned frame sizes. */ |
f73ad30e JH |
2240 | if (ACCUMULATE_OUTGOING_ARGS && preferred_stack_boundary > STACK_BOUNDARY) |
2241 | preferred_stack_boundary = STACK_BOUNDARY; | |
f73ad30e | 2242 | |
599f37b6 JL |
2243 | /* Compute the actual size of the argument block required. The variable |
2244 | and constant sizes must be combined, the size may have to be rounded, | |
2245 | and there may be a minimum required size. */ | |
2246 | ||
2247 | if (args_size->var) | |
2248 | { | |
2249 | args_size->var = ARGS_SIZE_TREE (*args_size); | |
2250 | args_size->constant = 0; | |
2251 | ||
c2f8b491 JH |
2252 | preferred_stack_boundary /= BITS_PER_UNIT; |
2253 | if (preferred_stack_boundary > 1) | |
1503a7ec JH |
2254 | { |
2255 | /* We don't handle this case yet. To handle it correctly we have | |
f5143c46 | 2256 | to add the delta, round and subtract the delta. |
1503a7ec | 2257 | Currently no machine description requires this support. */ |
a20c5714 RS |
2258 | gcc_assert (multiple_p (stack_pointer_delta, |
2259 | preferred_stack_boundary)); | |
1503a7ec JH |
2260 | args_size->var = round_up (args_size->var, preferred_stack_boundary); |
2261 | } | |
599f37b6 JL |
2262 | |
2263 | if (reg_parm_stack_space > 0) | |
2264 | { | |
2265 | args_size->var | |
2266 | = size_binop (MAX_EXPR, args_size->var, | |
fed3cef0 | 2267 | ssize_int (reg_parm_stack_space)); |
599f37b6 | 2268 | |
599f37b6 JL |
2269 | /* The area corresponding to register parameters is not to count in |
2270 | the size of the block we need. So make the adjustment. */ | |
5d059ed9 | 2271 | if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl)))) |
ac294f0b KT |
2272 | args_size->var |
2273 | = size_binop (MINUS_EXPR, args_size->var, | |
2274 | ssize_int (reg_parm_stack_space)); | |
599f37b6 JL |
2275 | } |
2276 | } | |
2277 | else | |
2278 | { | |
c2f8b491 | 2279 | preferred_stack_boundary /= BITS_PER_UNIT; |
0a1c58a2 JL |
2280 | if (preferred_stack_boundary < 1) |
2281 | preferred_stack_boundary = 1; | |
a20c5714 RS |
2282 | args_size->constant = (aligned_upper_bound (args_size->constant |
2283 | + stack_pointer_delta, | |
2284 | preferred_stack_boundary) | |
1503a7ec | 2285 | - stack_pointer_delta); |
599f37b6 | 2286 | |
a20c5714 RS |
2287 | args_size->constant = upper_bound (args_size->constant, |
2288 | reg_parm_stack_space); | |
599f37b6 | 2289 | |
5d059ed9 | 2290 | if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl)))) |
ac294f0b | 2291 | args_size->constant -= reg_parm_stack_space; |
599f37b6 JL |
2292 | } |
2293 | return unadjusted_args_size; | |
2294 | } | |
2295 | ||
19832c77 | 2296 | /* Precompute parameters as needed for a function call. |
cc0b1adc | 2297 | |
f2d33f13 | 2298 | FLAGS is mask of ECF_* constants. |
cc0b1adc | 2299 | |
cc0b1adc JL |
2300 | NUM_ACTUALS is the number of arguments. |
2301 | ||
f725a3ec KH |
2302 | ARGS is an array containing information for each argument; this |
2303 | routine fills in the INITIAL_VALUE and VALUE fields for each | |
2304 | precomputed argument. */ | |
cc0b1adc JL |
2305 | |
2306 | static void | |
84b8030f | 2307 | precompute_arguments (int num_actuals, struct arg_data *args) |
cc0b1adc JL |
2308 | { |
2309 | int i; | |
2310 | ||
3638733b | 2311 | /* If this is a libcall, then precompute all arguments so that we do not |
82c82743 | 2312 | get extraneous instructions emitted as part of the libcall sequence. */ |
6a4e56a9 JJ |
2313 | |
2314 | /* If we preallocated the stack space, and some arguments must be passed | |
2315 | on the stack, then we must precompute any parameter which contains a | |
2316 | function call which will store arguments on the stack. | |
2317 | Otherwise, evaluating the parameter may clobber previous parameters | |
2318 | which have already been stored into the stack. (we have code to avoid | |
2319 | such case by saving the outgoing stack arguments, but it results in | |
2320 | worse code) */ | |
84b8030f | 2321 | if (!ACCUMULATE_OUTGOING_ARGS) |
82c82743 | 2322 | return; |
7ae4ad28 | 2323 | |
cc0b1adc | 2324 | for (i = 0; i < num_actuals; i++) |
82c82743 | 2325 | { |
cde0f3fd | 2326 | tree type; |
ef4bddc2 | 2327 | machine_mode mode; |
ddef6bc7 | 2328 | |
84b8030f | 2329 | if (TREE_CODE (args[i].tree_value) != CALL_EXPR) |
6a4e56a9 JJ |
2330 | continue; |
2331 | ||
82c82743 | 2332 | /* If this is an addressable type, we cannot pre-evaluate it. */ |
cde0f3fd PB |
2333 | type = TREE_TYPE (args[i].tree_value); |
2334 | gcc_assert (!TREE_ADDRESSABLE (type)); | |
cc0b1adc | 2335 | |
82c82743 | 2336 | args[i].initial_value = args[i].value |
84217346 | 2337 | = expand_normal (args[i].tree_value); |
cc0b1adc | 2338 | |
cde0f3fd | 2339 | mode = TYPE_MODE (type); |
82c82743 RH |
2340 | if (mode != args[i].mode) |
2341 | { | |
cde0f3fd | 2342 | int unsignedp = args[i].unsignedp; |
82c82743 RH |
2343 | args[i].value |
2344 | = convert_modes (args[i].mode, mode, | |
2345 | args[i].value, args[i].unsignedp); | |
cde0f3fd | 2346 | |
82c82743 RH |
2347 | /* CSE will replace this only if it contains args[i].value |
2348 | pseudo, so convert it down to the declared mode using | |
2349 | a SUBREG. */ | |
2350 | if (REG_P (args[i].value) | |
cde0f3fd PB |
2351 | && GET_MODE_CLASS (args[i].mode) == MODE_INT |
2352 | && promote_mode (type, mode, &unsignedp) != args[i].mode) | |
82c82743 RH |
2353 | { |
2354 | args[i].initial_value | |
2355 | = gen_lowpart_SUBREG (mode, args[i].value); | |
2356 | SUBREG_PROMOTED_VAR_P (args[i].initial_value) = 1; | |
27be0c32 | 2357 | SUBREG_PROMOTED_SET (args[i].initial_value, args[i].unsignedp); |
82c82743 | 2358 | } |
82c82743 RH |
2359 | } |
2360 | } | |
cc0b1adc JL |
2361 | } |
2362 | ||
0f9b3ea6 JL |
2363 | /* Given the current state of MUST_PREALLOCATE and information about |
2364 | arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE, | |
2365 | compute and return the final value for MUST_PREALLOCATE. */ | |
2366 | ||
2367 | static int | |
b8698a0f | 2368 | finalize_must_preallocate (int must_preallocate, int num_actuals, |
5039610b | 2369 | struct arg_data *args, struct args_size *args_size) |
0f9b3ea6 JL |
2370 | { |
2371 | /* See if we have or want to preallocate stack space. | |
2372 | ||
2373 | If we would have to push a partially-in-regs parm | |
2374 | before other stack parms, preallocate stack space instead. | |
2375 | ||
2376 | If the size of some parm is not a multiple of the required stack | |
2377 | alignment, we must preallocate. | |
2378 | ||
2379 | If the total size of arguments that would otherwise create a copy in | |
2380 | a temporary (such as a CALL) is more than half the total argument list | |
2381 | size, preallocation is faster. | |
2382 | ||
2383 | Another reason to preallocate is if we have a machine (like the m88k) | |
2384 | where stack alignment is required to be maintained between every | |
2385 | pair of insns, not just when the call is made. However, we assume here | |
2386 | that such machines either do not have push insns (and hence preallocation | |
2387 | would occur anyway) or the problem is taken care of with | |
2388 | PUSH_ROUNDING. */ | |
2389 | ||
2390 | if (! must_preallocate) | |
2391 | { | |
2392 | int partial_seen = 0; | |
a20c5714 | 2393 | poly_int64 copy_to_evaluate_size = 0; |
0f9b3ea6 JL |
2394 | int i; |
2395 | ||
2396 | for (i = 0; i < num_actuals && ! must_preallocate; i++) | |
2397 | { | |
2398 | if (args[i].partial > 0 && ! args[i].pass_on_stack) | |
2399 | partial_seen = 1; | |
2400 | else if (partial_seen && args[i].reg == 0) | |
2401 | must_preallocate = 1; | |
2402 | ||
2403 | if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode | |
2404 | && (TREE_CODE (args[i].tree_value) == CALL_EXPR | |
2405 | || TREE_CODE (args[i].tree_value) == TARGET_EXPR | |
2406 | || TREE_CODE (args[i].tree_value) == COND_EXPR | |
2407 | || TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value)))) | |
2408 | copy_to_evaluate_size | |
2409 | += int_size_in_bytes (TREE_TYPE (args[i].tree_value)); | |
2410 | } | |
2411 | ||
a20c5714 RS |
2412 | if (maybe_ne (args_size->constant, 0) |
2413 | && maybe_ge (copy_to_evaluate_size * 2, args_size->constant)) | |
0f9b3ea6 JL |
2414 | must_preallocate = 1; |
2415 | } | |
2416 | return must_preallocate; | |
2417 | } | |
599f37b6 | 2418 | |
a45bdd02 JL |
2419 | /* If we preallocated stack space, compute the address of each argument |
2420 | and store it into the ARGS array. | |
2421 | ||
f725a3ec | 2422 | We need not ensure it is a valid memory address here; it will be |
a45bdd02 JL |
2423 | validized when it is used. |
2424 | ||
2425 | ARGBLOCK is an rtx for the address of the outgoing arguments. */ | |
2426 | ||
2427 | static void | |
d329e058 | 2428 | compute_argument_addresses (struct arg_data *args, rtx argblock, int num_actuals) |
a45bdd02 JL |
2429 | { |
2430 | if (argblock) | |
2431 | { | |
2432 | rtx arg_reg = argblock; | |
a20c5714 RS |
2433 | int i; |
2434 | poly_int64 arg_offset = 0; | |
a45bdd02 JL |
2435 | |
2436 | if (GET_CODE (argblock) == PLUS) | |
a20c5714 RS |
2437 | { |
2438 | arg_reg = XEXP (argblock, 0); | |
2439 | arg_offset = rtx_to_poly_int64 (XEXP (argblock, 1)); | |
2440 | } | |
a45bdd02 JL |
2441 | |
2442 | for (i = 0; i < num_actuals; i++) | |
2443 | { | |
e7949876 AM |
2444 | rtx offset = ARGS_SIZE_RTX (args[i].locate.offset); |
2445 | rtx slot_offset = ARGS_SIZE_RTX (args[i].locate.slot_offset); | |
a45bdd02 | 2446 | rtx addr; |
bfc45551 | 2447 | unsigned int align, boundary; |
a20c5714 | 2448 | poly_uint64 units_on_stack = 0; |
ef4bddc2 | 2449 | machine_mode partial_mode = VOIDmode; |
a45bdd02 JL |
2450 | |
2451 | /* Skip this parm if it will not be passed on the stack. */ | |
7816b87e JC |
2452 | if (! args[i].pass_on_stack |
2453 | && args[i].reg != 0 | |
2454 | && args[i].partial == 0) | |
a45bdd02 JL |
2455 | continue; |
2456 | ||
5b8b4a88 JJ |
2457 | if (TYPE_EMPTY_P (TREE_TYPE (args[i].tree_value))) |
2458 | continue; | |
2459 | ||
a708f4b6 | 2460 | addr = simplify_gen_binary (PLUS, Pmode, arg_reg, offset); |
0a81f074 | 2461 | addr = plus_constant (Pmode, addr, arg_offset); |
7816b87e JC |
2462 | |
2463 | if (args[i].partial != 0) | |
2464 | { | |
2465 | /* Only part of the parameter is being passed on the stack. | |
2466 | Generate a simple memory reference of the correct size. */ | |
2467 | units_on_stack = args[i].locate.size.constant; | |
a20c5714 | 2468 | poly_uint64 bits_on_stack = units_on_stack * BITS_PER_UNIT; |
f4b31647 | 2469 | partial_mode = int_mode_for_size (bits_on_stack, 1).else_blk (); |
7816b87e | 2470 | args[i].stack = gen_rtx_MEM (partial_mode, addr); |
f5541398 | 2471 | set_mem_size (args[i].stack, units_on_stack); |
7816b87e JC |
2472 | } |
2473 | else | |
2474 | { | |
2475 | args[i].stack = gen_rtx_MEM (args[i].mode, addr); | |
2476 | set_mem_attributes (args[i].stack, | |
2477 | TREE_TYPE (args[i].tree_value), 1); | |
2478 | } | |
bfc45551 AM |
2479 | align = BITS_PER_UNIT; |
2480 | boundary = args[i].locate.boundary; | |
a20c5714 | 2481 | poly_int64 offset_val; |
76b0cbf8 | 2482 | if (args[i].locate.where_pad != PAD_DOWNWARD) |
bfc45551 | 2483 | align = boundary; |
a20c5714 | 2484 | else if (poly_int_rtx_p (offset, &offset_val)) |
bfc45551 | 2485 | { |
a20c5714 RS |
2486 | align = least_bit_hwi (boundary); |
2487 | unsigned int offset_align | |
2488 | = known_alignment (offset_val) * BITS_PER_UNIT; | |
2489 | if (offset_align != 0) | |
2490 | align = MIN (align, offset_align); | |
bfc45551 AM |
2491 | } |
2492 | set_mem_align (args[i].stack, align); | |
a45bdd02 | 2493 | |
a708f4b6 | 2494 | addr = simplify_gen_binary (PLUS, Pmode, arg_reg, slot_offset); |
0a81f074 | 2495 | addr = plus_constant (Pmode, addr, arg_offset); |
7816b87e JC |
2496 | |
2497 | if (args[i].partial != 0) | |
2498 | { | |
2499 | /* Only part of the parameter is being passed on the stack. | |
2500 | Generate a simple memory reference of the correct size. | |
2501 | */ | |
2502 | args[i].stack_slot = gen_rtx_MEM (partial_mode, addr); | |
f5541398 | 2503 | set_mem_size (args[i].stack_slot, units_on_stack); |
7816b87e JC |
2504 | } |
2505 | else | |
2506 | { | |
2507 | args[i].stack_slot = gen_rtx_MEM (args[i].mode, addr); | |
2508 | set_mem_attributes (args[i].stack_slot, | |
2509 | TREE_TYPE (args[i].tree_value), 1); | |
2510 | } | |
bfc45551 | 2511 | set_mem_align (args[i].stack_slot, args[i].locate.boundary); |
7ab923cc JJ |
2512 | |
2513 | /* Function incoming arguments may overlap with sibling call | |
2514 | outgoing arguments and we cannot allow reordering of reads | |
2515 | from function arguments with stores to outgoing arguments | |
2516 | of sibling calls. */ | |
ba4828e0 RK |
2517 | set_mem_alias_set (args[i].stack, 0); |
2518 | set_mem_alias_set (args[i].stack_slot, 0); | |
a45bdd02 JL |
2519 | } |
2520 | } | |
2521 | } | |
f725a3ec | 2522 | |
a45bdd02 JL |
2523 | /* Given a FNDECL and EXP, return an rtx suitable for use as a target address |
2524 | in a call instruction. | |
2525 | ||
2526 | FNDECL is the tree node for the target function. For an indirect call | |
2527 | FNDECL will be NULL_TREE. | |
2528 | ||
09e2bf48 | 2529 | ADDR is the operand 0 of CALL_EXPR for this call. */ |
a45bdd02 JL |
2530 | |
2531 | static rtx | |
d329e058 | 2532 | rtx_for_function_call (tree fndecl, tree addr) |
a45bdd02 JL |
2533 | { |
2534 | rtx funexp; | |
2535 | ||
2536 | /* Get the function to call, in the form of RTL. */ | |
2537 | if (fndecl) | |
2538 | { | |
ad960f56 | 2539 | if (!TREE_USED (fndecl) && fndecl != current_function_decl) |
bbee5843 | 2540 | TREE_USED (fndecl) = 1; |
a45bdd02 JL |
2541 | |
2542 | /* Get a SYMBOL_REF rtx for the function address. */ | |
2543 | funexp = XEXP (DECL_RTL (fndecl), 0); | |
2544 | } | |
2545 | else | |
2546 | /* Generate an rtx (probably a pseudo-register) for the address. */ | |
2547 | { | |
2548 | push_temp_slots (); | |
84217346 | 2549 | funexp = expand_normal (addr); |
f725a3ec | 2550 | pop_temp_slots (); /* FUNEXP can't be BLKmode. */ |
a45bdd02 JL |
2551 | } |
2552 | return funexp; | |
2553 | } | |
2554 | ||
4b522b8f TV |
2555 | /* Return the static chain for this function, if any. */ |
2556 | ||
2557 | rtx | |
2558 | rtx_for_static_chain (const_tree fndecl_or_type, bool incoming_p) | |
2559 | { | |
2560 | if (DECL_P (fndecl_or_type) && !DECL_STATIC_CHAIN (fndecl_or_type)) | |
2561 | return NULL; | |
2562 | ||
2563 | return targetm.calls.static_chain (fndecl_or_type, incoming_p); | |
2564 | } | |
2565 | ||
5275901c JJ |
2566 | /* Internal state for internal_arg_pointer_based_exp and its helpers. */ |
2567 | static struct | |
2568 | { | |
2569 | /* Last insn that has been scanned by internal_arg_pointer_based_exp_scan, | |
2570 | or NULL_RTX if none has been scanned yet. */ | |
48810515 | 2571 | rtx_insn *scan_start; |
5275901c JJ |
2572 | /* Vector indexed by REGNO - FIRST_PSEUDO_REGISTER, recording if a pseudo is |
2573 | based on crtl->args.internal_arg_pointer. The element is NULL_RTX if the | |
2574 | pseudo isn't based on it, a CONST_INT offset if the pseudo is based on it | |
2575 | with fixed offset, or PC if this is with variable or unknown offset. */ | |
9771b263 | 2576 | vec<rtx> cache; |
5275901c JJ |
2577 | } internal_arg_pointer_exp_state; |
2578 | ||
e9f56944 | 2579 | static rtx internal_arg_pointer_based_exp (const_rtx, bool); |
5275901c JJ |
2580 | |
2581 | /* Helper function for internal_arg_pointer_based_exp. Scan insns in | |
2582 | the tail call sequence, starting with first insn that hasn't been | |
2583 | scanned yet, and note for each pseudo on the LHS whether it is based | |
2584 | on crtl->args.internal_arg_pointer or not, and what offset from that | |
2585 | that pointer it has. */ | |
2586 | ||
2587 | static void | |
2588 | internal_arg_pointer_based_exp_scan (void) | |
2589 | { | |
48810515 | 2590 | rtx_insn *insn, *scan_start = internal_arg_pointer_exp_state.scan_start; |
5275901c JJ |
2591 | |
2592 | if (scan_start == NULL_RTX) | |
2593 | insn = get_insns (); | |
2594 | else | |
2595 | insn = NEXT_INSN (scan_start); | |
2596 | ||
2597 | while (insn) | |
2598 | { | |
2599 | rtx set = single_set (insn); | |
2600 | if (set && REG_P (SET_DEST (set)) && !HARD_REGISTER_P (SET_DEST (set))) | |
2601 | { | |
2602 | rtx val = NULL_RTX; | |
2603 | unsigned int idx = REGNO (SET_DEST (set)) - FIRST_PSEUDO_REGISTER; | |
2604 | /* Punt on pseudos set multiple times. */ | |
9771b263 DN |
2605 | if (idx < internal_arg_pointer_exp_state.cache.length () |
2606 | && (internal_arg_pointer_exp_state.cache[idx] | |
5275901c JJ |
2607 | != NULL_RTX)) |
2608 | val = pc_rtx; | |
2609 | else | |
2610 | val = internal_arg_pointer_based_exp (SET_SRC (set), false); | |
2611 | if (val != NULL_RTX) | |
2612 | { | |
9771b263 | 2613 | if (idx >= internal_arg_pointer_exp_state.cache.length ()) |
c3284718 RS |
2614 | internal_arg_pointer_exp_state.cache |
2615 | .safe_grow_cleared (idx + 1); | |
9771b263 | 2616 | internal_arg_pointer_exp_state.cache[idx] = val; |
5275901c JJ |
2617 | } |
2618 | } | |
2619 | if (NEXT_INSN (insn) == NULL_RTX) | |
2620 | scan_start = insn; | |
2621 | insn = NEXT_INSN (insn); | |
2622 | } | |
2623 | ||
2624 | internal_arg_pointer_exp_state.scan_start = scan_start; | |
2625 | } | |
2626 | ||
5275901c JJ |
2627 | /* Compute whether RTL is based on crtl->args.internal_arg_pointer. Return |
2628 | NULL_RTX if RTL isn't based on it, a CONST_INT offset if RTL is based on | |
2629 | it with fixed offset, or PC if this is with variable or unknown offset. | |
2630 | TOPLEVEL is true if the function is invoked at the topmost level. */ | |
2631 | ||
2632 | static rtx | |
e9f56944 | 2633 | internal_arg_pointer_based_exp (const_rtx rtl, bool toplevel) |
5275901c JJ |
2634 | { |
2635 | if (CONSTANT_P (rtl)) | |
2636 | return NULL_RTX; | |
2637 | ||
2638 | if (rtl == crtl->args.internal_arg_pointer) | |
2639 | return const0_rtx; | |
2640 | ||
2641 | if (REG_P (rtl) && HARD_REGISTER_P (rtl)) | |
2642 | return NULL_RTX; | |
2643 | ||
a20c5714 RS |
2644 | poly_int64 offset; |
2645 | if (GET_CODE (rtl) == PLUS && poly_int_rtx_p (XEXP (rtl, 1), &offset)) | |
5275901c JJ |
2646 | { |
2647 | rtx val = internal_arg_pointer_based_exp (XEXP (rtl, 0), toplevel); | |
2648 | if (val == NULL_RTX || val == pc_rtx) | |
2649 | return val; | |
a20c5714 | 2650 | return plus_constant (Pmode, val, offset); |
5275901c JJ |
2651 | } |
2652 | ||
2653 | /* When called at the topmost level, scan pseudo assignments in between the | |
2654 | last scanned instruction in the tail call sequence and the latest insn | |
2655 | in that sequence. */ | |
2656 | if (toplevel) | |
2657 | internal_arg_pointer_based_exp_scan (); | |
2658 | ||
2659 | if (REG_P (rtl)) | |
2660 | { | |
2661 | unsigned int idx = REGNO (rtl) - FIRST_PSEUDO_REGISTER; | |
9771b263 DN |
2662 | if (idx < internal_arg_pointer_exp_state.cache.length ()) |
2663 | return internal_arg_pointer_exp_state.cache[idx]; | |
5275901c JJ |
2664 | |
2665 | return NULL_RTX; | |
2666 | } | |
2667 | ||
e9f56944 RS |
2668 | subrtx_iterator::array_type array; |
2669 | FOR_EACH_SUBRTX (iter, array, rtl, NONCONST) | |
2670 | { | |
2671 | const_rtx x = *iter; | |
2672 | if (REG_P (x) && internal_arg_pointer_based_exp (x, false) != NULL_RTX) | |
2673 | return pc_rtx; | |
2674 | if (MEM_P (x)) | |
2675 | iter.skip_subrtxes (); | |
2676 | } | |
5275901c JJ |
2677 | |
2678 | return NULL_RTX; | |
2679 | } | |
2680 | ||
a20c5714 RS |
2681 | /* Return true if SIZE bytes starting from address ADDR might overlap an |
2682 | already-clobbered argument area. This function is used to determine | |
2683 | if we should give up a sibcall. */ | |
07eef816 KH |
2684 | |
2685 | static bool | |
a20c5714 | 2686 | mem_might_overlap_already_clobbered_arg_p (rtx addr, poly_uint64 size) |
07eef816 | 2687 | { |
a20c5714 RS |
2688 | poly_int64 i; |
2689 | unsigned HOST_WIDE_INT start, end; | |
5275901c | 2690 | rtx val; |
07eef816 | 2691 | |
a20c5714 RS |
2692 | if (bitmap_empty_p (stored_args_map) |
2693 | && stored_args_watermark == HOST_WIDE_INT_M1U) | |
4189fb53 | 2694 | return false; |
5275901c JJ |
2695 | val = internal_arg_pointer_based_exp (addr, true); |
2696 | if (val == NULL_RTX) | |
2697 | return false; | |
a20c5714 | 2698 | else if (!poly_int_rtx_p (val, &i)) |
6c3cb698 | 2699 | return true; |
a20c5714 RS |
2700 | |
2701 | if (known_eq (size, 0U)) | |
2702 | return false; | |
76e048a8 KT |
2703 | |
2704 | if (STACK_GROWS_DOWNWARD) | |
2705 | i -= crtl->args.pretend_args_size; | |
2706 | else | |
2707 | i += crtl->args.pretend_args_size; | |
2708 | ||
6dad9361 TS |
2709 | if (ARGS_GROW_DOWNWARD) |
2710 | i = -i - size; | |
2711 | ||
a20c5714 RS |
2712 | /* We can ignore any references to the function's pretend args, |
2713 | which at this point would manifest as negative values of I. */ | |
2714 | if (known_le (i, 0) && known_le (size, poly_uint64 (-i))) | |
2715 | return false; | |
07eef816 | 2716 | |
a20c5714 RS |
2717 | start = maybe_lt (i, 0) ? 0 : constant_lower_bound (i); |
2718 | if (!(i + size).is_constant (&end)) | |
2719 | end = HOST_WIDE_INT_M1U; | |
2720 | ||
2721 | if (end > stored_args_watermark) | |
2722 | return true; | |
2723 | ||
2724 | end = MIN (end, SBITMAP_SIZE (stored_args_map)); | |
2725 | for (unsigned HOST_WIDE_INT k = start; k < end; ++k) | |
2726 | if (bitmap_bit_p (stored_args_map, k)) | |
2727 | return true; | |
07eef816 KH |
2728 | |
2729 | return false; | |
2730 | } | |
2731 | ||
21a3b983 JL |
2732 | /* Do the register loads required for any wholly-register parms or any |
2733 | parms which are passed both on the stack and in a register. Their | |
f725a3ec | 2734 | expressions were already evaluated. |
21a3b983 JL |
2735 | |
2736 | Mark all register-parms as living through the call, putting these USE | |
d329e058 AJ |
2737 | insns in the CALL_INSN_FUNCTION_USAGE field. |
2738 | ||
40b0345d | 2739 | When IS_SIBCALL, perform the check_sibcall_argument_overlap |
0cdca92b | 2740 | checking, setting *SIBCALL_FAILURE if appropriate. */ |
21a3b983 JL |
2741 | |
2742 | static void | |
d329e058 AJ |
2743 | load_register_parameters (struct arg_data *args, int num_actuals, |
2744 | rtx *call_fusage, int flags, int is_sibcall, | |
2745 | int *sibcall_failure) | |
21a3b983 JL |
2746 | { |
2747 | int i, j; | |
2748 | ||
21a3b983 | 2749 | for (i = 0; i < num_actuals; i++) |
21a3b983 | 2750 | { |
099e9712 JH |
2751 | rtx reg = ((flags & ECF_SIBCALL) |
2752 | ? args[i].tail_call_reg : args[i].reg); | |
21a3b983 JL |
2753 | if (reg) |
2754 | { | |
6e985040 AM |
2755 | int partial = args[i].partial; |
2756 | int nregs; | |
95fe7b48 RS |
2757 | poly_int64 size = 0; |
2758 | HOST_WIDE_INT const_size = 0; | |
48810515 | 2759 | rtx_insn *before_arg = get_last_insn (); |
f0078f86 AM |
2760 | /* Set non-negative if we must move a word at a time, even if |
2761 | just one word (e.g, partial == 4 && mode == DFmode). Set | |
2762 | to -1 if we just use a normal move insn. This value can be | |
2763 | zero if the argument is a zero size structure. */ | |
6e985040 | 2764 | nregs = -1; |
78a52f11 RH |
2765 | if (GET_CODE (reg) == PARALLEL) |
2766 | ; | |
2767 | else if (partial) | |
2768 | { | |
2769 | gcc_assert (partial % UNITS_PER_WORD == 0); | |
2770 | nregs = partial / UNITS_PER_WORD; | |
2771 | } | |
6e985040 AM |
2772 | else if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode) |
2773 | { | |
95fe7b48 RS |
2774 | /* Variable-sized parameters should be described by a |
2775 | PARALLEL instead. */ | |
2776 | const_size = int_size_in_bytes (TREE_TYPE (args[i].tree_value)); | |
2777 | gcc_assert (const_size >= 0); | |
2778 | nregs = (const_size + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD; | |
2779 | size = const_size; | |
6e985040 AM |
2780 | } |
2781 | else | |
2782 | size = GET_MODE_SIZE (args[i].mode); | |
21a3b983 JL |
2783 | |
2784 | /* Handle calls that pass values in multiple non-contiguous | |
2785 | locations. The Irix 6 ABI has examples of this. */ | |
2786 | ||
2787 | if (GET_CODE (reg) == PARALLEL) | |
8df3dbb7 | 2788 | emit_group_move (reg, args[i].parallel_value); |
21a3b983 JL |
2789 | |
2790 | /* If simple case, just do move. If normal partial, store_one_arg | |
2791 | has already loaded the register for us. In all other cases, | |
2792 | load the register(s) from memory. */ | |
2793 | ||
9206d736 AM |
2794 | else if (nregs == -1) |
2795 | { | |
2796 | emit_move_insn (reg, args[i].value); | |
6e985040 | 2797 | #ifdef BLOCK_REG_PADDING |
9206d736 AM |
2798 | /* Handle case where we have a value that needs shifting |
2799 | up to the msb. eg. a QImode value and we're padding | |
2800 | upward on a BYTES_BIG_ENDIAN machine. */ | |
95fe7b48 RS |
2801 | if (args[i].locate.where_pad |
2802 | == (BYTES_BIG_ENDIAN ? PAD_UPWARD : PAD_DOWNWARD)) | |
9206d736 | 2803 | { |
95fe7b48 RS |
2804 | gcc_checking_assert (ordered_p (size, UNITS_PER_WORD)); |
2805 | if (maybe_lt (size, UNITS_PER_WORD)) | |
2806 | { | |
2807 | rtx x; | |
2808 | poly_int64 shift | |
2809 | = (UNITS_PER_WORD - size) * BITS_PER_UNIT; | |
2810 | ||
2811 | /* Assigning REG here rather than a temp makes | |
2812 | CALL_FUSAGE report the whole reg as used. | |
2813 | Strictly speaking, the call only uses SIZE | |
2814 | bytes at the msb end, but it doesn't seem worth | |
2815 | generating rtl to say that. */ | |
2816 | reg = gen_rtx_REG (word_mode, REGNO (reg)); | |
2817 | x = expand_shift (LSHIFT_EXPR, word_mode, | |
2818 | reg, shift, reg, 1); | |
2819 | if (x != reg) | |
2820 | emit_move_insn (reg, x); | |
2821 | } | |
9206d736 | 2822 | } |
6e985040 | 2823 | #endif |
9206d736 | 2824 | } |
21a3b983 JL |
2825 | |
2826 | /* If we have pre-computed the values to put in the registers in | |
2827 | the case of non-aligned structures, copy them in now. */ | |
2828 | ||
2829 | else if (args[i].n_aligned_regs != 0) | |
2830 | for (j = 0; j < args[i].n_aligned_regs; j++) | |
2831 | emit_move_insn (gen_rtx_REG (word_mode, REGNO (reg) + j), | |
2832 | args[i].aligned_regs[j]); | |
2833 | ||
3b2ee170 | 2834 | else if (partial == 0 || args[i].pass_on_stack) |
6e985040 | 2835 | { |
95fe7b48 RS |
2836 | /* SIZE and CONST_SIZE are 0 for partial arguments and |
2837 | the size of a BLKmode type otherwise. */ | |
2838 | gcc_checking_assert (known_eq (size, const_size)); | |
1a8cb155 | 2839 | rtx mem = validize_mem (copy_rtx (args[i].value)); |
6e985040 | 2840 | |
3b2ee170 IS |
2841 | /* Check for overlap with already clobbered argument area, |
2842 | providing that this has non-zero size. */ | |
07eef816 | 2843 | if (is_sibcall |
95fe7b48 | 2844 | && const_size != 0 |
a20c5714 | 2845 | && (mem_might_overlap_already_clobbered_arg_p |
95fe7b48 | 2846 | (XEXP (args[i].value, 0), const_size))) |
07eef816 KH |
2847 | *sibcall_failure = 1; |
2848 | ||
95fe7b48 | 2849 | if (const_size % UNITS_PER_WORD == 0 |
984b2054 AM |
2850 | || MEM_ALIGN (mem) % BITS_PER_WORD == 0) |
2851 | move_block_to_reg (REGNO (reg), mem, nregs, args[i].mode); | |
2852 | else | |
2853 | { | |
2854 | if (nregs > 1) | |
2855 | move_block_to_reg (REGNO (reg), mem, nregs - 1, | |
2856 | args[i].mode); | |
2857 | rtx dest = gen_rtx_REG (word_mode, REGNO (reg) + nregs - 1); | |
2858 | unsigned int bitoff = (nregs - 1) * BITS_PER_WORD; | |
95fe7b48 | 2859 | unsigned int bitsize = const_size * BITS_PER_UNIT - bitoff; |
ee45a32d | 2860 | rtx x = extract_bit_field (mem, bitsize, bitoff, 1, dest, |
f96bf49a JW |
2861 | word_mode, word_mode, false, |
2862 | NULL); | |
984b2054 AM |
2863 | if (BYTES_BIG_ENDIAN) |
2864 | x = expand_shift (LSHIFT_EXPR, word_mode, x, | |
2865 | BITS_PER_WORD - bitsize, dest, 1); | |
2866 | if (x != dest) | |
2867 | emit_move_insn (dest, x); | |
2868 | } | |
2869 | ||
6e985040 | 2870 | /* Handle a BLKmode that needs shifting. */ |
95fe7b48 | 2871 | if (nregs == 1 && const_size < UNITS_PER_WORD |
03ca1672 | 2872 | #ifdef BLOCK_REG_PADDING |
76b0cbf8 | 2873 | && args[i].locate.where_pad == PAD_DOWNWARD |
03ca1672 UW |
2874 | #else |
2875 | && BYTES_BIG_ENDIAN | |
2876 | #endif | |
984b2054 | 2877 | ) |
6e985040 | 2878 | { |
984b2054 | 2879 | rtx dest = gen_rtx_REG (word_mode, REGNO (reg)); |
95fe7b48 | 2880 | int shift = (UNITS_PER_WORD - const_size) * BITS_PER_UNIT; |
984b2054 AM |
2881 | enum tree_code dir = (BYTES_BIG_ENDIAN |
2882 | ? RSHIFT_EXPR : LSHIFT_EXPR); | |
2883 | rtx x; | |
6e985040 | 2884 | |
984b2054 AM |
2885 | x = expand_shift (dir, word_mode, dest, shift, dest, 1); |
2886 | if (x != dest) | |
2887 | emit_move_insn (dest, x); | |
6e985040 | 2888 | } |
6e985040 | 2889 | } |
21a3b983 | 2890 | |
0cdca92b DJ |
2891 | /* When a parameter is a block, and perhaps in other cases, it is |
2892 | possible that it did a load from an argument slot that was | |
32dd366d | 2893 | already clobbered. */ |
0cdca92b DJ |
2894 | if (is_sibcall |
2895 | && check_sibcall_argument_overlap (before_arg, &args[i], 0)) | |
2896 | *sibcall_failure = 1; | |
2897 | ||
21a3b983 JL |
2898 | /* Handle calls that pass values in multiple non-contiguous |
2899 | locations. The Irix 6 ABI has examples of this. */ | |
2900 | if (GET_CODE (reg) == PARALLEL) | |
2901 | use_group_regs (call_fusage, reg); | |
2902 | else if (nregs == -1) | |
7d810276 JJ |
2903 | use_reg_mode (call_fusage, reg, |
2904 | TYPE_MODE (TREE_TYPE (args[i].tree_value))); | |
faa00334 AO |
2905 | else if (nregs > 0) |
2906 | use_regs (call_fusage, REGNO (reg), nregs); | |
21a3b983 JL |
2907 | } |
2908 | } | |
2909 | } | |
2910 | ||
739fb049 MM |
2911 | /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments |
2912 | wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY | |
2913 | bytes, then we would need to push some additional bytes to pad the | |
a20c5714 | 2914 | arguments. So, we try to compute an adjust to the stack pointer for an |
ce48579b RH |
2915 | amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE |
2916 | bytes. Then, when the arguments are pushed the stack will be perfectly | |
a20c5714 | 2917 | aligned. |
739fb049 | 2918 | |
a20c5714 RS |
2919 | Return true if this optimization is possible, storing the adjustment |
2920 | in ADJUSTMENT_OUT and setting ARGS_SIZE->CONSTANT to the number of | |
2921 | bytes that should be popped after the call. */ | |
2922 | ||
2923 | static bool | |
2924 | combine_pending_stack_adjustment_and_call (poly_int64_pod *adjustment_out, | |
2925 | poly_int64 unadjusted_args_size, | |
d329e058 | 2926 | struct args_size *args_size, |
95899b34 | 2927 | unsigned int preferred_unit_stack_boundary) |
739fb049 MM |
2928 | { |
2929 | /* The number of bytes to pop so that the stack will be | |
2930 | under-aligned by UNADJUSTED_ARGS_SIZE bytes. */ | |
a20c5714 | 2931 | poly_int64 adjustment; |
739fb049 MM |
2932 | /* The alignment of the stack after the arguments are pushed, if we |
2933 | just pushed the arguments without adjust the stack here. */ | |
95899b34 | 2934 | unsigned HOST_WIDE_INT unadjusted_alignment; |
739fb049 | 2935 | |
a20c5714 RS |
2936 | if (!known_misalignment (stack_pointer_delta + unadjusted_args_size, |
2937 | preferred_unit_stack_boundary, | |
2938 | &unadjusted_alignment)) | |
2939 | return false; | |
739fb049 MM |
2940 | |
2941 | /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes | |
2942 | as possible -- leaving just enough left to cancel out the | |
2943 | UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the | |
2944 | PENDING_STACK_ADJUST is non-negative, and congruent to | |
2945 | -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */ | |
2946 | ||
2947 | /* Begin by trying to pop all the bytes. */ | |
a20c5714 RS |
2948 | unsigned HOST_WIDE_INT tmp_misalignment; |
2949 | if (!known_misalignment (pending_stack_adjust, | |
2950 | preferred_unit_stack_boundary, | |
2951 | &tmp_misalignment)) | |
2952 | return false; | |
2953 | unadjusted_alignment -= tmp_misalignment; | |
739fb049 MM |
2954 | adjustment = pending_stack_adjust; |
2955 | /* Push enough additional bytes that the stack will be aligned | |
2956 | after the arguments are pushed. */ | |
0aae1572 NS |
2957 | if (preferred_unit_stack_boundary > 1 && unadjusted_alignment) |
2958 | adjustment -= preferred_unit_stack_boundary - unadjusted_alignment; | |
f725a3ec | 2959 | |
a20c5714 RS |
2960 | /* We need to know whether the adjusted argument size |
2961 | (UNADJUSTED_ARGS_SIZE - ADJUSTMENT) constitutes an allocation | |
2962 | or a deallocation. */ | |
2963 | if (!ordered_p (adjustment, unadjusted_args_size)) | |
2964 | return false; | |
2965 | ||
739fb049 MM |
2966 | /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of |
2967 | bytes after the call. The right number is the entire | |
2968 | PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required | |
2969 | by the arguments in the first place. */ | |
f725a3ec | 2970 | args_size->constant |
739fb049 MM |
2971 | = pending_stack_adjust - adjustment + unadjusted_args_size; |
2972 | ||
a20c5714 RS |
2973 | *adjustment_out = adjustment; |
2974 | return true; | |
739fb049 MM |
2975 | } |
2976 | ||
c67846f2 JJ |
2977 | /* Scan X expression if it does not dereference any argument slots |
2978 | we already clobbered by tail call arguments (as noted in stored_args_map | |
2979 | bitmap). | |
da7d8304 | 2980 | Return nonzero if X expression dereferences such argument slots, |
c67846f2 JJ |
2981 | zero otherwise. */ |
2982 | ||
2983 | static int | |
d329e058 | 2984 | check_sibcall_argument_overlap_1 (rtx x) |
c67846f2 JJ |
2985 | { |
2986 | RTX_CODE code; | |
2987 | int i, j; | |
c67846f2 JJ |
2988 | const char *fmt; |
2989 | ||
2990 | if (x == NULL_RTX) | |
2991 | return 0; | |
2992 | ||
2993 | code = GET_CODE (x); | |
2994 | ||
6c3cb698 KY |
2995 | /* We need not check the operands of the CALL expression itself. */ |
2996 | if (code == CALL) | |
2997 | return 0; | |
2998 | ||
c67846f2 | 2999 | if (code == MEM) |
a20c5714 RS |
3000 | return (mem_might_overlap_already_clobbered_arg_p |
3001 | (XEXP (x, 0), GET_MODE_SIZE (GET_MODE (x)))); | |
c67846f2 | 3002 | |
f725a3ec | 3003 | /* Scan all subexpressions. */ |
c67846f2 JJ |
3004 | fmt = GET_RTX_FORMAT (code); |
3005 | for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++) | |
3006 | { | |
3007 | if (*fmt == 'e') | |
f725a3ec KH |
3008 | { |
3009 | if (check_sibcall_argument_overlap_1 (XEXP (x, i))) | |
3010 | return 1; | |
3011 | } | |
c67846f2 | 3012 | else if (*fmt == 'E') |
f725a3ec KH |
3013 | { |
3014 | for (j = 0; j < XVECLEN (x, i); j++) | |
3015 | if (check_sibcall_argument_overlap_1 (XVECEXP (x, i, j))) | |
3016 | return 1; | |
3017 | } | |
c67846f2 JJ |
3018 | } |
3019 | return 0; | |
c67846f2 JJ |
3020 | } |
3021 | ||
3022 | /* Scan sequence after INSN if it does not dereference any argument slots | |
3023 | we already clobbered by tail call arguments (as noted in stored_args_map | |
0cdca92b DJ |
3024 | bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to |
3025 | stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP | |
3026 | should be 0). Return nonzero if sequence after INSN dereferences such argument | |
3027 | slots, zero otherwise. */ | |
c67846f2 JJ |
3028 | |
3029 | static int | |
48810515 DM |
3030 | check_sibcall_argument_overlap (rtx_insn *insn, struct arg_data *arg, |
3031 | int mark_stored_args_map) | |
f725a3ec | 3032 | { |
a20c5714 RS |
3033 | poly_uint64 low, high; |
3034 | unsigned HOST_WIDE_INT const_low, const_high; | |
c67846f2 JJ |
3035 | |
3036 | if (insn == NULL_RTX) | |
3037 | insn = get_insns (); | |
3038 | else | |
3039 | insn = NEXT_INSN (insn); | |
3040 | ||
3041 | for (; insn; insn = NEXT_INSN (insn)) | |
f725a3ec KH |
3042 | if (INSN_P (insn) |
3043 | && check_sibcall_argument_overlap_1 (PATTERN (insn))) | |
c67846f2 JJ |
3044 | break; |
3045 | ||
0cdca92b DJ |
3046 | if (mark_stored_args_map) |
3047 | { | |
6dad9361 TS |
3048 | if (ARGS_GROW_DOWNWARD) |
3049 | low = -arg->locate.slot_offset.constant - arg->locate.size.constant; | |
3050 | else | |
3051 | low = arg->locate.slot_offset.constant; | |
a20c5714 | 3052 | high = low + arg->locate.size.constant; |
d60eab50 | 3053 | |
a20c5714 RS |
3054 | const_low = constant_lower_bound (low); |
3055 | if (high.is_constant (&const_high)) | |
3056 | for (unsigned HOST_WIDE_INT i = const_low; i < const_high; ++i) | |
3057 | bitmap_set_bit (stored_args_map, i); | |
3058 | else | |
3059 | stored_args_watermark = MIN (stored_args_watermark, const_low); | |
0cdca92b | 3060 | } |
c67846f2 JJ |
3061 | return insn != NULL_RTX; |
3062 | } | |
3063 | ||
bef5d8b6 RS |
3064 | /* Given that a function returns a value of mode MODE at the most |
3065 | significant end of hard register VALUE, shift VALUE left or right | |
3066 | as specified by LEFT_P. Return true if some action was needed. */ | |
c988af2b | 3067 | |
bef5d8b6 | 3068 | bool |
ef4bddc2 | 3069 | shift_return_value (machine_mode mode, bool left_p, rtx value) |
c988af2b | 3070 | { |
bef5d8b6 | 3071 | gcc_assert (REG_P (value) && HARD_REGISTER_P (value)); |
abd3c800 | 3072 | machine_mode value_mode = GET_MODE (value); |
73a699ae RS |
3073 | poly_int64 shift = GET_MODE_BITSIZE (value_mode) - GET_MODE_BITSIZE (mode); |
3074 | ||
3075 | if (known_eq (shift, 0)) | |
bef5d8b6 RS |
3076 | return false; |
3077 | ||
3078 | /* Use ashr rather than lshr for right shifts. This is for the benefit | |
3079 | of the MIPS port, which requires SImode values to be sign-extended | |
3080 | when stored in 64-bit registers. */ | |
abd3c800 RS |
3081 | if (!force_expand_binop (value_mode, left_p ? ashl_optab : ashr_optab, |
3082 | value, gen_int_shift_amount (value_mode, shift), | |
3083 | value, 1, OPTAB_WIDEN)) | |
bef5d8b6 RS |
3084 | gcc_unreachable (); |
3085 | return true; | |
c988af2b RS |
3086 | } |
3087 | ||
3fb30019 RS |
3088 | /* If X is a likely-spilled register value, copy it to a pseudo |
3089 | register and return that register. Return X otherwise. */ | |
3090 | ||
3091 | static rtx | |
3092 | avoid_likely_spilled_reg (rtx x) | |
3093 | { | |
82d6e6fc | 3094 | rtx new_rtx; |
3fb30019 RS |
3095 | |
3096 | if (REG_P (x) | |
3097 | && HARD_REGISTER_P (x) | |
07b8f0a8 | 3098 | && targetm.class_likely_spilled_p (REGNO_REG_CLASS (REGNO (x)))) |
3fb30019 RS |
3099 | { |
3100 | /* Make sure that we generate a REG rather than a CONCAT. | |
3101 | Moves into CONCATs can need nontrivial instructions, | |
3102 | and the whole point of this function is to avoid | |
3103 | using the hard register directly in such a situation. */ | |
3104 | generating_concat_p = 0; | |
82d6e6fc | 3105 | new_rtx = gen_reg_rtx (GET_MODE (x)); |
3fb30019 | 3106 | generating_concat_p = 1; |
82d6e6fc KG |
3107 | emit_move_insn (new_rtx, x); |
3108 | return new_rtx; | |
3fb30019 RS |
3109 | } |
3110 | return x; | |
3111 | } | |
3112 | ||
b40d90e6 DM |
3113 | /* Helper function for expand_call. |
3114 | Return false is EXP is not implementable as a sibling call. */ | |
3115 | ||
3116 | static bool | |
3117 | can_implement_as_sibling_call_p (tree exp, | |
3118 | rtx structure_value_addr, | |
3119 | tree funtype, | |
dfbdde16 | 3120 | int reg_parm_stack_space ATTRIBUTE_UNUSED, |
b40d90e6 DM |
3121 | tree fndecl, |
3122 | int flags, | |
3123 | tree addr, | |
3124 | const args_size &args_size) | |
3125 | { | |
3126 | if (!targetm.have_sibcall_epilogue ()) | |
9a385c2d DM |
3127 | { |
3128 | maybe_complain_about_tail_call | |
3129 | (exp, | |
3130 | "machine description does not have" | |
3131 | " a sibcall_epilogue instruction pattern"); | |
3132 | return false; | |
3133 | } | |
b40d90e6 DM |
3134 | |
3135 | /* Doing sibling call optimization needs some work, since | |
3136 | structure_value_addr can be allocated on the stack. | |
3137 | It does not seem worth the effort since few optimizable | |
3138 | sibling calls will return a structure. */ | |
3139 | if (structure_value_addr != NULL_RTX) | |
9a385c2d DM |
3140 | { |
3141 | maybe_complain_about_tail_call (exp, "callee returns a structure"); | |
3142 | return false; | |
3143 | } | |
b40d90e6 DM |
3144 | |
3145 | #ifdef REG_PARM_STACK_SPACE | |
67914693 | 3146 | /* If outgoing reg parm stack space changes, we cannot do sibcall. */ |
b40d90e6 DM |
3147 | if (OUTGOING_REG_PARM_STACK_SPACE (funtype) |
3148 | != OUTGOING_REG_PARM_STACK_SPACE (TREE_TYPE (current_function_decl)) | |
3149 | || (reg_parm_stack_space != REG_PARM_STACK_SPACE (current_function_decl))) | |
9a385c2d DM |
3150 | { |
3151 | maybe_complain_about_tail_call (exp, | |
3152 | "inconsistent size of stack space" | |
3153 | " allocated for arguments which are" | |
3154 | " passed in registers"); | |
3155 | return false; | |
3156 | } | |
b40d90e6 DM |
3157 | #endif |
3158 | ||
3159 | /* Check whether the target is able to optimize the call | |
3160 | into a sibcall. */ | |
3161 | if (!targetm.function_ok_for_sibcall (fndecl, exp)) | |
9a385c2d DM |
3162 | { |
3163 | maybe_complain_about_tail_call (exp, | |
3164 | "target is not able to optimize the" | |
3165 | " call into a sibling call"); | |
3166 | return false; | |
3167 | } | |
b40d90e6 DM |
3168 | |
3169 | /* Functions that do not return exactly once may not be sibcall | |
3170 | optimized. */ | |
9a385c2d DM |
3171 | if (flags & ECF_RETURNS_TWICE) |
3172 | { | |
3173 | maybe_complain_about_tail_call (exp, "callee returns twice"); | |
3174 | return false; | |
3175 | } | |
3176 | if (flags & ECF_NORETURN) | |
3177 | { | |
3178 | maybe_complain_about_tail_call (exp, "callee does not return"); | |
3179 | return false; | |
3180 | } | |
b40d90e6 DM |
3181 | |
3182 | if (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (addr)))) | |
9a385c2d DM |
3183 | { |
3184 | maybe_complain_about_tail_call (exp, "volatile function type"); | |
3185 | return false; | |
3186 | } | |
b40d90e6 DM |
3187 | |
3188 | /* If the called function is nested in the current one, it might access | |
3189 | some of the caller's arguments, but could clobber them beforehand if | |
3190 | the argument areas are shared. */ | |
3191 | if (fndecl && decl_function_context (fndecl) == current_function_decl) | |
9a385c2d DM |
3192 | { |
3193 | maybe_complain_about_tail_call (exp, "nested function"); | |
3194 | return false; | |
3195 | } | |
b40d90e6 DM |
3196 | |
3197 | /* If this function requires more stack slots than the current | |
3198 | function, we cannot change it into a sibling call. | |
3199 | crtl->args.pretend_args_size is not part of the | |
3200 | stack allocated by our caller. */ | |
a20c5714 RS |
3201 | if (maybe_gt (args_size.constant, |
3202 | crtl->args.size - crtl->args.pretend_args_size)) | |
9a385c2d DM |
3203 | { |
3204 | maybe_complain_about_tail_call (exp, | |
3205 | "callee required more stack slots" | |
3206 | " than the caller"); | |
3207 | return false; | |
3208 | } | |
b40d90e6 DM |
3209 | |
3210 | /* If the callee pops its own arguments, then it must pop exactly | |
3211 | the same number of arguments as the current function. */ | |
a20c5714 RS |
3212 | if (maybe_ne (targetm.calls.return_pops_args (fndecl, funtype, |
3213 | args_size.constant), | |
3214 | targetm.calls.return_pops_args (current_function_decl, | |
3215 | TREE_TYPE | |
3216 | (current_function_decl), | |
3217 | crtl->args.size))) | |
9a385c2d DM |
3218 | { |
3219 | maybe_complain_about_tail_call (exp, | |
3220 | "inconsistent number of" | |
3221 | " popped arguments"); | |
3222 | return false; | |
3223 | } | |
b40d90e6 DM |
3224 | |
3225 | if (!lang_hooks.decls.ok_for_sibcall (fndecl)) | |
9a385c2d DM |
3226 | { |
3227 | maybe_complain_about_tail_call (exp, "frontend does not support" | |
3228 | " sibling call"); | |
3229 | return false; | |
3230 | } | |
b40d90e6 DM |
3231 | |
3232 | /* All checks passed. */ | |
3233 | return true; | |
3234 | } | |
3235 | ||
957ed738 L |
3236 | /* Update stack alignment when the parameter is passed in the stack |
3237 | since the outgoing parameter requires extra alignment on the calling | |
3238 | function side. */ | |
3239 | ||
3240 | static void | |
3241 | update_stack_alignment_for_call (struct locate_and_pad_arg_data *locate) | |
3242 | { | |
3243 | if (crtl->stack_alignment_needed < locate->boundary) | |
3244 | crtl->stack_alignment_needed = locate->boundary; | |
3245 | if (crtl->preferred_stack_boundary < locate->boundary) | |
3246 | crtl->preferred_stack_boundary = locate->boundary; | |
3247 | } | |
3248 | ||
5039610b | 3249 | /* Generate all the code for a CALL_EXPR exp |
51bbfa0c RS |
3250 | and return an rtx for its value. |
3251 | Store the value in TARGET (specified as an rtx) if convenient. | |
3252 | If the value is stored in TARGET then TARGET is returned. | |
3253 | If IGNORE is nonzero, then we ignore the value of the function call. */ | |
3254 | ||
3255 | rtx | |
d329e058 | 3256 | expand_call (tree exp, rtx target, int ignore) |
51bbfa0c | 3257 | { |
0a1c58a2 JL |
3258 | /* Nonzero if we are currently expanding a call. */ |
3259 | static int currently_expanding_call = 0; | |
3260 | ||
51bbfa0c RS |
3261 | /* RTX for the function to be called. */ |
3262 | rtx funexp; | |
0a1c58a2 | 3263 | /* Sequence of insns to perform a normal "call". */ |
48810515 | 3264 | rtx_insn *normal_call_insns = NULL; |
6de9cd9a | 3265 | /* Sequence of insns to perform a tail "call". */ |
48810515 | 3266 | rtx_insn *tail_call_insns = NULL; |
51bbfa0c RS |
3267 | /* Data type of the function. */ |
3268 | tree funtype; | |
ded9bf77 | 3269 | tree type_arg_types; |
28ed065e | 3270 | tree rettype; |
51bbfa0c RS |
3271 | /* Declaration of the function being called, |
3272 | or 0 if the function is computed (not known by name). */ | |
3273 | tree fndecl = 0; | |
57782ad8 MM |
3274 | /* The type of the function being called. */ |
3275 | tree fntype; | |
6de9cd9a | 3276 | bool try_tail_call = CALL_EXPR_TAILCALL (exp); |
9a385c2d | 3277 | bool must_tail_call = CALL_EXPR_MUST_TAIL_CALL (exp); |
0a1c58a2 | 3278 | int pass; |
51bbfa0c RS |
3279 | |
3280 | /* Register in which non-BLKmode value will be returned, | |
3281 | or 0 if no value or if value is BLKmode. */ | |
3282 | rtx valreg; | |
3283 | /* Address where we should return a BLKmode value; | |
3284 | 0 if value not BLKmode. */ | |
3285 | rtx structure_value_addr = 0; | |
3286 | /* Nonzero if that address is being passed by treating it as | |
3287 | an extra, implicit first parameter. Otherwise, | |
3288 | it is passed by being copied directly into struct_value_rtx. */ | |
3289 | int structure_value_addr_parm = 0; | |
078a18a4 SL |
3290 | /* Holds the value of implicit argument for the struct value. */ |
3291 | tree structure_value_addr_value = NULL_TREE; | |
51bbfa0c RS |
3292 | /* Size of aggregate value wanted, or zero if none wanted |
3293 | or if we are using the non-reentrant PCC calling convention | |
3294 | or expecting the value in registers. */ | |
5c8e61cf | 3295 | poly_int64 struct_value_size = 0; |
51bbfa0c RS |
3296 | /* Nonzero if called function returns an aggregate in memory PCC style, |
3297 | by returning the address of where to find it. */ | |
3298 | int pcc_struct_value = 0; | |
61f71b34 | 3299 | rtx struct_value = 0; |
51bbfa0c RS |
3300 | |
3301 | /* Number of actual parameters in this call, including struct value addr. */ | |
3302 | int num_actuals; | |
3303 | /* Number of named args. Args after this are anonymous ones | |
3304 | and they must all go on the stack. */ | |
3305 | int n_named_args; | |
078a18a4 SL |
3306 | /* Number of complex actual arguments that need to be split. */ |
3307 | int num_complex_actuals = 0; | |
51bbfa0c RS |
3308 | |
3309 | /* Vector of information about each argument. | |
3310 | Arguments are numbered in the order they will be pushed, | |
3311 | not the order they are written. */ | |
3312 | struct arg_data *args; | |
3313 | ||
3314 | /* Total size in bytes of all the stack-parms scanned so far. */ | |
3315 | struct args_size args_size; | |
099e9712 | 3316 | struct args_size adjusted_args_size; |
51bbfa0c | 3317 | /* Size of arguments before any adjustments (such as rounding). */ |
a20c5714 | 3318 | poly_int64 unadjusted_args_size; |
51bbfa0c | 3319 | /* Data on reg parms scanned so far. */ |
d5cc9181 JR |
3320 | CUMULATIVE_ARGS args_so_far_v; |
3321 | cumulative_args_t args_so_far; | |
51bbfa0c RS |
3322 | /* Nonzero if a reg parm has been scanned. */ |
3323 | int reg_parm_seen; | |
efd65a8b | 3324 | /* Nonzero if this is an indirect function call. */ |
51bbfa0c | 3325 | |
f725a3ec | 3326 | /* Nonzero if we must avoid push-insns in the args for this call. |
51bbfa0c RS |
3327 | If stack space is allocated for register parameters, but not by the |
3328 | caller, then it is preallocated in the fixed part of the stack frame. | |
3329 | So the entire argument block must then be preallocated (i.e., we | |
3330 | ignore PUSH_ROUNDING in that case). */ | |
3331 | ||
f73ad30e | 3332 | int must_preallocate = !PUSH_ARGS; |
51bbfa0c | 3333 | |
f72aed24 | 3334 | /* Size of the stack reserved for parameter registers. */ |
6f90e075 JW |
3335 | int reg_parm_stack_space = 0; |
3336 | ||
51bbfa0c RS |
3337 | /* Address of space preallocated for stack parms |
3338 | (on machines that lack push insns), or 0 if space not preallocated. */ | |
3339 | rtx argblock = 0; | |
3340 | ||
e384e6b5 | 3341 | /* Mask of ECF_ and ERF_ flags. */ |
f2d33f13 | 3342 | int flags = 0; |
e384e6b5 | 3343 | int return_flags = 0; |
f73ad30e | 3344 | #ifdef REG_PARM_STACK_SPACE |
51bbfa0c | 3345 | /* Define the boundary of the register parm stack space that needs to be |
b820d2b8 AM |
3346 | saved, if any. */ |
3347 | int low_to_save, high_to_save; | |
51bbfa0c RS |
3348 | rtx save_area = 0; /* Place that it is saved */ |
3349 | #endif | |
3350 | ||
a20c5714 | 3351 | unsigned int initial_highest_arg_in_use = highest_outgoing_arg_in_use; |
51bbfa0c | 3352 | char *initial_stack_usage_map = stack_usage_map; |
a20c5714 | 3353 | unsigned HOST_WIDE_INT initial_stack_usage_watermark = stack_usage_watermark; |
d9725c41 | 3354 | char *stack_usage_map_buf = NULL; |
51bbfa0c | 3355 | |
a20c5714 | 3356 | poly_int64 old_stack_allocated; |
38afb23f OH |
3357 | |
3358 | /* State variables to track stack modifications. */ | |
51bbfa0c | 3359 | rtx old_stack_level = 0; |
38afb23f | 3360 | int old_stack_arg_under_construction = 0; |
a20c5714 | 3361 | poly_int64 old_pending_adj = 0; |
51bbfa0c | 3362 | int old_inhibit_defer_pop = inhibit_defer_pop; |
38afb23f OH |
3363 | |
3364 | /* Some stack pointer alterations we make are performed via | |
3365 | allocate_dynamic_stack_space. This modifies the stack_pointer_delta, | |
3366 | which we then also need to save/restore along the way. */ | |
a20c5714 | 3367 | poly_int64 old_stack_pointer_delta = 0; |
38afb23f | 3368 | |
0a1c58a2 | 3369 | rtx call_fusage; |
5039610b | 3370 | tree addr = CALL_EXPR_FN (exp); |
b3694847 | 3371 | int i; |
739fb049 | 3372 | /* The alignment of the stack, in bits. */ |
95899b34 | 3373 | unsigned HOST_WIDE_INT preferred_stack_boundary; |
739fb049 | 3374 | /* The alignment of the stack, in bytes. */ |
95899b34 | 3375 | unsigned HOST_WIDE_INT preferred_unit_stack_boundary; |
6de9cd9a DN |
3376 | /* The static chain value to use for this call. */ |
3377 | rtx static_chain_value; | |
f2d33f13 JH |
3378 | /* See if this is "nothrow" function call. */ |
3379 | if (TREE_NOTHROW (exp)) | |
3380 | flags |= ECF_NOTHROW; | |
3381 | ||
6de9cd9a DN |
3382 | /* See if we can find a DECL-node for the actual function, and get the |
3383 | function attributes (flags) from the function decl or type node. */ | |
39b0dce7 JM |
3384 | fndecl = get_callee_fndecl (exp); |
3385 | if (fndecl) | |
51bbfa0c | 3386 | { |
57782ad8 | 3387 | fntype = TREE_TYPE (fndecl); |
39b0dce7 | 3388 | flags |= flags_from_decl_or_type (fndecl); |
e384e6b5 | 3389 | return_flags |= decl_return_flags (fndecl); |
51bbfa0c | 3390 | } |
39b0dce7 | 3391 | else |
72954a4f | 3392 | { |
28ed065e | 3393 | fntype = TREE_TYPE (TREE_TYPE (addr)); |
57782ad8 | 3394 | flags |= flags_from_decl_or_type (fntype); |
4c640e26 EB |
3395 | if (CALL_EXPR_BY_DESCRIPTOR (exp)) |
3396 | flags |= ECF_BY_DESCRIPTOR; | |
72954a4f | 3397 | } |
28ed065e | 3398 | rettype = TREE_TYPE (exp); |
7393c642 | 3399 | |
57782ad8 | 3400 | struct_value = targetm.calls.struct_value_rtx (fntype, 0); |
61f71b34 | 3401 | |
8c6a8269 RS |
3402 | /* Warn if this value is an aggregate type, |
3403 | regardless of which calling convention we are using for it. */ | |
28ed065e | 3404 | if (AGGREGATE_TYPE_P (rettype)) |
ccf08a6e | 3405 | warning (OPT_Waggregate_return, "function call has aggregate value"); |
8c6a8269 | 3406 | |
becfd6e5 KZ |
3407 | /* If the result of a non looping pure or const function call is |
3408 | ignored (or void), and none of its arguments are volatile, we can | |
3409 | avoid expanding the call and just evaluate the arguments for | |
3410 | side-effects. */ | |
8c6a8269 | 3411 | if ((flags & (ECF_CONST | ECF_PURE)) |
becfd6e5 | 3412 | && (!(flags & ECF_LOOPING_CONST_OR_PURE)) |
8c6a8269 | 3413 | && (ignore || target == const0_rtx |
28ed065e | 3414 | || TYPE_MODE (rettype) == VOIDmode)) |
8c6a8269 RS |
3415 | { |
3416 | bool volatilep = false; | |
3417 | tree arg; | |
078a18a4 | 3418 | call_expr_arg_iterator iter; |
8c6a8269 | 3419 | |
078a18a4 SL |
3420 | FOR_EACH_CALL_EXPR_ARG (arg, iter, exp) |
3421 | if (TREE_THIS_VOLATILE (arg)) | |
8c6a8269 RS |
3422 | { |
3423 | volatilep = true; | |
3424 | break; | |
3425 | } | |
3426 | ||
3427 | if (! volatilep) | |
3428 | { | |
078a18a4 SL |
3429 | FOR_EACH_CALL_EXPR_ARG (arg, iter, exp) |
3430 | expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
8c6a8269 RS |
3431 | return const0_rtx; |
3432 | } | |
3433 | } | |
3434 | ||
6f90e075 | 3435 | #ifdef REG_PARM_STACK_SPACE |
5d059ed9 | 3436 | reg_parm_stack_space = REG_PARM_STACK_SPACE (!fndecl ? fntype : fndecl); |
6f90e075 | 3437 | #endif |
6f90e075 | 3438 | |
5d059ed9 | 3439 | if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl))) |
81464b2c | 3440 | && reg_parm_stack_space > 0 && PUSH_ARGS) |
e5e809f4 | 3441 | must_preallocate = 1; |
e5e809f4 | 3442 | |
51bbfa0c RS |
3443 | /* Set up a place to return a structure. */ |
3444 | ||
3445 | /* Cater to broken compilers. */ | |
d47d0a8d | 3446 | if (aggregate_value_p (exp, fntype)) |
51bbfa0c RS |
3447 | { |
3448 | /* This call returns a big structure. */ | |
84b8030f | 3449 | flags &= ~(ECF_CONST | ECF_PURE | ECF_LOOPING_CONST_OR_PURE); |
51bbfa0c RS |
3450 | |
3451 | #ifdef PCC_STATIC_STRUCT_RETURN | |
9e7b1d0a RS |
3452 | { |
3453 | pcc_struct_value = 1; | |
9e7b1d0a RS |
3454 | } |
3455 | #else /* not PCC_STATIC_STRUCT_RETURN */ | |
3456 | { | |
5c8e61cf RS |
3457 | if (!poly_int_tree_p (TYPE_SIZE_UNIT (rettype), &struct_value_size)) |
3458 | struct_value_size = -1; | |
51bbfa0c | 3459 | |
391756ad EB |
3460 | /* Even if it is semantically safe to use the target as the return |
3461 | slot, it may be not sufficiently aligned for the return type. */ | |
3462 | if (CALL_EXPR_RETURN_SLOT_OPT (exp) | |
3463 | && target | |
3464 | && MEM_P (target) | |
ffc8b52f JJ |
3465 | /* If rettype is addressable, we may not create a temporary. |
3466 | If target is properly aligned at runtime and the compiler | |
3467 | just doesn't know about it, it will work fine, otherwise it | |
3468 | will be UB. */ | |
3469 | && (TREE_ADDRESSABLE (rettype) | |
3470 | || !(MEM_ALIGN (target) < TYPE_ALIGN (rettype) | |
3471 | && targetm.slow_unaligned_access (TYPE_MODE (rettype), | |
3472 | MEM_ALIGN (target))))) | |
9e7b1d0a RS |
3473 | structure_value_addr = XEXP (target, 0); |
3474 | else | |
3475 | { | |
9e7b1d0a RS |
3476 | /* For variable-sized objects, we must be called with a target |
3477 | specified. If we were to allocate space on the stack here, | |
3478 | we would have no way of knowing when to free it. */ | |
9474e8ab | 3479 | rtx d = assign_temp (rettype, 1, 1); |
4361b41d | 3480 | structure_value_addr = XEXP (d, 0); |
9e7b1d0a RS |
3481 | target = 0; |
3482 | } | |
3483 | } | |
3484 | #endif /* not PCC_STATIC_STRUCT_RETURN */ | |
51bbfa0c RS |
3485 | } |
3486 | ||
099e9712 | 3487 | /* Figure out the amount to which the stack should be aligned. */ |
099e9712 | 3488 | preferred_stack_boundary = PREFERRED_STACK_BOUNDARY; |
b255a036 JH |
3489 | if (fndecl) |
3490 | { | |
3dafb85c | 3491 | struct cgraph_rtl_info *i = cgraph_node::rtl_info (fndecl); |
17b29c0a L |
3492 | /* Without automatic stack alignment, we can't increase preferred |
3493 | stack boundary. With automatic stack alignment, it is | |
3494 | unnecessary since unless we can guarantee that all callers will | |
3495 | align the outgoing stack properly, callee has to align its | |
3496 | stack anyway. */ | |
3497 | if (i | |
3498 | && i->preferred_incoming_stack_boundary | |
3499 | && i->preferred_incoming_stack_boundary < preferred_stack_boundary) | |
b255a036 JH |
3500 | preferred_stack_boundary = i->preferred_incoming_stack_boundary; |
3501 | } | |
099e9712 JH |
3502 | |
3503 | /* Operand 0 is a pointer-to-function; get the type of the function. */ | |
09e2bf48 | 3504 | funtype = TREE_TYPE (addr); |
366de0ce | 3505 | gcc_assert (POINTER_TYPE_P (funtype)); |
099e9712 JH |
3506 | funtype = TREE_TYPE (funtype); |
3507 | ||
078a18a4 SL |
3508 | /* Count whether there are actual complex arguments that need to be split |
3509 | into their real and imaginary parts. Munge the type_arg_types | |
3510 | appropriately here as well. */ | |
42ba5130 | 3511 | if (targetm.calls.split_complex_arg) |
ded9bf77 | 3512 | { |
078a18a4 SL |
3513 | call_expr_arg_iterator iter; |
3514 | tree arg; | |
3515 | FOR_EACH_CALL_EXPR_ARG (arg, iter, exp) | |
3516 | { | |
3517 | tree type = TREE_TYPE (arg); | |
3518 | if (type && TREE_CODE (type) == COMPLEX_TYPE | |
3519 | && targetm.calls.split_complex_arg (type)) | |
3520 | num_complex_actuals++; | |
3521 | } | |
ded9bf77 | 3522 | type_arg_types = split_complex_types (TYPE_ARG_TYPES (funtype)); |
ded9bf77 AH |
3523 | } |
3524 | else | |
3525 | type_arg_types = TYPE_ARG_TYPES (funtype); | |
3526 | ||
099e9712 | 3527 | if (flags & ECF_MAY_BE_ALLOCA) |
e3b5732b | 3528 | cfun->calls_alloca = 1; |
099e9712 JH |
3529 | |
3530 | /* If struct_value_rtx is 0, it means pass the address | |
078a18a4 SL |
3531 | as if it were an extra parameter. Put the argument expression |
3532 | in structure_value_addr_value. */ | |
61f71b34 | 3533 | if (structure_value_addr && struct_value == 0) |
099e9712 JH |
3534 | { |
3535 | /* If structure_value_addr is a REG other than | |
3536 | virtual_outgoing_args_rtx, we can use always use it. If it | |
3537 | is not a REG, we must always copy it into a register. | |
3538 | If it is virtual_outgoing_args_rtx, we must copy it to another | |
3539 | register in some cases. */ | |
f8cfc6aa | 3540 | rtx temp = (!REG_P (structure_value_addr) |
099e9712 JH |
3541 | || (ACCUMULATE_OUTGOING_ARGS |
3542 | && stack_arg_under_construction | |
3543 | && structure_value_addr == virtual_outgoing_args_rtx) | |
7ae4ad28 | 3544 | ? copy_addr_to_reg (convert_memory_address |
57782ad8 | 3545 | (Pmode, structure_value_addr)) |
099e9712 JH |
3546 | : structure_value_addr); |
3547 | ||
078a18a4 SL |
3548 | structure_value_addr_value = |
3549 | make_tree (build_pointer_type (TREE_TYPE (funtype)), temp); | |
31db0fe0 | 3550 | structure_value_addr_parm = 1; |
099e9712 JH |
3551 | } |
3552 | ||
3553 | /* Count the arguments and set NUM_ACTUALS. */ | |
078a18a4 SL |
3554 | num_actuals = |
3555 | call_expr_nargs (exp) + num_complex_actuals + structure_value_addr_parm; | |
099e9712 JH |
3556 | |
3557 | /* Compute number of named args. | |
3a4d587b AM |
3558 | First, do a raw count of the args for INIT_CUMULATIVE_ARGS. */ |
3559 | ||
3560 | if (type_arg_types != 0) | |
3561 | n_named_args | |
3562 | = (list_length (type_arg_types) | |
3563 | /* Count the struct value address, if it is passed as a parm. */ | |
3564 | + structure_value_addr_parm); | |
3565 | else | |
3566 | /* If we know nothing, treat all args as named. */ | |
3567 | n_named_args = num_actuals; | |
3568 | ||
3569 | /* Start updating where the next arg would go. | |
3570 | ||
3571 | On some machines (such as the PA) indirect calls have a different | |
3572 | calling convention than normal calls. The fourth argument in | |
3573 | INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call | |
3574 | or not. */ | |
d5cc9181 JR |
3575 | INIT_CUMULATIVE_ARGS (args_so_far_v, funtype, NULL_RTX, fndecl, n_named_args); |
3576 | args_so_far = pack_cumulative_args (&args_so_far_v); | |
3a4d587b AM |
3577 | |
3578 | /* Now possibly adjust the number of named args. | |
099e9712 | 3579 | Normally, don't include the last named arg if anonymous args follow. |
3a179764 KH |
3580 | We do include the last named arg if |
3581 | targetm.calls.strict_argument_naming() returns nonzero. | |
099e9712 JH |
3582 | (If no anonymous args follow, the result of list_length is actually |
3583 | one too large. This is harmless.) | |
3584 | ||
4ac8340c | 3585 | If targetm.calls.pretend_outgoing_varargs_named() returns |
3a179764 KH |
3586 | nonzero, and targetm.calls.strict_argument_naming() returns zero, |
3587 | this machine will be able to place unnamed args that were passed | |
3588 | in registers into the stack. So treat all args as named. This | |
3589 | allows the insns emitting for a specific argument list to be | |
3590 | independent of the function declaration. | |
4ac8340c KH |
3591 | |
3592 | If targetm.calls.pretend_outgoing_varargs_named() returns zero, | |
3593 | we do not have any reliable way to pass unnamed args in | |
3594 | registers, so we must force them into memory. */ | |
099e9712 | 3595 | |
3a4d587b | 3596 | if (type_arg_types != 0 |
d5cc9181 | 3597 | && targetm.calls.strict_argument_naming (args_so_far)) |
3a4d587b AM |
3598 | ; |
3599 | else if (type_arg_types != 0 | |
d5cc9181 | 3600 | && ! targetm.calls.pretend_outgoing_varargs_named (args_so_far)) |
3a4d587b AM |
3601 | /* Don't include the last named arg. */ |
3602 | --n_named_args; | |
099e9712 | 3603 | else |
3a4d587b | 3604 | /* Treat all args as named. */ |
099e9712 JH |
3605 | n_named_args = num_actuals; |
3606 | ||
099e9712 | 3607 | /* Make a vector to hold all the information about each arg. */ |
765fc0f7 | 3608 | args = XCNEWVEC (struct arg_data, num_actuals); |
099e9712 | 3609 | |
d80d2d2a KH |
3610 | /* Build up entries in the ARGS array, compute the size of the |
3611 | arguments into ARGS_SIZE, etc. */ | |
099e9712 | 3612 | initialize_argument_information (num_actuals, args, &args_size, |
078a18a4 | 3613 | n_named_args, exp, |
45769134 | 3614 | structure_value_addr_value, fndecl, fntype, |
d5cc9181 | 3615 | args_so_far, reg_parm_stack_space, |
099e9712 | 3616 | &old_stack_level, &old_pending_adj, |
dd292d0a | 3617 | &must_preallocate, &flags, |
6de9cd9a | 3618 | &try_tail_call, CALL_FROM_THUNK_P (exp)); |
099e9712 JH |
3619 | |
3620 | if (args_size.var) | |
84b8030f | 3621 | must_preallocate = 1; |
099e9712 JH |
3622 | |
3623 | /* Now make final decision about preallocating stack space. */ | |
3624 | must_preallocate = finalize_must_preallocate (must_preallocate, | |
3625 | num_actuals, args, | |
3626 | &args_size); | |
3627 | ||
3628 | /* If the structure value address will reference the stack pointer, we | |
3629 | must stabilize it. We don't need to do this if we know that we are | |
3630 | not going to adjust the stack pointer in processing this call. */ | |
3631 | ||
3632 | if (structure_value_addr | |
3633 | && (reg_mentioned_p (virtual_stack_dynamic_rtx, structure_value_addr) | |
3634 | || reg_mentioned_p (virtual_outgoing_args_rtx, | |
3635 | structure_value_addr)) | |
3636 | && (args_size.var | |
a20c5714 RS |
3637 | || (!ACCUMULATE_OUTGOING_ARGS |
3638 | && maybe_ne (args_size.constant, 0)))) | |
099e9712 | 3639 | structure_value_addr = copy_to_reg (structure_value_addr); |
0a1c58a2 | 3640 | |
7ae4ad28 | 3641 | /* Tail calls can make things harder to debug, and we've traditionally |
194c7c45 | 3642 | pushed these optimizations into -O2. Don't try if we're already |
fb158467 | 3643 | expanding a call, as that means we're an argument. Don't try if |
3fbd86b1 | 3644 | there's cleanups, as we know there's code to follow the call. */ |
099e9712 | 3645 | if (currently_expanding_call++ != 0 |
44662f68 | 3646 | || (!flag_optimize_sibling_calls && !CALL_FROM_THUNK_P (exp)) |
6de9cd9a | 3647 | || args_size.var |
6fb5fa3c | 3648 | || dbg_cnt (tail_call) == false) |
6de9cd9a | 3649 | try_tail_call = 0; |
099e9712 | 3650 | |
4b8e35f1 JJ |
3651 | /* Workaround buggy C/C++ wrappers around Fortran routines with |
3652 | character(len=constant) arguments if the hidden string length arguments | |
3653 | are passed on the stack; if the callers forget to pass those arguments, | |
3654 | attempting to tail call in such routines leads to stack corruption. | |
3655 | Avoid tail calls in functions where at least one such hidden string | |
3656 | length argument is passed (partially or fully) on the stack in the | |
3657 | caller and the callee needs to pass any arguments on the stack. | |
3658 | See PR90329. */ | |
3659 | if (try_tail_call && maybe_ne (args_size.constant, 0)) | |
3660 | for (tree arg = DECL_ARGUMENTS (current_function_decl); | |
3661 | arg; arg = DECL_CHAIN (arg)) | |
3662 | if (DECL_HIDDEN_STRING_LENGTH (arg) && DECL_INCOMING_RTL (arg)) | |
3663 | { | |
3664 | subrtx_iterator::array_type array; | |
3665 | FOR_EACH_SUBRTX (iter, array, DECL_INCOMING_RTL (arg), NONCONST) | |
3666 | if (MEM_P (*iter)) | |
3667 | { | |
3668 | try_tail_call = 0; | |
3669 | break; | |
3670 | } | |
3671 | } | |
3672 | ||
9a385c2d DM |
3673 | /* If the user has marked the function as requiring tail-call |
3674 | optimization, attempt it. */ | |
3675 | if (must_tail_call) | |
3676 | try_tail_call = 1; | |
3677 | ||
099e9712 | 3678 | /* Rest of purposes for tail call optimizations to fail. */ |
b40d90e6 | 3679 | if (try_tail_call) |
9a385c2d DM |
3680 | try_tail_call = can_implement_as_sibling_call_p (exp, |
3681 | structure_value_addr, | |
3682 | funtype, | |
3683 | reg_parm_stack_space, | |
3684 | fndecl, | |
b40d90e6 | 3685 | flags, addr, args_size); |
497eb8c3 | 3686 | |
c69cd1f5 JJ |
3687 | /* Check if caller and callee disagree in promotion of function |
3688 | return value. */ | |
3689 | if (try_tail_call) | |
3690 | { | |
ef4bddc2 RS |
3691 | machine_mode caller_mode, caller_promoted_mode; |
3692 | machine_mode callee_mode, callee_promoted_mode; | |
c69cd1f5 JJ |
3693 | int caller_unsignedp, callee_unsignedp; |
3694 | tree caller_res = DECL_RESULT (current_function_decl); | |
3695 | ||
3696 | caller_unsignedp = TYPE_UNSIGNED (TREE_TYPE (caller_res)); | |
cde0f3fd | 3697 | caller_mode = DECL_MODE (caller_res); |
c69cd1f5 | 3698 | callee_unsignedp = TYPE_UNSIGNED (TREE_TYPE (funtype)); |
cde0f3fd PB |
3699 | callee_mode = TYPE_MODE (TREE_TYPE (funtype)); |
3700 | caller_promoted_mode | |
3701 | = promote_function_mode (TREE_TYPE (caller_res), caller_mode, | |
3702 | &caller_unsignedp, | |
3703 | TREE_TYPE (current_function_decl), 1); | |
3704 | callee_promoted_mode | |
666e3ceb | 3705 | = promote_function_mode (TREE_TYPE (funtype), callee_mode, |
cde0f3fd | 3706 | &callee_unsignedp, |
666e3ceb | 3707 | funtype, 1); |
c69cd1f5 JJ |
3708 | if (caller_mode != VOIDmode |
3709 | && (caller_promoted_mode != callee_promoted_mode | |
3710 | || ((caller_mode != caller_promoted_mode | |
3711 | || callee_mode != callee_promoted_mode) | |
3712 | && (caller_unsignedp != callee_unsignedp | |
bd4288c0 | 3713 | || partial_subreg_p (caller_mode, callee_mode))))) |
9a385c2d DM |
3714 | { |
3715 | try_tail_call = 0; | |
3716 | maybe_complain_about_tail_call (exp, | |
3717 | "caller and callee disagree in" | |
3718 | " promotion of function" | |
3719 | " return value"); | |
3720 | } | |
c69cd1f5 JJ |
3721 | } |
3722 | ||
01973e26 L |
3723 | /* Ensure current function's preferred stack boundary is at least |
3724 | what we need. Stack alignment may also increase preferred stack | |
3725 | boundary. */ | |
957ed738 L |
3726 | for (i = 0; i < num_actuals; i++) |
3727 | if (reg_parm_stack_space > 0 | |
3728 | || args[i].reg == 0 | |
3729 | || args[i].partial != 0 | |
3730 | || args[i].pass_on_stack) | |
3731 | update_stack_alignment_for_call (&args[i].locate); | |
b5f772ce | 3732 | if (crtl->preferred_stack_boundary < preferred_stack_boundary) |
cb91fab0 | 3733 | crtl->preferred_stack_boundary = preferred_stack_boundary; |
01973e26 L |
3734 | else |
3735 | preferred_stack_boundary = crtl->preferred_stack_boundary; | |
c2f8b491 | 3736 | |
099e9712 | 3737 | preferred_unit_stack_boundary = preferred_stack_boundary / BITS_PER_UNIT; |
497eb8c3 | 3738 | |
0a1c58a2 JL |
3739 | /* We want to make two insn chains; one for a sibling call, the other |
3740 | for a normal call. We will select one of the two chains after | |
3741 | initial RTL generation is complete. */ | |
b820d2b8 | 3742 | for (pass = try_tail_call ? 0 : 1; pass < 2; pass++) |
0a1c58a2 JL |
3743 | { |
3744 | int sibcall_failure = 0; | |
f5143c46 | 3745 | /* We want to emit any pending stack adjustments before the tail |
0a1c58a2 | 3746 | recursion "call". That way we know any adjustment after the tail |
7ae4ad28 | 3747 | recursion call can be ignored if we indeed use the tail |
0a1c58a2 | 3748 | call expansion. */ |
7f2f0a01 | 3749 | saved_pending_stack_adjust save; |
48810515 DM |
3750 | rtx_insn *insns, *before_call, *after_args; |
3751 | rtx next_arg_reg; | |
39842893 | 3752 | |
0a1c58a2 JL |
3753 | if (pass == 0) |
3754 | { | |
0a1c58a2 JL |
3755 | /* State variables we need to save and restore between |
3756 | iterations. */ | |
7f2f0a01 | 3757 | save_pending_stack_adjust (&save); |
0a1c58a2 | 3758 | } |
f2d33f13 JH |
3759 | if (pass) |
3760 | flags &= ~ECF_SIBCALL; | |
3761 | else | |
3762 | flags |= ECF_SIBCALL; | |
51bbfa0c | 3763 | |
0a1c58a2 | 3764 | /* Other state variables that we must reinitialize each time |
f2d33f13 | 3765 | through the loop (that are not initialized by the loop itself). */ |
0a1c58a2 JL |
3766 | argblock = 0; |
3767 | call_fusage = 0; | |
fa76d9e0 | 3768 | |
f725a3ec | 3769 | /* Start a new sequence for the normal call case. |
51bbfa0c | 3770 | |
0a1c58a2 JL |
3771 | From this point on, if the sibling call fails, we want to set |
3772 | sibcall_failure instead of continuing the loop. */ | |
3773 | start_sequence (); | |
eecb6f50 | 3774 | |
0a1c58a2 JL |
3775 | /* Don't let pending stack adjusts add up to too much. |
3776 | Also, do all pending adjustments now if there is any chance | |
3777 | this might be a call to alloca or if we are expanding a sibling | |
9dd9bf80 | 3778 | call sequence. |
63579539 DJ |
3779 | Also do the adjustments before a throwing call, otherwise |
3780 | exception handling can fail; PR 19225. */ | |
a20c5714 RS |
3781 | if (maybe_ge (pending_stack_adjust, 32) |
3782 | || (maybe_ne (pending_stack_adjust, 0) | |
9dd9bf80 | 3783 | && (flags & ECF_MAY_BE_ALLOCA)) |
a20c5714 | 3784 | || (maybe_ne (pending_stack_adjust, 0) |
63579539 | 3785 | && flag_exceptions && !(flags & ECF_NOTHROW)) |
0a1c58a2 JL |
3786 | || pass == 0) |
3787 | do_pending_stack_adjust (); | |
51bbfa0c | 3788 | |
0a1c58a2 | 3789 | /* Precompute any arguments as needed. */ |
f8a097cd | 3790 | if (pass) |
84b8030f | 3791 | precompute_arguments (num_actuals, args); |
51bbfa0c | 3792 | |
0a1c58a2 JL |
3793 | /* Now we are about to start emitting insns that can be deleted |
3794 | if a libcall is deleted. */ | |
84b8030f | 3795 | if (pass && (flags & ECF_MALLOC)) |
0a1c58a2 | 3796 | start_sequence (); |
51bbfa0c | 3797 | |
87a5dc2d JW |
3798 | if (pass == 0 |
3799 | && crtl->stack_protect_guard | |
3800 | && targetm.stack_protect_runtime_enabled_p ()) | |
b755446c RH |
3801 | stack_protect_epilogue (); |
3802 | ||
099e9712 | 3803 | adjusted_args_size = args_size; |
ce48579b RH |
3804 | /* Compute the actual size of the argument block required. The variable |
3805 | and constant sizes must be combined, the size may have to be rounded, | |
3806 | and there may be a minimum required size. When generating a sibcall | |
3807 | pattern, do not round up, since we'll be re-using whatever space our | |
3808 | caller provided. */ | |
3809 | unadjusted_args_size | |
f725a3ec KH |
3810 | = compute_argument_block_size (reg_parm_stack_space, |
3811 | &adjusted_args_size, | |
5d059ed9 | 3812 | fndecl, fntype, |
ce48579b RH |
3813 | (pass == 0 ? 0 |
3814 | : preferred_stack_boundary)); | |
3815 | ||
f725a3ec | 3816 | old_stack_allocated = stack_pointer_delta - pending_stack_adjust; |
ce48579b | 3817 | |
f8a097cd | 3818 | /* The argument block when performing a sibling call is the |
c22cacf3 | 3819 | incoming argument block. */ |
f8a097cd | 3820 | if (pass == 0) |
c67846f2 | 3821 | { |
2e3f842f | 3822 | argblock = crtl->args.internal_arg_pointer; |
76e048a8 KT |
3823 | if (STACK_GROWS_DOWNWARD) |
3824 | argblock | |
3825 | = plus_constant (Pmode, argblock, crtl->args.pretend_args_size); | |
3826 | else | |
3827 | argblock | |
3828 | = plus_constant (Pmode, argblock, -crtl->args.pretend_args_size); | |
3829 | ||
a20c5714 RS |
3830 | HOST_WIDE_INT map_size = constant_lower_bound (args_size.constant); |
3831 | stored_args_map = sbitmap_alloc (map_size); | |
f61e445a | 3832 | bitmap_clear (stored_args_map); |
a20c5714 | 3833 | stored_args_watermark = HOST_WIDE_INT_M1U; |
c67846f2 | 3834 | } |
ce48579b | 3835 | |
0a1c58a2 JL |
3836 | /* If we have no actual push instructions, or shouldn't use them, |
3837 | make space for all args right now. */ | |
099e9712 | 3838 | else if (adjusted_args_size.var != 0) |
51bbfa0c | 3839 | { |
0a1c58a2 JL |
3840 | if (old_stack_level == 0) |
3841 | { | |
9eac0f2a | 3842 | emit_stack_save (SAVE_BLOCK, &old_stack_level); |
38afb23f | 3843 | old_stack_pointer_delta = stack_pointer_delta; |
0a1c58a2 JL |
3844 | old_pending_adj = pending_stack_adjust; |
3845 | pending_stack_adjust = 0; | |
0a1c58a2 JL |
3846 | /* stack_arg_under_construction says whether a stack arg is |
3847 | being constructed at the old stack level. Pushing the stack | |
3848 | gets a clean outgoing argument block. */ | |
3849 | old_stack_arg_under_construction = stack_arg_under_construction; | |
3850 | stack_arg_under_construction = 0; | |
0a1c58a2 | 3851 | } |
099e9712 | 3852 | argblock = push_block (ARGS_SIZE_RTX (adjusted_args_size), 0, 0); |
a11e0df4 | 3853 | if (flag_stack_usage_info) |
d3c12306 | 3854 | current_function_has_unbounded_dynamic_stack_size = 1; |
51bbfa0c | 3855 | } |
0a1c58a2 JL |
3856 | else |
3857 | { | |
3858 | /* Note that we must go through the motions of allocating an argument | |
3859 | block even if the size is zero because we may be storing args | |
3860 | in the area reserved for register arguments, which may be part of | |
3861 | the stack frame. */ | |
26a258fe | 3862 | |
a20c5714 | 3863 | poly_int64 needed = adjusted_args_size.constant; |
51bbfa0c | 3864 | |
0a1c58a2 JL |
3865 | /* Store the maximum argument space used. It will be pushed by |
3866 | the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow | |
3867 | checking). */ | |
51bbfa0c | 3868 | |
a20c5714 RS |
3869 | crtl->outgoing_args_size = upper_bound (crtl->outgoing_args_size, |
3870 | needed); | |
51bbfa0c | 3871 | |
0a1c58a2 JL |
3872 | if (must_preallocate) |
3873 | { | |
f73ad30e JH |
3874 | if (ACCUMULATE_OUTGOING_ARGS) |
3875 | { | |
f8a097cd JH |
3876 | /* Since the stack pointer will never be pushed, it is |
3877 | possible for the evaluation of a parm to clobber | |
3878 | something we have already written to the stack. | |
3879 | Since most function calls on RISC machines do not use | |
3880 | the stack, this is uncommon, but must work correctly. | |
26a258fe | 3881 | |
f73ad30e | 3882 | Therefore, we save any area of the stack that was already |
f8a097cd JH |
3883 | written and that we are using. Here we set up to do this |
3884 | by making a new stack usage map from the old one. The | |
f725a3ec | 3885 | actual save will be done by store_one_arg. |
26a258fe | 3886 | |
f73ad30e JH |
3887 | Another approach might be to try to reorder the argument |
3888 | evaluations to avoid this conflicting stack usage. */ | |
26a258fe | 3889 | |
f8a097cd JH |
3890 | /* Since we will be writing into the entire argument area, |
3891 | the map must be allocated for its entire size, not just | |
3892 | the part that is the responsibility of the caller. */ | |
5d059ed9 | 3893 | if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl)))) |
ac294f0b | 3894 | needed += reg_parm_stack_space; |
51bbfa0c | 3895 | |
a20c5714 | 3896 | poly_int64 limit = needed; |
6dad9361 | 3897 | if (ARGS_GROW_DOWNWARD) |
a20c5714 RS |
3898 | limit += 1; |
3899 | ||
3900 | /* For polynomial sizes, this is the maximum possible | |
3901 | size needed for arguments with a constant size | |
3902 | and offset. */ | |
3903 | HOST_WIDE_INT const_limit = constant_lower_bound (limit); | |
3904 | highest_outgoing_arg_in_use | |
3905 | = MAX (initial_highest_arg_in_use, const_limit); | |
6dad9361 | 3906 | |
04695783 | 3907 | free (stack_usage_map_buf); |
5ed6ace5 | 3908 | stack_usage_map_buf = XNEWVEC (char, highest_outgoing_arg_in_use); |
d9725c41 | 3909 | stack_usage_map = stack_usage_map_buf; |
51bbfa0c | 3910 | |
f73ad30e | 3911 | if (initial_highest_arg_in_use) |
2e09e75a JM |
3912 | memcpy (stack_usage_map, initial_stack_usage_map, |
3913 | initial_highest_arg_in_use); | |
2f4aa534 | 3914 | |
f73ad30e | 3915 | if (initial_highest_arg_in_use != highest_outgoing_arg_in_use) |
961192e1 | 3916 | memset (&stack_usage_map[initial_highest_arg_in_use], 0, |
f73ad30e JH |
3917 | (highest_outgoing_arg_in_use |
3918 | - initial_highest_arg_in_use)); | |
3919 | needed = 0; | |
2f4aa534 | 3920 | |
f8a097cd JH |
3921 | /* The address of the outgoing argument list must not be |
3922 | copied to a register here, because argblock would be left | |
3923 | pointing to the wrong place after the call to | |
f725a3ec | 3924 | allocate_dynamic_stack_space below. */ |
2f4aa534 | 3925 | |
f73ad30e | 3926 | argblock = virtual_outgoing_args_rtx; |
f725a3ec | 3927 | } |
f73ad30e | 3928 | else |
26a258fe | 3929 | { |
a20c5714 RS |
3930 | /* Try to reuse some or all of the pending_stack_adjust |
3931 | to get this space. */ | |
3932 | if (inhibit_defer_pop == 0 | |
3933 | && (combine_pending_stack_adjustment_and_call | |
3934 | (&needed, | |
3935 | unadjusted_args_size, | |
3936 | &adjusted_args_size, | |
3937 | preferred_unit_stack_boundary))) | |
0a1c58a2 | 3938 | { |
ce48579b RH |
3939 | /* combine_pending_stack_adjustment_and_call computes |
3940 | an adjustment before the arguments are allocated. | |
3941 | Account for them and see whether or not the stack | |
3942 | needs to go up or down. */ | |
3943 | needed = unadjusted_args_size - needed; | |
3944 | ||
a20c5714 RS |
3945 | /* Checked by |
3946 | combine_pending_stack_adjustment_and_call. */ | |
3947 | gcc_checking_assert (ordered_p (needed, 0)); | |
3948 | if (maybe_lt (needed, 0)) | |
f73ad30e | 3949 | { |
ce48579b RH |
3950 | /* We're releasing stack space. */ |
3951 | /* ??? We can avoid any adjustment at all if we're | |
3952 | already aligned. FIXME. */ | |
3953 | pending_stack_adjust = -needed; | |
3954 | do_pending_stack_adjust (); | |
f73ad30e JH |
3955 | needed = 0; |
3956 | } | |
f725a3ec | 3957 | else |
ce48579b RH |
3958 | /* We need to allocate space. We'll do that in |
3959 | push_block below. */ | |
3960 | pending_stack_adjust = 0; | |
0a1c58a2 | 3961 | } |
ce48579b RH |
3962 | |
3963 | /* Special case this because overhead of `push_block' in | |
3964 | this case is non-trivial. */ | |
a20c5714 | 3965 | if (known_eq (needed, 0)) |
f73ad30e | 3966 | argblock = virtual_outgoing_args_rtx; |
0a1c58a2 | 3967 | else |
d892f288 | 3968 | { |
a20c5714 RS |
3969 | rtx needed_rtx = gen_int_mode (needed, Pmode); |
3970 | argblock = push_block (needed_rtx, 0, 0); | |
6dad9361 TS |
3971 | if (ARGS_GROW_DOWNWARD) |
3972 | argblock = plus_constant (Pmode, argblock, needed); | |
d892f288 | 3973 | } |
f73ad30e | 3974 | |
f8a097cd JH |
3975 | /* We only really need to call `copy_to_reg' in the case |
3976 | where push insns are going to be used to pass ARGBLOCK | |
3977 | to a function call in ARGS. In that case, the stack | |
3978 | pointer changes value from the allocation point to the | |
3979 | call point, and hence the value of | |
3980 | VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might | |
3981 | as well always do it. */ | |
f73ad30e | 3982 | argblock = copy_to_reg (argblock); |
38afb23f OH |
3983 | } |
3984 | } | |
3985 | } | |
0a1c58a2 | 3986 | |
38afb23f OH |
3987 | if (ACCUMULATE_OUTGOING_ARGS) |
3988 | { | |
3989 | /* The save/restore code in store_one_arg handles all | |
3990 | cases except one: a constructor call (including a C | |
3991 | function returning a BLKmode struct) to initialize | |
3992 | an argument. */ | |
3993 | if (stack_arg_under_construction) | |
3994 | { | |
ac294f0b | 3995 | rtx push_size |
a20c5714 RS |
3996 | = (gen_int_mode |
3997 | (adjusted_args_size.constant | |
3998 | + (OUTGOING_REG_PARM_STACK_SPACE (!fndecl ? fntype | |
3999 | : TREE_TYPE (fndecl)) | |
4000 | ? 0 : reg_parm_stack_space), Pmode)); | |
38afb23f OH |
4001 | if (old_stack_level == 0) |
4002 | { | |
9eac0f2a | 4003 | emit_stack_save (SAVE_BLOCK, &old_stack_level); |
38afb23f OH |
4004 | old_stack_pointer_delta = stack_pointer_delta; |
4005 | old_pending_adj = pending_stack_adjust; | |
4006 | pending_stack_adjust = 0; | |
4007 | /* stack_arg_under_construction says whether a stack | |
4008 | arg is being constructed at the old stack level. | |
4009 | Pushing the stack gets a clean outgoing argument | |
4010 | block. */ | |
4011 | old_stack_arg_under_construction | |
4012 | = stack_arg_under_construction; | |
4013 | stack_arg_under_construction = 0; | |
4014 | /* Make a new map for the new argument list. */ | |
04695783 | 4015 | free (stack_usage_map_buf); |
b9eae1a9 | 4016 | stack_usage_map_buf = XCNEWVEC (char, highest_outgoing_arg_in_use); |
d9725c41 | 4017 | stack_usage_map = stack_usage_map_buf; |
38afb23f | 4018 | highest_outgoing_arg_in_use = 0; |
a20c5714 | 4019 | stack_usage_watermark = HOST_WIDE_INT_M1U; |
f73ad30e | 4020 | } |
d3c12306 EB |
4021 | /* We can pass TRUE as the 4th argument because we just |
4022 | saved the stack pointer and will restore it right after | |
4023 | the call. */ | |
9e878cf1 EB |
4024 | allocate_dynamic_stack_space (push_size, 0, BIGGEST_ALIGNMENT, |
4025 | -1, true); | |
0a1c58a2 | 4026 | } |
bfbf933a | 4027 | |
38afb23f OH |
4028 | /* If argument evaluation might modify the stack pointer, |
4029 | copy the address of the argument list to a register. */ | |
4030 | for (i = 0; i < num_actuals; i++) | |
4031 | if (args[i].pass_on_stack) | |
4032 | { | |
4033 | argblock = copy_addr_to_reg (argblock); | |
4034 | break; | |
4035 | } | |
4036 | } | |
d329e058 | 4037 | |
0a1c58a2 | 4038 | compute_argument_addresses (args, argblock, num_actuals); |
bfbf933a | 4039 | |
5ba53785 UB |
4040 | /* Stack is properly aligned, pops can't safely be deferred during |
4041 | the evaluation of the arguments. */ | |
4042 | NO_DEFER_POP; | |
4043 | ||
ac4ee457 UB |
4044 | /* Precompute all register parameters. It isn't safe to compute |
4045 | anything once we have started filling any specific hard regs. | |
4046 | TLS symbols sometimes need a call to resolve. Precompute | |
4047 | register parameters before any stack pointer manipulation | |
4048 | to avoid unaligned stack in the called function. */ | |
4049 | precompute_register_parameters (num_actuals, args, ®_parm_seen); | |
4050 | ||
5ba53785 UB |
4051 | OK_DEFER_POP; |
4052 | ||
3d9684ae JG |
4053 | /* Perform stack alignment before the first push (the last arg). */ |
4054 | if (argblock == 0 | |
a20c5714 RS |
4055 | && maybe_gt (adjusted_args_size.constant, reg_parm_stack_space) |
4056 | && maybe_ne (adjusted_args_size.constant, unadjusted_args_size)) | |
4e217aed | 4057 | { |
0a1c58a2 JL |
4058 | /* When the stack adjustment is pending, we get better code |
4059 | by combining the adjustments. */ | |
a20c5714 RS |
4060 | if (maybe_ne (pending_stack_adjust, 0) |
4061 | && ! inhibit_defer_pop | |
4062 | && (combine_pending_stack_adjustment_and_call | |
4063 | (&pending_stack_adjust, | |
4064 | unadjusted_args_size, | |
4065 | &adjusted_args_size, | |
4066 | preferred_unit_stack_boundary))) | |
4067 | do_pending_stack_adjust (); | |
0a1c58a2 | 4068 | else if (argblock == 0) |
a20c5714 RS |
4069 | anti_adjust_stack (gen_int_mode (adjusted_args_size.constant |
4070 | - unadjusted_args_size, | |
4071 | Pmode)); | |
0a1c58a2 | 4072 | } |
ebcd0b57 JH |
4073 | /* Now that the stack is properly aligned, pops can't safely |
4074 | be deferred during the evaluation of the arguments. */ | |
4075 | NO_DEFER_POP; | |
51bbfa0c | 4076 | |
d3c12306 EB |
4077 | /* Record the maximum pushed stack space size. We need to delay |
4078 | doing it this far to take into account the optimization done | |
4079 | by combine_pending_stack_adjustment_and_call. */ | |
a11e0df4 | 4080 | if (flag_stack_usage_info |
d3c12306 EB |
4081 | && !ACCUMULATE_OUTGOING_ARGS |
4082 | && pass | |
4083 | && adjusted_args_size.var == 0) | |
4084 | { | |
a20c5714 RS |
4085 | poly_int64 pushed = (adjusted_args_size.constant |
4086 | + pending_stack_adjust); | |
4087 | current_function_pushed_stack_size | |
4088 | = upper_bound (current_function_pushed_stack_size, pushed); | |
d3c12306 EB |
4089 | } |
4090 | ||
09e2bf48 | 4091 | funexp = rtx_for_function_call (fndecl, addr); |
51bbfa0c | 4092 | |
5039610b SL |
4093 | if (CALL_EXPR_STATIC_CHAIN (exp)) |
4094 | static_chain_value = expand_normal (CALL_EXPR_STATIC_CHAIN (exp)); | |
6de9cd9a DN |
4095 | else |
4096 | static_chain_value = 0; | |
4097 | ||
f73ad30e | 4098 | #ifdef REG_PARM_STACK_SPACE |
0a1c58a2 JL |
4099 | /* Save the fixed argument area if it's part of the caller's frame and |
4100 | is clobbered by argument setup for this call. */ | |
f8a097cd | 4101 | if (ACCUMULATE_OUTGOING_ARGS && pass) |
f73ad30e JH |
4102 | save_area = save_fixed_argument_area (reg_parm_stack_space, argblock, |
4103 | &low_to_save, &high_to_save); | |
b94301c2 | 4104 | #endif |
51bbfa0c | 4105 | |
0a1c58a2 JL |
4106 | /* Now store (and compute if necessary) all non-register parms. |
4107 | These come before register parms, since they can require block-moves, | |
4108 | which could clobber the registers used for register parms. | |
4109 | Parms which have partial registers are not stored here, | |
4110 | but we do preallocate space here if they want that. */ | |
51bbfa0c | 4111 | |
0a1c58a2 | 4112 | for (i = 0; i < num_actuals; i++) |
0196c95e | 4113 | { |
31db0fe0 | 4114 | if (args[i].reg == 0 || args[i].pass_on_stack) |
0196c95e | 4115 | { |
48810515 | 4116 | rtx_insn *before_arg = get_last_insn (); |
0196c95e | 4117 | |
ddc923b5 MP |
4118 | /* We don't allow passing huge (> 2^30 B) arguments |
4119 | by value. It would cause an overflow later on. */ | |
a20c5714 | 4120 | if (constant_lower_bound (adjusted_args_size.constant) |
ddc923b5 MP |
4121 | >= (1 << (HOST_BITS_PER_INT - 2))) |
4122 | { | |
4123 | sorry ("passing too large argument on stack"); | |
4124 | continue; | |
4125 | } | |
4126 | ||
0196c95e JJ |
4127 | if (store_one_arg (&args[i], argblock, flags, |
4128 | adjusted_args_size.var != 0, | |
4129 | reg_parm_stack_space) | |
4130 | || (pass == 0 | |
4131 | && check_sibcall_argument_overlap (before_arg, | |
4132 | &args[i], 1))) | |
4133 | sibcall_failure = 1; | |
4134 | } | |
4135 | ||
2b1c5433 | 4136 | if (args[i].stack) |
7d810276 JJ |
4137 | call_fusage |
4138 | = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args[i].tree_value)), | |
4139 | gen_rtx_USE (VOIDmode, args[i].stack), | |
4140 | call_fusage); | |
0196c95e | 4141 | } |
0a1c58a2 JL |
4142 | |
4143 | /* If we have a parm that is passed in registers but not in memory | |
4144 | and whose alignment does not permit a direct copy into registers, | |
4145 | make a group of pseudos that correspond to each register that we | |
4146 | will later fill. */ | |
4147 | if (STRICT_ALIGNMENT) | |
4148 | store_unaligned_arguments_into_pseudos (args, num_actuals); | |
4149 | ||
4150 | /* Now store any partially-in-registers parm. | |
4151 | This is the last place a block-move can happen. */ | |
4152 | if (reg_parm_seen) | |
4153 | for (i = 0; i < num_actuals; i++) | |
4154 | if (args[i].partial != 0 && ! args[i].pass_on_stack) | |
c67846f2 | 4155 | { |
48810515 | 4156 | rtx_insn *before_arg = get_last_insn (); |
c67846f2 | 4157 | |
99206968 KT |
4158 | /* On targets with weird calling conventions (e.g. PA) it's |
4159 | hard to ensure that all cases of argument overlap between | |
4160 | stack and registers work. Play it safe and bail out. */ | |
4161 | if (ARGS_GROW_DOWNWARD && !STACK_GROWS_DOWNWARD) | |
4162 | { | |
4163 | sibcall_failure = 1; | |
4164 | break; | |
4165 | } | |
4166 | ||
4c6b3b2a JJ |
4167 | if (store_one_arg (&args[i], argblock, flags, |
4168 | adjusted_args_size.var != 0, | |
4169 | reg_parm_stack_space) | |
4170 | || (pass == 0 | |
4171 | && check_sibcall_argument_overlap (before_arg, | |
0cdca92b | 4172 | &args[i], 1))) |
c67846f2 JJ |
4173 | sibcall_failure = 1; |
4174 | } | |
51bbfa0c | 4175 | |
2f21e1ba BS |
4176 | bool any_regs = false; |
4177 | for (i = 0; i < num_actuals; i++) | |
4178 | if (args[i].reg != NULL_RTX) | |
4179 | { | |
4180 | any_regs = true; | |
4181 | targetm.calls.call_args (args[i].reg, funtype); | |
4182 | } | |
4183 | if (!any_regs) | |
4184 | targetm.calls.call_args (pc_rtx, funtype); | |
4185 | ||
4186 | /* Figure out the register where the value, if any, will come back. */ | |
4187 | valreg = 0; | |
2f21e1ba BS |
4188 | if (TYPE_MODE (rettype) != VOIDmode |
4189 | && ! structure_value_addr) | |
4190 | { | |
4191 | if (pcc_struct_value) | |
31db0fe0 ML |
4192 | valreg = hard_function_value (build_pointer_type (rettype), |
4193 | fndecl, NULL, (pass == 0)); | |
2f21e1ba | 4194 | else |
31db0fe0 ML |
4195 | valreg = hard_function_value (rettype, fndecl, fntype, |
4196 | (pass == 0)); | |
2f21e1ba BS |
4197 | |
4198 | /* If VALREG is a PARALLEL whose first member has a zero | |
4199 | offset, use that. This is for targets such as m68k that | |
4200 | return the same value in multiple places. */ | |
4201 | if (GET_CODE (valreg) == PARALLEL) | |
4202 | { | |
4203 | rtx elem = XVECEXP (valreg, 0, 0); | |
4204 | rtx where = XEXP (elem, 0); | |
4205 | rtx offset = XEXP (elem, 1); | |
4206 | if (offset == const0_rtx | |
4207 | && GET_MODE (where) == GET_MODE (valreg)) | |
4208 | valreg = where; | |
4209 | } | |
4210 | } | |
4211 | ||
0a1c58a2 JL |
4212 | /* If register arguments require space on the stack and stack space |
4213 | was not preallocated, allocate stack space here for arguments | |
4214 | passed in registers. */ | |
5d059ed9 | 4215 | if (OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl))) |
81464b2c | 4216 | && !ACCUMULATE_OUTGOING_ARGS |
f725a3ec | 4217 | && must_preallocate == 0 && reg_parm_stack_space > 0) |
0a1c58a2 | 4218 | anti_adjust_stack (GEN_INT (reg_parm_stack_space)); |
756e0e12 | 4219 | |
0a1c58a2 JL |
4220 | /* Pass the function the address in which to return a |
4221 | structure value. */ | |
4222 | if (pass != 0 && structure_value_addr && ! structure_value_addr_parm) | |
4223 | { | |
7ae4ad28 | 4224 | structure_value_addr |
5ae6cd0d | 4225 | = convert_memory_address (Pmode, structure_value_addr); |
61f71b34 | 4226 | emit_move_insn (struct_value, |
0a1c58a2 JL |
4227 | force_reg (Pmode, |
4228 | force_operand (structure_value_addr, | |
4229 | NULL_RTX))); | |
4230 | ||
f8cfc6aa | 4231 | if (REG_P (struct_value)) |
61f71b34 | 4232 | use_reg (&call_fusage, struct_value); |
0a1c58a2 | 4233 | } |
c2939b57 | 4234 | |
05e6ee93 | 4235 | after_args = get_last_insn (); |
78bcf3dc EB |
4236 | funexp = prepare_call_address (fndecl ? fndecl : fntype, funexp, |
4237 | static_chain_value, &call_fusage, | |
4238 | reg_parm_seen, flags); | |
6b8805cf | 4239 | |
0cdca92b DJ |
4240 | load_register_parameters (args, num_actuals, &call_fusage, flags, |
4241 | pass == 0, &sibcall_failure); | |
f725a3ec | 4242 | |
0a1c58a2 JL |
4243 | /* Save a pointer to the last insn before the call, so that we can |
4244 | later safely search backwards to find the CALL_INSN. */ | |
4245 | before_call = get_last_insn (); | |
51bbfa0c | 4246 | |
7d167afd JJ |
4247 | /* Set up next argument register. For sibling calls on machines |
4248 | with register windows this should be the incoming register. */ | |
7d167afd | 4249 | if (pass == 0) |
d5cc9181 | 4250 | next_arg_reg = targetm.calls.function_incoming_arg (args_so_far, |
3c07301f NF |
4251 | VOIDmode, |
4252 | void_type_node, | |
4253 | true); | |
7d167afd | 4254 | else |
d5cc9181 | 4255 | next_arg_reg = targetm.calls.function_arg (args_so_far, |
3c07301f NF |
4256 | VOIDmode, void_type_node, |
4257 | true); | |
7d167afd | 4258 | |
e384e6b5 BS |
4259 | if (pass == 1 && (return_flags & ERF_RETURNS_ARG)) |
4260 | { | |
4261 | int arg_nr = return_flags & ERF_RETURN_ARG_MASK; | |
3d9684ae | 4262 | arg_nr = num_actuals - arg_nr - 1; |
b3681f13 TV |
4263 | if (arg_nr >= 0 |
4264 | && arg_nr < num_actuals | |
4265 | && args[arg_nr].reg | |
e384e6b5 BS |
4266 | && valreg |
4267 | && REG_P (valreg) | |
4268 | && GET_MODE (args[arg_nr].reg) == GET_MODE (valreg)) | |
4269 | call_fusage | |
4270 | = gen_rtx_EXPR_LIST (TYPE_MODE (TREE_TYPE (args[arg_nr].tree_value)), | |
f7df4a84 | 4271 | gen_rtx_SET (valreg, args[arg_nr].reg), |
e384e6b5 BS |
4272 | call_fusage); |
4273 | } | |
0a1c58a2 JL |
4274 | /* All arguments and registers used for the call must be set up by |
4275 | now! */ | |
4276 | ||
ce48579b | 4277 | /* Stack must be properly aligned now. */ |
366de0ce | 4278 | gcc_assert (!pass |
a20c5714 RS |
4279 | || multiple_p (stack_pointer_delta, |
4280 | preferred_unit_stack_boundary)); | |
ebcd0b57 | 4281 | |
0a1c58a2 | 4282 | /* Generate the actual call instruction. */ |
6de9cd9a | 4283 | emit_call_1 (funexp, exp, fndecl, funtype, unadjusted_args_size, |
099e9712 | 4284 | adjusted_args_size.constant, struct_value_size, |
7d167afd | 4285 | next_arg_reg, valreg, old_inhibit_defer_pop, call_fusage, |
d5cc9181 | 4286 | flags, args_so_far); |
0a1c58a2 | 4287 | |
1e288103 | 4288 | if (flag_ipa_ra) |
4f660b15 | 4289 | { |
48810515 DM |
4290 | rtx_call_insn *last; |
4291 | rtx datum = NULL_RTX; | |
4f660b15 RO |
4292 | if (fndecl != NULL_TREE) |
4293 | { | |
4294 | datum = XEXP (DECL_RTL (fndecl), 0); | |
4295 | gcc_assert (datum != NULL_RTX | |
4296 | && GET_CODE (datum) == SYMBOL_REF); | |
4297 | } | |
4298 | last = last_call_insn (); | |
4299 | add_reg_note (last, REG_CALL_DECL, datum); | |
4300 | } | |
4301 | ||
05e6ee93 MM |
4302 | /* If the call setup or the call itself overlaps with anything |
4303 | of the argument setup we probably clobbered our call address. | |
4304 | In that case we can't do sibcalls. */ | |
4305 | if (pass == 0 | |
4306 | && check_sibcall_argument_overlap (after_args, 0, 0)) | |
4307 | sibcall_failure = 1; | |
4308 | ||
bef5d8b6 RS |
4309 | /* If a non-BLKmode value is returned at the most significant end |
4310 | of a register, shift the register right by the appropriate amount | |
4311 | and update VALREG accordingly. BLKmode values are handled by the | |
4312 | group load/store machinery below. */ | |
4313 | if (!structure_value_addr | |
4314 | && !pcc_struct_value | |
66de4d7c | 4315 | && TYPE_MODE (rettype) != VOIDmode |
28ed065e | 4316 | && TYPE_MODE (rettype) != BLKmode |
66de4d7c | 4317 | && REG_P (valreg) |
28ed065e | 4318 | && targetm.calls.return_in_msb (rettype)) |
bef5d8b6 | 4319 | { |
28ed065e | 4320 | if (shift_return_value (TYPE_MODE (rettype), false, valreg)) |
bef5d8b6 | 4321 | sibcall_failure = 1; |
28ed065e | 4322 | valreg = gen_rtx_REG (TYPE_MODE (rettype), REGNO (valreg)); |
bef5d8b6 RS |
4323 | } |
4324 | ||
84b8030f | 4325 | if (pass && (flags & ECF_MALLOC)) |
0a1c58a2 JL |
4326 | { |
4327 | rtx temp = gen_reg_rtx (GET_MODE (valreg)); | |
48810515 | 4328 | rtx_insn *last, *insns; |
0a1c58a2 | 4329 | |
f725a3ec | 4330 | /* The return value from a malloc-like function is a pointer. */ |
28ed065e | 4331 | if (TREE_CODE (rettype) == POINTER_TYPE) |
d154bfa2 | 4332 | mark_reg_pointer (temp, MALLOC_ABI_ALIGNMENT); |
0a1c58a2 JL |
4333 | |
4334 | emit_move_insn (temp, valreg); | |
4335 | ||
67914693 | 4336 | /* The return value from a malloc-like function cannot alias |
0a1c58a2 JL |
4337 | anything else. */ |
4338 | last = get_last_insn (); | |
65c5f2a6 | 4339 | add_reg_note (last, REG_NOALIAS, temp); |
0a1c58a2 JL |
4340 | |
4341 | /* Write out the sequence. */ | |
4342 | insns = get_insns (); | |
4343 | end_sequence (); | |
2f937369 | 4344 | emit_insn (insns); |
0a1c58a2 JL |
4345 | valreg = temp; |
4346 | } | |
51bbfa0c | 4347 | |
6fb5fa3c DB |
4348 | /* For calls to `setjmp', etc., inform |
4349 | function.c:setjmp_warnings that it should complain if | |
4350 | nonvolatile values are live. For functions that cannot | |
4351 | return, inform flow that control does not fall through. */ | |
51bbfa0c | 4352 | |
6e14af16 | 4353 | if ((flags & ECF_NORETURN) || pass == 0) |
c2939b57 | 4354 | { |
570a98eb | 4355 | /* The barrier must be emitted |
0a1c58a2 JL |
4356 | immediately after the CALL_INSN. Some ports emit more |
4357 | than just a CALL_INSN above, so we must search for it here. */ | |
51bbfa0c | 4358 | |
48810515 | 4359 | rtx_insn *last = get_last_insn (); |
4b4bf941 | 4360 | while (!CALL_P (last)) |
0a1c58a2 JL |
4361 | { |
4362 | last = PREV_INSN (last); | |
4363 | /* There was no CALL_INSN? */ | |
366de0ce | 4364 | gcc_assert (last != before_call); |
0a1c58a2 | 4365 | } |
51bbfa0c | 4366 | |
570a98eb | 4367 | emit_barrier_after (last); |
8af61113 | 4368 | |
f451eeef JS |
4369 | /* Stack adjustments after a noreturn call are dead code. |
4370 | However when NO_DEFER_POP is in effect, we must preserve | |
4371 | stack_pointer_delta. */ | |
4372 | if (inhibit_defer_pop == 0) | |
4373 | { | |
4374 | stack_pointer_delta = old_stack_allocated; | |
4375 | pending_stack_adjust = 0; | |
4376 | } | |
0a1c58a2 | 4377 | } |
51bbfa0c | 4378 | |
0a1c58a2 | 4379 | /* If value type not void, return an rtx for the value. */ |
51bbfa0c | 4380 | |
28ed065e | 4381 | if (TYPE_MODE (rettype) == VOIDmode |
0a1c58a2 | 4382 | || ignore) |
b5cd4ed4 | 4383 | target = const0_rtx; |
0a1c58a2 JL |
4384 | else if (structure_value_addr) |
4385 | { | |
3c0cb5de | 4386 | if (target == 0 || !MEM_P (target)) |
0a1c58a2 | 4387 | { |
3bdf5ad1 | 4388 | target |
28ed065e MM |
4389 | = gen_rtx_MEM (TYPE_MODE (rettype), |
4390 | memory_address (TYPE_MODE (rettype), | |
3bdf5ad1 | 4391 | structure_value_addr)); |
28ed065e | 4392 | set_mem_attributes (target, rettype, 1); |
0a1c58a2 JL |
4393 | } |
4394 | } | |
4395 | else if (pcc_struct_value) | |
cacbd532 | 4396 | { |
0a1c58a2 JL |
4397 | /* This is the special C++ case where we need to |
4398 | know what the true target was. We take care to | |
4399 | never use this value more than once in one expression. */ | |
28ed065e | 4400 | target = gen_rtx_MEM (TYPE_MODE (rettype), |
0a1c58a2 | 4401 | copy_to_reg (valreg)); |
28ed065e | 4402 | set_mem_attributes (target, rettype, 1); |
cacbd532 | 4403 | } |
0a1c58a2 JL |
4404 | /* Handle calls that return values in multiple non-contiguous locations. |
4405 | The Irix 6 ABI has examples of this. */ | |
4406 | else if (GET_CODE (valreg) == PARALLEL) | |
4407 | { | |
6de9cd9a | 4408 | if (target == 0) |
5ef0b50d | 4409 | target = emit_group_move_into_temps (valreg); |
1d1b7dc4 RS |
4410 | else if (rtx_equal_p (target, valreg)) |
4411 | ; | |
4412 | else if (GET_CODE (target) == PARALLEL) | |
4413 | /* Handle the result of a emit_group_move_into_temps | |
4414 | call in the previous pass. */ | |
4415 | emit_group_move (target, valreg); | |
4416 | else | |
28ed065e MM |
4417 | emit_group_store (target, valreg, rettype, |
4418 | int_size_in_bytes (rettype)); | |
0a1c58a2 JL |
4419 | } |
4420 | else if (target | |
28ed065e | 4421 | && GET_MODE (target) == TYPE_MODE (rettype) |
0a1c58a2 JL |
4422 | && GET_MODE (target) == GET_MODE (valreg)) |
4423 | { | |
51caaefe EB |
4424 | bool may_overlap = false; |
4425 | ||
f2d18690 KK |
4426 | /* We have to copy a return value in a CLASS_LIKELY_SPILLED hard |
4427 | reg to a plain register. */ | |
3fb30019 RS |
4428 | if (!REG_P (target) || HARD_REGISTER_P (target)) |
4429 | valreg = avoid_likely_spilled_reg (valreg); | |
f2d18690 | 4430 | |
51caaefe EB |
4431 | /* If TARGET is a MEM in the argument area, and we have |
4432 | saved part of the argument area, then we can't store | |
4433 | directly into TARGET as it may get overwritten when we | |
4434 | restore the argument save area below. Don't work too | |
4435 | hard though and simply force TARGET to a register if it | |
4436 | is a MEM; the optimizer is quite likely to sort it out. */ | |
4437 | if (ACCUMULATE_OUTGOING_ARGS && pass && MEM_P (target)) | |
4438 | for (i = 0; i < num_actuals; i++) | |
4439 | if (args[i].save_area) | |
4440 | { | |
4441 | may_overlap = true; | |
4442 | break; | |
4443 | } | |
0219237c | 4444 | |
51caaefe EB |
4445 | if (may_overlap) |
4446 | target = copy_to_reg (valreg); | |
4447 | else | |
4448 | { | |
4449 | /* TARGET and VALREG cannot be equal at this point | |
4450 | because the latter would not have | |
4451 | REG_FUNCTION_VALUE_P true, while the former would if | |
4452 | it were referring to the same register. | |
4453 | ||
4454 | If they refer to the same register, this move will be | |
4455 | a no-op, except when function inlining is being | |
4456 | done. */ | |
4457 | emit_move_insn (target, valreg); | |
4458 | ||
4459 | /* If we are setting a MEM, this code must be executed. | |
4460 | Since it is emitted after the call insn, sibcall | |
4461 | optimization cannot be performed in that case. */ | |
4462 | if (MEM_P (target)) | |
4463 | sibcall_failure = 1; | |
4464 | } | |
0a1c58a2 | 4465 | } |
0a1c58a2 | 4466 | else |
3fb30019 | 4467 | target = copy_to_reg (avoid_likely_spilled_reg (valreg)); |
51bbfa0c | 4468 | |
cde0f3fd PB |
4469 | /* If we promoted this return value, make the proper SUBREG. |
4470 | TARGET might be const0_rtx here, so be careful. */ | |
4471 | if (REG_P (target) | |
28ed065e MM |
4472 | && TYPE_MODE (rettype) != BLKmode |
4473 | && GET_MODE (target) != TYPE_MODE (rettype)) | |
61f71b34 | 4474 | { |
28ed065e | 4475 | tree type = rettype; |
cde0f3fd | 4476 | int unsignedp = TYPE_UNSIGNED (type); |
ef4bddc2 | 4477 | machine_mode pmode; |
cde0f3fd PB |
4478 | |
4479 | /* Ensure we promote as expected, and get the new unsignedness. */ | |
4480 | pmode = promote_function_mode (type, TYPE_MODE (type), &unsignedp, | |
4481 | funtype, 1); | |
4482 | gcc_assert (GET_MODE (target) == pmode); | |
4483 | ||
91914e56 RS |
4484 | poly_uint64 offset = subreg_lowpart_offset (TYPE_MODE (type), |
4485 | GET_MODE (target)); | |
cde0f3fd PB |
4486 | target = gen_rtx_SUBREG (TYPE_MODE (type), target, offset); |
4487 | SUBREG_PROMOTED_VAR_P (target) = 1; | |
362d42dc | 4488 | SUBREG_PROMOTED_SET (target, unsignedp); |
61f71b34 | 4489 | } |
84b55618 | 4490 | |
0a1c58a2 JL |
4491 | /* If size of args is variable or this was a constructor call for a stack |
4492 | argument, restore saved stack-pointer value. */ | |
51bbfa0c | 4493 | |
9dd9bf80 | 4494 | if (old_stack_level) |
0a1c58a2 | 4495 | { |
48810515 | 4496 | rtx_insn *prev = get_last_insn (); |
9a08d230 | 4497 | |
9eac0f2a | 4498 | emit_stack_restore (SAVE_BLOCK, old_stack_level); |
38afb23f | 4499 | stack_pointer_delta = old_stack_pointer_delta; |
9a08d230 | 4500 | |
faf7a23d | 4501 | fixup_args_size_notes (prev, get_last_insn (), stack_pointer_delta); |
9a08d230 | 4502 | |
0a1c58a2 | 4503 | pending_stack_adjust = old_pending_adj; |
d25cee4d | 4504 | old_stack_allocated = stack_pointer_delta - pending_stack_adjust; |
0a1c58a2 JL |
4505 | stack_arg_under_construction = old_stack_arg_under_construction; |
4506 | highest_outgoing_arg_in_use = initial_highest_arg_in_use; | |
4507 | stack_usage_map = initial_stack_usage_map; | |
a20c5714 | 4508 | stack_usage_watermark = initial_stack_usage_watermark; |
0a1c58a2 JL |
4509 | sibcall_failure = 1; |
4510 | } | |
f8a097cd | 4511 | else if (ACCUMULATE_OUTGOING_ARGS && pass) |
0a1c58a2 | 4512 | { |
51bbfa0c | 4513 | #ifdef REG_PARM_STACK_SPACE |
0a1c58a2 | 4514 | if (save_area) |
b820d2b8 AM |
4515 | restore_fixed_argument_area (save_area, argblock, |
4516 | high_to_save, low_to_save); | |
b94301c2 | 4517 | #endif |
51bbfa0c | 4518 | |
0a1c58a2 JL |
4519 | /* If we saved any argument areas, restore them. */ |
4520 | for (i = 0; i < num_actuals; i++) | |
4521 | if (args[i].save_area) | |
4522 | { | |
ef4bddc2 | 4523 | machine_mode save_mode = GET_MODE (args[i].save_area); |
0a1c58a2 JL |
4524 | rtx stack_area |
4525 | = gen_rtx_MEM (save_mode, | |
4526 | memory_address (save_mode, | |
4527 | XEXP (args[i].stack_slot, 0))); | |
4528 | ||
4529 | if (save_mode != BLKmode) | |
4530 | emit_move_insn (stack_area, args[i].save_area); | |
4531 | else | |
44bb111a | 4532 | emit_block_move (stack_area, args[i].save_area, |
a20c5714 RS |
4533 | (gen_int_mode |
4534 | (args[i].locate.size.constant, Pmode)), | |
44bb111a | 4535 | BLOCK_OP_CALL_PARM); |
0a1c58a2 | 4536 | } |
51bbfa0c | 4537 | |
0a1c58a2 JL |
4538 | highest_outgoing_arg_in_use = initial_highest_arg_in_use; |
4539 | stack_usage_map = initial_stack_usage_map; | |
a20c5714 | 4540 | stack_usage_watermark = initial_stack_usage_watermark; |
0a1c58a2 | 4541 | } |
51bbfa0c | 4542 | |
d33606c3 EB |
4543 | /* If this was alloca, record the new stack level. */ |
4544 | if (flags & ECF_MAY_BE_ALLOCA) | |
4545 | record_new_stack_level (); | |
51bbfa0c | 4546 | |
0a1c58a2 JL |
4547 | /* Free up storage we no longer need. */ |
4548 | for (i = 0; i < num_actuals; ++i) | |
04695783 | 4549 | free (args[i].aligned_regs); |
0a1c58a2 | 4550 | |
2f21e1ba BS |
4551 | targetm.calls.end_call_args (); |
4552 | ||
0a1c58a2 JL |
4553 | insns = get_insns (); |
4554 | end_sequence (); | |
4555 | ||
4556 | if (pass == 0) | |
4557 | { | |
4558 | tail_call_insns = insns; | |
4559 | ||
0a1c58a2 JL |
4560 | /* Restore the pending stack adjustment now that we have |
4561 | finished generating the sibling call sequence. */ | |
1503a7ec | 4562 | |
7f2f0a01 | 4563 | restore_pending_stack_adjust (&save); |
099e9712 JH |
4564 | |
4565 | /* Prepare arg structure for next iteration. */ | |
f725a3ec | 4566 | for (i = 0; i < num_actuals; i++) |
099e9712 JH |
4567 | { |
4568 | args[i].value = 0; | |
4569 | args[i].aligned_regs = 0; | |
4570 | args[i].stack = 0; | |
4571 | } | |
c67846f2 JJ |
4572 | |
4573 | sbitmap_free (stored_args_map); | |
48810515 | 4574 | internal_arg_pointer_exp_state.scan_start = NULL; |
9771b263 | 4575 | internal_arg_pointer_exp_state.cache.release (); |
0a1c58a2 JL |
4576 | } |
4577 | else | |
38afb23f OH |
4578 | { |
4579 | normal_call_insns = insns; | |
4580 | ||
4581 | /* Verify that we've deallocated all the stack we used. */ | |
6e14af16 | 4582 | gcc_assert ((flags & ECF_NORETURN) |
a20c5714 RS |
4583 | || known_eq (old_stack_allocated, |
4584 | stack_pointer_delta | |
4585 | - pending_stack_adjust)); | |
38afb23f | 4586 | } |
fadb729c JJ |
4587 | |
4588 | /* If something prevents making this a sibling call, | |
4589 | zero out the sequence. */ | |
4590 | if (sibcall_failure) | |
48810515 | 4591 | tail_call_insns = NULL; |
6de9cd9a DN |
4592 | else |
4593 | break; | |
0a1c58a2 JL |
4594 | } |
4595 | ||
1ea7e6ad | 4596 | /* If tail call production succeeded, we need to remove REG_EQUIV notes on |
6de9cd9a DN |
4597 | arguments too, as argument area is now clobbered by the call. */ |
4598 | if (tail_call_insns) | |
0a1c58a2 | 4599 | { |
6de9cd9a | 4600 | emit_insn (tail_call_insns); |
e3b5732b | 4601 | crtl->tail_call_emit = true; |
0a1c58a2 JL |
4602 | } |
4603 | else | |
9a385c2d DM |
4604 | { |
4605 | emit_insn (normal_call_insns); | |
4606 | if (try_tail_call) | |
4607 | /* Ideally we'd emit a message for all of the ways that it could | |
4608 | have failed. */ | |
4609 | maybe_complain_about_tail_call (exp, "tail call production failed"); | |
4610 | } | |
51bbfa0c | 4611 | |
0a1c58a2 | 4612 | currently_expanding_call--; |
8e6a59fe | 4613 | |
04695783 | 4614 | free (stack_usage_map_buf); |
765fc0f7 | 4615 | free (args); |
51bbfa0c RS |
4616 | return target; |
4617 | } | |
ded9bf77 | 4618 | |
6de9cd9a DN |
4619 | /* A sibling call sequence invalidates any REG_EQUIV notes made for |
4620 | this function's incoming arguments. | |
4621 | ||
4622 | At the start of RTL generation we know the only REG_EQUIV notes | |
29d51cdb SB |
4623 | in the rtl chain are those for incoming arguments, so we can look |
4624 | for REG_EQUIV notes between the start of the function and the | |
4625 | NOTE_INSN_FUNCTION_BEG. | |
6de9cd9a DN |
4626 | |
4627 | This is (slight) overkill. We could keep track of the highest | |
4628 | argument we clobber and be more selective in removing notes, but it | |
4629 | does not seem to be worth the effort. */ | |
29d51cdb | 4630 | |
6de9cd9a DN |
4631 | void |
4632 | fixup_tail_calls (void) | |
4633 | { | |
48810515 | 4634 | rtx_insn *insn; |
29d51cdb SB |
4635 | |
4636 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
4637 | { | |
a31830a7 SB |
4638 | rtx note; |
4639 | ||
29d51cdb SB |
4640 | /* There are never REG_EQUIV notes for the incoming arguments |
4641 | after the NOTE_INSN_FUNCTION_BEG note, so stop if we see it. */ | |
4642 | if (NOTE_P (insn) | |
a38e7aa5 | 4643 | && NOTE_KIND (insn) == NOTE_INSN_FUNCTION_BEG) |
29d51cdb SB |
4644 | break; |
4645 | ||
a31830a7 SB |
4646 | note = find_reg_note (insn, REG_EQUIV, 0); |
4647 | if (note) | |
4648 | remove_note (insn, note); | |
4649 | note = find_reg_note (insn, REG_EQUIV, 0); | |
4650 | gcc_assert (!note); | |
29d51cdb | 4651 | } |
6de9cd9a DN |
4652 | } |
4653 | ||
ded9bf77 AH |
4654 | /* Traverse a list of TYPES and expand all complex types into their |
4655 | components. */ | |
2f2b4a02 | 4656 | static tree |
ded9bf77 AH |
4657 | split_complex_types (tree types) |
4658 | { | |
4659 | tree p; | |
4660 | ||
42ba5130 RH |
4661 | /* Before allocating memory, check for the common case of no complex. */ |
4662 | for (p = types; p; p = TREE_CHAIN (p)) | |
4663 | { | |
4664 | tree type = TREE_VALUE (p); | |
4665 | if (TREE_CODE (type) == COMPLEX_TYPE | |
4666 | && targetm.calls.split_complex_arg (type)) | |
c22cacf3 | 4667 | goto found; |
42ba5130 RH |
4668 | } |
4669 | return types; | |
4670 | ||
4671 | found: | |
ded9bf77 AH |
4672 | types = copy_list (types); |
4673 | ||
4674 | for (p = types; p; p = TREE_CHAIN (p)) | |
4675 | { | |
4676 | tree complex_type = TREE_VALUE (p); | |
4677 | ||
42ba5130 RH |
4678 | if (TREE_CODE (complex_type) == COMPLEX_TYPE |
4679 | && targetm.calls.split_complex_arg (complex_type)) | |
ded9bf77 AH |
4680 | { |
4681 | tree next, imag; | |
4682 | ||
4683 | /* Rewrite complex type with component type. */ | |
4684 | TREE_VALUE (p) = TREE_TYPE (complex_type); | |
4685 | next = TREE_CHAIN (p); | |
4686 | ||
4687 | /* Add another component type for the imaginary part. */ | |
4688 | imag = build_tree_list (NULL_TREE, TREE_VALUE (p)); | |
4689 | TREE_CHAIN (p) = imag; | |
4690 | TREE_CHAIN (imag) = next; | |
4691 | ||
4692 | /* Skip the newly created node. */ | |
4693 | p = TREE_CHAIN (p); | |
4694 | } | |
4695 | } | |
4696 | ||
4697 | return types; | |
4698 | } | |
51bbfa0c | 4699 | \f |
db69559b RS |
4700 | /* Output a library call to function ORGFUN (a SYMBOL_REF rtx) |
4701 | for a value of mode OUTMODE, | |
4702 | with NARGS different arguments, passed as ARGS. | |
4703 | Store the return value if RETVAL is nonzero: store it in VALUE if | |
4704 | VALUE is nonnull, otherwise pick a convenient location. In either | |
4705 | case return the location of the stored value. | |
8ac61af7 | 4706 | |
db69559b RS |
4707 | FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for |
4708 | `const' calls, LCT_PURE for `pure' calls, or another LCT_ value for | |
4709 | other types of library calls. */ | |
4710 | ||
4711 | rtx | |
d329e058 AJ |
4712 | emit_library_call_value_1 (int retval, rtx orgfun, rtx value, |
4713 | enum libcall_type fn_type, | |
db69559b | 4714 | machine_mode outmode, int nargs, rtx_mode_t *args) |
43bc5f13 | 4715 | { |
3c0fca12 RH |
4716 | /* Total size in bytes of all the stack-parms scanned so far. */ |
4717 | struct args_size args_size; | |
4718 | /* Size of arguments before any adjustments (such as rounding). */ | |
4719 | struct args_size original_args_size; | |
b3694847 | 4720 | int argnum; |
3c0fca12 | 4721 | rtx fun; |
81464b2c KT |
4722 | /* Todo, choose the correct decl type of orgfun. Sadly this information |
4723 | isn't present here, so we default to native calling abi here. */ | |
033df0b9 | 4724 | tree fndecl ATTRIBUTE_UNUSED = NULL_TREE; /* library calls default to host calling abi ? */ |
5d059ed9 | 4725 | tree fntype ATTRIBUTE_UNUSED = NULL_TREE; /* library calls default to host calling abi ? */ |
3c0fca12 | 4726 | int count; |
3c0fca12 | 4727 | rtx argblock = 0; |
d5cc9181 JR |
4728 | CUMULATIVE_ARGS args_so_far_v; |
4729 | cumulative_args_t args_so_far; | |
f725a3ec KH |
4730 | struct arg |
4731 | { | |
4732 | rtx value; | |
ef4bddc2 | 4733 | machine_mode mode; |
f725a3ec KH |
4734 | rtx reg; |
4735 | int partial; | |
e7949876 | 4736 | struct locate_and_pad_arg_data locate; |
f725a3ec KH |
4737 | rtx save_area; |
4738 | }; | |
3c0fca12 RH |
4739 | struct arg *argvec; |
4740 | int old_inhibit_defer_pop = inhibit_defer_pop; | |
4741 | rtx call_fusage = 0; | |
4742 | rtx mem_value = 0; | |
5591ee6f | 4743 | rtx valreg; |
3c0fca12 | 4744 | int pcc_struct_value = 0; |
cf098191 | 4745 | poly_int64 struct_value_size = 0; |
52a11cbf | 4746 | int flags; |
3c0fca12 | 4747 | int reg_parm_stack_space = 0; |
a20c5714 | 4748 | poly_int64 needed; |
48810515 | 4749 | rtx_insn *before_call; |
0ed4bf92 | 4750 | bool have_push_fusage; |
b0c48229 | 4751 | tree tfom; /* type_for_mode (outmode, 0) */ |
3c0fca12 | 4752 | |
f73ad30e | 4753 | #ifdef REG_PARM_STACK_SPACE |
3c0fca12 RH |
4754 | /* Define the boundary of the register parm stack space that needs to be |
4755 | save, if any. */ | |
726a989a | 4756 | int low_to_save = 0, high_to_save = 0; |
f725a3ec | 4757 | rtx save_area = 0; /* Place that it is saved. */ |
3c0fca12 RH |
4758 | #endif |
4759 | ||
3c0fca12 | 4760 | /* Size of the stack reserved for parameter registers. */ |
a20c5714 | 4761 | unsigned int initial_highest_arg_in_use = highest_outgoing_arg_in_use; |
3c0fca12 | 4762 | char *initial_stack_usage_map = stack_usage_map; |
a20c5714 | 4763 | unsigned HOST_WIDE_INT initial_stack_usage_watermark = stack_usage_watermark; |
d9725c41 | 4764 | char *stack_usage_map_buf = NULL; |
3c0fca12 | 4765 | |
61f71b34 DD |
4766 | rtx struct_value = targetm.calls.struct_value_rtx (0, 0); |
4767 | ||
3c0fca12 | 4768 | #ifdef REG_PARM_STACK_SPACE |
3c0fca12 | 4769 | reg_parm_stack_space = REG_PARM_STACK_SPACE ((tree) 0); |
3c0fca12 RH |
4770 | #endif |
4771 | ||
0529235d | 4772 | /* By default, library functions cannot throw. */ |
52a11cbf RH |
4773 | flags = ECF_NOTHROW; |
4774 | ||
9555a122 RH |
4775 | switch (fn_type) |
4776 | { | |
4777 | case LCT_NORMAL: | |
53d4257f | 4778 | break; |
9555a122 | 4779 | case LCT_CONST: |
53d4257f JH |
4780 | flags |= ECF_CONST; |
4781 | break; | |
9555a122 | 4782 | case LCT_PURE: |
53d4257f | 4783 | flags |= ECF_PURE; |
9555a122 | 4784 | break; |
9555a122 RH |
4785 | case LCT_NORETURN: |
4786 | flags |= ECF_NORETURN; | |
4787 | break; | |
4788 | case LCT_THROW: | |
0529235d | 4789 | flags &= ~ECF_NOTHROW; |
9555a122 | 4790 | break; |
9defc9b7 RH |
4791 | case LCT_RETURNS_TWICE: |
4792 | flags = ECF_RETURNS_TWICE; | |
4793 | break; | |
9555a122 | 4794 | } |
3c0fca12 RH |
4795 | fun = orgfun; |
4796 | ||
3c0fca12 RH |
4797 | /* Ensure current function's preferred stack boundary is at least |
4798 | what we need. */ | |
cb91fab0 JH |
4799 | if (crtl->preferred_stack_boundary < PREFERRED_STACK_BOUNDARY) |
4800 | crtl->preferred_stack_boundary = PREFERRED_STACK_BOUNDARY; | |
3c0fca12 RH |
4801 | |
4802 | /* If this kind of value comes back in memory, | |
4803 | decide where in memory it should come back. */ | |
b0c48229 | 4804 | if (outmode != VOIDmode) |
3c0fca12 | 4805 | { |
ae2bcd98 | 4806 | tfom = lang_hooks.types.type_for_mode (outmode, 0); |
61f71b34 | 4807 | if (aggregate_value_p (tfom, 0)) |
b0c48229 | 4808 | { |
3c0fca12 | 4809 | #ifdef PCC_STATIC_STRUCT_RETURN |
b0c48229 | 4810 | rtx pointer_reg |
1d636cc6 | 4811 | = hard_function_value (build_pointer_type (tfom), 0, 0, 0); |
b0c48229 NB |
4812 | mem_value = gen_rtx_MEM (outmode, pointer_reg); |
4813 | pcc_struct_value = 1; | |
4814 | if (value == 0) | |
4815 | value = gen_reg_rtx (outmode); | |
3c0fca12 | 4816 | #else /* not PCC_STATIC_STRUCT_RETURN */ |
b0c48229 | 4817 | struct_value_size = GET_MODE_SIZE (outmode); |
3c0cb5de | 4818 | if (value != 0 && MEM_P (value)) |
b0c48229 NB |
4819 | mem_value = value; |
4820 | else | |
9474e8ab | 4821 | mem_value = assign_temp (tfom, 1, 1); |
3c0fca12 | 4822 | #endif |
b0c48229 | 4823 | /* This call returns a big structure. */ |
84b8030f | 4824 | flags &= ~(ECF_CONST | ECF_PURE | ECF_LOOPING_CONST_OR_PURE); |
b0c48229 | 4825 | } |
3c0fca12 | 4826 | } |
b0c48229 NB |
4827 | else |
4828 | tfom = void_type_node; | |
3c0fca12 RH |
4829 | |
4830 | /* ??? Unfinished: must pass the memory address as an argument. */ | |
4831 | ||
4832 | /* Copy all the libcall-arguments out of the varargs data | |
4833 | and into a vector ARGVEC. | |
4834 | ||
4835 | Compute how to pass each argument. We only support a very small subset | |
4836 | of the full argument passing conventions to limit complexity here since | |
4837 | library functions shouldn't have many args. */ | |
4838 | ||
f883e0a7 | 4839 | argvec = XALLOCAVEC (struct arg, nargs + 1); |
703ad42b | 4840 | memset (argvec, 0, (nargs + 1) * sizeof (struct arg)); |
3c0fca12 | 4841 | |
97fc4caf | 4842 | #ifdef INIT_CUMULATIVE_LIBCALL_ARGS |
d5cc9181 | 4843 | INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far_v, outmode, fun); |
97fc4caf | 4844 | #else |
d5cc9181 | 4845 | INIT_CUMULATIVE_ARGS (args_so_far_v, NULL_TREE, fun, 0, nargs); |
97fc4caf | 4846 | #endif |
d5cc9181 | 4847 | args_so_far = pack_cumulative_args (&args_so_far_v); |
3c0fca12 RH |
4848 | |
4849 | args_size.constant = 0; | |
4850 | args_size.var = 0; | |
4851 | ||
4852 | count = 0; | |
4853 | ||
4854 | push_temp_slots (); | |
4855 | ||
4856 | /* If there's a structure value address to be passed, | |
4857 | either pass it in the special place, or pass it as an extra argument. */ | |
61f71b34 | 4858 | if (mem_value && struct_value == 0 && ! pcc_struct_value) |
3c0fca12 RH |
4859 | { |
4860 | rtx addr = XEXP (mem_value, 0); | |
c22cacf3 | 4861 | |
3c0fca12 RH |
4862 | nargs++; |
4863 | ||
ee88d9aa MK |
4864 | /* Make sure it is a reasonable operand for a move or push insn. */ |
4865 | if (!REG_P (addr) && !MEM_P (addr) | |
1a627b35 RS |
4866 | && !(CONSTANT_P (addr) |
4867 | && targetm.legitimate_constant_p (Pmode, addr))) | |
ee88d9aa MK |
4868 | addr = force_operand (addr, NULL_RTX); |
4869 | ||
3c0fca12 RH |
4870 | argvec[count].value = addr; |
4871 | argvec[count].mode = Pmode; | |
4872 | argvec[count].partial = 0; | |
4873 | ||
d5cc9181 | 4874 | argvec[count].reg = targetm.calls.function_arg (args_so_far, |
3c07301f | 4875 | Pmode, NULL_TREE, true); |
d5cc9181 | 4876 | gcc_assert (targetm.calls.arg_partial_bytes (args_so_far, Pmode, |
78a52f11 | 4877 | NULL_TREE, 1) == 0); |
3c0fca12 RH |
4878 | |
4879 | locate_and_pad_parm (Pmode, NULL_TREE, | |
a4d5044f | 4880 | #ifdef STACK_PARMS_IN_REG_PARM_AREA |
c22cacf3 | 4881 | 1, |
a4d5044f CM |
4882 | #else |
4883 | argvec[count].reg != 0, | |
4884 | #endif | |
2e4ceca5 UW |
4885 | reg_parm_stack_space, 0, |
4886 | NULL_TREE, &args_size, &argvec[count].locate); | |
3c0fca12 | 4887 | |
3c0fca12 RH |
4888 | if (argvec[count].reg == 0 || argvec[count].partial != 0 |
4889 | || reg_parm_stack_space > 0) | |
e7949876 | 4890 | args_size.constant += argvec[count].locate.size.constant; |
3c0fca12 | 4891 | |
d5cc9181 | 4892 | targetm.calls.function_arg_advance (args_so_far, Pmode, (tree) 0, true); |
3c0fca12 RH |
4893 | |
4894 | count++; | |
4895 | } | |
4896 | ||
db69559b | 4897 | for (unsigned int i = 0; count < nargs; i++, count++) |
3c0fca12 | 4898 | { |
db69559b RS |
4899 | rtx val = args[i].first; |
4900 | machine_mode mode = args[i].second; | |
5e617be8 | 4901 | int unsigned_p = 0; |
3c0fca12 RH |
4902 | |
4903 | /* We cannot convert the arg value to the mode the library wants here; | |
4904 | must do it earlier where we know the signedness of the arg. */ | |
366de0ce NS |
4905 | gcc_assert (mode != BLKmode |
4906 | && (GET_MODE (val) == mode || GET_MODE (val) == VOIDmode)); | |
3c0fca12 | 4907 | |
ee88d9aa MK |
4908 | /* Make sure it is a reasonable operand for a move or push insn. */ |
4909 | if (!REG_P (val) && !MEM_P (val) | |
1a627b35 | 4910 | && !(CONSTANT_P (val) && targetm.legitimate_constant_p (mode, val))) |
ee88d9aa MK |
4911 | val = force_operand (val, NULL_RTX); |
4912 | ||
d5cc9181 | 4913 | if (pass_by_reference (&args_so_far_v, mode, NULL_TREE, 1)) |
3c0fca12 | 4914 | { |
f474c6f8 | 4915 | rtx slot; |
6cdd5672 | 4916 | int must_copy |
d5cc9181 | 4917 | = !reference_callee_copied (&args_so_far_v, mode, NULL_TREE, 1); |
f474c6f8 | 4918 | |
becfd6e5 KZ |
4919 | /* If this was a CONST function, it is now PURE since it now |
4920 | reads memory. */ | |
99a32567 DM |
4921 | if (flags & ECF_CONST) |
4922 | { | |
4923 | flags &= ~ECF_CONST; | |
4924 | flags |= ECF_PURE; | |
4925 | } | |
4926 | ||
e0c68ce9 | 4927 | if (MEM_P (val) && !must_copy) |
c4b9a87e ER |
4928 | { |
4929 | tree val_expr = MEM_EXPR (val); | |
4930 | if (val_expr) | |
4931 | mark_addressable (val_expr); | |
4932 | slot = val; | |
4933 | } | |
9969aaf6 | 4934 | else |
f474c6f8 | 4935 | { |
ae2bcd98 | 4936 | slot = assign_temp (lang_hooks.types.type_for_mode (mode, 0), |
9474e8ab | 4937 | 1, 1); |
f474c6f8 AO |
4938 | emit_move_insn (slot, val); |
4939 | } | |
1da68f56 | 4940 | |
6b5273c3 AO |
4941 | call_fusage = gen_rtx_EXPR_LIST (VOIDmode, |
4942 | gen_rtx_USE (VOIDmode, slot), | |
4943 | call_fusage); | |
f474c6f8 AO |
4944 | if (must_copy) |
4945 | call_fusage = gen_rtx_EXPR_LIST (VOIDmode, | |
4946 | gen_rtx_CLOBBER (VOIDmode, | |
4947 | slot), | |
4948 | call_fusage); | |
4949 | ||
3c0fca12 | 4950 | mode = Pmode; |
f474c6f8 | 4951 | val = force_operand (XEXP (slot, 0), NULL_RTX); |
3c0fca12 | 4952 | } |
3c0fca12 | 4953 | |
5e617be8 | 4954 | mode = promote_function_mode (NULL_TREE, mode, &unsigned_p, NULL_TREE, 0); |
3c0fca12 | 4955 | argvec[count].mode = mode; |
5e617be8 | 4956 | argvec[count].value = convert_modes (mode, GET_MODE (val), val, unsigned_p); |
d5cc9181 | 4957 | argvec[count].reg = targetm.calls.function_arg (args_so_far, mode, |
3c07301f | 4958 | NULL_TREE, true); |
3c0fca12 | 4959 | |
3c0fca12 | 4960 | argvec[count].partial |
d5cc9181 | 4961 | = targetm.calls.arg_partial_bytes (args_so_far, mode, NULL_TREE, 1); |
3c0fca12 | 4962 | |
3576f984 RS |
4963 | if (argvec[count].reg == 0 |
4964 | || argvec[count].partial != 0 | |
4965 | || reg_parm_stack_space > 0) | |
4966 | { | |
4967 | locate_and_pad_parm (mode, NULL_TREE, | |
a4d5044f | 4968 | #ifdef STACK_PARMS_IN_REG_PARM_AREA |
3576f984 | 4969 | 1, |
a4d5044f | 4970 | #else |
3576f984 RS |
4971 | argvec[count].reg != 0, |
4972 | #endif | |
2e4ceca5 | 4973 | reg_parm_stack_space, argvec[count].partial, |
3576f984 RS |
4974 | NULL_TREE, &args_size, &argvec[count].locate); |
4975 | args_size.constant += argvec[count].locate.size.constant; | |
4976 | gcc_assert (!argvec[count].locate.size.var); | |
4977 | } | |
4978 | #ifdef BLOCK_REG_PADDING | |
4979 | else | |
4980 | /* The argument is passed entirely in registers. See at which | |
4981 | end it should be padded. */ | |
4982 | argvec[count].locate.where_pad = | |
4983 | BLOCK_REG_PADDING (mode, NULL_TREE, | |
cf098191 | 4984 | known_le (GET_MODE_SIZE (mode), UNITS_PER_WORD)); |
a4d5044f | 4985 | #endif |
3c0fca12 | 4986 | |
d5cc9181 | 4987 | targetm.calls.function_arg_advance (args_so_far, mode, (tree) 0, true); |
3c0fca12 | 4988 | } |
3c0fca12 | 4989 | |
957ed738 L |
4990 | for (int i = 0; i < nargs; i++) |
4991 | if (reg_parm_stack_space > 0 | |
4992 | || argvec[i].reg == 0 | |
4993 | || argvec[i].partial != 0) | |
4994 | update_stack_alignment_for_call (&argvec[i].locate); | |
4995 | ||
3c0fca12 RH |
4996 | /* If this machine requires an external definition for library |
4997 | functions, write one out. */ | |
4998 | assemble_external_libcall (fun); | |
4999 | ||
5000 | original_args_size = args_size; | |
a20c5714 RS |
5001 | args_size.constant = (aligned_upper_bound (args_size.constant |
5002 | + stack_pointer_delta, | |
5003 | STACK_BYTES) | |
5004 | - stack_pointer_delta); | |
3c0fca12 | 5005 | |
a20c5714 RS |
5006 | args_size.constant = upper_bound (args_size.constant, |
5007 | reg_parm_stack_space); | |
3c0fca12 | 5008 | |
5d059ed9 | 5009 | if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl)))) |
ac294f0b | 5010 | args_size.constant -= reg_parm_stack_space; |
3c0fca12 | 5011 | |
a20c5714 RS |
5012 | crtl->outgoing_args_size = upper_bound (crtl->outgoing_args_size, |
5013 | args_size.constant); | |
3c0fca12 | 5014 | |
a11e0df4 | 5015 | if (flag_stack_usage_info && !ACCUMULATE_OUTGOING_ARGS) |
d3c12306 | 5016 | { |
a20c5714 RS |
5017 | poly_int64 pushed = args_size.constant + pending_stack_adjust; |
5018 | current_function_pushed_stack_size | |
5019 | = upper_bound (current_function_pushed_stack_size, pushed); | |
d3c12306 EB |
5020 | } |
5021 | ||
f73ad30e JH |
5022 | if (ACCUMULATE_OUTGOING_ARGS) |
5023 | { | |
5024 | /* Since the stack pointer will never be pushed, it is possible for | |
5025 | the evaluation of a parm to clobber something we have already | |
5026 | written to the stack. Since most function calls on RISC machines | |
5027 | do not use the stack, this is uncommon, but must work correctly. | |
3c0fca12 | 5028 | |
f73ad30e JH |
5029 | Therefore, we save any area of the stack that was already written |
5030 | and that we are using. Here we set up to do this by making a new | |
5031 | stack usage map from the old one. | |
3c0fca12 | 5032 | |
f73ad30e JH |
5033 | Another approach might be to try to reorder the argument |
5034 | evaluations to avoid this conflicting stack usage. */ | |
3c0fca12 | 5035 | |
f73ad30e | 5036 | needed = args_size.constant; |
3c0fca12 | 5037 | |
f73ad30e JH |
5038 | /* Since we will be writing into the entire argument area, the |
5039 | map must be allocated for its entire size, not just the part that | |
5040 | is the responsibility of the caller. */ | |
5d059ed9 | 5041 | if (! OUTGOING_REG_PARM_STACK_SPACE ((!fndecl ? fntype : TREE_TYPE (fndecl)))) |
ac294f0b | 5042 | needed += reg_parm_stack_space; |
3c0fca12 | 5043 | |
a20c5714 | 5044 | poly_int64 limit = needed; |
6dad9361 | 5045 | if (ARGS_GROW_DOWNWARD) |
a20c5714 RS |
5046 | limit += 1; |
5047 | ||
5048 | /* For polynomial sizes, this is the maximum possible size needed | |
5049 | for arguments with a constant size and offset. */ | |
5050 | HOST_WIDE_INT const_limit = constant_lower_bound (limit); | |
5051 | highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use, | |
5052 | const_limit); | |
6dad9361 | 5053 | |
5ed6ace5 | 5054 | stack_usage_map_buf = XNEWVEC (char, highest_outgoing_arg_in_use); |
d9725c41 | 5055 | stack_usage_map = stack_usage_map_buf; |
3c0fca12 | 5056 | |
f73ad30e | 5057 | if (initial_highest_arg_in_use) |
2e09e75a JM |
5058 | memcpy (stack_usage_map, initial_stack_usage_map, |
5059 | initial_highest_arg_in_use); | |
3c0fca12 | 5060 | |
f73ad30e | 5061 | if (initial_highest_arg_in_use != highest_outgoing_arg_in_use) |
961192e1 | 5062 | memset (&stack_usage_map[initial_highest_arg_in_use], 0, |
f73ad30e JH |
5063 | highest_outgoing_arg_in_use - initial_highest_arg_in_use); |
5064 | needed = 0; | |
3c0fca12 | 5065 | |
c39ada04 | 5066 | /* We must be careful to use virtual regs before they're instantiated, |
c22cacf3 | 5067 | and real regs afterwards. Loop optimization, for example, can create |
c39ada04 DD |
5068 | new libcalls after we've instantiated the virtual regs, and if we |
5069 | use virtuals anyway, they won't match the rtl patterns. */ | |
3c0fca12 | 5070 | |
c39ada04 | 5071 | if (virtuals_instantiated) |
0a81f074 RS |
5072 | argblock = plus_constant (Pmode, stack_pointer_rtx, |
5073 | STACK_POINTER_OFFSET); | |
c39ada04 DD |
5074 | else |
5075 | argblock = virtual_outgoing_args_rtx; | |
f73ad30e JH |
5076 | } |
5077 | else | |
5078 | { | |
5079 | if (!PUSH_ARGS) | |
a20c5714 | 5080 | argblock = push_block (gen_int_mode (args_size.constant, Pmode), 0, 0); |
f73ad30e | 5081 | } |
3c0fca12 | 5082 | |
3d9684ae | 5083 | /* We push args individually in reverse order, perform stack alignment |
3c0fca12 | 5084 | before the first push (the last arg). */ |
3d9684ae | 5085 | if (argblock == 0) |
a20c5714 RS |
5086 | anti_adjust_stack (gen_int_mode (args_size.constant |
5087 | - original_args_size.constant, | |
5088 | Pmode)); | |
3c0fca12 | 5089 | |
3d9684ae | 5090 | argnum = nargs - 1; |
3c0fca12 | 5091 | |
f73ad30e JH |
5092 | #ifdef REG_PARM_STACK_SPACE |
5093 | if (ACCUMULATE_OUTGOING_ARGS) | |
5094 | { | |
5095 | /* The argument list is the property of the called routine and it | |
5096 | may clobber it. If the fixed area has been used for previous | |
b820d2b8 AM |
5097 | parameters, we must save and restore it. */ |
5098 | save_area = save_fixed_argument_area (reg_parm_stack_space, argblock, | |
5099 | &low_to_save, &high_to_save); | |
3c0fca12 RH |
5100 | } |
5101 | #endif | |
f725a3ec | 5102 | |
2f21e1ba BS |
5103 | /* When expanding a normal call, args are stored in push order, |
5104 | which is the reverse of what we have here. */ | |
5105 | bool any_regs = false; | |
5106 | for (int i = nargs; i-- > 0; ) | |
5107 | if (argvec[i].reg != NULL_RTX) | |
5108 | { | |
5109 | targetm.calls.call_args (argvec[i].reg, NULL_TREE); | |
5110 | any_regs = true; | |
5111 | } | |
5112 | if (!any_regs) | |
5113 | targetm.calls.call_args (pc_rtx, NULL_TREE); | |
5114 | ||
3c0fca12 RH |
5115 | /* Push the args that need to be pushed. */ |
5116 | ||
0ed4bf92 BS |
5117 | have_push_fusage = false; |
5118 | ||
3c0fca12 RH |
5119 | /* ARGNUM indexes the ARGVEC array in the order in which the arguments |
5120 | are to be pushed. */ | |
3d9684ae | 5121 | for (count = 0; count < nargs; count++, argnum--) |
3c0fca12 | 5122 | { |
ef4bddc2 | 5123 | machine_mode mode = argvec[argnum].mode; |
b3694847 | 5124 | rtx val = argvec[argnum].value; |
3c0fca12 RH |
5125 | rtx reg = argvec[argnum].reg; |
5126 | int partial = argvec[argnum].partial; | |
6bdf8c2e | 5127 | unsigned int parm_align = argvec[argnum].locate.boundary; |
a20c5714 | 5128 | poly_int64 lower_bound = 0, upper_bound = 0; |
3c0fca12 RH |
5129 | |
5130 | if (! (reg != 0 && partial == 0)) | |
5131 | { | |
2b1c5433 JJ |
5132 | rtx use; |
5133 | ||
f73ad30e JH |
5134 | if (ACCUMULATE_OUTGOING_ARGS) |
5135 | { | |
f8a097cd JH |
5136 | /* If this is being stored into a pre-allocated, fixed-size, |
5137 | stack area, save any previous data at that location. */ | |
3c0fca12 | 5138 | |
6dad9361 TS |
5139 | if (ARGS_GROW_DOWNWARD) |
5140 | { | |
5141 | /* stack_slot is negative, but we want to index stack_usage_map | |
5142 | with positive values. */ | |
5143 | upper_bound = -argvec[argnum].locate.slot_offset.constant + 1; | |
5144 | lower_bound = upper_bound - argvec[argnum].locate.size.constant; | |
5145 | } | |
5146 | else | |
5147 | { | |
5148 | lower_bound = argvec[argnum].locate.slot_offset.constant; | |
5149 | upper_bound = lower_bound + argvec[argnum].locate.size.constant; | |
5150 | } | |
3c0fca12 | 5151 | |
a20c5714 RS |
5152 | if (stack_region_maybe_used_p (lower_bound, upper_bound, |
5153 | reg_parm_stack_space)) | |
f73ad30e | 5154 | { |
e7949876 | 5155 | /* We need to make a save area. */ |
a20c5714 | 5156 | poly_uint64 size |
e7949876 | 5157 | = argvec[argnum].locate.size.constant * BITS_PER_UNIT; |
ef4bddc2 | 5158 | machine_mode save_mode |
f4b31647 | 5159 | = int_mode_for_size (size, 1).else_blk (); |
e7949876 | 5160 | rtx adr |
0a81f074 | 5161 | = plus_constant (Pmode, argblock, |
e7949876 | 5162 | argvec[argnum].locate.offset.constant); |
f73ad30e | 5163 | rtx stack_area |
e7949876 | 5164 | = gen_rtx_MEM (save_mode, memory_address (save_mode, adr)); |
f73ad30e | 5165 | |
9778f2f8 JH |
5166 | if (save_mode == BLKmode) |
5167 | { | |
5168 | argvec[argnum].save_area | |
5169 | = assign_stack_temp (BLKmode, | |
9474e8ab MM |
5170 | argvec[argnum].locate.size.constant |
5171 | ); | |
9778f2f8 | 5172 | |
1a8cb155 RS |
5173 | emit_block_move (validize_mem |
5174 | (copy_rtx (argvec[argnum].save_area)), | |
c22cacf3 | 5175 | stack_area, |
a20c5714 RS |
5176 | (gen_int_mode |
5177 | (argvec[argnum].locate.size.constant, | |
5178 | Pmode)), | |
9778f2f8 JH |
5179 | BLOCK_OP_CALL_PARM); |
5180 | } | |
5181 | else | |
5182 | { | |
5183 | argvec[argnum].save_area = gen_reg_rtx (save_mode); | |
5184 | ||
5185 | emit_move_insn (argvec[argnum].save_area, stack_area); | |
5186 | } | |
f73ad30e | 5187 | } |
3c0fca12 | 5188 | } |
19caa751 | 5189 | |
6bdf8c2e | 5190 | emit_push_insn (val, mode, NULL_TREE, NULL_RTX, parm_align, |
44bb111a | 5191 | partial, reg, 0, argblock, |
a20c5714 RS |
5192 | (gen_int_mode |
5193 | (argvec[argnum].locate.offset.constant, Pmode)), | |
e7949876 | 5194 | reg_parm_stack_space, |
99206968 | 5195 | ARGS_SIZE_RTX (argvec[argnum].locate.alignment_pad), false); |
3c0fca12 | 5196 | |
3c0fca12 | 5197 | /* Now mark the segment we just used. */ |
f73ad30e | 5198 | if (ACCUMULATE_OUTGOING_ARGS) |
a20c5714 | 5199 | mark_stack_region_used (lower_bound, upper_bound); |
3c0fca12 RH |
5200 | |
5201 | NO_DEFER_POP; | |
475a3eef | 5202 | |
2b1c5433 JJ |
5203 | /* Indicate argument access so that alias.c knows that these |
5204 | values are live. */ | |
5205 | if (argblock) | |
0a81f074 | 5206 | use = plus_constant (Pmode, argblock, |
2b1c5433 | 5207 | argvec[argnum].locate.offset.constant); |
0ed4bf92 BS |
5208 | else if (have_push_fusage) |
5209 | continue; | |
2b1c5433 | 5210 | else |
0ed4bf92 BS |
5211 | { |
5212 | /* When arguments are pushed, trying to tell alias.c where | |
5213 | exactly this argument is won't work, because the | |
5214 | auto-increment causes confusion. So we merely indicate | |
5215 | that we access something with a known mode somewhere on | |
5216 | the stack. */ | |
5217 | use = gen_rtx_PLUS (Pmode, stack_pointer_rtx, | |
5218 | gen_rtx_SCRATCH (Pmode)); | |
5219 | have_push_fusage = true; | |
5220 | } | |
2b1c5433 JJ |
5221 | use = gen_rtx_MEM (argvec[argnum].mode, use); |
5222 | use = gen_rtx_USE (VOIDmode, use); | |
5223 | call_fusage = gen_rtx_EXPR_LIST (VOIDmode, use, call_fusage); | |
3c0fca12 RH |
5224 | } |
5225 | } | |
5226 | ||
3d9684ae | 5227 | argnum = nargs - 1; |
3c0fca12 | 5228 | |
531ca746 | 5229 | fun = prepare_call_address (NULL, fun, NULL, &call_fusage, 0, 0); |
3c0fca12 RH |
5230 | |
5231 | /* Now load any reg parms into their regs. */ | |
5232 | ||
5233 | /* ARGNUM indexes the ARGVEC array in the order in which the arguments | |
5234 | are to be pushed. */ | |
3d9684ae | 5235 | for (count = 0; count < nargs; count++, argnum--) |
3c0fca12 | 5236 | { |
ef4bddc2 | 5237 | machine_mode mode = argvec[argnum].mode; |
b3694847 | 5238 | rtx val = argvec[argnum].value; |
3c0fca12 RH |
5239 | rtx reg = argvec[argnum].reg; |
5240 | int partial = argvec[argnum].partial; | |
460b171d | 5241 | |
3c0fca12 RH |
5242 | /* Handle calls that pass values in multiple non-contiguous |
5243 | locations. The PA64 has examples of this for library calls. */ | |
5244 | if (reg != 0 && GET_CODE (reg) == PARALLEL) | |
ff15c351 | 5245 | emit_group_load (reg, val, NULL_TREE, GET_MODE_SIZE (mode)); |
3c0fca12 | 5246 | else if (reg != 0 && partial == 0) |
460b171d JB |
5247 | { |
5248 | emit_move_insn (reg, val); | |
5249 | #ifdef BLOCK_REG_PADDING | |
cf098191 | 5250 | poly_int64 size = GET_MODE_SIZE (argvec[argnum].mode); |
460b171d JB |
5251 | |
5252 | /* Copied from load_register_parameters. */ | |
5253 | ||
5254 | /* Handle case where we have a value that needs shifting | |
5255 | up to the msb. eg. a QImode value and we're padding | |
5256 | upward on a BYTES_BIG_ENDIAN machine. */ | |
cf098191 | 5257 | if (known_lt (size, UNITS_PER_WORD) |
460b171d | 5258 | && (argvec[argnum].locate.where_pad |
76b0cbf8 | 5259 | == (BYTES_BIG_ENDIAN ? PAD_UPWARD : PAD_DOWNWARD))) |
460b171d JB |
5260 | { |
5261 | rtx x; | |
cf098191 | 5262 | poly_int64 shift = (UNITS_PER_WORD - size) * BITS_PER_UNIT; |
460b171d JB |
5263 | |
5264 | /* Assigning REG here rather than a temp makes CALL_FUSAGE | |
5265 | report the whole reg as used. Strictly speaking, the | |
5266 | call only uses SIZE bytes at the msb end, but it doesn't | |
5267 | seem worth generating rtl to say that. */ | |
5268 | reg = gen_rtx_REG (word_mode, REGNO (reg)); | |
5269 | x = expand_shift (LSHIFT_EXPR, word_mode, reg, shift, reg, 1); | |
5270 | if (x != reg) | |
5271 | emit_move_insn (reg, x); | |
5272 | } | |
5273 | #endif | |
5274 | } | |
3c0fca12 RH |
5275 | |
5276 | NO_DEFER_POP; | |
5277 | } | |
5278 | ||
3c0fca12 RH |
5279 | /* Any regs containing parms remain in use through the call. */ |
5280 | for (count = 0; count < nargs; count++) | |
5281 | { | |
5282 | rtx reg = argvec[count].reg; | |
5283 | if (reg != 0 && GET_CODE (reg) == PARALLEL) | |
5284 | use_group_regs (&call_fusage, reg); | |
5285 | else if (reg != 0) | |
3b1bf459 BS |
5286 | { |
5287 | int partial = argvec[count].partial; | |
5288 | if (partial) | |
5289 | { | |
5290 | int nregs; | |
5291 | gcc_assert (partial % UNITS_PER_WORD == 0); | |
5292 | nregs = partial / UNITS_PER_WORD; | |
5293 | use_regs (&call_fusage, REGNO (reg), nregs); | |
5294 | } | |
5295 | else | |
5296 | use_reg (&call_fusage, reg); | |
5297 | } | |
3c0fca12 RH |
5298 | } |
5299 | ||
5300 | /* Pass the function the address in which to return a structure value. */ | |
61f71b34 | 5301 | if (mem_value != 0 && struct_value != 0 && ! pcc_struct_value) |
3c0fca12 | 5302 | { |
61f71b34 | 5303 | emit_move_insn (struct_value, |
3c0fca12 RH |
5304 | force_reg (Pmode, |
5305 | force_operand (XEXP (mem_value, 0), | |
5306 | NULL_RTX))); | |
f8cfc6aa | 5307 | if (REG_P (struct_value)) |
61f71b34 | 5308 | use_reg (&call_fusage, struct_value); |
3c0fca12 RH |
5309 | } |
5310 | ||
5311 | /* Don't allow popping to be deferred, since then | |
5312 | cse'ing of library calls could delete a call and leave the pop. */ | |
5313 | NO_DEFER_POP; | |
5591ee6f | 5314 | valreg = (mem_value == 0 && outmode != VOIDmode |
390b17c2 | 5315 | ? hard_libcall_value (outmode, orgfun) : NULL_RTX); |
3c0fca12 | 5316 | |
ce48579b | 5317 | /* Stack must be properly aligned now. */ |
a20c5714 RS |
5318 | gcc_assert (multiple_p (stack_pointer_delta, |
5319 | PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)); | |
ebcd0b57 | 5320 | |
695ee791 RH |
5321 | before_call = get_last_insn (); |
5322 | ||
3c0fca12 RH |
5323 | /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which |
5324 | will set inhibit_defer_pop to that value. */ | |
de76b467 JH |
5325 | /* The return type is needed to decide how many bytes the function pops. |
5326 | Signedness plays no role in that, so for simplicity, we pretend it's | |
5327 | always signed. We also assume that the list of arguments passed has | |
5328 | no impact, so we pretend it is unknown. */ | |
3c0fca12 | 5329 | |
6de9cd9a | 5330 | emit_call_1 (fun, NULL, |
f725a3ec | 5331 | get_identifier (XSTR (orgfun, 0)), |
b0c48229 | 5332 | build_function_type (tfom, NULL_TREE), |
f725a3ec | 5333 | original_args_size.constant, args_size.constant, |
3c0fca12 | 5334 | struct_value_size, |
d5cc9181 | 5335 | targetm.calls.function_arg (args_so_far, |
3c07301f | 5336 | VOIDmode, void_type_node, true), |
5591ee6f | 5337 | valreg, |
d5cc9181 | 5338 | old_inhibit_defer_pop + 1, call_fusage, flags, args_so_far); |
3c0fca12 | 5339 | |
1e288103 | 5340 | if (flag_ipa_ra) |
4f660b15 | 5341 | { |
e67d1102 | 5342 | rtx datum = orgfun; |
4f660b15 | 5343 | gcc_assert (GET_CODE (datum) == SYMBOL_REF); |
e67d1102 | 5344 | rtx_call_insn *last = last_call_insn (); |
4f660b15 RO |
5345 | add_reg_note (last, REG_CALL_DECL, datum); |
5346 | } | |
5347 | ||
460b171d JB |
5348 | /* Right-shift returned value if necessary. */ |
5349 | if (!pcc_struct_value | |
5350 | && TYPE_MODE (tfom) != BLKmode | |
5351 | && targetm.calls.return_in_msb (tfom)) | |
5352 | { | |
5353 | shift_return_value (TYPE_MODE (tfom), false, valreg); | |
5354 | valreg = gen_rtx_REG (TYPE_MODE (tfom), REGNO (valreg)); | |
5355 | } | |
5356 | ||
2f21e1ba BS |
5357 | targetm.calls.end_call_args (); |
5358 | ||
6fb5fa3c DB |
5359 | /* For calls to `setjmp', etc., inform function.c:setjmp_warnings |
5360 | that it should complain if nonvolatile values are live. For | |
5361 | functions that cannot return, inform flow that control does not | |
5362 | fall through. */ | |
6e14af16 | 5363 | if (flags & ECF_NORETURN) |
695ee791 | 5364 | { |
570a98eb | 5365 | /* The barrier note must be emitted |
695ee791 RH |
5366 | immediately after the CALL_INSN. Some ports emit more than |
5367 | just a CALL_INSN above, so we must search for it here. */ | |
48810515 | 5368 | rtx_insn *last = get_last_insn (); |
4b4bf941 | 5369 | while (!CALL_P (last)) |
695ee791 RH |
5370 | { |
5371 | last = PREV_INSN (last); | |
5372 | /* There was no CALL_INSN? */ | |
366de0ce | 5373 | gcc_assert (last != before_call); |
695ee791 RH |
5374 | } |
5375 | ||
570a98eb | 5376 | emit_barrier_after (last); |
695ee791 RH |
5377 | } |
5378 | ||
85da11a6 EB |
5379 | /* Consider that "regular" libcalls, i.e. all of them except for LCT_THROW |
5380 | and LCT_RETURNS_TWICE, cannot perform non-local gotos. */ | |
5381 | if (flags & ECF_NOTHROW) | |
5382 | { | |
48810515 | 5383 | rtx_insn *last = get_last_insn (); |
85da11a6 EB |
5384 | while (!CALL_P (last)) |
5385 | { | |
5386 | last = PREV_INSN (last); | |
5387 | /* There was no CALL_INSN? */ | |
5388 | gcc_assert (last != before_call); | |
5389 | } | |
5390 | ||
5391 | make_reg_eh_region_note_nothrow_nononlocal (last); | |
5392 | } | |
5393 | ||
3c0fca12 RH |
5394 | /* Now restore inhibit_defer_pop to its actual original value. */ |
5395 | OK_DEFER_POP; | |
5396 | ||
5397 | pop_temp_slots (); | |
5398 | ||
5399 | /* Copy the value to the right place. */ | |
de76b467 | 5400 | if (outmode != VOIDmode && retval) |
3c0fca12 RH |
5401 | { |
5402 | if (mem_value) | |
5403 | { | |
5404 | if (value == 0) | |
5405 | value = mem_value; | |
5406 | if (value != mem_value) | |
5407 | emit_move_insn (value, mem_value); | |
5408 | } | |
c3297561 AO |
5409 | else if (GET_CODE (valreg) == PARALLEL) |
5410 | { | |
5411 | if (value == 0) | |
5412 | value = gen_reg_rtx (outmode); | |
643642eb | 5413 | emit_group_store (value, valreg, NULL_TREE, GET_MODE_SIZE (outmode)); |
c3297561 | 5414 | } |
3c0fca12 | 5415 | else |
7ab0aca2 | 5416 | { |
cde0f3fd | 5417 | /* Convert to the proper mode if a promotion has been active. */ |
7ab0aca2 RH |
5418 | if (GET_MODE (valreg) != outmode) |
5419 | { | |
5420 | int unsignedp = TYPE_UNSIGNED (tfom); | |
5421 | ||
cde0f3fd PB |
5422 | gcc_assert (promote_function_mode (tfom, outmode, &unsignedp, |
5423 | fndecl ? TREE_TYPE (fndecl) : fntype, 1) | |
7ab0aca2 | 5424 | == GET_MODE (valreg)); |
7ab0aca2 RH |
5425 | valreg = convert_modes (outmode, GET_MODE (valreg), valreg, 0); |
5426 | } | |
5427 | ||
5428 | if (value != 0) | |
5429 | emit_move_insn (value, valreg); | |
5430 | else | |
5431 | value = valreg; | |
5432 | } | |
3c0fca12 RH |
5433 | } |
5434 | ||
f73ad30e | 5435 | if (ACCUMULATE_OUTGOING_ARGS) |
3c0fca12 | 5436 | { |
f73ad30e JH |
5437 | #ifdef REG_PARM_STACK_SPACE |
5438 | if (save_area) | |
b820d2b8 AM |
5439 | restore_fixed_argument_area (save_area, argblock, |
5440 | high_to_save, low_to_save); | |
3c0fca12 | 5441 | #endif |
f725a3ec | 5442 | |
f73ad30e JH |
5443 | /* If we saved any argument areas, restore them. */ |
5444 | for (count = 0; count < nargs; count++) | |
5445 | if (argvec[count].save_area) | |
5446 | { | |
ef4bddc2 | 5447 | machine_mode save_mode = GET_MODE (argvec[count].save_area); |
0a81f074 | 5448 | rtx adr = plus_constant (Pmode, argblock, |
e7949876 AM |
5449 | argvec[count].locate.offset.constant); |
5450 | rtx stack_area = gen_rtx_MEM (save_mode, | |
5451 | memory_address (save_mode, adr)); | |
f73ad30e | 5452 | |
9778f2f8 JH |
5453 | if (save_mode == BLKmode) |
5454 | emit_block_move (stack_area, | |
1a8cb155 RS |
5455 | validize_mem |
5456 | (copy_rtx (argvec[count].save_area)), | |
a20c5714 RS |
5457 | (gen_int_mode |
5458 | (argvec[count].locate.size.constant, Pmode)), | |
9778f2f8 JH |
5459 | BLOCK_OP_CALL_PARM); |
5460 | else | |
5461 | emit_move_insn (stack_area, argvec[count].save_area); | |
f73ad30e | 5462 | } |
3c0fca12 | 5463 | |
f73ad30e JH |
5464 | highest_outgoing_arg_in_use = initial_highest_arg_in_use; |
5465 | stack_usage_map = initial_stack_usage_map; | |
a20c5714 | 5466 | stack_usage_watermark = initial_stack_usage_watermark; |
f73ad30e | 5467 | } |
43bc5f13 | 5468 | |
04695783 | 5469 | free (stack_usage_map_buf); |
d9725c41 | 5470 | |
de76b467 JH |
5471 | return value; |
5472 | ||
5473 | } | |
5474 | \f | |
d5e254e1 | 5475 | |
51bbfa0c RS |
5476 | /* Store a single argument for a function call |
5477 | into the register or memory area where it must be passed. | |
5478 | *ARG describes the argument value and where to pass it. | |
5479 | ||
5480 | ARGBLOCK is the address of the stack-block for all the arguments, | |
d45cf215 | 5481 | or 0 on a machine where arguments are pushed individually. |
51bbfa0c RS |
5482 | |
5483 | MAY_BE_ALLOCA nonzero says this could be a call to `alloca' | |
f725a3ec | 5484 | so must be careful about how the stack is used. |
51bbfa0c RS |
5485 | |
5486 | VARIABLE_SIZE nonzero says that this was a variable-sized outgoing | |
5487 | argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate | |
5488 | that we need not worry about saving and restoring the stack. | |
5489 | ||
4c6b3b2a | 5490 | FNDECL is the declaration of the function we are calling. |
f725a3ec | 5491 | |
da7d8304 | 5492 | Return nonzero if this arg should cause sibcall failure, |
4c6b3b2a | 5493 | zero otherwise. */ |
51bbfa0c | 5494 | |
4c6b3b2a | 5495 | static int |
d329e058 AJ |
5496 | store_one_arg (struct arg_data *arg, rtx argblock, int flags, |
5497 | int variable_size ATTRIBUTE_UNUSED, int reg_parm_stack_space) | |
51bbfa0c | 5498 | { |
b3694847 | 5499 | tree pval = arg->tree_value; |
51bbfa0c RS |
5500 | rtx reg = 0; |
5501 | int partial = 0; | |
a20c5714 RS |
5502 | poly_int64 used = 0; |
5503 | poly_int64 lower_bound = 0, upper_bound = 0; | |
4c6b3b2a | 5504 | int sibcall_failure = 0; |
51bbfa0c RS |
5505 | |
5506 | if (TREE_CODE (pval) == ERROR_MARK) | |
4c6b3b2a | 5507 | return 1; |
51bbfa0c | 5508 | |
cc79451b RK |
5509 | /* Push a new temporary level for any temporaries we make for |
5510 | this argument. */ | |
5511 | push_temp_slots (); | |
5512 | ||
f8a097cd | 5513 | if (ACCUMULATE_OUTGOING_ARGS && !(flags & ECF_SIBCALL)) |
51bbfa0c | 5514 | { |
f73ad30e JH |
5515 | /* If this is being stored into a pre-allocated, fixed-size, stack area, |
5516 | save any previous data at that location. */ | |
5517 | if (argblock && ! variable_size && arg->stack) | |
5518 | { | |
6dad9361 TS |
5519 | if (ARGS_GROW_DOWNWARD) |
5520 | { | |
5521 | /* stack_slot is negative, but we want to index stack_usage_map | |
5522 | with positive values. */ | |
5523 | if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS) | |
a20c5714 RS |
5524 | { |
5525 | rtx offset = XEXP (XEXP (arg->stack_slot, 0), 1); | |
5526 | upper_bound = -rtx_to_poly_int64 (offset) + 1; | |
5527 | } | |
6dad9361 TS |
5528 | else |
5529 | upper_bound = 0; | |
51bbfa0c | 5530 | |
6dad9361 TS |
5531 | lower_bound = upper_bound - arg->locate.size.constant; |
5532 | } | |
f73ad30e | 5533 | else |
6dad9361 TS |
5534 | { |
5535 | if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS) | |
a20c5714 RS |
5536 | { |
5537 | rtx offset = XEXP (XEXP (arg->stack_slot, 0), 1); | |
5538 | lower_bound = rtx_to_poly_int64 (offset); | |
5539 | } | |
6dad9361 TS |
5540 | else |
5541 | lower_bound = 0; | |
51bbfa0c | 5542 | |
6dad9361 TS |
5543 | upper_bound = lower_bound + arg->locate.size.constant; |
5544 | } | |
51bbfa0c | 5545 | |
a20c5714 RS |
5546 | if (stack_region_maybe_used_p (lower_bound, upper_bound, |
5547 | reg_parm_stack_space)) | |
51bbfa0c | 5548 | { |
e7949876 | 5549 | /* We need to make a save area. */ |
a20c5714 | 5550 | poly_uint64 size = arg->locate.size.constant * BITS_PER_UNIT; |
f4b31647 RS |
5551 | machine_mode save_mode |
5552 | = int_mode_for_size (size, 1).else_blk (); | |
e7949876 AM |
5553 | rtx adr = memory_address (save_mode, XEXP (arg->stack_slot, 0)); |
5554 | rtx stack_area = gen_rtx_MEM (save_mode, adr); | |
f73ad30e JH |
5555 | |
5556 | if (save_mode == BLKmode) | |
5557 | { | |
9ee5337d EB |
5558 | arg->save_area |
5559 | = assign_temp (TREE_TYPE (arg->tree_value), 1, 1); | |
f73ad30e | 5560 | preserve_temp_slots (arg->save_area); |
1a8cb155 RS |
5561 | emit_block_move (validize_mem (copy_rtx (arg->save_area)), |
5562 | stack_area, | |
a20c5714 RS |
5563 | (gen_int_mode |
5564 | (arg->locate.size.constant, Pmode)), | |
44bb111a | 5565 | BLOCK_OP_CALL_PARM); |
f73ad30e JH |
5566 | } |
5567 | else | |
5568 | { | |
5569 | arg->save_area = gen_reg_rtx (save_mode); | |
5570 | emit_move_insn (arg->save_area, stack_area); | |
5571 | } | |
51bbfa0c RS |
5572 | } |
5573 | } | |
5574 | } | |
b564df06 | 5575 | |
51bbfa0c RS |
5576 | /* If this isn't going to be placed on both the stack and in registers, |
5577 | set up the register and number of words. */ | |
5578 | if (! arg->pass_on_stack) | |
aa7634dd DM |
5579 | { |
5580 | if (flags & ECF_SIBCALL) | |
5581 | reg = arg->tail_call_reg; | |
5582 | else | |
5583 | reg = arg->reg; | |
5584 | partial = arg->partial; | |
5585 | } | |
51bbfa0c | 5586 | |
366de0ce NS |
5587 | /* Being passed entirely in a register. We shouldn't be called in |
5588 | this case. */ | |
5589 | gcc_assert (reg == 0 || partial != 0); | |
c22cacf3 | 5590 | |
4ab56118 RK |
5591 | /* If this arg needs special alignment, don't load the registers |
5592 | here. */ | |
5593 | if (arg->n_aligned_regs != 0) | |
5594 | reg = 0; | |
f725a3ec | 5595 | |
4ab56118 | 5596 | /* If this is being passed partially in a register, we can't evaluate |
51bbfa0c RS |
5597 | it directly into its stack slot. Otherwise, we can. */ |
5598 | if (arg->value == 0) | |
d64f5a78 | 5599 | { |
d64f5a78 RS |
5600 | /* stack_arg_under_construction is nonzero if a function argument is |
5601 | being evaluated directly into the outgoing argument list and | |
5602 | expand_call must take special action to preserve the argument list | |
5603 | if it is called recursively. | |
5604 | ||
5605 | For scalar function arguments stack_usage_map is sufficient to | |
5606 | determine which stack slots must be saved and restored. Scalar | |
5607 | arguments in general have pass_on_stack == 0. | |
5608 | ||
5609 | If this argument is initialized by a function which takes the | |
5610 | address of the argument (a C++ constructor or a C function | |
5611 | returning a BLKmode structure), then stack_usage_map is | |
5612 | insufficient and expand_call must push the stack around the | |
5613 | function call. Such arguments have pass_on_stack == 1. | |
5614 | ||
5615 | Note that it is always safe to set stack_arg_under_construction, | |
5616 | but this generates suboptimal code if set when not needed. */ | |
5617 | ||
5618 | if (arg->pass_on_stack) | |
5619 | stack_arg_under_construction++; | |
f73ad30e | 5620 | |
3a08477a RK |
5621 | arg->value = expand_expr (pval, |
5622 | (partial | |
5623 | || TYPE_MODE (TREE_TYPE (pval)) != arg->mode) | |
5624 | ? NULL_RTX : arg->stack, | |
8403445a | 5625 | VOIDmode, EXPAND_STACK_PARM); |
1efe6448 RK |
5626 | |
5627 | /* If we are promoting object (or for any other reason) the mode | |
5628 | doesn't agree, convert the mode. */ | |
5629 | ||
7373d92d RK |
5630 | if (arg->mode != TYPE_MODE (TREE_TYPE (pval))) |
5631 | arg->value = convert_modes (arg->mode, TYPE_MODE (TREE_TYPE (pval)), | |
5632 | arg->value, arg->unsignedp); | |
1efe6448 | 5633 | |
d64f5a78 RS |
5634 | if (arg->pass_on_stack) |
5635 | stack_arg_under_construction--; | |
d64f5a78 | 5636 | } |
51bbfa0c | 5637 | |
0dc42b03 | 5638 | /* Check for overlap with already clobbered argument area. */ |
07eef816 KH |
5639 | if ((flags & ECF_SIBCALL) |
5640 | && MEM_P (arg->value) | |
a20c5714 RS |
5641 | && mem_might_overlap_already_clobbered_arg_p (XEXP (arg->value, 0), |
5642 | arg->locate.size.constant)) | |
07eef816 | 5643 | sibcall_failure = 1; |
0dc42b03 | 5644 | |
51bbfa0c RS |
5645 | /* Don't allow anything left on stack from computation |
5646 | of argument to alloca. */ | |
f8a097cd | 5647 | if (flags & ECF_MAY_BE_ALLOCA) |
51bbfa0c RS |
5648 | do_pending_stack_adjust (); |
5649 | ||
5650 | if (arg->value == arg->stack) | |
37a08a29 RK |
5651 | /* If the value is already in the stack slot, we are done. */ |
5652 | ; | |
1efe6448 | 5653 | else if (arg->mode != BLKmode) |
51bbfa0c | 5654 | { |
46bd2bee | 5655 | unsigned int parm_align; |
51bbfa0c RS |
5656 | |
5657 | /* Argument is a scalar, not entirely passed in registers. | |
5658 | (If part is passed in registers, arg->partial says how much | |
5659 | and emit_push_insn will take care of putting it there.) | |
f725a3ec | 5660 | |
51bbfa0c RS |
5661 | Push it, and if its size is less than the |
5662 | amount of space allocated to it, | |
5663 | also bump stack pointer by the additional space. | |
5664 | Note that in C the default argument promotions | |
5665 | will prevent such mismatches. */ | |
5666 | ||
7b4df2bf RS |
5667 | poly_int64 size = (TYPE_EMPTY_P (TREE_TYPE (pval)) |
5668 | ? 0 : GET_MODE_SIZE (arg->mode)); | |
974aedcc | 5669 | |
51bbfa0c RS |
5670 | /* Compute how much space the push instruction will push. |
5671 | On many machines, pushing a byte will advance the stack | |
5672 | pointer by a halfword. */ | |
5673 | #ifdef PUSH_ROUNDING | |
5674 | size = PUSH_ROUNDING (size); | |
5675 | #endif | |
5676 | used = size; | |
5677 | ||
5678 | /* Compute how much space the argument should get: | |
5679 | round up to a multiple of the alignment for arguments. */ | |
76b0cbf8 RS |
5680 | if (targetm.calls.function_arg_padding (arg->mode, TREE_TYPE (pval)) |
5681 | != PAD_NONE) | |
7b4df2bf RS |
5682 | /* At the moment we don't (need to) support ABIs for which the |
5683 | padding isn't known at compile time. In principle it should | |
5684 | be easy to add though. */ | |
5685 | used = force_align_up (size, PARM_BOUNDARY / BITS_PER_UNIT); | |
51bbfa0c | 5686 | |
46bd2bee JM |
5687 | /* Compute the alignment of the pushed argument. */ |
5688 | parm_align = arg->locate.boundary; | |
76b0cbf8 RS |
5689 | if (targetm.calls.function_arg_padding (arg->mode, TREE_TYPE (pval)) |
5690 | == PAD_DOWNWARD) | |
46bd2bee | 5691 | { |
a20c5714 RS |
5692 | poly_int64 pad = used - size; |
5693 | unsigned int pad_align = known_alignment (pad) * BITS_PER_UNIT; | |
5694 | if (pad_align != 0) | |
5695 | parm_align = MIN (parm_align, pad_align); | |
46bd2bee JM |
5696 | } |
5697 | ||
51bbfa0c RS |
5698 | /* This isn't already where we want it on the stack, so put it there. |
5699 | This can either be done with push or copy insns. */ | |
a20c5714 | 5700 | if (maybe_ne (used, 0) |
974aedcc MP |
5701 | && !emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), |
5702 | NULL_RTX, parm_align, partial, reg, used - size, | |
5703 | argblock, ARGS_SIZE_RTX (arg->locate.offset), | |
5704 | reg_parm_stack_space, | |
5705 | ARGS_SIZE_RTX (arg->locate.alignment_pad), true)) | |
99206968 | 5706 | sibcall_failure = 1; |
841404cd AO |
5707 | |
5708 | /* Unless this is a partially-in-register argument, the argument is now | |
5709 | in the stack. */ | |
5710 | if (partial == 0) | |
5711 | arg->value = arg->stack; | |
51bbfa0c RS |
5712 | } |
5713 | else | |
5714 | { | |
5715 | /* BLKmode, at least partly to be pushed. */ | |
5716 | ||
1b1f20ca | 5717 | unsigned int parm_align; |
a20c5714 | 5718 | poly_int64 excess; |
51bbfa0c RS |
5719 | rtx size_rtx; |
5720 | ||
5721 | /* Pushing a nonscalar. | |
5722 | If part is passed in registers, PARTIAL says how much | |
5723 | and emit_push_insn will take care of putting it there. */ | |
5724 | ||
5725 | /* Round its size up to a multiple | |
5726 | of the allocation unit for arguments. */ | |
5727 | ||
e7949876 | 5728 | if (arg->locate.size.var != 0) |
51bbfa0c RS |
5729 | { |
5730 | excess = 0; | |
e7949876 | 5731 | size_rtx = ARGS_SIZE_RTX (arg->locate.size); |
51bbfa0c RS |
5732 | } |
5733 | else | |
5734 | { | |
78a52f11 RH |
5735 | /* PUSH_ROUNDING has no effect on us, because emit_push_insn |
5736 | for BLKmode is careful to avoid it. */ | |
5737 | excess = (arg->locate.size.constant | |
974aedcc | 5738 | - arg_int_size_in_bytes (TREE_TYPE (pval)) |
78a52f11 | 5739 | + partial); |
974aedcc | 5740 | size_rtx = expand_expr (arg_size_in_bytes (TREE_TYPE (pval)), |
bbbbb16a ILT |
5741 | NULL_RTX, TYPE_MODE (sizetype), |
5742 | EXPAND_NORMAL); | |
51bbfa0c RS |
5743 | } |
5744 | ||
bfc45551 | 5745 | parm_align = arg->locate.boundary; |
1b1f20ca RH |
5746 | |
5747 | /* When an argument is padded down, the block is aligned to | |
5748 | PARM_BOUNDARY, but the actual argument isn't. */ | |
76b0cbf8 RS |
5749 | if (targetm.calls.function_arg_padding (arg->mode, TREE_TYPE (pval)) |
5750 | == PAD_DOWNWARD) | |
1b1f20ca | 5751 | { |
e7949876 | 5752 | if (arg->locate.size.var) |
1b1f20ca | 5753 | parm_align = BITS_PER_UNIT; |
a20c5714 | 5754 | else |
1b1f20ca | 5755 | { |
a20c5714 RS |
5756 | unsigned int excess_align |
5757 | = known_alignment (excess) * BITS_PER_UNIT; | |
5758 | if (excess_align != 0) | |
5759 | parm_align = MIN (parm_align, excess_align); | |
1b1f20ca RH |
5760 | } |
5761 | } | |
5762 | ||
3c0cb5de | 5763 | if ((flags & ECF_SIBCALL) && MEM_P (arg->value)) |
4c6b3b2a JJ |
5764 | { |
5765 | /* emit_push_insn might not work properly if arg->value and | |
e7949876 | 5766 | argblock + arg->locate.offset areas overlap. */ |
4c6b3b2a | 5767 | rtx x = arg->value; |
a20c5714 | 5768 | poly_int64 i = 0; |
4c6b3b2a | 5769 | |
5284e559 RS |
5770 | if (strip_offset (XEXP (x, 0), &i) |
5771 | == crtl->args.internal_arg_pointer) | |
4c6b3b2a | 5772 | { |
b3877860 KT |
5773 | /* arg.locate doesn't contain the pretend_args_size offset, |
5774 | it's part of argblock. Ensure we don't count it in I. */ | |
5775 | if (STACK_GROWS_DOWNWARD) | |
5776 | i -= crtl->args.pretend_args_size; | |
5777 | else | |
5778 | i += crtl->args.pretend_args_size; | |
5779 | ||
e0a21ab9 | 5780 | /* expand_call should ensure this. */ |
366de0ce | 5781 | gcc_assert (!arg->locate.offset.var |
a20c5714 RS |
5782 | && arg->locate.size.var == 0); |
5783 | poly_int64 size_val = rtx_to_poly_int64 (size_rtx); | |
4c6b3b2a | 5784 | |
a20c5714 | 5785 | if (known_eq (arg->locate.offset.constant, i)) |
d6c2c77c JC |
5786 | { |
5787 | /* Even though they appear to be at the same location, | |
5788 | if part of the outgoing argument is in registers, | |
5789 | they aren't really at the same location. Check for | |
5790 | this by making sure that the incoming size is the | |
5791 | same as the outgoing size. */ | |
a20c5714 | 5792 | if (maybe_ne (arg->locate.size.constant, size_val)) |
4c6b3b2a JJ |
5793 | sibcall_failure = 1; |
5794 | } | |
a20c5714 RS |
5795 | else if (maybe_in_range_p (arg->locate.offset.constant, |
5796 | i, size_val)) | |
5797 | sibcall_failure = 1; | |
5798 | /* Use arg->locate.size.constant instead of size_rtx | |
5799 | because we only care about the part of the argument | |
5800 | on the stack. */ | |
5801 | else if (maybe_in_range_p (i, arg->locate.offset.constant, | |
5802 | arg->locate.size.constant)) | |
5803 | sibcall_failure = 1; | |
4c6b3b2a JJ |
5804 | } |
5805 | } | |
5806 | ||
974aedcc MP |
5807 | if (!CONST_INT_P (size_rtx) || INTVAL (size_rtx) != 0) |
5808 | emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), size_rtx, | |
5809 | parm_align, partial, reg, excess, argblock, | |
5810 | ARGS_SIZE_RTX (arg->locate.offset), | |
5811 | reg_parm_stack_space, | |
5812 | ARGS_SIZE_RTX (arg->locate.alignment_pad), false); | |
51bbfa0c | 5813 | |
841404cd AO |
5814 | /* Unless this is a partially-in-register argument, the argument is now |
5815 | in the stack. | |
51bbfa0c | 5816 | |
841404cd AO |
5817 | ??? Unlike the case above, in which we want the actual |
5818 | address of the data, so that we can load it directly into a | |
5819 | register, here we want the address of the stack slot, so that | |
5820 | it's properly aligned for word-by-word copying or something | |
5821 | like that. It's not clear that this is always correct. */ | |
5822 | if (partial == 0) | |
5823 | arg->value = arg->stack_slot; | |
5824 | } | |
8df3dbb7 RH |
5825 | |
5826 | if (arg->reg && GET_CODE (arg->reg) == PARALLEL) | |
5827 | { | |
5828 | tree type = TREE_TYPE (arg->tree_value); | |
5829 | arg->parallel_value | |
5830 | = emit_group_load_into_temps (arg->reg, arg->value, type, | |
5831 | int_size_in_bytes (type)); | |
5832 | } | |
51bbfa0c | 5833 | |
8403445a AM |
5834 | /* Mark all slots this store used. */ |
5835 | if (ACCUMULATE_OUTGOING_ARGS && !(flags & ECF_SIBCALL) | |
5836 | && argblock && ! variable_size && arg->stack) | |
a20c5714 | 5837 | mark_stack_region_used (lower_bound, upper_bound); |
8403445a | 5838 | |
51bbfa0c RS |
5839 | /* Once we have pushed something, pops can't safely |
5840 | be deferred during the rest of the arguments. */ | |
5841 | NO_DEFER_POP; | |
5842 | ||
9474e8ab | 5843 | /* Free any temporary slots made in processing this argument. */ |
cc79451b | 5844 | pop_temp_slots (); |
4c6b3b2a JJ |
5845 | |
5846 | return sibcall_failure; | |
51bbfa0c | 5847 | } |
a4b1b92a | 5848 | |
fe984136 | 5849 | /* Nonzero if we do not know how to pass TYPE solely in registers. */ |
a4b1b92a | 5850 | |
fe984136 | 5851 | bool |
ef4bddc2 | 5852 | must_pass_in_stack_var_size (machine_mode mode ATTRIBUTE_UNUSED, |
586de218 | 5853 | const_tree type) |
fe984136 RH |
5854 | { |
5855 | if (!type) | |
5856 | return false; | |
5857 | ||
5858 | /* If the type has variable size... */ | |
5859 | if (TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST) | |
5860 | return true; | |
a4b1b92a | 5861 | |
fe984136 RH |
5862 | /* If the type is marked as addressable (it is required |
5863 | to be constructed into the stack)... */ | |
5864 | if (TREE_ADDRESSABLE (type)) | |
5865 | return true; | |
5866 | ||
5867 | return false; | |
5868 | } | |
a4b1b92a | 5869 | |
7ae4ad28 | 5870 | /* Another version of the TARGET_MUST_PASS_IN_STACK hook. This one |
fe984136 RH |
5871 | takes trailing padding of a structure into account. */ |
5872 | /* ??? Should be able to merge these two by examining BLOCK_REG_PADDING. */ | |
a4b1b92a RH |
5873 | |
5874 | bool | |
ef4bddc2 | 5875 | must_pass_in_stack_var_size_or_pad (machine_mode mode, const_tree type) |
a4b1b92a RH |
5876 | { |
5877 | if (!type) | |
40cdfd5a | 5878 | return false; |
a4b1b92a RH |
5879 | |
5880 | /* If the type has variable size... */ | |
5881 | if (TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST) | |
5882 | return true; | |
5883 | ||
5884 | /* If the type is marked as addressable (it is required | |
5885 | to be constructed into the stack)... */ | |
5886 | if (TREE_ADDRESSABLE (type)) | |
5887 | return true; | |
5888 | ||
974aedcc MP |
5889 | if (TYPE_EMPTY_P (type)) |
5890 | return false; | |
5891 | ||
a4b1b92a RH |
5892 | /* If the padding and mode of the type is such that a copy into |
5893 | a register would put it into the wrong part of the register. */ | |
5894 | if (mode == BLKmode | |
5895 | && int_size_in_bytes (type) % (PARM_BOUNDARY / BITS_PER_UNIT) | |
76b0cbf8 RS |
5896 | && (targetm.calls.function_arg_padding (mode, type) |
5897 | == (BYTES_BIG_ENDIAN ? PAD_UPWARD : PAD_DOWNWARD))) | |
a4b1b92a RH |
5898 | return true; |
5899 | ||
5900 | return false; | |
5901 | } | |
6bf29a7e MS |
5902 | |
5903 | /* Tell the garbage collector about GTY markers in this source file. */ | |
5904 | #include "gt-calls.h" |