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