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