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