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