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