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