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