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