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