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