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