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