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