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