]>
Commit | Line | Data |
---|---|---|
66d433c7 | 1 | /* Convert function calls to rtl insns, for GNU C compiler. |
c4da142a | 2 | Copyright (C) 1989, 92, 93, 94, 95, 96, 1997 Free Software Foundation, Inc. |
66d433c7 | 3 | |
4 | This file is part of GNU CC. | |
5 | ||
6 | GNU CC is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 2, or (at your option) | |
9 | any later version. | |
10 | ||
11 | GNU CC is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with GNU CC; see the file COPYING. If not, write to | |
8d62a21c | 18 | the Free Software Foundation, 59 Temple Place - Suite 330, |
19 | Boston, MA 02111-1307, USA. */ | |
66d433c7 | 20 | |
21 | #include "config.h" | |
0dbd1c74 | 22 | #include <stdio.h> |
66d433c7 | 23 | #include "rtl.h" |
24 | #include "tree.h" | |
25 | #include "flags.h" | |
26 | #include "expr.h" | |
0dbd1c74 | 27 | #include "regs.h" |
e5fcd76a | 28 | #ifdef __STDC__ |
1789fcfd | 29 | #include <stdarg.h> |
e5fcd76a | 30 | #else |
1789fcfd | 31 | #include <varargs.h> |
e5fcd76a | 32 | #endif |
66d433c7 | 33 | #include "insn-flags.h" |
34 | ||
35 | /* Decide whether a function's arguments should be processed | |
7473731d | 36 | from first to last or from last to first. |
37 | ||
38 | They should if the stack and args grow in opposite directions, but | |
39 | only if we have push insns. */ | |
66d433c7 | 40 | |
66d433c7 | 41 | #ifdef PUSH_ROUNDING |
7473731d | 42 | |
98fdb244 | 43 | #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD) |
66d433c7 | 44 | #define PUSH_ARGS_REVERSED /* If it's last to first */ |
45 | #endif | |
7473731d | 46 | |
66d433c7 | 47 | #endif |
48 | ||
49 | /* Like STACK_BOUNDARY but in units of bytes, not bits. */ | |
50 | #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT) | |
51 | ||
52 | /* Data structure and subroutines used within expand_call. */ | |
53 | ||
54 | struct arg_data | |
55 | { | |
56 | /* Tree node for this argument. */ | |
57 | tree tree_value; | |
1c0c37a5 | 58 | /* Mode for value; TYPE_MODE unless promoted. */ |
59 | enum machine_mode mode; | |
66d433c7 | 60 | /* Current RTL value for argument, or 0 if it isn't precomputed. */ |
61 | rtx value; | |
62 | /* Initially-compute RTL value for argument; only for const functions. */ | |
63 | rtx initial_value; | |
64 | /* Register to pass this argument in, 0 if passed on stack, or an | |
566d850a | 65 | PARALLEL if the arg is to be copied into multiple non-contiguous |
66d433c7 | 66 | registers. */ |
67 | rtx reg; | |
23eb5fa6 | 68 | /* If REG was promoted from the actual mode of the argument expression, |
69 | indicates whether the promotion is sign- or zero-extended. */ | |
70 | int unsignedp; | |
66d433c7 | 71 | /* Number of registers to use. 0 means put the whole arg in registers. |
72 | Also 0 if not passed in registers. */ | |
73 | int partial; | |
f848041f | 74 | /* Non-zero if argument must be passed on stack. |
75 | Note that some arguments may be passed on the stack | |
76 | even though pass_on_stack is zero, just because FUNCTION_ARG says so. | |
77 | pass_on_stack identifies arguments that *cannot* go in registers. */ | |
66d433c7 | 78 | int pass_on_stack; |
79 | /* Offset of this argument from beginning of stack-args. */ | |
80 | struct args_size offset; | |
81 | /* Similar, but offset to the start of the stack slot. Different from | |
82 | OFFSET if this arg pads downward. */ | |
83 | struct args_size slot_offset; | |
84 | /* Size of this argument on the stack, rounded up for any padding it gets, | |
85 | parts of the argument passed in registers do not count. | |
86 | If REG_PARM_STACK_SPACE is defined, then register parms | |
87 | are counted here as well. */ | |
88 | struct args_size size; | |
89 | /* Location on the stack at which parameter should be stored. The store | |
90 | has already been done if STACK == VALUE. */ | |
91 | rtx stack; | |
92 | /* Location on the stack of the start of this argument slot. This can | |
93 | differ from STACK if this arg pads downward. This location is known | |
94 | to be aligned to FUNCTION_ARG_BOUNDARY. */ | |
95 | rtx stack_slot; | |
96 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
97 | /* Place that this stack area has been saved, if needed. */ | |
98 | rtx save_area; | |
99 | #endif | |
f28c7a75 | 100 | /* If an argument's alignment does not permit direct copying into registers, |
101 | copy in smaller-sized pieces into pseudos. These are stored in a | |
102 | block pointed to by this field. The next field says how many | |
103 | word-sized pseudos we made. */ | |
104 | rtx *aligned_regs; | |
105 | int n_aligned_regs; | |
66d433c7 | 106 | }; |
107 | ||
108 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
41332f48 | 109 | /* A vector of one char per byte of stack space. A byte if non-zero if |
66d433c7 | 110 | the corresponding stack location has been used. |
111 | This vector is used to prevent a function call within an argument from | |
112 | clobbering any stack already set up. */ | |
113 | static char *stack_usage_map; | |
114 | ||
115 | /* Size of STACK_USAGE_MAP. */ | |
116 | static int highest_outgoing_arg_in_use; | |
d1b03b62 | 117 | |
118 | /* stack_arg_under_construction is nonzero when an argument may be | |
119 | initialized with a constructor call (including a C function that | |
120 | returns a BLKmode struct) and expand_call must take special action | |
121 | to make sure the object being constructed does not overlap the | |
122 | argument list for the constructor call. */ | |
123 | int stack_arg_under_construction; | |
66d433c7 | 124 | #endif |
125 | ||
8ddf1c7e | 126 | static int calls_function PROTO((tree, int)); |
12731408 | 127 | static int calls_function_1 PROTO((tree, int)); |
f105fa27 | 128 | static void emit_call_1 PROTO((rtx, tree, tree, int, int, rtx, rtx, |
129 | int, rtx, int)); | |
8ddf1c7e | 130 | static void store_one_arg PROTO ((struct arg_data *, rtx, int, int, |
131 | tree, int)); | |
66d433c7 | 132 | \f |
1e04f829 | 133 | /* If WHICH is 1, return 1 if EXP contains a call to the built-in function |
134 | `alloca'. | |
135 | ||
136 | If WHICH is 0, return 1 if EXP contains a call to any function. | |
137 | Actually, we only need return 1 if evaluating EXP would require pushing | |
138 | arguments on the stack, but that is too difficult to compute, so we just | |
139 | assume any function call might require the stack. */ | |
66d433c7 | 140 | |
9640e7db | 141 | static tree calls_function_save_exprs; |
142 | ||
66d433c7 | 143 | static int |
1e04f829 | 144 | calls_function (exp, which) |
66d433c7 | 145 | tree exp; |
1e04f829 | 146 | int which; |
9640e7db | 147 | { |
148 | int val; | |
149 | calls_function_save_exprs = 0; | |
150 | val = calls_function_1 (exp, which); | |
151 | calls_function_save_exprs = 0; | |
152 | return val; | |
153 | } | |
154 | ||
155 | static int | |
156 | calls_function_1 (exp, which) | |
157 | tree exp; | |
158 | int which; | |
66d433c7 | 159 | { |
160 | register int i; | |
ff9e1799 | 161 | enum tree_code code = TREE_CODE (exp); |
162 | int type = TREE_CODE_CLASS (code); | |
163 | int length = tree_code_length[(int) code]; | |
66d433c7 | 164 | |
01cc3b75 | 165 | /* If this code is language-specific, we don't know what it will do. */ |
ff9e1799 | 166 | if ((int) code >= NUM_TREE_CODES) |
167 | return 1; | |
66d433c7 | 168 | |
ff9e1799 | 169 | /* Only expressions and references can contain calls. */ |
21b4c21c | 170 | if (type != 'e' && type != '<' && type != '1' && type != '2' && type != 'r' |
171 | && type != 'b') | |
66d433c7 | 172 | return 0; |
173 | ||
ff9e1799 | 174 | switch (code) |
66d433c7 | 175 | { |
176 | case CALL_EXPR: | |
1e04f829 | 177 | if (which == 0) |
178 | return 1; | |
179 | else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR | |
180 | && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)) | |
ff9e1799 | 181 | == FUNCTION_DECL)) |
182 | { | |
183 | tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0); | |
184 | ||
185 | if ((DECL_BUILT_IN (fndecl) | |
186 | && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_ALLOCA) | |
187 | || (DECL_SAVED_INSNS (fndecl) | |
188 | && (FUNCTION_FLAGS (DECL_SAVED_INSNS (fndecl)) | |
189 | & FUNCTION_FLAGS_CALLS_ALLOCA))) | |
190 | return 1; | |
191 | } | |
66d433c7 | 192 | |
193 | /* Third operand is RTL. */ | |
194 | length = 2; | |
195 | break; | |
196 | ||
197 | case SAVE_EXPR: | |
198 | if (SAVE_EXPR_RTL (exp) != 0) | |
199 | return 0; | |
9640e7db | 200 | if (value_member (exp, calls_function_save_exprs)) |
201 | return 0; | |
202 | calls_function_save_exprs = tree_cons (NULL_TREE, exp, | |
203 | calls_function_save_exprs); | |
204 | return (TREE_OPERAND (exp, 0) != 0 | |
205 | && calls_function_1 (TREE_OPERAND (exp, 0), which)); | |
66d433c7 | 206 | |
207 | case BLOCK: | |
80f6ed33 | 208 | { |
209 | register tree local; | |
210 | ||
211 | for (local = BLOCK_VARS (exp); local; local = TREE_CHAIN (local)) | |
1e04f829 | 212 | if (DECL_INITIAL (local) != 0 |
9640e7db | 213 | && calls_function_1 (DECL_INITIAL (local), which)) |
80f6ed33 | 214 | return 1; |
215 | } | |
216 | { | |
217 | register tree subblock; | |
218 | ||
219 | for (subblock = BLOCK_SUBBLOCKS (exp); | |
220 | subblock; | |
221 | subblock = TREE_CHAIN (subblock)) | |
9640e7db | 222 | if (calls_function_1 (subblock, which)) |
80f6ed33 | 223 | return 1; |
224 | } | |
225 | return 0; | |
66d433c7 | 226 | |
227 | case METHOD_CALL_EXPR: | |
228 | length = 3; | |
229 | break; | |
230 | ||
231 | case WITH_CLEANUP_EXPR: | |
232 | length = 1; | |
233 | break; | |
234 | ||
235 | case RTL_EXPR: | |
236 | return 0; | |
0dbd1c74 | 237 | |
238 | default: | |
239 | break; | |
66d433c7 | 240 | } |
241 | ||
242 | for (i = 0; i < length; i++) | |
243 | if (TREE_OPERAND (exp, i) != 0 | |
9640e7db | 244 | && calls_function_1 (TREE_OPERAND (exp, i), which)) |
66d433c7 | 245 | return 1; |
246 | ||
247 | return 0; | |
248 | } | |
249 | \f | |
250 | /* Force FUNEXP into a form suitable for the address of a CALL, | |
251 | and return that as an rtx. Also load the static chain register | |
252 | if FNDECL is a nested function. | |
253 | ||
8866f42d | 254 | CALL_FUSAGE points to a variable holding the prospective |
255 | CALL_INSN_FUNCTION_USAGE information. */ | |
66d433c7 | 256 | |
d9076622 | 257 | rtx |
8866f42d | 258 | prepare_call_address (funexp, fndecl, call_fusage, reg_parm_seen) |
66d433c7 | 259 | rtx funexp; |
260 | tree fndecl; | |
8866f42d | 261 | rtx *call_fusage; |
a89aeae3 | 262 | int reg_parm_seen; |
66d433c7 | 263 | { |
264 | rtx static_chain_value = 0; | |
265 | ||
266 | funexp = protect_from_queue (funexp, 0); | |
267 | ||
268 | if (fndecl != 0) | |
a92771b8 | 269 | /* Get possible static chain value for nested function in C. */ |
66d433c7 | 270 | static_chain_value = lookup_static_chain (fndecl); |
271 | ||
272 | /* Make a valid memory address and copy constants thru pseudo-regs, | |
273 | but not for a constant address if -fno-function-cse. */ | |
274 | if (GET_CODE (funexp) != SYMBOL_REF) | |
a89aeae3 | 275 | /* If we are using registers for parameters, force the |
0dbd1c74 | 276 | function address into a register now. */ |
277 | funexp = ((SMALL_REGISTER_CLASSES && reg_parm_seen) | |
278 | ? force_not_mem (memory_address (FUNCTION_MODE, funexp)) | |
279 | : memory_address (FUNCTION_MODE, funexp)); | |
66d433c7 | 280 | else |
281 | { | |
282 | #ifndef NO_FUNCTION_CSE | |
283 | if (optimize && ! flag_no_function_cse) | |
284 | #ifdef NO_RECURSIVE_FUNCTION_CSE | |
285 | if (fndecl != current_function_decl) | |
286 | #endif | |
287 | funexp = force_reg (Pmode, funexp); | |
288 | #endif | |
289 | } | |
290 | ||
291 | if (static_chain_value != 0) | |
292 | { | |
293 | emit_move_insn (static_chain_rtx, static_chain_value); | |
294 | ||
4eb91f6f | 295 | if (GET_CODE (static_chain_rtx) == REG) |
296 | use_reg (call_fusage, static_chain_rtx); | |
66d433c7 | 297 | } |
298 | ||
299 | return funexp; | |
300 | } | |
301 | ||
302 | /* Generate instructions to call function FUNEXP, | |
303 | and optionally pop the results. | |
304 | The CALL_INSN is the first insn generated. | |
305 | ||
c74d0a20 | 306 | FNDECL is the declaration node of the function. This is given to the |
e93a4612 | 307 | macro RETURN_POPS_ARGS to determine whether this function pops its own args. |
308 | ||
d429bc10 | 309 | FUNTYPE is the data type of the function. This is given to the macro |
310 | RETURN_POPS_ARGS to determine whether this function pops its own args. | |
311 | We used to allow an identifier for library functions, but that doesn't | |
312 | work when the return type is an aggregate type and the calling convention | |
313 | says that the pointer to this aggregate is to be popped by the callee. | |
66d433c7 | 314 | |
315 | STACK_SIZE is the number of bytes of arguments on the stack, | |
316 | rounded up to STACK_BOUNDARY; zero if the size is variable. | |
317 | This is both to put into the call insn and | |
318 | to generate explicit popping code if necessary. | |
319 | ||
320 | STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value. | |
321 | It is zero if this call doesn't want a structure value. | |
322 | ||
323 | NEXT_ARG_REG is the rtx that results from executing | |
324 | FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1) | |
325 | just after all the args have had their registers assigned. | |
326 | This could be whatever you like, but normally it is the first | |
327 | arg-register beyond those used for args in this call, | |
328 | or 0 if all the arg-registers are used in this call. | |
329 | It is passed on to `gen_call' so you can put this info in the call insn. | |
330 | ||
331 | VALREG is a hard register in which a value is returned, | |
332 | or 0 if the call does not return a value. | |
333 | ||
334 | OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before | |
335 | the args to this call were processed. | |
336 | We restore `inhibit_defer_pop' to that value. | |
337 | ||
07409b3a | 338 | CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that |
339 | denote registers used by the called function. | |
66d433c7 | 340 | |
341 | IS_CONST is true if this is a `const' call. */ | |
342 | ||
8ddf1c7e | 343 | static void |
e93a4612 | 344 | emit_call_1 (funexp, fndecl, funtype, stack_size, struct_value_size, |
f105fa27 | 345 | next_arg_reg, valreg, old_inhibit_defer_pop, call_fusage, |
346 | is_const) | |
66d433c7 | 347 | rtx funexp; |
e93a4612 | 348 | tree fndecl; |
66d433c7 | 349 | tree funtype; |
350 | int stack_size; | |
351 | int struct_value_size; | |
352 | rtx next_arg_reg; | |
353 | rtx valreg; | |
354 | int old_inhibit_defer_pop; | |
8866f42d | 355 | rtx call_fusage; |
66d433c7 | 356 | int is_const; |
357 | { | |
9e6d0a9a | 358 | rtx stack_size_rtx = GEN_INT (stack_size); |
359 | rtx struct_value_size_rtx = GEN_INT (struct_value_size); | |
66d433c7 | 360 | rtx call_insn; |
361 | int already_popped = 0; | |
362 | ||
363 | /* Ensure address is valid. SYMBOL_REF is already valid, so no need, | |
364 | and we don't want to load it into a register as an optimization, | |
365 | because prepare_call_address already did it if it should be done. */ | |
366 | if (GET_CODE (funexp) != SYMBOL_REF) | |
367 | funexp = memory_address (FUNCTION_MODE, funexp); | |
368 | ||
369 | #ifndef ACCUMULATE_OUTGOING_ARGS | |
370 | #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop) | |
371 | if (HAVE_call_pop && HAVE_call_value_pop | |
e93a4612 | 372 | && (RETURN_POPS_ARGS (fndecl, funtype, stack_size) > 0 |
373 | || stack_size == 0)) | |
66d433c7 | 374 | { |
e93a4612 | 375 | rtx n_pop = GEN_INT (RETURN_POPS_ARGS (fndecl, funtype, stack_size)); |
66d433c7 | 376 | rtx pat; |
377 | ||
378 | /* If this subroutine pops its own args, record that in the call insn | |
379 | if possible, for the sake of frame pointer elimination. */ | |
e93a4612 | 380 | |
66d433c7 | 381 | if (valreg) |
382 | pat = gen_call_value_pop (valreg, | |
383 | gen_rtx (MEM, FUNCTION_MODE, funexp), | |
384 | stack_size_rtx, next_arg_reg, n_pop); | |
385 | else | |
386 | pat = gen_call_pop (gen_rtx (MEM, FUNCTION_MODE, funexp), | |
387 | stack_size_rtx, next_arg_reg, n_pop); | |
388 | ||
389 | emit_call_insn (pat); | |
390 | already_popped = 1; | |
391 | } | |
392 | else | |
393 | #endif | |
394 | #endif | |
395 | ||
396 | #if defined (HAVE_call) && defined (HAVE_call_value) | |
397 | if (HAVE_call && HAVE_call_value) | |
398 | { | |
399 | if (valreg) | |
400 | emit_call_insn (gen_call_value (valreg, | |
401 | gen_rtx (MEM, FUNCTION_MODE, funexp), | |
1e8cd5a7 | 402 | stack_size_rtx, next_arg_reg, |
403 | NULL_RTX)); | |
66d433c7 | 404 | else |
405 | emit_call_insn (gen_call (gen_rtx (MEM, FUNCTION_MODE, funexp), | |
406 | stack_size_rtx, next_arg_reg, | |
407 | struct_value_size_rtx)); | |
408 | } | |
409 | else | |
410 | #endif | |
411 | abort (); | |
412 | ||
8866f42d | 413 | /* Find the CALL insn we just emitted. */ |
66d433c7 | 414 | for (call_insn = get_last_insn (); |
415 | call_insn && GET_CODE (call_insn) != CALL_INSN; | |
416 | call_insn = PREV_INSN (call_insn)) | |
417 | ; | |
418 | ||
419 | if (! call_insn) | |
420 | abort (); | |
421 | ||
79402565 | 422 | /* Put the register usage information on the CALL. If there is already |
423 | some usage information, put ours at the end. */ | |
424 | if (CALL_INSN_FUNCTION_USAGE (call_insn)) | |
425 | { | |
426 | rtx link; | |
427 | ||
428 | for (link = CALL_INSN_FUNCTION_USAGE (call_insn); XEXP (link, 1) != 0; | |
429 | link = XEXP (link, 1)) | |
430 | ; | |
431 | ||
432 | XEXP (link, 1) = call_fusage; | |
433 | } | |
434 | else | |
435 | CALL_INSN_FUNCTION_USAGE (call_insn) = call_fusage; | |
66d433c7 | 436 | |
437 | /* If this is a const call, then set the insn's unchanging bit. */ | |
438 | if (is_const) | |
439 | CONST_CALL_P (call_insn) = 1; | |
440 | ||
d1f88d00 | 441 | /* Restore this now, so that we do defer pops for this call's args |
442 | if the context of the call as a whole permits. */ | |
443 | inhibit_defer_pop = old_inhibit_defer_pop; | |
444 | ||
66d433c7 | 445 | #ifndef ACCUMULATE_OUTGOING_ARGS |
446 | /* If returning from the subroutine does not automatically pop the args, | |
447 | we need an instruction to pop them sooner or later. | |
448 | Perhaps do it now; perhaps just record how much space to pop later. | |
449 | ||
450 | If returning from the subroutine does pop the args, indicate that the | |
451 | stack pointer will be changed. */ | |
452 | ||
e93a4612 | 453 | if (stack_size != 0 && RETURN_POPS_ARGS (fndecl, funtype, stack_size) > 0) |
66d433c7 | 454 | { |
455 | if (!already_popped) | |
37808e3a | 456 | CALL_INSN_FUNCTION_USAGE (call_insn) |
457 | = gen_rtx (EXPR_LIST, VOIDmode, | |
458 | gen_rtx (CLOBBER, VOIDmode, stack_pointer_rtx), | |
459 | CALL_INSN_FUNCTION_USAGE (call_insn)); | |
e93a4612 | 460 | stack_size -= RETURN_POPS_ARGS (fndecl, funtype, stack_size); |
9e6d0a9a | 461 | stack_size_rtx = GEN_INT (stack_size); |
66d433c7 | 462 | } |
463 | ||
464 | if (stack_size != 0) | |
465 | { | |
7f5c8d05 | 466 | if (flag_defer_pop && inhibit_defer_pop == 0 && !is_const) |
66d433c7 | 467 | pending_stack_adjust += stack_size; |
468 | else | |
469 | adjust_stack (stack_size_rtx); | |
470 | } | |
471 | #endif | |
472 | } | |
473 | ||
474 | /* Generate all the code for a function call | |
475 | and return an rtx for its value. | |
476 | Store the value in TARGET (specified as an rtx) if convenient. | |
477 | If the value is stored in TARGET then TARGET is returned. | |
478 | If IGNORE is nonzero, then we ignore the value of the function call. */ | |
479 | ||
480 | rtx | |
4e0ff571 | 481 | expand_call (exp, target, ignore) |
66d433c7 | 482 | tree exp; |
483 | rtx target; | |
484 | int ignore; | |
66d433c7 | 485 | { |
486 | /* List of actual parameters. */ | |
487 | tree actparms = TREE_OPERAND (exp, 1); | |
488 | /* RTX for the function to be called. */ | |
489 | rtx funexp; | |
490 | /* Tree node for the function to be called (not the address!). */ | |
491 | tree funtree; | |
492 | /* Data type of the function. */ | |
493 | tree funtype; | |
494 | /* Declaration of the function being called, | |
495 | or 0 if the function is computed (not known by name). */ | |
496 | tree fndecl = 0; | |
497 | char *name = 0; | |
498 | ||
499 | /* Register in which non-BLKmode value will be returned, | |
500 | or 0 if no value or if value is BLKmode. */ | |
501 | rtx valreg; | |
502 | /* Address where we should return a BLKmode value; | |
503 | 0 if value not BLKmode. */ | |
504 | rtx structure_value_addr = 0; | |
505 | /* Nonzero if that address is being passed by treating it as | |
506 | an extra, implicit first parameter. Otherwise, | |
507 | it is passed by being copied directly into struct_value_rtx. */ | |
508 | int structure_value_addr_parm = 0; | |
509 | /* Size of aggregate value wanted, or zero if none wanted | |
510 | or if we are using the non-reentrant PCC calling convention | |
511 | or expecting the value in registers. */ | |
512 | int struct_value_size = 0; | |
513 | /* Nonzero if called function returns an aggregate in memory PCC style, | |
514 | by returning the address of where to find it. */ | |
515 | int pcc_struct_value = 0; | |
516 | ||
517 | /* Number of actual parameters in this call, including struct value addr. */ | |
518 | int num_actuals; | |
519 | /* Number of named args. Args after this are anonymous ones | |
520 | and they must all go on the stack. */ | |
521 | int n_named_args; | |
522 | /* Count arg position in order args appear. */ | |
523 | int argpos; | |
524 | ||
525 | /* Vector of information about each argument. | |
526 | Arguments are numbered in the order they will be pushed, | |
527 | not the order they are written. */ | |
528 | struct arg_data *args; | |
529 | ||
530 | /* Total size in bytes of all the stack-parms scanned so far. */ | |
531 | struct args_size args_size; | |
532 | /* Size of arguments before any adjustments (such as rounding). */ | |
533 | struct args_size original_args_size; | |
534 | /* Data on reg parms scanned so far. */ | |
535 | CUMULATIVE_ARGS args_so_far; | |
536 | /* Nonzero if a reg parm has been scanned. */ | |
537 | int reg_parm_seen; | |
a50ca374 | 538 | /* Nonzero if this is an indirect function call. */ |
66d433c7 | 539 | |
540 | /* Nonzero if we must avoid push-insns in the args for this call. | |
541 | If stack space is allocated for register parameters, but not by the | |
542 | caller, then it is preallocated in the fixed part of the stack frame. | |
543 | So the entire argument block must then be preallocated (i.e., we | |
544 | ignore PUSH_ROUNDING in that case). */ | |
545 | ||
546 | #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE) | |
547 | int must_preallocate = 1; | |
548 | #else | |
549 | #ifdef PUSH_ROUNDING | |
550 | int must_preallocate = 0; | |
551 | #else | |
552 | int must_preallocate = 1; | |
553 | #endif | |
554 | #endif | |
555 | ||
eb2f80f3 | 556 | /* Size of the stack reserved for parameter registers. */ |
2d7187c2 | 557 | int reg_parm_stack_space = 0; |
558 | ||
66d433c7 | 559 | /* 1 if scanning parms front to back, -1 if scanning back to front. */ |
560 | int inc; | |
561 | /* Address of space preallocated for stack parms | |
562 | (on machines that lack push insns), or 0 if space not preallocated. */ | |
563 | rtx argblock = 0; | |
564 | ||
565 | /* Nonzero if it is plausible that this is a call to alloca. */ | |
566 | int may_be_alloca; | |
ea0cb7ae | 567 | /* Nonzero if this is a call to malloc or a related function. */ |
568 | int is_malloc; | |
66d433c7 | 569 | /* Nonzero if this is a call to setjmp or a related function. */ |
570 | int returns_twice; | |
571 | /* Nonzero if this is a call to `longjmp'. */ | |
572 | int is_longjmp; | |
573 | /* Nonzero if this is a call to an inline function. */ | |
574 | int is_integrable = 0; | |
66d433c7 | 575 | /* Nonzero if this is a call to a `const' function. |
576 | Note that only explicitly named functions are handled as `const' here. */ | |
577 | int is_const = 0; | |
578 | /* Nonzero if this is a call to a `volatile' function. */ | |
579 | int is_volatile = 0; | |
580 | #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE) | |
581 | /* Define the boundary of the register parm stack space that needs to be | |
582 | save, if any. */ | |
583 | int low_to_save = -1, high_to_save; | |
584 | rtx save_area = 0; /* Place that it is saved */ | |
585 | #endif | |
586 | ||
587 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
588 | int initial_highest_arg_in_use = highest_outgoing_arg_in_use; | |
589 | char *initial_stack_usage_map = stack_usage_map; | |
590 | #endif | |
591 | ||
592 | rtx old_stack_level = 0; | |
65dccdb1 | 593 | int old_pending_adj = 0; |
d1b03b62 | 594 | int old_stack_arg_under_construction; |
66d433c7 | 595 | int old_inhibit_defer_pop = inhibit_defer_pop; |
8866f42d | 596 | rtx call_fusage = 0; |
66d433c7 | 597 | register tree p; |
f28c7a75 | 598 | register int i, j; |
66d433c7 | 599 | |
7cc85421 | 600 | /* The value of the function call can be put in a hard register. But |
601 | if -fcheck-memory-usage, code which invokes functions (and thus | |
602 | damages some hard registers) can be inserted before using the value. | |
603 | So, target is always a pseudo-register in that case. */ | |
604 | if (flag_check_memory_usage) | |
605 | target = 0; | |
606 | ||
66d433c7 | 607 | /* See if we can find a DECL-node for the actual function. |
608 | As a result, decide whether this is a call to an integrable function. */ | |
609 | ||
610 | p = TREE_OPERAND (exp, 0); | |
611 | if (TREE_CODE (p) == ADDR_EXPR) | |
612 | { | |
613 | fndecl = TREE_OPERAND (p, 0); | |
614 | if (TREE_CODE (fndecl) != FUNCTION_DECL) | |
09220868 | 615 | fndecl = 0; |
66d433c7 | 616 | else |
617 | { | |
618 | if (!flag_no_inline | |
619 | && fndecl != current_function_decl | |
5e477c35 | 620 | && DECL_INLINE (fndecl) |
4bc2d0e5 | 621 | && DECL_SAVED_INSNS (fndecl) |
622 | && RTX_INTEGRATED_P (DECL_SAVED_INSNS (fndecl))) | |
66d433c7 | 623 | is_integrable = 1; |
624 | else if (! TREE_ADDRESSABLE (fndecl)) | |
625 | { | |
064d9c8f | 626 | /* In case this function later becomes inlinable, |
66d433c7 | 627 | record that there was already a non-inline call to it. |
628 | ||
629 | Use abstraction instead of setting TREE_ADDRESSABLE | |
630 | directly. */ | |
9be5e33f | 631 | if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline |
632 | && optimize > 0) | |
718972de | 633 | { |
634 | warning_with_decl (fndecl, "can't inline call to `%s'"); | |
635 | warning ("called from here"); | |
636 | } | |
66d433c7 | 637 | mark_addressable (fndecl); |
638 | } | |
639 | ||
f9e15121 | 640 | if (TREE_READONLY (fndecl) && ! TREE_THIS_VOLATILE (fndecl) |
641 | && TYPE_MODE (TREE_TYPE (exp)) != VOIDmode) | |
66d433c7 | 642 | is_const = 1; |
3e0a58b4 | 643 | |
644 | if (TREE_THIS_VOLATILE (fndecl)) | |
645 | is_volatile = 1; | |
66d433c7 | 646 | } |
647 | } | |
648 | ||
09220868 | 649 | /* If we don't have specific function to call, see if we have a |
650 | constant or `noreturn' function from the type. */ | |
651 | if (fndecl == 0) | |
652 | { | |
653 | is_const = TREE_READONLY (TREE_TYPE (TREE_TYPE (p))); | |
654 | is_volatile = TREE_THIS_VOLATILE (TREE_TYPE (TREE_TYPE (p))); | |
655 | } | |
656 | ||
2d7187c2 | 657 | #ifdef REG_PARM_STACK_SPACE |
658 | #ifdef MAYBE_REG_PARM_STACK_SPACE | |
659 | reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE; | |
660 | #else | |
661 | reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl); | |
662 | #endif | |
663 | #endif | |
664 | ||
66d433c7 | 665 | /* Warn if this value is an aggregate type, |
666 | regardless of which calling convention we are using for it. */ | |
727a13df | 667 | if (warn_aggregate_return && AGGREGATE_TYPE_P (TREE_TYPE (exp))) |
66d433c7 | 668 | warning ("function call has aggregate value"); |
669 | ||
670 | /* Set up a place to return a structure. */ | |
671 | ||
672 | /* Cater to broken compilers. */ | |
673 | if (aggregate_value_p (exp)) | |
674 | { | |
675 | /* This call returns a big structure. */ | |
676 | is_const = 0; | |
677 | ||
678 | #ifdef PCC_STATIC_STRUCT_RETURN | |
f49c64ba | 679 | { |
680 | pcc_struct_value = 1; | |
d7e12e9e | 681 | /* Easier than making that case work right. */ |
682 | if (is_integrable) | |
683 | { | |
684 | /* In case this is a static function, note that it has been | |
685 | used. */ | |
686 | if (! TREE_ADDRESSABLE (fndecl)) | |
687 | mark_addressable (fndecl); | |
688 | is_integrable = 0; | |
689 | } | |
f49c64ba | 690 | } |
691 | #else /* not PCC_STATIC_STRUCT_RETURN */ | |
692 | { | |
693 | struct_value_size = int_size_in_bytes (TREE_TYPE (exp)); | |
66d433c7 | 694 | |
f49c64ba | 695 | if (target && GET_CODE (target) == MEM) |
696 | structure_value_addr = XEXP (target, 0); | |
697 | else | |
698 | { | |
0dbd1c74 | 699 | /* Assign a temporary to hold the value. */ |
700 | tree d; | |
66d433c7 | 701 | |
f49c64ba | 702 | /* For variable-sized objects, we must be called with a target |
703 | specified. If we were to allocate space on the stack here, | |
704 | we would have no way of knowing when to free it. */ | |
66d433c7 | 705 | |
96bf6dcc | 706 | if (struct_value_size < 0) |
707 | abort (); | |
708 | ||
0dbd1c74 | 709 | /* This DECL is just something to feed to mark_addressable; |
710 | it doesn't get pushed. */ | |
711 | d = build_decl (VAR_DECL, NULL_TREE, TREE_TYPE (exp)); | |
712 | DECL_RTL (d) = assign_temp (TREE_TYPE (exp), 1, 0, 1); | |
713 | mark_addressable (d); | |
714 | structure_value_addr = XEXP (DECL_RTL (d), 0); | |
6b08ae80 | 715 | MEM_IN_STRUCT_P (structure_value_addr) |
716 | = AGGREGATE_TYPE_P (TREE_TYPE (exp)); | |
f49c64ba | 717 | target = 0; |
718 | } | |
719 | } | |
720 | #endif /* not PCC_STATIC_STRUCT_RETURN */ | |
66d433c7 | 721 | } |
722 | ||
723 | /* If called function is inline, try to integrate it. */ | |
724 | ||
725 | if (is_integrable) | |
726 | { | |
727 | rtx temp; | |
d1b03b62 | 728 | rtx before_call = get_last_insn (); |
66d433c7 | 729 | |
730 | temp = expand_inline_function (fndecl, actparms, target, | |
731 | ignore, TREE_TYPE (exp), | |
732 | structure_value_addr); | |
733 | ||
734 | /* If inlining succeeded, return. */ | |
918f3152 | 735 | if ((HOST_WIDE_INT) temp != -1) |
66d433c7 | 736 | { |
f848041f | 737 | #ifdef ACCUMULATE_OUTGOING_ARGS |
d1b03b62 | 738 | /* If the outgoing argument list must be preserved, push |
739 | the stack before executing the inlined function if it | |
740 | makes any calls. */ | |
741 | ||
742 | for (i = reg_parm_stack_space - 1; i >= 0; i--) | |
743 | if (i < highest_outgoing_arg_in_use && stack_usage_map[i] != 0) | |
744 | break; | |
745 | ||
746 | if (stack_arg_under_construction || i >= 0) | |
747 | { | |
c946fd01 | 748 | rtx first_insn |
749 | = before_call ? NEXT_INSN (before_call) : get_insns (); | |
750 | rtx insn, seq; | |
d1b03b62 | 751 | |
f848041f | 752 | /* Look for a call in the inline function code. |
753 | If OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)) is | |
754 | nonzero then there is a call and it is not necessary | |
755 | to scan the insns. */ | |
756 | ||
757 | if (OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)) == 0) | |
c946fd01 | 758 | for (insn = first_insn; insn; insn = NEXT_INSN (insn)) |
f848041f | 759 | if (GET_CODE (insn) == CALL_INSN) |
760 | break; | |
d1b03b62 | 761 | |
762 | if (insn) | |
763 | { | |
f848041f | 764 | /* Reserve enough stack space so that the largest |
765 | argument list of any function call in the inline | |
766 | function does not overlap the argument list being | |
767 | evaluated. This is usually an overestimate because | |
768 | allocate_dynamic_stack_space reserves space for an | |
769 | outgoing argument list in addition to the requested | |
770 | space, but there is no way to ask for stack space such | |
771 | that an argument list of a certain length can be | |
772 | safely constructed. */ | |
773 | ||
774 | int adjust = OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)); | |
775 | #ifdef REG_PARM_STACK_SPACE | |
776 | /* Add the stack space reserved for register arguments | |
777 | in the inline function. What is really needed is the | |
778 | largest value of reg_parm_stack_space in the inline | |
779 | function, but that is not available. Using the current | |
780 | value of reg_parm_stack_space is wrong, but gives | |
781 | correct results on all supported machines. */ | |
782 | adjust += reg_parm_stack_space; | |
783 | #endif | |
d1b03b62 | 784 | start_sequence (); |
1a49e3d2 | 785 | emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX); |
9e6d0a9a | 786 | allocate_dynamic_stack_space (GEN_INT (adjust), |
787 | NULL_RTX, BITS_PER_UNIT); | |
d1b03b62 | 788 | seq = get_insns (); |
789 | end_sequence (); | |
c946fd01 | 790 | emit_insns_before (seq, first_insn); |
9e6d0a9a | 791 | emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX); |
d1b03b62 | 792 | } |
793 | } | |
f848041f | 794 | #endif |
66d433c7 | 795 | |
796 | /* If the result is equivalent to TARGET, return TARGET to simplify | |
797 | checks in store_expr. They can be equivalent but not equal in the | |
798 | case of a function that returns BLKmode. */ | |
799 | if (temp != target && rtx_equal_p (temp, target)) | |
800 | return target; | |
801 | return temp; | |
802 | } | |
803 | ||
804 | /* If inlining failed, mark FNDECL as needing to be compiled | |
8c2b7abd | 805 | separately after all. If function was declared inline, |
806 | give a warning. */ | |
807 | if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline | |
9be5e33f | 808 | && optimize > 0 && ! TREE_ADDRESSABLE (fndecl)) |
718972de | 809 | { |
810 | warning_with_decl (fndecl, "inlining failed in call to `%s'"); | |
811 | warning ("called from here"); | |
812 | } | |
66d433c7 | 813 | mark_addressable (fndecl); |
814 | } | |
815 | ||
816 | /* When calling a const function, we must pop the stack args right away, | |
817 | so that the pop is deleted or moved with the call. */ | |
818 | if (is_const) | |
819 | NO_DEFER_POP; | |
820 | ||
821 | function_call_count++; | |
822 | ||
823 | if (fndecl && DECL_NAME (fndecl)) | |
824 | name = IDENTIFIER_POINTER (DECL_NAME (fndecl)); | |
825 | ||
826 | #if 0 | |
827 | /* Unless it's a call to a specific function that isn't alloca, | |
828 | if it has one argument, we must assume it might be alloca. */ | |
829 | ||
37808e3a | 830 | may_be_alloca |
831 | = (!(fndecl != 0 && strcmp (name, "alloca")) | |
832 | && actparms != 0 | |
833 | && TREE_CHAIN (actparms) == 0); | |
66d433c7 | 834 | #else |
835 | /* We assume that alloca will always be called by name. It | |
836 | makes no sense to pass it as a pointer-to-function to | |
837 | anything that does not understand its behavior. */ | |
37808e3a | 838 | may_be_alloca |
839 | = (name && ((IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 6 | |
66d433c7 | 840 | && name[0] == 'a' |
841 | && ! strcmp (name, "alloca")) | |
842 | || (IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 16 | |
843 | && name[0] == '_' | |
844 | && ! strcmp (name, "__builtin_alloca")))); | |
845 | #endif | |
846 | ||
847 | /* See if this is a call to a function that can return more than once | |
848 | or a call to longjmp. */ | |
849 | ||
850 | returns_twice = 0; | |
851 | is_longjmp = 0; | |
ea0cb7ae | 852 | is_malloc = 0; |
66d433c7 | 853 | |
854 | if (name != 0 && IDENTIFIER_LENGTH (DECL_NAME (fndecl)) <= 15) | |
855 | { | |
856 | char *tname = name; | |
857 | ||
a6e96676 | 858 | /* Disregard prefix _, __ or __x. */ |
66d433c7 | 859 | if (name[0] == '_') |
a6e96676 | 860 | { |
861 | if (name[1] == '_' && name[2] == 'x') | |
862 | tname += 3; | |
863 | else if (name[1] == '_') | |
864 | tname += 2; | |
865 | else | |
866 | tname += 1; | |
867 | } | |
66d433c7 | 868 | |
869 | if (tname[0] == 's') | |
870 | { | |
871 | returns_twice | |
872 | = ((tname[1] == 'e' | |
873 | && (! strcmp (tname, "setjmp") | |
874 | || ! strcmp (tname, "setjmp_syscall"))) | |
875 | || (tname[1] == 'i' | |
876 | && ! strcmp (tname, "sigsetjmp")) | |
877 | || (tname[1] == 'a' | |
878 | && ! strcmp (tname, "savectx"))); | |
879 | if (tname[1] == 'i' | |
880 | && ! strcmp (tname, "siglongjmp")) | |
881 | is_longjmp = 1; | |
882 | } | |
883 | else if ((tname[0] == 'q' && tname[1] == 's' | |
884 | && ! strcmp (tname, "qsetjmp")) | |
885 | || (tname[0] == 'v' && tname[1] == 'f' | |
886 | && ! strcmp (tname, "vfork"))) | |
887 | returns_twice = 1; | |
888 | ||
889 | else if (tname[0] == 'l' && tname[1] == 'o' | |
890 | && ! strcmp (tname, "longjmp")) | |
891 | is_longjmp = 1; | |
35d3eedd | 892 | /* XXX should have "malloc" attribute on functions instead |
893 | of recognizing them by name. */ | |
894 | else if (! strcmp (tname, "malloc") | |
895 | || ! strcmp (tname, "calloc") | |
896 | || ! strcmp (tname, "realloc") | |
897 | || ! strcmp (tname, "__builtin_new") | |
898 | || ! strcmp (tname, "__builtin_vec_new")) | |
ea0cb7ae | 899 | is_malloc = 1; |
66d433c7 | 900 | } |
901 | ||
66d433c7 | 902 | if (may_be_alloca) |
903 | current_function_calls_alloca = 1; | |
904 | ||
905 | /* Don't let pending stack adjusts add up to too much. | |
906 | Also, do all pending adjustments now | |
907 | if there is any chance this might be a call to alloca. */ | |
908 | ||
909 | if (pending_stack_adjust >= 32 | |
910 | || (pending_stack_adjust > 0 && may_be_alloca)) | |
911 | do_pending_stack_adjust (); | |
912 | ||
913 | /* Operand 0 is a pointer-to-function; get the type of the function. */ | |
914 | funtype = TREE_TYPE (TREE_OPERAND (exp, 0)); | |
915 | if (TREE_CODE (funtype) != POINTER_TYPE) | |
916 | abort (); | |
917 | funtype = TREE_TYPE (funtype); | |
918 | ||
1b117c60 | 919 | /* Push the temporary stack slot level so that we can free any temporaries |
920 | we make. */ | |
66d433c7 | 921 | push_temp_slots (); |
922 | ||
412321ce | 923 | /* Start updating where the next arg would go. |
924 | ||
925 | On some machines (such as the PA) indirect calls have a different | |
926 | calling convention than normal calls. The last argument in | |
927 | INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call | |
928 | or not. */ | |
929 | INIT_CUMULATIVE_ARGS (args_so_far, funtype, NULL_RTX, (fndecl == 0)); | |
66d433c7 | 930 | |
931 | /* If struct_value_rtx is 0, it means pass the address | |
932 | as if it were an extra parameter. */ | |
933 | if (structure_value_addr && struct_value_rtx == 0) | |
934 | { | |
0f25f434 | 935 | /* If structure_value_addr is a REG other than |
936 | virtual_outgoing_args_rtx, we can use always use it. If it | |
937 | is not a REG, we must always copy it into a register. | |
938 | If it is virtual_outgoing_args_rtx, we must copy it to another | |
939 | register in some cases. */ | |
940 | rtx temp = (GET_CODE (structure_value_addr) != REG | |
f848041f | 941 | #ifdef ACCUMULATE_OUTGOING_ARGS |
0f25f434 | 942 | || (stack_arg_under_construction |
943 | && structure_value_addr == virtual_outgoing_args_rtx) | |
f848041f | 944 | #endif |
0f25f434 | 945 | ? copy_addr_to_reg (structure_value_addr) |
946 | : structure_value_addr); | |
f848041f | 947 | |
66d433c7 | 948 | actparms |
949 | = tree_cons (error_mark_node, | |
950 | make_tree (build_pointer_type (TREE_TYPE (funtype)), | |
d1b03b62 | 951 | temp), |
66d433c7 | 952 | actparms); |
953 | structure_value_addr_parm = 1; | |
954 | } | |
955 | ||
956 | /* Count the arguments and set NUM_ACTUALS. */ | |
957 | for (p = actparms, i = 0; p; p = TREE_CHAIN (p)) i++; | |
958 | num_actuals = i; | |
959 | ||
960 | /* Compute number of named args. | |
961 | Normally, don't include the last named arg if anonymous args follow. | |
a5a3d685 | 962 | We do include the last named arg if STRICT_ARGUMENT_NAMING is defined. |
963 | (If no anonymous args follow, the result of list_length is actually | |
964 | one too large. This is harmless.) | |
66d433c7 | 965 | |
a5a3d685 | 966 | If SETUP_INCOMING_VARARGS is defined and STRICT_ARGUMENT_NAMING is not, |
967 | this machine will be able to place unnamed args that were passed in | |
968 | registers into the stack. So treat all args as named. This allows the | |
969 | insns emitting for a specific argument list to be independent of the | |
970 | function declaration. | |
66d433c7 | 971 | |
972 | If SETUP_INCOMING_VARARGS is not defined, we do not have any reliable | |
973 | way to pass unnamed args in registers, so we must force them into | |
974 | memory. */ | |
a5a3d685 | 975 | #if !defined(SETUP_INCOMING_VARARGS) || defined(STRICT_ARGUMENT_NAMING) |
66d433c7 | 976 | if (TYPE_ARG_TYPES (funtype) != 0) |
977 | n_named_args | |
39ba8f06 | 978 | = (list_length (TYPE_ARG_TYPES (funtype)) |
a5a3d685 | 979 | #ifndef STRICT_ARGUMENT_NAMING |
39ba8f06 | 980 | /* Don't include the last named arg. */ |
981 | - 1 | |
a5a3d685 | 982 | #endif |
39ba8f06 | 983 | /* Count the struct value address, if it is passed as a parm. */ |
984 | + structure_value_addr_parm); | |
66d433c7 | 985 | else |
986 | #endif | |
987 | /* If we know nothing, treat all args as named. */ | |
988 | n_named_args = num_actuals; | |
989 | ||
990 | /* Make a vector to hold all the information about each arg. */ | |
991 | args = (struct arg_data *) alloca (num_actuals * sizeof (struct arg_data)); | |
748e6d74 | 992 | bzero ((char *) args, num_actuals * sizeof (struct arg_data)); |
66d433c7 | 993 | |
994 | args_size.constant = 0; | |
995 | args_size.var = 0; | |
996 | ||
997 | /* In this loop, we consider args in the order they are written. | |
39ba8f06 | 998 | We fill up ARGS from the front or from the back if necessary |
66d433c7 | 999 | so that in any case the first arg to be pushed ends up at the front. */ |
1000 | ||
1001 | #ifdef PUSH_ARGS_REVERSED | |
1002 | i = num_actuals - 1, inc = -1; | |
1003 | /* In this case, must reverse order of args | |
1004 | so that we compute and push the last arg first. */ | |
1005 | #else | |
1006 | i = 0, inc = 1; | |
1007 | #endif | |
1008 | ||
1009 | /* I counts args in order (to be) pushed; ARGPOS counts in order written. */ | |
1010 | for (p = actparms, argpos = 0; p; p = TREE_CHAIN (p), i += inc, argpos++) | |
1011 | { | |
1012 | tree type = TREE_TYPE (TREE_VALUE (p)); | |
bbc8e3c2 | 1013 | int unsignedp; |
23eb5fa6 | 1014 | enum machine_mode mode; |
66d433c7 | 1015 | |
1016 | args[i].tree_value = TREE_VALUE (p); | |
1017 | ||
1018 | /* Replace erroneous argument with constant zero. */ | |
1019 | if (type == error_mark_node || TYPE_SIZE (type) == 0) | |
1020 | args[i].tree_value = integer_zero_node, type = integer_type_node; | |
1021 | ||
1aa89d4f | 1022 | /* If TYPE is a transparent union, pass things the way we would |
1023 | pass the first field of the union. We have already verified that | |
1024 | the modes are the same. */ | |
1025 | if (TYPE_TRANSPARENT_UNION (type)) | |
1026 | type = TREE_TYPE (TYPE_FIELDS (type)); | |
1027 | ||
66d433c7 | 1028 | /* Decide where to pass this arg. |
1029 | ||
1030 | args[i].reg is nonzero if all or part is passed in registers. | |
1031 | ||
1032 | args[i].partial is nonzero if part but not all is passed in registers, | |
1033 | and the exact value says how many words are passed in registers. | |
1034 | ||
1035 | args[i].pass_on_stack is nonzero if the argument must at least be | |
1036 | computed on the stack. It may then be loaded back into registers | |
1037 | if args[i].reg is nonzero. | |
1038 | ||
1039 | These decisions are driven by the FUNCTION_... macros and must agree | |
1040 | with those made by function.c. */ | |
1041 | ||
66d433c7 | 1042 | /* See if this argument should be passed by invisible reference. */ |
b46e8150 | 1043 | if ((TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST |
1044 | && contains_placeholder_p (TYPE_SIZE (type))) | |
7754c6a4 | 1045 | || TREE_ADDRESSABLE (type) |
b46e8150 | 1046 | #ifdef FUNCTION_ARG_PASS_BY_REFERENCE |
1047 | || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, TYPE_MODE (type), | |
1048 | type, argpos < n_named_args) | |
1049 | #endif | |
1050 | ) | |
66d433c7 | 1051 | { |
97529b05 | 1052 | /* If we're compiling a thunk, pass through invisible |
1053 | references instead of making a copy. */ | |
1054 | if (current_function_is_thunk | |
f197f388 | 1055 | #ifdef FUNCTION_ARG_CALLEE_COPIES |
97529b05 | 1056 | || (FUNCTION_ARG_CALLEE_COPIES (args_so_far, TYPE_MODE (type), |
1057 | type, argpos < n_named_args) | |
1058 | /* If it's in a register, we must make a copy of it too. */ | |
1059 | /* ??? Is this a sufficient test? Is there a better one? */ | |
1060 | && !(TREE_CODE (args[i].tree_value) == VAR_DECL | |
1061 | && REG_P (DECL_RTL (args[i].tree_value))) | |
1062 | && ! TREE_ADDRESSABLE (type)) | |
1063 | #endif | |
1064 | ) | |
66d433c7 | 1065 | { |
f197f388 | 1066 | args[i].tree_value = build1 (ADDR_EXPR, |
1067 | build_pointer_type (type), | |
1068 | args[i].tree_value); | |
1069 | type = build_pointer_type (type); | |
66d433c7 | 1070 | } |
1071 | else | |
9c2089be | 1072 | { |
f197f388 | 1073 | /* We make a copy of the object and pass the address to the |
1074 | function being called. */ | |
1075 | rtx copy; | |
66d433c7 | 1076 | |
f197f388 | 1077 | if (TYPE_SIZE (type) == 0 |
8a7f75b9 | 1078 | || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST |
1079 | || (flag_stack_check && ! STACK_CHECK_BUILTIN | |
1080 | && (TREE_INT_CST_HIGH (TYPE_SIZE (type)) != 0 | |
1081 | || (TREE_INT_CST_LOW (TYPE_SIZE (type)) | |
1082 | > STACK_CHECK_MAX_VAR_SIZE * BITS_PER_UNIT)))) | |
f197f388 | 1083 | { |
1084 | /* This is a variable-sized object. Make space on the stack | |
1085 | for it. */ | |
1086 | rtx size_rtx = expr_size (TREE_VALUE (p)); | |
1087 | ||
1088 | if (old_stack_level == 0) | |
1089 | { | |
1090 | emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX); | |
1091 | old_pending_adj = pending_stack_adjust; | |
1092 | pending_stack_adjust = 0; | |
1093 | } | |
1094 | ||
1095 | copy = gen_rtx (MEM, BLKmode, | |
1096 | allocate_dynamic_stack_space (size_rtx, | |
1097 | NULL_RTX, | |
1098 | TYPE_ALIGN (type))); | |
1099 | } | |
1100 | else | |
1101 | { | |
1102 | int size = int_size_in_bytes (type); | |
1eee775e | 1103 | copy = assign_stack_temp (TYPE_MODE (type), size, 0); |
f197f388 | 1104 | } |
66d433c7 | 1105 | |
727a13df | 1106 | MEM_IN_STRUCT_P (copy) = AGGREGATE_TYPE_P (type); |
be4f0195 | 1107 | |
f197f388 | 1108 | store_expr (args[i].tree_value, copy, 0); |
e57b4be8 | 1109 | is_const = 0; |
f197f388 | 1110 | |
1111 | args[i].tree_value = build1 (ADDR_EXPR, | |
1112 | build_pointer_type (type), | |
1113 | make_tree (type, copy)); | |
1114 | type = build_pointer_type (type); | |
1115 | } | |
66d433c7 | 1116 | } |
66d433c7 | 1117 | |
23eb5fa6 | 1118 | mode = TYPE_MODE (type); |
bbc8e3c2 | 1119 | unsignedp = TREE_UNSIGNED (type); |
23eb5fa6 | 1120 | |
1121 | #ifdef PROMOTE_FUNCTION_ARGS | |
bbc8e3c2 | 1122 | mode = promote_mode (type, mode, &unsignedp, 1); |
23eb5fa6 | 1123 | #endif |
1124 | ||
bbc8e3c2 | 1125 | args[i].unsignedp = unsignedp; |
1c0c37a5 | 1126 | args[i].mode = mode; |
23eb5fa6 | 1127 | args[i].reg = FUNCTION_ARG (args_so_far, mode, type, |
66d433c7 | 1128 | argpos < n_named_args); |
1129 | #ifdef FUNCTION_ARG_PARTIAL_NREGS | |
1130 | if (args[i].reg) | |
1131 | args[i].partial | |
23eb5fa6 | 1132 | = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, type, |
66d433c7 | 1133 | argpos < n_named_args); |
1134 | #endif | |
1135 | ||
23eb5fa6 | 1136 | args[i].pass_on_stack = MUST_PASS_IN_STACK (mode, type); |
66d433c7 | 1137 | |
566d850a | 1138 | /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]), |
1139 | it means that we are to pass this arg in the register(s) designated | |
1140 | by the PARALLEL, but also to pass it in the stack. */ | |
1141 | if (args[i].reg && GET_CODE (args[i].reg) == PARALLEL | |
1142 | && XEXP (XVECEXP (args[i].reg, 0, 0), 0) == 0) | |
1143 | args[i].pass_on_stack = 1; | |
66d433c7 | 1144 | |
1145 | /* If this is an addressable type, we must preallocate the stack | |
1146 | since we must evaluate the object into its final location. | |
1147 | ||
1148 | If this is to be passed in both registers and the stack, it is simpler | |
1149 | to preallocate. */ | |
1150 | if (TREE_ADDRESSABLE (type) | |
1151 | || (args[i].pass_on_stack && args[i].reg != 0)) | |
1152 | must_preallocate = 1; | |
1153 | ||
1154 | /* If this is an addressable type, we cannot pre-evaluate it. Thus, | |
1155 | we cannot consider this function call constant. */ | |
1156 | if (TREE_ADDRESSABLE (type)) | |
1157 | is_const = 0; | |
1158 | ||
1159 | /* Compute the stack-size of this argument. */ | |
1160 | if (args[i].reg == 0 || args[i].partial != 0 | |
1161 | #ifdef REG_PARM_STACK_SPACE | |
2d7187c2 | 1162 | || reg_parm_stack_space > 0 |
66d433c7 | 1163 | #endif |
1164 | || args[i].pass_on_stack) | |
1c0c37a5 | 1165 | locate_and_pad_parm (mode, type, |
66d433c7 | 1166 | #ifdef STACK_PARMS_IN_REG_PARM_AREA |
1167 | 1, | |
1168 | #else | |
1169 | args[i].reg != 0, | |
1170 | #endif | |
1171 | fndecl, &args_size, &args[i].offset, | |
1172 | &args[i].size); | |
1173 | ||
1174 | #ifndef ARGS_GROW_DOWNWARD | |
1175 | args[i].slot_offset = args_size; | |
1176 | #endif | |
1177 | ||
1178 | #ifndef REG_PARM_STACK_SPACE | |
1179 | /* If a part of the arg was put into registers, | |
1180 | don't include that part in the amount pushed. */ | |
1181 | if (! args[i].pass_on_stack) | |
1182 | args[i].size.constant -= ((args[i].partial * UNITS_PER_WORD) | |
1183 | / (PARM_BOUNDARY / BITS_PER_UNIT) | |
1184 | * (PARM_BOUNDARY / BITS_PER_UNIT)); | |
1185 | #endif | |
1186 | ||
1187 | /* Update ARGS_SIZE, the total stack space for args so far. */ | |
1188 | ||
1189 | args_size.constant += args[i].size.constant; | |
1190 | if (args[i].size.var) | |
1191 | { | |
1192 | ADD_PARM_SIZE (args_size, args[i].size.var); | |
1193 | } | |
1194 | ||
1195 | /* Since the slot offset points to the bottom of the slot, | |
1196 | we must record it after incrementing if the args grow down. */ | |
1197 | #ifdef ARGS_GROW_DOWNWARD | |
1198 | args[i].slot_offset = args_size; | |
1199 | ||
1200 | args[i].slot_offset.constant = -args_size.constant; | |
1201 | if (args_size.var) | |
1202 | { | |
1203 | SUB_PARM_SIZE (args[i].slot_offset, args_size.var); | |
1204 | } | |
1205 | #endif | |
1206 | ||
1207 | /* Increment ARGS_SO_FAR, which has info about which arg-registers | |
1208 | have been used, etc. */ | |
1209 | ||
1210 | FUNCTION_ARG_ADVANCE (args_so_far, TYPE_MODE (type), type, | |
1211 | argpos < n_named_args); | |
1212 | } | |
1213 | ||
2d7187c2 | 1214 | #ifdef FINAL_REG_PARM_STACK_SPACE |
1215 | reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant, | |
1216 | args_size.var); | |
1217 | #endif | |
1218 | ||
66d433c7 | 1219 | /* Compute the actual size of the argument block required. The variable |
1220 | and constant sizes must be combined, the size may have to be rounded, | |
1221 | and there may be a minimum required size. */ | |
1222 | ||
1223 | original_args_size = args_size; | |
1224 | if (args_size.var) | |
1225 | { | |
1226 | /* If this function requires a variable-sized argument list, don't try to | |
1227 | make a cse'able block for this call. We may be able to do this | |
1228 | eventually, but it is too complicated to keep track of what insns go | |
1229 | in the cse'able block and which don't. */ | |
1230 | ||
1231 | is_const = 0; | |
1232 | must_preallocate = 1; | |
1233 | ||
1234 | args_size.var = ARGS_SIZE_TREE (args_size); | |
1235 | args_size.constant = 0; | |
1236 | ||
1237 | #ifdef STACK_BOUNDARY | |
1238 | if (STACK_BOUNDARY != BITS_PER_UNIT) | |
1239 | args_size.var = round_up (args_size.var, STACK_BYTES); | |
1240 | #endif | |
1241 | ||
1242 | #ifdef REG_PARM_STACK_SPACE | |
2d7187c2 | 1243 | if (reg_parm_stack_space > 0) |
66d433c7 | 1244 | { |
1245 | args_size.var | |
1246 | = size_binop (MAX_EXPR, args_size.var, | |
1247 | size_int (REG_PARM_STACK_SPACE (fndecl))); | |
1248 | ||
1249 | #ifndef OUTGOING_REG_PARM_STACK_SPACE | |
1250 | /* The area corresponding to register parameters is not to count in | |
1251 | the size of the block we need. So make the adjustment. */ | |
1252 | args_size.var | |
1253 | = size_binop (MINUS_EXPR, args_size.var, | |
2d7187c2 | 1254 | size_int (reg_parm_stack_space)); |
66d433c7 | 1255 | #endif |
1256 | } | |
1257 | #endif | |
1258 | } | |
1259 | else | |
1260 | { | |
1261 | #ifdef STACK_BOUNDARY | |
1262 | args_size.constant = (((args_size.constant + (STACK_BYTES - 1)) | |
1263 | / STACK_BYTES) * STACK_BYTES); | |
1264 | #endif | |
1265 | ||
1266 | #ifdef REG_PARM_STACK_SPACE | |
1267 | args_size.constant = MAX (args_size.constant, | |
2d7187c2 | 1268 | reg_parm_stack_space); |
116ab482 | 1269 | #ifdef MAYBE_REG_PARM_STACK_SPACE |
1270 | if (reg_parm_stack_space == 0) | |
1271 | args_size.constant = 0; | |
1272 | #endif | |
66d433c7 | 1273 | #ifndef OUTGOING_REG_PARM_STACK_SPACE |
2d7187c2 | 1274 | args_size.constant -= reg_parm_stack_space; |
66d433c7 | 1275 | #endif |
1276 | #endif | |
1277 | } | |
1278 | ||
1279 | /* See if we have or want to preallocate stack space. | |
1280 | ||
1281 | If we would have to push a partially-in-regs parm | |
1282 | before other stack parms, preallocate stack space instead. | |
1283 | ||
1284 | If the size of some parm is not a multiple of the required stack | |
1285 | alignment, we must preallocate. | |
1286 | ||
1287 | If the total size of arguments that would otherwise create a copy in | |
1288 | a temporary (such as a CALL) is more than half the total argument list | |
1289 | size, preallocation is faster. | |
1290 | ||
1291 | Another reason to preallocate is if we have a machine (like the m88k) | |
1292 | where stack alignment is required to be maintained between every | |
1293 | pair of insns, not just when the call is made. However, we assume here | |
1294 | that such machines either do not have push insns (and hence preallocation | |
1295 | would occur anyway) or the problem is taken care of with | |
1296 | PUSH_ROUNDING. */ | |
1297 | ||
1298 | if (! must_preallocate) | |
1299 | { | |
1300 | int partial_seen = 0; | |
1301 | int copy_to_evaluate_size = 0; | |
1302 | ||
1303 | for (i = 0; i < num_actuals && ! must_preallocate; i++) | |
1304 | { | |
1305 | if (args[i].partial > 0 && ! args[i].pass_on_stack) | |
1306 | partial_seen = 1; | |
1307 | else if (partial_seen && args[i].reg == 0) | |
1308 | must_preallocate = 1; | |
1309 | ||
1310 | if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode | |
1311 | && (TREE_CODE (args[i].tree_value) == CALL_EXPR | |
1312 | || TREE_CODE (args[i].tree_value) == TARGET_EXPR | |
1313 | || TREE_CODE (args[i].tree_value) == COND_EXPR | |
1314 | || TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value)))) | |
1315 | copy_to_evaluate_size | |
1316 | += int_size_in_bytes (TREE_TYPE (args[i].tree_value)); | |
1317 | } | |
1318 | ||
fd8049a1 | 1319 | if (copy_to_evaluate_size * 2 >= args_size.constant |
1320 | && args_size.constant > 0) | |
66d433c7 | 1321 | must_preallocate = 1; |
1322 | } | |
1323 | ||
1324 | /* If the structure value address will reference the stack pointer, we must | |
1325 | stabilize it. We don't need to do this if we know that we are not going | |
1326 | to adjust the stack pointer in processing this call. */ | |
1327 | ||
1328 | if (structure_value_addr | |
1329 | && (reg_mentioned_p (virtual_stack_dynamic_rtx, structure_value_addr) | |
1330 | || reg_mentioned_p (virtual_outgoing_args_rtx, structure_value_addr)) | |
1331 | && (args_size.var | |
1332 | #ifndef ACCUMULATE_OUTGOING_ARGS | |
1333 | || args_size.constant | |
1334 | #endif | |
1335 | )) | |
1336 | structure_value_addr = copy_to_reg (structure_value_addr); | |
1337 | ||
1338 | /* If this function call is cse'able, precompute all the parameters. | |
1339 | Note that if the parameter is constructed into a temporary, this will | |
1340 | cause an additional copy because the parameter will be constructed | |
1341 | into a temporary location and then copied into the outgoing arguments. | |
1342 | If a parameter contains a call to alloca and this function uses the | |
1343 | stack, precompute the parameter. */ | |
1344 | ||
1e04f829 | 1345 | /* If we preallocated the stack space, and some arguments must be passed |
1346 | on the stack, then we must precompute any parameter which contains a | |
1347 | function call which will store arguments on the stack. | |
1348 | Otherwise, evaluating the parameter may clobber previous parameters | |
1349 | which have already been stored into the stack. */ | |
1350 | ||
66d433c7 | 1351 | for (i = 0; i < num_actuals; i++) |
1352 | if (is_const | |
1353 | || ((args_size.var != 0 || args_size.constant != 0) | |
1e04f829 | 1354 | && calls_function (args[i].tree_value, 1)) |
1355 | || (must_preallocate && (args_size.var != 0 || args_size.constant != 0) | |
1356 | && calls_function (args[i].tree_value, 0))) | |
66d433c7 | 1357 | { |
7754c6a4 | 1358 | /* If this is an addressable type, we cannot pre-evaluate it. */ |
1359 | if (TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value))) | |
1360 | abort (); | |
1361 | ||
1b117c60 | 1362 | push_temp_slots (); |
1363 | ||
66d433c7 | 1364 | args[i].initial_value = args[i].value |
9e6d0a9a | 1365 | = expand_expr (args[i].tree_value, NULL_RTX, VOIDmode, 0); |
1c0c37a5 | 1366 | |
66d433c7 | 1367 | preserve_temp_slots (args[i].value); |
1b117c60 | 1368 | pop_temp_slots (); |
66d433c7 | 1369 | |
1370 | /* ANSI doesn't require a sequence point here, | |
1371 | but PCC has one, so this will avoid some problems. */ | |
1372 | emit_queue (); | |
b84de6cd | 1373 | |
1374 | args[i].initial_value = args[i].value | |
1375 | = protect_from_queue (args[i].initial_value, 0); | |
1376 | ||
1377 | if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) != args[i].mode) | |
1378 | args[i].value | |
1379 | = convert_modes (args[i].mode, | |
1380 | TYPE_MODE (TREE_TYPE (args[i].tree_value)), | |
1381 | args[i].value, args[i].unsignedp); | |
66d433c7 | 1382 | } |
1383 | ||
1384 | /* Now we are about to start emitting insns that can be deleted | |
1385 | if a libcall is deleted. */ | |
ea0cb7ae | 1386 | if (is_const || is_malloc) |
66d433c7 | 1387 | start_sequence (); |
1388 | ||
1389 | /* If we have no actual push instructions, or shouldn't use them, | |
1390 | make space for all args right now. */ | |
1391 | ||
1392 | if (args_size.var != 0) | |
1393 | { | |
1394 | if (old_stack_level == 0) | |
1395 | { | |
9e6d0a9a | 1396 | emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX); |
66d433c7 | 1397 | old_pending_adj = pending_stack_adjust; |
1398 | pending_stack_adjust = 0; | |
f848041f | 1399 | #ifdef ACCUMULATE_OUTGOING_ARGS |
d1b03b62 | 1400 | /* stack_arg_under_construction says whether a stack arg is |
1401 | being constructed at the old stack level. Pushing the stack | |
1402 | gets a clean outgoing argument block. */ | |
1403 | old_stack_arg_under_construction = stack_arg_under_construction; | |
1404 | stack_arg_under_construction = 0; | |
f848041f | 1405 | #endif |
66d433c7 | 1406 | } |
1407 | argblock = push_block (ARGS_SIZE_RTX (args_size), 0, 0); | |
1408 | } | |
7221f864 | 1409 | else |
66d433c7 | 1410 | { |
1411 | /* Note that we must go through the motions of allocating an argument | |
1412 | block even if the size is zero because we may be storing args | |
1413 | in the area reserved for register arguments, which may be part of | |
1414 | the stack frame. */ | |
7221f864 | 1415 | |
66d433c7 | 1416 | int needed = args_size.constant; |
1417 | ||
a92771b8 | 1418 | /* Store the maximum argument space used. It will be pushed by |
1419 | the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow | |
1420 | checking). */ | |
66d433c7 | 1421 | |
1422 | if (needed > current_function_outgoing_args_size) | |
1423 | current_function_outgoing_args_size = needed; | |
1424 | ||
7221f864 | 1425 | if (must_preallocate) |
1426 | { | |
1427 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
1428 | /* Since the stack pointer will never be pushed, it is possible for | |
1429 | the evaluation of a parm to clobber something we have already | |
1430 | written to the stack. Since most function calls on RISC machines | |
1431 | do not use the stack, this is uncommon, but must work correctly. | |
1432 | ||
1433 | Therefore, we save any area of the stack that was already written | |
1434 | and that we are using. Here we set up to do this by making a new | |
1435 | stack usage map from the old one. The actual save will be done | |
1436 | by store_one_arg. | |
1437 | ||
1438 | Another approach might be to try to reorder the argument | |
1439 | evaluations to avoid this conflicting stack usage. */ | |
1440 | ||
66d433c7 | 1441 | #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE) |
7221f864 | 1442 | /* Since we will be writing into the entire argument area, the |
1443 | map must be allocated for its entire size, not just the part that | |
1444 | is the responsibility of the caller. */ | |
1445 | needed += reg_parm_stack_space; | |
66d433c7 | 1446 | #endif |
1447 | ||
1448 | #ifdef ARGS_GROW_DOWNWARD | |
7221f864 | 1449 | highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use, |
1450 | needed + 1); | |
66d433c7 | 1451 | #else |
7221f864 | 1452 | highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use, |
1453 | needed); | |
66d433c7 | 1454 | #endif |
7221f864 | 1455 | stack_usage_map = (char *) alloca (highest_outgoing_arg_in_use); |
66d433c7 | 1456 | |
7221f864 | 1457 | if (initial_highest_arg_in_use) |
1458 | bcopy (initial_stack_usage_map, stack_usage_map, | |
1459 | initial_highest_arg_in_use); | |
66d433c7 | 1460 | |
7221f864 | 1461 | if (initial_highest_arg_in_use != highest_outgoing_arg_in_use) |
1462 | bzero (&stack_usage_map[initial_highest_arg_in_use], | |
1463 | highest_outgoing_arg_in_use - initial_highest_arg_in_use); | |
1464 | needed = 0; | |
d1b03b62 | 1465 | |
7221f864 | 1466 | /* The address of the outgoing argument list must not be copied to a |
1467 | register here, because argblock would be left pointing to the | |
1468 | wrong place after the call to allocate_dynamic_stack_space below. | |
1469 | */ | |
d1b03b62 | 1470 | |
7221f864 | 1471 | argblock = virtual_outgoing_args_rtx; |
d1b03b62 | 1472 | |
66d433c7 | 1473 | #else /* not ACCUMULATE_OUTGOING_ARGS */ |
7221f864 | 1474 | if (inhibit_defer_pop == 0) |
66d433c7 | 1475 | { |
7221f864 | 1476 | /* Try to reuse some or all of the pending_stack_adjust |
1477 | to get this space. Maybe we can avoid any pushing. */ | |
1478 | if (needed > pending_stack_adjust) | |
1479 | { | |
1480 | needed -= pending_stack_adjust; | |
1481 | pending_stack_adjust = 0; | |
1482 | } | |
1483 | else | |
1484 | { | |
1485 | pending_stack_adjust -= needed; | |
1486 | needed = 0; | |
1487 | } | |
66d433c7 | 1488 | } |
7221f864 | 1489 | /* Special case this because overhead of `push_block' in this |
1490 | case is non-trivial. */ | |
1491 | if (needed == 0) | |
1492 | argblock = virtual_outgoing_args_rtx; | |
66d433c7 | 1493 | else |
7221f864 | 1494 | argblock = push_block (GEN_INT (needed), 0, 0); |
1495 | ||
1496 | /* We only really need to call `copy_to_reg' in the case where push | |
1497 | insns are going to be used to pass ARGBLOCK to a function | |
1498 | call in ARGS. In that case, the stack pointer changes value | |
1499 | from the allocation point to the call point, and hence | |
1500 | the value of VIRTUAL_OUTGOING_ARGS_RTX changes as well. | |
1501 | But might as well always do it. */ | |
1502 | argblock = copy_to_reg (argblock); | |
66d433c7 | 1503 | #endif /* not ACCUMULATE_OUTGOING_ARGS */ |
7221f864 | 1504 | } |
66d433c7 | 1505 | } |
1506 | ||
a3585b90 | 1507 | #ifdef ACCUMULATE_OUTGOING_ARGS |
1508 | /* The save/restore code in store_one_arg handles all cases except one: | |
1509 | a constructor call (including a C function returning a BLKmode struct) | |
1510 | to initialize an argument. */ | |
1511 | if (stack_arg_under_construction) | |
1512 | { | |
1513 | #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE) | |
9e6d0a9a | 1514 | rtx push_size = GEN_INT (reg_parm_stack_space + args_size.constant); |
a3585b90 | 1515 | #else |
9e6d0a9a | 1516 | rtx push_size = GEN_INT (args_size.constant); |
a3585b90 | 1517 | #endif |
1518 | if (old_stack_level == 0) | |
1519 | { | |
9e6d0a9a | 1520 | emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX); |
a3585b90 | 1521 | old_pending_adj = pending_stack_adjust; |
1522 | pending_stack_adjust = 0; | |
1523 | /* stack_arg_under_construction says whether a stack arg is | |
1524 | being constructed at the old stack level. Pushing the stack | |
1525 | gets a clean outgoing argument block. */ | |
1526 | old_stack_arg_under_construction = stack_arg_under_construction; | |
1527 | stack_arg_under_construction = 0; | |
1528 | /* Make a new map for the new argument list. */ | |
1529 | stack_usage_map = (char *)alloca (highest_outgoing_arg_in_use); | |
1530 | bzero (stack_usage_map, highest_outgoing_arg_in_use); | |
1531 | highest_outgoing_arg_in_use = 0; | |
1532 | } | |
9e6d0a9a | 1533 | allocate_dynamic_stack_space (push_size, NULL_RTX, BITS_PER_UNIT); |
a3585b90 | 1534 | } |
1535 | /* If argument evaluation might modify the stack pointer, copy the | |
1536 | address of the argument list to a register. */ | |
1537 | for (i = 0; i < num_actuals; i++) | |
1538 | if (args[i].pass_on_stack) | |
1539 | { | |
1540 | argblock = copy_addr_to_reg (argblock); | |
1541 | break; | |
1542 | } | |
1543 | #endif | |
1544 | ||
1545 | ||
66d433c7 | 1546 | /* If we preallocated stack space, compute the address of each argument. |
1547 | We need not ensure it is a valid memory address here; it will be | |
1548 | validized when it is used. */ | |
1549 | if (argblock) | |
1550 | { | |
1551 | rtx arg_reg = argblock; | |
1552 | int arg_offset = 0; | |
1553 | ||
1554 | if (GET_CODE (argblock) == PLUS) | |
1555 | arg_reg = XEXP (argblock, 0), arg_offset = INTVAL (XEXP (argblock, 1)); | |
1556 | ||
1557 | for (i = 0; i < num_actuals; i++) | |
1558 | { | |
1559 | rtx offset = ARGS_SIZE_RTX (args[i].offset); | |
1560 | rtx slot_offset = ARGS_SIZE_RTX (args[i].slot_offset); | |
1561 | rtx addr; | |
1562 | ||
1563 | /* Skip this parm if it will not be passed on the stack. */ | |
1564 | if (! args[i].pass_on_stack && args[i].reg != 0) | |
1565 | continue; | |
1566 | ||
1567 | if (GET_CODE (offset) == CONST_INT) | |
1568 | addr = plus_constant (arg_reg, INTVAL (offset)); | |
1569 | else | |
1570 | addr = gen_rtx (PLUS, Pmode, arg_reg, offset); | |
1571 | ||
1572 | addr = plus_constant (addr, arg_offset); | |
1c0c37a5 | 1573 | args[i].stack = gen_rtx (MEM, args[i].mode, addr); |
db2c3be6 | 1574 | MEM_IN_STRUCT_P (args[i].stack) |
727a13df | 1575 | = AGGREGATE_TYPE_P (TREE_TYPE (args[i].tree_value)); |
66d433c7 | 1576 | |
1577 | if (GET_CODE (slot_offset) == CONST_INT) | |
1578 | addr = plus_constant (arg_reg, INTVAL (slot_offset)); | |
1579 | else | |
1580 | addr = gen_rtx (PLUS, Pmode, arg_reg, slot_offset); | |
1581 | ||
1582 | addr = plus_constant (addr, arg_offset); | |
1c0c37a5 | 1583 | args[i].stack_slot = gen_rtx (MEM, args[i].mode, addr); |
66d433c7 | 1584 | } |
1585 | } | |
1586 | ||
1587 | #ifdef PUSH_ARGS_REVERSED | |
1588 | #ifdef STACK_BOUNDARY | |
1589 | /* If we push args individually in reverse order, perform stack alignment | |
1590 | before the first push (the last arg). */ | |
1591 | if (argblock == 0) | |
9e6d0a9a | 1592 | anti_adjust_stack (GEN_INT (args_size.constant |
1593 | - original_args_size.constant)); | |
66d433c7 | 1594 | #endif |
1595 | #endif | |
1596 | ||
1597 | /* Don't try to defer pops if preallocating, not even from the first arg, | |
1598 | since ARGBLOCK probably refers to the SP. */ | |
1599 | if (argblock) | |
1600 | NO_DEFER_POP; | |
1601 | ||
1602 | /* Get the function to call, in the form of RTL. */ | |
1603 | if (fndecl) | |
fded5424 | 1604 | { |
1605 | /* If this is the first use of the function, see if we need to | |
1606 | make an external definition for it. */ | |
1607 | if (! TREE_USED (fndecl)) | |
1608 | { | |
1609 | assemble_external (fndecl); | |
1610 | TREE_USED (fndecl) = 1; | |
1611 | } | |
1612 | ||
1613 | /* Get a SYMBOL_REF rtx for the function address. */ | |
1614 | funexp = XEXP (DECL_RTL (fndecl), 0); | |
1615 | } | |
66d433c7 | 1616 | else |
1617 | /* Generate an rtx (probably a pseudo-register) for the address. */ | |
1618 | { | |
1b117c60 | 1619 | push_temp_slots (); |
9e6d0a9a | 1620 | funexp = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0); |
1b117c60 | 1621 | pop_temp_slots (); /* FUNEXP can't be BLKmode */ |
7cc85421 | 1622 | |
1623 | /* Check the function is executable. */ | |
1624 | if (flag_check_memory_usage) | |
1625 | emit_library_call (chkr_check_exec_libfunc, 1, | |
1626 | VOIDmode, 1, | |
1627 | funexp, ptr_mode); | |
66d433c7 | 1628 | emit_queue (); |
1629 | } | |
1630 | ||
1631 | /* Figure out the register where the value, if any, will come back. */ | |
1632 | valreg = 0; | |
1633 | if (TYPE_MODE (TREE_TYPE (exp)) != VOIDmode | |
1634 | && ! structure_value_addr) | |
1635 | { | |
1636 | if (pcc_struct_value) | |
1637 | valreg = hard_function_value (build_pointer_type (TREE_TYPE (exp)), | |
1638 | fndecl); | |
1639 | else | |
1640 | valreg = hard_function_value (TREE_TYPE (exp), fndecl); | |
1641 | } | |
1642 | ||
1643 | /* Precompute all register parameters. It isn't safe to compute anything | |
a92771b8 | 1644 | once we have started filling any specific hard regs. */ |
66d433c7 | 1645 | reg_parm_seen = 0; |
1646 | for (i = 0; i < num_actuals; i++) | |
1647 | if (args[i].reg != 0 && ! args[i].pass_on_stack) | |
1648 | { | |
1649 | reg_parm_seen = 1; | |
1650 | ||
1651 | if (args[i].value == 0) | |
1652 | { | |
1b117c60 | 1653 | push_temp_slots (); |
9e6d0a9a | 1654 | args[i].value = expand_expr (args[i].tree_value, NULL_RTX, |
1655 | VOIDmode, 0); | |
66d433c7 | 1656 | preserve_temp_slots (args[i].value); |
1b117c60 | 1657 | pop_temp_slots (); |
66d433c7 | 1658 | |
1659 | /* ANSI doesn't require a sequence point here, | |
1660 | but PCC has one, so this will avoid some problems. */ | |
1661 | emit_queue (); | |
1662 | } | |
23eb5fa6 | 1663 | |
1664 | /* If we are to promote the function arg to a wider mode, | |
1665 | do it now. */ | |
23eb5fa6 | 1666 | |
02c088b2 | 1667 | if (args[i].mode != TYPE_MODE (TREE_TYPE (args[i].tree_value))) |
1668 | args[i].value | |
1669 | = convert_modes (args[i].mode, | |
1670 | TYPE_MODE (TREE_TYPE (args[i].tree_value)), | |
1671 | args[i].value, args[i].unsignedp); | |
ba7da555 | 1672 | |
1673 | /* If the value is expensive, and we are inside an appropriately | |
1674 | short loop, put the value into a pseudo and then put the pseudo | |
a89aeae3 | 1675 | into the hard reg. |
1676 | ||
1677 | For small register classes, also do this if this call uses | |
1678 | register parameters. This is to avoid reload conflicts while | |
1679 | loading the parameters registers. */ | |
ba7da555 | 1680 | |
1681 | if ((! (GET_CODE (args[i].value) == REG | |
1682 | || (GET_CODE (args[i].value) == SUBREG | |
1683 | && GET_CODE (SUBREG_REG (args[i].value)) == REG))) | |
1684 | && args[i].mode != BLKmode | |
1685 | && rtx_cost (args[i].value, SET) > 2 | |
2fcd559a | 1686 | && ((SMALL_REGISTER_CLASSES && reg_parm_seen) |
0dbd1c74 | 1687 | || preserve_subexpressions_p ())) |
ba7da555 | 1688 | args[i].value = copy_to_mode_reg (args[i].mode, args[i].value); |
66d433c7 | 1689 | } |
1690 | ||
1691 | #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE) | |
1692 | /* The argument list is the property of the called routine and it | |
1693 | may clobber it. If the fixed area has been used for previous | |
1694 | parameters, we must save and restore it. | |
1695 | ||
1696 | Here we compute the boundary of the that needs to be saved, if any. */ | |
1697 | ||
41332f48 | 1698 | #ifdef ARGS_GROW_DOWNWARD |
1699 | for (i = 0; i < reg_parm_stack_space + 1; i++) | |
1700 | #else | |
2d7187c2 | 1701 | for (i = 0; i < reg_parm_stack_space; i++) |
41332f48 | 1702 | #endif |
66d433c7 | 1703 | { |
1704 | if (i >= highest_outgoing_arg_in_use | |
1705 | || stack_usage_map[i] == 0) | |
1706 | continue; | |
1707 | ||
1708 | if (low_to_save == -1) | |
1709 | low_to_save = i; | |
1710 | ||
1711 | high_to_save = i; | |
1712 | } | |
1713 | ||
1714 | if (low_to_save >= 0) | |
1715 | { | |
1716 | int num_to_save = high_to_save - low_to_save + 1; | |
1717 | enum machine_mode save_mode | |
1718 | = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1); | |
1719 | rtx stack_area; | |
1720 | ||
1721 | /* If we don't have the required alignment, must do this in BLKmode. */ | |
1722 | if ((low_to_save & (MIN (GET_MODE_SIZE (save_mode), | |
1723 | BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1))) | |
1724 | save_mode = BLKmode; | |
1725 | ||
1726 | stack_area = gen_rtx (MEM, save_mode, | |
1727 | memory_address (save_mode, | |
41332f48 | 1728 | |
1729 | #ifdef ARGS_GROW_DOWNWARD | |
1730 | plus_constant (argblock, | |
1731 | - high_to_save) | |
1732 | #else | |
66d433c7 | 1733 | plus_constant (argblock, |
41332f48 | 1734 | low_to_save) |
1735 | #endif | |
1736 | )); | |
66d433c7 | 1737 | if (save_mode == BLKmode) |
1738 | { | |
1eee775e | 1739 | save_area = assign_stack_temp (BLKmode, num_to_save, 0); |
6b08ae80 | 1740 | MEM_IN_STRUCT_P (save_area) = 0; |
66d433c7 | 1741 | emit_block_move (validize_mem (save_area), stack_area, |
9e6d0a9a | 1742 | GEN_INT (num_to_save), |
66d433c7 | 1743 | PARM_BOUNDARY / BITS_PER_UNIT); |
1744 | } | |
1745 | else | |
1746 | { | |
1747 | save_area = gen_reg_rtx (save_mode); | |
1748 | emit_move_insn (save_area, stack_area); | |
1749 | } | |
1750 | } | |
1751 | #endif | |
1752 | ||
1753 | ||
1754 | /* Now store (and compute if necessary) all non-register parms. | |
1755 | These come before register parms, since they can require block-moves, | |
1756 | which could clobber the registers used for register parms. | |
1757 | Parms which have partial registers are not stored here, | |
1758 | but we do preallocate space here if they want that. */ | |
1759 | ||
1760 | for (i = 0; i < num_actuals; i++) | |
1761 | if (args[i].reg == 0 || args[i].pass_on_stack) | |
1762 | store_one_arg (&args[i], argblock, may_be_alloca, | |
2d7187c2 | 1763 | args_size.var != 0, fndecl, reg_parm_stack_space); |
66d433c7 | 1764 | |
f28c7a75 | 1765 | /* If we have a parm that is passed in registers but not in memory |
1766 | and whose alignment does not permit a direct copy into registers, | |
1767 | make a group of pseudos that correspond to each register that we | |
1768 | will later fill. */ | |
1769 | ||
aebed4a1 | 1770 | if (STRICT_ALIGNMENT) |
1771 | for (i = 0; i < num_actuals; i++) | |
1772 | if (args[i].reg != 0 && ! args[i].pass_on_stack | |
f28c7a75 | 1773 | && args[i].mode == BLKmode |
aebed4a1 | 1774 | && (TYPE_ALIGN (TREE_TYPE (args[i].tree_value)) |
1775 | < MIN (BIGGEST_ALIGNMENT, BITS_PER_WORD))) | |
1776 | { | |
1777 | int bytes = int_size_in_bytes (TREE_TYPE (args[i].tree_value)); | |
1778 | int big_endian_correction = 0; | |
f28c7a75 | 1779 | |
aebed4a1 | 1780 | args[i].n_aligned_regs |
1781 | = args[i].partial ? args[i].partial | |
1782 | : (bytes + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD; | |
f28c7a75 | 1783 | |
aebed4a1 | 1784 | args[i].aligned_regs = (rtx *) alloca (sizeof (rtx) |
1785 | * args[i].n_aligned_regs); | |
f28c7a75 | 1786 | |
aebed4a1 | 1787 | /* Structures smaller than a word are aligned to the least |
1788 | significant byte (to the right). On a BYTES_BIG_ENDIAN machine, | |
1789 | this means we must skip the empty high order bytes when | |
1790 | calculating the bit offset. */ | |
1791 | if (BYTES_BIG_ENDIAN && bytes < UNITS_PER_WORD) | |
1792 | big_endian_correction = (BITS_PER_WORD - (bytes * BITS_PER_UNIT)); | |
2f90b8fd | 1793 | |
aebed4a1 | 1794 | for (j = 0; j < args[i].n_aligned_regs; j++) |
1795 | { | |
1796 | rtx reg = gen_reg_rtx (word_mode); | |
1797 | rtx word = operand_subword_force (args[i].value, j, BLKmode); | |
1798 | int bitsize = TYPE_ALIGN (TREE_TYPE (args[i].tree_value)); | |
1799 | int bitpos; | |
1800 | ||
1801 | args[i].aligned_regs[j] = reg; | |
1802 | ||
1803 | /* Clobber REG and move each partword into it. Ensure we don't | |
1804 | go past the end of the structure. Note that the loop below | |
1805 | works because we've already verified that padding | |
188c68d9 | 1806 | and endianness are compatible. |
aebed4a1 | 1807 | |
188c68d9 | 1808 | We use to emit a clobber here but that doesn't let later |
1809 | passes optimize the instructions we emit. By storing 0 into | |
1810 | the register later passes know the first AND to zero out the | |
1811 | bitfield being set in the register is unnecessary. The store | |
1812 | of 0 will be deleted as will at least the first AND. */ | |
1813 | ||
1814 | emit_move_insn (reg, const0_rtx); | |
aebed4a1 | 1815 | |
1816 | for (bitpos = 0; | |
1817 | bitpos < BITS_PER_WORD && bytes > 0; | |
1818 | bitpos += bitsize, bytes -= bitsize / BITS_PER_UNIT) | |
1819 | { | |
1820 | int xbitpos = bitpos + big_endian_correction; | |
1821 | ||
1822 | store_bit_field (reg, bitsize, xbitpos, word_mode, | |
1823 | extract_bit_field (word, bitsize, bitpos, 1, | |
1824 | NULL_RTX, word_mode, | |
1825 | word_mode, | |
1826 | bitsize / BITS_PER_UNIT, | |
1827 | BITS_PER_WORD), | |
1828 | bitsize / BITS_PER_UNIT, BITS_PER_WORD); | |
1829 | } | |
1830 | } | |
1831 | } | |
f28c7a75 | 1832 | |
66d433c7 | 1833 | /* Now store any partially-in-registers parm. |
1834 | This is the last place a block-move can happen. */ | |
1835 | if (reg_parm_seen) | |
1836 | for (i = 0; i < num_actuals; i++) | |
1837 | if (args[i].partial != 0 && ! args[i].pass_on_stack) | |
1838 | store_one_arg (&args[i], argblock, may_be_alloca, | |
2d7187c2 | 1839 | args_size.var != 0, fndecl, reg_parm_stack_space); |
66d433c7 | 1840 | |
1841 | #ifndef PUSH_ARGS_REVERSED | |
1842 | #ifdef STACK_BOUNDARY | |
1843 | /* If we pushed args in forward order, perform stack alignment | |
1844 | after pushing the last arg. */ | |
1845 | if (argblock == 0) | |
9e6d0a9a | 1846 | anti_adjust_stack (GEN_INT (args_size.constant |
1847 | - original_args_size.constant)); | |
66d433c7 | 1848 | #endif |
1849 | #endif | |
1850 | ||
985adbca | 1851 | /* If register arguments require space on the stack and stack space |
1852 | was not preallocated, allocate stack space here for arguments | |
1853 | passed in registers. */ | |
851bd044 | 1854 | #if ! defined(ACCUMULATE_OUTGOING_ARGS) && defined(OUTGOING_REG_PARM_STACK_SPACE) |
985adbca | 1855 | if (must_preallocate == 0 && reg_parm_stack_space > 0) |
9e6d0a9a | 1856 | anti_adjust_stack (GEN_INT (reg_parm_stack_space)); |
985adbca | 1857 | #endif |
1858 | ||
66d433c7 | 1859 | /* Pass the function the address in which to return a structure value. */ |
1860 | if (structure_value_addr && ! structure_value_addr_parm) | |
1861 | { | |
1862 | emit_move_insn (struct_value_rtx, | |
1863 | force_reg (Pmode, | |
9e6d0a9a | 1864 | force_operand (structure_value_addr, |
1865 | NULL_RTX))); | |
7cc85421 | 1866 | |
1867 | /* Mark the memory for the aggregate as write-only. */ | |
1868 | if (flag_check_memory_usage) | |
1869 | emit_library_call (chkr_set_right_libfunc, 1, | |
1870 | VOIDmode, 3, | |
1871 | structure_value_addr, ptr_mode, | |
1872 | GEN_INT (struct_value_size), TYPE_MODE (sizetype), | |
ad87de1e | 1873 | GEN_INT (MEMORY_USE_WO), |
1874 | TYPE_MODE (integer_type_node)); | |
7cc85421 | 1875 | |
66d433c7 | 1876 | if (GET_CODE (struct_value_rtx) == REG) |
8866f42d | 1877 | use_reg (&call_fusage, struct_value_rtx); |
66d433c7 | 1878 | } |
1879 | ||
8866f42d | 1880 | funexp = prepare_call_address (funexp, fndecl, &call_fusage, reg_parm_seen); |
cce3ca0a | 1881 | |
66d433c7 | 1882 | /* Now do the register loads required for any wholly-register parms or any |
1883 | parms which are passed both on the stack and in a register. Their | |
1884 | expressions were already evaluated. | |
1885 | ||
1886 | Mark all register-parms as living through the call, putting these USE | |
8866f42d | 1887 | insns in the CALL_INSN_FUNCTION_USAGE field. */ |
66d433c7 | 1888 | |
562c48ae | 1889 | #ifdef LOAD_ARGS_REVERSED |
1890 | for (i = num_actuals - 1; i >= 0; i--) | |
1891 | #else | |
66d433c7 | 1892 | for (i = 0; i < num_actuals; i++) |
562c48ae | 1893 | #endif |
66d433c7 | 1894 | { |
566d850a | 1895 | rtx reg = args[i].reg; |
66d433c7 | 1896 | int partial = args[i].partial; |
566d850a | 1897 | int nregs; |
66d433c7 | 1898 | |
566d850a | 1899 | if (reg) |
66d433c7 | 1900 | { |
d95fedab | 1901 | /* Set to non-negative if must move a word at a time, even if just |
1902 | one word (e.g, partial == 1 && mode == DFmode). Set to -1 if | |
1903 | we just use a normal move insn. This value can be zero if the | |
1904 | argument is a zero size structure with no fields. */ | |
66d433c7 | 1905 | nregs = (partial ? partial |
1906 | : (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode | |
d95fedab | 1907 | ? ((int_size_in_bytes (TREE_TYPE (args[i].tree_value)) |
1908 | + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD) | |
1909 | : -1)); | |
66d433c7 | 1910 | |
566d850a | 1911 | /* Handle calls that pass values in multiple non-contiguous |
1912 | locations. The Irix 6 ABI has examples of this. */ | |
1913 | ||
1914 | if (GET_CODE (reg) == PARALLEL) | |
1915 | emit_group_load (reg, args[i].value); | |
1916 | ||
66d433c7 | 1917 | /* If simple case, just do move. If normal partial, store_one_arg |
1918 | has already loaded the register for us. In all other cases, | |
1919 | load the register(s) from memory. */ | |
1920 | ||
566d850a | 1921 | else if (nregs == -1) |
66d433c7 | 1922 | emit_move_insn (reg, args[i].value); |
f28c7a75 | 1923 | |
f28c7a75 | 1924 | /* If we have pre-computed the values to put in the registers in |
1925 | the case of non-aligned structures, copy them in now. */ | |
1926 | ||
1927 | else if (args[i].n_aligned_regs != 0) | |
1928 | for (j = 0; j < args[i].n_aligned_regs; j++) | |
1929 | emit_move_insn (gen_rtx (REG, word_mode, REGNO (reg) + j), | |
1930 | args[i].aligned_regs[j]); | |
f28c7a75 | 1931 | |
566d850a | 1932 | else if (partial == 0 || args[i].pass_on_stack) |
d95fedab | 1933 | move_block_to_reg (REGNO (reg), |
1934 | validize_mem (args[i].value), nregs, | |
1935 | args[i].mode); | |
f2799de7 | 1936 | |
566d850a | 1937 | /* Handle calls that pass values in multiple non-contiguous |
1938 | locations. The Irix 6 ABI has examples of this. */ | |
1939 | if (GET_CODE (reg) == PARALLEL) | |
1940 | use_group_regs (&call_fusage, reg); | |
1941 | else if (nregs == -1) | |
f2799de7 | 1942 | use_reg (&call_fusage, reg); |
1943 | else | |
1944 | use_regs (&call_fusage, REGNO (reg), nregs == 0 ? 1 : nregs); | |
66d433c7 | 1945 | } |
1946 | } | |
1947 | ||
1948 | /* Perform postincrements before actually calling the function. */ | |
1949 | emit_queue (); | |
1950 | ||
1951 | /* All arguments and registers used for the call must be set up by now! */ | |
1952 | ||
66d433c7 | 1953 | /* Generate the actual call instruction. */ |
e93a4612 | 1954 | emit_call_1 (funexp, fndecl, funtype, args_size.constant, struct_value_size, |
66d433c7 | 1955 | FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1), |
8866f42d | 1956 | valreg, old_inhibit_defer_pop, call_fusage, is_const); |
66d433c7 | 1957 | |
1958 | /* If call is cse'able, make appropriate pair of reg-notes around it. | |
1959 | Test valreg so we don't crash; may safely ignore `const' | |
ab9ade9f | 1960 | if return type is void. Disable for PARALLEL return values, because |
1961 | we have no way to move such values into a pseudo register. */ | |
1962 | if (is_const && valreg != 0 && GET_CODE (valreg) != PARALLEL) | |
66d433c7 | 1963 | { |
1964 | rtx note = 0; | |
1965 | rtx temp = gen_reg_rtx (GET_MODE (valreg)); | |
1966 | rtx insns; | |
1967 | ||
ea0cb7ae | 1968 | /* Mark the return value as a pointer if needed. */ |
1969 | if (TREE_CODE (TREE_TYPE (exp)) == POINTER_TYPE) | |
1970 | { | |
1971 | tree pointed_to = TREE_TYPE (TREE_TYPE (exp)); | |
1972 | mark_reg_pointer (temp, TYPE_ALIGN (pointed_to) / BITS_PER_UNIT); | |
1973 | } | |
1974 | ||
66d433c7 | 1975 | /* Construct an "equal form" for the value which mentions all the |
1976 | arguments in order as well as the function name. */ | |
1977 | #ifdef PUSH_ARGS_REVERSED | |
1978 | for (i = 0; i < num_actuals; i++) | |
1979 | note = gen_rtx (EXPR_LIST, VOIDmode, args[i].initial_value, note); | |
1980 | #else | |
1981 | for (i = num_actuals - 1; i >= 0; i--) | |
1982 | note = gen_rtx (EXPR_LIST, VOIDmode, args[i].initial_value, note); | |
1983 | #endif | |
1984 | note = gen_rtx (EXPR_LIST, VOIDmode, funexp, note); | |
1985 | ||
1986 | insns = get_insns (); | |
1987 | end_sequence (); | |
1988 | ||
1989 | emit_libcall_block (insns, temp, valreg, note); | |
1990 | ||
1991 | valreg = temp; | |
1992 | } | |
541d8ad5 | 1993 | else if (is_const) |
1994 | { | |
1995 | /* Otherwise, just write out the sequence without a note. */ | |
1996 | rtx insns = get_insns (); | |
1997 | ||
1998 | end_sequence (); | |
1999 | emit_insns (insns); | |
2000 | } | |
ea0cb7ae | 2001 | else if (is_malloc) |
2002 | { | |
2003 | rtx temp = gen_reg_rtx (GET_MODE (valreg)); | |
2004 | rtx last, insns; | |
2005 | ||
2006 | /* The return value from a malloc-like function is a pointer. */ | |
2007 | if (TREE_CODE (TREE_TYPE (exp)) == POINTER_TYPE) | |
2008 | mark_reg_pointer (temp, BIGGEST_ALIGNMENT / BITS_PER_UNIT); | |
2009 | ||
2010 | emit_move_insn (temp, valreg); | |
2011 | ||
2012 | /* The return value from a malloc-like function can not alias | |
2013 | anything else. */ | |
2014 | last = get_last_insn (); | |
2015 | REG_NOTES (last) = | |
2016 | gen_rtx (EXPR_LIST, REG_NOALIAS, temp, REG_NOTES (last)); | |
2017 | ||
2018 | /* Write out the sequence. */ | |
2019 | insns = get_insns (); | |
2020 | end_sequence (); | |
2021 | emit_insns (insns); | |
2022 | valreg = temp; | |
2023 | } | |
66d433c7 | 2024 | |
2025 | /* For calls to `setjmp', etc., inform flow.c it should complain | |
2026 | if nonvolatile values are live. */ | |
2027 | ||
2028 | if (returns_twice) | |
2029 | { | |
2030 | emit_note (name, NOTE_INSN_SETJMP); | |
2031 | current_function_calls_setjmp = 1; | |
2032 | } | |
2033 | ||
2034 | if (is_longjmp) | |
2035 | current_function_calls_longjmp = 1; | |
2036 | ||
2037 | /* Notice functions that cannot return. | |
2038 | If optimizing, insns emitted below will be dead. | |
2039 | If not optimizing, they will exist, which is useful | |
2040 | if the user uses the `return' command in the debugger. */ | |
2041 | ||
2042 | if (is_volatile || is_longjmp) | |
2043 | emit_barrier (); | |
2044 | ||
66d433c7 | 2045 | /* If value type not void, return an rtx for the value. */ |
2046 | ||
694ec519 | 2047 | /* If there are cleanups to be called, don't use a hard reg as target. |
2048 | We need to double check this and see if it matters anymore. */ | |
0dbd1c74 | 2049 | if (any_pending_cleanups (1) |
66d433c7 | 2050 | && target && REG_P (target) |
2051 | && REGNO (target) < FIRST_PSEUDO_REGISTER) | |
2052 | target = 0; | |
2053 | ||
2054 | if (TYPE_MODE (TREE_TYPE (exp)) == VOIDmode | |
2055 | || ignore) | |
2056 | { | |
2057 | target = const0_rtx; | |
2058 | } | |
2059 | else if (structure_value_addr) | |
2060 | { | |
2061 | if (target == 0 || GET_CODE (target) != MEM) | |
d8946bc9 | 2062 | { |
2063 | target = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)), | |
2064 | memory_address (TYPE_MODE (TREE_TYPE (exp)), | |
2065 | structure_value_addr)); | |
727a13df | 2066 | MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp)); |
d8946bc9 | 2067 | } |
66d433c7 | 2068 | } |
2069 | else if (pcc_struct_value) | |
2070 | { | |
a4e41de7 | 2071 | /* This is the special C++ case where we need to |
2072 | know what the true target was. We take care to | |
2073 | never use this value more than once in one expression. */ | |
2074 | target = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)), | |
2075 | copy_to_reg (valreg)); | |
2076 | MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp)); | |
66d433c7 | 2077 | } |
566d850a | 2078 | /* Handle calls that return values in multiple non-contiguous locations. |
2079 | The Irix 6 ABI has examples of this. */ | |
2080 | else if (GET_CODE (valreg) == PARALLEL) | |
2081 | { | |
2082 | if (target == 0) | |
2083 | { | |
2084 | int bytes = int_size_in_bytes (TREE_TYPE (exp)); | |
84d3a654 | 2085 | target = assign_stack_temp (TYPE_MODE (TREE_TYPE (exp)), bytes, 0); |
566d850a | 2086 | MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp)); |
2087 | preserve_temp_slots (target); | |
2088 | } | |
2089 | ||
2090 | emit_group_store (target, valreg); | |
2091 | } | |
d9b35ed0 | 2092 | else if (target && GET_MODE (target) == TYPE_MODE (TREE_TYPE (exp)) |
2093 | && GET_MODE (target) == GET_MODE (valreg)) | |
2094 | /* TARGET and VALREG cannot be equal at this point because the latter | |
2095 | would not have REG_FUNCTION_VALUE_P true, while the former would if | |
2096 | it were referring to the same register. | |
2097 | ||
2098 | If they refer to the same register, this move will be a no-op, except | |
2099 | when function inlining is being done. */ | |
2100 | emit_move_insn (target, valreg); | |
cf138b43 | 2101 | else if (TYPE_MODE (TREE_TYPE (exp)) == BLKmode) |
2102 | { | |
2103 | /* Some machines (the PA for example) want to return all small | |
2104 | structures in registers regardless of the structure's alignment. | |
2105 | ||
2106 | Deal with them explicitly by copying from the return registers | |
2107 | into the target MEM locations. */ | |
2108 | int bytes = int_size_in_bytes (TREE_TYPE (exp)); | |
2109 | int n_regs = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD; | |
2110 | int i; | |
2111 | enum machine_mode tmpmode; | |
5734f76e | 2112 | rtx src, dst; |
2113 | int bitsize = MIN (TYPE_ALIGN (TREE_TYPE (exp)), BITS_PER_WORD); | |
2114 | int bitpos, xbitpos, big_endian_correction = 0; | |
cf138b43 | 2115 | |
2116 | if (target == 0) | |
2c4f9c67 | 2117 | { |
2118 | target = assign_stack_temp (BLKmode, bytes, 0); | |
2119 | MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp)); | |
2120 | preserve_temp_slots (target); | |
2121 | } | |
cf138b43 | 2122 | |
13f7a1e9 | 2123 | /* This code assumes valreg is at least a full word. If it isn't, |
2124 | copy it into a new pseudo which is a full word. */ | |
2125 | if (GET_MODE (valreg) != BLKmode | |
2126 | && GET_MODE_SIZE (GET_MODE (valreg)) < UNITS_PER_WORD) | |
18b08930 | 2127 | valreg = convert_to_mode (word_mode, valreg, |
13f7a1e9 | 2128 | TREE_UNSIGNED (TREE_TYPE (exp))); |
2129 | ||
5734f76e | 2130 | /* Structures whose size is not a multiple of a word are aligned |
2131 | to the least significant byte (to the right). On a BYTES_BIG_ENDIAN | |
2132 | machine, this means we must skip the empty high order bytes when | |
2133 | calculating the bit offset. */ | |
2134 | if (BYTES_BIG_ENDIAN && bytes % UNITS_PER_WORD) | |
2135 | big_endian_correction = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) | |
2136 | * BITS_PER_UNIT)); | |
2137 | ||
2138 | /* Copy the structure BITSIZE bites at a time. | |
2139 | ||
2140 | We could probably emit more efficient code for machines | |
cf138b43 | 2141 | which do not use strict alignment, but it doesn't seem |
2142 | worth the effort at the current time. */ | |
5734f76e | 2143 | for (bitpos = 0, xbitpos = big_endian_correction; |
2144 | bitpos < bytes * BITS_PER_UNIT; | |
2145 | bitpos += bitsize, xbitpos += bitsize) | |
cf138b43 | 2146 | { |
5734f76e | 2147 | |
2148 | /* We need a new source operand each time xbitpos is on a | |
2149 | word boundary and when xbitpos == big_endian_correction | |
2150 | (the first time through). */ | |
2151 | if (xbitpos % BITS_PER_WORD == 0 | |
2152 | || xbitpos == big_endian_correction) | |
2153 | src = operand_subword_force (valreg, | |
2154 | xbitpos / BITS_PER_WORD, | |
2155 | BLKmode); | |
2156 | ||
2157 | /* We need a new destination operand each time bitpos is on | |
2158 | a word boundary. */ | |
2159 | if (bitpos % BITS_PER_WORD == 0) | |
2160 | dst = operand_subword (target, bitpos / BITS_PER_WORD, 1, BLKmode); | |
cf138b43 | 2161 | |
5734f76e | 2162 | /* Use xbitpos for the source extraction (right justified) and |
2163 | xbitpos for the destination store (left justified). */ | |
2164 | store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, word_mode, | |
2165 | extract_bit_field (src, bitsize, | |
2166 | xbitpos % BITS_PER_WORD, 1, | |
2167 | NULL_RTX, word_mode, | |
2168 | word_mode, | |
2169 | bitsize / BITS_PER_UNIT, | |
2170 | BITS_PER_WORD), | |
2171 | bitsize / BITS_PER_UNIT, BITS_PER_WORD); | |
cf138b43 | 2172 | } |
2173 | } | |
66d433c7 | 2174 | else |
2175 | target = copy_to_reg (valreg); | |
2176 | ||
23eb5fa6 | 2177 | #ifdef PROMOTE_FUNCTION_RETURN |
199bbafe | 2178 | /* If we promoted this return value, make the proper SUBREG. TARGET |
2179 | might be const0_rtx here, so be careful. */ | |
2180 | if (GET_CODE (target) == REG | |
cf138b43 | 2181 | && TYPE_MODE (TREE_TYPE (exp)) != BLKmode |
199bbafe | 2182 | && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp))) |
23eb5fa6 | 2183 | { |
bbc8e3c2 | 2184 | tree type = TREE_TYPE (exp); |
2185 | int unsignedp = TREE_UNSIGNED (type); | |
23eb5fa6 | 2186 | |
bbc8e3c2 | 2187 | /* If we don't promote as expected, something is wrong. */ |
2188 | if (GET_MODE (target) | |
2189 | != promote_mode (type, TYPE_MODE (type), &unsignedp, 1)) | |
199bbafe | 2190 | abort (); |
2191 | ||
bbc8e3c2 | 2192 | target = gen_rtx (SUBREG, TYPE_MODE (type), target, 0); |
23eb5fa6 | 2193 | SUBREG_PROMOTED_VAR_P (target) = 1; |
2194 | SUBREG_PROMOTED_UNSIGNED_P (target) = unsignedp; | |
2195 | } | |
2196 | #endif | |
2197 | ||
d1b03b62 | 2198 | /* If size of args is variable or this was a constructor call for a stack |
2199 | argument, restore saved stack-pointer value. */ | |
66d433c7 | 2200 | |
2201 | if (old_stack_level) | |
2202 | { | |
9e6d0a9a | 2203 | emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX); |
66d433c7 | 2204 | pending_stack_adjust = old_pending_adj; |
f848041f | 2205 | #ifdef ACCUMULATE_OUTGOING_ARGS |
d1b03b62 | 2206 | stack_arg_under_construction = old_stack_arg_under_construction; |
2207 | highest_outgoing_arg_in_use = initial_highest_arg_in_use; | |
2208 | stack_usage_map = initial_stack_usage_map; | |
f848041f | 2209 | #endif |
66d433c7 | 2210 | } |
66d433c7 | 2211 | #ifdef ACCUMULATE_OUTGOING_ARGS |
2212 | else | |
2213 | { | |
2214 | #ifdef REG_PARM_STACK_SPACE | |
2215 | if (save_area) | |
2216 | { | |
2217 | enum machine_mode save_mode = GET_MODE (save_area); | |
2218 | rtx stack_area | |
2219 | = gen_rtx (MEM, save_mode, | |
2220 | memory_address (save_mode, | |
41332f48 | 2221 | #ifdef ARGS_GROW_DOWNWARD |
2222 | plus_constant (argblock, - high_to_save) | |
2223 | #else | |
2224 | plus_constant (argblock, low_to_save) | |
2225 | #endif | |
2226 | )); | |
66d433c7 | 2227 | |
2228 | if (save_mode != BLKmode) | |
2229 | emit_move_insn (stack_area, save_area); | |
2230 | else | |
2231 | emit_block_move (stack_area, validize_mem (save_area), | |
9e6d0a9a | 2232 | GEN_INT (high_to_save - low_to_save + 1), |
2233 | PARM_BOUNDARY / BITS_PER_UNIT); | |
66d433c7 | 2234 | } |
2235 | #endif | |
2236 | ||
2237 | /* If we saved any argument areas, restore them. */ | |
2238 | for (i = 0; i < num_actuals; i++) | |
2239 | if (args[i].save_area) | |
2240 | { | |
2241 | enum machine_mode save_mode = GET_MODE (args[i].save_area); | |
2242 | rtx stack_area | |
2243 | = gen_rtx (MEM, save_mode, | |
2244 | memory_address (save_mode, | |
2245 | XEXP (args[i].stack_slot, 0))); | |
2246 | ||
2247 | if (save_mode != BLKmode) | |
2248 | emit_move_insn (stack_area, args[i].save_area); | |
2249 | else | |
2250 | emit_block_move (stack_area, validize_mem (args[i].save_area), | |
9e6d0a9a | 2251 | GEN_INT (args[i].size.constant), |
66d433c7 | 2252 | PARM_BOUNDARY / BITS_PER_UNIT); |
2253 | } | |
2254 | ||
2255 | highest_outgoing_arg_in_use = initial_highest_arg_in_use; | |
2256 | stack_usage_map = initial_stack_usage_map; | |
2257 | } | |
2258 | #endif | |
2259 | ||
dbd6697a | 2260 | /* If this was alloca, record the new stack level for nonlocal gotos. |
2261 | Check for the handler slots since we might not have a save area | |
a92771b8 | 2262 | for non-local gotos. */ |
dbd6697a | 2263 | |
2264 | if (may_be_alloca && nonlocal_goto_handler_slot != 0) | |
9e6d0a9a | 2265 | emit_stack_save (SAVE_NONLOCAL, &nonlocal_goto_stack_level, NULL_RTX); |
66d433c7 | 2266 | |
2267 | pop_temp_slots (); | |
2268 | ||
2269 | return target; | |
2270 | } | |
2271 | \f | |
8ddf1c7e | 2272 | /* Output a library call to function FUN (a SYMBOL_REF rtx) |
2273 | (emitting the queue unless NO_QUEUE is nonzero), | |
2274 | for a value of mode OUTMODE, | |
2275 | with NARGS different arguments, passed as alternating rtx values | |
2276 | and machine_modes to convert them to. | |
2277 | The rtx values should have been passed through protect_from_queue already. | |
2278 | ||
2279 | NO_QUEUE will be true if and only if the library call is a `const' call | |
2280 | which will be enclosed in REG_LIBCALL/REG_RETVAL notes; it is equivalent | |
2281 | to the variable is_const in expand_call. | |
2282 | ||
2283 | NO_QUEUE must be true for const calls, because if it isn't, then | |
2284 | any pending increment will be emitted between REG_LIBCALL/REG_RETVAL notes, | |
2285 | and will be lost if the libcall sequence is optimized away. | |
2286 | ||
2287 | NO_QUEUE must be false for non-const calls, because if it isn't, the | |
2288 | call insn will have its CONST_CALL_P bit set, and it will be incorrectly | |
2289 | optimized. For instance, the instruction scheduler may incorrectly | |
2290 | move memory references across the non-const call. */ | |
2291 | ||
2292 | void | |
e5fcd76a | 2293 | emit_library_call VPROTO((rtx orgfun, int no_queue, enum machine_mode outmode, |
2294 | int nargs, ...)) | |
8ddf1c7e | 2295 | { |
e5fcd76a | 2296 | #ifndef __STDC__ |
2297 | rtx orgfun; | |
2298 | int no_queue; | |
2299 | enum machine_mode outmode; | |
2300 | int nargs; | |
2301 | #endif | |
8ddf1c7e | 2302 | va_list p; |
2303 | /* Total size in bytes of all the stack-parms scanned so far. */ | |
2304 | struct args_size args_size; | |
2305 | /* Size of arguments before any adjustments (such as rounding). */ | |
2306 | struct args_size original_args_size; | |
2307 | register int argnum; | |
8ddf1c7e | 2308 | rtx fun; |
8ddf1c7e | 2309 | int inc; |
2310 | int count; | |
2311 | rtx argblock = 0; | |
2312 | CUMULATIVE_ARGS args_so_far; | |
2313 | struct arg { rtx value; enum machine_mode mode; rtx reg; int partial; | |
d3c451dd | 2314 | struct args_size offset; struct args_size size; rtx save_area; }; |
8ddf1c7e | 2315 | struct arg *argvec; |
2316 | int old_inhibit_defer_pop = inhibit_defer_pop; | |
8866f42d | 2317 | rtx call_fusage = 0; |
d3c451dd | 2318 | /* Size of the stack reserved for parameter registers. */ |
2319 | int reg_parm_stack_space = 0; | |
2320 | #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE) | |
2321 | /* Define the boundary of the register parm stack space that needs to be | |
2322 | save, if any. */ | |
2323 | int low_to_save = -1, high_to_save; | |
2324 | rtx save_area = 0; /* Place that it is saved */ | |
2325 | #endif | |
2326 | ||
2327 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
2328 | int initial_highest_arg_in_use = highest_outgoing_arg_in_use; | |
2329 | char *initial_stack_usage_map = stack_usage_map; | |
2330 | int needed; | |
2331 | #endif | |
2332 | ||
2333 | #ifdef REG_PARM_STACK_SPACE | |
2334 | #ifdef MAYBE_REG_PARM_STACK_SPACE | |
2335 | reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE; | |
2336 | #else | |
2337 | reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl); | |
2338 | #endif | |
2339 | #endif | |
8ddf1c7e | 2340 | |
e5fcd76a | 2341 | VA_START (p, nargs); |
2342 | ||
2343 | #ifndef __STDC__ | |
2344 | orgfun = va_arg (p, rtx); | |
8ddf1c7e | 2345 | no_queue = va_arg (p, int); |
2346 | outmode = va_arg (p, enum machine_mode); | |
2347 | nargs = va_arg (p, int); | |
e5fcd76a | 2348 | #endif |
2349 | ||
2350 | fun = orgfun; | |
8ddf1c7e | 2351 | |
2352 | /* Copy all the libcall-arguments out of the varargs data | |
2353 | and into a vector ARGVEC. | |
2354 | ||
2355 | Compute how to pass each argument. We only support a very small subset | |
2356 | of the full argument passing conventions to limit complexity here since | |
2357 | library functions shouldn't have many args. */ | |
2358 | ||
2359 | argvec = (struct arg *) alloca (nargs * sizeof (struct arg)); | |
d3c451dd | 2360 | bzero ((char *) argvec, nargs * sizeof (struct arg)); |
2361 | ||
8ddf1c7e | 2362 | |
412321ce | 2363 | INIT_CUMULATIVE_ARGS (args_so_far, NULL_TREE, fun, 0); |
8ddf1c7e | 2364 | |
2365 | args_size.constant = 0; | |
2366 | args_size.var = 0; | |
2367 | ||
ad47e56a | 2368 | push_temp_slots (); |
2369 | ||
8ddf1c7e | 2370 | for (count = 0; count < nargs; count++) |
2371 | { | |
2372 | rtx val = va_arg (p, rtx); | |
2373 | enum machine_mode mode = va_arg (p, enum machine_mode); | |
2374 | ||
2375 | /* We cannot convert the arg value to the mode the library wants here; | |
2376 | must do it earlier where we know the signedness of the arg. */ | |
2377 | if (mode == BLKmode | |
2378 | || (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode)) | |
2379 | abort (); | |
2380 | ||
2381 | /* On some machines, there's no way to pass a float to a library fcn. | |
2382 | Pass it as a double instead. */ | |
2383 | #ifdef LIBGCC_NEEDS_DOUBLE | |
2384 | if (LIBGCC_NEEDS_DOUBLE && mode == SFmode) | |
1560ef8f | 2385 | val = convert_modes (DFmode, SFmode, val, 0), mode = DFmode; |
8ddf1c7e | 2386 | #endif |
2387 | ||
2388 | /* There's no need to call protect_from_queue, because | |
2389 | either emit_move_insn or emit_push_insn will do that. */ | |
2390 | ||
2391 | /* Make sure it is a reasonable operand for a move or push insn. */ | |
2392 | if (GET_CODE (val) != REG && GET_CODE (val) != MEM | |
2393 | && ! (CONSTANT_P (val) && LEGITIMATE_CONSTANT_P (val))) | |
2394 | val = force_operand (val, NULL_RTX); | |
2395 | ||
8ddf1c7e | 2396 | #ifdef FUNCTION_ARG_PASS_BY_REFERENCE |
2397 | if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, mode, NULL_TREE, 1)) | |
ad47e56a | 2398 | { |
8878c71f | 2399 | /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can |
2400 | be viewed as just an efficiency improvement. */ | |
ad47e56a | 2401 | rtx slot = assign_stack_temp (mode, GET_MODE_SIZE (mode), 0); |
2402 | emit_move_insn (slot, val); | |
b93c0905 | 2403 | val = force_operand (XEXP (slot, 0), NULL_RTX); |
8878c71f | 2404 | mode = Pmode; |
ad47e56a | 2405 | } |
8ddf1c7e | 2406 | #endif |
2407 | ||
ad47e56a | 2408 | argvec[count].value = val; |
2409 | argvec[count].mode = mode; | |
2410 | ||
8ddf1c7e | 2411 | argvec[count].reg = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1); |
566d850a | 2412 | if (argvec[count].reg && GET_CODE (argvec[count].reg) == PARALLEL) |
8ddf1c7e | 2413 | abort (); |
2414 | #ifdef FUNCTION_ARG_PARTIAL_NREGS | |
2415 | argvec[count].partial | |
2416 | = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, NULL_TREE, 1); | |
2417 | #else | |
2418 | argvec[count].partial = 0; | |
2419 | #endif | |
2420 | ||
2421 | locate_and_pad_parm (mode, NULL_TREE, | |
2422 | argvec[count].reg && argvec[count].partial == 0, | |
2423 | NULL_TREE, &args_size, &argvec[count].offset, | |
2424 | &argvec[count].size); | |
2425 | ||
2426 | if (argvec[count].size.var) | |
2427 | abort (); | |
2428 | ||
2429 | #ifndef REG_PARM_STACK_SPACE | |
2430 | if (argvec[count].partial) | |
2431 | argvec[count].size.constant -= argvec[count].partial * UNITS_PER_WORD; | |
2432 | #endif | |
2433 | ||
2434 | if (argvec[count].reg == 0 || argvec[count].partial != 0 | |
2435 | #ifdef REG_PARM_STACK_SPACE | |
2436 | || 1 | |
2437 | #endif | |
2438 | ) | |
2439 | args_size.constant += argvec[count].size.constant; | |
2440 | ||
a92771b8 | 2441 | FUNCTION_ARG_ADVANCE (args_so_far, mode, (tree) 0, 1); |
8ddf1c7e | 2442 | } |
2443 | va_end (p); | |
2444 | ||
d3c451dd | 2445 | #ifdef FINAL_REG_PARM_STACK_SPACE |
2446 | reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant, | |
2447 | args_size.var); | |
2448 | #endif | |
2449 | ||
8ddf1c7e | 2450 | /* If this machine requires an external definition for library |
2451 | functions, write one out. */ | |
2452 | assemble_external_libcall (fun); | |
2453 | ||
2454 | original_args_size = args_size; | |
2455 | #ifdef STACK_BOUNDARY | |
2456 | args_size.constant = (((args_size.constant + (STACK_BYTES - 1)) | |
2457 | / STACK_BYTES) * STACK_BYTES); | |
2458 | #endif | |
2459 | ||
2460 | #ifdef REG_PARM_STACK_SPACE | |
2461 | args_size.constant = MAX (args_size.constant, | |
d3c451dd | 2462 | reg_parm_stack_space); |
8ddf1c7e | 2463 | #ifndef OUTGOING_REG_PARM_STACK_SPACE |
d3c451dd | 2464 | args_size.constant -= reg_parm_stack_space; |
8ddf1c7e | 2465 | #endif |
2466 | #endif | |
2467 | ||
8ddf1c7e | 2468 | if (args_size.constant > current_function_outgoing_args_size) |
2469 | current_function_outgoing_args_size = args_size.constant; | |
7221f864 | 2470 | |
2471 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
d3c451dd | 2472 | /* Since the stack pointer will never be pushed, it is possible for |
2473 | the evaluation of a parm to clobber something we have already | |
2474 | written to the stack. Since most function calls on RISC machines | |
2475 | do not use the stack, this is uncommon, but must work correctly. | |
2476 | ||
2477 | Therefore, we save any area of the stack that was already written | |
2478 | and that we are using. Here we set up to do this by making a new | |
2479 | stack usage map from the old one. | |
2480 | ||
2481 | Another approach might be to try to reorder the argument | |
2482 | evaluations to avoid this conflicting stack usage. */ | |
2483 | ||
2484 | needed = args_size.constant; | |
2485 | #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE) | |
2486 | /* Since we will be writing into the entire argument area, the | |
2487 | map must be allocated for its entire size, not just the part that | |
2488 | is the responsibility of the caller. */ | |
2489 | needed += reg_parm_stack_space; | |
2490 | #endif | |
2491 | ||
2492 | #ifdef ARGS_GROW_DOWNWARD | |
2493 | highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use, | |
2494 | needed + 1); | |
2495 | #else | |
2496 | highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use, | |
2497 | needed); | |
8ddf1c7e | 2498 | #endif |
d3c451dd | 2499 | stack_usage_map = (char *) alloca (highest_outgoing_arg_in_use); |
2500 | ||
2501 | if (initial_highest_arg_in_use) | |
2502 | bcopy (initial_stack_usage_map, stack_usage_map, | |
2503 | initial_highest_arg_in_use); | |
2504 | ||
2505 | if (initial_highest_arg_in_use != highest_outgoing_arg_in_use) | |
2506 | bzero (&stack_usage_map[initial_highest_arg_in_use], | |
2507 | highest_outgoing_arg_in_use - initial_highest_arg_in_use); | |
2508 | needed = 0; | |
8ddf1c7e | 2509 | |
d3c451dd | 2510 | /* The address of the outgoing argument list must not be copied to a |
2511 | register here, because argblock would be left pointing to the | |
2512 | wrong place after the call to allocate_dynamic_stack_space below. | |
2513 | */ | |
2514 | ||
2515 | argblock = virtual_outgoing_args_rtx; | |
2516 | #else /* not ACCUMULATE_OUTGOING_ARGS */ | |
8ddf1c7e | 2517 | #ifndef PUSH_ROUNDING |
2518 | argblock = push_block (GEN_INT (args_size.constant), 0, 0); | |
2519 | #endif | |
d3c451dd | 2520 | #endif |
8ddf1c7e | 2521 | |
2522 | #ifdef PUSH_ARGS_REVERSED | |
2523 | #ifdef STACK_BOUNDARY | |
2524 | /* If we push args individually in reverse order, perform stack alignment | |
2525 | before the first push (the last arg). */ | |
2526 | if (argblock == 0) | |
2527 | anti_adjust_stack (GEN_INT (args_size.constant | |
2528 | - original_args_size.constant)); | |
2529 | #endif | |
2530 | #endif | |
2531 | ||
2532 | #ifdef PUSH_ARGS_REVERSED | |
2533 | inc = -1; | |
2534 | argnum = nargs - 1; | |
2535 | #else | |
2536 | inc = 1; | |
2537 | argnum = 0; | |
2538 | #endif | |
2539 | ||
d3c451dd | 2540 | #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE) |
2541 | /* The argument list is the property of the called routine and it | |
2542 | may clobber it. If the fixed area has been used for previous | |
2543 | parameters, we must save and restore it. | |
2544 | ||
2545 | Here we compute the boundary of the that needs to be saved, if any. */ | |
2546 | ||
2547 | #ifdef ARGS_GROW_DOWNWARD | |
2548 | for (count = 0; count < reg_parm_stack_space + 1; count++) | |
2549 | #else | |
2550 | for (count = 0; count < reg_parm_stack_space; count++) | |
2551 | #endif | |
2552 | { | |
2553 | if (count >= highest_outgoing_arg_in_use | |
2554 | || stack_usage_map[count] == 0) | |
2555 | continue; | |
2556 | ||
2557 | if (low_to_save == -1) | |
2558 | low_to_save = count; | |
2559 | ||
2560 | high_to_save = count; | |
2561 | } | |
2562 | ||
2563 | if (low_to_save >= 0) | |
2564 | { | |
2565 | int num_to_save = high_to_save - low_to_save + 1; | |
2566 | enum machine_mode save_mode | |
2567 | = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1); | |
2568 | rtx stack_area; | |
2569 | ||
2570 | /* If we don't have the required alignment, must do this in BLKmode. */ | |
2571 | if ((low_to_save & (MIN (GET_MODE_SIZE (save_mode), | |
2572 | BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1))) | |
2573 | save_mode = BLKmode; | |
2574 | ||
2575 | stack_area = gen_rtx (MEM, save_mode, | |
2576 | memory_address (save_mode, | |
2577 | ||
2578 | #ifdef ARGS_GROW_DOWNWARD | |
2579 | plus_constant (argblock, | |
2580 | - high_to_save) | |
2581 | #else | |
2582 | plus_constant (argblock, | |
2583 | low_to_save) | |
2584 | #endif | |
2585 | )); | |
2586 | if (save_mode == BLKmode) | |
2587 | { | |
2588 | save_area = assign_stack_temp (BLKmode, num_to_save, 0); | |
2589 | MEM_IN_STRUCT_P (save_area) = 0; | |
2590 | emit_block_move (validize_mem (save_area), stack_area, | |
2591 | GEN_INT (num_to_save), | |
2592 | PARM_BOUNDARY / BITS_PER_UNIT); | |
2593 | } | |
2594 | else | |
2595 | { | |
2596 | save_area = gen_reg_rtx (save_mode); | |
2597 | emit_move_insn (save_area, stack_area); | |
2598 | } | |
2599 | } | |
2600 | #endif | |
2601 | ||
8ddf1c7e | 2602 | /* Push the args that need to be pushed. */ |
2603 | ||
3ee3644a | 2604 | /* ARGNUM indexes the ARGVEC array in the order in which the arguments |
2605 | are to be pushed. */ | |
8ddf1c7e | 2606 | for (count = 0; count < nargs; count++, argnum += inc) |
2607 | { | |
2608 | register enum machine_mode mode = argvec[argnum].mode; | |
2609 | register rtx val = argvec[argnum].value; | |
2610 | rtx reg = argvec[argnum].reg; | |
2611 | int partial = argvec[argnum].partial; | |
d3c451dd | 2612 | int lower_bound, upper_bound, i; |
8ddf1c7e | 2613 | |
2614 | if (! (reg != 0 && partial == 0)) | |
d3c451dd | 2615 | { |
2616 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
2617 | /* If this is being stored into a pre-allocated, fixed-size, stack | |
2618 | area, save any previous data at that location. */ | |
2619 | ||
2620 | #ifdef ARGS_GROW_DOWNWARD | |
2621 | /* stack_slot is negative, but we want to index stack_usage_map | |
2622 | with positive values. */ | |
3ee3644a | 2623 | upper_bound = -argvec[argnum].offset.constant + 1; |
2624 | lower_bound = upper_bound - argvec[argnum].size.constant; | |
d3c451dd | 2625 | #else |
3ee3644a | 2626 | lower_bound = argvec[argnum].offset.constant; |
2627 | upper_bound = lower_bound + argvec[argnum].size.constant; | |
d3c451dd | 2628 | #endif |
2629 | ||
2630 | for (i = lower_bound; i < upper_bound; i++) | |
2631 | if (stack_usage_map[i] | |
2632 | #ifdef REG_PARM_STACK_SPACE | |
2633 | /* Don't store things in the fixed argument area at this point; | |
2634 | it has already been saved. */ | |
2635 | && i > reg_parm_stack_space | |
2636 | #endif | |
2637 | ) | |
2638 | break; | |
2639 | ||
2640 | if (i != upper_bound) | |
2641 | { | |
2642 | /* We need to make a save area. See what mode we can make it. */ | |
2643 | enum machine_mode save_mode | |
3ee3644a | 2644 | = mode_for_size (argvec[argnum].size.constant * BITS_PER_UNIT, |
d3c451dd | 2645 | MODE_INT, 1); |
2646 | rtx stack_area | |
2647 | = gen_rtx (MEM, save_mode, | |
2648 | memory_address (save_mode, plus_constant (argblock, | |
3ee3644a | 2649 | argvec[argnum].offset.constant))); |
2650 | argvec[argnum].save_area = gen_reg_rtx (save_mode); | |
2651 | emit_move_insn (argvec[argnum].save_area, stack_area); | |
d3c451dd | 2652 | } |
2653 | #endif | |
2654 | emit_push_insn (val, mode, NULL_TREE, NULL_RTX, 0, partial, reg, 0, | |
3ee3644a | 2655 | argblock, GEN_INT (argvec[argnum].offset.constant)); |
d3c451dd | 2656 | |
2657 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
2658 | /* Now mark the segment we just used. */ | |
2659 | for (i = lower_bound; i < upper_bound; i++) | |
2660 | stack_usage_map[i] = 1; | |
2661 | #endif | |
2662 | ||
2663 | NO_DEFER_POP; | |
2664 | } | |
8ddf1c7e | 2665 | } |
2666 | ||
2667 | #ifndef PUSH_ARGS_REVERSED | |
2668 | #ifdef STACK_BOUNDARY | |
2669 | /* If we pushed args in forward order, perform stack alignment | |
2670 | after pushing the last arg. */ | |
2671 | if (argblock == 0) | |
2672 | anti_adjust_stack (GEN_INT (args_size.constant | |
2673 | - original_args_size.constant)); | |
2674 | #endif | |
2675 | #endif | |
2676 | ||
2677 | #ifdef PUSH_ARGS_REVERSED | |
2678 | argnum = nargs - 1; | |
2679 | #else | |
2680 | argnum = 0; | |
2681 | #endif | |
2682 | ||
8866f42d | 2683 | fun = prepare_call_address (fun, NULL_TREE, &call_fusage, 0); |
cce3ca0a | 2684 | |
8ddf1c7e | 2685 | /* Now load any reg parms into their regs. */ |
2686 | ||
3ee3644a | 2687 | /* ARGNUM indexes the ARGVEC array in the order in which the arguments |
2688 | are to be pushed. */ | |
8ddf1c7e | 2689 | for (count = 0; count < nargs; count++, argnum += inc) |
2690 | { | |
2691 | register enum machine_mode mode = argvec[argnum].mode; | |
2692 | register rtx val = argvec[argnum].value; | |
2693 | rtx reg = argvec[argnum].reg; | |
2694 | int partial = argvec[argnum].partial; | |
2695 | ||
2696 | if (reg != 0 && partial == 0) | |
2697 | emit_move_insn (reg, val); | |
2698 | NO_DEFER_POP; | |
2699 | } | |
2700 | ||
2701 | /* For version 1.37, try deleting this entirely. */ | |
2702 | if (! no_queue) | |
2703 | emit_queue (); | |
2704 | ||
2705 | /* Any regs containing parms remain in use through the call. */ | |
8ddf1c7e | 2706 | for (count = 0; count < nargs; count++) |
2707 | if (argvec[count].reg != 0) | |
8866f42d | 2708 | use_reg (&call_fusage, argvec[count].reg); |
8ddf1c7e | 2709 | |
8ddf1c7e | 2710 | /* Don't allow popping to be deferred, since then |
2711 | cse'ing of library calls could delete a call and leave the pop. */ | |
2712 | NO_DEFER_POP; | |
2713 | ||
2714 | /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which | |
2715 | will set inhibit_defer_pop to that value. */ | |
2716 | ||
d429bc10 | 2717 | /* The return type is needed to decide how many bytes the function pops. |
2718 | Signedness plays no role in that, so for simplicity, we pretend it's | |
2719 | always signed. We also assume that the list of arguments passed has | |
2720 | no impact, so we pretend it is unknown. */ | |
2721 | ||
e93a4612 | 2722 | emit_call_1 (fun, |
2723 | get_identifier (XSTR (orgfun, 0)), | |
b554e347 | 2724 | build_function_type (outmode == VOIDmode ? void_type_node |
2725 | : type_for_mode (outmode, 0), NULL_TREE), | |
d429bc10 | 2726 | args_size.constant, 0, |
8ddf1c7e | 2727 | FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1), |
2728 | outmode != VOIDmode ? hard_libcall_value (outmode) : NULL_RTX, | |
8866f42d | 2729 | old_inhibit_defer_pop + 1, call_fusage, no_queue); |
8ddf1c7e | 2730 | |
ad47e56a | 2731 | pop_temp_slots (); |
2732 | ||
8ddf1c7e | 2733 | /* Now restore inhibit_defer_pop to its actual original value. */ |
2734 | OK_DEFER_POP; | |
d3c451dd | 2735 | |
2736 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
2737 | #ifdef REG_PARM_STACK_SPACE | |
0dbd1c74 | 2738 | if (save_area) |
2739 | { | |
2740 | enum machine_mode save_mode = GET_MODE (save_area); | |
2741 | rtx stack_area | |
2742 | = gen_rtx (MEM, save_mode, | |
2743 | memory_address (save_mode, | |
d3c451dd | 2744 | #ifdef ARGS_GROW_DOWNWARD |
0dbd1c74 | 2745 | plus_constant (argblock, - high_to_save) |
d3c451dd | 2746 | #else |
0dbd1c74 | 2747 | plus_constant (argblock, low_to_save) |
d3c451dd | 2748 | #endif |
0dbd1c74 | 2749 | )); |
d3c451dd | 2750 | |
0dbd1c74 | 2751 | if (save_mode != BLKmode) |
2752 | emit_move_insn (stack_area, save_area); | |
2753 | else | |
2754 | emit_block_move (stack_area, validize_mem (save_area), | |
2755 | GEN_INT (high_to_save - low_to_save + 1), | |
2756 | PARM_BOUNDARY / BITS_PER_UNIT); | |
2757 | } | |
d3c451dd | 2758 | #endif |
2759 | ||
2760 | /* If we saved any argument areas, restore them. */ | |
2761 | for (count = 0; count < nargs; count++) | |
2762 | if (argvec[count].save_area) | |
2763 | { | |
2764 | enum machine_mode save_mode = GET_MODE (argvec[count].save_area); | |
2765 | rtx stack_area | |
2766 | = gen_rtx (MEM, save_mode, | |
2767 | memory_address (save_mode, plus_constant (argblock, | |
2768 | argvec[count].offset.constant))); | |
2769 | ||
2770 | emit_move_insn (stack_area, argvec[count].save_area); | |
2771 | } | |
2772 | ||
2773 | highest_outgoing_arg_in_use = initial_highest_arg_in_use; | |
2774 | stack_usage_map = initial_stack_usage_map; | |
2775 | #endif | |
8ddf1c7e | 2776 | } |
2777 | \f | |
2778 | /* Like emit_library_call except that an extra argument, VALUE, | |
2779 | comes second and says where to store the result. | |
371645b0 | 2780 | (If VALUE is zero, this function chooses a convenient way |
2781 | to return the value. | |
8ddf1c7e | 2782 | |
371645b0 | 2783 | This function returns an rtx for where the value is to be found. |
2784 | If VALUE is nonzero, VALUE is returned. */ | |
2785 | ||
2786 | rtx | |
e5fcd76a | 2787 | emit_library_call_value VPROTO((rtx orgfun, rtx value, int no_queue, |
2788 | enum machine_mode outmode, int nargs, ...)) | |
8ddf1c7e | 2789 | { |
e5fcd76a | 2790 | #ifndef __STDC__ |
2791 | rtx orgfun; | |
2792 | rtx value; | |
2793 | int no_queue; | |
2794 | enum machine_mode outmode; | |
2795 | int nargs; | |
2796 | #endif | |
8ddf1c7e | 2797 | va_list p; |
2798 | /* Total size in bytes of all the stack-parms scanned so far. */ | |
2799 | struct args_size args_size; | |
2800 | /* Size of arguments before any adjustments (such as rounding). */ | |
2801 | struct args_size original_args_size; | |
2802 | register int argnum; | |
8ddf1c7e | 2803 | rtx fun; |
8ddf1c7e | 2804 | int inc; |
2805 | int count; | |
2806 | rtx argblock = 0; | |
2807 | CUMULATIVE_ARGS args_so_far; | |
2808 | struct arg { rtx value; enum machine_mode mode; rtx reg; int partial; | |
d3c451dd | 2809 | struct args_size offset; struct args_size size; rtx save_area; }; |
8ddf1c7e | 2810 | struct arg *argvec; |
2811 | int old_inhibit_defer_pop = inhibit_defer_pop; | |
8866f42d | 2812 | rtx call_fusage = 0; |
d3c451dd | 2813 | /* Size of the stack reserved for parameter registers. */ |
2814 | int reg_parm_stack_space = 0; | |
8ddf1c7e | 2815 | rtx mem_value = 0; |
371645b0 | 2816 | int pcc_struct_value = 0; |
843e6eb7 | 2817 | int struct_value_size = 0; |
f5560089 | 2818 | int is_const; |
d3c451dd | 2819 | int needed; |
2820 | ||
2821 | #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE) | |
2822 | /* Define the boundary of the register parm stack space that needs to be | |
2823 | save, if any. */ | |
2824 | int low_to_save = -1, high_to_save; | |
2825 | rtx save_area = 0; /* Place that it is saved */ | |
2826 | #endif | |
2827 | ||
2828 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
2829 | int initial_highest_arg_in_use = highest_outgoing_arg_in_use; | |
2830 | char *initial_stack_usage_map = stack_usage_map; | |
2831 | #endif | |
2832 | ||
2833 | #ifdef REG_PARM_STACK_SPACE | |
2834 | #ifdef MAYBE_REG_PARM_STACK_SPACE | |
2835 | reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE; | |
2836 | #else | |
2837 | reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl); | |
2838 | #endif | |
2839 | #endif | |
8ddf1c7e | 2840 | |
e5fcd76a | 2841 | VA_START (p, nargs); |
2842 | ||
2843 | #ifndef __STDC__ | |
2844 | orgfun = va_arg (p, rtx); | |
8ddf1c7e | 2845 | value = va_arg (p, rtx); |
2846 | no_queue = va_arg (p, int); | |
2847 | outmode = va_arg (p, enum machine_mode); | |
2848 | nargs = va_arg (p, int); | |
e5fcd76a | 2849 | #endif |
2850 | ||
f5560089 | 2851 | is_const = no_queue; |
e5fcd76a | 2852 | fun = orgfun; |
8ddf1c7e | 2853 | |
2854 | /* If this kind of value comes back in memory, | |
2855 | decide where in memory it should come back. */ | |
371645b0 | 2856 | if (aggregate_value_p (type_for_mode (outmode, 0))) |
8ddf1c7e | 2857 | { |
371645b0 | 2858 | #ifdef PCC_STATIC_STRUCT_RETURN |
2859 | rtx pointer_reg | |
2860 | = hard_function_value (build_pointer_type (type_for_mode (outmode, 0)), | |
2861 | 0); | |
2862 | mem_value = gen_rtx (MEM, outmode, pointer_reg); | |
2863 | pcc_struct_value = 1; | |
2864 | if (value == 0) | |
2865 | value = gen_reg_rtx (outmode); | |
2866 | #else /* not PCC_STATIC_STRUCT_RETURN */ | |
843e6eb7 | 2867 | struct_value_size = GET_MODE_SIZE (outmode); |
371645b0 | 2868 | if (value != 0 && GET_CODE (value) == MEM) |
8ddf1c7e | 2869 | mem_value = value; |
2870 | else | |
2871 | mem_value = assign_stack_temp (outmode, GET_MODE_SIZE (outmode), 0); | |
371645b0 | 2872 | #endif |
61b127d0 | 2873 | |
2874 | /* This call returns a big structure. */ | |
2875 | is_const = 0; | |
8ddf1c7e | 2876 | } |
2877 | ||
2878 | /* ??? Unfinished: must pass the memory address as an argument. */ | |
2879 | ||
2880 | /* Copy all the libcall-arguments out of the varargs data | |
2881 | and into a vector ARGVEC. | |
2882 | ||
2883 | Compute how to pass each argument. We only support a very small subset | |
2884 | of the full argument passing conventions to limit complexity here since | |
2885 | library functions shouldn't have many args. */ | |
2886 | ||
2887 | argvec = (struct arg *) alloca ((nargs + 1) * sizeof (struct arg)); | |
68948913 | 2888 | bzero ((char *) argvec, (nargs + 1) * sizeof (struct arg)); |
8ddf1c7e | 2889 | |
412321ce | 2890 | INIT_CUMULATIVE_ARGS (args_so_far, NULL_TREE, fun, 0); |
8ddf1c7e | 2891 | |
2892 | args_size.constant = 0; | |
2893 | args_size.var = 0; | |
2894 | ||
2895 | count = 0; | |
2896 | ||
ad47e56a | 2897 | push_temp_slots (); |
2898 | ||
8ddf1c7e | 2899 | /* If there's a structure value address to be passed, |
2900 | either pass it in the special place, or pass it as an extra argument. */ | |
371645b0 | 2901 | if (mem_value && struct_value_rtx == 0 && ! pcc_struct_value) |
8ddf1c7e | 2902 | { |
2903 | rtx addr = XEXP (mem_value, 0); | |
371645b0 | 2904 | nargs++; |
8ddf1c7e | 2905 | |
371645b0 | 2906 | /* Make sure it is a reasonable operand for a move or push insn. */ |
2907 | if (GET_CODE (addr) != REG && GET_CODE (addr) != MEM | |
2908 | && ! (CONSTANT_P (addr) && LEGITIMATE_CONSTANT_P (addr))) | |
2909 | addr = force_operand (addr, NULL_RTX); | |
8ddf1c7e | 2910 | |
371645b0 | 2911 | argvec[count].value = addr; |
67f836ba | 2912 | argvec[count].mode = Pmode; |
371645b0 | 2913 | argvec[count].partial = 0; |
8ddf1c7e | 2914 | |
67f836ba | 2915 | argvec[count].reg = FUNCTION_ARG (args_so_far, Pmode, NULL_TREE, 1); |
8ddf1c7e | 2916 | #ifdef FUNCTION_ARG_PARTIAL_NREGS |
67f836ba | 2917 | if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far, Pmode, NULL_TREE, 1)) |
371645b0 | 2918 | abort (); |
8ddf1c7e | 2919 | #endif |
2920 | ||
67f836ba | 2921 | locate_and_pad_parm (Pmode, NULL_TREE, |
371645b0 | 2922 | argvec[count].reg && argvec[count].partial == 0, |
2923 | NULL_TREE, &args_size, &argvec[count].offset, | |
2924 | &argvec[count].size); | |
8ddf1c7e | 2925 | |
2926 | ||
371645b0 | 2927 | if (argvec[count].reg == 0 || argvec[count].partial != 0 |
8ddf1c7e | 2928 | #ifdef REG_PARM_STACK_SPACE |
371645b0 | 2929 | || 1 |
8ddf1c7e | 2930 | #endif |
371645b0 | 2931 | ) |
2932 | args_size.constant += argvec[count].size.constant; | |
8ddf1c7e | 2933 | |
a92771b8 | 2934 | FUNCTION_ARG_ADVANCE (args_so_far, Pmode, (tree) 0, 1); |
371645b0 | 2935 | |
2936 | count++; | |
8ddf1c7e | 2937 | } |
2938 | ||
2939 | for (; count < nargs; count++) | |
2940 | { | |
2941 | rtx val = va_arg (p, rtx); | |
2942 | enum machine_mode mode = va_arg (p, enum machine_mode); | |
2943 | ||
2944 | /* We cannot convert the arg value to the mode the library wants here; | |
2945 | must do it earlier where we know the signedness of the arg. */ | |
2946 | if (mode == BLKmode | |
2947 | || (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode)) | |
2948 | abort (); | |
2949 | ||
2950 | /* On some machines, there's no way to pass a float to a library fcn. | |
2951 | Pass it as a double instead. */ | |
2952 | #ifdef LIBGCC_NEEDS_DOUBLE | |
2953 | if (LIBGCC_NEEDS_DOUBLE && mode == SFmode) | |
1560ef8f | 2954 | val = convert_modes (DFmode, SFmode, val, 0), mode = DFmode; |
8ddf1c7e | 2955 | #endif |
2956 | ||
2957 | /* There's no need to call protect_from_queue, because | |
2958 | either emit_move_insn or emit_push_insn will do that. */ | |
2959 | ||
2960 | /* Make sure it is a reasonable operand for a move or push insn. */ | |
2961 | if (GET_CODE (val) != REG && GET_CODE (val) != MEM | |
2962 | && ! (CONSTANT_P (val) && LEGITIMATE_CONSTANT_P (val))) | |
2963 | val = force_operand (val, NULL_RTX); | |
2964 | ||
8ddf1c7e | 2965 | #ifdef FUNCTION_ARG_PASS_BY_REFERENCE |
2966 | if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, mode, NULL_TREE, 1)) | |
ad47e56a | 2967 | { |
8878c71f | 2968 | /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can |
2969 | be viewed as just an efficiency improvement. */ | |
ad47e56a | 2970 | rtx slot = assign_stack_temp (mode, GET_MODE_SIZE (mode), 0); |
2971 | emit_move_insn (slot, val); | |
2972 | val = XEXP (slot, 0); | |
2973 | mode = Pmode; | |
2974 | } | |
8ddf1c7e | 2975 | #endif |
2976 | ||
ad47e56a | 2977 | argvec[count].value = val; |
2978 | argvec[count].mode = mode; | |
2979 | ||
8ddf1c7e | 2980 | argvec[count].reg = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1); |
566d850a | 2981 | if (argvec[count].reg && GET_CODE (argvec[count].reg) == PARALLEL) |
8ddf1c7e | 2982 | abort (); |
2983 | #ifdef FUNCTION_ARG_PARTIAL_NREGS | |
2984 | argvec[count].partial | |
2985 | = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, NULL_TREE, 1); | |
2986 | #else | |
2987 | argvec[count].partial = 0; | |
2988 | #endif | |
2989 | ||
2990 | locate_and_pad_parm (mode, NULL_TREE, | |
2991 | argvec[count].reg && argvec[count].partial == 0, | |
2992 | NULL_TREE, &args_size, &argvec[count].offset, | |
2993 | &argvec[count].size); | |
2994 | ||
2995 | if (argvec[count].size.var) | |
2996 | abort (); | |
2997 | ||
2998 | #ifndef REG_PARM_STACK_SPACE | |
2999 | if (argvec[count].partial) | |
3000 | argvec[count].size.constant -= argvec[count].partial * UNITS_PER_WORD; | |
3001 | #endif | |
3002 | ||
3003 | if (argvec[count].reg == 0 || argvec[count].partial != 0 | |
3004 | #ifdef REG_PARM_STACK_SPACE | |
3005 | || 1 | |
3006 | #endif | |
3007 | ) | |
3008 | args_size.constant += argvec[count].size.constant; | |
3009 | ||
a92771b8 | 3010 | FUNCTION_ARG_ADVANCE (args_so_far, mode, (tree) 0, 1); |
8ddf1c7e | 3011 | } |
3012 | va_end (p); | |
3013 | ||
d3c451dd | 3014 | #ifdef FINAL_REG_PARM_STACK_SPACE |
3015 | reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant, | |
3016 | args_size.var); | |
3017 | #endif | |
8ddf1c7e | 3018 | /* If this machine requires an external definition for library |
3019 | functions, write one out. */ | |
3020 | assemble_external_libcall (fun); | |
3021 | ||
3022 | original_args_size = args_size; | |
3023 | #ifdef STACK_BOUNDARY | |
3024 | args_size.constant = (((args_size.constant + (STACK_BYTES - 1)) | |
3025 | / STACK_BYTES) * STACK_BYTES); | |
3026 | #endif | |
3027 | ||
3028 | #ifdef REG_PARM_STACK_SPACE | |
3029 | args_size.constant = MAX (args_size.constant, | |
d3c451dd | 3030 | reg_parm_stack_space); |
8ddf1c7e | 3031 | #ifndef OUTGOING_REG_PARM_STACK_SPACE |
a6335ead | 3032 | args_size.constant -= reg_parm_stack_space; |
8ddf1c7e | 3033 | #endif |
3034 | #endif | |
3035 | ||
8ddf1c7e | 3036 | if (args_size.constant > current_function_outgoing_args_size) |
3037 | current_function_outgoing_args_size = args_size.constant; | |
7221f864 | 3038 | |
3039 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
d3c451dd | 3040 | /* Since the stack pointer will never be pushed, it is possible for |
3041 | the evaluation of a parm to clobber something we have already | |
3042 | written to the stack. Since most function calls on RISC machines | |
3043 | do not use the stack, this is uncommon, but must work correctly. | |
3044 | ||
3045 | Therefore, we save any area of the stack that was already written | |
3046 | and that we are using. Here we set up to do this by making a new | |
3047 | stack usage map from the old one. | |
3048 | ||
3049 | Another approach might be to try to reorder the argument | |
3050 | evaluations to avoid this conflicting stack usage. */ | |
3051 | ||
3052 | needed = args_size.constant; | |
3053 | #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE) | |
3054 | /* Since we will be writing into the entire argument area, the | |
3055 | map must be allocated for its entire size, not just the part that | |
3056 | is the responsibility of the caller. */ | |
3057 | needed += reg_parm_stack_space; | |
3058 | #endif | |
3059 | ||
3060 | #ifdef ARGS_GROW_DOWNWARD | |
3061 | highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use, | |
3062 | needed + 1); | |
3063 | #else | |
3064 | highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use, | |
3065 | needed); | |
8ddf1c7e | 3066 | #endif |
d3c451dd | 3067 | stack_usage_map = (char *) alloca (highest_outgoing_arg_in_use); |
3068 | ||
3069 | if (initial_highest_arg_in_use) | |
3070 | bcopy (initial_stack_usage_map, stack_usage_map, | |
3071 | initial_highest_arg_in_use); | |
3072 | ||
3073 | if (initial_highest_arg_in_use != highest_outgoing_arg_in_use) | |
3074 | bzero (&stack_usage_map[initial_highest_arg_in_use], | |
3075 | highest_outgoing_arg_in_use - initial_highest_arg_in_use); | |
3076 | needed = 0; | |
8ddf1c7e | 3077 | |
d3c451dd | 3078 | /* The address of the outgoing argument list must not be copied to a |
3079 | register here, because argblock would be left pointing to the | |
3080 | wrong place after the call to allocate_dynamic_stack_space below. | |
3081 | */ | |
3082 | ||
3083 | argblock = virtual_outgoing_args_rtx; | |
3084 | #else /* not ACCUMULATE_OUTGOING_ARGS */ | |
8ddf1c7e | 3085 | #ifndef PUSH_ROUNDING |
3086 | argblock = push_block (GEN_INT (args_size.constant), 0, 0); | |
3087 | #endif | |
d3c451dd | 3088 | #endif |
8ddf1c7e | 3089 | |
3090 | #ifdef PUSH_ARGS_REVERSED | |
3091 | #ifdef STACK_BOUNDARY | |
3092 | /* If we push args individually in reverse order, perform stack alignment | |
3093 | before the first push (the last arg). */ | |
3094 | if (argblock == 0) | |
3095 | anti_adjust_stack (GEN_INT (args_size.constant | |
3096 | - original_args_size.constant)); | |
3097 | #endif | |
3098 | #endif | |
3099 | ||
3100 | #ifdef PUSH_ARGS_REVERSED | |
3101 | inc = -1; | |
3102 | argnum = nargs - 1; | |
3103 | #else | |
3104 | inc = 1; | |
3105 | argnum = 0; | |
3106 | #endif | |
3107 | ||
d3c451dd | 3108 | #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE) |
3109 | /* The argument list is the property of the called routine and it | |
3110 | may clobber it. If the fixed area has been used for previous | |
3111 | parameters, we must save and restore it. | |
3112 | ||
3113 | Here we compute the boundary of the that needs to be saved, if any. */ | |
3114 | ||
3115 | #ifdef ARGS_GROW_DOWNWARD | |
3116 | for (count = 0; count < reg_parm_stack_space + 1; count++) | |
3117 | #else | |
3118 | for (count = 0; count < reg_parm_stack_space; count++) | |
3119 | #endif | |
3120 | { | |
3121 | if (count >= highest_outgoing_arg_in_use | |
3122 | || stack_usage_map[count] == 0) | |
3123 | continue; | |
3124 | ||
3125 | if (low_to_save == -1) | |
3126 | low_to_save = count; | |
3127 | ||
3128 | high_to_save = count; | |
3129 | } | |
3130 | ||
3131 | if (low_to_save >= 0) | |
3132 | { | |
3133 | int num_to_save = high_to_save - low_to_save + 1; | |
3134 | enum machine_mode save_mode | |
3135 | = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1); | |
3136 | rtx stack_area; | |
3137 | ||
3138 | /* If we don't have the required alignment, must do this in BLKmode. */ | |
3139 | if ((low_to_save & (MIN (GET_MODE_SIZE (save_mode), | |
3140 | BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1))) | |
3141 | save_mode = BLKmode; | |
3142 | ||
3143 | stack_area = gen_rtx (MEM, save_mode, | |
3144 | memory_address (save_mode, | |
3145 | ||
3146 | #ifdef ARGS_GROW_DOWNWARD | |
3147 | plus_constant (argblock, | |
3148 | - high_to_save) | |
3149 | #else | |
3150 | plus_constant (argblock, | |
3151 | low_to_save) | |
3152 | #endif | |
3153 | )); | |
3154 | if (save_mode == BLKmode) | |
3155 | { | |
3156 | save_area = assign_stack_temp (BLKmode, num_to_save, 0); | |
3157 | MEM_IN_STRUCT_P (save_area) = 0; | |
3158 | emit_block_move (validize_mem (save_area), stack_area, | |
3159 | GEN_INT (num_to_save), | |
3160 | PARM_BOUNDARY / BITS_PER_UNIT); | |
3161 | } | |
3162 | else | |
3163 | { | |
3164 | save_area = gen_reg_rtx (save_mode); | |
3165 | emit_move_insn (save_area, stack_area); | |
3166 | } | |
3167 | } | |
3168 | #endif | |
3169 | ||
8ddf1c7e | 3170 | /* Push the args that need to be pushed. */ |
3171 | ||
3ee3644a | 3172 | /* ARGNUM indexes the ARGVEC array in the order in which the arguments |
3173 | are to be pushed. */ | |
8ddf1c7e | 3174 | for (count = 0; count < nargs; count++, argnum += inc) |
3175 | { | |
3176 | register enum machine_mode mode = argvec[argnum].mode; | |
3177 | register rtx val = argvec[argnum].value; | |
3178 | rtx reg = argvec[argnum].reg; | |
3179 | int partial = argvec[argnum].partial; | |
d3c451dd | 3180 | int lower_bound, upper_bound, i; |
8ddf1c7e | 3181 | |
3182 | if (! (reg != 0 && partial == 0)) | |
d3c451dd | 3183 | { |
3184 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
3185 | /* If this is being stored into a pre-allocated, fixed-size, stack | |
3186 | area, save any previous data at that location. */ | |
3187 | ||
3188 | #ifdef ARGS_GROW_DOWNWARD | |
3189 | /* stack_slot is negative, but we want to index stack_usage_map | |
3190 | with positive values. */ | |
3ee3644a | 3191 | upper_bound = -argvec[argnum].offset.constant + 1; |
3192 | lower_bound = upper_bound - argvec[argnum].size.constant; | |
d3c451dd | 3193 | #else |
3ee3644a | 3194 | lower_bound = argvec[argnum].offset.constant; |
3195 | upper_bound = lower_bound + argvec[argnum].size.constant; | |
d3c451dd | 3196 | #endif |
3197 | ||
3198 | for (i = lower_bound; i < upper_bound; i++) | |
3199 | if (stack_usage_map[i] | |
3200 | #ifdef REG_PARM_STACK_SPACE | |
3201 | /* Don't store things in the fixed argument area at this point; | |
3202 | it has already been saved. */ | |
3203 | && i > reg_parm_stack_space | |
3204 | #endif | |
3205 | ) | |
3206 | break; | |
3207 | ||
3208 | if (i != upper_bound) | |
3209 | { | |
3210 | /* We need to make a save area. See what mode we can make it. */ | |
3211 | enum machine_mode save_mode | |
3ee3644a | 3212 | = mode_for_size (argvec[argnum].size.constant * BITS_PER_UNIT, |
d3c451dd | 3213 | MODE_INT, 1); |
3214 | rtx stack_area | |
3215 | = gen_rtx (MEM, save_mode, | |
3216 | memory_address (save_mode, plus_constant (argblock, | |
3ee3644a | 3217 | argvec[argnum].offset.constant))); |
3218 | argvec[argnum].save_area = gen_reg_rtx (save_mode); | |
3219 | emit_move_insn (argvec[argnum].save_area, stack_area); | |
d3c451dd | 3220 | } |
3221 | #endif | |
3222 | emit_push_insn (val, mode, NULL_TREE, NULL_RTX, 0, partial, reg, 0, | |
3ee3644a | 3223 | argblock, GEN_INT (argvec[argnum].offset.constant)); |
d3c451dd | 3224 | |
3225 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
3226 | /* Now mark the segment we just used. */ | |
3227 | for (i = lower_bound; i < upper_bound; i++) | |
3228 | stack_usage_map[i] = 1; | |
3229 | #endif | |
3230 | ||
3231 | NO_DEFER_POP; | |
3232 | } | |
8ddf1c7e | 3233 | } |
3234 | ||
3235 | #ifndef PUSH_ARGS_REVERSED | |
3236 | #ifdef STACK_BOUNDARY | |
3237 | /* If we pushed args in forward order, perform stack alignment | |
3238 | after pushing the last arg. */ | |
3239 | if (argblock == 0) | |
3240 | anti_adjust_stack (GEN_INT (args_size.constant | |
3241 | - original_args_size.constant)); | |
3242 | #endif | |
3243 | #endif | |
3244 | ||
3245 | #ifdef PUSH_ARGS_REVERSED | |
3246 | argnum = nargs - 1; | |
3247 | #else | |
3248 | argnum = 0; | |
3249 | #endif | |
3250 | ||
8866f42d | 3251 | fun = prepare_call_address (fun, NULL_TREE, &call_fusage, 0); |
cce3ca0a | 3252 | |
8ddf1c7e | 3253 | /* Now load any reg parms into their regs. */ |
3254 | ||
3ee3644a | 3255 | /* ARGNUM indexes the ARGVEC array in the order in which the arguments |
3256 | are to be pushed. */ | |
8ddf1c7e | 3257 | for (count = 0; count < nargs; count++, argnum += inc) |
3258 | { | |
3259 | register enum machine_mode mode = argvec[argnum].mode; | |
3260 | register rtx val = argvec[argnum].value; | |
3261 | rtx reg = argvec[argnum].reg; | |
3262 | int partial = argvec[argnum].partial; | |
3263 | ||
3264 | if (reg != 0 && partial == 0) | |
3265 | emit_move_insn (reg, val); | |
3266 | NO_DEFER_POP; | |
3267 | } | |
3268 | ||
3269 | #if 0 | |
3270 | /* For version 1.37, try deleting this entirely. */ | |
3271 | if (! no_queue) | |
3272 | emit_queue (); | |
3273 | #endif | |
3274 | ||
3275 | /* Any regs containing parms remain in use through the call. */ | |
8ddf1c7e | 3276 | for (count = 0; count < nargs; count++) |
3277 | if (argvec[count].reg != 0) | |
8866f42d | 3278 | use_reg (&call_fusage, argvec[count].reg); |
8ddf1c7e | 3279 | |
371645b0 | 3280 | /* Pass the function the address in which to return a structure value. */ |
3281 | if (mem_value != 0 && struct_value_rtx != 0 && ! pcc_struct_value) | |
3282 | { | |
3283 | emit_move_insn (struct_value_rtx, | |
3284 | force_reg (Pmode, | |
3285 | force_operand (XEXP (mem_value, 0), | |
3286 | NULL_RTX))); | |
3287 | if (GET_CODE (struct_value_rtx) == REG) | |
8866f42d | 3288 | use_reg (&call_fusage, struct_value_rtx); |
371645b0 | 3289 | } |
3290 | ||
8ddf1c7e | 3291 | /* Don't allow popping to be deferred, since then |
3292 | cse'ing of library calls could delete a call and leave the pop. */ | |
3293 | NO_DEFER_POP; | |
3294 | ||
3295 | /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which | |
3296 | will set inhibit_defer_pop to that value. */ | |
d429bc10 | 3297 | /* See the comment in emit_library_call about the function type we build |
3298 | and pass here. */ | |
8ddf1c7e | 3299 | |
e93a4612 | 3300 | emit_call_1 (fun, |
3301 | get_identifier (XSTR (orgfun, 0)), | |
d429bc10 | 3302 | build_function_type (type_for_mode (outmode, 0), NULL_TREE), |
3303 | args_size.constant, struct_value_size, | |
8ddf1c7e | 3304 | FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1), |
c4da142a | 3305 | mem_value == 0 ? hard_libcall_value (outmode) : NULL_RTX, |
8866f42d | 3306 | old_inhibit_defer_pop + 1, call_fusage, is_const); |
8ddf1c7e | 3307 | |
3308 | /* Now restore inhibit_defer_pop to its actual original value. */ | |
3309 | OK_DEFER_POP; | |
3310 | ||
ad47e56a | 3311 | pop_temp_slots (); |
3312 | ||
8ddf1c7e | 3313 | /* Copy the value to the right place. */ |
3314 | if (outmode != VOIDmode) | |
3315 | { | |
3316 | if (mem_value) | |
3317 | { | |
3318 | if (value == 0) | |
371645b0 | 3319 | value = mem_value; |
8ddf1c7e | 3320 | if (value != mem_value) |
3321 | emit_move_insn (value, mem_value); | |
3322 | } | |
3323 | else if (value != 0) | |
3324 | emit_move_insn (value, hard_libcall_value (outmode)); | |
371645b0 | 3325 | else |
3326 | value = hard_libcall_value (outmode); | |
8ddf1c7e | 3327 | } |
371645b0 | 3328 | |
d3c451dd | 3329 | #ifdef ACCUMULATE_OUTGOING_ARGS |
3330 | #ifdef REG_PARM_STACK_SPACE | |
0dbd1c74 | 3331 | if (save_area) |
3332 | { | |
3333 | enum machine_mode save_mode = GET_MODE (save_area); | |
3334 | rtx stack_area | |
3335 | = gen_rtx (MEM, save_mode, | |
3336 | memory_address (save_mode, | |
d3c451dd | 3337 | #ifdef ARGS_GROW_DOWNWARD |
0dbd1c74 | 3338 | plus_constant (argblock, - high_to_save) |
d3c451dd | 3339 | #else |
0dbd1c74 | 3340 | plus_constant (argblock, low_to_save) |
d3c451dd | 3341 | #endif |
0dbd1c74 | 3342 | )); |
d3c451dd | 3343 | |
0dbd1c74 | 3344 | if (save_mode != BLKmode) |
3345 | emit_move_insn (stack_area, save_area); | |
3346 | else | |
3347 | emit_block_move (stack_area, validize_mem (save_area), | |
3348 | GEN_INT (high_to_save - low_to_save + 1), | |
d3c451dd | 3349 | PARM_BOUNDARY / BITS_PER_UNIT); |
0dbd1c74 | 3350 | } |
d3c451dd | 3351 | #endif |
3352 | ||
3353 | /* If we saved any argument areas, restore them. */ | |
3354 | for (count = 0; count < nargs; count++) | |
3355 | if (argvec[count].save_area) | |
3356 | { | |
3357 | enum machine_mode save_mode = GET_MODE (argvec[count].save_area); | |
3358 | rtx stack_area | |
3359 | = gen_rtx (MEM, save_mode, | |
3360 | memory_address (save_mode, plus_constant (argblock, | |
3361 | argvec[count].offset.constant))); | |
3362 | ||
3363 | emit_move_insn (stack_area, argvec[count].save_area); | |
3364 | } | |
3365 | ||
3366 | highest_outgoing_arg_in_use = initial_highest_arg_in_use; | |
3367 | stack_usage_map = initial_stack_usage_map; | |
3368 | #endif | |
3369 | ||
371645b0 | 3370 | return value; |
8ddf1c7e | 3371 | } |
3372 | \f | |
66d433c7 | 3373 | #if 0 |
3374 | /* Return an rtx which represents a suitable home on the stack | |
3375 | given TYPE, the type of the argument looking for a home. | |
3376 | This is called only for BLKmode arguments. | |
3377 | ||
3378 | SIZE is the size needed for this target. | |
3379 | ARGS_ADDR is the address of the bottom of the argument block for this call. | |
3380 | OFFSET describes this parameter's offset into ARGS_ADDR. It is meaningless | |
3381 | if this machine uses push insns. */ | |
3382 | ||
3383 | static rtx | |
3384 | target_for_arg (type, size, args_addr, offset) | |
3385 | tree type; | |
3386 | rtx size; | |
3387 | rtx args_addr; | |
3388 | struct args_size offset; | |
3389 | { | |
3390 | rtx target; | |
3391 | rtx offset_rtx = ARGS_SIZE_RTX (offset); | |
3392 | ||
3393 | /* We do not call memory_address if possible, | |
3394 | because we want to address as close to the stack | |
3395 | as possible. For non-variable sized arguments, | |
3396 | this will be stack-pointer relative addressing. */ | |
3397 | if (GET_CODE (offset_rtx) == CONST_INT) | |
3398 | target = plus_constant (args_addr, INTVAL (offset_rtx)); | |
3399 | else | |
3400 | { | |
3401 | /* I have no idea how to guarantee that this | |
3402 | will work in the presence of register parameters. */ | |
3403 | target = gen_rtx (PLUS, Pmode, args_addr, offset_rtx); | |
3404 | target = memory_address (QImode, target); | |
3405 | } | |
3406 | ||
3407 | return gen_rtx (MEM, BLKmode, target); | |
3408 | } | |
3409 | #endif | |
3410 | \f | |
3411 | /* Store a single argument for a function call | |
3412 | into the register or memory area where it must be passed. | |
3413 | *ARG describes the argument value and where to pass it. | |
3414 | ||
3415 | ARGBLOCK is the address of the stack-block for all the arguments, | |
f9e15121 | 3416 | or 0 on a machine where arguments are pushed individually. |
66d433c7 | 3417 | |
3418 | MAY_BE_ALLOCA nonzero says this could be a call to `alloca' | |
3419 | so must be careful about how the stack is used. | |
3420 | ||
3421 | VARIABLE_SIZE nonzero says that this was a variable-sized outgoing | |
3422 | argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate | |
3423 | that we need not worry about saving and restoring the stack. | |
3424 | ||
3425 | FNDECL is the declaration of the function we are calling. */ | |
3426 | ||
3427 | static void | |
2d7187c2 | 3428 | store_one_arg (arg, argblock, may_be_alloca, variable_size, fndecl, |
3429 | reg_parm_stack_space) | |
66d433c7 | 3430 | struct arg_data *arg; |
3431 | rtx argblock; | |
3432 | int may_be_alloca; | |
3433 | int variable_size; | |
3434 | tree fndecl; | |
2d7187c2 | 3435 | int reg_parm_stack_space; |
66d433c7 | 3436 | { |
3437 | register tree pval = arg->tree_value; | |
3438 | rtx reg = 0; | |
3439 | int partial = 0; | |
3440 | int used = 0; | |
3441 | int i, lower_bound, upper_bound; | |
3442 | ||
3443 | if (TREE_CODE (pval) == ERROR_MARK) | |
3444 | return; | |
3445 | ||
1b117c60 | 3446 | /* Push a new temporary level for any temporaries we make for |
3447 | this argument. */ | |
3448 | push_temp_slots (); | |
3449 | ||
66d433c7 | 3450 | #ifdef ACCUMULATE_OUTGOING_ARGS |
3451 | /* If this is being stored into a pre-allocated, fixed-size, stack area, | |
3452 | save any previous data at that location. */ | |
3453 | if (argblock && ! variable_size && arg->stack) | |
3454 | { | |
3455 | #ifdef ARGS_GROW_DOWNWARD | |
a92771b8 | 3456 | /* stack_slot is negative, but we want to index stack_usage_map |
3457 | with positive values. */ | |
66d433c7 | 3458 | if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS) |
3459 | upper_bound = -INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1)) + 1; | |
3460 | else | |
c9d22ff5 | 3461 | upper_bound = 0; |
66d433c7 | 3462 | |
3463 | lower_bound = upper_bound - arg->size.constant; | |
3464 | #else | |
3465 | if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS) | |
3466 | lower_bound = INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1)); | |
3467 | else | |
3468 | lower_bound = 0; | |
3469 | ||
3470 | upper_bound = lower_bound + arg->size.constant; | |
3471 | #endif | |
3472 | ||
3473 | for (i = lower_bound; i < upper_bound; i++) | |
3474 | if (stack_usage_map[i] | |
3475 | #ifdef REG_PARM_STACK_SPACE | |
3476 | /* Don't store things in the fixed argument area at this point; | |
3477 | it has already been saved. */ | |
2d7187c2 | 3478 | && i > reg_parm_stack_space |
66d433c7 | 3479 | #endif |
3480 | ) | |
3481 | break; | |
3482 | ||
3483 | if (i != upper_bound) | |
3484 | { | |
3485 | /* We need to make a save area. See what mode we can make it. */ | |
3486 | enum machine_mode save_mode | |
3487 | = mode_for_size (arg->size.constant * BITS_PER_UNIT, MODE_INT, 1); | |
3488 | rtx stack_area | |
3489 | = gen_rtx (MEM, save_mode, | |
3490 | memory_address (save_mode, XEXP (arg->stack_slot, 0))); | |
3491 | ||
3492 | if (save_mode == BLKmode) | |
3493 | { | |
3494 | arg->save_area = assign_stack_temp (BLKmode, | |
1eee775e | 3495 | arg->size.constant, 0); |
6b08ae80 | 3496 | MEM_IN_STRUCT_P (arg->save_area) |
3497 | = AGGREGATE_TYPE_P (TREE_TYPE (arg->tree_value)); | |
1b117c60 | 3498 | preserve_temp_slots (arg->save_area); |
66d433c7 | 3499 | emit_block_move (validize_mem (arg->save_area), stack_area, |
9e6d0a9a | 3500 | GEN_INT (arg->size.constant), |
66d433c7 | 3501 | PARM_BOUNDARY / BITS_PER_UNIT); |
3502 | } | |
3503 | else | |
3504 | { | |
3505 | arg->save_area = gen_reg_rtx (save_mode); | |
3506 | emit_move_insn (arg->save_area, stack_area); | |
3507 | } | |
3508 | } | |
3509 | } | |
3510 | #endif | |
3511 | ||
3512 | /* If this isn't going to be placed on both the stack and in registers, | |
3513 | set up the register and number of words. */ | |
3514 | if (! arg->pass_on_stack) | |
3515 | reg = arg->reg, partial = arg->partial; | |
3516 | ||
3517 | if (reg != 0 && partial == 0) | |
3518 | /* Being passed entirely in a register. We shouldn't be called in | |
3519 | this case. */ | |
3520 | abort (); | |
3521 | ||
f28c7a75 | 3522 | /* If this arg needs special alignment, don't load the registers |
3523 | here. */ | |
3524 | if (arg->n_aligned_regs != 0) | |
3525 | reg = 0; | |
f28c7a75 | 3526 | |
f28c7a75 | 3527 | /* If this is being passed partially in a register, we can't evaluate |
66d433c7 | 3528 | it directly into its stack slot. Otherwise, we can. */ |
3529 | if (arg->value == 0) | |
f848041f | 3530 | { |
3531 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
3532 | /* stack_arg_under_construction is nonzero if a function argument is | |
3533 | being evaluated directly into the outgoing argument list and | |
3534 | expand_call must take special action to preserve the argument list | |
3535 | if it is called recursively. | |
3536 | ||
3537 | For scalar function arguments stack_usage_map is sufficient to | |
3538 | determine which stack slots must be saved and restored. Scalar | |
3539 | arguments in general have pass_on_stack == 0. | |
3540 | ||
3541 | If this argument is initialized by a function which takes the | |
3542 | address of the argument (a C++ constructor or a C function | |
3543 | returning a BLKmode structure), then stack_usage_map is | |
3544 | insufficient and expand_call must push the stack around the | |
3545 | function call. Such arguments have pass_on_stack == 1. | |
3546 | ||
3547 | Note that it is always safe to set stack_arg_under_construction, | |
3548 | but this generates suboptimal code if set when not needed. */ | |
3549 | ||
3550 | if (arg->pass_on_stack) | |
3551 | stack_arg_under_construction++; | |
3552 | #endif | |
7dbf1af4 | 3553 | arg->value = expand_expr (pval, |
3554 | (partial | |
3555 | || TYPE_MODE (TREE_TYPE (pval)) != arg->mode) | |
3556 | ? NULL_RTX : arg->stack, | |
9e6d0a9a | 3557 | VOIDmode, 0); |
1c0c37a5 | 3558 | |
3559 | /* If we are promoting object (or for any other reason) the mode | |
3560 | doesn't agree, convert the mode. */ | |
3561 | ||
1560ef8f | 3562 | if (arg->mode != TYPE_MODE (TREE_TYPE (pval))) |
3563 | arg->value = convert_modes (arg->mode, TYPE_MODE (TREE_TYPE (pval)), | |
3564 | arg->value, arg->unsignedp); | |
1c0c37a5 | 3565 | |
f848041f | 3566 | #ifdef ACCUMULATE_OUTGOING_ARGS |
3567 | if (arg->pass_on_stack) | |
3568 | stack_arg_under_construction--; | |
3569 | #endif | |
3570 | } | |
66d433c7 | 3571 | |
3572 | /* Don't allow anything left on stack from computation | |
3573 | of argument to alloca. */ | |
3574 | if (may_be_alloca) | |
3575 | do_pending_stack_adjust (); | |
3576 | ||
3577 | if (arg->value == arg->stack) | |
7cc85421 | 3578 | { |
3579 | /* If the value is already in the stack slot, we are done. */ | |
3580 | if (flag_check_memory_usage && GET_CODE (arg->stack) == MEM) | |
3581 | { | |
3582 | if (arg->mode == BLKmode) | |
3583 | abort (); | |
3584 | ||
3585 | emit_library_call (chkr_set_right_libfunc, 1, VOIDmode, 3, | |
3586 | XEXP (arg->stack, 0), ptr_mode, | |
3587 | GEN_INT (GET_MODE_SIZE (arg->mode)), | |
3588 | TYPE_MODE (sizetype), | |
ad87de1e | 3589 | GEN_INT (MEMORY_USE_RW), |
3590 | TYPE_MODE (integer_type_node)); | |
7cc85421 | 3591 | } |
3592 | } | |
1c0c37a5 | 3593 | else if (arg->mode != BLKmode) |
66d433c7 | 3594 | { |
3595 | register int size; | |
3596 | ||
3597 | /* Argument is a scalar, not entirely passed in registers. | |
3598 | (If part is passed in registers, arg->partial says how much | |
3599 | and emit_push_insn will take care of putting it there.) | |
3600 | ||
3601 | Push it, and if its size is less than the | |
3602 | amount of space allocated to it, | |
3603 | also bump stack pointer by the additional space. | |
3604 | Note that in C the default argument promotions | |
3605 | will prevent such mismatches. */ | |
3606 | ||
1c0c37a5 | 3607 | size = GET_MODE_SIZE (arg->mode); |
66d433c7 | 3608 | /* Compute how much space the push instruction will push. |
3609 | On many machines, pushing a byte will advance the stack | |
3610 | pointer by a halfword. */ | |
3611 | #ifdef PUSH_ROUNDING | |
3612 | size = PUSH_ROUNDING (size); | |
3613 | #endif | |
3614 | used = size; | |
3615 | ||
3616 | /* Compute how much space the argument should get: | |
3617 | round up to a multiple of the alignment for arguments. */ | |
1c0c37a5 | 3618 | if (none != FUNCTION_ARG_PADDING (arg->mode, TREE_TYPE (pval))) |
66d433c7 | 3619 | used = (((size + PARM_BOUNDARY / BITS_PER_UNIT - 1) |
3620 | / (PARM_BOUNDARY / BITS_PER_UNIT)) | |
3621 | * (PARM_BOUNDARY / BITS_PER_UNIT)); | |
3622 | ||
3623 | /* This isn't already where we want it on the stack, so put it there. | |
3624 | This can either be done with push or copy insns. */ | |
1a49e3d2 | 3625 | emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), NULL_RTX, |
3626 | 0, partial, reg, used - size, | |
3627 | argblock, ARGS_SIZE_RTX (arg->offset)); | |
66d433c7 | 3628 | } |
3629 | else | |
3630 | { | |
3631 | /* BLKmode, at least partly to be pushed. */ | |
3632 | ||
3633 | register int excess; | |
3634 | rtx size_rtx; | |
3635 | ||
3636 | /* Pushing a nonscalar. | |
3637 | If part is passed in registers, PARTIAL says how much | |
3638 | and emit_push_insn will take care of putting it there. */ | |
3639 | ||
3640 | /* Round its size up to a multiple | |
3641 | of the allocation unit for arguments. */ | |
3642 | ||
3643 | if (arg->size.var != 0) | |
3644 | { | |
3645 | excess = 0; | |
3646 | size_rtx = ARGS_SIZE_RTX (arg->size); | |
3647 | } | |
3648 | else | |
3649 | { | |
66d433c7 | 3650 | /* PUSH_ROUNDING has no effect on us, because |
3651 | emit_push_insn for BLKmode is careful to avoid it. */ | |
662c3b26 | 3652 | excess = (arg->size.constant - int_size_in_bytes (TREE_TYPE (pval)) |
66d433c7 | 3653 | + partial * UNITS_PER_WORD); |
f326cf41 | 3654 | size_rtx = expr_size (pval); |
66d433c7 | 3655 | } |
3656 | ||
1c0c37a5 | 3657 | emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), size_rtx, |
66d433c7 | 3658 | TYPE_ALIGN (TREE_TYPE (pval)) / BITS_PER_UNIT, partial, |
3659 | reg, excess, argblock, ARGS_SIZE_RTX (arg->offset)); | |
3660 | } | |
3661 | ||
3662 | ||
3663 | /* Unless this is a partially-in-register argument, the argument is now | |
3664 | in the stack. | |
3665 | ||
3666 | ??? Note that this can change arg->value from arg->stack to | |
3667 | arg->stack_slot and it matters when they are not the same. | |
3668 | It isn't totally clear that this is correct in all cases. */ | |
3669 | if (partial == 0) | |
3670 | arg->value = arg->stack_slot; | |
3671 | ||
3672 | /* Once we have pushed something, pops can't safely | |
3673 | be deferred during the rest of the arguments. */ | |
3674 | NO_DEFER_POP; | |
3675 | ||
3676 | /* ANSI doesn't require a sequence point here, | |
3677 | but PCC has one, so this will avoid some problems. */ | |
3678 | emit_queue (); | |
3679 | ||
148b08de | 3680 | /* Free any temporary slots made in processing this argument. Show |
3681 | that we might have taken the address of something and pushed that | |
3682 | as an operand. */ | |
3683 | preserve_temp_slots (NULL_RTX); | |
66d433c7 | 3684 | free_temp_slots (); |
1b117c60 | 3685 | pop_temp_slots (); |
66d433c7 | 3686 | |
3687 | #ifdef ACCUMULATE_OUTGOING_ARGS | |
3688 | /* Now mark the segment we just used. */ | |
3689 | if (argblock && ! variable_size && arg->stack) | |
3690 | for (i = lower_bound; i < upper_bound; i++) | |
3691 | stack_usage_map[i] = 1; | |
3692 | #endif | |
3693 | } |