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