]>
Commit | Line | Data |
---|---|---|
6f086dfc | 1 | /* Expands front end tree to back end RTL for GNU C-Compiler |
af841dbd JL |
2 | Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997, |
3 | 1998, 1999, 2000 Free Software Foundation, Inc. | |
6f086dfc RS |
4 | |
5 | This file is part of GNU CC. | |
6 | ||
7 | GNU CC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2, or (at your option) | |
10 | any later version. | |
11 | ||
12 | GNU CC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU CC; see the file COPYING. If not, write to | |
a35311b0 RK |
19 | the Free Software Foundation, 59 Temple Place - Suite 330, |
20 | Boston, MA 02111-1307, USA. */ | |
6f086dfc | 21 | |
6f086dfc RS |
22 | /* This file handles the generation of rtl code from tree structure |
23 | at the level of the function as a whole. | |
24 | It creates the rtl expressions for parameters and auto variables | |
25 | and has full responsibility for allocating stack slots. | |
26 | ||
27 | `expand_function_start' is called at the beginning of a function, | |
28 | before the function body is parsed, and `expand_function_end' is | |
29 | called after parsing the body. | |
30 | ||
31 | Call `assign_stack_local' to allocate a stack slot for a local variable. | |
32 | This is usually done during the RTL generation for the function body, | |
33 | but it can also be done in the reload pass when a pseudo-register does | |
34 | not get a hard register. | |
35 | ||
36 | Call `put_var_into_stack' when you learn, belatedly, that a variable | |
37 | previously given a pseudo-register must in fact go in the stack. | |
38 | This function changes the DECL_RTL to be a stack slot instead of a reg | |
39 | then scans all the RTL instructions so far generated to correct them. */ | |
40 | ||
41 | #include "config.h" | |
670ee920 | 42 | #include "system.h" |
6f086dfc RS |
43 | #include "rtl.h" |
44 | #include "tree.h" | |
45 | #include "flags.h" | |
1ef08c63 | 46 | #include "except.h" |
6f086dfc RS |
47 | #include "function.h" |
48 | #include "insn-flags.h" | |
49 | #include "expr.h" | |
50 | #include "insn-codes.h" | |
51 | #include "regs.h" | |
52 | #include "hard-reg-set.h" | |
53 | #include "insn-config.h" | |
54 | #include "recog.h" | |
55 | #include "output.h" | |
bdac5f58 | 56 | #include "basic-block.h" |
c20bf1f3 | 57 | #include "obstack.h" |
10f0ad3d | 58 | #include "toplev.h" |
fe9b4957 | 59 | #include "hash.h" |
87ff9c8e | 60 | #include "ggc.h" |
b1474bb7 | 61 | #include "tm_p.h" |
6f086dfc | 62 | |
f73ad30e JH |
63 | #ifndef ACCUMULATE_OUTGOING_ARGS |
64 | #define ACCUMULATE_OUTGOING_ARGS 0 | |
65 | #endif | |
66 | ||
189cc377 RK |
67 | #ifndef TRAMPOLINE_ALIGNMENT |
68 | #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY | |
69 | #endif | |
70 | ||
d16790f2 JW |
71 | #ifndef LOCAL_ALIGNMENT |
72 | #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT | |
73 | #endif | |
74 | ||
a0871656 JH |
75 | #if !defined (PREFERRED_STACK_BOUNDARY) && defined (STACK_BOUNDARY) |
76 | #define PREFERRED_STACK_BOUNDARY STACK_BOUNDARY | |
77 | #endif | |
78 | ||
293e3de4 RS |
79 | /* Some systems use __main in a way incompatible with its use in gcc, in these |
80 | cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to | |
81 | give the same symbol without quotes for an alternative entry point. You | |
0f41302f | 82 | must define both, or neither. */ |
293e3de4 RS |
83 | #ifndef NAME__MAIN |
84 | #define NAME__MAIN "__main" | |
85 | #define SYMBOL__MAIN __main | |
86 | #endif | |
87 | ||
6f086dfc RS |
88 | /* Round a value to the lowest integer less than it that is a multiple of |
89 | the required alignment. Avoid using division in case the value is | |
90 | negative. Assume the alignment is a power of two. */ | |
91 | #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1)) | |
92 | ||
93 | /* Similar, but round to the next highest integer that meets the | |
94 | alignment. */ | |
95 | #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1)) | |
96 | ||
97 | /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp | |
98 | during rtl generation. If they are different register numbers, this is | |
99 | always true. It may also be true if | |
100 | FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl | |
101 | generation. See fix_lexical_addr for details. */ | |
102 | ||
103 | #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM | |
104 | #define NEED_SEPARATE_AP | |
105 | #endif | |
106 | ||
54ff41b7 JW |
107 | /* Nonzero if function being compiled doesn't contain any calls |
108 | (ignoring the prologue and epilogue). This is set prior to | |
109 | local register allocation and is valid for the remaining | |
718fe406 | 110 | compiler passes. */ |
54ff41b7 JW |
111 | int current_function_is_leaf; |
112 | ||
fb13d4d0 JM |
113 | /* Nonzero if function being compiled doesn't contain any instructions |
114 | that can throw an exception. This is set prior to final. */ | |
115 | ||
116 | int current_function_nothrow; | |
117 | ||
fdb8a883 JW |
118 | /* Nonzero if function being compiled doesn't modify the stack pointer |
119 | (ignoring the prologue and epilogue). This is only valid after | |
718fe406 | 120 | life_analysis has run. */ |
fdb8a883 JW |
121 | int current_function_sp_is_unchanging; |
122 | ||
54ff41b7 JW |
123 | /* Nonzero if the function being compiled is a leaf function which only |
124 | uses leaf registers. This is valid after reload (specifically after | |
125 | sched2) and is useful only if the port defines LEAF_REGISTERS. */ | |
54ff41b7 JW |
126 | int current_function_uses_only_leaf_regs; |
127 | ||
6f086dfc RS |
128 | /* Nonzero once virtual register instantiation has been done. |
129 | assign_stack_local uses frame_pointer_rtx when this is nonzero. */ | |
130 | static int virtuals_instantiated; | |
131 | ||
46766466 RS |
132 | /* These variables hold pointers to functions to |
133 | save and restore machine-specific data, | |
134 | in push_function_context and pop_function_context. */ | |
711d877c KG |
135 | void (*init_machine_status) PARAMS ((struct function *)); |
136 | void (*save_machine_status) PARAMS ((struct function *)); | |
137 | void (*restore_machine_status) PARAMS ((struct function *)); | |
138 | void (*mark_machine_status) PARAMS ((struct function *)); | |
139 | void (*free_machine_status) PARAMS ((struct function *)); | |
46766466 | 140 | |
8c5666b4 | 141 | /* Likewise, but for language-specific data. */ |
711d877c KG |
142 | void (*init_lang_status) PARAMS ((struct function *)); |
143 | void (*save_lang_status) PARAMS ((struct function *)); | |
144 | void (*restore_lang_status) PARAMS ((struct function *)); | |
145 | void (*mark_lang_status) PARAMS ((struct function *)); | |
146 | void (*free_lang_status) PARAMS ((struct function *)); | |
8c5666b4 | 147 | |
49ad7cfa BS |
148 | /* The FUNCTION_DECL for an inline function currently being expanded. */ |
149 | tree inline_function_decl; | |
b384405b BS |
150 | |
151 | /* The currently compiled function. */ | |
01d939e8 | 152 | struct function *cfun = 0; |
b384405b BS |
153 | |
154 | /* Global list of all compiled functions. */ | |
155 | struct function *all_functions = 0; | |
5c7675e9 RH |
156 | |
157 | /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */ | |
0a1c58a2 JL |
158 | static varray_type prologue; |
159 | static varray_type epilogue; | |
160 | ||
161 | /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue | |
162 | in this function. */ | |
163 | static varray_type sibcall_epilogue; | |
6f086dfc RS |
164 | \f |
165 | /* In order to evaluate some expressions, such as function calls returning | |
166 | structures in memory, we need to temporarily allocate stack locations. | |
167 | We record each allocated temporary in the following structure. | |
168 | ||
169 | Associated with each temporary slot is a nesting level. When we pop up | |
170 | one level, all temporaries associated with the previous level are freed. | |
171 | Normally, all temporaries are freed after the execution of the statement | |
172 | in which they were created. However, if we are inside a ({...}) grouping, | |
173 | the result may be in a temporary and hence must be preserved. If the | |
174 | result could be in a temporary, we preserve it if we can determine which | |
175 | one it is in. If we cannot determine which temporary may contain the | |
176 | result, all temporaries are preserved. A temporary is preserved by | |
177 | pretending it was allocated at the previous nesting level. | |
178 | ||
179 | Automatic variables are also assigned temporary slots, at the nesting | |
180 | level where they are defined. They are marked a "kept" so that | |
181 | free_temp_slots will not free them. */ | |
182 | ||
183 | struct temp_slot | |
184 | { | |
185 | /* Points to next temporary slot. */ | |
186 | struct temp_slot *next; | |
0f41302f | 187 | /* The rtx to used to reference the slot. */ |
6f086dfc | 188 | rtx slot; |
e5e76139 RK |
189 | /* The rtx used to represent the address if not the address of the |
190 | slot above. May be an EXPR_LIST if multiple addresses exist. */ | |
191 | rtx address; | |
718fe406 | 192 | /* The alignment (in bits) of the slot. */ |
d16790f2 | 193 | int align; |
6f086dfc | 194 | /* The size, in units, of the slot. */ |
e5e809f4 | 195 | HOST_WIDE_INT size; |
a4c6502a MM |
196 | /* The alias set for the slot. If the alias set is zero, we don't |
197 | know anything about the alias set of the slot. We must only | |
198 | reuse a slot if it is assigned an object of the same alias set. | |
199 | Otherwise, the rest of the compiler may assume that the new use | |
200 | of the slot cannot alias the old use of the slot, which is | |
201 | false. If the slot has alias set zero, then we can't reuse the | |
202 | slot at all, since we have no idea what alias set may have been | |
203 | imposed on the memory. For example, if the stack slot is the | |
204 | call frame for an inline functioned, we have no idea what alias | |
205 | sets will be assigned to various pieces of the call frame. */ | |
3bdf5ad1 | 206 | HOST_WIDE_INT alias_set; |
e7a84011 RK |
207 | /* The value of `sequence_rtl_expr' when this temporary is allocated. */ |
208 | tree rtl_expr; | |
6f086dfc RS |
209 | /* Non-zero if this temporary is currently in use. */ |
210 | char in_use; | |
a25d4ba2 RK |
211 | /* Non-zero if this temporary has its address taken. */ |
212 | char addr_taken; | |
6f086dfc RS |
213 | /* Nesting level at which this slot is being used. */ |
214 | int level; | |
215 | /* Non-zero if this should survive a call to free_temp_slots. */ | |
216 | int keep; | |
fc91b0d0 RK |
217 | /* The offset of the slot from the frame_pointer, including extra space |
218 | for alignment. This info is for combine_temp_slots. */ | |
e5e809f4 | 219 | HOST_WIDE_INT base_offset; |
fc91b0d0 RK |
220 | /* The size of the slot, including extra space for alignment. This |
221 | info is for combine_temp_slots. */ | |
e5e809f4 | 222 | HOST_WIDE_INT full_size; |
6f086dfc | 223 | }; |
6f086dfc | 224 | \f |
e15679f8 RK |
225 | /* This structure is used to record MEMs or pseudos used to replace VAR, any |
226 | SUBREGs of VAR, and any MEMs containing VAR as an address. We need to | |
227 | maintain this list in case two operands of an insn were required to match; | |
228 | in that case we must ensure we use the same replacement. */ | |
229 | ||
230 | struct fixup_replacement | |
231 | { | |
232 | rtx old; | |
233 | rtx new; | |
234 | struct fixup_replacement *next; | |
235 | }; | |
718fe406 | 236 | |
fe9b4957 MM |
237 | struct insns_for_mem_entry { |
238 | /* The KEY in HE will be a MEM. */ | |
239 | struct hash_entry he; | |
240 | /* These are the INSNS which reference the MEM. */ | |
241 | rtx insns; | |
242 | }; | |
243 | ||
e15679f8 RK |
244 | /* Forward declarations. */ |
245 | ||
711d877c KG |
246 | static rtx assign_stack_local_1 PARAMS ((enum machine_mode, HOST_WIDE_INT, |
247 | int, struct function *)); | |
248 | static rtx assign_stack_temp_for_type PARAMS ((enum machine_mode, | |
249 | HOST_WIDE_INT, int, tree)); | |
250 | static struct temp_slot *find_temp_slot_from_address PARAMS ((rtx)); | |
251 | static void put_reg_into_stack PARAMS ((struct function *, rtx, tree, | |
252 | enum machine_mode, enum machine_mode, | |
770ae6cc RK |
253 | int, unsigned int, int, |
254 | struct hash_table *)); | |
018577e4 R |
255 | static void schedule_fixup_var_refs PARAMS ((struct function *, rtx, tree, |
256 | enum machine_mode, | |
257 | struct hash_table *)); | |
718fe406 | 258 | static void fixup_var_refs PARAMS ((rtx, enum machine_mode, int, |
711d877c | 259 | struct hash_table *)); |
e15679f8 | 260 | static struct fixup_replacement |
711d877c KG |
261 | *find_fixup_replacement PARAMS ((struct fixup_replacement **, rtx)); |
262 | static void fixup_var_refs_insns PARAMS ((rtx, enum machine_mode, int, | |
263 | rtx, int, struct hash_table *)); | |
264 | static void fixup_var_refs_1 PARAMS ((rtx, enum machine_mode, rtx *, rtx, | |
265 | struct fixup_replacement **)); | |
266 | static rtx fixup_memory_subreg PARAMS ((rtx, rtx, int)); | |
267 | static rtx walk_fixup_memory_subreg PARAMS ((rtx, rtx, int)); | |
268 | static rtx fixup_stack_1 PARAMS ((rtx, rtx)); | |
269 | static void optimize_bit_field PARAMS ((rtx, rtx, rtx *)); | |
270 | static void instantiate_decls PARAMS ((tree, int)); | |
271 | static void instantiate_decls_1 PARAMS ((tree, int)); | |
770ae6cc | 272 | static void instantiate_decl PARAMS ((rtx, HOST_WIDE_INT, int)); |
711d877c KG |
273 | static int instantiate_virtual_regs_1 PARAMS ((rtx *, rtx, int)); |
274 | static void delete_handlers PARAMS ((void)); | |
275 | static void pad_to_arg_alignment PARAMS ((struct args_size *, int, | |
276 | struct args_size *)); | |
51723711 | 277 | #ifndef ARGS_GROW_DOWNWARD |
711d877c KG |
278 | static void pad_below PARAMS ((struct args_size *, enum machine_mode, |
279 | tree)); | |
51723711 | 280 | #endif |
711d877c | 281 | static rtx round_trampoline_addr PARAMS ((rtx)); |
0a1c58a2 JL |
282 | static tree *identify_blocks_1 PARAMS ((rtx, tree *, tree *, tree *)); |
283 | static void reorder_blocks_1 PARAMS ((rtx, tree, varray_type *)); | |
711d877c KG |
284 | static tree blocks_nreverse PARAMS ((tree)); |
285 | static int all_blocks PARAMS ((tree, tree *)); | |
18c038b9 | 286 | static tree *get_block_vector PARAMS ((tree, int *)); |
ec97b83a KG |
287 | /* We always define `record_insns' even if its not used so that we |
288 | can always export `prologue_epilogue_contains'. */ | |
0a1c58a2 JL |
289 | static void record_insns PARAMS ((rtx, varray_type *)) ATTRIBUTE_UNUSED; |
290 | static int contains PARAMS ((rtx, varray_type)); | |
73ef99fb | 291 | #ifdef HAVE_return |
86c82654 | 292 | static void emit_return_into_block PARAMS ((basic_block, rtx)); |
73ef99fb | 293 | #endif |
711d877c | 294 | static void put_addressof_into_stack PARAMS ((rtx, struct hash_table *)); |
718fe406 | 295 | static boolean purge_addressof_1 PARAMS ((rtx *, rtx, int, int, |
711d877c | 296 | struct hash_table *)); |
7393c642 RK |
297 | #ifdef HAVE_epilogue |
298 | static void keep_stack_depressed PARAMS ((rtx)); | |
299 | #endif | |
711d877c KG |
300 | static int is_addressof PARAMS ((rtx *, void *)); |
301 | static struct hash_entry *insns_for_mem_newfunc PARAMS ((struct hash_entry *, | |
302 | struct hash_table *, | |
303 | hash_table_key)); | |
304 | static unsigned long insns_for_mem_hash PARAMS ((hash_table_key)); | |
305 | static boolean insns_for_mem_comp PARAMS ((hash_table_key, hash_table_key)); | |
306 | static int insns_for_mem_walk PARAMS ((rtx *, void *)); | |
307 | static void compute_insns_for_mem PARAMS ((rtx, rtx, struct hash_table *)); | |
308 | static void mark_temp_slot PARAMS ((struct temp_slot *)); | |
309 | static void mark_function_status PARAMS ((struct function *)); | |
310 | static void mark_function_chain PARAMS ((void *)); | |
311 | static void prepare_function_start PARAMS ((void)); | |
c13fde05 RH |
312 | static void do_clobber_return_reg PARAMS ((rtx, void *)); |
313 | static void do_use_return_reg PARAMS ((rtx, void *)); | |
c20bf1f3 | 314 | \f |
6f086dfc RS |
315 | /* Pointer to chain of `struct function' for containing functions. */ |
316 | struct function *outer_function_chain; | |
317 | ||
318 | /* Given a function decl for a containing function, | |
319 | return the `struct function' for it. */ | |
320 | ||
321 | struct function * | |
322 | find_function_data (decl) | |
323 | tree decl; | |
324 | { | |
325 | struct function *p; | |
e5e809f4 | 326 | |
6f086dfc RS |
327 | for (p = outer_function_chain; p; p = p->next) |
328 | if (p->decl == decl) | |
329 | return p; | |
e5e809f4 | 330 | |
6f086dfc RS |
331 | abort (); |
332 | } | |
333 | ||
334 | /* Save the current context for compilation of a nested function. | |
8c5666b4 BS |
335 | This is called from language-specific code. The caller should use |
336 | the save_lang_status callback to save any language-specific state, | |
337 | since this function knows only about language-independent | |
338 | variables. */ | |
6f086dfc RS |
339 | |
340 | void | |
a0dabda5 JM |
341 | push_function_context_to (context) |
342 | tree context; | |
6f086dfc | 343 | { |
36edd3cc BS |
344 | struct function *p, *context_data; |
345 | ||
346 | if (context) | |
347 | { | |
348 | context_data = (context == current_function_decl | |
01d939e8 | 349 | ? cfun |
36edd3cc BS |
350 | : find_function_data (context)); |
351 | context_data->contains_functions = 1; | |
352 | } | |
b384405b | 353 | |
01d939e8 | 354 | if (cfun == 0) |
b384405b | 355 | init_dummy_function_start (); |
01d939e8 | 356 | p = cfun; |
6f086dfc RS |
357 | |
358 | p->next = outer_function_chain; | |
359 | outer_function_chain = p; | |
6f086dfc RS |
360 | p->fixup_var_refs_queue = 0; |
361 | ||
36edd3cc | 362 | save_tree_status (p); |
8c5666b4 BS |
363 | if (save_lang_status) |
364 | (*save_lang_status) (p); | |
46766466 RS |
365 | if (save_machine_status) |
366 | (*save_machine_status) (p); | |
b384405b | 367 | |
01d939e8 | 368 | cfun = 0; |
6f086dfc RS |
369 | } |
370 | ||
e4a4639e JM |
371 | void |
372 | push_function_context () | |
373 | { | |
a0dabda5 | 374 | push_function_context_to (current_function_decl); |
e4a4639e JM |
375 | } |
376 | ||
6f086dfc RS |
377 | /* Restore the last saved context, at the end of a nested function. |
378 | This function is called from language-specific code. */ | |
379 | ||
380 | void | |
a0dabda5 | 381 | pop_function_context_from (context) |
ca3075bd | 382 | tree context ATTRIBUTE_UNUSED; |
6f086dfc RS |
383 | { |
384 | struct function *p = outer_function_chain; | |
e5e809f4 | 385 | struct var_refs_queue *queue; |
a3770a81 | 386 | struct var_refs_queue *next; |
6f086dfc | 387 | |
01d939e8 | 388 | cfun = p; |
6f086dfc RS |
389 | outer_function_chain = p->next; |
390 | ||
6f086dfc | 391 | current_function_decl = p->decl; |
7cbc7b0c | 392 | reg_renumber = 0; |
6f086dfc | 393 | |
36edd3cc | 394 | restore_tree_status (p); |
6f086dfc | 395 | restore_emit_status (p); |
6f086dfc | 396 | |
46766466 RS |
397 | if (restore_machine_status) |
398 | (*restore_machine_status) (p); | |
8c5666b4 BS |
399 | if (restore_lang_status) |
400 | (*restore_lang_status) (p); | |
46766466 | 401 | |
6f086dfc RS |
402 | /* Finish doing put_var_into_stack for any of our variables |
403 | which became addressable during the nested function. */ | |
a3770a81 RH |
404 | for (queue = p->fixup_var_refs_queue; queue; queue = next) |
405 | { | |
406 | next = queue->next; | |
407 | fixup_var_refs (queue->modified, queue->promoted_mode, | |
408 | queue->unsignedp, 0); | |
409 | free (queue); | |
410 | } | |
411 | p->fixup_var_refs_queue = 0; | |
6f086dfc | 412 | |
6f086dfc RS |
413 | /* Reset variables that have known state during rtx generation. */ |
414 | rtx_equal_function_value_matters = 1; | |
415 | virtuals_instantiated = 0; | |
1b3d8f8a | 416 | generating_concat_p = 1; |
6f086dfc | 417 | } |
e4a4639e | 418 | |
36edd3cc BS |
419 | void |
420 | pop_function_context () | |
e4a4639e | 421 | { |
a0dabda5 | 422 | pop_function_context_from (current_function_decl); |
e4a4639e | 423 | } |
e2ecd91c | 424 | |
fa51b01b RH |
425 | /* Clear out all parts of the state in F that can safely be discarded |
426 | after the function has been parsed, but not compiled, to let | |
427 | garbage collection reclaim the memory. */ | |
428 | ||
429 | void | |
430 | free_after_parsing (f) | |
431 | struct function *f; | |
432 | { | |
433 | /* f->expr->forced_labels is used by code generation. */ | |
434 | /* f->emit->regno_reg_rtx is used by code generation. */ | |
435 | /* f->varasm is used by code generation. */ | |
436 | /* f->eh->eh_return_stub_label is used by code generation. */ | |
437 | ||
438 | if (free_lang_status) | |
439 | (*free_lang_status) (f); | |
440 | free_stmt_status (f); | |
441 | } | |
442 | ||
e2ecd91c BS |
443 | /* Clear out all parts of the state in F that can safely be discarded |
444 | after the function has been compiled, to let garbage collection | |
0a8a198c | 445 | reclaim the memory. */ |
21cd906e | 446 | |
e2ecd91c | 447 | void |
0a8a198c | 448 | free_after_compilation (f) |
e2ecd91c BS |
449 | struct function *f; |
450 | { | |
bedda2da MM |
451 | struct temp_slot *ts; |
452 | struct temp_slot *next; | |
453 | ||
fa51b01b RH |
454 | free_eh_status (f); |
455 | free_expr_status (f); | |
0a8a198c MM |
456 | free_emit_status (f); |
457 | free_varasm_status (f); | |
e2ecd91c | 458 | |
fa51b01b RH |
459 | if (free_machine_status) |
460 | (*free_machine_status) (f); | |
461 | ||
5faf03ae MM |
462 | if (f->x_parm_reg_stack_loc) |
463 | free (f->x_parm_reg_stack_loc); | |
fa51b01b | 464 | |
bedda2da MM |
465 | for (ts = f->x_temp_slots; ts; ts = next) |
466 | { | |
467 | next = ts->next; | |
468 | free (ts); | |
469 | } | |
470 | f->x_temp_slots = NULL; | |
471 | ||
fa51b01b RH |
472 | f->arg_offset_rtx = NULL; |
473 | f->return_rtx = NULL; | |
474 | f->internal_arg_pointer = NULL; | |
475 | f->x_nonlocal_labels = NULL; | |
476 | f->x_nonlocal_goto_handler_slots = NULL; | |
477 | f->x_nonlocal_goto_handler_labels = NULL; | |
478 | f->x_nonlocal_goto_stack_level = NULL; | |
479 | f->x_cleanup_label = NULL; | |
480 | f->x_return_label = NULL; | |
481 | f->x_save_expr_regs = NULL; | |
482 | f->x_stack_slot_list = NULL; | |
483 | f->x_rtl_expr_chain = NULL; | |
484 | f->x_tail_recursion_label = NULL; | |
485 | f->x_tail_recursion_reentry = NULL; | |
486 | f->x_arg_pointer_save_area = NULL; | |
487 | f->x_context_display = NULL; | |
488 | f->x_trampoline_list = NULL; | |
489 | f->x_parm_birth_insn = NULL; | |
490 | f->x_last_parm_insn = NULL; | |
491 | f->x_parm_reg_stack_loc = NULL; | |
fa51b01b RH |
492 | f->fixup_var_refs_queue = NULL; |
493 | f->original_arg_vector = NULL; | |
494 | f->original_decl_initial = NULL; | |
495 | f->inl_last_parm_insn = NULL; | |
496 | f->epilogue_delay_list = NULL; | |
e2ecd91c | 497 | } |
6f086dfc RS |
498 | \f |
499 | /* Allocate fixed slots in the stack frame of the current function. */ | |
500 | ||
49ad7cfa BS |
501 | /* Return size needed for stack frame based on slots so far allocated in |
502 | function F. | |
c795bca9 | 503 | This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY; |
6f086dfc RS |
504 | the caller may have to do that. */ |
505 | ||
8af5168b | 506 | HOST_WIDE_INT |
49ad7cfa BS |
507 | get_func_frame_size (f) |
508 | struct function *f; | |
6f086dfc RS |
509 | { |
510 | #ifdef FRAME_GROWS_DOWNWARD | |
49ad7cfa | 511 | return -f->x_frame_offset; |
6f086dfc | 512 | #else |
49ad7cfa | 513 | return f->x_frame_offset; |
6f086dfc RS |
514 | #endif |
515 | } | |
516 | ||
49ad7cfa BS |
517 | /* Return size needed for stack frame based on slots so far allocated. |
518 | This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY; | |
519 | the caller may have to do that. */ | |
520 | HOST_WIDE_INT | |
521 | get_frame_size () | |
522 | { | |
01d939e8 | 523 | return get_func_frame_size (cfun); |
49ad7cfa BS |
524 | } |
525 | ||
6f086dfc RS |
526 | /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it |
527 | with machine mode MODE. | |
718fe406 | 528 | |
6f086dfc RS |
529 | ALIGN controls the amount of alignment for the address of the slot: |
530 | 0 means according to MODE, | |
531 | -1 means use BIGGEST_ALIGNMENT and round size to multiple of that, | |
532 | positive specifies alignment boundary in bits. | |
533 | ||
e2ecd91c | 534 | We do not round to stack_boundary here. |
6f086dfc | 535 | |
e2ecd91c BS |
536 | FUNCTION specifies the function to allocate in. */ |
537 | ||
538 | static rtx | |
539 | assign_stack_local_1 (mode, size, align, function) | |
6f086dfc | 540 | enum machine_mode mode; |
e5e809f4 | 541 | HOST_WIDE_INT size; |
6f086dfc | 542 | int align; |
e2ecd91c | 543 | struct function *function; |
6f086dfc RS |
544 | { |
545 | register rtx x, addr; | |
546 | int bigend_correction = 0; | |
547 | int alignment; | |
548 | ||
e2ecd91c BS |
549 | /* Allocate in the memory associated with the function in whose frame |
550 | we are assigning. */ | |
01d939e8 | 551 | if (function != cfun) |
e2ecd91c BS |
552 | push_obstacks (function->function_obstack, |
553 | function->function_maybepermanent_obstack); | |
554 | ||
6f086dfc RS |
555 | if (align == 0) |
556 | { | |
d16790f2 JW |
557 | tree type; |
558 | ||
6f086dfc | 559 | if (mode == BLKmode) |
d16790f2 | 560 | alignment = BIGGEST_ALIGNMENT; |
dbab7b72 | 561 | else |
718fe406 | 562 | alignment = GET_MODE_ALIGNMENT (mode); |
d16790f2 JW |
563 | |
564 | /* Allow the target to (possibly) increase the alignment of this | |
565 | stack slot. */ | |
566 | type = type_for_mode (mode, 0); | |
567 | if (type) | |
568 | alignment = LOCAL_ALIGNMENT (type, alignment); | |
569 | ||
570 | alignment /= BITS_PER_UNIT; | |
6f086dfc RS |
571 | } |
572 | else if (align == -1) | |
573 | { | |
574 | alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT; | |
575 | size = CEIL_ROUND (size, alignment); | |
576 | } | |
577 | else | |
578 | alignment = align / BITS_PER_UNIT; | |
579 | ||
1474e303 | 580 | #ifdef FRAME_GROWS_DOWNWARD |
e2ecd91c | 581 | function->x_frame_offset -= size; |
1474e303 JL |
582 | #endif |
583 | ||
a0871656 JH |
584 | /* Ignore alignment we can't do with expected alignment of the boundary. */ |
585 | if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY) | |
586 | alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT; | |
587 | ||
588 | if (function->stack_alignment_needed < alignment * BITS_PER_UNIT) | |
589 | function->stack_alignment_needed = alignment * BITS_PER_UNIT; | |
590 | ||
6f086dfc RS |
591 | /* Round frame offset to that alignment. |
592 | We must be careful here, since FRAME_OFFSET might be negative and | |
593 | division with a negative dividend isn't as well defined as we might | |
594 | like. So we instead assume that ALIGNMENT is a power of two and | |
595 | use logical operations which are unambiguous. */ | |
596 | #ifdef FRAME_GROWS_DOWNWARD | |
e2ecd91c | 597 | function->x_frame_offset = FLOOR_ROUND (function->x_frame_offset, alignment); |
6f086dfc | 598 | #else |
e2ecd91c | 599 | function->x_frame_offset = CEIL_ROUND (function->x_frame_offset, alignment); |
6f086dfc RS |
600 | #endif |
601 | ||
602 | /* On a big-endian machine, if we are allocating more space than we will use, | |
603 | use the least significant bytes of those that are allocated. */ | |
f76b9db2 | 604 | if (BYTES_BIG_ENDIAN && mode != BLKmode) |
6f086dfc | 605 | bigend_correction = size - GET_MODE_SIZE (mode); |
6f086dfc | 606 | |
6f086dfc RS |
607 | /* If we have already instantiated virtual registers, return the actual |
608 | address relative to the frame pointer. */ | |
01d939e8 | 609 | if (function == cfun && virtuals_instantiated) |
6f086dfc RS |
610 | addr = plus_constant (frame_pointer_rtx, |
611 | (frame_offset + bigend_correction | |
612 | + STARTING_FRAME_OFFSET)); | |
613 | else | |
614 | addr = plus_constant (virtual_stack_vars_rtx, | |
3b71623b | 615 | function->x_frame_offset + bigend_correction); |
6f086dfc RS |
616 | |
617 | #ifndef FRAME_GROWS_DOWNWARD | |
e2ecd91c | 618 | function->x_frame_offset += size; |
6f086dfc RS |
619 | #endif |
620 | ||
38a448ca | 621 | x = gen_rtx_MEM (mode, addr); |
6f086dfc | 622 | |
e2ecd91c BS |
623 | function->x_stack_slot_list |
624 | = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list); | |
625 | ||
01d939e8 | 626 | if (function != cfun) |
e2ecd91c | 627 | pop_obstacks (); |
6f086dfc RS |
628 | |
629 | return x; | |
630 | } | |
631 | ||
e2ecd91c BS |
632 | /* Wrapper around assign_stack_local_1; assign a local stack slot for the |
633 | current function. */ | |
3bdf5ad1 | 634 | |
e2ecd91c BS |
635 | rtx |
636 | assign_stack_local (mode, size, align) | |
6f086dfc | 637 | enum machine_mode mode; |
e5e809f4 | 638 | HOST_WIDE_INT size; |
6f086dfc | 639 | int align; |
6f086dfc | 640 | { |
01d939e8 | 641 | return assign_stack_local_1 (mode, size, align, cfun); |
6f086dfc RS |
642 | } |
643 | \f | |
644 | /* Allocate a temporary stack slot and record it for possible later | |
645 | reuse. | |
646 | ||
647 | MODE is the machine mode to be given to the returned rtx. | |
648 | ||
649 | SIZE is the size in units of the space required. We do no rounding here | |
650 | since assign_stack_local will do any required rounding. | |
651 | ||
d93d4205 MS |
652 | KEEP is 1 if this slot is to be retained after a call to |
653 | free_temp_slots. Automatic variables for a block are allocated | |
e5e809f4 JL |
654 | with this flag. KEEP is 2 if we allocate a longer term temporary, |
655 | whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3 | |
656 | if we are to allocate something at an inner level to be treated as | |
718fe406 | 657 | a variable in the block (e.g., a SAVE_EXPR). |
a4c6502a MM |
658 | |
659 | TYPE is the type that will be used for the stack slot. */ | |
6f086dfc | 660 | |
d16790f2 JW |
661 | static rtx |
662 | assign_stack_temp_for_type (mode, size, keep, type) | |
6f086dfc | 663 | enum machine_mode mode; |
e5e809f4 | 664 | HOST_WIDE_INT size; |
6f086dfc | 665 | int keep; |
d16790f2 | 666 | tree type; |
6f086dfc | 667 | { |
d16790f2 | 668 | int align; |
3bdf5ad1 | 669 | HOST_WIDE_INT alias_set; |
6f086dfc RS |
670 | struct temp_slot *p, *best_p = 0; |
671 | ||
303ec2aa RK |
672 | /* If SIZE is -1 it means that somebody tried to allocate a temporary |
673 | of a variable size. */ | |
674 | if (size == -1) | |
675 | abort (); | |
676 | ||
a4c6502a MM |
677 | /* If we know the alias set for the memory that will be used, use |
678 | it. If there's no TYPE, then we don't know anything about the | |
679 | alias set for the memory. */ | |
680 | if (type) | |
681 | alias_set = get_alias_set (type); | |
718fe406 | 682 | else |
a4c6502a MM |
683 | alias_set = 0; |
684 | ||
d16790f2 JW |
685 | if (mode == BLKmode) |
686 | align = BIGGEST_ALIGNMENT; | |
dbab7b72 JH |
687 | else |
688 | align = GET_MODE_ALIGNMENT (mode); | |
6f086dfc | 689 | |
d16790f2 JW |
690 | if (! type) |
691 | type = type_for_mode (mode, 0); | |
3bdf5ad1 | 692 | |
d16790f2 JW |
693 | if (type) |
694 | align = LOCAL_ALIGNMENT (type, align); | |
695 | ||
696 | /* Try to find an available, already-allocated temporary of the proper | |
697 | mode which meets the size and alignment requirements. Choose the | |
698 | smallest one with the closest alignment. */ | |
699 | for (p = temp_slots; p; p = p->next) | |
700 | if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode | |
701 | && ! p->in_use | |
3bdf5ad1 | 702 | && (! flag_strict_aliasing |
a4c6502a | 703 | || (alias_set && p->alias_set == alias_set)) |
d16790f2 JW |
704 | && (best_p == 0 || best_p->size > p->size |
705 | || (best_p->size == p->size && best_p->align > p->align))) | |
706 | { | |
707 | if (p->align == align && p->size == size) | |
708 | { | |
709 | best_p = 0; | |
710 | break; | |
711 | } | |
6f086dfc | 712 | best_p = p; |
d16790f2 | 713 | } |
6f086dfc RS |
714 | |
715 | /* Make our best, if any, the one to use. */ | |
716 | if (best_p) | |
a45035b6 JW |
717 | { |
718 | /* If there are enough aligned bytes left over, make them into a new | |
719 | temp_slot so that the extra bytes don't get wasted. Do this only | |
720 | for BLKmode slots, so that we can be sure of the alignment. */ | |
3bdf5ad1 | 721 | if (GET_MODE (best_p->slot) == BLKmode) |
a45035b6 | 722 | { |
d16790f2 | 723 | int alignment = best_p->align / BITS_PER_UNIT; |
e5e809f4 | 724 | HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment); |
a45035b6 JW |
725 | |
726 | if (best_p->size - rounded_size >= alignment) | |
727 | { | |
bedda2da | 728 | p = (struct temp_slot *) xmalloc (sizeof (struct temp_slot)); |
a25d4ba2 | 729 | p->in_use = p->addr_taken = 0; |
a45035b6 | 730 | p->size = best_p->size - rounded_size; |
307d8cd6 RK |
731 | p->base_offset = best_p->base_offset + rounded_size; |
732 | p->full_size = best_p->full_size - rounded_size; | |
38a448ca RH |
733 | p->slot = gen_rtx_MEM (BLKmode, |
734 | plus_constant (XEXP (best_p->slot, 0), | |
735 | rounded_size)); | |
d16790f2 | 736 | p->align = best_p->align; |
e5e76139 | 737 | p->address = 0; |
591ccf92 | 738 | p->rtl_expr = 0; |
3bdf5ad1 | 739 | p->alias_set = best_p->alias_set; |
a45035b6 JW |
740 | p->next = temp_slots; |
741 | temp_slots = p; | |
742 | ||
38a448ca RH |
743 | stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot, |
744 | stack_slot_list); | |
a45035b6 JW |
745 | |
746 | best_p->size = rounded_size; | |
291dde90 | 747 | best_p->full_size = rounded_size; |
a45035b6 JW |
748 | } |
749 | } | |
750 | ||
751 | p = best_p; | |
752 | } | |
718fe406 | 753 | |
6f086dfc RS |
754 | /* If we still didn't find one, make a new temporary. */ |
755 | if (p == 0) | |
756 | { | |
e5e809f4 JL |
757 | HOST_WIDE_INT frame_offset_old = frame_offset; |
758 | ||
bedda2da | 759 | p = (struct temp_slot *) xmalloc (sizeof (struct temp_slot)); |
e5e809f4 | 760 | |
c87a0a39 JL |
761 | /* We are passing an explicit alignment request to assign_stack_local. |
762 | One side effect of that is assign_stack_local will not round SIZE | |
763 | to ensure the frame offset remains suitably aligned. | |
764 | ||
765 | So for requests which depended on the rounding of SIZE, we go ahead | |
766 | and round it now. We also make sure ALIGNMENT is at least | |
767 | BIGGEST_ALIGNMENT. */ | |
010529e5 | 768 | if (mode == BLKmode && align < BIGGEST_ALIGNMENT) |
6f67a30d JW |
769 | abort(); |
770 | p->slot = assign_stack_local (mode, | |
010529e5 AS |
771 | (mode == BLKmode |
772 | ? CEIL_ROUND (size, align / BITS_PER_UNIT) | |
773 | : size), | |
6f67a30d | 774 | align); |
d16790f2 JW |
775 | |
776 | p->align = align; | |
a4c6502a | 777 | p->alias_set = alias_set; |
e5e809f4 | 778 | |
b2a80c0d DE |
779 | /* The following slot size computation is necessary because we don't |
780 | know the actual size of the temporary slot until assign_stack_local | |
781 | has performed all the frame alignment and size rounding for the | |
fc91b0d0 RK |
782 | requested temporary. Note that extra space added for alignment |
783 | can be either above or below this stack slot depending on which | |
784 | way the frame grows. We include the extra space if and only if it | |
785 | is above this slot. */ | |
b2a80c0d DE |
786 | #ifdef FRAME_GROWS_DOWNWARD |
787 | p->size = frame_offset_old - frame_offset; | |
788 | #else | |
fc91b0d0 RK |
789 | p->size = size; |
790 | #endif | |
e5e809f4 | 791 | |
fc91b0d0 RK |
792 | /* Now define the fields used by combine_temp_slots. */ |
793 | #ifdef FRAME_GROWS_DOWNWARD | |
794 | p->base_offset = frame_offset; | |
795 | p->full_size = frame_offset_old - frame_offset; | |
796 | #else | |
797 | p->base_offset = frame_offset_old; | |
798 | p->full_size = frame_offset - frame_offset_old; | |
b2a80c0d | 799 | #endif |
e5e76139 | 800 | p->address = 0; |
6f086dfc RS |
801 | p->next = temp_slots; |
802 | temp_slots = p; | |
803 | } | |
804 | ||
805 | p->in_use = 1; | |
a25d4ba2 | 806 | p->addr_taken = 0; |
591ccf92 | 807 | p->rtl_expr = seq_rtl_expr; |
a25d4ba2 | 808 | |
d93d4205 MS |
809 | if (keep == 2) |
810 | { | |
811 | p->level = target_temp_slot_level; | |
812 | p->keep = 0; | |
813 | } | |
e5e809f4 JL |
814 | else if (keep == 3) |
815 | { | |
816 | p->level = var_temp_slot_level; | |
817 | p->keep = 0; | |
818 | } | |
d93d4205 MS |
819 | else |
820 | { | |
821 | p->level = temp_slot_level; | |
822 | p->keep = keep; | |
823 | } | |
1995f267 RK |
824 | |
825 | /* We may be reusing an old slot, so clear any MEM flags that may have been | |
826 | set from before. */ | |
827 | RTX_UNCHANGING_P (p->slot) = 0; | |
828 | MEM_IN_STRUCT_P (p->slot) = 0; | |
c6df88cb | 829 | MEM_SCALAR_P (p->slot) = 0; |
3bdf5ad1 RK |
830 | MEM_ALIAS_SET (p->slot) = alias_set; |
831 | ||
832 | if (type != 0) | |
833 | MEM_SET_IN_STRUCT_P (p->slot, AGGREGATE_TYPE_P (type)); | |
834 | ||
6f086dfc RS |
835 | return p->slot; |
836 | } | |
d16790f2 JW |
837 | |
838 | /* Allocate a temporary stack slot and record it for possible later | |
839 | reuse. First three arguments are same as in preceding function. */ | |
840 | ||
841 | rtx | |
842 | assign_stack_temp (mode, size, keep) | |
843 | enum machine_mode mode; | |
844 | HOST_WIDE_INT size; | |
845 | int keep; | |
846 | { | |
847 | return assign_stack_temp_for_type (mode, size, keep, NULL_TREE); | |
848 | } | |
638141a6 | 849 | \f |
230f21b4 PB |
850 | /* Assign a temporary of given TYPE. |
851 | KEEP is as for assign_stack_temp. | |
852 | MEMORY_REQUIRED is 1 if the result must be addressable stack memory; | |
b55d9ff8 RK |
853 | it is 0 if a register is OK. |
854 | DONT_PROMOTE is 1 if we should not promote values in register | |
855 | to wider modes. */ | |
230f21b4 PB |
856 | |
857 | rtx | |
b55d9ff8 | 858 | assign_temp (type, keep, memory_required, dont_promote) |
230f21b4 PB |
859 | tree type; |
860 | int keep; | |
861 | int memory_required; | |
0ce8a59c | 862 | int dont_promote ATTRIBUTE_UNUSED; |
230f21b4 PB |
863 | { |
864 | enum machine_mode mode = TYPE_MODE (type); | |
0ce8a59c | 865 | #ifndef PROMOTE_FOR_CALL_ONLY |
638141a6 | 866 | int unsignedp = TREE_UNSIGNED (type); |
0ce8a59c | 867 | #endif |
638141a6 | 868 | |
230f21b4 PB |
869 | if (mode == BLKmode || memory_required) |
870 | { | |
e5e809f4 | 871 | HOST_WIDE_INT size = int_size_in_bytes (type); |
230f21b4 PB |
872 | rtx tmp; |
873 | ||
44affdae JH |
874 | /* Zero sized arrays are GNU C extension. Set size to 1 to avoid |
875 | problems with allocating the stack space. */ | |
876 | if (size == 0) | |
877 | size = 1; | |
878 | ||
230f21b4 PB |
879 | /* Unfortunately, we don't yet know how to allocate variable-sized |
880 | temporaries. However, sometimes we have a fixed upper limit on | |
881 | the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that | |
0f41302f | 882 | instead. This is the case for Chill variable-sized strings. */ |
230f21b4 PB |
883 | if (size == -1 && TREE_CODE (type) == ARRAY_TYPE |
884 | && TYPE_ARRAY_MAX_SIZE (type) != NULL_TREE | |
3bdf5ad1 RK |
885 | && host_integerp (TYPE_ARRAY_MAX_SIZE (type), 1)) |
886 | size = tree_low_cst (TYPE_ARRAY_MAX_SIZE (type), 1); | |
230f21b4 | 887 | |
d16790f2 | 888 | tmp = assign_stack_temp_for_type (mode, size, keep, type); |
230f21b4 PB |
889 | return tmp; |
890 | } | |
638141a6 | 891 | |
230f21b4 | 892 | #ifndef PROMOTE_FOR_CALL_ONLY |
b55d9ff8 RK |
893 | if (! dont_promote) |
894 | mode = promote_mode (type, mode, &unsignedp, 0); | |
230f21b4 | 895 | #endif |
638141a6 | 896 | |
230f21b4 PB |
897 | return gen_reg_rtx (mode); |
898 | } | |
638141a6 | 899 | \f |
a45035b6 JW |
900 | /* Combine temporary stack slots which are adjacent on the stack. |
901 | ||
902 | This allows for better use of already allocated stack space. This is only | |
903 | done for BLKmode slots because we can be sure that we won't have alignment | |
904 | problems in this case. */ | |
905 | ||
906 | void | |
907 | combine_temp_slots () | |
908 | { | |
909 | struct temp_slot *p, *q; | |
910 | struct temp_slot *prev_p, *prev_q; | |
e5e809f4 JL |
911 | int num_slots; |
912 | ||
a4c6502a MM |
913 | /* We can't combine slots, because the information about which slot |
914 | is in which alias set will be lost. */ | |
915 | if (flag_strict_aliasing) | |
916 | return; | |
917 | ||
718fe406 | 918 | /* If there are a lot of temp slots, don't do anything unless |
e5e809f4 JL |
919 | high levels of optimizaton. */ |
920 | if (! flag_expensive_optimizations) | |
921 | for (p = temp_slots, num_slots = 0; p; p = p->next, num_slots++) | |
922 | if (num_slots > 100 || (num_slots > 10 && optimize == 0)) | |
923 | return; | |
a45035b6 | 924 | |
e9b7093a RS |
925 | for (p = temp_slots, prev_p = 0; p; p = prev_p ? prev_p->next : temp_slots) |
926 | { | |
927 | int delete_p = 0; | |
e5e809f4 | 928 | |
e9b7093a RS |
929 | if (! p->in_use && GET_MODE (p->slot) == BLKmode) |
930 | for (q = p->next, prev_q = p; q; q = prev_q->next) | |
a45035b6 | 931 | { |
e9b7093a RS |
932 | int delete_q = 0; |
933 | if (! q->in_use && GET_MODE (q->slot) == BLKmode) | |
a45035b6 | 934 | { |
fc91b0d0 | 935 | if (p->base_offset + p->full_size == q->base_offset) |
e9b7093a RS |
936 | { |
937 | /* Q comes after P; combine Q into P. */ | |
938 | p->size += q->size; | |
307d8cd6 | 939 | p->full_size += q->full_size; |
e9b7093a RS |
940 | delete_q = 1; |
941 | } | |
fc91b0d0 | 942 | else if (q->base_offset + q->full_size == p->base_offset) |
e9b7093a RS |
943 | { |
944 | /* P comes after Q; combine P into Q. */ | |
945 | q->size += p->size; | |
307d8cd6 | 946 | q->full_size += p->full_size; |
e9b7093a RS |
947 | delete_p = 1; |
948 | break; | |
949 | } | |
a45035b6 | 950 | } |
e9b7093a RS |
951 | /* Either delete Q or advance past it. */ |
952 | if (delete_q) | |
bedda2da MM |
953 | { |
954 | prev_q->next = q->next; | |
955 | free (q); | |
956 | } | |
e9b7093a RS |
957 | else |
958 | prev_q = q; | |
a45035b6 | 959 | } |
e9b7093a RS |
960 | /* Either delete P or advance past it. */ |
961 | if (delete_p) | |
962 | { | |
963 | if (prev_p) | |
964 | prev_p->next = p->next; | |
965 | else | |
966 | temp_slots = p->next; | |
967 | } | |
968 | else | |
969 | prev_p = p; | |
970 | } | |
a45035b6 | 971 | } |
6f086dfc | 972 | \f |
e5e76139 RK |
973 | /* Find the temp slot corresponding to the object at address X. */ |
974 | ||
975 | static struct temp_slot * | |
976 | find_temp_slot_from_address (x) | |
977 | rtx x; | |
978 | { | |
979 | struct temp_slot *p; | |
980 | rtx next; | |
981 | ||
982 | for (p = temp_slots; p; p = p->next) | |
983 | { | |
984 | if (! p->in_use) | |
985 | continue; | |
e5e809f4 | 986 | |
e5e76139 | 987 | else if (XEXP (p->slot, 0) == x |
abb52246 RK |
988 | || p->address == x |
989 | || (GET_CODE (x) == PLUS | |
990 | && XEXP (x, 0) == virtual_stack_vars_rtx | |
991 | && GET_CODE (XEXP (x, 1)) == CONST_INT | |
992 | && INTVAL (XEXP (x, 1)) >= p->base_offset | |
993 | && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size)) | |
e5e76139 RK |
994 | return p; |
995 | ||
996 | else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST) | |
997 | for (next = p->address; next; next = XEXP (next, 1)) | |
998 | if (XEXP (next, 0) == x) | |
999 | return p; | |
1000 | } | |
1001 | ||
14a774a9 RK |
1002 | /* If we have a sum involving a register, see if it points to a temp |
1003 | slot. */ | |
1004 | if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 0)) == REG | |
1005 | && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0) | |
1006 | return p; | |
1007 | else if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == REG | |
1008 | && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0) | |
1009 | return p; | |
1010 | ||
e5e76139 RK |
1011 | return 0; |
1012 | } | |
718fe406 | 1013 | |
9faa82d8 | 1014 | /* Indicate that NEW is an alternate way of referring to the temp slot |
e5e809f4 | 1015 | that previously was known by OLD. */ |
e5e76139 RK |
1016 | |
1017 | void | |
1018 | update_temp_slot_address (old, new) | |
1019 | rtx old, new; | |
1020 | { | |
14a774a9 | 1021 | struct temp_slot *p; |
e5e76139 | 1022 | |
14a774a9 | 1023 | if (rtx_equal_p (old, new)) |
e5e76139 | 1024 | return; |
14a774a9 RK |
1025 | |
1026 | p = find_temp_slot_from_address (old); | |
1027 | ||
700f19f0 RK |
1028 | /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW |
1029 | is a register, see if one operand of the PLUS is a temporary | |
1030 | location. If so, NEW points into it. Otherwise, if both OLD and | |
1031 | NEW are a PLUS and if there is a register in common between them. | |
1032 | If so, try a recursive call on those values. */ | |
14a774a9 RK |
1033 | if (p == 0) |
1034 | { | |
700f19f0 RK |
1035 | if (GET_CODE (old) != PLUS) |
1036 | return; | |
1037 | ||
1038 | if (GET_CODE (new) == REG) | |
1039 | { | |
1040 | update_temp_slot_address (XEXP (old, 0), new); | |
1041 | update_temp_slot_address (XEXP (old, 1), new); | |
1042 | return; | |
1043 | } | |
1044 | else if (GET_CODE (new) != PLUS) | |
14a774a9 RK |
1045 | return; |
1046 | ||
1047 | if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0))) | |
1048 | update_temp_slot_address (XEXP (old, 1), XEXP (new, 1)); | |
1049 | else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0))) | |
1050 | update_temp_slot_address (XEXP (old, 0), XEXP (new, 1)); | |
1051 | else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1))) | |
1052 | update_temp_slot_address (XEXP (old, 1), XEXP (new, 0)); | |
1053 | else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1))) | |
1054 | update_temp_slot_address (XEXP (old, 0), XEXP (new, 0)); | |
1055 | ||
1056 | return; | |
1057 | } | |
1058 | ||
718fe406 | 1059 | /* Otherwise add an alias for the temp's address. */ |
e5e76139 RK |
1060 | else if (p->address == 0) |
1061 | p->address = new; | |
1062 | else | |
1063 | { | |
1064 | if (GET_CODE (p->address) != EXPR_LIST) | |
38a448ca | 1065 | p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX); |
e5e76139 | 1066 | |
38a448ca | 1067 | p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address); |
e5e76139 RK |
1068 | } |
1069 | } | |
1070 | ||
a25d4ba2 | 1071 | /* If X could be a reference to a temporary slot, mark the fact that its |
9faa82d8 | 1072 | address was taken. */ |
a25d4ba2 RK |
1073 | |
1074 | void | |
1075 | mark_temp_addr_taken (x) | |
1076 | rtx x; | |
1077 | { | |
1078 | struct temp_slot *p; | |
1079 | ||
1080 | if (x == 0) | |
1081 | return; | |
1082 | ||
1083 | /* If X is not in memory or is at a constant address, it cannot be in | |
1084 | a temporary slot. */ | |
1085 | if (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0))) | |
1086 | return; | |
1087 | ||
1088 | p = find_temp_slot_from_address (XEXP (x, 0)); | |
1089 | if (p != 0) | |
1090 | p->addr_taken = 1; | |
1091 | } | |
1092 | ||
9cca6a99 MS |
1093 | /* If X could be a reference to a temporary slot, mark that slot as |
1094 | belonging to the to one level higher than the current level. If X | |
1095 | matched one of our slots, just mark that one. Otherwise, we can't | |
1096 | easily predict which it is, so upgrade all of them. Kept slots | |
1097 | need not be touched. | |
6f086dfc RS |
1098 | |
1099 | This is called when an ({...}) construct occurs and a statement | |
1100 | returns a value in memory. */ | |
1101 | ||
1102 | void | |
1103 | preserve_temp_slots (x) | |
1104 | rtx x; | |
1105 | { | |
a25d4ba2 | 1106 | struct temp_slot *p = 0; |
6f086dfc | 1107 | |
73620b82 RK |
1108 | /* If there is no result, we still might have some objects whose address |
1109 | were taken, so we need to make sure they stay around. */ | |
e3a77161 | 1110 | if (x == 0) |
73620b82 RK |
1111 | { |
1112 | for (p = temp_slots; p; p = p->next) | |
1113 | if (p->in_use && p->level == temp_slot_level && p->addr_taken) | |
1114 | p->level--; | |
1115 | ||
1116 | return; | |
1117 | } | |
e3a77161 RK |
1118 | |
1119 | /* If X is a register that is being used as a pointer, see if we have | |
1120 | a temporary slot we know it points to. To be consistent with | |
1121 | the code below, we really should preserve all non-kept slots | |
1122 | if we can't find a match, but that seems to be much too costly. */ | |
a25d4ba2 RK |
1123 | if (GET_CODE (x) == REG && REGNO_POINTER_FLAG (REGNO (x))) |
1124 | p = find_temp_slot_from_address (x); | |
1125 | ||
6f086dfc | 1126 | /* If X is not in memory or is at a constant address, it cannot be in |
e19571db RK |
1127 | a temporary slot, but it can contain something whose address was |
1128 | taken. */ | |
a25d4ba2 | 1129 | if (p == 0 && (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))) |
e19571db RK |
1130 | { |
1131 | for (p = temp_slots; p; p = p->next) | |
1132 | if (p->in_use && p->level == temp_slot_level && p->addr_taken) | |
1133 | p->level--; | |
1134 | ||
1135 | return; | |
1136 | } | |
6f086dfc RS |
1137 | |
1138 | /* First see if we can find a match. */ | |
73620b82 | 1139 | if (p == 0) |
a25d4ba2 RK |
1140 | p = find_temp_slot_from_address (XEXP (x, 0)); |
1141 | ||
e5e76139 RK |
1142 | if (p != 0) |
1143 | { | |
a25d4ba2 RK |
1144 | /* Move everything at our level whose address was taken to our new |
1145 | level in case we used its address. */ | |
1146 | struct temp_slot *q; | |
1147 | ||
9cca6a99 MS |
1148 | if (p->level == temp_slot_level) |
1149 | { | |
1150 | for (q = temp_slots; q; q = q->next) | |
1151 | if (q != p && q->addr_taken && q->level == p->level) | |
1152 | q->level--; | |
a25d4ba2 | 1153 | |
9cca6a99 MS |
1154 | p->level--; |
1155 | p->addr_taken = 0; | |
1156 | } | |
e5e76139 RK |
1157 | return; |
1158 | } | |
6f086dfc RS |
1159 | |
1160 | /* Otherwise, preserve all non-kept slots at this level. */ | |
1161 | for (p = temp_slots; p; p = p->next) | |
1162 | if (p->in_use && p->level == temp_slot_level && ! p->keep) | |
1163 | p->level--; | |
1164 | } | |
1165 | ||
591ccf92 MM |
1166 | /* X is the result of an RTL_EXPR. If it is a temporary slot associated |
1167 | with that RTL_EXPR, promote it into a temporary slot at the present | |
1168 | level so it will not be freed when we free slots made in the | |
1169 | RTL_EXPR. */ | |
1170 | ||
1171 | void | |
1172 | preserve_rtl_expr_result (x) | |
1173 | rtx x; | |
1174 | { | |
1175 | struct temp_slot *p; | |
1176 | ||
1177 | /* If X is not in memory or is at a constant address, it cannot be in | |
1178 | a temporary slot. */ | |
1179 | if (x == 0 || GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0))) | |
1180 | return; | |
1181 | ||
1182 | /* If we can find a match, move it to our level unless it is already at | |
1183 | an upper level. */ | |
1184 | p = find_temp_slot_from_address (XEXP (x, 0)); | |
64dc53f3 MM |
1185 | if (p != 0) |
1186 | { | |
1187 | p->level = MIN (p->level, temp_slot_level); | |
1188 | p->rtl_expr = 0; | |
1189 | } | |
591ccf92 MM |
1190 | |
1191 | return; | |
1192 | } | |
1193 | ||
6f086dfc | 1194 | /* Free all temporaries used so far. This is normally called at the end |
e7a84011 RK |
1195 | of generating code for a statement. Don't free any temporaries |
1196 | currently in use for an RTL_EXPR that hasn't yet been emitted. | |
1197 | We could eventually do better than this since it can be reused while | |
1198 | generating the same RTL_EXPR, but this is complex and probably not | |
1199 | worthwhile. */ | |
6f086dfc RS |
1200 | |
1201 | void | |
1202 | free_temp_slots () | |
1203 | { | |
1204 | struct temp_slot *p; | |
1205 | ||
1206 | for (p = temp_slots; p; p = p->next) | |
591ccf92 MM |
1207 | if (p->in_use && p->level == temp_slot_level && ! p->keep |
1208 | && p->rtl_expr == 0) | |
1209 | p->in_use = 0; | |
1210 | ||
1211 | combine_temp_slots (); | |
1212 | } | |
1213 | ||
1214 | /* Free all temporary slots used in T, an RTL_EXPR node. */ | |
1215 | ||
1216 | void | |
1217 | free_temps_for_rtl_expr (t) | |
1218 | tree t; | |
1219 | { | |
1220 | struct temp_slot *p; | |
1221 | ||
1222 | for (p = temp_slots; p; p = p->next) | |
1223 | if (p->rtl_expr == t) | |
64dc53f3 MM |
1224 | { |
1225 | /* If this slot is below the current TEMP_SLOT_LEVEL, then it | |
1226 | needs to be preserved. This can happen if a temporary in | |
1227 | the RTL_EXPR was addressed; preserve_temp_slots will move | |
1228 | the temporary into a higher level. */ | |
1229 | if (temp_slot_level <= p->level) | |
1230 | p->in_use = 0; | |
1231 | else | |
1232 | p->rtl_expr = NULL_TREE; | |
1233 | } | |
a45035b6 JW |
1234 | |
1235 | combine_temp_slots (); | |
6f086dfc RS |
1236 | } |
1237 | ||
956d6950 | 1238 | /* Mark all temporaries ever allocated in this function as not suitable |
a94e4054 RK |
1239 | for reuse until the current level is exited. */ |
1240 | ||
1241 | void | |
1242 | mark_all_temps_used () | |
1243 | { | |
1244 | struct temp_slot *p; | |
1245 | ||
1246 | for (p = temp_slots; p; p = p->next) | |
1247 | { | |
85b119d1 | 1248 | p->in_use = p->keep = 1; |
27ce006b | 1249 | p->level = MIN (p->level, temp_slot_level); |
a94e4054 RK |
1250 | } |
1251 | } | |
1252 | ||
6f086dfc RS |
1253 | /* Push deeper into the nesting level for stack temporaries. */ |
1254 | ||
1255 | void | |
1256 | push_temp_slots () | |
1257 | { | |
6f086dfc RS |
1258 | temp_slot_level++; |
1259 | } | |
1260 | ||
e5e809f4 JL |
1261 | /* Likewise, but save the new level as the place to allocate variables |
1262 | for blocks. */ | |
1263 | ||
ca3075bd | 1264 | #if 0 |
e5e809f4 JL |
1265 | void |
1266 | push_temp_slots_for_block () | |
1267 | { | |
1268 | push_temp_slots (); | |
1269 | ||
1270 | var_temp_slot_level = temp_slot_level; | |
1271 | } | |
1272 | ||
f5963e61 JL |
1273 | /* Likewise, but save the new level as the place to allocate temporaries |
1274 | for TARGET_EXPRs. */ | |
1275 | ||
1276 | void | |
1277 | push_temp_slots_for_target () | |
1278 | { | |
1279 | push_temp_slots (); | |
1280 | ||
1281 | target_temp_slot_level = temp_slot_level; | |
1282 | } | |
1283 | ||
1284 | /* Set and get the value of target_temp_slot_level. The only | |
1285 | permitted use of these functions is to save and restore this value. */ | |
1286 | ||
1287 | int | |
1288 | get_target_temp_slot_level () | |
1289 | { | |
1290 | return target_temp_slot_level; | |
1291 | } | |
1292 | ||
1293 | void | |
1294 | set_target_temp_slot_level (level) | |
1295 | int level; | |
1296 | { | |
1297 | target_temp_slot_level = level; | |
1298 | } | |
ca3075bd | 1299 | #endif |
f5963e61 | 1300 | |
6f086dfc RS |
1301 | /* Pop a temporary nesting level. All slots in use in the current level |
1302 | are freed. */ | |
1303 | ||
1304 | void | |
1305 | pop_temp_slots () | |
1306 | { | |
1307 | struct temp_slot *p; | |
1308 | ||
6f086dfc | 1309 | for (p = temp_slots; p; p = p->next) |
591ccf92 | 1310 | if (p->in_use && p->level == temp_slot_level && p->rtl_expr == 0) |
6f086dfc RS |
1311 | p->in_use = 0; |
1312 | ||
a45035b6 JW |
1313 | combine_temp_slots (); |
1314 | ||
6f086dfc RS |
1315 | temp_slot_level--; |
1316 | } | |
bc0ebdf9 RK |
1317 | |
1318 | /* Initialize temporary slots. */ | |
1319 | ||
1320 | void | |
1321 | init_temp_slots () | |
1322 | { | |
1323 | /* We have not allocated any temporaries yet. */ | |
1324 | temp_slots = 0; | |
1325 | temp_slot_level = 0; | |
e5e809f4 | 1326 | var_temp_slot_level = 0; |
bc0ebdf9 RK |
1327 | target_temp_slot_level = 0; |
1328 | } | |
6f086dfc RS |
1329 | \f |
1330 | /* Retroactively move an auto variable from a register to a stack slot. | |
1331 | This is done when an address-reference to the variable is seen. */ | |
1332 | ||
1333 | void | |
1334 | put_var_into_stack (decl) | |
1335 | tree decl; | |
1336 | { | |
1337 | register rtx reg; | |
00d8a4c1 | 1338 | enum machine_mode promoted_mode, decl_mode; |
6f086dfc | 1339 | struct function *function = 0; |
c20bf1f3 | 1340 | tree context; |
e9a25f70 | 1341 | int can_use_addressof; |
c357082f RK |
1342 | int volatilep = TREE_CODE (decl) != SAVE_EXPR && TREE_THIS_VOLATILE (decl); |
1343 | int usedp = (TREE_USED (decl) | |
1344 | || (TREE_CODE (decl) != SAVE_EXPR && DECL_INITIAL (decl) != 0)); | |
c20bf1f3 | 1345 | |
c20bf1f3 | 1346 | context = decl_function_context (decl); |
6f086dfc | 1347 | |
9ec36da5 | 1348 | /* Get the current rtl used for this object and its original mode. */ |
6f086dfc | 1349 | reg = TREE_CODE (decl) == SAVE_EXPR ? SAVE_EXPR_RTL (decl) : DECL_RTL (decl); |
2baccce2 RS |
1350 | |
1351 | /* No need to do anything if decl has no rtx yet | |
1352 | since in that case caller is setting TREE_ADDRESSABLE | |
1353 | and a stack slot will be assigned when the rtl is made. */ | |
1354 | if (reg == 0) | |
1355 | return; | |
00d8a4c1 RK |
1356 | |
1357 | /* Get the declared mode for this object. */ | |
1358 | decl_mode = (TREE_CODE (decl) == SAVE_EXPR ? TYPE_MODE (TREE_TYPE (decl)) | |
1359 | : DECL_MODE (decl)); | |
2baccce2 RS |
1360 | /* Get the mode it's actually stored in. */ |
1361 | promoted_mode = GET_MODE (reg); | |
6f086dfc RS |
1362 | |
1363 | /* If this variable comes from an outer function, | |
1364 | find that function's saved context. */ | |
4ac74fb8 | 1365 | if (context != current_function_decl && context != inline_function_decl) |
6f086dfc RS |
1366 | for (function = outer_function_chain; function; function = function->next) |
1367 | if (function->decl == context) | |
1368 | break; | |
1369 | ||
6f086dfc RS |
1370 | /* If this is a variable-size object with a pseudo to address it, |
1371 | put that pseudo into the stack, if the var is nonlocal. */ | |
c357082f | 1372 | if (TREE_CODE (decl) != SAVE_EXPR && DECL_NONLOCAL (decl) |
6f086dfc RS |
1373 | && GET_CODE (reg) == MEM |
1374 | && GET_CODE (XEXP (reg, 0)) == REG | |
1375 | && REGNO (XEXP (reg, 0)) > LAST_VIRTUAL_REGISTER) | |
4cdb3e78 RS |
1376 | { |
1377 | reg = XEXP (reg, 0); | |
1378 | decl_mode = promoted_mode = GET_MODE (reg); | |
1379 | } | |
e15762df | 1380 | |
e9a25f70 JL |
1381 | can_use_addressof |
1382 | = (function == 0 | |
e5e809f4 | 1383 | && optimize > 0 |
e9a25f70 JL |
1384 | /* FIXME make it work for promoted modes too */ |
1385 | && decl_mode == promoted_mode | |
1386 | #ifdef NON_SAVING_SETJMP | |
1387 | && ! (NON_SAVING_SETJMP && current_function_calls_setjmp) | |
1388 | #endif | |
1389 | ); | |
1390 | ||
1391 | /* If we can't use ADDRESSOF, make sure we see through one we already | |
1392 | generated. */ | |
1393 | if (! can_use_addressof && GET_CODE (reg) == MEM | |
1394 | && GET_CODE (XEXP (reg, 0)) == ADDRESSOF) | |
1395 | reg = XEXP (XEXP (reg, 0), 0); | |
1396 | ||
293e3de4 RS |
1397 | /* Now we should have a value that resides in one or more pseudo regs. */ |
1398 | ||
1399 | if (GET_CODE (reg) == REG) | |
e9a25f70 JL |
1400 | { |
1401 | /* If this variable lives in the current function and we don't need | |
1402 | to put things in the stack for the sake of setjmp, try to keep it | |
1403 | in a register until we know we actually need the address. */ | |
1404 | if (can_use_addressof) | |
1405 | gen_mem_addressof (reg, decl); | |
1406 | else | |
c357082f RK |
1407 | put_reg_into_stack (function, reg, TREE_TYPE (decl), promoted_mode, |
1408 | decl_mode, volatilep, 0, usedp, 0); | |
e9a25f70 | 1409 | } |
293e3de4 RS |
1410 | else if (GET_CODE (reg) == CONCAT) |
1411 | { | |
1412 | /* A CONCAT contains two pseudos; put them both in the stack. | |
018577e4 R |
1413 | We do it so they end up consecutive. |
1414 | We fixup references to the parts only after we fixup references | |
1415 | to the whole CONCAT, lest we do double fixups for the latter | |
1416 | references. */ | |
293e3de4 | 1417 | enum machine_mode part_mode = GET_MODE (XEXP (reg, 0)); |
c3b247b4 | 1418 | tree part_type = type_for_mode (part_mode, 0); |
018577e4 R |
1419 | rtx lopart = XEXP (reg, 0); |
1420 | rtx hipart = XEXP (reg, 1); | |
4738c10d | 1421 | #ifdef FRAME_GROWS_DOWNWARD |
293e3de4 | 1422 | /* Since part 0 should have a lower address, do it second. */ |
018577e4 R |
1423 | put_reg_into_stack (function, hipart, part_type, part_mode, |
1424 | part_mode, volatilep, 0, 0, 0); | |
1425 | put_reg_into_stack (function, lopart, part_type, part_mode, | |
1426 | part_mode, volatilep, 0, 0, 0); | |
293e3de4 | 1427 | #else |
018577e4 R |
1428 | put_reg_into_stack (function, lopart, part_type, part_mode, |
1429 | part_mode, volatilep, 0, 0, 0); | |
1430 | put_reg_into_stack (function, hipart, part_type, part_mode, | |
1431 | part_mode, volatilep, 0, 0, 0); | |
293e3de4 RS |
1432 | #endif |
1433 | ||
1434 | /* Change the CONCAT into a combined MEM for both parts. */ | |
1435 | PUT_CODE (reg, MEM); | |
c357082f | 1436 | set_mem_attributes (reg, decl, 1); |
0006e95b | 1437 | |
293e3de4 RS |
1438 | /* The two parts are in memory order already. |
1439 | Use the lower parts address as ours. */ | |
1440 | XEXP (reg, 0) = XEXP (XEXP (reg, 0), 0); | |
1441 | /* Prevent sharing of rtl that might lose. */ | |
1442 | if (GET_CODE (XEXP (reg, 0)) == PLUS) | |
1443 | XEXP (reg, 0) = copy_rtx (XEXP (reg, 0)); | |
018577e4 R |
1444 | if (usedp) |
1445 | { | |
1446 | schedule_fixup_var_refs (function, reg, TREE_TYPE (decl), | |
1447 | promoted_mode, 0); | |
1448 | schedule_fixup_var_refs (function, lopart, part_type, part_mode, 0); | |
1449 | schedule_fixup_var_refs (function, hipart, part_type, part_mode, 0); | |
1450 | } | |
293e3de4 | 1451 | } |
86fa911a RK |
1452 | else |
1453 | return; | |
718fe406 | 1454 | |
7d384cc0 | 1455 | if (current_function_check_memory_usage) |
ebb1b59a BS |
1456 | emit_library_call (chkr_set_right_libfunc, LCT_CONST_MAKE_BLOCK, VOIDmode, |
1457 | 3, XEXP (reg, 0), Pmode, | |
86fa911a RK |
1458 | GEN_INT (GET_MODE_SIZE (GET_MODE (reg))), |
1459 | TYPE_MODE (sizetype), | |
956d6950 JL |
1460 | GEN_INT (MEMORY_USE_RW), |
1461 | TYPE_MODE (integer_type_node)); | |
293e3de4 RS |
1462 | } |
1463 | ||
1464 | /* Subroutine of put_var_into_stack. This puts a single pseudo reg REG | |
1465 | into the stack frame of FUNCTION (0 means the current function). | |
1466 | DECL_MODE is the machine mode of the user-level data type. | |
0006e95b | 1467 | PROMOTED_MODE is the machine mode of the register. |
e5e809f4 JL |
1468 | VOLATILE_P is nonzero if this is for a "volatile" decl. |
1469 | USED_P is nonzero if this reg might have already been used in an insn. */ | |
293e3de4 RS |
1470 | |
1471 | static void | |
e9a25f70 | 1472 | put_reg_into_stack (function, reg, type, promoted_mode, decl_mode, volatile_p, |
fe9b4957 | 1473 | original_regno, used_p, ht) |
293e3de4 RS |
1474 | struct function *function; |
1475 | rtx reg; | |
1476 | tree type; | |
1477 | enum machine_mode promoted_mode, decl_mode; | |
0006e95b | 1478 | int volatile_p; |
770ae6cc | 1479 | unsigned int original_regno; |
e5e809f4 | 1480 | int used_p; |
fe9b4957 | 1481 | struct hash_table *ht; |
293e3de4 | 1482 | { |
01d939e8 | 1483 | struct function *func = function ? function : cfun; |
293e3de4 | 1484 | rtx new = 0; |
770ae6cc | 1485 | unsigned int regno = original_regno; |
e9a25f70 JL |
1486 | |
1487 | if (regno == 0) | |
1488 | regno = REGNO (reg); | |
6f086dfc | 1489 | |
e2ecd91c BS |
1490 | if (regno < func->x_max_parm_reg) |
1491 | new = func->x_parm_reg_stack_loc[regno]; | |
770ae6cc | 1492 | |
e2ecd91c BS |
1493 | if (new == 0) |
1494 | new = assign_stack_local_1 (decl_mode, GET_MODE_SIZE (decl_mode), 0, func); | |
6f086dfc | 1495 | |
ef178af3 | 1496 | PUT_CODE (reg, MEM); |
0006e95b | 1497 | PUT_MODE (reg, decl_mode); |
6f086dfc RS |
1498 | XEXP (reg, 0) = XEXP (new, 0); |
1499 | /* `volatil' bit means one thing for MEMs, another entirely for REGs. */ | |
0006e95b | 1500 | MEM_VOLATILE_P (reg) = volatile_p; |
6f086dfc RS |
1501 | |
1502 | /* If this is a memory ref that contains aggregate components, | |
bdd3e6ab JW |
1503 | mark it as such for cse and loop optimize. If we are reusing a |
1504 | previously generated stack slot, then we need to copy the bit in | |
1505 | case it was set for other reasons. For instance, it is set for | |
1506 | __builtin_va_alist. */ | |
8b4944fb RH |
1507 | if (type) |
1508 | { | |
1509 | MEM_SET_IN_STRUCT_P (reg, | |
1510 | AGGREGATE_TYPE_P (type) || MEM_IN_STRUCT_P (new)); | |
1511 | MEM_ALIAS_SET (reg) = get_alias_set (type); | |
1512 | } | |
018577e4 R |
1513 | if (used_p) |
1514 | schedule_fixup_var_refs (function, reg, type, promoted_mode, ht); | |
1515 | } | |
6f086dfc | 1516 | |
018577e4 R |
1517 | /* Make sure that all refs to the variable, previously made |
1518 | when it was a register, are fixed up to be valid again. | |
1519 | See function above for meaning of arguments. */ | |
1520 | static void | |
1521 | schedule_fixup_var_refs (function, reg, type, promoted_mode, ht) | |
1522 | struct function *function; | |
1523 | rtx reg; | |
1524 | tree type; | |
1525 | enum machine_mode promoted_mode; | |
1526 | struct hash_table *ht; | |
1527 | { | |
8b4944fb RH |
1528 | int unsigned_p = type ? TREE_UNSIGNED (type) : 0; |
1529 | ||
018577e4 | 1530 | if (function != 0) |
6f086dfc RS |
1531 | { |
1532 | struct var_refs_queue *temp; | |
1533 | ||
6f086dfc | 1534 | temp |
a3770a81 | 1535 | = (struct var_refs_queue *) xmalloc (sizeof (struct var_refs_queue)); |
6f086dfc | 1536 | temp->modified = reg; |
00d8a4c1 | 1537 | temp->promoted_mode = promoted_mode; |
8b4944fb | 1538 | temp->unsignedp = unsigned_p; |
6f086dfc RS |
1539 | temp->next = function->fixup_var_refs_queue; |
1540 | function->fixup_var_refs_queue = temp; | |
6f086dfc | 1541 | } |
018577e4 | 1542 | else |
6f086dfc | 1543 | /* Variable is local; fix it up now. */ |
8b4944fb | 1544 | fixup_var_refs (reg, promoted_mode, unsigned_p, ht); |
6f086dfc RS |
1545 | } |
1546 | \f | |
1547 | static void | |
fe9b4957 | 1548 | fixup_var_refs (var, promoted_mode, unsignedp, ht) |
6f086dfc | 1549 | rtx var; |
00d8a4c1 RK |
1550 | enum machine_mode promoted_mode; |
1551 | int unsignedp; | |
fe9b4957 | 1552 | struct hash_table *ht; |
6f086dfc RS |
1553 | { |
1554 | tree pending; | |
1555 | rtx first_insn = get_insns (); | |
49ad7cfa | 1556 | struct sequence_stack *stack = seq_stack; |
6f086dfc | 1557 | tree rtl_exps = rtl_expr_chain; |
0a1c58a2 | 1558 | rtx insn; |
6f086dfc RS |
1559 | |
1560 | /* Must scan all insns for stack-refs that exceed the limit. */ | |
718fe406 | 1561 | fixup_var_refs_insns (var, promoted_mode, unsignedp, first_insn, |
fe9b4957 MM |
1562 | stack == 0, ht); |
1563 | /* If there's a hash table, it must record all uses of VAR. */ | |
1564 | if (ht) | |
1565 | return; | |
6f086dfc RS |
1566 | |
1567 | /* Scan all pending sequences too. */ | |
1568 | for (; stack; stack = stack->next) | |
1569 | { | |
1570 | push_to_sequence (stack->first); | |
00d8a4c1 | 1571 | fixup_var_refs_insns (var, promoted_mode, unsignedp, |
fe9b4957 | 1572 | stack->first, stack->next != 0, 0); |
6f086dfc RS |
1573 | /* Update remembered end of sequence |
1574 | in case we added an insn at the end. */ | |
1575 | stack->last = get_last_insn (); | |
1576 | end_sequence (); | |
1577 | } | |
1578 | ||
1579 | /* Scan all waiting RTL_EXPRs too. */ | |
1580 | for (pending = rtl_exps; pending; pending = TREE_CHAIN (pending)) | |
1581 | { | |
1582 | rtx seq = RTL_EXPR_SEQUENCE (TREE_VALUE (pending)); | |
1583 | if (seq != const0_rtx && seq != 0) | |
1584 | { | |
1585 | push_to_sequence (seq); | |
718fe406 | 1586 | fixup_var_refs_insns (var, promoted_mode, unsignedp, seq, 0, 0); |
6f086dfc RS |
1587 | end_sequence (); |
1588 | } | |
1589 | } | |
d33c2956 DB |
1590 | |
1591 | /* Scan the catch clauses for exception handling too. */ | |
c14f7160 | 1592 | push_to_full_sequence (catch_clauses, catch_clauses_last); |
718fe406 | 1593 | fixup_var_refs_insns (var, promoted_mode, unsignedp, catch_clauses, 0, 0); |
c14f7160 | 1594 | end_full_sequence (&catch_clauses, &catch_clauses_last); |
0a1c58a2 JL |
1595 | |
1596 | /* Scan sequences saved in CALL_PLACEHOLDERS too. */ | |
1597 | for (insn = first_insn; insn; insn = NEXT_INSN (insn)) | |
1598 | { | |
1599 | if (GET_CODE (insn) == CALL_INSN | |
1600 | && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER) | |
1601 | { | |
1602 | int i; | |
1603 | ||
1604 | /* Look at the Normal call, sibling call and tail recursion | |
1605 | sequences attached to the CALL_PLACEHOLDER. */ | |
1606 | for (i = 0; i < 3; i++) | |
1607 | { | |
1608 | rtx seq = XEXP (PATTERN (insn), i); | |
1609 | if (seq) | |
1610 | { | |
1611 | push_to_sequence (seq); | |
1612 | fixup_var_refs_insns (var, promoted_mode, unsignedp, | |
1613 | seq, 0, 0); | |
1614 | XEXP (PATTERN (insn), i) = get_insns (); | |
1615 | end_sequence (); | |
1616 | } | |
1617 | } | |
1618 | } | |
1619 | } | |
6f086dfc RS |
1620 | } |
1621 | \f | |
e15679f8 | 1622 | /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is |
6f086dfc | 1623 | some part of an insn. Return a struct fixup_replacement whose OLD |
0f41302f | 1624 | value is equal to X. Allocate a new structure if no such entry exists. */ |
6f086dfc RS |
1625 | |
1626 | static struct fixup_replacement * | |
2740a678 | 1627 | find_fixup_replacement (replacements, x) |
6f086dfc RS |
1628 | struct fixup_replacement **replacements; |
1629 | rtx x; | |
1630 | { | |
1631 | struct fixup_replacement *p; | |
1632 | ||
1633 | /* See if we have already replaced this. */ | |
c5c76735 | 1634 | for (p = *replacements; p != 0 && ! rtx_equal_p (p->old, x); p = p->next) |
6f086dfc RS |
1635 | ; |
1636 | ||
1637 | if (p == 0) | |
1638 | { | |
1639 | p = (struct fixup_replacement *) oballoc (sizeof (struct fixup_replacement)); | |
1640 | p->old = x; | |
1641 | p->new = 0; | |
1642 | p->next = *replacements; | |
1643 | *replacements = p; | |
1644 | } | |
1645 | ||
1646 | return p; | |
1647 | } | |
1648 | ||
1649 | /* Scan the insn-chain starting with INSN for refs to VAR | |
1650 | and fix them up. TOPLEVEL is nonzero if this chain is the | |
1651 | main chain of insns for the current function. */ | |
1652 | ||
1653 | static void | |
fe9b4957 | 1654 | fixup_var_refs_insns (var, promoted_mode, unsignedp, insn, toplevel, ht) |
6f086dfc | 1655 | rtx var; |
00d8a4c1 RK |
1656 | enum machine_mode promoted_mode; |
1657 | int unsignedp; | |
6f086dfc RS |
1658 | rtx insn; |
1659 | int toplevel; | |
fe9b4957 | 1660 | struct hash_table *ht; |
6f086dfc | 1661 | { |
02a10449 | 1662 | rtx call_dest = 0; |
07444f1d | 1663 | rtx insn_list = NULL_RTX; |
fe9b4957 MM |
1664 | |
1665 | /* If we already know which INSNs reference VAR there's no need | |
1666 | to walk the entire instruction chain. */ | |
1667 | if (ht) | |
1668 | { | |
718fe406 | 1669 | insn_list = ((struct insns_for_mem_entry *) |
fe9b4957 MM |
1670 | hash_lookup (ht, var, /*create=*/0, /*copy=*/0))->insns; |
1671 | insn = insn_list ? XEXP (insn_list, 0) : NULL_RTX; | |
1672 | insn_list = XEXP (insn_list, 1); | |
1673 | } | |
02a10449 | 1674 | |
6f086dfc RS |
1675 | while (insn) |
1676 | { | |
1677 | rtx next = NEXT_INSN (insn); | |
e5e809f4 | 1678 | rtx set, prev, prev_set; |
6f086dfc | 1679 | rtx note; |
e5e809f4 | 1680 | |
2c3c49de | 1681 | if (INSN_P (insn)) |
6f086dfc | 1682 | { |
ef178af3 ZW |
1683 | /* Remember the notes in case we delete the insn. */ |
1684 | note = REG_NOTES (insn); | |
1685 | ||
63770d6a RK |
1686 | /* If this is a CLOBBER of VAR, delete it. |
1687 | ||
1688 | If it has a REG_LIBCALL note, delete the REG_LIBCALL | |
1689 | and REG_RETVAL notes too. */ | |
718fe406 | 1690 | if (GET_CODE (PATTERN (insn)) == CLOBBER |
07362cb3 JW |
1691 | && (XEXP (PATTERN (insn), 0) == var |
1692 | || (GET_CODE (XEXP (PATTERN (insn), 0)) == CONCAT | |
1693 | && (XEXP (XEXP (PATTERN (insn), 0), 0) == var | |
1694 | || XEXP (XEXP (PATTERN (insn), 0), 1) == var)))) | |
63770d6a RK |
1695 | { |
1696 | if ((note = find_reg_note (insn, REG_LIBCALL, NULL_RTX)) != 0) | |
1697 | /* The REG_LIBCALL note will go away since we are going to | |
1698 | turn INSN into a NOTE, so just delete the | |
1699 | corresponding REG_RETVAL note. */ | |
1700 | remove_note (XEXP (note, 0), | |
1701 | find_reg_note (XEXP (note, 0), REG_RETVAL, | |
1702 | NULL_RTX)); | |
1703 | ||
1704 | /* In unoptimized compilation, we shouldn't call delete_insn | |
1705 | except in jump.c doing warnings. */ | |
1706 | PUT_CODE (insn, NOTE); | |
1707 | NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED; | |
1708 | NOTE_SOURCE_FILE (insn) = 0; | |
1709 | } | |
1710 | ||
6f086dfc | 1711 | /* The insn to load VAR from a home in the arglist |
e5e809f4 JL |
1712 | is now a no-op. When we see it, just delete it. |
1713 | Similarly if this is storing VAR from a register from which | |
1714 | it was loaded in the previous insn. This will occur | |
1715 | when an ADDRESSOF was made for an arglist slot. */ | |
63770d6a | 1716 | else if (toplevel |
e5e809f4 JL |
1717 | && (set = single_set (insn)) != 0 |
1718 | && SET_DEST (set) == var | |
63770d6a RK |
1719 | /* If this represents the result of an insn group, |
1720 | don't delete the insn. */ | |
1721 | && find_reg_note (insn, REG_RETVAL, NULL_RTX) == 0 | |
e5e809f4 JL |
1722 | && (rtx_equal_p (SET_SRC (set), var) |
1723 | || (GET_CODE (SET_SRC (set)) == REG | |
1724 | && (prev = prev_nonnote_insn (insn)) != 0 | |
1725 | && (prev_set = single_set (prev)) != 0 | |
1726 | && SET_DEST (prev_set) == SET_SRC (set) | |
1727 | && rtx_equal_p (SET_SRC (prev_set), var)))) | |
6f086dfc | 1728 | { |
b4ff474c RS |
1729 | /* In unoptimized compilation, we shouldn't call delete_insn |
1730 | except in jump.c doing warnings. */ | |
1731 | PUT_CODE (insn, NOTE); | |
1732 | NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED; | |
1733 | NOTE_SOURCE_FILE (insn) = 0; | |
6f086dfc RS |
1734 | if (insn == last_parm_insn) |
1735 | last_parm_insn = PREV_INSN (next); | |
1736 | } | |
1737 | else | |
1738 | { | |
02a10449 RK |
1739 | struct fixup_replacement *replacements = 0; |
1740 | rtx next_insn = NEXT_INSN (insn); | |
1741 | ||
e9a25f70 JL |
1742 | if (SMALL_REGISTER_CLASSES) |
1743 | { | |
1744 | /* If the insn that copies the results of a CALL_INSN | |
1745 | into a pseudo now references VAR, we have to use an | |
1746 | intermediate pseudo since we want the life of the | |
1747 | return value register to be only a single insn. | |
02a10449 | 1748 | |
e9a25f70 JL |
1749 | If we don't use an intermediate pseudo, such things as |
1750 | address computations to make the address of VAR valid | |
1751 | if it is not can be placed between the CALL_INSN and INSN. | |
02a10449 | 1752 | |
e9a25f70 JL |
1753 | To make sure this doesn't happen, we record the destination |
1754 | of the CALL_INSN and see if the next insn uses both that | |
1755 | and VAR. */ | |
02a10449 | 1756 | |
f95182a4 ILT |
1757 | if (call_dest != 0 && GET_CODE (insn) == INSN |
1758 | && reg_mentioned_p (var, PATTERN (insn)) | |
1759 | && reg_mentioned_p (call_dest, PATTERN (insn))) | |
1760 | { | |
1761 | rtx temp = gen_reg_rtx (GET_MODE (call_dest)); | |
02a10449 | 1762 | |
f95182a4 | 1763 | emit_insn_before (gen_move_insn (temp, call_dest), insn); |
02a10449 | 1764 | |
f95182a4 ILT |
1765 | PATTERN (insn) = replace_rtx (PATTERN (insn), |
1766 | call_dest, temp); | |
1767 | } | |
718fe406 | 1768 | |
f95182a4 ILT |
1769 | if (GET_CODE (insn) == CALL_INSN |
1770 | && GET_CODE (PATTERN (insn)) == SET) | |
1771 | call_dest = SET_DEST (PATTERN (insn)); | |
1772 | else if (GET_CODE (insn) == CALL_INSN | |
1773 | && GET_CODE (PATTERN (insn)) == PARALLEL | |
1774 | && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET) | |
1775 | call_dest = SET_DEST (XVECEXP (PATTERN (insn), 0, 0)); | |
1776 | else | |
1777 | call_dest = 0; | |
1778 | } | |
02a10449 | 1779 | |
6f086dfc RS |
1780 | /* See if we have to do anything to INSN now that VAR is in |
1781 | memory. If it needs to be loaded into a pseudo, use a single | |
1782 | pseudo for the entire insn in case there is a MATCH_DUP | |
1783 | between two operands. We pass a pointer to the head of | |
1784 | a list of struct fixup_replacements. If fixup_var_refs_1 | |
1785 | needs to allocate pseudos or replacement MEMs (for SUBREGs), | |
1786 | it will record them in this list. | |
718fe406 | 1787 | |
6f086dfc RS |
1788 | If it allocated a pseudo for any replacement, we copy into |
1789 | it here. */ | |
1790 | ||
00d8a4c1 RK |
1791 | fixup_var_refs_1 (var, promoted_mode, &PATTERN (insn), insn, |
1792 | &replacements); | |
6f086dfc | 1793 | |
77121fee JW |
1794 | /* If this is last_parm_insn, and any instructions were output |
1795 | after it to fix it up, then we must set last_parm_insn to | |
1796 | the last such instruction emitted. */ | |
1797 | if (insn == last_parm_insn) | |
1798 | last_parm_insn = PREV_INSN (next_insn); | |
1799 | ||
6f086dfc RS |
1800 | while (replacements) |
1801 | { | |
1802 | if (GET_CODE (replacements->new) == REG) | |
1803 | { | |
1804 | rtx insert_before; | |
00d8a4c1 | 1805 | rtx seq; |
6f086dfc RS |
1806 | |
1807 | /* OLD might be a (subreg (mem)). */ | |
1808 | if (GET_CODE (replacements->old) == SUBREG) | |
1809 | replacements->old | |
1810 | = fixup_memory_subreg (replacements->old, insn, 0); | |
1811 | else | |
1812 | replacements->old | |
1813 | = fixup_stack_1 (replacements->old, insn); | |
1814 | ||
5fa7422b | 1815 | insert_before = insn; |
6f086dfc | 1816 | |
00d8a4c1 RK |
1817 | /* If we are changing the mode, do a conversion. |
1818 | This might be wasteful, but combine.c will | |
1819 | eliminate much of the waste. */ | |
1820 | ||
1821 | if (GET_MODE (replacements->new) | |
1822 | != GET_MODE (replacements->old)) | |
1823 | { | |
1824 | start_sequence (); | |
1825 | convert_move (replacements->new, | |
1826 | replacements->old, unsignedp); | |
1827 | seq = gen_sequence (); | |
1828 | end_sequence (); | |
1829 | } | |
1830 | else | |
1831 | seq = gen_move_insn (replacements->new, | |
1832 | replacements->old); | |
1833 | ||
1834 | emit_insn_before (seq, insert_before); | |
6f086dfc RS |
1835 | } |
1836 | ||
1837 | replacements = replacements->next; | |
1838 | } | |
1839 | } | |
1840 | ||
1841 | /* Also fix up any invalid exprs in the REG_NOTES of this insn. | |
1842 | But don't touch other insns referred to by reg-notes; | |
1843 | we will get them elsewhere. */ | |
ef178af3 ZW |
1844 | while (note) |
1845 | { | |
1846 | if (GET_CODE (note) != INSN_LIST) | |
1847 | XEXP (note, 0) | |
1848 | = walk_fixup_memory_subreg (XEXP (note, 0), insn, 1); | |
718fe406 | 1849 | note = XEXP (note, 1); |
ef178af3 | 1850 | } |
6f086dfc | 1851 | } |
fe9b4957 MM |
1852 | |
1853 | if (!ht) | |
1854 | insn = next; | |
1855 | else if (insn_list) | |
1856 | { | |
1857 | insn = XEXP (insn_list, 0); | |
1858 | insn_list = XEXP (insn_list, 1); | |
1859 | } | |
1860 | else | |
1861 | insn = NULL_RTX; | |
6f086dfc RS |
1862 | } |
1863 | } | |
1864 | \f | |
00d8a4c1 | 1865 | /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE. |
718fe406 | 1866 | See if the rtx expression at *LOC in INSN needs to be changed. |
6f086dfc RS |
1867 | |
1868 | REPLACEMENTS is a pointer to a list head that starts out zero, but may | |
1869 | contain a list of original rtx's and replacements. If we find that we need | |
1870 | to modify this insn by replacing a memory reference with a pseudo or by | |
1871 | making a new MEM to implement a SUBREG, we consult that list to see if | |
1872 | we have already chosen a replacement. If none has already been allocated, | |
1873 | we allocate it and update the list. fixup_var_refs_insns will copy VAR | |
1874 | or the SUBREG, as appropriate, to the pseudo. */ | |
1875 | ||
1876 | static void | |
00d8a4c1 | 1877 | fixup_var_refs_1 (var, promoted_mode, loc, insn, replacements) |
6f086dfc | 1878 | register rtx var; |
00d8a4c1 | 1879 | enum machine_mode promoted_mode; |
6f086dfc RS |
1880 | register rtx *loc; |
1881 | rtx insn; | |
1882 | struct fixup_replacement **replacements; | |
1883 | { | |
1884 | register int i; | |
1885 | register rtx x = *loc; | |
1886 | RTX_CODE code = GET_CODE (x); | |
6f7d635c | 1887 | register const char *fmt; |
6f086dfc RS |
1888 | register rtx tem, tem1; |
1889 | struct fixup_replacement *replacement; | |
1890 | ||
1891 | switch (code) | |
1892 | { | |
e9a25f70 JL |
1893 | case ADDRESSOF: |
1894 | if (XEXP (x, 0) == var) | |
1895 | { | |
956d6950 JL |
1896 | /* Prevent sharing of rtl that might lose. */ |
1897 | rtx sub = copy_rtx (XEXP (var, 0)); | |
1898 | ||
956d6950 JL |
1899 | if (! validate_change (insn, loc, sub, 0)) |
1900 | { | |
5f98f7c4 RH |
1901 | rtx y = gen_reg_rtx (GET_MODE (sub)); |
1902 | rtx seq, new_insn; | |
1903 | ||
1904 | /* We should be able to replace with a register or all is lost. | |
1905 | Note that we can't use validate_change to verify this, since | |
1906 | we're not caring for replacing all dups simultaneously. */ | |
1907 | if (! validate_replace_rtx (*loc, y, insn)) | |
1908 | abort (); | |
1909 | ||
1910 | /* Careful! First try to recognize a direct move of the | |
1911 | value, mimicking how things are done in gen_reload wrt | |
1912 | PLUS. Consider what happens when insn is a conditional | |
1913 | move instruction and addsi3 clobbers flags. */ | |
1914 | ||
1915 | start_sequence (); | |
1916 | new_insn = emit_insn (gen_rtx_SET (VOIDmode, y, sub)); | |
1917 | seq = gen_sequence (); | |
1918 | end_sequence (); | |
1919 | ||
1920 | if (recog_memoized (new_insn) < 0) | |
1921 | { | |
1922 | /* That failed. Fall back on force_operand and hope. */ | |
956d6950 | 1923 | |
5f98f7c4 RH |
1924 | start_sequence (); |
1925 | force_operand (sub, y); | |
1926 | seq = gen_sequence (); | |
1927 | end_sequence (); | |
1928 | } | |
956d6950 | 1929 | |
5f98f7c4 RH |
1930 | #ifdef HAVE_cc0 |
1931 | /* Don't separate setter from user. */ | |
1932 | if (PREV_INSN (insn) && sets_cc0_p (PREV_INSN (insn))) | |
1933 | insn = PREV_INSN (insn); | |
1934 | #endif | |
1935 | ||
1936 | emit_insn_before (seq, insn); | |
1937 | } | |
e9a25f70 JL |
1938 | } |
1939 | return; | |
1940 | ||
6f086dfc RS |
1941 | case MEM: |
1942 | if (var == x) | |
1943 | { | |
718fe406 | 1944 | /* If we already have a replacement, use it. Otherwise, |
6f086dfc RS |
1945 | try to fix up this address in case it is invalid. */ |
1946 | ||
2740a678 | 1947 | replacement = find_fixup_replacement (replacements, var); |
6f086dfc RS |
1948 | if (replacement->new) |
1949 | { | |
1950 | *loc = replacement->new; | |
1951 | return; | |
1952 | } | |
1953 | ||
1954 | *loc = replacement->new = x = fixup_stack_1 (x, insn); | |
1955 | ||
00d8a4c1 RK |
1956 | /* Unless we are forcing memory to register or we changed the mode, |
1957 | we can leave things the way they are if the insn is valid. */ | |
718fe406 | 1958 | |
6f086dfc | 1959 | INSN_CODE (insn) = -1; |
00d8a4c1 RK |
1960 | if (! flag_force_mem && GET_MODE (x) == promoted_mode |
1961 | && recog_memoized (insn) >= 0) | |
6f086dfc RS |
1962 | return; |
1963 | ||
00d8a4c1 | 1964 | *loc = replacement->new = gen_reg_rtx (promoted_mode); |
6f086dfc RS |
1965 | return; |
1966 | } | |
1967 | ||
1968 | /* If X contains VAR, we need to unshare it here so that we update | |
1969 | each occurrence separately. But all identical MEMs in one insn | |
1970 | must be replaced with the same rtx because of the possibility of | |
1971 | MATCH_DUPs. */ | |
1972 | ||
1973 | if (reg_mentioned_p (var, x)) | |
1974 | { | |
2740a678 | 1975 | replacement = find_fixup_replacement (replacements, x); |
6f086dfc RS |
1976 | if (replacement->new == 0) |
1977 | replacement->new = copy_most_rtx (x, var); | |
1978 | ||
1979 | *loc = x = replacement->new; | |
3f546a53 | 1980 | code = GET_CODE (x); |
6f086dfc RS |
1981 | } |
1982 | break; | |
1983 | ||
1984 | case REG: | |
1985 | case CC0: | |
1986 | case PC: | |
1987 | case CONST_INT: | |
1988 | case CONST: | |
1989 | case SYMBOL_REF: | |
1990 | case LABEL_REF: | |
1991 | case CONST_DOUBLE: | |
1992 | return; | |
1993 | ||
1994 | case SIGN_EXTRACT: | |
1995 | case ZERO_EXTRACT: | |
1996 | /* Note that in some cases those types of expressions are altered | |
1997 | by optimize_bit_field, and do not survive to get here. */ | |
1998 | if (XEXP (x, 0) == var | |
1999 | || (GET_CODE (XEXP (x, 0)) == SUBREG | |
2000 | && SUBREG_REG (XEXP (x, 0)) == var)) | |
2001 | { | |
2002 | /* Get TEM as a valid MEM in the mode presently in the insn. | |
2003 | ||
2004 | We don't worry about the possibility of MATCH_DUP here; it | |
2005 | is highly unlikely and would be tricky to handle. */ | |
2006 | ||
2007 | tem = XEXP (x, 0); | |
2008 | if (GET_CODE (tem) == SUBREG) | |
0e09cc26 RK |
2009 | { |
2010 | if (GET_MODE_BITSIZE (GET_MODE (tem)) | |
2011 | > GET_MODE_BITSIZE (GET_MODE (var))) | |
2012 | { | |
2013 | replacement = find_fixup_replacement (replacements, var); | |
2014 | if (replacement->new == 0) | |
2015 | replacement->new = gen_reg_rtx (GET_MODE (var)); | |
2016 | SUBREG_REG (tem) = replacement->new; | |
2017 | } | |
ef933d26 RK |
2018 | else |
2019 | tem = fixup_memory_subreg (tem, insn, 0); | |
0e09cc26 RK |
2020 | } |
2021 | else | |
2022 | tem = fixup_stack_1 (tem, insn); | |
6f086dfc RS |
2023 | |
2024 | /* Unless we want to load from memory, get TEM into the proper mode | |
2025 | for an extract from memory. This can only be done if the | |
2026 | extract is at a constant position and length. */ | |
2027 | ||
2028 | if (! flag_force_mem && GET_CODE (XEXP (x, 1)) == CONST_INT | |
2029 | && GET_CODE (XEXP (x, 2)) == CONST_INT | |
2030 | && ! mode_dependent_address_p (XEXP (tem, 0)) | |
2031 | && ! MEM_VOLATILE_P (tem)) | |
2032 | { | |
2033 | enum machine_mode wanted_mode = VOIDmode; | |
2034 | enum machine_mode is_mode = GET_MODE (tem); | |
e5e809f4 | 2035 | HOST_WIDE_INT pos = INTVAL (XEXP (x, 2)); |
6f086dfc RS |
2036 | |
2037 | #ifdef HAVE_extzv | |
2038 | if (GET_CODE (x) == ZERO_EXTRACT) | |
0d8e55d8 | 2039 | { |
a995e389 RH |
2040 | wanted_mode |
2041 | = insn_data[(int) CODE_FOR_extzv].operand[1].mode; | |
0d8e55d8 JL |
2042 | if (wanted_mode == VOIDmode) |
2043 | wanted_mode = word_mode; | |
2044 | } | |
6f086dfc RS |
2045 | #endif |
2046 | #ifdef HAVE_extv | |
2047 | if (GET_CODE (x) == SIGN_EXTRACT) | |
0d8e55d8 | 2048 | { |
a995e389 | 2049 | wanted_mode = insn_data[(int) CODE_FOR_extv].operand[1].mode; |
0d8e55d8 JL |
2050 | if (wanted_mode == VOIDmode) |
2051 | wanted_mode = word_mode; | |
2052 | } | |
6f086dfc | 2053 | #endif |
6dc42e49 | 2054 | /* If we have a narrower mode, we can do something. */ |
6f086dfc RS |
2055 | if (wanted_mode != VOIDmode |
2056 | && GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode)) | |
2057 | { | |
e5e809f4 | 2058 | HOST_WIDE_INT offset = pos / BITS_PER_UNIT; |
6f086dfc RS |
2059 | rtx old_pos = XEXP (x, 2); |
2060 | rtx newmem; | |
2061 | ||
2062 | /* If the bytes and bits are counted differently, we | |
2063 | must adjust the offset. */ | |
f76b9db2 ILT |
2064 | if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN) |
2065 | offset = (GET_MODE_SIZE (is_mode) | |
2066 | - GET_MODE_SIZE (wanted_mode) - offset); | |
6f086dfc RS |
2067 | |
2068 | pos %= GET_MODE_BITSIZE (wanted_mode); | |
2069 | ||
38a448ca RH |
2070 | newmem = gen_rtx_MEM (wanted_mode, |
2071 | plus_constant (XEXP (tem, 0), offset)); | |
c6df88cb | 2072 | MEM_COPY_ATTRIBUTES (newmem, tem); |
6f086dfc RS |
2073 | |
2074 | /* Make the change and see if the insn remains valid. */ | |
2075 | INSN_CODE (insn) = -1; | |
2076 | XEXP (x, 0) = newmem; | |
5f4f0e22 | 2077 | XEXP (x, 2) = GEN_INT (pos); |
6f086dfc RS |
2078 | |
2079 | if (recog_memoized (insn) >= 0) | |
2080 | return; | |
2081 | ||
2082 | /* Otherwise, restore old position. XEXP (x, 0) will be | |
2083 | restored later. */ | |
2084 | XEXP (x, 2) = old_pos; | |
2085 | } | |
2086 | } | |
2087 | ||
2088 | /* If we get here, the bitfield extract insn can't accept a memory | |
2089 | reference. Copy the input into a register. */ | |
2090 | ||
2091 | tem1 = gen_reg_rtx (GET_MODE (tem)); | |
2092 | emit_insn_before (gen_move_insn (tem1, tem), insn); | |
2093 | XEXP (x, 0) = tem1; | |
2094 | return; | |
2095 | } | |
2096 | break; | |
718fe406 | 2097 | |
6f086dfc RS |
2098 | case SUBREG: |
2099 | if (SUBREG_REG (x) == var) | |
2100 | { | |
00d8a4c1 RK |
2101 | /* If this is a special SUBREG made because VAR was promoted |
2102 | from a wider mode, replace it with VAR and call ourself | |
2103 | recursively, this time saying that the object previously | |
2104 | had its current mode (by virtue of the SUBREG). */ | |
2105 | ||
2106 | if (SUBREG_PROMOTED_VAR_P (x)) | |
2107 | { | |
2108 | *loc = var; | |
2109 | fixup_var_refs_1 (var, GET_MODE (var), loc, insn, replacements); | |
2110 | return; | |
2111 | } | |
2112 | ||
6f086dfc | 2113 | /* If this SUBREG makes VAR wider, it has become a paradoxical |
718fe406 | 2114 | SUBREG with VAR in memory, but these aren't allowed at this |
6f086dfc RS |
2115 | stage of the compilation. So load VAR into a pseudo and take |
2116 | a SUBREG of that pseudo. */ | |
2117 | if (GET_MODE_SIZE (GET_MODE (x)) > GET_MODE_SIZE (GET_MODE (var))) | |
2118 | { | |
2740a678 | 2119 | replacement = find_fixup_replacement (replacements, var); |
6f086dfc RS |
2120 | if (replacement->new == 0) |
2121 | replacement->new = gen_reg_rtx (GET_MODE (var)); | |
2122 | SUBREG_REG (x) = replacement->new; | |
2123 | return; | |
2124 | } | |
2125 | ||
2126 | /* See if we have already found a replacement for this SUBREG. | |
2127 | If so, use it. Otherwise, make a MEM and see if the insn | |
2128 | is recognized. If not, or if we should force MEM into a register, | |
2129 | make a pseudo for this SUBREG. */ | |
2740a678 | 2130 | replacement = find_fixup_replacement (replacements, x); |
6f086dfc RS |
2131 | if (replacement->new) |
2132 | { | |
2133 | *loc = replacement->new; | |
2134 | return; | |
2135 | } | |
718fe406 | 2136 | |
6f086dfc RS |
2137 | replacement->new = *loc = fixup_memory_subreg (x, insn, 0); |
2138 | ||
f898f031 | 2139 | INSN_CODE (insn) = -1; |
6f086dfc RS |
2140 | if (! flag_force_mem && recog_memoized (insn) >= 0) |
2141 | return; | |
2142 | ||
2143 | *loc = replacement->new = gen_reg_rtx (GET_MODE (x)); | |
2144 | return; | |
2145 | } | |
2146 | break; | |
2147 | ||
2148 | case SET: | |
2149 | /* First do special simplification of bit-field references. */ | |
2150 | if (GET_CODE (SET_DEST (x)) == SIGN_EXTRACT | |
2151 | || GET_CODE (SET_DEST (x)) == ZERO_EXTRACT) | |
2152 | optimize_bit_field (x, insn, 0); | |
2153 | if (GET_CODE (SET_SRC (x)) == SIGN_EXTRACT | |
2154 | || GET_CODE (SET_SRC (x)) == ZERO_EXTRACT) | |
5f4f0e22 | 2155 | optimize_bit_field (x, insn, NULL_PTR); |
6f086dfc | 2156 | |
0e09cc26 RK |
2157 | /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object |
2158 | into a register and then store it back out. */ | |
2159 | if (GET_CODE (SET_DEST (x)) == ZERO_EXTRACT | |
2160 | && GET_CODE (XEXP (SET_DEST (x), 0)) == SUBREG | |
2161 | && SUBREG_REG (XEXP (SET_DEST (x), 0)) == var | |
2162 | && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x), 0))) | |
2163 | > GET_MODE_SIZE (GET_MODE (var)))) | |
2164 | { | |
2165 | replacement = find_fixup_replacement (replacements, var); | |
2166 | if (replacement->new == 0) | |
2167 | replacement->new = gen_reg_rtx (GET_MODE (var)); | |
2168 | ||
2169 | SUBREG_REG (XEXP (SET_DEST (x), 0)) = replacement->new; | |
2170 | emit_insn_after (gen_move_insn (var, replacement->new), insn); | |
2171 | } | |
2172 | ||
6f086dfc | 2173 | /* If SET_DEST is now a paradoxical SUBREG, put the result of this |
0f41302f | 2174 | insn into a pseudo and store the low part of the pseudo into VAR. */ |
6f086dfc RS |
2175 | if (GET_CODE (SET_DEST (x)) == SUBREG |
2176 | && SUBREG_REG (SET_DEST (x)) == var | |
2177 | && (GET_MODE_SIZE (GET_MODE (SET_DEST (x))) | |
2178 | > GET_MODE_SIZE (GET_MODE (var)))) | |
2179 | { | |
2180 | SET_DEST (x) = tem = gen_reg_rtx (GET_MODE (SET_DEST (x))); | |
2181 | emit_insn_after (gen_move_insn (var, gen_lowpart (GET_MODE (var), | |
2182 | tem)), | |
2183 | insn); | |
2184 | break; | |
2185 | } | |
718fe406 | 2186 | |
6f086dfc RS |
2187 | { |
2188 | rtx dest = SET_DEST (x); | |
2189 | rtx src = SET_SRC (x); | |
29a82058 | 2190 | #ifdef HAVE_insv |
6f086dfc | 2191 | rtx outerdest = dest; |
29a82058 | 2192 | #endif |
6f086dfc RS |
2193 | |
2194 | while (GET_CODE (dest) == SUBREG || GET_CODE (dest) == STRICT_LOW_PART | |
2195 | || GET_CODE (dest) == SIGN_EXTRACT | |
2196 | || GET_CODE (dest) == ZERO_EXTRACT) | |
2197 | dest = XEXP (dest, 0); | |
2198 | ||
2199 | if (GET_CODE (src) == SUBREG) | |
2200 | src = XEXP (src, 0); | |
2201 | ||
2202 | /* If VAR does not appear at the top level of the SET | |
2203 | just scan the lower levels of the tree. */ | |
2204 | ||
718fe406 | 2205 | if (src != var && dest != var) |
6f086dfc RS |
2206 | break; |
2207 | ||
2208 | /* We will need to rerecognize this insn. */ | |
2209 | INSN_CODE (insn) = -1; | |
2210 | ||
2211 | #ifdef HAVE_insv | |
2212 | if (GET_CODE (outerdest) == ZERO_EXTRACT && dest == var) | |
2213 | { | |
2214 | /* Since this case will return, ensure we fixup all the | |
2215 | operands here. */ | |
00d8a4c1 RK |
2216 | fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 1), |
2217 | insn, replacements); | |
2218 | fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 2), | |
2219 | insn, replacements); | |
2220 | fixup_var_refs_1 (var, promoted_mode, &SET_SRC (x), | |
2221 | insn, replacements); | |
6f086dfc RS |
2222 | |
2223 | tem = XEXP (outerdest, 0); | |
2224 | ||
2225 | /* Clean up (SUBREG:SI (MEM:mode ...) 0) | |
2226 | that may appear inside a ZERO_EXTRACT. | |
2227 | This was legitimate when the MEM was a REG. */ | |
2228 | if (GET_CODE (tem) == SUBREG | |
2229 | && SUBREG_REG (tem) == var) | |
0e09cc26 | 2230 | tem = fixup_memory_subreg (tem, insn, 0); |
6f086dfc RS |
2231 | else |
2232 | tem = fixup_stack_1 (tem, insn); | |
2233 | ||
2234 | if (GET_CODE (XEXP (outerdest, 1)) == CONST_INT | |
2235 | && GET_CODE (XEXP (outerdest, 2)) == CONST_INT | |
2236 | && ! mode_dependent_address_p (XEXP (tem, 0)) | |
2237 | && ! MEM_VOLATILE_P (tem)) | |
2238 | { | |
0d8e55d8 | 2239 | enum machine_mode wanted_mode; |
6f086dfc | 2240 | enum machine_mode is_mode = GET_MODE (tem); |
e5e809f4 | 2241 | HOST_WIDE_INT pos = INTVAL (XEXP (outerdest, 2)); |
6f086dfc | 2242 | |
a995e389 | 2243 | wanted_mode = insn_data[(int) CODE_FOR_insv].operand[0].mode; |
0d8e55d8 JL |
2244 | if (wanted_mode == VOIDmode) |
2245 | wanted_mode = word_mode; | |
2246 | ||
6dc42e49 | 2247 | /* If we have a narrower mode, we can do something. */ |
6f086dfc RS |
2248 | if (GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode)) |
2249 | { | |
e5e809f4 | 2250 | HOST_WIDE_INT offset = pos / BITS_PER_UNIT; |
6f086dfc RS |
2251 | rtx old_pos = XEXP (outerdest, 2); |
2252 | rtx newmem; | |
2253 | ||
f76b9db2 ILT |
2254 | if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN) |
2255 | offset = (GET_MODE_SIZE (is_mode) | |
2256 | - GET_MODE_SIZE (wanted_mode) - offset); | |
6f086dfc RS |
2257 | |
2258 | pos %= GET_MODE_BITSIZE (wanted_mode); | |
2259 | ||
38a448ca | 2260 | newmem = gen_rtx_MEM (wanted_mode, |
c5c76735 JL |
2261 | plus_constant (XEXP (tem, 0), |
2262 | offset)); | |
c6df88cb | 2263 | MEM_COPY_ATTRIBUTES (newmem, tem); |
6f086dfc RS |
2264 | |
2265 | /* Make the change and see if the insn remains valid. */ | |
2266 | INSN_CODE (insn) = -1; | |
2267 | XEXP (outerdest, 0) = newmem; | |
5f4f0e22 | 2268 | XEXP (outerdest, 2) = GEN_INT (pos); |
718fe406 | 2269 | |
6f086dfc RS |
2270 | if (recog_memoized (insn) >= 0) |
2271 | return; | |
718fe406 | 2272 | |
6f086dfc RS |
2273 | /* Otherwise, restore old position. XEXP (x, 0) will be |
2274 | restored later. */ | |
2275 | XEXP (outerdest, 2) = old_pos; | |
2276 | } | |
2277 | } | |
2278 | ||
2279 | /* If we get here, the bit-field store doesn't allow memory | |
2280 | or isn't located at a constant position. Load the value into | |
2281 | a register, do the store, and put it back into memory. */ | |
2282 | ||
2283 | tem1 = gen_reg_rtx (GET_MODE (tem)); | |
2284 | emit_insn_before (gen_move_insn (tem1, tem), insn); | |
2285 | emit_insn_after (gen_move_insn (tem, tem1), insn); | |
2286 | XEXP (outerdest, 0) = tem1; | |
2287 | return; | |
2288 | } | |
2289 | #endif | |
2290 | ||
2291 | /* STRICT_LOW_PART is a no-op on memory references | |
2292 | and it can cause combinations to be unrecognizable, | |
2293 | so eliminate it. */ | |
2294 | ||
2295 | if (dest == var && GET_CODE (SET_DEST (x)) == STRICT_LOW_PART) | |
2296 | SET_DEST (x) = XEXP (SET_DEST (x), 0); | |
2297 | ||
2298 | /* A valid insn to copy VAR into or out of a register | |
2299 | must be left alone, to avoid an infinite loop here. | |
2300 | If the reference to VAR is by a subreg, fix that up, | |
2301 | since SUBREG is not valid for a memref. | |
e15762df RK |
2302 | Also fix up the address of the stack slot. |
2303 | ||
2304 | Note that we must not try to recognize the insn until | |
2305 | after we know that we have valid addresses and no | |
2306 | (subreg (mem ...) ...) constructs, since these interfere | |
2307 | with determining the validity of the insn. */ | |
6f086dfc RS |
2308 | |
2309 | if ((SET_SRC (x) == var | |
2310 | || (GET_CODE (SET_SRC (x)) == SUBREG | |
2311 | && SUBREG_REG (SET_SRC (x)) == var)) | |
2312 | && (GET_CODE (SET_DEST (x)) == REG | |
2313 | || (GET_CODE (SET_DEST (x)) == SUBREG | |
2314 | && GET_CODE (SUBREG_REG (SET_DEST (x))) == REG)) | |
1d273bf5 | 2315 | && GET_MODE (var) == promoted_mode |
c46722a7 | 2316 | && x == single_set (insn)) |
6f086dfc | 2317 | { |
e15762df RK |
2318 | rtx pat; |
2319 | ||
2740a678 | 2320 | replacement = find_fixup_replacement (replacements, SET_SRC (x)); |
6f086dfc | 2321 | if (replacement->new) |
6f086dfc | 2322 | SET_SRC (x) = replacement->new; |
6f086dfc RS |
2323 | else if (GET_CODE (SET_SRC (x)) == SUBREG) |
2324 | SET_SRC (x) = replacement->new | |
2325 | = fixup_memory_subreg (SET_SRC (x), insn, 0); | |
2326 | else | |
2327 | SET_SRC (x) = replacement->new | |
2328 | = fixup_stack_1 (SET_SRC (x), insn); | |
e15762df RK |
2329 | |
2330 | if (recog_memoized (insn) >= 0) | |
2331 | return; | |
2332 | ||
2333 | /* INSN is not valid, but we know that we want to | |
2334 | copy SET_SRC (x) to SET_DEST (x) in some way. So | |
2335 | we generate the move and see whether it requires more | |
2336 | than one insn. If it does, we emit those insns and | |
718fe406 | 2337 | delete INSN. Otherwise, we an just replace the pattern |
e15762df RK |
2338 | of INSN; we have already verified above that INSN has |
2339 | no other function that to do X. */ | |
2340 | ||
2341 | pat = gen_move_insn (SET_DEST (x), SET_SRC (x)); | |
2342 | if (GET_CODE (pat) == SEQUENCE) | |
2343 | { | |
2344 | emit_insn_after (pat, insn); | |
2345 | PUT_CODE (insn, NOTE); | |
2346 | NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED; | |
2347 | NOTE_SOURCE_FILE (insn) = 0; | |
2348 | } | |
2349 | else | |
2350 | PATTERN (insn) = pat; | |
2351 | ||
6f086dfc RS |
2352 | return; |
2353 | } | |
2354 | ||
2355 | if ((SET_DEST (x) == var | |
2356 | || (GET_CODE (SET_DEST (x)) == SUBREG | |
2357 | && SUBREG_REG (SET_DEST (x)) == var)) | |
2358 | && (GET_CODE (SET_SRC (x)) == REG | |
2359 | || (GET_CODE (SET_SRC (x)) == SUBREG | |
2360 | && GET_CODE (SUBREG_REG (SET_SRC (x))) == REG)) | |
1d273bf5 | 2361 | && GET_MODE (var) == promoted_mode |
c46722a7 | 2362 | && x == single_set (insn)) |
6f086dfc | 2363 | { |
e15762df RK |
2364 | rtx pat; |
2365 | ||
6f086dfc RS |
2366 | if (GET_CODE (SET_DEST (x)) == SUBREG) |
2367 | SET_DEST (x) = fixup_memory_subreg (SET_DEST (x), insn, 0); | |
2368 | else | |
2369 | SET_DEST (x) = fixup_stack_1 (SET_DEST (x), insn); | |
e15762df RK |
2370 | |
2371 | if (recog_memoized (insn) >= 0) | |
2372 | return; | |
2373 | ||
2374 | pat = gen_move_insn (SET_DEST (x), SET_SRC (x)); | |
2375 | if (GET_CODE (pat) == SEQUENCE) | |
2376 | { | |
2377 | emit_insn_after (pat, insn); | |
2378 | PUT_CODE (insn, NOTE); | |
2379 | NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED; | |
2380 | NOTE_SOURCE_FILE (insn) = 0; | |
2381 | } | |
2382 | else | |
2383 | PATTERN (insn) = pat; | |
2384 | ||
6f086dfc RS |
2385 | return; |
2386 | } | |
2387 | ||
2388 | /* Otherwise, storing into VAR must be handled specially | |
2389 | by storing into a temporary and copying that into VAR | |
00d8a4c1 RK |
2390 | with a new insn after this one. Note that this case |
2391 | will be used when storing into a promoted scalar since | |
2392 | the insn will now have different modes on the input | |
2393 | and output and hence will be invalid (except for the case | |
2394 | of setting it to a constant, which does not need any | |
2395 | change if it is valid). We generate extra code in that case, | |
2396 | but combine.c will eliminate it. */ | |
6f086dfc RS |
2397 | |
2398 | if (dest == var) | |
2399 | { | |
2400 | rtx temp; | |
00d8a4c1 RK |
2401 | rtx fixeddest = SET_DEST (x); |
2402 | ||
6f086dfc | 2403 | /* STRICT_LOW_PART can be discarded, around a MEM. */ |
00d8a4c1 RK |
2404 | if (GET_CODE (fixeddest) == STRICT_LOW_PART) |
2405 | fixeddest = XEXP (fixeddest, 0); | |
6f086dfc | 2406 | /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */ |
00d8a4c1 | 2407 | if (GET_CODE (fixeddest) == SUBREG) |
926d1ca5 RK |
2408 | { |
2409 | fixeddest = fixup_memory_subreg (fixeddest, insn, 0); | |
2410 | promoted_mode = GET_MODE (fixeddest); | |
2411 | } | |
6f086dfc | 2412 | else |
00d8a4c1 RK |
2413 | fixeddest = fixup_stack_1 (fixeddest, insn); |
2414 | ||
926d1ca5 | 2415 | temp = gen_reg_rtx (promoted_mode); |
00d8a4c1 RK |
2416 | |
2417 | emit_insn_after (gen_move_insn (fixeddest, | |
2418 | gen_lowpart (GET_MODE (fixeddest), | |
2419 | temp)), | |
2420 | insn); | |
6f086dfc | 2421 | |
6f086dfc RS |
2422 | SET_DEST (x) = temp; |
2423 | } | |
2424 | } | |
e9a25f70 JL |
2425 | |
2426 | default: | |
2427 | break; | |
6f086dfc RS |
2428 | } |
2429 | ||
2430 | /* Nothing special about this RTX; fix its operands. */ | |
2431 | ||
2432 | fmt = GET_RTX_FORMAT (code); | |
2433 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
2434 | { | |
2435 | if (fmt[i] == 'e') | |
00d8a4c1 | 2436 | fixup_var_refs_1 (var, promoted_mode, &XEXP (x, i), insn, replacements); |
d4757e6a | 2437 | else if (fmt[i] == 'E') |
6f086dfc RS |
2438 | { |
2439 | register int j; | |
2440 | for (j = 0; j < XVECLEN (x, i); j++) | |
00d8a4c1 RK |
2441 | fixup_var_refs_1 (var, promoted_mode, &XVECEXP (x, i, j), |
2442 | insn, replacements); | |
6f086dfc RS |
2443 | } |
2444 | } | |
2445 | } | |
2446 | \f | |
2447 | /* Given X, an rtx of the form (SUBREG:m1 (MEM:m2 addr)), | |
2448 | return an rtx (MEM:m1 newaddr) which is equivalent. | |
2449 | If any insns must be emitted to compute NEWADDR, put them before INSN. | |
2450 | ||
2451 | UNCRITICAL nonzero means accept paradoxical subregs. | |
0f41302f | 2452 | This is used for subregs found inside REG_NOTES. */ |
6f086dfc RS |
2453 | |
2454 | static rtx | |
2455 | fixup_memory_subreg (x, insn, uncritical) | |
2456 | rtx x; | |
2457 | rtx insn; | |
2458 | int uncritical; | |
2459 | { | |
2460 | int offset = SUBREG_WORD (x) * UNITS_PER_WORD; | |
2461 | rtx addr = XEXP (SUBREG_REG (x), 0); | |
2462 | enum machine_mode mode = GET_MODE (x); | |
29a82058 | 2463 | rtx result; |
6f086dfc RS |
2464 | |
2465 | /* Paradoxical SUBREGs are usually invalid during RTL generation. */ | |
2466 | if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) | |
2467 | && ! uncritical) | |
2468 | abort (); | |
2469 | ||
f76b9db2 ILT |
2470 | if (BYTES_BIG_ENDIAN) |
2471 | offset += (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (SUBREG_REG (x)))) | |
2472 | - MIN (UNITS_PER_WORD, GET_MODE_SIZE (mode))); | |
6f086dfc RS |
2473 | addr = plus_constant (addr, offset); |
2474 | if (!flag_force_addr && memory_address_p (mode, addr)) | |
2475 | /* Shortcut if no insns need be emitted. */ | |
2476 | return change_address (SUBREG_REG (x), mode, addr); | |
2477 | start_sequence (); | |
2478 | result = change_address (SUBREG_REG (x), mode, addr); | |
2479 | emit_insn_before (gen_sequence (), insn); | |
2480 | end_sequence (); | |
2481 | return result; | |
2482 | } | |
2483 | ||
2484 | /* Do fixup_memory_subreg on all (SUBREG (MEM ...) ...) contained in X. | |
2485 | Replace subexpressions of X in place. | |
2486 | If X itself is a (SUBREG (MEM ...) ...), return the replacement expression. | |
2487 | Otherwise return X, with its contents possibly altered. | |
2488 | ||
718fe406 | 2489 | If any insns must be emitted to compute NEWADDR, put them before INSN. |
ab6155b7 RK |
2490 | |
2491 | UNCRITICAL is as in fixup_memory_subreg. */ | |
6f086dfc RS |
2492 | |
2493 | static rtx | |
ab6155b7 | 2494 | walk_fixup_memory_subreg (x, insn, uncritical) |
6f086dfc RS |
2495 | register rtx x; |
2496 | rtx insn; | |
ab6155b7 | 2497 | int uncritical; |
6f086dfc RS |
2498 | { |
2499 | register enum rtx_code code; | |
6f7d635c | 2500 | register const char *fmt; |
6f086dfc RS |
2501 | register int i; |
2502 | ||
2503 | if (x == 0) | |
2504 | return 0; | |
2505 | ||
2506 | code = GET_CODE (x); | |
2507 | ||
2508 | if (code == SUBREG && GET_CODE (SUBREG_REG (x)) == MEM) | |
ab6155b7 | 2509 | return fixup_memory_subreg (x, insn, uncritical); |
6f086dfc RS |
2510 | |
2511 | /* Nothing special about this RTX; fix its operands. */ | |
2512 | ||
2513 | fmt = GET_RTX_FORMAT (code); | |
2514 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
2515 | { | |
2516 | if (fmt[i] == 'e') | |
ab6155b7 | 2517 | XEXP (x, i) = walk_fixup_memory_subreg (XEXP (x, i), insn, uncritical); |
d4757e6a | 2518 | else if (fmt[i] == 'E') |
6f086dfc RS |
2519 | { |
2520 | register int j; | |
2521 | for (j = 0; j < XVECLEN (x, i); j++) | |
2522 | XVECEXP (x, i, j) | |
ab6155b7 | 2523 | = walk_fixup_memory_subreg (XVECEXP (x, i, j), insn, uncritical); |
6f086dfc RS |
2524 | } |
2525 | } | |
2526 | return x; | |
2527 | } | |
2528 | \f | |
6f086dfc RS |
2529 | /* For each memory ref within X, if it refers to a stack slot |
2530 | with an out of range displacement, put the address in a temp register | |
2531 | (emitting new insns before INSN to load these registers) | |
2532 | and alter the memory ref to use that register. | |
2533 | Replace each such MEM rtx with a copy, to avoid clobberage. */ | |
2534 | ||
2535 | static rtx | |
2536 | fixup_stack_1 (x, insn) | |
2537 | rtx x; | |
2538 | rtx insn; | |
2539 | { | |
2540 | register int i; | |
2541 | register RTX_CODE code = GET_CODE (x); | |
6f7d635c | 2542 | register const char *fmt; |
6f086dfc RS |
2543 | |
2544 | if (code == MEM) | |
2545 | { | |
2546 | register rtx ad = XEXP (x, 0); | |
2547 | /* If we have address of a stack slot but it's not valid | |
2548 | (displacement is too large), compute the sum in a register. */ | |
2549 | if (GET_CODE (ad) == PLUS | |
2550 | && GET_CODE (XEXP (ad, 0)) == REG | |
40d05551 RK |
2551 | && ((REGNO (XEXP (ad, 0)) >= FIRST_VIRTUAL_REGISTER |
2552 | && REGNO (XEXP (ad, 0)) <= LAST_VIRTUAL_REGISTER) | |
e9a25f70 JL |
2553 | || REGNO (XEXP (ad, 0)) == FRAME_POINTER_REGNUM |
2554 | #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM | |
2555 | || REGNO (XEXP (ad, 0)) == HARD_FRAME_POINTER_REGNUM | |
2556 | #endif | |
2557 | || REGNO (XEXP (ad, 0)) == STACK_POINTER_REGNUM | |
956d6950 | 2558 | || REGNO (XEXP (ad, 0)) == ARG_POINTER_REGNUM |
40d05551 | 2559 | || XEXP (ad, 0) == current_function_internal_arg_pointer) |
6f086dfc RS |
2560 | && GET_CODE (XEXP (ad, 1)) == CONST_INT) |
2561 | { | |
2562 | rtx temp, seq; | |
2563 | if (memory_address_p (GET_MODE (x), ad)) | |
2564 | return x; | |
2565 | ||
2566 | start_sequence (); | |
2567 | temp = copy_to_reg (ad); | |
2568 | seq = gen_sequence (); | |
2569 | end_sequence (); | |
2570 | emit_insn_before (seq, insn); | |
2571 | return change_address (x, VOIDmode, temp); | |
2572 | } | |
2573 | return x; | |
2574 | } | |
2575 | ||
2576 | fmt = GET_RTX_FORMAT (code); | |
2577 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
2578 | { | |
2579 | if (fmt[i] == 'e') | |
2580 | XEXP (x, i) = fixup_stack_1 (XEXP (x, i), insn); | |
d4757e6a | 2581 | else if (fmt[i] == 'E') |
6f086dfc RS |
2582 | { |
2583 | register int j; | |
2584 | for (j = 0; j < XVECLEN (x, i); j++) | |
2585 | XVECEXP (x, i, j) = fixup_stack_1 (XVECEXP (x, i, j), insn); | |
2586 | } | |
2587 | } | |
2588 | return x; | |
2589 | } | |
2590 | \f | |
2591 | /* Optimization: a bit-field instruction whose field | |
2592 | happens to be a byte or halfword in memory | |
2593 | can be changed to a move instruction. | |
2594 | ||
2595 | We call here when INSN is an insn to examine or store into a bit-field. | |
2596 | BODY is the SET-rtx to be altered. | |
2597 | ||
2598 | EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0. | |
2599 | (Currently this is called only from function.c, and EQUIV_MEM | |
2600 | is always 0.) */ | |
2601 | ||
2602 | static void | |
2603 | optimize_bit_field (body, insn, equiv_mem) | |
2604 | rtx body; | |
2605 | rtx insn; | |
2606 | rtx *equiv_mem; | |
2607 | { | |
2608 | register rtx bitfield; | |
2609 | int destflag; | |
2610 | rtx seq = 0; | |
2611 | enum machine_mode mode; | |
2612 | ||
2613 | if (GET_CODE (SET_DEST (body)) == SIGN_EXTRACT | |
2614 | || GET_CODE (SET_DEST (body)) == ZERO_EXTRACT) | |
2615 | bitfield = SET_DEST (body), destflag = 1; | |
2616 | else | |
2617 | bitfield = SET_SRC (body), destflag = 0; | |
2618 | ||
2619 | /* First check that the field being stored has constant size and position | |
2620 | and is in fact a byte or halfword suitably aligned. */ | |
2621 | ||
2622 | if (GET_CODE (XEXP (bitfield, 1)) == CONST_INT | |
2623 | && GET_CODE (XEXP (bitfield, 2)) == CONST_INT | |
2624 | && ((mode = mode_for_size (INTVAL (XEXP (bitfield, 1)), MODE_INT, 1)) | |
2625 | != BLKmode) | |
2626 | && INTVAL (XEXP (bitfield, 2)) % INTVAL (XEXP (bitfield, 1)) == 0) | |
2627 | { | |
2628 | register rtx memref = 0; | |
2629 | ||
2630 | /* Now check that the containing word is memory, not a register, | |
2631 | and that it is safe to change the machine mode. */ | |
2632 | ||
2633 | if (GET_CODE (XEXP (bitfield, 0)) == MEM) | |
2634 | memref = XEXP (bitfield, 0); | |
2635 | else if (GET_CODE (XEXP (bitfield, 0)) == REG | |
2636 | && equiv_mem != 0) | |
2637 | memref = equiv_mem[REGNO (XEXP (bitfield, 0))]; | |
2638 | else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG | |
2639 | && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == MEM) | |
2640 | memref = SUBREG_REG (XEXP (bitfield, 0)); | |
2641 | else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG | |
2642 | && equiv_mem != 0 | |
2643 | && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == REG) | |
2644 | memref = equiv_mem[REGNO (SUBREG_REG (XEXP (bitfield, 0)))]; | |
2645 | ||
2646 | if (memref | |
2647 | && ! mode_dependent_address_p (XEXP (memref, 0)) | |
2648 | && ! MEM_VOLATILE_P (memref)) | |
2649 | { | |
2650 | /* Now adjust the address, first for any subreg'ing | |
2651 | that we are now getting rid of, | |
2652 | and then for which byte of the word is wanted. */ | |
2653 | ||
e5e809f4 | 2654 | HOST_WIDE_INT offset = INTVAL (XEXP (bitfield, 2)); |
b88a3142 RK |
2655 | rtx insns; |
2656 | ||
6f086dfc | 2657 | /* Adjust OFFSET to count bits from low-address byte. */ |
f76b9db2 ILT |
2658 | if (BITS_BIG_ENDIAN != BYTES_BIG_ENDIAN) |
2659 | offset = (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield, 0))) | |
2660 | - offset - INTVAL (XEXP (bitfield, 1))); | |
2661 | ||
6f086dfc RS |
2662 | /* Adjust OFFSET to count bytes from low-address byte. */ |
2663 | offset /= BITS_PER_UNIT; | |
2664 | if (GET_CODE (XEXP (bitfield, 0)) == SUBREG) | |
2665 | { | |
2666 | offset += SUBREG_WORD (XEXP (bitfield, 0)) * UNITS_PER_WORD; | |
f76b9db2 ILT |
2667 | if (BYTES_BIG_ENDIAN) |
2668 | offset -= (MIN (UNITS_PER_WORD, | |
2669 | GET_MODE_SIZE (GET_MODE (XEXP (bitfield, 0)))) | |
2670 | - MIN (UNITS_PER_WORD, | |
2671 | GET_MODE_SIZE (GET_MODE (memref)))); | |
6f086dfc RS |
2672 | } |
2673 | ||
b88a3142 RK |
2674 | start_sequence (); |
2675 | memref = change_address (memref, mode, | |
6f086dfc | 2676 | plus_constant (XEXP (memref, 0), offset)); |
b88a3142 RK |
2677 | insns = get_insns (); |
2678 | end_sequence (); | |
2679 | emit_insns_before (insns, insn); | |
6f086dfc RS |
2680 | |
2681 | /* Store this memory reference where | |
2682 | we found the bit field reference. */ | |
2683 | ||
2684 | if (destflag) | |
2685 | { | |
2686 | validate_change (insn, &SET_DEST (body), memref, 1); | |
2687 | if (! CONSTANT_ADDRESS_P (SET_SRC (body))) | |
2688 | { | |
2689 | rtx src = SET_SRC (body); | |
2690 | while (GET_CODE (src) == SUBREG | |
2691 | && SUBREG_WORD (src) == 0) | |
2692 | src = SUBREG_REG (src); | |
2693 | if (GET_MODE (src) != GET_MODE (memref)) | |
2694 | src = gen_lowpart (GET_MODE (memref), SET_SRC (body)); | |
2695 | validate_change (insn, &SET_SRC (body), src, 1); | |
2696 | } | |
2697 | else if (GET_MODE (SET_SRC (body)) != VOIDmode | |
2698 | && GET_MODE (SET_SRC (body)) != GET_MODE (memref)) | |
2699 | /* This shouldn't happen because anything that didn't have | |
2700 | one of these modes should have got converted explicitly | |
2701 | and then referenced through a subreg. | |
2702 | This is so because the original bit-field was | |
2703 | handled by agg_mode and so its tree structure had | |
2704 | the same mode that memref now has. */ | |
2705 | abort (); | |
2706 | } | |
2707 | else | |
2708 | { | |
2709 | rtx dest = SET_DEST (body); | |
2710 | ||
2711 | while (GET_CODE (dest) == SUBREG | |
4013a709 RK |
2712 | && SUBREG_WORD (dest) == 0 |
2713 | && (GET_MODE_CLASS (GET_MODE (dest)) | |
ab87f8c8 JL |
2714 | == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest)))) |
2715 | && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest))) | |
2716 | <= UNITS_PER_WORD)) | |
6f086dfc RS |
2717 | dest = SUBREG_REG (dest); |
2718 | ||
2719 | validate_change (insn, &SET_DEST (body), dest, 1); | |
2720 | ||
2721 | if (GET_MODE (dest) == GET_MODE (memref)) | |
2722 | validate_change (insn, &SET_SRC (body), memref, 1); | |
2723 | else | |
2724 | { | |
2725 | /* Convert the mem ref to the destination mode. */ | |
2726 | rtx newreg = gen_reg_rtx (GET_MODE (dest)); | |
2727 | ||
2728 | start_sequence (); | |
2729 | convert_move (newreg, memref, | |
2730 | GET_CODE (SET_SRC (body)) == ZERO_EXTRACT); | |
2731 | seq = get_insns (); | |
2732 | end_sequence (); | |
2733 | ||
2734 | validate_change (insn, &SET_SRC (body), newreg, 1); | |
2735 | } | |
2736 | } | |
2737 | ||
2738 | /* See if we can convert this extraction or insertion into | |
2739 | a simple move insn. We might not be able to do so if this | |
2740 | was, for example, part of a PARALLEL. | |
2741 | ||
2742 | If we succeed, write out any needed conversions. If we fail, | |
2743 | it is hard to guess why we failed, so don't do anything | |
2744 | special; just let the optimization be suppressed. */ | |
2745 | ||
2746 | if (apply_change_group () && seq) | |
2747 | emit_insns_before (seq, insn); | |
2748 | } | |
2749 | } | |
2750 | } | |
2751 | \f | |
2752 | /* These routines are responsible for converting virtual register references | |
2753 | to the actual hard register references once RTL generation is complete. | |
2754 | ||
2755 | The following four variables are used for communication between the | |
2756 | routines. They contain the offsets of the virtual registers from their | |
2757 | respective hard registers. */ | |
2758 | ||
2759 | static int in_arg_offset; | |
2760 | static int var_offset; | |
2761 | static int dynamic_offset; | |
2762 | static int out_arg_offset; | |
71038426 | 2763 | static int cfa_offset; |
6f086dfc RS |
2764 | |
2765 | /* In most machines, the stack pointer register is equivalent to the bottom | |
2766 | of the stack. */ | |
2767 | ||
2768 | #ifndef STACK_POINTER_OFFSET | |
2769 | #define STACK_POINTER_OFFSET 0 | |
2770 | #endif | |
2771 | ||
2772 | /* If not defined, pick an appropriate default for the offset of dynamically | |
2773 | allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS, | |
2774 | REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */ | |
2775 | ||
2776 | #ifndef STACK_DYNAMIC_OFFSET | |
2777 | ||
6f086dfc RS |
2778 | /* The bottom of the stack points to the actual arguments. If |
2779 | REG_PARM_STACK_SPACE is defined, this includes the space for the register | |
2780 | parameters. However, if OUTGOING_REG_PARM_STACK space is not defined, | |
718fe406 | 2781 | stack space for register parameters is not pushed by the caller, but |
6f086dfc RS |
2782 | rather part of the fixed stack areas and hence not included in |
2783 | `current_function_outgoing_args_size'. Nevertheless, we must allow | |
2784 | for it when allocating stack dynamic objects. */ | |
2785 | ||
2786 | #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE) | |
2787 | #define STACK_DYNAMIC_OFFSET(FNDECL) \ | |
f73ad30e JH |
2788 | ((ACCUMULATE_OUTGOING_ARGS \ |
2789 | ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\ | |
2790 | + (STACK_POINTER_OFFSET)) \ | |
6f086dfc RS |
2791 | |
2792 | #else | |
2793 | #define STACK_DYNAMIC_OFFSET(FNDECL) \ | |
f73ad30e JH |
2794 | ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \ |
2795 | + (STACK_POINTER_OFFSET)) | |
6f086dfc RS |
2796 | #endif |
2797 | #endif | |
2798 | ||
2c849145 | 2799 | /* On most machines, the CFA coincides with the first incoming parm. */ |
71038426 RH |
2800 | |
2801 | #ifndef ARG_POINTER_CFA_OFFSET | |
2c849145 | 2802 | #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL) |
71038426 RH |
2803 | #endif |
2804 | ||
e9a25f70 JL |
2805 | /* Build up a (MEM (ADDRESSOF (REG))) rtx for a register REG that just had |
2806 | its address taken. DECL is the decl for the object stored in the | |
2807 | register, for later use if we do need to force REG into the stack. | |
2808 | REG is overwritten by the MEM like in put_reg_into_stack. */ | |
2809 | ||
2810 | rtx | |
2811 | gen_mem_addressof (reg, decl) | |
2812 | rtx reg; | |
2813 | tree decl; | |
2814 | { | |
8f985ec4 ZW |
2815 | rtx r = gen_rtx_ADDRESSOF (Pmode, gen_reg_rtx (GET_MODE (reg)), |
2816 | REGNO (reg), decl); | |
14a774a9 | 2817 | |
95ca22f4 | 2818 | /* If the original REG was a user-variable, then so is the REG whose |
14a774a9 | 2819 | address is being taken. Likewise for unchanging. */ |
95ca22f4 | 2820 | REG_USERVAR_P (XEXP (r, 0)) = REG_USERVAR_P (reg); |
14a774a9 | 2821 | RTX_UNCHANGING_P (XEXP (r, 0)) = RTX_UNCHANGING_P (reg); |
e9a25f70 | 2822 | |
e9a25f70 | 2823 | PUT_CODE (reg, MEM); |
ef178af3 | 2824 | XEXP (reg, 0) = r; |
8b4944fb RH |
2825 | if (decl) |
2826 | { | |
2827 | tree type = TREE_TYPE (decl); | |
2828 | ||
2829 | PUT_MODE (reg, DECL_MODE (decl)); | |
2830 | MEM_VOLATILE_P (reg) = TREE_SIDE_EFFECTS (decl); | |
2831 | MEM_SET_IN_STRUCT_P (reg, AGGREGATE_TYPE_P (type)); | |
2832 | MEM_ALIAS_SET (reg) = get_alias_set (decl); | |
e9a25f70 | 2833 | |
8b4944fb RH |
2834 | if (TREE_USED (decl) || DECL_INITIAL (decl) != 0) |
2835 | fixup_var_refs (reg, GET_MODE (reg), TREE_UNSIGNED (type), 0); | |
2836 | } | |
2837 | else | |
caa511fd JW |
2838 | { |
2839 | /* We have no alias information about this newly created MEM. */ | |
2840 | MEM_ALIAS_SET (reg) = 0; | |
2841 | ||
2842 | fixup_var_refs (reg, GET_MODE (reg), 0, 0); | |
2843 | } | |
e5e809f4 | 2844 | |
e9a25f70 JL |
2845 | return reg; |
2846 | } | |
2847 | ||
2848 | /* If DECL has an RTL that is an ADDRESSOF rtx, put it into the stack. */ | |
2849 | ||
2850 | void | |
2851 | flush_addressof (decl) | |
2852 | tree decl; | |
2853 | { | |
2854 | if ((TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == VAR_DECL) | |
2855 | && DECL_RTL (decl) != 0 | |
2856 | && GET_CODE (DECL_RTL (decl)) == MEM | |
2857 | && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF | |
2858 | && GET_CODE (XEXP (XEXP (DECL_RTL (decl), 0), 0)) == REG) | |
fe9b4957 | 2859 | put_addressof_into_stack (XEXP (DECL_RTL (decl), 0), 0); |
e9a25f70 JL |
2860 | } |
2861 | ||
2862 | /* Force the register pointed to by R, an ADDRESSOF rtx, into the stack. */ | |
2863 | ||
2864 | static void | |
fe9b4957 | 2865 | put_addressof_into_stack (r, ht) |
e9a25f70 | 2866 | rtx r; |
fe9b4957 | 2867 | struct hash_table *ht; |
e9a25f70 | 2868 | { |
8b4944fb RH |
2869 | tree decl, type; |
2870 | int volatile_p, used_p; | |
2871 | ||
e9a25f70 JL |
2872 | rtx reg = XEXP (r, 0); |
2873 | ||
2874 | if (GET_CODE (reg) != REG) | |
2875 | abort (); | |
2876 | ||
8b4944fb RH |
2877 | decl = ADDRESSOF_DECL (r); |
2878 | if (decl) | |
2879 | { | |
2880 | type = TREE_TYPE (decl); | |
2881 | volatile_p = (TREE_CODE (decl) != SAVE_EXPR | |
2882 | && TREE_THIS_VOLATILE (decl)); | |
2883 | used_p = (TREE_USED (decl) | |
2884 | || (TREE_CODE (decl) != SAVE_EXPR | |
2885 | && DECL_INITIAL (decl) != 0)); | |
2886 | } | |
2887 | else | |
2888 | { | |
2889 | type = NULL_TREE; | |
2890 | volatile_p = 0; | |
2891 | used_p = 1; | |
2892 | } | |
2893 | ||
2894 | put_reg_into_stack (0, reg, type, GET_MODE (reg), GET_MODE (reg), | |
2895 | volatile_p, ADDRESSOF_REGNO (r), used_p, ht); | |
e9a25f70 JL |
2896 | } |
2897 | ||
b5bd3b3c AS |
2898 | /* List of replacements made below in purge_addressof_1 when creating |
2899 | bitfield insertions. */ | |
8b04083b VM |
2900 | static rtx purge_bitfield_addressof_replacements; |
2901 | ||
2902 | /* List of replacements made below in purge_addressof_1 for patterns | |
2903 | (MEM (ADDRESSOF (REG ...))). The key of the list entry is the | |
2904 | corresponding (ADDRESSOF (REG ...)) and value is a substitution for | |
2905 | the all pattern. List PURGE_BITFIELD_ADDRESSOF_REPLACEMENTS is not | |
2906 | enough in complex cases, e.g. when some field values can be | |
718fe406 | 2907 | extracted by usage MEM with narrower mode. */ |
b5bd3b3c AS |
2908 | static rtx purge_addressof_replacements; |
2909 | ||
e9a25f70 JL |
2910 | /* Helper function for purge_addressof. See if the rtx expression at *LOC |
2911 | in INSN needs to be changed. If FORCE, always put any ADDRESSOFs into | |
8c36698e NC |
2912 | the stack. If the function returns FALSE then the replacement could not |
2913 | be made. */ | |
e9a25f70 | 2914 | |
8c36698e | 2915 | static boolean |
fe9b4957 | 2916 | purge_addressof_1 (loc, insn, force, store, ht) |
e9a25f70 JL |
2917 | rtx *loc; |
2918 | rtx insn; | |
f7b6d104 | 2919 | int force, store; |
fe9b4957 | 2920 | struct hash_table *ht; |
e9a25f70 JL |
2921 | { |
2922 | rtx x; | |
2923 | RTX_CODE code; | |
2924 | int i, j; | |
6f7d635c | 2925 | const char *fmt; |
8c36698e | 2926 | boolean result = true; |
e9a25f70 JL |
2927 | |
2928 | /* Re-start here to avoid recursion in common cases. */ | |
2929 | restart: | |
2930 | ||
2931 | x = *loc; | |
2932 | if (x == 0) | |
8c36698e | 2933 | return true; |
e9a25f70 JL |
2934 | |
2935 | code = GET_CODE (x); | |
2936 | ||
c5c76735 JL |
2937 | /* If we don't return in any of the cases below, we will recurse inside |
2938 | the RTX, which will normally result in any ADDRESSOF being forced into | |
2939 | memory. */ | |
2940 | if (code == SET) | |
2941 | { | |
8c36698e NC |
2942 | result = purge_addressof_1 (&SET_DEST (x), insn, force, 1, ht); |
2943 | result &= purge_addressof_1 (&SET_SRC (x), insn, force, 0, ht); | |
2944 | return result; | |
c5c76735 JL |
2945 | } |
2946 | ||
2947 | else if (code == ADDRESSOF && GET_CODE (XEXP (x, 0)) == MEM) | |
e9a25f70 | 2948 | { |
956d6950 JL |
2949 | /* We must create a copy of the rtx because it was created by |
2950 | overwriting a REG rtx which is always shared. */ | |
2951 | rtx sub = copy_rtx (XEXP (XEXP (x, 0), 0)); | |
c5c76735 | 2952 | rtx insns; |
e9a25f70 | 2953 | |
ab87f8c8 JL |
2954 | if (validate_change (insn, loc, sub, 0) |
2955 | || validate_replace_rtx (x, sub, insn)) | |
8c36698e | 2956 | return true; |
718fe406 | 2957 | |
e9a25f70 | 2958 | start_sequence (); |
ab87f8c8 JL |
2959 | sub = force_operand (sub, NULL_RTX); |
2960 | if (! validate_change (insn, loc, sub, 0) | |
2961 | && ! validate_replace_rtx (x, sub, insn)) | |
e9a25f70 JL |
2962 | abort (); |
2963 | ||
f7b6d104 | 2964 | insns = gen_sequence (); |
e9a25f70 | 2965 | end_sequence (); |
18e765cb | 2966 | emit_insn_before (insns, insn); |
8c36698e | 2967 | return true; |
e9a25f70 | 2968 | } |
c5c76735 | 2969 | |
e9a25f70 JL |
2970 | else if (code == MEM && GET_CODE (XEXP (x, 0)) == ADDRESSOF && ! force) |
2971 | { | |
2972 | rtx sub = XEXP (XEXP (x, 0), 0); | |
ab87f8c8 | 2973 | rtx sub2; |
e5e809f4 | 2974 | |
6d8ccdbb | 2975 | if (GET_CODE (sub) == MEM) |
ab87f8c8 JL |
2976 | { |
2977 | sub2 = gen_rtx_MEM (GET_MODE (x), copy_rtx (XEXP (sub, 0))); | |
2978 | MEM_COPY_ATTRIBUTES (sub2, sub); | |
ab87f8c8 JL |
2979 | sub = sub2; |
2980 | } | |
c5c76735 JL |
2981 | else if (GET_CODE (sub) == REG |
2982 | && (MEM_VOLATILE_P (x) || GET_MODE (x) == BLKmode)) | |
2983 | ; | |
e5e809f4 | 2984 | else if (GET_CODE (sub) == REG && GET_MODE (x) != GET_MODE (sub)) |
e9a25f70 | 2985 | { |
f7b6d104 RH |
2986 | int size_x, size_sub; |
2987 | ||
b5bd3b3c AS |
2988 | if (!insn) |
2989 | { | |
2990 | /* When processing REG_NOTES look at the list of | |
2991 | replacements done on the insn to find the register that X | |
2992 | was replaced by. */ | |
2993 | rtx tem; | |
2994 | ||
8b04083b VM |
2995 | for (tem = purge_bitfield_addressof_replacements; |
2996 | tem != NULL_RTX; | |
b5bd3b3c | 2997 | tem = XEXP (XEXP (tem, 1), 1)) |
8b04083b VM |
2998 | if (rtx_equal_p (x, XEXP (tem, 0))) |
2999 | { | |
3000 | *loc = XEXP (XEXP (tem, 1), 0); | |
8c36698e | 3001 | return true; |
8b04083b | 3002 | } |
fbdfe39c | 3003 | |
718fe406 | 3004 | /* See comment for purge_addressof_replacements. */ |
8b04083b VM |
3005 | for (tem = purge_addressof_replacements; |
3006 | tem != NULL_RTX; | |
3007 | tem = XEXP (XEXP (tem, 1), 1)) | |
3008 | if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0))) | |
3009 | { | |
3010 | rtx z = XEXP (XEXP (tem, 1), 0); | |
fbdfe39c | 3011 | |
8b04083b VM |
3012 | if (GET_MODE (x) == GET_MODE (z) |
3013 | || (GET_CODE (XEXP (XEXP (tem, 1), 0)) != REG | |
3014 | && GET_CODE (XEXP (XEXP (tem, 1), 0)) != SUBREG)) | |
3015 | abort (); | |
3016 | ||
3017 | /* It can happen that the note may speak of things | |
3018 | in a wider (or just different) mode than the | |
3019 | code did. This is especially true of | |
718fe406 | 3020 | REG_RETVAL. */ |
8b04083b VM |
3021 | |
3022 | if (GET_CODE (z) == SUBREG && SUBREG_WORD (z) == 0) | |
3023 | z = SUBREG_REG (z); | |
718fe406 | 3024 | |
8b04083b VM |
3025 | if (GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD |
3026 | && (GET_MODE_SIZE (GET_MODE (x)) | |
3027 | > GET_MODE_SIZE (GET_MODE (z)))) | |
3028 | { | |
3029 | /* This can occur as a result in invalid | |
718fe406 | 3030 | pointer casts, e.g. float f; ... |
8b04083b VM |
3031 | *(long long int *)&f. |
3032 | ??? We could emit a warning here, but | |
3033 | without a line number that wouldn't be | |
3034 | very helpful. */ | |
3035 | z = gen_rtx_SUBREG (GET_MODE (x), z, 0); | |
3036 | } | |
3037 | else | |
3038 | z = gen_lowpart (GET_MODE (x), z); | |
3039 | ||
3040 | *loc = z; | |
aa608fe6 | 3041 | return true; |
8b04083b | 3042 | } |
b5bd3b3c | 3043 | |
8c36698e NC |
3044 | /* Sometimes we may not be able to find the replacement. For |
3045 | example when the original insn was a MEM in a wider mode, | |
3046 | and the note is part of a sign extension of a narrowed | |
3047 | version of that MEM. Gcc testcase compile/990829-1.c can | |
3048 | generate an example of this siutation. Rather than complain | |
3049 | we return false, which will prompt our caller to remove the | |
3050 | offending note. */ | |
3051 | return false; | |
b5bd3b3c AS |
3052 | } |
3053 | ||
f7b6d104 RH |
3054 | size_x = GET_MODE_BITSIZE (GET_MODE (x)); |
3055 | size_sub = GET_MODE_BITSIZE (GET_MODE (sub)); | |
3056 | ||
3057 | /* Don't even consider working with paradoxical subregs, | |
3058 | or the moral equivalent seen here. */ | |
470032d7 | 3059 | if (size_x <= size_sub |
d006aa54 | 3060 | && int_mode_for_mode (GET_MODE (sub)) != BLKmode) |
e9a25f70 | 3061 | { |
f7b6d104 RH |
3062 | /* Do a bitfield insertion to mirror what would happen |
3063 | in memory. */ | |
3064 | ||
f7b6d104 RH |
3065 | rtx val, seq; |
3066 | ||
f7b6d104 RH |
3067 | if (store) |
3068 | { | |
fe9b4957 | 3069 | rtx p = PREV_INSN (insn); |
de0dd934 | 3070 | |
f7b6d104 RH |
3071 | start_sequence (); |
3072 | val = gen_reg_rtx (GET_MODE (x)); | |
3073 | if (! validate_change (insn, loc, val, 0)) | |
b5bd3b3c AS |
3074 | { |
3075 | /* Discard the current sequence and put the | |
3076 | ADDRESSOF on stack. */ | |
3077 | end_sequence (); | |
3078 | goto give_up; | |
3079 | } | |
f7b6d104 RH |
3080 | seq = gen_sequence (); |
3081 | end_sequence (); | |
3082 | emit_insn_before (seq, insn); | |
718fe406 | 3083 | compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (), |
fe9b4957 | 3084 | insn, ht); |
718fe406 | 3085 | |
f7b6d104 | 3086 | start_sequence (); |
47401c4d | 3087 | store_bit_field (sub, size_x, 0, GET_MODE (x), |
f7b6d104 | 3088 | val, GET_MODE_SIZE (GET_MODE (sub)), |
19caa751 | 3089 | GET_MODE_ALIGNMENT (GET_MODE (sub))); |
f7b6d104 | 3090 | |
de0dd934 R |
3091 | /* Make sure to unshare any shared rtl that store_bit_field |
3092 | might have created. */ | |
d1b81779 | 3093 | unshare_all_rtl_again (get_insns ()); |
de0dd934 | 3094 | |
f7b6d104 RH |
3095 | seq = gen_sequence (); |
3096 | end_sequence (); | |
fe9b4957 MM |
3097 | p = emit_insn_after (seq, insn); |
3098 | if (NEXT_INSN (insn)) | |
718fe406 | 3099 | compute_insns_for_mem (NEXT_INSN (insn), |
fe9b4957 MM |
3100 | p ? NEXT_INSN (p) : NULL_RTX, |
3101 | ht); | |
f7b6d104 RH |
3102 | } |
3103 | else | |
3104 | { | |
fe9b4957 MM |
3105 | rtx p = PREV_INSN (insn); |
3106 | ||
f7b6d104 | 3107 | start_sequence (); |
47401c4d | 3108 | val = extract_bit_field (sub, size_x, 0, 1, NULL_RTX, |
f7b6d104 RH |
3109 | GET_MODE (x), GET_MODE (x), |
3110 | GET_MODE_SIZE (GET_MODE (sub)), | |
3111 | GET_MODE_SIZE (GET_MODE (sub))); | |
3112 | ||
f7b6d104 | 3113 | if (! validate_change (insn, loc, val, 0)) |
b5bd3b3c AS |
3114 | { |
3115 | /* Discard the current sequence and put the | |
3116 | ADDRESSOF on stack. */ | |
3117 | end_sequence (); | |
3118 | goto give_up; | |
3119 | } | |
f7b6d104 RH |
3120 | |
3121 | seq = gen_sequence (); | |
3122 | end_sequence (); | |
3123 | emit_insn_before (seq, insn); | |
fe9b4957 MM |
3124 | compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (), |
3125 | insn, ht); | |
f7b6d104 RH |
3126 | } |
3127 | ||
b5bd3b3c AS |
3128 | /* Remember the replacement so that the same one can be done |
3129 | on the REG_NOTES. */ | |
8b04083b | 3130 | purge_bitfield_addressof_replacements |
b5bd3b3c | 3131 | = gen_rtx_EXPR_LIST (VOIDmode, x, |
8b04083b VM |
3132 | gen_rtx_EXPR_LIST |
3133 | (VOIDmode, val, | |
3134 | purge_bitfield_addressof_replacements)); | |
b5bd3b3c | 3135 | |
f7b6d104 | 3136 | /* We replaced with a reg -- all done. */ |
8c36698e | 3137 | return true; |
e9a25f70 JL |
3138 | } |
3139 | } | |
c5c76735 | 3140 | |
e9a25f70 | 3141 | else if (validate_change (insn, loc, sub, 0)) |
fbdfe39c RH |
3142 | { |
3143 | /* Remember the replacement so that the same one can be done | |
3144 | on the REG_NOTES. */ | |
8b04083b VM |
3145 | if (GET_CODE (sub) == REG || GET_CODE (sub) == SUBREG) |
3146 | { | |
3147 | rtx tem; | |
3148 | ||
3149 | for (tem = purge_addressof_replacements; | |
3150 | tem != NULL_RTX; | |
3151 | tem = XEXP (XEXP (tem, 1), 1)) | |
3152 | if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0))) | |
3153 | { | |
3154 | XEXP (XEXP (tem, 1), 0) = sub; | |
8c36698e | 3155 | return true; |
8b04083b VM |
3156 | } |
3157 | purge_addressof_replacements | |
3158 | = gen_rtx (EXPR_LIST, VOIDmode, XEXP (x, 0), | |
3159 | gen_rtx_EXPR_LIST (VOIDmode, sub, | |
3160 | purge_addressof_replacements)); | |
8c36698e | 3161 | return true; |
8b04083b | 3162 | } |
fbdfe39c RH |
3163 | goto restart; |
3164 | } | |
b5bd3b3c | 3165 | give_up:; |
e9a25f70 JL |
3166 | /* else give up and put it into the stack */ |
3167 | } | |
c5c76735 | 3168 | |
e9a25f70 JL |
3169 | else if (code == ADDRESSOF) |
3170 | { | |
fe9b4957 | 3171 | put_addressof_into_stack (x, ht); |
aa608fe6 | 3172 | return true; |
e9a25f70 | 3173 | } |
f7b6d104 RH |
3174 | else if (code == SET) |
3175 | { | |
8c36698e NC |
3176 | result = purge_addressof_1 (&SET_DEST (x), insn, force, 1, ht); |
3177 | result &= purge_addressof_1 (&SET_SRC (x), insn, force, 0, ht); | |
3178 | return result; | |
f7b6d104 | 3179 | } |
e9a25f70 | 3180 | |
718fe406 | 3181 | /* Scan all subexpressions. */ |
e9a25f70 JL |
3182 | fmt = GET_RTX_FORMAT (code); |
3183 | for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++) | |
3184 | { | |
3185 | if (*fmt == 'e') | |
8c36698e | 3186 | result &= purge_addressof_1 (&XEXP (x, i), insn, force, 0, ht); |
e9a25f70 JL |
3187 | else if (*fmt == 'E') |
3188 | for (j = 0; j < XVECLEN (x, i); j++) | |
8c36698e | 3189 | result &= purge_addressof_1 (&XVECEXP (x, i, j), insn, force, 0, ht); |
fe9b4957 | 3190 | } |
8c36698e NC |
3191 | |
3192 | return result; | |
fe9b4957 MM |
3193 | } |
3194 | ||
3195 | /* Return a new hash table entry in HT. */ | |
3196 | ||
3197 | static struct hash_entry * | |
3198 | insns_for_mem_newfunc (he, ht, k) | |
3199 | struct hash_entry *he; | |
3200 | struct hash_table *ht; | |
3201 | hash_table_key k ATTRIBUTE_UNUSED; | |
3202 | { | |
3203 | struct insns_for_mem_entry *ifmhe; | |
3204 | if (he) | |
3205 | return he; | |
3206 | ||
3207 | ifmhe = ((struct insns_for_mem_entry *) | |
3208 | hash_allocate (ht, sizeof (struct insns_for_mem_entry))); | |
3209 | ifmhe->insns = NULL_RTX; | |
3210 | ||
3211 | return &ifmhe->he; | |
3212 | } | |
3213 | ||
3214 | /* Return a hash value for K, a REG. */ | |
3215 | ||
3216 | static unsigned long | |
3217 | insns_for_mem_hash (k) | |
3218 | hash_table_key k; | |
3219 | { | |
3220 | /* K is really a RTX. Just use the address as the hash value. */ | |
3221 | return (unsigned long) k; | |
3222 | } | |
3223 | ||
3224 | /* Return non-zero if K1 and K2 (two REGs) are the same. */ | |
3225 | ||
3226 | static boolean | |
3227 | insns_for_mem_comp (k1, k2) | |
3228 | hash_table_key k1; | |
3229 | hash_table_key k2; | |
3230 | { | |
3231 | return k1 == k2; | |
3232 | } | |
3233 | ||
3234 | struct insns_for_mem_walk_info { | |
3235 | /* The hash table that we are using to record which INSNs use which | |
3236 | MEMs. */ | |
3237 | struct hash_table *ht; | |
3238 | ||
3239 | /* The INSN we are currently proessing. */ | |
3240 | rtx insn; | |
3241 | ||
3242 | /* Zero if we are walking to find ADDRESSOFs, one if we are walking | |
3243 | to find the insns that use the REGs in the ADDRESSOFs. */ | |
3244 | int pass; | |
3245 | }; | |
3246 | ||
3247 | /* Called from compute_insns_for_mem via for_each_rtx. If R is a REG | |
3248 | that might be used in an ADDRESSOF expression, record this INSN in | |
3249 | the hash table given by DATA (which is really a pointer to an | |
3250 | insns_for_mem_walk_info structure). */ | |
3251 | ||
3252 | static int | |
3253 | insns_for_mem_walk (r, data) | |
3254 | rtx *r; | |
3255 | void *data; | |
3256 | { | |
718fe406 | 3257 | struct insns_for_mem_walk_info *ifmwi |
fe9b4957 MM |
3258 | = (struct insns_for_mem_walk_info *) data; |
3259 | ||
3260 | if (ifmwi->pass == 0 && *r && GET_CODE (*r) == ADDRESSOF | |
3261 | && GET_CODE (XEXP (*r, 0)) == REG) | |
3262 | hash_lookup (ifmwi->ht, XEXP (*r, 0), /*create=*/1, /*copy=*/0); | |
3263 | else if (ifmwi->pass == 1 && *r && GET_CODE (*r) == REG) | |
3264 | { | |
3265 | /* Lookup this MEM in the hashtable, creating it if necessary. */ | |
718fe406 | 3266 | struct insns_for_mem_entry *ifme |
fe9b4957 MM |
3267 | = (struct insns_for_mem_entry *) hash_lookup (ifmwi->ht, |
3268 | *r, | |
3269 | /*create=*/0, | |
3270 | /*copy=*/0); | |
3271 | ||
3272 | /* If we have not already recorded this INSN, do so now. Since | |
3273 | we process the INSNs in order, we know that if we have | |
3274 | recorded it it must be at the front of the list. */ | |
3275 | if (ifme && (!ifme->insns || XEXP (ifme->insns, 0) != ifmwi->insn)) | |
3276 | { | |
3277 | /* We do the allocation on the same obstack as is used for | |
3278 | the hash table since this memory will not be used once | |
3279 | the hash table is deallocated. */ | |
3280 | push_obstacks (&ifmwi->ht->memory, &ifmwi->ht->memory); | |
718fe406 | 3281 | ifme->insns = gen_rtx_EXPR_LIST (VOIDmode, ifmwi->insn, |
fe9b4957 MM |
3282 | ifme->insns); |
3283 | pop_obstacks (); | |
3284 | } | |
e9a25f70 | 3285 | } |
fe9b4957 MM |
3286 | |
3287 | return 0; | |
3288 | } | |
3289 | ||
3290 | /* Walk the INSNS, until we reach LAST_INSN, recording which INSNs use | |
3291 | which REGs in HT. */ | |
3292 | ||
3293 | static void | |
3294 | compute_insns_for_mem (insns, last_insn, ht) | |
3295 | rtx insns; | |
3296 | rtx last_insn; | |
3297 | struct hash_table *ht; | |
3298 | { | |
3299 | rtx insn; | |
3300 | struct insns_for_mem_walk_info ifmwi; | |
3301 | ifmwi.ht = ht; | |
3302 | ||
3303 | for (ifmwi.pass = 0; ifmwi.pass < 2; ++ifmwi.pass) | |
3304 | for (insn = insns; insn != last_insn; insn = NEXT_INSN (insn)) | |
2c3c49de | 3305 | if (INSN_P (insn)) |
fe9b4957 MM |
3306 | { |
3307 | ifmwi.insn = insn; | |
3308 | for_each_rtx (&insn, insns_for_mem_walk, &ifmwi); | |
3309 | } | |
e9a25f70 JL |
3310 | } |
3311 | ||
8c36698e NC |
3312 | /* Helper function for purge_addressof called through for_each_rtx. |
3313 | Returns true iff the rtl is an ADDRESSOF. */ | |
3314 | static int | |
3315 | is_addressof (rtl, data) | |
718fe406 KH |
3316 | rtx *rtl; |
3317 | void *data ATTRIBUTE_UNUSED; | |
8c36698e | 3318 | { |
718fe406 | 3319 | return GET_CODE (*rtl) == ADDRESSOF; |
8c36698e NC |
3320 | } |
3321 | ||
e9a25f70 JL |
3322 | /* Eliminate all occurrences of ADDRESSOF from INSNS. Elide any remaining |
3323 | (MEM (ADDRESSOF)) patterns, and force any needed registers into the | |
3324 | stack. */ | |
3325 | ||
3326 | void | |
3327 | purge_addressof (insns) | |
3328 | rtx insns; | |
3329 | { | |
3330 | rtx insn; | |
fe9b4957 | 3331 | struct hash_table ht; |
718fe406 | 3332 | |
fe9b4957 MM |
3333 | /* When we actually purge ADDRESSOFs, we turn REGs into MEMs. That |
3334 | requires a fixup pass over the instruction stream to correct | |
3335 | INSNs that depended on the REG being a REG, and not a MEM. But, | |
bedda2da | 3336 | these fixup passes are slow. Furthermore, most MEMs are not |
fe9b4957 MM |
3337 | mentioned in very many instructions. So, we speed up the process |
3338 | by pre-calculating which REGs occur in which INSNs; that allows | |
3339 | us to perform the fixup passes much more quickly. */ | |
718fe406 | 3340 | hash_table_init (&ht, |
fe9b4957 MM |
3341 | insns_for_mem_newfunc, |
3342 | insns_for_mem_hash, | |
3343 | insns_for_mem_comp); | |
3344 | compute_insns_for_mem (insns, NULL_RTX, &ht); | |
3345 | ||
e9a25f70 JL |
3346 | for (insn = insns; insn; insn = NEXT_INSN (insn)) |
3347 | if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN | |
3348 | || GET_CODE (insn) == CALL_INSN) | |
3349 | { | |
8c36698e NC |
3350 | if (! purge_addressof_1 (&PATTERN (insn), insn, |
3351 | asm_noperands (PATTERN (insn)) > 0, 0, &ht)) | |
3352 | /* If we could not replace the ADDRESSOFs in the insn, | |
3353 | something is wrong. */ | |
3354 | abort (); | |
718fe406 | 3355 | |
8c36698e NC |
3356 | if (! purge_addressof_1 (®_NOTES (insn), NULL_RTX, 0, 0, &ht)) |
3357 | { | |
3358 | /* If we could not replace the ADDRESSOFs in the insn's notes, | |
3359 | we can just remove the offending notes instead. */ | |
3360 | rtx note; | |
3361 | ||
3362 | for (note = REG_NOTES (insn); note; note = XEXP (note, 1)) | |
3363 | { | |
3364 | /* If we find a REG_RETVAL note then the insn is a libcall. | |
3365 | Such insns must have REG_EQUAL notes as well, in order | |
3366 | for later passes of the compiler to work. So it is not | |
3367 | safe to delete the notes here, and instead we abort. */ | |
3368 | if (REG_NOTE_KIND (note) == REG_RETVAL) | |
3369 | abort (); | |
718fe406 | 3370 | if (for_each_rtx (¬e, is_addressof, NULL)) |
8c36698e NC |
3371 | remove_note (insn, note); |
3372 | } | |
3373 | } | |
e9a25f70 | 3374 | } |
fe9b4957 MM |
3375 | |
3376 | /* Clean up. */ | |
3377 | hash_table_free (&ht); | |
8b04083b | 3378 | purge_bitfield_addressof_replacements = 0; |
da9b1f9c | 3379 | purge_addressof_replacements = 0; |
4fa48eae JL |
3380 | |
3381 | /* REGs are shared. purge_addressof will destructively replace a REG | |
3382 | with a MEM, which creates shared MEMs. | |
3383 | ||
3384 | Unfortunately, the children of put_reg_into_stack assume that MEMs | |
3385 | referring to the same stack slot are shared (fixup_var_refs and | |
3386 | the associated hash table code). | |
3387 | ||
3388 | So, we have to do another unsharing pass after we have flushed any | |
3389 | REGs that had their address taken into the stack. | |
3390 | ||
3391 | It may be worth tracking whether or not we converted any REGs into | |
3392 | MEMs to avoid this overhead when it is not needed. */ | |
3393 | unshare_all_rtl_again (get_insns ()); | |
e9a25f70 JL |
3394 | } |
3395 | \f | |
6f086dfc RS |
3396 | /* Pass through the INSNS of function FNDECL and convert virtual register |
3397 | references to hard register references. */ | |
3398 | ||
3399 | void | |
3400 | instantiate_virtual_regs (fndecl, insns) | |
3401 | tree fndecl; | |
3402 | rtx insns; | |
3403 | { | |
3404 | rtx insn; | |
770ae6cc | 3405 | unsigned int i; |
6f086dfc RS |
3406 | |
3407 | /* Compute the offsets to use for this function. */ | |
3408 | in_arg_offset = FIRST_PARM_OFFSET (fndecl); | |
3409 | var_offset = STARTING_FRAME_OFFSET; | |
3410 | dynamic_offset = STACK_DYNAMIC_OFFSET (fndecl); | |
3411 | out_arg_offset = STACK_POINTER_OFFSET; | |
2c849145 | 3412 | cfa_offset = ARG_POINTER_CFA_OFFSET (fndecl); |
6f086dfc RS |
3413 | |
3414 | /* Scan all variables and parameters of this function. For each that is | |
3415 | in memory, instantiate all virtual registers if the result is a valid | |
3416 | address. If not, we do it later. That will handle most uses of virtual | |
3417 | regs on many machines. */ | |
3418 | instantiate_decls (fndecl, 1); | |
3419 | ||
3420 | /* Initialize recognition, indicating that volatile is OK. */ | |
3421 | init_recog (); | |
3422 | ||
3423 | /* Scan through all the insns, instantiating every virtual register still | |
3424 | present. */ | |
3425 | for (insn = insns; insn; insn = NEXT_INSN (insn)) | |
3426 | if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN | |
3427 | || GET_CODE (insn) == CALL_INSN) | |
3428 | { | |
3429 | instantiate_virtual_regs_1 (&PATTERN (insn), insn, 1); | |
5f4f0e22 | 3430 | instantiate_virtual_regs_1 (®_NOTES (insn), NULL_RTX, 0); |
6f086dfc RS |
3431 | } |
3432 | ||
e9a25f70 JL |
3433 | /* Instantiate the stack slots for the parm registers, for later use in |
3434 | addressof elimination. */ | |
3435 | for (i = 0; i < max_parm_reg; ++i) | |
3436 | if (parm_reg_stack_loc[i]) | |
3437 | instantiate_virtual_regs_1 (&parm_reg_stack_loc[i], NULL_RTX, 0); | |
3438 | ||
6f086dfc RS |
3439 | /* Now instantiate the remaining register equivalences for debugging info. |
3440 | These will not be valid addresses. */ | |
3441 | instantiate_decls (fndecl, 0); | |
3442 | ||
3443 | /* Indicate that, from now on, assign_stack_local should use | |
3444 | frame_pointer_rtx. */ | |
3445 | virtuals_instantiated = 1; | |
3446 | } | |
3447 | ||
3448 | /* Scan all decls in FNDECL (both variables and parameters) and instantiate | |
3449 | all virtual registers in their DECL_RTL's. | |
3450 | ||
3451 | If VALID_ONLY, do this only if the resulting address is still valid. | |
3452 | Otherwise, always do it. */ | |
3453 | ||
3454 | static void | |
3455 | instantiate_decls (fndecl, valid_only) | |
3456 | tree fndecl; | |
3457 | int valid_only; | |
3458 | { | |
3459 | tree decl; | |
3460 | ||
e1686233 | 3461 | if (DECL_SAVED_INSNS (fndecl)) |
6f086dfc RS |
3462 | /* When compiling an inline function, the obstack used for |
3463 | rtl allocation is the maybepermanent_obstack. Calling | |
3464 | `resume_temporary_allocation' switches us back to that | |
3465 | obstack while we process this function's parameters. */ | |
3466 | resume_temporary_allocation (); | |
3467 | ||
3468 | /* Process all parameters of the function. */ | |
3469 | for (decl = DECL_ARGUMENTS (fndecl); decl; decl = TREE_CHAIN (decl)) | |
3470 | { | |
e5e809f4 JL |
3471 | HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (decl)); |
3472 | ||
718fe406 | 3473 | instantiate_decl (DECL_RTL (decl), size, valid_only); |
ce717ce4 JW |
3474 | |
3475 | /* If the parameter was promoted, then the incoming RTL mode may be | |
3476 | larger than the declared type size. We must use the larger of | |
3477 | the two sizes. */ | |
3478 | size = MAX (GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl))), size); | |
3479 | instantiate_decl (DECL_INCOMING_RTL (decl), size, valid_only); | |
6f086dfc RS |
3480 | } |
3481 | ||
0f41302f | 3482 | /* Now process all variables defined in the function or its subblocks. */ |
6f086dfc RS |
3483 | instantiate_decls_1 (DECL_INITIAL (fndecl), valid_only); |
3484 | ||
79c0672e | 3485 | if (DECL_INLINE (fndecl) || DECL_DEFER_OUTPUT (fndecl)) |
6f086dfc RS |
3486 | { |
3487 | /* Save all rtl allocated for this function by raising the | |
3488 | high-water mark on the maybepermanent_obstack. */ | |
3489 | preserve_data (); | |
3490 | /* All further rtl allocation is now done in the current_obstack. */ | |
3491 | rtl_in_current_obstack (); | |
3492 | } | |
3493 | } | |
3494 | ||
3495 | /* Subroutine of instantiate_decls: Process all decls in the given | |
3496 | BLOCK node and all its subblocks. */ | |
3497 | ||
3498 | static void | |
3499 | instantiate_decls_1 (let, valid_only) | |
3500 | tree let; | |
3501 | int valid_only; | |
3502 | { | |
3503 | tree t; | |
3504 | ||
3505 | for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t)) | |
5a73491b RK |
3506 | instantiate_decl (DECL_RTL (t), int_size_in_bytes (TREE_TYPE (t)), |
3507 | valid_only); | |
6f086dfc RS |
3508 | |
3509 | /* Process all subblocks. */ | |
3510 | for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t)) | |
3511 | instantiate_decls_1 (t, valid_only); | |
3512 | } | |
5a73491b | 3513 | |
8008b228 | 3514 | /* Subroutine of the preceding procedures: Given RTL representing a |
5a73491b RK |
3515 | decl and the size of the object, do any instantiation required. |
3516 | ||
3517 | If VALID_ONLY is non-zero, it means that the RTL should only be | |
3518 | changed if the new address is valid. */ | |
3519 | ||
3520 | static void | |
3521 | instantiate_decl (x, size, valid_only) | |
3522 | rtx x; | |
770ae6cc | 3523 | HOST_WIDE_INT size; |
5a73491b RK |
3524 | int valid_only; |
3525 | { | |
3526 | enum machine_mode mode; | |
3527 | rtx addr; | |
3528 | ||
3529 | /* If this is not a MEM, no need to do anything. Similarly if the | |
3530 | address is a constant or a register that is not a virtual register. */ | |
3531 | ||
3532 | if (x == 0 || GET_CODE (x) != MEM) | |
3533 | return; | |
3534 | ||
3535 | addr = XEXP (x, 0); | |
3536 | if (CONSTANT_P (addr) | |
956d6950 | 3537 | || (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == REG) |
5a73491b RK |
3538 | || (GET_CODE (addr) == REG |
3539 | && (REGNO (addr) < FIRST_VIRTUAL_REGISTER | |
3540 | || REGNO (addr) > LAST_VIRTUAL_REGISTER))) | |
3541 | return; | |
3542 | ||
3543 | /* If we should only do this if the address is valid, copy the address. | |
3544 | We need to do this so we can undo any changes that might make the | |
3545 | address invalid. This copy is unfortunate, but probably can't be | |
3546 | avoided. */ | |
3547 | ||
3548 | if (valid_only) | |
3549 | addr = copy_rtx (addr); | |
3550 | ||
3551 | instantiate_virtual_regs_1 (&addr, NULL_RTX, 0); | |
3552 | ||
770ae6cc | 3553 | if (valid_only && size >= 0) |
87ce34d6 | 3554 | { |
770ae6cc RK |
3555 | unsigned HOST_WIDE_INT decl_size = size; |
3556 | ||
87ce34d6 JW |
3557 | /* Now verify that the resulting address is valid for every integer or |
3558 | floating-point mode up to and including SIZE bytes long. We do this | |
3559 | since the object might be accessed in any mode and frame addresses | |
3560 | are shared. */ | |
3561 | ||
3562 | for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); | |
770ae6cc | 3563 | mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size; |
87ce34d6 JW |
3564 | mode = GET_MODE_WIDER_MODE (mode)) |
3565 | if (! memory_address_p (mode, addr)) | |
3566 | return; | |
5a73491b | 3567 | |
87ce34d6 | 3568 | for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); |
770ae6cc | 3569 | mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size; |
87ce34d6 JW |
3570 | mode = GET_MODE_WIDER_MODE (mode)) |
3571 | if (! memory_address_p (mode, addr)) | |
3572 | return; | |
3573 | } | |
5a73491b | 3574 | |
87ce34d6 JW |
3575 | /* Put back the address now that we have updated it and we either know |
3576 | it is valid or we don't care whether it is valid. */ | |
5a73491b RK |
3577 | |
3578 | XEXP (x, 0) = addr; | |
3579 | } | |
6f086dfc RS |
3580 | \f |
3581 | /* Given a pointer to a piece of rtx and an optional pointer to the | |
3582 | containing object, instantiate any virtual registers present in it. | |
3583 | ||
3584 | If EXTRA_INSNS, we always do the replacement and generate | |
3585 | any extra insns before OBJECT. If it zero, we do nothing if replacement | |
3586 | is not valid. | |
3587 | ||
3588 | Return 1 if we either had nothing to do or if we were able to do the | |
718fe406 | 3589 | needed replacement. Return 0 otherwise; we only return zero if |
6f086dfc RS |
3590 | EXTRA_INSNS is zero. |
3591 | ||
3592 | We first try some simple transformations to avoid the creation of extra | |
3593 | pseudos. */ | |
3594 | ||
3595 | static int | |
3596 | instantiate_virtual_regs_1 (loc, object, extra_insns) | |
3597 | rtx *loc; | |
3598 | rtx object; | |
3599 | int extra_insns; | |
3600 | { | |
3601 | rtx x; | |
3602 | RTX_CODE code; | |
3603 | rtx new = 0; | |
07444f1d | 3604 | HOST_WIDE_INT offset = 0; |
6f086dfc RS |
3605 | rtx temp; |
3606 | rtx seq; | |
3607 | int i, j; | |
6f7d635c | 3608 | const char *fmt; |
6f086dfc RS |
3609 | |
3610 | /* Re-start here to avoid recursion in common cases. */ | |
3611 | restart: | |
3612 | ||
3613 | x = *loc; | |
3614 | if (x == 0) | |
3615 | return 1; | |
3616 | ||
3617 | code = GET_CODE (x); | |
3618 | ||
3619 | /* Check for some special cases. */ | |
3620 | switch (code) | |
3621 | { | |
3622 | case CONST_INT: | |
3623 | case CONST_DOUBLE: | |
3624 | case CONST: | |
3625 | case SYMBOL_REF: | |
3626 | case CODE_LABEL: | |
3627 | case PC: | |
3628 | case CC0: | |
3629 | case ASM_INPUT: | |
3630 | case ADDR_VEC: | |
3631 | case ADDR_DIFF_VEC: | |
3632 | case RETURN: | |
3633 | return 1; | |
3634 | ||
3635 | case SET: | |
3636 | /* We are allowed to set the virtual registers. This means that | |
38e01259 | 3637 | the actual register should receive the source minus the |
6f086dfc RS |
3638 | appropriate offset. This is used, for example, in the handling |
3639 | of non-local gotos. */ | |
3640 | if (SET_DEST (x) == virtual_incoming_args_rtx) | |
718fe406 | 3641 | new = arg_pointer_rtx, offset = -in_arg_offset; |
6f086dfc | 3642 | else if (SET_DEST (x) == virtual_stack_vars_rtx) |
718fe406 | 3643 | new = frame_pointer_rtx, offset = -var_offset; |
6f086dfc | 3644 | else if (SET_DEST (x) == virtual_stack_dynamic_rtx) |
718fe406 | 3645 | new = stack_pointer_rtx, offset = -dynamic_offset; |
6f086dfc | 3646 | else if (SET_DEST (x) == virtual_outgoing_args_rtx) |
718fe406 | 3647 | new = stack_pointer_rtx, offset = -out_arg_offset; |
71038426 | 3648 | else if (SET_DEST (x) == virtual_cfa_rtx) |
718fe406 | 3649 | new = arg_pointer_rtx, offset = -cfa_offset; |
6f086dfc RS |
3650 | |
3651 | if (new) | |
3652 | { | |
14a774a9 RK |
3653 | rtx src = SET_SRC (x); |
3654 | ||
3655 | instantiate_virtual_regs_1 (&src, NULL_RTX, 0); | |
3656 | ||
6f086dfc RS |
3657 | /* The only valid sources here are PLUS or REG. Just do |
3658 | the simplest possible thing to handle them. */ | |
14a774a9 | 3659 | if (GET_CODE (src) != REG && GET_CODE (src) != PLUS) |
6f086dfc RS |
3660 | abort (); |
3661 | ||
3662 | start_sequence (); | |
14a774a9 RK |
3663 | if (GET_CODE (src) != REG) |
3664 | temp = force_operand (src, NULL_RTX); | |
6f086dfc | 3665 | else |
14a774a9 | 3666 | temp = src; |
5f4f0e22 | 3667 | temp = force_operand (plus_constant (temp, offset), NULL_RTX); |
6f086dfc RS |
3668 | seq = get_insns (); |
3669 | end_sequence (); | |
3670 | ||
3671 | emit_insns_before (seq, object); | |
3672 | SET_DEST (x) = new; | |
3673 | ||
e9a25f70 | 3674 | if (! validate_change (object, &SET_SRC (x), temp, 0) |
6f086dfc RS |
3675 | || ! extra_insns) |
3676 | abort (); | |
3677 | ||
3678 | return 1; | |
3679 | } | |
3680 | ||
3681 | instantiate_virtual_regs_1 (&SET_DEST (x), object, extra_insns); | |
3682 | loc = &SET_SRC (x); | |
3683 | goto restart; | |
3684 | ||
3685 | case PLUS: | |
3686 | /* Handle special case of virtual register plus constant. */ | |
3687 | if (CONSTANT_P (XEXP (x, 1))) | |
3688 | { | |
b1f82ccf | 3689 | rtx old, new_offset; |
6f086dfc RS |
3690 | |
3691 | /* Check for (plus (plus VIRT foo) (const_int)) first. */ | |
3692 | if (GET_CODE (XEXP (x, 0)) == PLUS) | |
3693 | { | |
3694 | rtx inner = XEXP (XEXP (x, 0), 0); | |
3695 | ||
3696 | if (inner == virtual_incoming_args_rtx) | |
3697 | new = arg_pointer_rtx, offset = in_arg_offset; | |
3698 | else if (inner == virtual_stack_vars_rtx) | |
3699 | new = frame_pointer_rtx, offset = var_offset; | |
3700 | else if (inner == virtual_stack_dynamic_rtx) | |
3701 | new = stack_pointer_rtx, offset = dynamic_offset; | |
3702 | else if (inner == virtual_outgoing_args_rtx) | |
3703 | new = stack_pointer_rtx, offset = out_arg_offset; | |
71038426 | 3704 | else if (inner == virtual_cfa_rtx) |
718fe406 | 3705 | new = arg_pointer_rtx, offset = cfa_offset; |
6f086dfc RS |
3706 | else |
3707 | { | |
3708 | loc = &XEXP (x, 0); | |
3709 | goto restart; | |
3710 | } | |
3711 | ||
3712 | instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 1), object, | |
3713 | extra_insns); | |
38a448ca | 3714 | new = gen_rtx_PLUS (Pmode, new, XEXP (XEXP (x, 0), 1)); |
6f086dfc RS |
3715 | } |
3716 | ||
3717 | else if (XEXP (x, 0) == virtual_incoming_args_rtx) | |
3718 | new = arg_pointer_rtx, offset = in_arg_offset; | |
3719 | else if (XEXP (x, 0) == virtual_stack_vars_rtx) | |
3720 | new = frame_pointer_rtx, offset = var_offset; | |
3721 | else if (XEXP (x, 0) == virtual_stack_dynamic_rtx) | |
3722 | new = stack_pointer_rtx, offset = dynamic_offset; | |
3723 | else if (XEXP (x, 0) == virtual_outgoing_args_rtx) | |
3724 | new = stack_pointer_rtx, offset = out_arg_offset; | |
718fe406 KH |
3725 | else if (XEXP (x, 0) == virtual_cfa_rtx) |
3726 | new = arg_pointer_rtx, offset = cfa_offset; | |
6f086dfc RS |
3727 | else |
3728 | { | |
3729 | /* We know the second operand is a constant. Unless the | |
3730 | first operand is a REG (which has been already checked), | |
3731 | it needs to be checked. */ | |
3732 | if (GET_CODE (XEXP (x, 0)) != REG) | |
3733 | { | |
3734 | loc = &XEXP (x, 0); | |
3735 | goto restart; | |
3736 | } | |
3737 | return 1; | |
3738 | } | |
3739 | ||
b1f82ccf | 3740 | new_offset = plus_constant (XEXP (x, 1), offset); |
6f086dfc | 3741 | |
b1f82ccf DE |
3742 | /* If the new constant is zero, try to replace the sum with just |
3743 | the register. */ | |
3744 | if (new_offset == const0_rtx | |
3745 | && validate_change (object, loc, new, 0)) | |
6f086dfc RS |
3746 | return 1; |
3747 | ||
b1f82ccf DE |
3748 | /* Next try to replace the register and new offset. |
3749 | There are two changes to validate here and we can't assume that | |
3750 | in the case of old offset equals new just changing the register | |
3751 | will yield a valid insn. In the interests of a little efficiency, | |
3752 | however, we only call validate change once (we don't queue up the | |
0f41302f | 3753 | changes and then call apply_change_group). */ |
b1f82ccf DE |
3754 | |
3755 | old = XEXP (x, 0); | |
3756 | if (offset == 0 | |
3757 | ? ! validate_change (object, &XEXP (x, 0), new, 0) | |
3758 | : (XEXP (x, 0) = new, | |
3759 | ! validate_change (object, &XEXP (x, 1), new_offset, 0))) | |
6f086dfc RS |
3760 | { |
3761 | if (! extra_insns) | |
3762 | { | |
3763 | XEXP (x, 0) = old; | |
3764 | return 0; | |
3765 | } | |
3766 | ||
3767 | /* Otherwise copy the new constant into a register and replace | |
3768 | constant with that register. */ | |
3769 | temp = gen_reg_rtx (Pmode); | |
b1f82ccf | 3770 | XEXP (x, 0) = new; |
6f086dfc | 3771 | if (validate_change (object, &XEXP (x, 1), temp, 0)) |
b1f82ccf | 3772 | emit_insn_before (gen_move_insn (temp, new_offset), object); |
6f086dfc RS |
3773 | else |
3774 | { | |
3775 | /* If that didn't work, replace this expression with a | |
3776 | register containing the sum. */ | |
3777 | ||
6f086dfc | 3778 | XEXP (x, 0) = old; |
38a448ca | 3779 | new = gen_rtx_PLUS (Pmode, new, new_offset); |
6f086dfc RS |
3780 | |
3781 | start_sequence (); | |
5f4f0e22 | 3782 | temp = force_operand (new, NULL_RTX); |
6f086dfc RS |
3783 | seq = get_insns (); |
3784 | end_sequence (); | |
3785 | ||
3786 | emit_insns_before (seq, object); | |
3787 | if (! validate_change (object, loc, temp, 0) | |
3788 | && ! validate_replace_rtx (x, temp, object)) | |
3789 | abort (); | |
3790 | } | |
3791 | } | |
3792 | ||
3793 | return 1; | |
3794 | } | |
3795 | ||
3796 | /* Fall through to generic two-operand expression case. */ | |
3797 | case EXPR_LIST: | |
3798 | case CALL: | |
3799 | case COMPARE: | |
3800 | case MINUS: | |
3801 | case MULT: | |
3802 | case DIV: case UDIV: | |
3803 | case MOD: case UMOD: | |
3804 | case AND: case IOR: case XOR: | |
45620ed4 RK |
3805 | case ROTATERT: case ROTATE: |
3806 | case ASHIFTRT: case LSHIFTRT: case ASHIFT: | |
6f086dfc RS |
3807 | case NE: case EQ: |
3808 | case GE: case GT: case GEU: case GTU: | |
3809 | case LE: case LT: case LEU: case LTU: | |
3810 | if (XEXP (x, 1) && ! CONSTANT_P (XEXP (x, 1))) | |
3811 | instantiate_virtual_regs_1 (&XEXP (x, 1), object, extra_insns); | |
3812 | loc = &XEXP (x, 0); | |
3813 | goto restart; | |
3814 | ||
3815 | case MEM: | |
3816 | /* Most cases of MEM that convert to valid addresses have already been | |
4fd796bb | 3817 | handled by our scan of decls. The only special handling we |
6f086dfc | 3818 | need here is to make a copy of the rtx to ensure it isn't being |
718fe406 | 3819 | shared if we have to change it to a pseudo. |
6f086dfc RS |
3820 | |
3821 | If the rtx is a simple reference to an address via a virtual register, | |
3822 | it can potentially be shared. In such cases, first try to make it | |
3823 | a valid address, which can also be shared. Otherwise, copy it and | |
718fe406 | 3824 | proceed normally. |
6f086dfc RS |
3825 | |
3826 | First check for common cases that need no processing. These are | |
3827 | usually due to instantiation already being done on a previous instance | |
3828 | of a shared rtx. */ | |
3829 | ||
3830 | temp = XEXP (x, 0); | |
3831 | if (CONSTANT_ADDRESS_P (temp) | |
3832 | #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM | |
3833 | || temp == arg_pointer_rtx | |
b37f453b DE |
3834 | #endif |
3835 | #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM | |
3836 | || temp == hard_frame_pointer_rtx | |
6f086dfc RS |
3837 | #endif |
3838 | || temp == frame_pointer_rtx) | |
3839 | return 1; | |
3840 | ||
3841 | if (GET_CODE (temp) == PLUS | |
3842 | && CONSTANT_ADDRESS_P (XEXP (temp, 1)) | |
3843 | && (XEXP (temp, 0) == frame_pointer_rtx | |
b37f453b DE |
3844 | #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM |
3845 | || XEXP (temp, 0) == hard_frame_pointer_rtx | |
3846 | #endif | |
6f086dfc RS |
3847 | #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM |
3848 | || XEXP (temp, 0) == arg_pointer_rtx | |
3849 | #endif | |
3850 | )) | |
3851 | return 1; | |
3852 | ||
3853 | if (temp == virtual_stack_vars_rtx | |
3854 | || temp == virtual_incoming_args_rtx | |
3855 | || (GET_CODE (temp) == PLUS | |
3856 | && CONSTANT_ADDRESS_P (XEXP (temp, 1)) | |
3857 | && (XEXP (temp, 0) == virtual_stack_vars_rtx | |
3858 | || XEXP (temp, 0) == virtual_incoming_args_rtx))) | |
3859 | { | |
3860 | /* This MEM may be shared. If the substitution can be done without | |
3861 | the need to generate new pseudos, we want to do it in place | |
3862 | so all copies of the shared rtx benefit. The call below will | |
3863 | only make substitutions if the resulting address is still | |
3864 | valid. | |
3865 | ||
3866 | Note that we cannot pass X as the object in the recursive call | |
3867 | since the insn being processed may not allow all valid | |
6461be14 RS |
3868 | addresses. However, if we were not passed on object, we can |
3869 | only modify X without copying it if X will have a valid | |
3870 | address. | |
6f086dfc | 3871 | |
6461be14 RS |
3872 | ??? Also note that this can still lose if OBJECT is an insn that |
3873 | has less restrictions on an address that some other insn. | |
3874 | In that case, we will modify the shared address. This case | |
4fd796bb RK |
3875 | doesn't seem very likely, though. One case where this could |
3876 | happen is in the case of a USE or CLOBBER reference, but we | |
3877 | take care of that below. */ | |
6461be14 RS |
3878 | |
3879 | if (instantiate_virtual_regs_1 (&XEXP (x, 0), | |
3880 | object ? object : x, 0)) | |
6f086dfc RS |
3881 | return 1; |
3882 | ||
3883 | /* Otherwise make a copy and process that copy. We copy the entire | |
3884 | RTL expression since it might be a PLUS which could also be | |
3885 | shared. */ | |
3886 | *loc = x = copy_rtx (x); | |
3887 | } | |
3888 | ||
3889 | /* Fall through to generic unary operation case. */ | |
6f086dfc RS |
3890 | case SUBREG: |
3891 | case STRICT_LOW_PART: | |
3892 | case NEG: case NOT: | |
3893 | case PRE_DEC: case PRE_INC: case POST_DEC: case POST_INC: | |
3894 | case SIGN_EXTEND: case ZERO_EXTEND: | |
3895 | case TRUNCATE: case FLOAT_EXTEND: case FLOAT_TRUNCATE: | |
3896 | case FLOAT: case FIX: | |
3897 | case UNSIGNED_FIX: case UNSIGNED_FLOAT: | |
3898 | case ABS: | |
3899 | case SQRT: | |
3900 | case FFS: | |
3901 | /* These case either have just one operand or we know that we need not | |
3902 | check the rest of the operands. */ | |
3903 | loc = &XEXP (x, 0); | |
3904 | goto restart; | |
3905 | ||
4fd796bb RK |
3906 | case USE: |
3907 | case CLOBBER: | |
3908 | /* If the operand is a MEM, see if the change is a valid MEM. If not, | |
3909 | go ahead and make the invalid one, but do it to a copy. For a REG, | |
718fe406 | 3910 | just make the recursive call, since there's no chance of a problem. */ |
4fd796bb RK |
3911 | |
3912 | if ((GET_CODE (XEXP (x, 0)) == MEM | |
3913 | && instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), XEXP (x, 0), | |
3914 | 0)) | |
3915 | || (GET_CODE (XEXP (x, 0)) == REG | |
7694ce35 | 3916 | && instantiate_virtual_regs_1 (&XEXP (x, 0), object, 0))) |
4fd796bb RK |
3917 | return 1; |
3918 | ||
3919 | XEXP (x, 0) = copy_rtx (XEXP (x, 0)); | |
3920 | loc = &XEXP (x, 0); | |
3921 | goto restart; | |
3922 | ||
6f086dfc RS |
3923 | case REG: |
3924 | /* Try to replace with a PLUS. If that doesn't work, compute the sum | |
3925 | in front of this insn and substitute the temporary. */ | |
3926 | if (x == virtual_incoming_args_rtx) | |
3927 | new = arg_pointer_rtx, offset = in_arg_offset; | |
3928 | else if (x == virtual_stack_vars_rtx) | |
3929 | new = frame_pointer_rtx, offset = var_offset; | |
3930 | else if (x == virtual_stack_dynamic_rtx) | |
3931 | new = stack_pointer_rtx, offset = dynamic_offset; | |
3932 | else if (x == virtual_outgoing_args_rtx) | |
3933 | new = stack_pointer_rtx, offset = out_arg_offset; | |
71038426 | 3934 | else if (x == virtual_cfa_rtx) |
718fe406 | 3935 | new = arg_pointer_rtx, offset = cfa_offset; |
6f086dfc RS |
3936 | |
3937 | if (new) | |
3938 | { | |
3939 | temp = plus_constant (new, offset); | |
3940 | if (!validate_change (object, loc, temp, 0)) | |
3941 | { | |
3942 | if (! extra_insns) | |
3943 | return 0; | |
3944 | ||
3945 | start_sequence (); | |
5f4f0e22 | 3946 | temp = force_operand (temp, NULL_RTX); |
6f086dfc RS |
3947 | seq = get_insns (); |
3948 | end_sequence (); | |
3949 | ||
3950 | emit_insns_before (seq, object); | |
3951 | if (! validate_change (object, loc, temp, 0) | |
3952 | && ! validate_replace_rtx (x, temp, object)) | |
3953 | abort (); | |
3954 | } | |
3955 | } | |
3956 | ||
3957 | return 1; | |
e9a25f70 JL |
3958 | |
3959 | case ADDRESSOF: | |
3960 | if (GET_CODE (XEXP (x, 0)) == REG) | |
3961 | return 1; | |
3962 | ||
3963 | else if (GET_CODE (XEXP (x, 0)) == MEM) | |
3964 | { | |
3965 | /* If we have a (addressof (mem ..)), do any instantiation inside | |
3966 | since we know we'll be making the inside valid when we finally | |
3967 | remove the ADDRESSOF. */ | |
3968 | instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), NULL_RTX, 0); | |
3969 | return 1; | |
3970 | } | |
3971 | break; | |
718fe406 | 3972 | |
e9a25f70 JL |
3973 | default: |
3974 | break; | |
6f086dfc RS |
3975 | } |
3976 | ||
3977 | /* Scan all subexpressions. */ | |
3978 | fmt = GET_RTX_FORMAT (code); | |
3979 | for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++) | |
3980 | if (*fmt == 'e') | |
3981 | { | |
3982 | if (!instantiate_virtual_regs_1 (&XEXP (x, i), object, extra_insns)) | |
3983 | return 0; | |
3984 | } | |
3985 | else if (*fmt == 'E') | |
3986 | for (j = 0; j < XVECLEN (x, i); j++) | |
3987 | if (! instantiate_virtual_regs_1 (&XVECEXP (x, i, j), object, | |
3988 | extra_insns)) | |
3989 | return 0; | |
3990 | ||
3991 | return 1; | |
3992 | } | |
3993 | \f | |
3994 | /* Optimization: assuming this function does not receive nonlocal gotos, | |
3995 | delete the handlers for such, as well as the insns to establish | |
3996 | and disestablish them. */ | |
3997 | ||
3998 | static void | |
3999 | delete_handlers () | |
4000 | { | |
4001 | rtx insn; | |
4002 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
4003 | { | |
4004 | /* Delete the handler by turning off the flag that would | |
4005 | prevent jump_optimize from deleting it. | |
4006 | Also permit deletion of the nonlocal labels themselves | |
4007 | if nothing local refers to them. */ | |
4008 | if (GET_CODE (insn) == CODE_LABEL) | |
71cd4a8d JW |
4009 | { |
4010 | tree t, last_t; | |
4011 | ||
4012 | LABEL_PRESERVE_P (insn) = 0; | |
4013 | ||
4014 | /* Remove it from the nonlocal_label list, to avoid confusing | |
4015 | flow. */ | |
4016 | for (t = nonlocal_labels, last_t = 0; t; | |
4017 | last_t = t, t = TREE_CHAIN (t)) | |
4018 | if (DECL_RTL (TREE_VALUE (t)) == insn) | |
4019 | break; | |
4020 | if (t) | |
4021 | { | |
4022 | if (! last_t) | |
4023 | nonlocal_labels = TREE_CHAIN (nonlocal_labels); | |
4024 | else | |
4025 | TREE_CHAIN (last_t) = TREE_CHAIN (t); | |
4026 | } | |
4027 | } | |
ba716ac9 BS |
4028 | if (GET_CODE (insn) == INSN) |
4029 | { | |
4030 | int can_delete = 0; | |
4031 | rtx t; | |
4032 | for (t = nonlocal_goto_handler_slots; t != 0; t = XEXP (t, 1)) | |
4033 | if (reg_mentioned_p (t, PATTERN (insn))) | |
4034 | { | |
4035 | can_delete = 1; | |
4036 | break; | |
4037 | } | |
4038 | if (can_delete | |
59257ff7 RK |
4039 | || (nonlocal_goto_stack_level != 0 |
4040 | && reg_mentioned_p (nonlocal_goto_stack_level, | |
ba716ac9 BS |
4041 | PATTERN (insn)))) |
4042 | delete_insn (insn); | |
4043 | } | |
6f086dfc RS |
4044 | } |
4045 | } | |
6f086dfc | 4046 | \f |
6f086dfc RS |
4047 | int |
4048 | max_parm_reg_num () | |
4049 | { | |
4050 | return max_parm_reg; | |
4051 | } | |
4052 | ||
4053 | /* Return the first insn following those generated by `assign_parms'. */ | |
4054 | ||
4055 | rtx | |
4056 | get_first_nonparm_insn () | |
4057 | { | |
4058 | if (last_parm_insn) | |
4059 | return NEXT_INSN (last_parm_insn); | |
4060 | return get_insns (); | |
4061 | } | |
4062 | ||
5378192b RS |
4063 | /* Return the first NOTE_INSN_BLOCK_BEG note in the function. |
4064 | Crash if there is none. */ | |
4065 | ||
4066 | rtx | |
4067 | get_first_block_beg () | |
4068 | { | |
4069 | register rtx searcher; | |
4070 | register rtx insn = get_first_nonparm_insn (); | |
4071 | ||
4072 | for (searcher = insn; searcher; searcher = NEXT_INSN (searcher)) | |
4073 | if (GET_CODE (searcher) == NOTE | |
4074 | && NOTE_LINE_NUMBER (searcher) == NOTE_INSN_BLOCK_BEG) | |
4075 | return searcher; | |
4076 | ||
4077 | abort (); /* Invalid call to this function. (See comments above.) */ | |
4078 | return NULL_RTX; | |
4079 | } | |
4080 | ||
d181c154 RS |
4081 | /* Return 1 if EXP is an aggregate type (or a value with aggregate type). |
4082 | This means a type for which function calls must pass an address to the | |
4083 | function or get an address back from the function. | |
4084 | EXP may be a type node or an expression (whose type is tested). */ | |
6f086dfc RS |
4085 | |
4086 | int | |
4087 | aggregate_value_p (exp) | |
4088 | tree exp; | |
4089 | { | |
9d790a4f RS |
4090 | int i, regno, nregs; |
4091 | rtx reg; | |
2f939d94 TP |
4092 | |
4093 | tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp); | |
d181c154 | 4094 | |
d7bf8ada MM |
4095 | if (TREE_CODE (type) == VOID_TYPE) |
4096 | return 0; | |
d181c154 | 4097 | if (RETURN_IN_MEMORY (type)) |
6f086dfc | 4098 | return 1; |
956d6950 | 4099 | /* Types that are TREE_ADDRESSABLE must be constructed in memory, |
49a2e5b2 DE |
4100 | and thus can't be returned in registers. */ |
4101 | if (TREE_ADDRESSABLE (type)) | |
4102 | return 1; | |
05e3bdb9 | 4103 | if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type)) |
6f086dfc | 4104 | return 1; |
9d790a4f RS |
4105 | /* Make sure we have suitable call-clobbered regs to return |
4106 | the value in; if not, we must return it in memory. */ | |
4dc07bd7 | 4107 | reg = hard_function_value (type, 0, 0); |
e71f7aa5 JW |
4108 | |
4109 | /* If we have something other than a REG (e.g. a PARALLEL), then assume | |
4110 | it is OK. */ | |
4111 | if (GET_CODE (reg) != REG) | |
4112 | return 0; | |
4113 | ||
9d790a4f | 4114 | regno = REGNO (reg); |
d181c154 | 4115 | nregs = HARD_REGNO_NREGS (regno, TYPE_MODE (type)); |
9d790a4f RS |
4116 | for (i = 0; i < nregs; i++) |
4117 | if (! call_used_regs[regno + i]) | |
4118 | return 1; | |
6f086dfc RS |
4119 | return 0; |
4120 | } | |
4121 | \f | |
4122 | /* Assign RTL expressions to the function's parameters. | |
4123 | This may involve copying them into registers and using | |
0d1416c6 | 4124 | those registers as the RTL for them. */ |
6f086dfc RS |
4125 | |
4126 | void | |
0d1416c6 | 4127 | assign_parms (fndecl) |
6f086dfc | 4128 | tree fndecl; |
6f086dfc RS |
4129 | { |
4130 | register tree parm; | |
4131 | register rtx entry_parm = 0; | |
4132 | register rtx stack_parm = 0; | |
4133 | CUMULATIVE_ARGS args_so_far; | |
621061f4 RK |
4134 | enum machine_mode promoted_mode, passed_mode; |
4135 | enum machine_mode nominal_mode, promoted_nominal_mode; | |
00d8a4c1 | 4136 | int unsignedp; |
6f086dfc RS |
4137 | /* Total space needed so far for args on the stack, |
4138 | given as a constant and a tree-expression. */ | |
4139 | struct args_size stack_args_size; | |
4140 | tree fntype = TREE_TYPE (fndecl); | |
4141 | tree fnargs = DECL_ARGUMENTS (fndecl); | |
4142 | /* This is used for the arg pointer when referring to stack args. */ | |
4143 | rtx internal_arg_pointer; | |
718fe406 | 4144 | /* This is a dummy PARM_DECL that we used for the function result if |
6f086dfc RS |
4145 | the function returns a structure. */ |
4146 | tree function_result_decl = 0; | |
54ea1de9 | 4147 | #ifdef SETUP_INCOMING_VARARGS |
6f086dfc | 4148 | int varargs_setup = 0; |
54ea1de9 | 4149 | #endif |
3412b298 | 4150 | rtx conversion_insns = 0; |
4fc026cd | 4151 | struct args_size alignment_pad; |
6f086dfc RS |
4152 | |
4153 | /* Nonzero if the last arg is named `__builtin_va_alist', | |
4154 | which is used on some machines for old-fashioned non-ANSI varargs.h; | |
4155 | this should be stuck onto the stack as if it had arrived there. */ | |
3b69d50e RK |
4156 | int hide_last_arg |
4157 | = (current_function_varargs | |
4158 | && fnargs | |
6f086dfc RS |
4159 | && (parm = tree_last (fnargs)) != 0 |
4160 | && DECL_NAME (parm) | |
4161 | && (! strcmp (IDENTIFIER_POINTER (DECL_NAME (parm)), | |
4162 | "__builtin_va_alist"))); | |
4163 | ||
4164 | /* Nonzero if function takes extra anonymous args. | |
4165 | This means the last named arg must be on the stack | |
0f41302f | 4166 | right before the anonymous ones. */ |
6f086dfc RS |
4167 | int stdarg |
4168 | = (TYPE_ARG_TYPES (fntype) != 0 | |
4169 | && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype))) | |
4170 | != void_type_node)); | |
4171 | ||
ebb904cb RK |
4172 | current_function_stdarg = stdarg; |
4173 | ||
6f086dfc RS |
4174 | /* If the reg that the virtual arg pointer will be translated into is |
4175 | not a fixed reg or is the stack pointer, make a copy of the virtual | |
4176 | arg pointer, and address parms via the copy. The frame pointer is | |
4177 | considered fixed even though it is not marked as such. | |
4178 | ||
4179 | The second time through, simply use ap to avoid generating rtx. */ | |
4180 | ||
4181 | if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM | |
4182 | || ! (fixed_regs[ARG_POINTER_REGNUM] | |
0d1416c6 | 4183 | || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM))) |
6f086dfc RS |
4184 | internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx); |
4185 | else | |
4186 | internal_arg_pointer = virtual_incoming_args_rtx; | |
4187 | current_function_internal_arg_pointer = internal_arg_pointer; | |
4188 | ||
4189 | stack_args_size.constant = 0; | |
4190 | stack_args_size.var = 0; | |
4191 | ||
4192 | /* If struct value address is treated as the first argument, make it so. */ | |
4193 | if (aggregate_value_p (DECL_RESULT (fndecl)) | |
4194 | && ! current_function_returns_pcc_struct | |
4195 | && struct_value_incoming_rtx == 0) | |
4196 | { | |
f9f29478 | 4197 | tree type = build_pointer_type (TREE_TYPE (fntype)); |
6f086dfc | 4198 | |
5f4f0e22 | 4199 | function_result_decl = build_decl (PARM_DECL, NULL_TREE, type); |
6f086dfc RS |
4200 | |
4201 | DECL_ARG_TYPE (function_result_decl) = type; | |
4202 | TREE_CHAIN (function_result_decl) = fnargs; | |
4203 | fnargs = function_result_decl; | |
4204 | } | |
718fe406 | 4205 | |
e9a25f70 | 4206 | max_parm_reg = LAST_VIRTUAL_REGISTER + 1; |
e2ecd91c | 4207 | parm_reg_stack_loc = (rtx *) xcalloc (max_parm_reg, sizeof (rtx)); |
6f086dfc RS |
4208 | |
4209 | #ifdef INIT_CUMULATIVE_INCOMING_ARGS | |
ea0d4c4b | 4210 | INIT_CUMULATIVE_INCOMING_ARGS (args_so_far, fntype, NULL_RTX); |
6f086dfc | 4211 | #else |
2c7ee1a6 | 4212 | INIT_CUMULATIVE_ARGS (args_so_far, fntype, NULL_RTX, 0); |
6f086dfc RS |
4213 | #endif |
4214 | ||
4215 | /* We haven't yet found an argument that we must push and pretend the | |
4216 | caller did. */ | |
4217 | current_function_pretend_args_size = 0; | |
4218 | ||
4219 | for (parm = fnargs; parm; parm = TREE_CHAIN (parm)) | |
4220 | { | |
6f086dfc RS |
4221 | struct args_size stack_offset; |
4222 | struct args_size arg_size; | |
4223 | int passed_pointer = 0; | |
621061f4 | 4224 | int did_conversion = 0; |
6f086dfc | 4225 | tree passed_type = DECL_ARG_TYPE (parm); |
621061f4 | 4226 | tree nominal_type = TREE_TYPE (parm); |
9ab70a9b | 4227 | int pretend_named; |
6f086dfc RS |
4228 | |
4229 | /* Set LAST_NAMED if this is last named arg before some | |
bf9c83fe | 4230 | anonymous args. */ |
6f086dfc RS |
4231 | int last_named = ((TREE_CHAIN (parm) == 0 |
4232 | || DECL_NAME (TREE_CHAIN (parm)) == 0) | |
3b69d50e | 4233 | && (stdarg || current_function_varargs)); |
bf9c83fe JW |
4234 | /* Set NAMED_ARG if this arg should be treated as a named arg. For |
4235 | most machines, if this is a varargs/stdarg function, then we treat | |
4236 | the last named arg as if it were anonymous too. */ | |
e5e809f4 | 4237 | int named_arg = STRICT_ARGUMENT_NAMING ? 1 : ! last_named; |
6f086dfc RS |
4238 | |
4239 | if (TREE_TYPE (parm) == error_mark_node | |
4240 | /* This can happen after weird syntax errors | |
4241 | or if an enum type is defined among the parms. */ | |
4242 | || TREE_CODE (parm) != PARM_DECL | |
4243 | || passed_type == NULL) | |
4244 | { | |
38a448ca RH |
4245 | DECL_INCOMING_RTL (parm) = DECL_RTL (parm) |
4246 | = gen_rtx_MEM (BLKmode, const0_rtx); | |
6f086dfc RS |
4247 | TREE_USED (parm) = 1; |
4248 | continue; | |
4249 | } | |
4250 | ||
4251 | /* For varargs.h function, save info about regs and stack space | |
4252 | used by the individual args, not including the va_alist arg. */ | |
3b69d50e | 4253 | if (hide_last_arg && last_named) |
6f086dfc RS |
4254 | current_function_args_info = args_so_far; |
4255 | ||
4256 | /* Find mode of arg as it is passed, and mode of arg | |
4257 | as it should be during execution of this function. */ | |
4258 | passed_mode = TYPE_MODE (passed_type); | |
621061f4 | 4259 | nominal_mode = TYPE_MODE (nominal_type); |
6f086dfc | 4260 | |
16bae307 RS |
4261 | /* If the parm's mode is VOID, its value doesn't matter, |
4262 | and avoid the usual things like emit_move_insn that could crash. */ | |
4263 | if (nominal_mode == VOIDmode) | |
4264 | { | |
4265 | DECL_INCOMING_RTL (parm) = DECL_RTL (parm) = const0_rtx; | |
4266 | continue; | |
4267 | } | |
4268 | ||
3f46679a RK |
4269 | /* If the parm is to be passed as a transparent union, use the |
4270 | type of the first field for the tests below. We have already | |
4271 | verified that the modes are the same. */ | |
4272 | if (DECL_TRANSPARENT_UNION (parm) | |
2bf105ab RK |
4273 | || (TREE_CODE (passed_type) == UNION_TYPE |
4274 | && TYPE_TRANSPARENT_UNION (passed_type))) | |
3f46679a RK |
4275 | passed_type = TREE_TYPE (TYPE_FIELDS (passed_type)); |
4276 | ||
a14ae508 RK |
4277 | /* See if this arg was passed by invisible reference. It is if |
4278 | it is an object whose size depends on the contents of the | |
4279 | object itself or if the machine requires these objects be passed | |
4280 | that way. */ | |
4281 | ||
4282 | if ((TREE_CODE (TYPE_SIZE (passed_type)) != INTEGER_CST | |
4283 | && contains_placeholder_p (TYPE_SIZE (passed_type))) | |
657bb6dc | 4284 | || TREE_ADDRESSABLE (passed_type) |
6f086dfc | 4285 | #ifdef FUNCTION_ARG_PASS_BY_REFERENCE |
a14ae508 | 4286 | || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, passed_mode, |
bf9c83fe | 4287 | passed_type, named_arg) |
a14ae508 RK |
4288 | #endif |
4289 | ) | |
6f086dfc | 4290 | { |
621061f4 | 4291 | passed_type = nominal_type = build_pointer_type (passed_type); |
6f086dfc RS |
4292 | passed_pointer = 1; |
4293 | passed_mode = nominal_mode = Pmode; | |
4294 | } | |
6f086dfc | 4295 | |
a53e14c0 RK |
4296 | promoted_mode = passed_mode; |
4297 | ||
4298 | #ifdef PROMOTE_FUNCTION_ARGS | |
4299 | /* Compute the mode in which the arg is actually extended to. */ | |
7940255d | 4300 | unsignedp = TREE_UNSIGNED (passed_type); |
a5a52dbc | 4301 | promoted_mode = promote_mode (passed_type, promoted_mode, &unsignedp, 1); |
a53e14c0 RK |
4302 | #endif |
4303 | ||
6f086dfc RS |
4304 | /* Let machine desc say which reg (if any) the parm arrives in. |
4305 | 0 means it arrives on the stack. */ | |
4306 | #ifdef FUNCTION_INCOMING_ARG | |
a53e14c0 | 4307 | entry_parm = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode, |
bf9c83fe | 4308 | passed_type, named_arg); |
6f086dfc | 4309 | #else |
a53e14c0 | 4310 | entry_parm = FUNCTION_ARG (args_so_far, promoted_mode, |
bf9c83fe | 4311 | passed_type, named_arg); |
6f086dfc RS |
4312 | #endif |
4313 | ||
621061f4 RK |
4314 | if (entry_parm == 0) |
4315 | promoted_mode = passed_mode; | |
a53e14c0 | 4316 | |
6f086dfc RS |
4317 | #ifdef SETUP_INCOMING_VARARGS |
4318 | /* If this is the last named parameter, do any required setup for | |
4319 | varargs or stdargs. We need to know about the case of this being an | |
4320 | addressable type, in which case we skip the registers it | |
4321 | would have arrived in. | |
4322 | ||
4323 | For stdargs, LAST_NAMED will be set for two parameters, the one that | |
4324 | is actually the last named, and the dummy parameter. We only | |
4325 | want to do this action once. | |
4326 | ||
4327 | Also, indicate when RTL generation is to be suppressed. */ | |
4328 | if (last_named && !varargs_setup) | |
4329 | { | |
621061f4 | 4330 | SETUP_INCOMING_VARARGS (args_so_far, promoted_mode, passed_type, |
0d1416c6 | 4331 | current_function_pretend_args_size, 0); |
6f086dfc RS |
4332 | varargs_setup = 1; |
4333 | } | |
4334 | #endif | |
4335 | ||
4336 | /* Determine parm's home in the stack, | |
4337 | in case it arrives in the stack or we should pretend it did. | |
4338 | ||
4339 | Compute the stack position and rtx where the argument arrives | |
4340 | and its size. | |
4341 | ||
4342 | There is one complexity here: If this was a parameter that would | |
4343 | have been passed in registers, but wasn't only because it is | |
4344 | __builtin_va_alist, we want locate_and_pad_parm to treat it as if | |
4345 | it came in a register so that REG_PARM_STACK_SPACE isn't skipped. | |
4346 | In this case, we call FUNCTION_ARG with NAMED set to 1 instead of | |
4347 | 0 as it was the previous time. */ | |
4348 | ||
9ab70a9b | 4349 | pretend_named = named_arg || PRETEND_OUTGOING_VARARGS_NAMED; |
0f11903b | 4350 | locate_and_pad_parm (promoted_mode, passed_type, |
6f086dfc RS |
4351 | #ifdef STACK_PARMS_IN_REG_PARM_AREA |
4352 | 1, | |
4353 | #else | |
4354 | #ifdef FUNCTION_INCOMING_ARG | |
621061f4 | 4355 | FUNCTION_INCOMING_ARG (args_so_far, promoted_mode, |
6f086dfc | 4356 | passed_type, |
9ab70a9b | 4357 | pretend_named) != 0, |
6f086dfc | 4358 | #else |
621061f4 | 4359 | FUNCTION_ARG (args_so_far, promoted_mode, |
6f086dfc | 4360 | passed_type, |
9ab70a9b | 4361 | pretend_named) != 0, |
6f086dfc RS |
4362 | #endif |
4363 | #endif | |
4fc026cd | 4364 | fndecl, &stack_args_size, &stack_offset, &arg_size, |
718fe406 | 4365 | &alignment_pad); |
6f086dfc | 4366 | |
0d1416c6 BS |
4367 | { |
4368 | rtx offset_rtx = ARGS_SIZE_RTX (stack_offset); | |
4369 | ||
4370 | if (offset_rtx == const0_rtx) | |
4371 | stack_parm = gen_rtx_MEM (promoted_mode, internal_arg_pointer); | |
4372 | else | |
4373 | stack_parm = gen_rtx_MEM (promoted_mode, | |
4374 | gen_rtx_PLUS (Pmode, | |
4375 | internal_arg_pointer, | |
4376 | offset_rtx)); | |
4377 | ||
3bdf5ad1 | 4378 | set_mem_attributes (stack_parm, parm, 1); |
0d1416c6 | 4379 | } |
6f086dfc RS |
4380 | |
4381 | /* If this parameter was passed both in registers and in the stack, | |
4382 | use the copy on the stack. */ | |
621061f4 | 4383 | if (MUST_PASS_IN_STACK (promoted_mode, passed_type)) |
6f086dfc RS |
4384 | entry_parm = 0; |
4385 | ||
461beb10 | 4386 | #ifdef FUNCTION_ARG_PARTIAL_NREGS |
6f086dfc RS |
4387 | /* If this parm was passed part in regs and part in memory, |
4388 | pretend it arrived entirely in memory | |
4389 | by pushing the register-part onto the stack. | |
4390 | ||
4391 | In the special case of a DImode or DFmode that is split, | |
4392 | we could put it together in a pseudoreg directly, | |
4393 | but for now that's not worth bothering with. */ | |
4394 | ||
4395 | if (entry_parm) | |
4396 | { | |
621061f4 | 4397 | int nregs = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, promoted_mode, |
bf9c83fe | 4398 | passed_type, named_arg); |
6f086dfc RS |
4399 | |
4400 | if (nregs > 0) | |
4401 | { | |
4402 | current_function_pretend_args_size | |
4403 | = (((nregs * UNITS_PER_WORD) + (PARM_BOUNDARY / BITS_PER_UNIT) - 1) | |
4404 | / (PARM_BOUNDARY / BITS_PER_UNIT) | |
4405 | * (PARM_BOUNDARY / BITS_PER_UNIT)); | |
4406 | ||
0d1416c6 BS |
4407 | /* Handle calls that pass values in multiple non-contiguous |
4408 | locations. The Irix 6 ABI has examples of this. */ | |
4409 | if (GET_CODE (entry_parm) == PARALLEL) | |
4410 | emit_group_store (validize_mem (stack_parm), entry_parm, | |
4411 | int_size_in_bytes (TREE_TYPE (parm)), | |
19caa751 | 4412 | TYPE_ALIGN (TREE_TYPE (parm))); |
718fe406 | 4413 | |
0d1416c6 BS |
4414 | else |
4415 | move_block_from_reg (REGNO (entry_parm), | |
4416 | validize_mem (stack_parm), nregs, | |
4417 | int_size_in_bytes (TREE_TYPE (parm))); | |
4418 | ||
6f086dfc RS |
4419 | entry_parm = stack_parm; |
4420 | } | |
4421 | } | |
461beb10 | 4422 | #endif |
6f086dfc RS |
4423 | |
4424 | /* If we didn't decide this parm came in a register, | |
4425 | by default it came on the stack. */ | |
4426 | if (entry_parm == 0) | |
4427 | entry_parm = stack_parm; | |
4428 | ||
4429 | /* Record permanently how this parm was passed. */ | |
0d1416c6 | 4430 | DECL_INCOMING_RTL (parm) = entry_parm; |
6f086dfc RS |
4431 | |
4432 | /* If there is actually space on the stack for this parm, | |
4433 | count it in stack_args_size; otherwise set stack_parm to 0 | |
4434 | to indicate there is no preallocated stack slot for the parm. */ | |
4435 | ||
4436 | if (entry_parm == stack_parm | |
ab87f8c8 JL |
4437 | || (GET_CODE (entry_parm) == PARALLEL |
4438 | && XEXP (XVECEXP (entry_parm, 0, 0), 0) == NULL_RTX) | |
d9ca49d5 | 4439 | #if defined (REG_PARM_STACK_SPACE) && ! defined (MAYBE_REG_PARM_STACK_SPACE) |
6f086dfc | 4440 | /* On some machines, even if a parm value arrives in a register |
d9ca49d5 JW |
4441 | there is still an (uninitialized) stack slot allocated for it. |
4442 | ||
4443 | ??? When MAYBE_REG_PARM_STACK_SPACE is defined, we can't tell | |
4444 | whether this parameter already has a stack slot allocated, | |
4445 | because an arg block exists only if current_function_args_size | |
abc95ed3 | 4446 | is larger than some threshold, and we haven't calculated that |
d9ca49d5 JW |
4447 | yet. So, for now, we just assume that stack slots never exist |
4448 | in this case. */ | |
6f086dfc RS |
4449 | || REG_PARM_STACK_SPACE (fndecl) > 0 |
4450 | #endif | |
4451 | ) | |
4452 | { | |
4453 | stack_args_size.constant += arg_size.constant; | |
4454 | if (arg_size.var) | |
4455 | ADD_PARM_SIZE (stack_args_size, arg_size.var); | |
4456 | } | |
4457 | else | |
4458 | /* No stack slot was pushed for this parm. */ | |
4459 | stack_parm = 0; | |
4460 | ||
4461 | /* Update info on where next arg arrives in registers. */ | |
4462 | ||
621061f4 | 4463 | FUNCTION_ARG_ADVANCE (args_so_far, promoted_mode, |
bf9c83fe | 4464 | passed_type, named_arg); |
6f086dfc | 4465 | |
e16c591a RS |
4466 | /* If we can't trust the parm stack slot to be aligned enough |
4467 | for its ultimate type, don't use that slot after entry. | |
4468 | We'll make another stack slot, if we need one. */ | |
4469 | { | |
c8d8ed65 | 4470 | unsigned int thisparm_boundary |
621061f4 | 4471 | = FUNCTION_ARG_BOUNDARY (promoted_mode, passed_type); |
e16c591a RS |
4472 | |
4473 | if (GET_MODE_ALIGNMENT (nominal_mode) > thisparm_boundary) | |
4474 | stack_parm = 0; | |
4475 | } | |
4476 | ||
cb61f66f RS |
4477 | /* If parm was passed in memory, and we need to convert it on entry, |
4478 | don't store it back in that same slot. */ | |
4479 | if (entry_parm != 0 | |
4480 | && nominal_mode != BLKmode && nominal_mode != passed_mode) | |
4481 | stack_parm = 0; | |
4482 | ||
6f086dfc RS |
4483 | /* ENTRY_PARM is an RTX for the parameter as it arrives, |
4484 | in the mode in which it arrives. | |
4485 | STACK_PARM is an RTX for a stack slot where the parameter can live | |
4486 | during the function (in case we want to put it there). | |
4487 | STACK_PARM is 0 if no stack slot was pushed for it. | |
4488 | ||
4489 | Now output code if necessary to convert ENTRY_PARM to | |
4490 | the type in which this function declares it, | |
4491 | and store that result in an appropriate place, | |
4492 | which may be a pseudo reg, may be STACK_PARM, | |
4493 | or may be a local stack slot if STACK_PARM is 0. | |
4494 | ||
4495 | Set DECL_RTL to that place. */ | |
4496 | ||
5c4cdc9f | 4497 | if (nominal_mode == BLKmode || GET_CODE (entry_parm) == PARALLEL) |
6f086dfc | 4498 | { |
5c4cdc9f JW |
4499 | /* If a BLKmode arrives in registers, copy it to a stack slot. |
4500 | Handle calls that pass values in multiple non-contiguous | |
4501 | locations. The Irix 6 ABI has examples of this. */ | |
4502 | if (GET_CODE (entry_parm) == REG | |
4503 | || GET_CODE (entry_parm) == PARALLEL) | |
6f086dfc | 4504 | { |
621061f4 RK |
4505 | int size_stored |
4506 | = CEIL_ROUND (int_size_in_bytes (TREE_TYPE (parm)), | |
4507 | UNITS_PER_WORD); | |
6f086dfc RS |
4508 | |
4509 | /* Note that we will be storing an integral number of words. | |
4510 | So we have to be careful to ensure that we allocate an | |
4511 | integral number of words. We do this below in the | |
4512 | assign_stack_local if space was not allocated in the argument | |
4513 | list. If it was, this will not work if PARM_BOUNDARY is not | |
4514 | a multiple of BITS_PER_WORD. It isn't clear how to fix this | |
4515 | if it becomes a problem. */ | |
4516 | ||
4517 | if (stack_parm == 0) | |
7e41ffa2 RS |
4518 | { |
4519 | stack_parm | |
621061f4 RK |
4520 | = assign_stack_local (GET_MODE (entry_parm), |
4521 | size_stored, 0); | |
3bdf5ad1 | 4522 | set_mem_attributes (stack_parm, parm, 1); |
7e41ffa2 RS |
4523 | } |
4524 | ||
6f086dfc RS |
4525 | else if (PARM_BOUNDARY % BITS_PER_WORD != 0) |
4526 | abort (); | |
4527 | ||
5c4cdc9f JW |
4528 | /* Handle calls that pass values in multiple non-contiguous |
4529 | locations. The Irix 6 ABI has examples of this. */ | |
4530 | if (GET_CODE (entry_parm) == PARALLEL) | |
aac5cc16 RH |
4531 | emit_group_store (validize_mem (stack_parm), entry_parm, |
4532 | int_size_in_bytes (TREE_TYPE (parm)), | |
19caa751 | 4533 | TYPE_ALIGN (TREE_TYPE (parm))); |
5c4cdc9f JW |
4534 | else |
4535 | move_block_from_reg (REGNO (entry_parm), | |
4536 | validize_mem (stack_parm), | |
4537 | size_stored / UNITS_PER_WORD, | |
4538 | int_size_in_bytes (TREE_TYPE (parm))); | |
6f086dfc RS |
4539 | } |
4540 | DECL_RTL (parm) = stack_parm; | |
4541 | } | |
d29c259b RH |
4542 | else if (! ((! optimize |
4543 | && ! DECL_REGISTER (parm) | |
a82ad570 | 4544 | && ! DECL_INLINE (fndecl)) |
6f086dfc RS |
4545 | /* layout_decl may set this. */ |
4546 | || TREE_ADDRESSABLE (parm) | |
4547 | || TREE_SIDE_EFFECTS (parm) | |
4548 | /* If -ffloat-store specified, don't put explicit | |
4549 | float variables into registers. */ | |
4550 | || (flag_float_store | |
4551 | && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE)) | |
4552 | /* Always assign pseudo to structure return or item passed | |
4553 | by invisible reference. */ | |
4554 | || passed_pointer || parm == function_result_decl) | |
4555 | { | |
00d8a4c1 RK |
4556 | /* Store the parm in a pseudoregister during the function, but we |
4557 | may need to do it in a wider mode. */ | |
4558 | ||
4559 | register rtx parmreg; | |
770ae6cc | 4560 | unsigned int regno, regnoi = 0, regnor = 0; |
00d8a4c1 RK |
4561 | |
4562 | unsignedp = TREE_UNSIGNED (TREE_TYPE (parm)); | |
cd5b3469 | 4563 | |
621061f4 RK |
4564 | promoted_nominal_mode |
4565 | = promote_mode (TREE_TYPE (parm), nominal_mode, &unsignedp, 0); | |
6f086dfc | 4566 | |
621061f4 | 4567 | parmreg = gen_reg_rtx (promoted_nominal_mode); |
ddb7361a | 4568 | mark_user_reg (parmreg); |
6f086dfc RS |
4569 | |
4570 | /* If this was an item that we received a pointer to, set DECL_RTL | |
4571 | appropriately. */ | |
4572 | if (passed_pointer) | |
4573 | { | |
621061f4 | 4574 | DECL_RTL (parm) |
38a448ca | 4575 | = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type)), parmreg); |
3bdf5ad1 | 4576 | set_mem_attributes (DECL_RTL (parm), parm, 1); |
6f086dfc RS |
4577 | } |
4578 | else | |
4579 | DECL_RTL (parm) = parmreg; | |
4580 | ||
4581 | /* Copy the value into the register. */ | |
621061f4 RK |
4582 | if (nominal_mode != passed_mode |
4583 | || promoted_nominal_mode != promoted_mode) | |
86f8eff3 | 4584 | { |
efd8cba0 | 4585 | int save_tree_used; |
621061f4 | 4586 | /* ENTRY_PARM has been converted to PROMOTED_MODE, its |
718fe406 | 4587 | mode, by the caller. We now have to convert it to |
621061f4 | 4588 | NOMINAL_MODE, if different. However, PARMREG may be in |
956d6950 | 4589 | a different mode than NOMINAL_MODE if it is being stored |
621061f4 RK |
4590 | promoted. |
4591 | ||
4592 | If ENTRY_PARM is a hard register, it might be in a register | |
86f8eff3 RK |
4593 | not valid for operating in its mode (e.g., an odd-numbered |
4594 | register for a DFmode). In that case, moves are the only | |
4595 | thing valid, so we can't do a convert from there. This | |
4596 | occurs when the calling sequence allow such misaligned | |
3412b298 JW |
4597 | usages. |
4598 | ||
4599 | In addition, the conversion may involve a call, which could | |
4600 | clobber parameters which haven't been copied to pseudo | |
4601 | registers yet. Therefore, we must first copy the parm to | |
4602 | a pseudo reg here, and save the conversion until after all | |
4603 | parameters have been moved. */ | |
4604 | ||
4605 | rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm)); | |
4606 | ||
4607 | emit_move_insn (tempreg, validize_mem (entry_parm)); | |
4608 | ||
4609 | push_to_sequence (conversion_insns); | |
ad241351 RK |
4610 | tempreg = convert_to_mode (nominal_mode, tempreg, unsignedp); |
4611 | ||
efd8cba0 DB |
4612 | /* TREE_USED gets set erroneously during expand_assignment. */ |
4613 | save_tree_used = TREE_USED (parm); | |
621061f4 RK |
4614 | expand_assignment (parm, |
4615 | make_tree (nominal_type, tempreg), 0, 0); | |
efd8cba0 | 4616 | TREE_USED (parm) = save_tree_used; |
3412b298 | 4617 | conversion_insns = get_insns (); |
621061f4 | 4618 | did_conversion = 1; |
3412b298 | 4619 | end_sequence (); |
86f8eff3 | 4620 | } |
6f086dfc RS |
4621 | else |
4622 | emit_move_insn (parmreg, validize_mem (entry_parm)); | |
4623 | ||
74bd77a8 RS |
4624 | /* If we were passed a pointer but the actual value |
4625 | can safely live in a register, put it in one. */ | |
16bae307 | 4626 | if (passed_pointer && TYPE_MODE (TREE_TYPE (parm)) != BLKmode |
d29c259b RH |
4627 | && ! ((! optimize |
4628 | && ! DECL_REGISTER (parm) | |
74bd77a8 RS |
4629 | && ! DECL_INLINE (fndecl)) |
4630 | /* layout_decl may set this. */ | |
4631 | || TREE_ADDRESSABLE (parm) | |
4632 | || TREE_SIDE_EFFECTS (parm) | |
4633 | /* If -ffloat-store specified, don't put explicit | |
4634 | float variables into registers. */ | |
4635 | || (flag_float_store | |
4636 | && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))) | |
4637 | { | |
2654605a JW |
4638 | /* We can't use nominal_mode, because it will have been set to |
4639 | Pmode above. We must use the actual mode of the parm. */ | |
4640 | parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm))); | |
ddb7361a | 4641 | mark_user_reg (parmreg); |
74bd77a8 RS |
4642 | emit_move_insn (parmreg, DECL_RTL (parm)); |
4643 | DECL_RTL (parm) = parmreg; | |
c110c53d RS |
4644 | /* STACK_PARM is the pointer, not the parm, and PARMREG is |
4645 | now the parm. */ | |
4646 | stack_parm = 0; | |
74bd77a8 | 4647 | } |
137a2a7b DE |
4648 | #ifdef FUNCTION_ARG_CALLEE_COPIES |
4649 | /* If we are passed an arg by reference and it is our responsibility | |
4650 | to make a copy, do it now. | |
4651 | PASSED_TYPE and PASSED mode now refer to the pointer, not the | |
4652 | original argument, so we must recreate them in the call to | |
4653 | FUNCTION_ARG_CALLEE_COPIES. */ | |
4654 | /* ??? Later add code to handle the case that if the argument isn't | |
4655 | modified, don't do the copy. */ | |
4656 | ||
4657 | else if (passed_pointer | |
4658 | && FUNCTION_ARG_CALLEE_COPIES (args_so_far, | |
4659 | TYPE_MODE (DECL_ARG_TYPE (parm)), | |
4660 | DECL_ARG_TYPE (parm), | |
bf9c83fe | 4661 | named_arg) |
926b1b99 | 4662 | && ! TREE_ADDRESSABLE (DECL_ARG_TYPE (parm))) |
137a2a7b DE |
4663 | { |
4664 | rtx copy; | |
4665 | tree type = DECL_ARG_TYPE (parm); | |
4666 | ||
4667 | /* This sequence may involve a library call perhaps clobbering | |
4668 | registers that haven't been copied to pseudos yet. */ | |
4669 | ||
4670 | push_to_sequence (conversion_insns); | |
4671 | ||
d0f062fb | 4672 | if (!COMPLETE_TYPE_P (type) |
137a2a7b | 4673 | || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST) |
1fd3ef7f | 4674 | /* This is a variable sized object. */ |
38a448ca RH |
4675 | copy = gen_rtx_MEM (BLKmode, |
4676 | allocate_dynamic_stack_space | |
4677 | (expr_size (parm), NULL_RTX, | |
4678 | TYPE_ALIGN (type))); | |
137a2a7b | 4679 | else |
1fd3ef7f RK |
4680 | copy = assign_stack_temp (TYPE_MODE (type), |
4681 | int_size_in_bytes (type), 1); | |
a696c1d6 | 4682 | set_mem_attributes (copy, parm, 1); |
137a2a7b DE |
4683 | |
4684 | store_expr (parm, copy, 0); | |
4685 | emit_move_insn (parmreg, XEXP (copy, 0)); | |
7d384cc0 | 4686 | if (current_function_check_memory_usage) |
ebb1b59a BS |
4687 | emit_library_call (chkr_set_right_libfunc, |
4688 | LCT_CONST_MAKE_BLOCK, VOIDmode, 3, | |
6a9c4aed | 4689 | XEXP (copy, 0), Pmode, |
86fa911a RK |
4690 | GEN_INT (int_size_in_bytes (type)), |
4691 | TYPE_MODE (sizetype), | |
956d6950 JL |
4692 | GEN_INT (MEMORY_USE_RW), |
4693 | TYPE_MODE (integer_type_node)); | |
137a2a7b | 4694 | conversion_insns = get_insns (); |
621061f4 | 4695 | did_conversion = 1; |
137a2a7b DE |
4696 | end_sequence (); |
4697 | } | |
4698 | #endif /* FUNCTION_ARG_CALLEE_COPIES */ | |
74bd77a8 | 4699 | |
6f086dfc | 4700 | /* In any case, record the parm's desired stack location |
718fe406 | 4701 | in case we later discover it must live in the stack. |
14aceb29 RS |
4702 | |
4703 | If it is a COMPLEX value, store the stack location for both | |
4704 | halves. */ | |
4705 | ||
4706 | if (GET_CODE (parmreg) == CONCAT) | |
4707 | regno = MAX (REGNO (XEXP (parmreg, 0)), REGNO (XEXP (parmreg, 1))); | |
4708 | else | |
4709 | regno = REGNO (parmreg); | |
4710 | ||
e9a25f70 | 4711 | if (regno >= max_parm_reg) |
6f086dfc RS |
4712 | { |
4713 | rtx *new; | |
e9a25f70 | 4714 | int old_max_parm_reg = max_parm_reg; |
14aceb29 | 4715 | |
e9a25f70 JL |
4716 | /* It's slow to expand this one register at a time, |
4717 | but it's also rare and we need max_parm_reg to be | |
4718 | precisely correct. */ | |
4719 | max_parm_reg = regno + 1; | |
e2ecd91c BS |
4720 | new = (rtx *) xrealloc (parm_reg_stack_loc, |
4721 | max_parm_reg * sizeof (rtx)); | |
e9a25f70 JL |
4722 | bzero ((char *) (new + old_max_parm_reg), |
4723 | (max_parm_reg - old_max_parm_reg) * sizeof (rtx)); | |
6f086dfc RS |
4724 | parm_reg_stack_loc = new; |
4725 | } | |
14aceb29 RS |
4726 | |
4727 | if (GET_CODE (parmreg) == CONCAT) | |
4728 | { | |
4729 | enum machine_mode submode = GET_MODE (XEXP (parmreg, 0)); | |
4730 | ||
a03caf76 RK |
4731 | regnor = REGNO (gen_realpart (submode, parmreg)); |
4732 | regnoi = REGNO (gen_imagpart (submode, parmreg)); | |
4733 | ||
7b1a0c14 RS |
4734 | if (stack_parm != 0) |
4735 | { | |
a03caf76 | 4736 | parm_reg_stack_loc[regnor] |
3d329b07 | 4737 | = gen_realpart (submode, stack_parm); |
a03caf76 | 4738 | parm_reg_stack_loc[regnoi] |
3d329b07 | 4739 | = gen_imagpart (submode, stack_parm); |
7b1a0c14 RS |
4740 | } |
4741 | else | |
4742 | { | |
a03caf76 RK |
4743 | parm_reg_stack_loc[regnor] = 0; |
4744 | parm_reg_stack_loc[regnoi] = 0; | |
7b1a0c14 | 4745 | } |
14aceb29 RS |
4746 | } |
4747 | else | |
4748 | parm_reg_stack_loc[REGNO (parmreg)] = stack_parm; | |
6f086dfc RS |
4749 | |
4750 | /* Mark the register as eliminable if we did no conversion | |
4751 | and it was copied from memory at a fixed offset, | |
4752 | and the arg pointer was not copied to a pseudo-reg. | |
4753 | If the arg pointer is a pseudo reg or the offset formed | |
4754 | an invalid address, such memory-equivalences | |
4755 | as we make here would screw up life analysis for it. */ | |
4756 | if (nominal_mode == passed_mode | |
621061f4 | 4757 | && ! did_conversion |
38b610ed ILT |
4758 | && stack_parm != 0 |
4759 | && GET_CODE (stack_parm) == MEM | |
6f086dfc RS |
4760 | && stack_offset.var == 0 |
4761 | && reg_mentioned_p (virtual_incoming_args_rtx, | |
38b610ed | 4762 | XEXP (stack_parm, 0))) |
a03caf76 RK |
4763 | { |
4764 | rtx linsn = get_last_insn (); | |
69685820 | 4765 | rtx sinsn, set; |
a03caf76 RK |
4766 | |
4767 | /* Mark complex types separately. */ | |
4768 | if (GET_CODE (parmreg) == CONCAT) | |
69685820 RK |
4769 | /* Scan backwards for the set of the real and |
4770 | imaginary parts. */ | |
4771 | for (sinsn = linsn; sinsn != 0; | |
4772 | sinsn = prev_nonnote_insn (sinsn)) | |
4773 | { | |
4774 | set = single_set (sinsn); | |
4775 | if (set != 0 | |
4776 | && SET_DEST (set) == regno_reg_rtx [regnoi]) | |
4777 | REG_NOTES (sinsn) | |
38a448ca RH |
4778 | = gen_rtx_EXPR_LIST (REG_EQUIV, |
4779 | parm_reg_stack_loc[regnoi], | |
4780 | REG_NOTES (sinsn)); | |
69685820 RK |
4781 | else if (set != 0 |
4782 | && SET_DEST (set) == regno_reg_rtx [regnor]) | |
4783 | REG_NOTES (sinsn) | |
38a448ca RH |
4784 | = gen_rtx_EXPR_LIST (REG_EQUIV, |
4785 | parm_reg_stack_loc[regnor], | |
4786 | REG_NOTES (sinsn)); | |
69685820 RK |
4787 | } |
4788 | else if ((set = single_set (linsn)) != 0 | |
4789 | && SET_DEST (set) == parmreg) | |
718fe406 | 4790 | REG_NOTES (linsn) |
38a448ca RH |
4791 | = gen_rtx_EXPR_LIST (REG_EQUIV, |
4792 | stack_parm, REG_NOTES (linsn)); | |
a03caf76 | 4793 | } |
6f086dfc RS |
4794 | |
4795 | /* For pointer data type, suggest pointer register. */ | |
e5e809f4 | 4796 | if (POINTER_TYPE_P (TREE_TYPE (parm))) |
6c6166bd | 4797 | mark_reg_pointer (parmreg, |
bdb429a5 RK |
4798 | TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm)))); |
4799 | ||
6f086dfc RS |
4800 | } |
4801 | else | |
4802 | { | |
4803 | /* Value must be stored in the stack slot STACK_PARM | |
4804 | during function execution. */ | |
4805 | ||
621061f4 | 4806 | if (promoted_mode != nominal_mode) |
86f8eff3 RK |
4807 | { |
4808 | /* Conversion is required. */ | |
3412b298 JW |
4809 | rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm)); |
4810 | ||
4811 | emit_move_insn (tempreg, validize_mem (entry_parm)); | |
86f8eff3 | 4812 | |
3412b298 JW |
4813 | push_to_sequence (conversion_insns); |
4814 | entry_parm = convert_to_mode (nominal_mode, tempreg, | |
a53e14c0 | 4815 | TREE_UNSIGNED (TREE_TYPE (parm))); |
de957303 DE |
4816 | if (stack_parm) |
4817 | { | |
4818 | /* ??? This may need a big-endian conversion on sparc64. */ | |
4819 | stack_parm = change_address (stack_parm, nominal_mode, | |
4820 | NULL_RTX); | |
4821 | } | |
3412b298 | 4822 | conversion_insns = get_insns (); |
621061f4 | 4823 | did_conversion = 1; |
3412b298 | 4824 | end_sequence (); |
86f8eff3 | 4825 | } |
6f086dfc RS |
4826 | |
4827 | if (entry_parm != stack_parm) | |
4828 | { | |
4829 | if (stack_parm == 0) | |
7e41ffa2 RS |
4830 | { |
4831 | stack_parm | |
4832 | = assign_stack_local (GET_MODE (entry_parm), | |
4833 | GET_MODE_SIZE (GET_MODE (entry_parm)), 0); | |
3bdf5ad1 | 4834 | set_mem_attributes (stack_parm, parm, 1); |
7e41ffa2 RS |
4835 | } |
4836 | ||
621061f4 | 4837 | if (promoted_mode != nominal_mode) |
3412b298 JW |
4838 | { |
4839 | push_to_sequence (conversion_insns); | |
4840 | emit_move_insn (validize_mem (stack_parm), | |
4841 | validize_mem (entry_parm)); | |
4842 | conversion_insns = get_insns (); | |
4843 | end_sequence (); | |
4844 | } | |
4845 | else | |
4846 | emit_move_insn (validize_mem (stack_parm), | |
4847 | validize_mem (entry_parm)); | |
6f086dfc | 4848 | } |
7d384cc0 | 4849 | if (current_function_check_memory_usage) |
86fa911a RK |
4850 | { |
4851 | push_to_sequence (conversion_insns); | |
ebb1b59a BS |
4852 | emit_library_call (chkr_set_right_libfunc, LCT_CONST_MAKE_BLOCK, |
4853 | VOIDmode, 3, XEXP (stack_parm, 0), Pmode, | |
718fe406 | 4854 | GEN_INT (GET_MODE_SIZE (GET_MODE |
86fa911a RK |
4855 | (entry_parm))), |
4856 | TYPE_MODE (sizetype), | |
956d6950 JL |
4857 | GEN_INT (MEMORY_USE_RW), |
4858 | TYPE_MODE (integer_type_node)); | |
6f086dfc | 4859 | |
86fa911a RK |
4860 | conversion_insns = get_insns (); |
4861 | end_sequence (); | |
4862 | } | |
6f086dfc RS |
4863 | DECL_RTL (parm) = stack_parm; |
4864 | } | |
718fe406 | 4865 | |
6f086dfc RS |
4866 | /* If this "parameter" was the place where we are receiving the |
4867 | function's incoming structure pointer, set up the result. */ | |
4868 | if (parm == function_result_decl) | |
ccdecf58 RK |
4869 | { |
4870 | tree result = DECL_RESULT (fndecl); | |
ccdecf58 RK |
4871 | |
4872 | DECL_RTL (result) | |
38a448ca | 4873 | = gen_rtx_MEM (DECL_MODE (result), DECL_RTL (parm)); |
ccdecf58 | 4874 | |
3bdf5ad1 | 4875 | set_mem_attributes (DECL_RTL (result), result, 1); |
ccdecf58 | 4876 | } |
6f086dfc RS |
4877 | } |
4878 | ||
3412b298 JW |
4879 | /* Output all parameter conversion instructions (possibly including calls) |
4880 | now that all parameters have been copied out of hard registers. */ | |
4881 | emit_insns (conversion_insns); | |
4882 | ||
6f086dfc RS |
4883 | last_parm_insn = get_last_insn (); |
4884 | ||
4885 | current_function_args_size = stack_args_size.constant; | |
4886 | ||
4887 | /* Adjust function incoming argument size for alignment and | |
4888 | minimum length. */ | |
4889 | ||
4890 | #ifdef REG_PARM_STACK_SPACE | |
6f90e075 | 4891 | #ifndef MAYBE_REG_PARM_STACK_SPACE |
6f086dfc RS |
4892 | current_function_args_size = MAX (current_function_args_size, |
4893 | REG_PARM_STACK_SPACE (fndecl)); | |
4894 | #endif | |
6f90e075 | 4895 | #endif |
6f086dfc | 4896 | |
4433e339 RH |
4897 | #ifdef STACK_BOUNDARY |
4898 | #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT) | |
4899 | ||
4900 | current_function_args_size | |
4901 | = ((current_function_args_size + STACK_BYTES - 1) | |
4902 | / STACK_BYTES) * STACK_BYTES; | |
718fe406 | 4903 | #endif |
4433e339 | 4904 | |
6f086dfc RS |
4905 | #ifdef ARGS_GROW_DOWNWARD |
4906 | current_function_arg_offset_rtx | |
5f4f0e22 | 4907 | = (stack_args_size.var == 0 ? GEN_INT (-stack_args_size.constant) |
718fe406 KH |
4908 | : expand_expr (size_diffop (stack_args_size.var, |
4909 | size_int (-stack_args_size.constant)), | |
86fa911a | 4910 | NULL_RTX, VOIDmode, EXPAND_MEMORY_USE_BAD)); |
6f086dfc RS |
4911 | #else |
4912 | current_function_arg_offset_rtx = ARGS_SIZE_RTX (stack_args_size); | |
4913 | #endif | |
4914 | ||
4915 | /* See how many bytes, if any, of its args a function should try to pop | |
4916 | on return. */ | |
4917 | ||
64e6d9cc | 4918 | current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl), |
6f086dfc RS |
4919 | current_function_args_size); |
4920 | ||
3b69d50e RK |
4921 | /* For stdarg.h function, save info about |
4922 | regs and stack space used by the named args. */ | |
6f086dfc | 4923 | |
3b69d50e | 4924 | if (!hide_last_arg) |
6f086dfc RS |
4925 | current_function_args_info = args_so_far; |
4926 | ||
4927 | /* Set the rtx used for the function return value. Put this in its | |
4928 | own variable so any optimizers that need this information don't have | |
4929 | to include tree.h. Do this here so it gets done when an inlined | |
4930 | function gets output. */ | |
4931 | ||
4932 | current_function_return_rtx = DECL_RTL (DECL_RESULT (fndecl)); | |
4933 | } | |
4934 | \f | |
75dc3319 RK |
4935 | /* Indicate whether REGNO is an incoming argument to the current function |
4936 | that was promoted to a wider mode. If so, return the RTX for the | |
4937 | register (to get its mode). PMODE and PUNSIGNEDP are set to the mode | |
4938 | that REGNO is promoted from and whether the promotion was signed or | |
4939 | unsigned. */ | |
4940 | ||
4941 | #ifdef PROMOTE_FUNCTION_ARGS | |
4942 | ||
4943 | rtx | |
4944 | promoted_input_arg (regno, pmode, punsignedp) | |
770ae6cc | 4945 | unsigned int regno; |
75dc3319 RK |
4946 | enum machine_mode *pmode; |
4947 | int *punsignedp; | |
4948 | { | |
4949 | tree arg; | |
4950 | ||
4951 | for (arg = DECL_ARGUMENTS (current_function_decl); arg; | |
4952 | arg = TREE_CHAIN (arg)) | |
4953 | if (GET_CODE (DECL_INCOMING_RTL (arg)) == REG | |
621061f4 RK |
4954 | && REGNO (DECL_INCOMING_RTL (arg)) == regno |
4955 | && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg))) | |
75dc3319 RK |
4956 | { |
4957 | enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg)); | |
4958 | int unsignedp = TREE_UNSIGNED (TREE_TYPE (arg)); | |
4959 | ||
a5a52dbc | 4960 | mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1); |
75dc3319 RK |
4961 | if (mode == GET_MODE (DECL_INCOMING_RTL (arg)) |
4962 | && mode != DECL_MODE (arg)) | |
4963 | { | |
4964 | *pmode = DECL_MODE (arg); | |
4965 | *punsignedp = unsignedp; | |
4966 | return DECL_INCOMING_RTL (arg); | |
4967 | } | |
4968 | } | |
4969 | ||
4970 | return 0; | |
4971 | } | |
4972 | ||
4973 | #endif | |
4974 | \f | |
6f086dfc RS |
4975 | /* Compute the size and offset from the start of the stacked arguments for a |
4976 | parm passed in mode PASSED_MODE and with type TYPE. | |
4977 | ||
4978 | INITIAL_OFFSET_PTR points to the current offset into the stacked | |
4979 | arguments. | |
4980 | ||
4981 | The starting offset and size for this parm are returned in *OFFSET_PTR | |
4982 | and *ARG_SIZE_PTR, respectively. | |
4983 | ||
4984 | IN_REGS is non-zero if the argument will be passed in registers. It will | |
4985 | never be set if REG_PARM_STACK_SPACE is not defined. | |
4986 | ||
4987 | FNDECL is the function in which the argument was defined. | |
4988 | ||
4989 | There are two types of rounding that are done. The first, controlled by | |
4990 | FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument | |
4991 | list to be aligned to the specific boundary (in bits). This rounding | |
4992 | affects the initial and starting offsets, but not the argument size. | |
4993 | ||
4994 | The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY, | |
4995 | optionally rounds the size of the parm to PARM_BOUNDARY. The | |
4996 | initial offset is not affected by this rounding, while the size always | |
4997 | is and the starting offset may be. */ | |
4998 | ||
718fe406 | 4999 | /* offset_ptr will be negative for ARGS_GROW_DOWNWARD case; |
6f086dfc RS |
5000 | initial_offset_ptr is positive because locate_and_pad_parm's |
5001 | callers pass in the total size of args so far as | |
5002 | initial_offset_ptr. arg_size_ptr is always positive.*/ | |
5003 | ||
6f086dfc RS |
5004 | void |
5005 | locate_and_pad_parm (passed_mode, type, in_regs, fndecl, | |
4fc026cd | 5006 | initial_offset_ptr, offset_ptr, arg_size_ptr, |
718fe406 | 5007 | alignment_pad) |
6f086dfc RS |
5008 | enum machine_mode passed_mode; |
5009 | tree type; | |
57bed152 | 5010 | int in_regs ATTRIBUTE_UNUSED; |
91813b28 | 5011 | tree fndecl ATTRIBUTE_UNUSED; |
6f086dfc RS |
5012 | struct args_size *initial_offset_ptr; |
5013 | struct args_size *offset_ptr; | |
5014 | struct args_size *arg_size_ptr; | |
4fc026cd CM |
5015 | struct args_size *alignment_pad; |
5016 | ||
6f086dfc RS |
5017 | { |
5018 | tree sizetree | |
5019 | = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode)); | |
5020 | enum direction where_pad = FUNCTION_ARG_PADDING (passed_mode, type); | |
5021 | int boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type); | |
6f086dfc RS |
5022 | |
5023 | #ifdef REG_PARM_STACK_SPACE | |
5024 | /* If we have found a stack parm before we reach the end of the | |
5025 | area reserved for registers, skip that area. */ | |
5026 | if (! in_regs) | |
5027 | { | |
29a82058 JL |
5028 | int reg_parm_stack_space = 0; |
5029 | ||
29008b51 JW |
5030 | #ifdef MAYBE_REG_PARM_STACK_SPACE |
5031 | reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE; | |
5032 | #else | |
6f086dfc | 5033 | reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl); |
29008b51 | 5034 | #endif |
6f086dfc RS |
5035 | if (reg_parm_stack_space > 0) |
5036 | { | |
5037 | if (initial_offset_ptr->var) | |
5038 | { | |
5039 | initial_offset_ptr->var | |
5040 | = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr), | |
fed3cef0 | 5041 | ssize_int (reg_parm_stack_space)); |
6f086dfc RS |
5042 | initial_offset_ptr->constant = 0; |
5043 | } | |
5044 | else if (initial_offset_ptr->constant < reg_parm_stack_space) | |
5045 | initial_offset_ptr->constant = reg_parm_stack_space; | |
5046 | } | |
5047 | } | |
5048 | #endif /* REG_PARM_STACK_SPACE */ | |
5049 | ||
5050 | arg_size_ptr->var = 0; | |
5051 | arg_size_ptr->constant = 0; | |
5052 | ||
5053 | #ifdef ARGS_GROW_DOWNWARD | |
5054 | if (initial_offset_ptr->var) | |
5055 | { | |
5056 | offset_ptr->constant = 0; | |
fed3cef0 | 5057 | offset_ptr->var = size_binop (MINUS_EXPR, ssize_int (0), |
6f086dfc RS |
5058 | initial_offset_ptr->var); |
5059 | } | |
5060 | else | |
5061 | { | |
718fe406 | 5062 | offset_ptr->constant = -initial_offset_ptr->constant; |
6f086dfc RS |
5063 | offset_ptr->var = 0; |
5064 | } | |
0b21dcf5 | 5065 | if (where_pad != none |
6f086dfc RS |
5066 | && (TREE_CODE (sizetree) != INTEGER_CST |
5067 | || ((TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY))) | |
5068 | sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT); | |
5069 | SUB_PARM_SIZE (*offset_ptr, sizetree); | |
66bcbe19 | 5070 | if (where_pad != downward) |
4fc026cd | 5071 | pad_to_arg_alignment (offset_ptr, boundary, alignment_pad); |
6f086dfc | 5072 | if (initial_offset_ptr->var) |
fed3cef0 RK |
5073 | arg_size_ptr->var = size_binop (MINUS_EXPR, |
5074 | size_binop (MINUS_EXPR, | |
5075 | ssize_int (0), | |
5076 | initial_offset_ptr->var), | |
5077 | offset_ptr->var); | |
5078 | ||
6f086dfc | 5079 | else |
718fe406 KH |
5080 | arg_size_ptr->constant = (-initial_offset_ptr->constant |
5081 | - offset_ptr->constant); | |
fed3cef0 | 5082 | |
6f086dfc | 5083 | #else /* !ARGS_GROW_DOWNWARD */ |
4fc026cd | 5084 | pad_to_arg_alignment (initial_offset_ptr, boundary, alignment_pad); |
6f086dfc | 5085 | *offset_ptr = *initial_offset_ptr; |
6f086dfc RS |
5086 | |
5087 | #ifdef PUSH_ROUNDING | |
5088 | if (passed_mode != BLKmode) | |
5089 | sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree))); | |
5090 | #endif | |
5091 | ||
d4b0a7a0 DE |
5092 | /* Pad_below needs the pre-rounded size to know how much to pad below |
5093 | so this must be done before rounding up. */ | |
ea5917da DE |
5094 | if (where_pad == downward |
5095 | /* However, BLKmode args passed in regs have their padding done elsewhere. | |
5096 | The stack slot must be able to hold the entire register. */ | |
5097 | && !(in_regs && passed_mode == BLKmode)) | |
d4b0a7a0 DE |
5098 | pad_below (offset_ptr, passed_mode, sizetree); |
5099 | ||
6f086dfc RS |
5100 | if (where_pad != none |
5101 | && (TREE_CODE (sizetree) != INTEGER_CST | |
5102 | || ((TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY))) | |
5103 | sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT); | |
5104 | ||
5105 | ADD_PARM_SIZE (*arg_size_ptr, sizetree); | |
5106 | #endif /* ARGS_GROW_DOWNWARD */ | |
5107 | } | |
5108 | ||
e16c591a RS |
5109 | /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY. |
5110 | BOUNDARY is measured in bits, but must be a multiple of a storage unit. */ | |
5111 | ||
6f086dfc | 5112 | static void |
4fc026cd | 5113 | pad_to_arg_alignment (offset_ptr, boundary, alignment_pad) |
6f086dfc RS |
5114 | struct args_size *offset_ptr; |
5115 | int boundary; | |
4fc026cd | 5116 | struct args_size *alignment_pad; |
6f086dfc | 5117 | { |
a544cfd2 KG |
5118 | tree save_var = NULL_TREE; |
5119 | HOST_WIDE_INT save_constant = 0; | |
4fc026cd | 5120 | |
6f086dfc | 5121 | int boundary_in_bytes = boundary / BITS_PER_UNIT; |
718fe406 | 5122 | |
9399d5c6 | 5123 | if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY) |
4fc026cd CM |
5124 | { |
5125 | save_var = offset_ptr->var; | |
5126 | save_constant = offset_ptr->constant; | |
5127 | } | |
5128 | ||
5129 | alignment_pad->var = NULL_TREE; | |
5130 | alignment_pad->constant = 0; | |
4fc026cd | 5131 | |
6f086dfc RS |
5132 | if (boundary > BITS_PER_UNIT) |
5133 | { | |
5134 | if (offset_ptr->var) | |
5135 | { | |
718fe406 | 5136 | offset_ptr->var = |
6f086dfc | 5137 | #ifdef ARGS_GROW_DOWNWARD |
718fe406 | 5138 | round_down |
6f086dfc RS |
5139 | #else |
5140 | round_up | |
5141 | #endif | |
5142 | (ARGS_SIZE_TREE (*offset_ptr), | |
5143 | boundary / BITS_PER_UNIT); | |
5144 | offset_ptr->constant = 0; /*?*/ | |
9399d5c6 | 5145 | if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY) |
fed3cef0 RK |
5146 | alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var, |
5147 | save_var); | |
6f086dfc RS |
5148 | } |
5149 | else | |
718fe406 | 5150 | { |
fbb57b2a | 5151 | offset_ptr->constant = |
6f086dfc | 5152 | #ifdef ARGS_GROW_DOWNWARD |
fbb57b2a | 5153 | FLOOR_ROUND (offset_ptr->constant, boundary_in_bytes); |
6f086dfc | 5154 | #else |
fbb57b2a | 5155 | CEIL_ROUND (offset_ptr->constant, boundary_in_bytes); |
6f086dfc | 5156 | #endif |
718fe406 KH |
5157 | if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY) |
5158 | alignment_pad->constant = offset_ptr->constant - save_constant; | |
5159 | } | |
6f086dfc RS |
5160 | } |
5161 | } | |
5162 | ||
51723711 | 5163 | #ifndef ARGS_GROW_DOWNWARD |
6f086dfc RS |
5164 | static void |
5165 | pad_below (offset_ptr, passed_mode, sizetree) | |
5166 | struct args_size *offset_ptr; | |
5167 | enum machine_mode passed_mode; | |
5168 | tree sizetree; | |
5169 | { | |
5170 | if (passed_mode != BLKmode) | |
5171 | { | |
5172 | if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY) | |
5173 | offset_ptr->constant | |
5174 | += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1) | |
5175 | / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT) | |
5176 | - GET_MODE_SIZE (passed_mode)); | |
5177 | } | |
5178 | else | |
5179 | { | |
5180 | if (TREE_CODE (sizetree) != INTEGER_CST | |
5181 | || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY) | |
5182 | { | |
5183 | /* Round the size up to multiple of PARM_BOUNDARY bits. */ | |
5184 | tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT); | |
5185 | /* Add it in. */ | |
5186 | ADD_PARM_SIZE (*offset_ptr, s2); | |
5187 | SUB_PARM_SIZE (*offset_ptr, sizetree); | |
5188 | } | |
5189 | } | |
5190 | } | |
51723711 | 5191 | #endif |
6f086dfc RS |
5192 | \f |
5193 | /* Walk the tree of blocks describing the binding levels within a function | |
5194 | and warn about uninitialized variables. | |
5195 | This is done after calling flow_analysis and before global_alloc | |
5196 | clobbers the pseudo-regs to hard regs. */ | |
5197 | ||
5198 | void | |
5199 | uninitialized_vars_warning (block) | |
5200 | tree block; | |
5201 | { | |
5202 | register tree decl, sub; | |
5203 | for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl)) | |
5204 | { | |
8fbe1035 ML |
5205 | if (warn_uninitialized |
5206 | && TREE_CODE (decl) == VAR_DECL | |
6f086dfc RS |
5207 | /* These warnings are unreliable for and aggregates |
5208 | because assigning the fields one by one can fail to convince | |
5209 | flow.c that the entire aggregate was initialized. | |
5210 | Unions are troublesome because members may be shorter. */ | |
05e3bdb9 | 5211 | && ! AGGREGATE_TYPE_P (TREE_TYPE (decl)) |
6f086dfc RS |
5212 | && DECL_RTL (decl) != 0 |
5213 | && GET_CODE (DECL_RTL (decl)) == REG | |
6acdd0fd JL |
5214 | /* Global optimizations can make it difficult to determine if a |
5215 | particular variable has been initialized. However, a VAR_DECL | |
5216 | with a nonzero DECL_INITIAL had an initializer, so do not | |
5217 | claim it is potentially uninitialized. | |
5218 | ||
5219 | We do not care about the actual value in DECL_INITIAL, so we do | |
5220 | not worry that it may be a dangling pointer. */ | |
5221 | && DECL_INITIAL (decl) == NULL_TREE | |
6f086dfc RS |
5222 | && regno_uninitialized (REGNO (DECL_RTL (decl)))) |
5223 | warning_with_decl (decl, | |
3c8cd8bd | 5224 | "`%s' might be used uninitialized in this function"); |
8fbe1035 ML |
5225 | if (extra_warnings |
5226 | && TREE_CODE (decl) == VAR_DECL | |
6f086dfc RS |
5227 | && DECL_RTL (decl) != 0 |
5228 | && GET_CODE (DECL_RTL (decl)) == REG | |
5229 | && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl)))) | |
5230 | warning_with_decl (decl, | |
3c8cd8bd | 5231 | "variable `%s' might be clobbered by `longjmp' or `vfork'"); |
6f086dfc RS |
5232 | } |
5233 | for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub)) | |
5234 | uninitialized_vars_warning (sub); | |
5235 | } | |
5236 | ||
5237 | /* Do the appropriate part of uninitialized_vars_warning | |
5238 | but for arguments instead of local variables. */ | |
5239 | ||
5240 | void | |
0cd6ef35 | 5241 | setjmp_args_warning () |
6f086dfc RS |
5242 | { |
5243 | register tree decl; | |
5244 | for (decl = DECL_ARGUMENTS (current_function_decl); | |
5245 | decl; decl = TREE_CHAIN (decl)) | |
5246 | if (DECL_RTL (decl) != 0 | |
5247 | && GET_CODE (DECL_RTL (decl)) == REG | |
5248 | && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl)))) | |
718fe406 KH |
5249 | warning_with_decl (decl, |
5250 | "argument `%s' might be clobbered by `longjmp' or `vfork'"); | |
6f086dfc RS |
5251 | } |
5252 | ||
5253 | /* If this function call setjmp, put all vars into the stack | |
5254 | unless they were declared `register'. */ | |
5255 | ||
5256 | void | |
5257 | setjmp_protect (block) | |
5258 | tree block; | |
5259 | { | |
5260 | register tree decl, sub; | |
5261 | for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl)) | |
5262 | if ((TREE_CODE (decl) == VAR_DECL | |
5263 | || TREE_CODE (decl) == PARM_DECL) | |
5264 | && DECL_RTL (decl) != 0 | |
e9a25f70 JL |
5265 | && (GET_CODE (DECL_RTL (decl)) == REG |
5266 | || (GET_CODE (DECL_RTL (decl)) == MEM | |
5267 | && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF)) | |
b335c2cc | 5268 | /* If this variable came from an inline function, it must be |
9ec36da5 | 5269 | that its life doesn't overlap the setjmp. If there was a |
b335c2cc TW |
5270 | setjmp in the function, it would already be in memory. We |
5271 | must exclude such variable because their DECL_RTL might be | |
5272 | set to strange things such as virtual_stack_vars_rtx. */ | |
5273 | && ! DECL_FROM_INLINE (decl) | |
6f086dfc RS |
5274 | && ( |
5275 | #ifdef NON_SAVING_SETJMP | |
5276 | /* If longjmp doesn't restore the registers, | |
5277 | don't put anything in them. */ | |
5278 | NON_SAVING_SETJMP | |
5279 | || | |
5280 | #endif | |
a82ad570 | 5281 | ! DECL_REGISTER (decl))) |
6f086dfc RS |
5282 | put_var_into_stack (decl); |
5283 | for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub)) | |
5284 | setjmp_protect (sub); | |
5285 | } | |
5286 | \f | |
5287 | /* Like the previous function, but for args instead of local variables. */ | |
5288 | ||
5289 | void | |
5290 | setjmp_protect_args () | |
5291 | { | |
29a82058 | 5292 | register tree decl; |
6f086dfc RS |
5293 | for (decl = DECL_ARGUMENTS (current_function_decl); |
5294 | decl; decl = TREE_CHAIN (decl)) | |
5295 | if ((TREE_CODE (decl) == VAR_DECL | |
5296 | || TREE_CODE (decl) == PARM_DECL) | |
5297 | && DECL_RTL (decl) != 0 | |
e9a25f70 JL |
5298 | && (GET_CODE (DECL_RTL (decl)) == REG |
5299 | || (GET_CODE (DECL_RTL (decl)) == MEM | |
5300 | && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF)) | |
6f086dfc RS |
5301 | && ( |
5302 | /* If longjmp doesn't restore the registers, | |
5303 | don't put anything in them. */ | |
5304 | #ifdef NON_SAVING_SETJMP | |
5305 | NON_SAVING_SETJMP | |
5306 | || | |
5307 | #endif | |
a82ad570 | 5308 | ! DECL_REGISTER (decl))) |
6f086dfc RS |
5309 | put_var_into_stack (decl); |
5310 | } | |
5311 | \f | |
5312 | /* Return the context-pointer register corresponding to DECL, | |
5313 | or 0 if it does not need one. */ | |
5314 | ||
5315 | rtx | |
5316 | lookup_static_chain (decl) | |
5317 | tree decl; | |
5318 | { | |
b001a02f PB |
5319 | tree context = decl_function_context (decl); |
5320 | tree link; | |
7ad8c4bf | 5321 | |
38ee6ed9 JM |
5322 | if (context == 0 |
5323 | || (TREE_CODE (decl) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (decl))) | |
7ad8c4bf | 5324 | return 0; |
38ee6ed9 | 5325 | |
6f086dfc RS |
5326 | /* We treat inline_function_decl as an alias for the current function |
5327 | because that is the inline function whose vars, types, etc. | |
5328 | are being merged into the current function. | |
5329 | See expand_inline_function. */ | |
5330 | if (context == current_function_decl || context == inline_function_decl) | |
5331 | return virtual_stack_vars_rtx; | |
5332 | ||
5333 | for (link = context_display; link; link = TREE_CHAIN (link)) | |
5334 | if (TREE_PURPOSE (link) == context) | |
5335 | return RTL_EXPR_RTL (TREE_VALUE (link)); | |
5336 | ||
5337 | abort (); | |
5338 | } | |
5339 | \f | |
5340 | /* Convert a stack slot address ADDR for variable VAR | |
5341 | (from a containing function) | |
5342 | into an address valid in this function (using a static chain). */ | |
5343 | ||
5344 | rtx | |
5345 | fix_lexical_addr (addr, var) | |
5346 | rtx addr; | |
5347 | tree var; | |
5348 | { | |
5349 | rtx basereg; | |
e5e809f4 | 5350 | HOST_WIDE_INT displacement; |
6f086dfc RS |
5351 | tree context = decl_function_context (var); |
5352 | struct function *fp; | |
5353 | rtx base = 0; | |
5354 | ||
5355 | /* If this is the present function, we need not do anything. */ | |
5356 | if (context == current_function_decl || context == inline_function_decl) | |
5357 | return addr; | |
5358 | ||
5359 | for (fp = outer_function_chain; fp; fp = fp->next) | |
5360 | if (fp->decl == context) | |
5361 | break; | |
5362 | ||
5363 | if (fp == 0) | |
5364 | abort (); | |
5365 | ||
e9a25f70 JL |
5366 | if (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == MEM) |
5367 | addr = XEXP (XEXP (addr, 0), 0); | |
5368 | ||
6f086dfc RS |
5369 | /* Decode given address as base reg plus displacement. */ |
5370 | if (GET_CODE (addr) == REG) | |
5371 | basereg = addr, displacement = 0; | |
5372 | else if (GET_CODE (addr) == PLUS && GET_CODE (XEXP (addr, 1)) == CONST_INT) | |
5373 | basereg = XEXP (addr, 0), displacement = INTVAL (XEXP (addr, 1)); | |
5374 | else | |
5375 | abort (); | |
5376 | ||
5377 | /* We accept vars reached via the containing function's | |
5378 | incoming arg pointer and via its stack variables pointer. */ | |
5379 | if (basereg == fp->internal_arg_pointer) | |
5380 | { | |
5381 | /* If reached via arg pointer, get the arg pointer value | |
5382 | out of that function's stack frame. | |
5383 | ||
5384 | There are two cases: If a separate ap is needed, allocate a | |
5385 | slot in the outer function for it and dereference it that way. | |
5386 | This is correct even if the real ap is actually a pseudo. | |
5387 | Otherwise, just adjust the offset from the frame pointer to | |
5388 | compensate. */ | |
5389 | ||
5390 | #ifdef NEED_SEPARATE_AP | |
5391 | rtx addr; | |
5392 | ||
49ad7cfa BS |
5393 | if (fp->x_arg_pointer_save_area == 0) |
5394 | fp->x_arg_pointer_save_area | |
e2ecd91c | 5395 | = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, fp); |
6f086dfc | 5396 | |
49ad7cfa | 5397 | addr = fix_lexical_addr (XEXP (fp->x_arg_pointer_save_area, 0), var); |
6f086dfc RS |
5398 | addr = memory_address (Pmode, addr); |
5399 | ||
3bdf5ad1 RK |
5400 | base = gen_rtx_MEM (Pmode, addr); |
5401 | MEM_ALIAS_SET (base) = get_frame_alias_set (); | |
5402 | base = copy_to_reg (base); | |
6f086dfc RS |
5403 | #else |
5404 | displacement += (FIRST_PARM_OFFSET (context) - STARTING_FRAME_OFFSET); | |
86f8eff3 | 5405 | base = lookup_static_chain (var); |
6f086dfc RS |
5406 | #endif |
5407 | } | |
5408 | ||
5409 | else if (basereg == virtual_stack_vars_rtx) | |
5410 | { | |
5411 | /* This is the same code as lookup_static_chain, duplicated here to | |
5412 | avoid an extra call to decl_function_context. */ | |
5413 | tree link; | |
5414 | ||
5415 | for (link = context_display; link; link = TREE_CHAIN (link)) | |
5416 | if (TREE_PURPOSE (link) == context) | |
5417 | { | |
5418 | base = RTL_EXPR_RTL (TREE_VALUE (link)); | |
5419 | break; | |
5420 | } | |
5421 | } | |
5422 | ||
5423 | if (base == 0) | |
5424 | abort (); | |
5425 | ||
5426 | /* Use same offset, relative to appropriate static chain or argument | |
5427 | pointer. */ | |
5428 | return plus_constant (base, displacement); | |
5429 | } | |
5430 | \f | |
5431 | /* Return the address of the trampoline for entering nested fn FUNCTION. | |
5432 | If necessary, allocate a trampoline (in the stack frame) | |
5433 | and emit rtl to initialize its contents (at entry to this function). */ | |
5434 | ||
5435 | rtx | |
5436 | trampoline_address (function) | |
5437 | tree function; | |
5438 | { | |
5439 | tree link; | |
5440 | tree rtlexp; | |
5441 | rtx tramp; | |
5442 | struct function *fp; | |
5443 | tree fn_context; | |
5444 | ||
5445 | /* Find an existing trampoline and return it. */ | |
5446 | for (link = trampoline_list; link; link = TREE_CHAIN (link)) | |
5447 | if (TREE_PURPOSE (link) == function) | |
e87ee2a9 RK |
5448 | return |
5449 | round_trampoline_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0)); | |
5450 | ||
6f086dfc | 5451 | for (fp = outer_function_chain; fp; fp = fp->next) |
49ad7cfa | 5452 | for (link = fp->x_trampoline_list; link; link = TREE_CHAIN (link)) |
6f086dfc RS |
5453 | if (TREE_PURPOSE (link) == function) |
5454 | { | |
5455 | tramp = fix_lexical_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0), | |
5456 | function); | |
5457 | return round_trampoline_addr (tramp); | |
5458 | } | |
5459 | ||
5460 | /* None exists; we must make one. */ | |
5461 | ||
5462 | /* Find the `struct function' for the function containing FUNCTION. */ | |
5463 | fp = 0; | |
5464 | fn_context = decl_function_context (function); | |
4ac74fb8 RK |
5465 | if (fn_context != current_function_decl |
5466 | && fn_context != inline_function_decl) | |
6f086dfc RS |
5467 | for (fp = outer_function_chain; fp; fp = fp->next) |
5468 | if (fp->decl == fn_context) | |
5469 | break; | |
5470 | ||
5471 | /* Allocate run-time space for this trampoline | |
5472 | (usually in the defining function's stack frame). */ | |
5473 | #ifdef ALLOCATE_TRAMPOLINE | |
5474 | tramp = ALLOCATE_TRAMPOLINE (fp); | |
5475 | #else | |
5476 | /* If rounding needed, allocate extra space | |
5477 | to ensure we have TRAMPOLINE_SIZE bytes left after rounding up. */ | |
5478 | #ifdef TRAMPOLINE_ALIGNMENT | |
b02ab63a RK |
5479 | #define TRAMPOLINE_REAL_SIZE \ |
5480 | (TRAMPOLINE_SIZE + (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT) - 1) | |
6f086dfc RS |
5481 | #else |
5482 | #define TRAMPOLINE_REAL_SIZE (TRAMPOLINE_SIZE) | |
5483 | #endif | |
e2ecd91c | 5484 | tramp = assign_stack_local_1 (BLKmode, TRAMPOLINE_REAL_SIZE, 0, |
01d939e8 | 5485 | fp ? fp : cfun); |
6f086dfc RS |
5486 | #endif |
5487 | ||
5488 | /* Record the trampoline for reuse and note it for later initialization | |
5489 | by expand_function_end. */ | |
5490 | if (fp != 0) | |
5491 | { | |
28498644 RK |
5492 | push_obstacks (fp->function_maybepermanent_obstack, |
5493 | fp->function_maybepermanent_obstack); | |
6f086dfc RS |
5494 | rtlexp = make_node (RTL_EXPR); |
5495 | RTL_EXPR_RTL (rtlexp) = tramp; | |
49ad7cfa BS |
5496 | fp->x_trampoline_list = tree_cons (function, rtlexp, |
5497 | fp->x_trampoline_list); | |
6f086dfc RS |
5498 | pop_obstacks (); |
5499 | } | |
5500 | else | |
5501 | { | |
5502 | /* Make the RTL_EXPR node temporary, not momentary, so that the | |
5503 | trampoline_list doesn't become garbage. */ | |
5504 | int momentary = suspend_momentary (); | |
5505 | rtlexp = make_node (RTL_EXPR); | |
5506 | resume_momentary (momentary); | |
5507 | ||
5508 | RTL_EXPR_RTL (rtlexp) = tramp; | |
5509 | trampoline_list = tree_cons (function, rtlexp, trampoline_list); | |
5510 | } | |
5511 | ||
5512 | tramp = fix_lexical_addr (XEXP (tramp, 0), function); | |
5513 | return round_trampoline_addr (tramp); | |
5514 | } | |
5515 | ||
5516 | /* Given a trampoline address, | |
5517 | round it to multiple of TRAMPOLINE_ALIGNMENT. */ | |
5518 | ||
5519 | static rtx | |
5520 | round_trampoline_addr (tramp) | |
5521 | rtx tramp; | |
5522 | { | |
5523 | #ifdef TRAMPOLINE_ALIGNMENT | |
5524 | /* Round address up to desired boundary. */ | |
5525 | rtx temp = gen_reg_rtx (Pmode); | |
5526 | temp = expand_binop (Pmode, add_optab, tramp, | |
b02ab63a | 5527 | GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1), |
6f086dfc RS |
5528 | temp, 0, OPTAB_LIB_WIDEN); |
5529 | tramp = expand_binop (Pmode, and_optab, temp, | |
718fe406 | 5530 | GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT), |
6f086dfc RS |
5531 | temp, 0, OPTAB_LIB_WIDEN); |
5532 | #endif | |
5533 | return tramp; | |
5534 | } | |
5535 | \f | |
b2a59b15 MS |
5536 | /* Put all this function's BLOCK nodes including those that are chained |
5537 | onto the first block into a vector, and return it. | |
467456d0 RS |
5538 | Also store in each NOTE for the beginning or end of a block |
5539 | the index of that block in the vector. | |
b2a59b15 | 5540 | The arguments are BLOCK, the chain of top-level blocks of the function, |
467456d0 RS |
5541 | and INSNS, the insn chain of the function. */ |
5542 | ||
1a4450c7 | 5543 | void |
116eebd6 | 5544 | identify_blocks () |
467456d0 | 5545 | { |
fc289cd1 | 5546 | int n_blocks; |
0a1c58a2 | 5547 | tree *block_vector, *last_block_vector; |
1a4450c7 | 5548 | tree *block_stack; |
116eebd6 | 5549 | tree block = DECL_INITIAL (current_function_decl); |
467456d0 | 5550 | |
b2a59b15 | 5551 | if (block == 0) |
1a4450c7 | 5552 | return; |
fc289cd1 | 5553 | |
1a4450c7 MM |
5554 | /* Fill the BLOCK_VECTOR with all of the BLOCKs in this function, in |
5555 | depth-first order. */ | |
18c038b9 | 5556 | block_vector = get_block_vector (block, &n_blocks); |
4da896b2 | 5557 | block_stack = (tree *) xmalloc (n_blocks * sizeof (tree)); |
1a4450c7 | 5558 | |
718fe406 | 5559 | last_block_vector = identify_blocks_1 (get_insns (), |
116eebd6 | 5560 | block_vector + 1, |
718fe406 | 5561 | block_vector + n_blocks, |
116eebd6 | 5562 | block_stack); |
0a1c58a2 JL |
5563 | |
5564 | /* If we didn't use all of the subblocks, we've misplaced block notes. */ | |
5565 | /* ??? This appears to happen all the time. Latent bugs elsewhere? */ | |
5566 | if (0 && last_block_vector != block_vector + n_blocks) | |
5567 | abort (); | |
5568 | ||
5569 | free (block_vector); | |
5570 | free (block_stack); | |
5571 | } | |
5572 | ||
5573 | /* Subroutine of identify_blocks. Do the block substitution on the | |
5574 | insn chain beginning with INSNS. Recurse for CALL_PLACEHOLDER chains. | |
5575 | ||
5576 | BLOCK_STACK is pushed and popped for each BLOCK_BEGIN/BLOCK_END pair. | |
5577 | BLOCK_VECTOR is incremented for each block seen. */ | |
5578 | ||
5579 | static tree * | |
5580 | identify_blocks_1 (insns, block_vector, end_block_vector, orig_block_stack) | |
5581 | rtx insns; | |
5582 | tree *block_vector; | |
5583 | tree *end_block_vector; | |
5584 | tree *orig_block_stack; | |
5585 | { | |
5586 | rtx insn; | |
5587 | tree *block_stack = orig_block_stack; | |
5588 | ||
467456d0 | 5589 | for (insn = insns; insn; insn = NEXT_INSN (insn)) |
0a1c58a2 JL |
5590 | { |
5591 | if (GET_CODE (insn) == NOTE) | |
5592 | { | |
5593 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG) | |
5594 | { | |
5595 | tree b; | |
1a4450c7 | 5596 | |
0a1c58a2 JL |
5597 | /* If there are more block notes than BLOCKs, something |
5598 | is badly wrong. */ | |
5599 | if (block_vector == end_block_vector) | |
5600 | abort (); | |
e6fd097e | 5601 | |
0a1c58a2 JL |
5602 | b = *block_vector++; |
5603 | NOTE_BLOCK (insn) = b; | |
5604 | *block_stack++ = b; | |
5605 | } | |
5606 | else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END) | |
5607 | { | |
5608 | /* If there are more NOTE_INSN_BLOCK_ENDs than | |
5609 | NOTE_INSN_BLOCK_BEGs, something is badly wrong. */ | |
5610 | if (block_stack == orig_block_stack) | |
5611 | abort (); | |
e6fd097e | 5612 | |
0a1c58a2 JL |
5613 | NOTE_BLOCK (insn) = *--block_stack; |
5614 | } | |
718fe406 | 5615 | } |
0a1c58a2 JL |
5616 | else if (GET_CODE (insn) == CALL_INSN |
5617 | && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER) | |
5618 | { | |
5619 | rtx cp = PATTERN (insn); | |
5620 | ||
718fe406 KH |
5621 | block_vector = identify_blocks_1 (XEXP (cp, 0), block_vector, |
5622 | end_block_vector, block_stack); | |
0a1c58a2 JL |
5623 | if (XEXP (cp, 1)) |
5624 | block_vector = identify_blocks_1 (XEXP (cp, 1), block_vector, | |
5625 | end_block_vector, block_stack); | |
5626 | if (XEXP (cp, 2)) | |
5627 | block_vector = identify_blocks_1 (XEXP (cp, 2), block_vector, | |
5628 | end_block_vector, block_stack); | |
5629 | } | |
5630 | } | |
467456d0 | 5631 | |
0a1c58a2 JL |
5632 | /* If there are more NOTE_INSN_BLOCK_BEGINs than NOTE_INSN_BLOCK_ENDs, |
5633 | something is badly wrong. */ | |
5634 | if (block_stack != orig_block_stack) | |
5635 | abort (); | |
5636 | ||
5637 | return block_vector; | |
467456d0 RS |
5638 | } |
5639 | ||
116eebd6 | 5640 | /* Identify BLOCKs referenced by more than one |
718fe406 | 5641 | NOTE_INSN_BLOCK_{BEG,END}, and create duplicate blocks. */ |
467456d0 | 5642 | |
116eebd6 MM |
5643 | void |
5644 | reorder_blocks () | |
467456d0 | 5645 | { |
116eebd6 | 5646 | tree block = DECL_INITIAL (current_function_decl); |
18c038b9 | 5647 | varray_type block_stack; |
467456d0 | 5648 | |
1a4450c7 | 5649 | if (block == NULL_TREE) |
116eebd6 | 5650 | return; |
fc289cd1 | 5651 | |
18c038b9 MM |
5652 | VARRAY_TREE_INIT (block_stack, 10, "block_stack"); |
5653 | ||
116eebd6 MM |
5654 | /* Prune the old trees away, so that they don't get in the way. */ |
5655 | BLOCK_SUBBLOCKS (block) = NULL_TREE; | |
5656 | BLOCK_CHAIN (block) = NULL_TREE; | |
fc289cd1 | 5657 | |
116eebd6 | 5658 | reorder_blocks_1 (get_insns (), block, &block_stack); |
467456d0 | 5659 | |
718fe406 | 5660 | BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block)); |
18c038b9 MM |
5661 | |
5662 | VARRAY_FREE (block_stack); | |
467456d0 RS |
5663 | } |
5664 | ||
0a1c58a2 JL |
5665 | /* Helper function for reorder_blocks. Process the insn chain beginning |
5666 | at INSNS. Recurse for CALL_PLACEHOLDER insns. */ | |
5667 | ||
5668 | static void | |
5669 | reorder_blocks_1 (insns, current_block, p_block_stack) | |
5670 | rtx insns; | |
5671 | tree current_block; | |
5672 | varray_type *p_block_stack; | |
5673 | { | |
5674 | rtx insn; | |
5675 | ||
5676 | for (insn = insns; insn; insn = NEXT_INSN (insn)) | |
5677 | { | |
5678 | if (GET_CODE (insn) == NOTE) | |
5679 | { | |
5680 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG) | |
5681 | { | |
5682 | tree block = NOTE_BLOCK (insn); | |
5683 | /* If we have seen this block before, copy it. */ | |
5684 | if (TREE_ASM_WRITTEN (block)) | |
5685 | { | |
5686 | block = copy_node (block); | |
5687 | NOTE_BLOCK (insn) = block; | |
5688 | } | |
5689 | BLOCK_SUBBLOCKS (block) = 0; | |
5690 | TREE_ASM_WRITTEN (block) = 1; | |
718fe406 | 5691 | BLOCK_SUPERCONTEXT (block) = current_block; |
0a1c58a2 JL |
5692 | BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block); |
5693 | BLOCK_SUBBLOCKS (current_block) = block; | |
5694 | current_block = block; | |
5695 | VARRAY_PUSH_TREE (*p_block_stack, block); | |
5696 | } | |
5697 | else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END) | |
5698 | { | |
5699 | NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack); | |
5700 | VARRAY_POP (*p_block_stack); | |
5701 | BLOCK_SUBBLOCKS (current_block) | |
5702 | = blocks_nreverse (BLOCK_SUBBLOCKS (current_block)); | |
5703 | current_block = BLOCK_SUPERCONTEXT (current_block); | |
5704 | } | |
5705 | } | |
5706 | else if (GET_CODE (insn) == CALL_INSN | |
5707 | && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER) | |
5708 | { | |
5709 | rtx cp = PATTERN (insn); | |
5710 | reorder_blocks_1 (XEXP (cp, 0), current_block, p_block_stack); | |
5711 | if (XEXP (cp, 1)) | |
5712 | reorder_blocks_1 (XEXP (cp, 1), current_block, p_block_stack); | |
5713 | if (XEXP (cp, 2)) | |
5714 | reorder_blocks_1 (XEXP (cp, 2), current_block, p_block_stack); | |
5715 | } | |
5716 | } | |
5717 | } | |
5718 | ||
467456d0 RS |
5719 | /* Reverse the order of elements in the chain T of blocks, |
5720 | and return the new head of the chain (old last element). */ | |
5721 | ||
5722 | static tree | |
5723 | blocks_nreverse (t) | |
5724 | tree t; | |
5725 | { | |
5726 | register tree prev = 0, decl, next; | |
5727 | for (decl = t; decl; decl = next) | |
5728 | { | |
5729 | next = BLOCK_CHAIN (decl); | |
5730 | BLOCK_CHAIN (decl) = prev; | |
5731 | prev = decl; | |
5732 | } | |
5733 | return prev; | |
5734 | } | |
5735 | ||
18c038b9 MM |
5736 | /* Count the subblocks of the list starting with BLOCK. If VECTOR is |
5737 | non-NULL, list them all into VECTOR, in a depth-first preorder | |
5738 | traversal of the block tree. Also clear TREE_ASM_WRITTEN in all | |
b2a59b15 | 5739 | blocks. */ |
467456d0 RS |
5740 | |
5741 | static int | |
5742 | all_blocks (block, vector) | |
5743 | tree block; | |
5744 | tree *vector; | |
5745 | { | |
b2a59b15 MS |
5746 | int n_blocks = 0; |
5747 | ||
5748 | while (block) | |
5749 | { | |
5750 | TREE_ASM_WRITTEN (block) = 0; | |
5751 | ||
5752 | /* Record this block. */ | |
5753 | if (vector) | |
5754 | vector[n_blocks] = block; | |
5755 | ||
5756 | ++n_blocks; | |
718fe406 | 5757 | |
b2a59b15 MS |
5758 | /* Record the subblocks, and their subblocks... */ |
5759 | n_blocks += all_blocks (BLOCK_SUBBLOCKS (block), | |
5760 | vector ? vector + n_blocks : 0); | |
5761 | block = BLOCK_CHAIN (block); | |
5762 | } | |
467456d0 RS |
5763 | |
5764 | return n_blocks; | |
5765 | } | |
18c038b9 MM |
5766 | |
5767 | /* Return a vector containing all the blocks rooted at BLOCK. The | |
5768 | number of elements in the vector is stored in N_BLOCKS_P. The | |
5769 | vector is dynamically allocated; it is the caller's responsibility | |
5770 | to call `free' on the pointer returned. */ | |
718fe406 | 5771 | |
18c038b9 MM |
5772 | static tree * |
5773 | get_block_vector (block, n_blocks_p) | |
5774 | tree block; | |
5775 | int *n_blocks_p; | |
5776 | { | |
5777 | tree *block_vector; | |
5778 | ||
5779 | *n_blocks_p = all_blocks (block, NULL); | |
5780 | block_vector = (tree *) xmalloc (*n_blocks_p * sizeof (tree)); | |
5781 | all_blocks (block, block_vector); | |
5782 | ||
5783 | return block_vector; | |
5784 | } | |
5785 | ||
5786 | static int next_block_index = 2; | |
5787 | ||
5788 | /* Set BLOCK_NUMBER for all the blocks in FN. */ | |
5789 | ||
5790 | void | |
5791 | number_blocks (fn) | |
5792 | tree fn; | |
5793 | { | |
5794 | int i; | |
5795 | int n_blocks; | |
5796 | tree *block_vector; | |
5797 | ||
5798 | /* For SDB and XCOFF debugging output, we start numbering the blocks | |
5799 | from 1 within each function, rather than keeping a running | |
5800 | count. */ | |
5801 | #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO) | |
b0e3a658 RK |
5802 | if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG) |
5803 | next_block_index = 1; | |
18c038b9 MM |
5804 | #endif |
5805 | ||
5806 | block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks); | |
5807 | ||
5808 | /* The top-level BLOCK isn't numbered at all. */ | |
5809 | for (i = 1; i < n_blocks; ++i) | |
5810 | /* We number the blocks from two. */ | |
5811 | BLOCK_NUMBER (block_vector[i]) = next_block_index++; | |
5812 | ||
5813 | free (block_vector); | |
5814 | ||
5815 | return; | |
5816 | } | |
467456d0 | 5817 | \f |
b384405b BS |
5818 | /* Allocate a function structure and reset its contents to the defaults. */ |
5819 | static void | |
5820 | prepare_function_start () | |
6f086dfc | 5821 | { |
01d939e8 | 5822 | cfun = (struct function *) xcalloc (1, sizeof (struct function)); |
e2ecd91c | 5823 | |
6f086dfc | 5824 | init_stmt_for_function (); |
fa51b01b | 5825 | init_eh_for_function (); |
6f086dfc RS |
5826 | |
5827 | cse_not_expected = ! optimize; | |
5828 | ||
5829 | /* Caller save not needed yet. */ | |
5830 | caller_save_needed = 0; | |
5831 | ||
5832 | /* No stack slots have been made yet. */ | |
5833 | stack_slot_list = 0; | |
5834 | ||
b384405b BS |
5835 | current_function_has_nonlocal_label = 0; |
5836 | current_function_has_nonlocal_goto = 0; | |
5837 | ||
6f086dfc | 5838 | /* There is no stack slot for handling nonlocal gotos. */ |
ba716ac9 | 5839 | nonlocal_goto_handler_slots = 0; |
6f086dfc RS |
5840 | nonlocal_goto_stack_level = 0; |
5841 | ||
5842 | /* No labels have been declared for nonlocal use. */ | |
5843 | nonlocal_labels = 0; | |
e881bb1b | 5844 | nonlocal_goto_handler_labels = 0; |
6f086dfc RS |
5845 | |
5846 | /* No function calls so far in this function. */ | |
5847 | function_call_count = 0; | |
5848 | ||
5849 | /* No parm regs have been allocated. | |
5850 | (This is important for output_inline_function.) */ | |
5851 | max_parm_reg = LAST_VIRTUAL_REGISTER + 1; | |
5852 | ||
5853 | /* Initialize the RTL mechanism. */ | |
5854 | init_emit (); | |
5855 | ||
5856 | /* Initialize the queue of pending postincrement and postdecrements, | |
5857 | and some other info in expr.c. */ | |
5858 | init_expr (); | |
718fe406 | 5859 | |
6f086dfc RS |
5860 | /* We haven't done register allocation yet. */ |
5861 | reg_renumber = 0; | |
5862 | ||
01d939e8 | 5863 | init_varasm_status (cfun); |
6f086dfc | 5864 | |
e2ecd91c | 5865 | /* Clear out data used for inlining. */ |
01d939e8 BS |
5866 | cfun->inlinable = 0; |
5867 | cfun->original_decl_initial = 0; | |
718fe406 | 5868 | cfun->original_arg_vector = 0; |
e2ecd91c | 5869 | |
c2f8b491 | 5870 | #ifdef STACK_BOUNDARY |
c487e484 | 5871 | cfun->stack_alignment_needed = STACK_BOUNDARY; |
c2f8b491 | 5872 | cfun->preferred_stack_boundary = STACK_BOUNDARY; |
c487e484 RE |
5873 | #else |
5874 | cfun->stack_alignment_needed = 0; | |
0a1c58a2 | 5875 | cfun->preferred_stack_boundary = 0; |
c2f8b491 | 5876 | #endif |
a0871656 | 5877 | |
6f086dfc RS |
5878 | /* Set if a call to setjmp is seen. */ |
5879 | current_function_calls_setjmp = 0; | |
5880 | ||
5881 | /* Set if a call to longjmp is seen. */ | |
5882 | current_function_calls_longjmp = 0; | |
5883 | ||
5884 | current_function_calls_alloca = 0; | |
6f086dfc | 5885 | current_function_contains_functions = 0; |
54ff41b7 | 5886 | current_function_is_leaf = 0; |
fb13d4d0 | 5887 | current_function_nothrow = 0; |
fdb8a883 | 5888 | current_function_sp_is_unchanging = 0; |
54ff41b7 | 5889 | current_function_uses_only_leaf_regs = 0; |
acd693d1 | 5890 | current_function_has_computed_jump = 0; |
173cd503 | 5891 | current_function_is_thunk = 0; |
6f086dfc RS |
5892 | |
5893 | current_function_returns_pcc_struct = 0; | |
5894 | current_function_returns_struct = 0; | |
5895 | current_function_epilogue_delay_list = 0; | |
5896 | current_function_uses_const_pool = 0; | |
5897 | current_function_uses_pic_offset_table = 0; | |
aeb302bb | 5898 | current_function_cannot_inline = 0; |
6f086dfc RS |
5899 | |
5900 | /* We have not yet needed to make a label to jump to for tail-recursion. */ | |
5901 | tail_recursion_label = 0; | |
5902 | ||
5903 | /* We haven't had a need to make a save area for ap yet. */ | |
6f086dfc RS |
5904 | arg_pointer_save_area = 0; |
5905 | ||
5906 | /* No stack slots allocated yet. */ | |
5907 | frame_offset = 0; | |
5908 | ||
5909 | /* No SAVE_EXPRs in this function yet. */ | |
5910 | save_expr_regs = 0; | |
5911 | ||
5912 | /* No RTL_EXPRs in this function yet. */ | |
5913 | rtl_expr_chain = 0; | |
5914 | ||
bc0ebdf9 RK |
5915 | /* Set up to allocate temporaries. */ |
5916 | init_temp_slots (); | |
6f086dfc | 5917 | |
b384405b BS |
5918 | /* Indicate that we need to distinguish between the return value of the |
5919 | present function and the return value of a function being called. */ | |
5920 | rtx_equal_function_value_matters = 1; | |
5921 | ||
5922 | /* Indicate that we have not instantiated virtual registers yet. */ | |
5923 | virtuals_instantiated = 0; | |
5924 | ||
1b3d8f8a GK |
5925 | /* Indicate that we want CONCATs now. */ |
5926 | generating_concat_p = 1; | |
5927 | ||
b384405b BS |
5928 | /* Indicate we have no need of a frame pointer yet. */ |
5929 | frame_pointer_needed = 0; | |
5930 | ||
5931 | /* By default assume not varargs or stdarg. */ | |
5932 | current_function_varargs = 0; | |
5933 | current_function_stdarg = 0; | |
6f086dfc | 5934 | |
d9a98e1a RK |
5935 | /* We haven't made any trampolines for this function yet. */ |
5936 | trampoline_list = 0; | |
5937 | ||
6f086dfc RS |
5938 | init_pending_stack_adjust (); |
5939 | inhibit_defer_pop = 0; | |
5940 | ||
5941 | current_function_outgoing_args_size = 0; | |
36edd3cc | 5942 | |
0a8a198c | 5943 | if (init_lang_status) |
01d939e8 | 5944 | (*init_lang_status) (cfun); |
36edd3cc | 5945 | if (init_machine_status) |
01d939e8 | 5946 | (*init_machine_status) (cfun); |
b384405b BS |
5947 | } |
5948 | ||
5949 | /* Initialize the rtl expansion mechanism so that we can do simple things | |
5950 | like generate sequences. This is used to provide a context during global | |
5951 | initialization of some passes. */ | |
5952 | void | |
5953 | init_dummy_function_start () | |
5954 | { | |
5955 | prepare_function_start (); | |
5956 | } | |
5957 | ||
5958 | /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node) | |
5959 | and initialize static variables for generating RTL for the statements | |
5960 | of the function. */ | |
5961 | ||
5962 | void | |
5963 | init_function_start (subr, filename, line) | |
5964 | tree subr; | |
36244024 | 5965 | const char *filename; |
b384405b BS |
5966 | int line; |
5967 | { | |
5968 | prepare_function_start (); | |
5969 | ||
5970 | /* Remember this function for later. */ | |
01d939e8 BS |
5971 | cfun->next_global = all_functions; |
5972 | all_functions = cfun; | |
718fe406 | 5973 | |
b384405b | 5974 | current_function_name = (*decl_printable_name) (subr, 2); |
01d939e8 | 5975 | cfun->decl = subr; |
b384405b BS |
5976 | |
5977 | /* Nonzero if this is a nested function that uses a static chain. */ | |
5978 | ||
5979 | current_function_needs_context | |
5980 | = (decl_function_context (current_function_decl) != 0 | |
5981 | && ! DECL_NO_STATIC_CHAIN (current_function_decl)); | |
5982 | ||
5983 | /* Within function body, compute a type's size as soon it is laid out. */ | |
5984 | immediate_size_expand++; | |
6f086dfc | 5985 | |
6f086dfc | 5986 | /* Prevent ever trying to delete the first instruction of a function. |
b274104c | 5987 | Also tell final how to output a linenum before the function prologue. |
718fe406 | 5988 | Note linenums could be missing, e.g. when compiling a Java .class file. */ |
b274104c PB |
5989 | if (line > 0) |
5990 | emit_line_note (filename, line); | |
6f086dfc RS |
5991 | |
5992 | /* Make sure first insn is a note even if we don't want linenums. | |
5993 | This makes sure the first insn will never be deleted. | |
5994 | Also, final expects a note to appear there. */ | |
5f4f0e22 | 5995 | emit_note (NULL_PTR, NOTE_INSN_DELETED); |
6f086dfc RS |
5996 | |
5997 | /* Set flags used by final.c. */ | |
5998 | if (aggregate_value_p (DECL_RESULT (subr))) | |
5999 | { | |
6000 | #ifdef PCC_STATIC_STRUCT_RETURN | |
1b8297c1 | 6001 | current_function_returns_pcc_struct = 1; |
6f086dfc | 6002 | #endif |
1b8297c1 | 6003 | current_function_returns_struct = 1; |
6f086dfc RS |
6004 | } |
6005 | ||
6006 | /* Warn if this value is an aggregate type, | |
6007 | regardless of which calling convention we are using for it. */ | |
6008 | if (warn_aggregate_return | |
05e3bdb9 | 6009 | && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr)))) |
6f086dfc RS |
6010 | warning ("function returns an aggregate"); |
6011 | ||
6012 | current_function_returns_pointer | |
8eda074c | 6013 | = POINTER_TYPE_P (TREE_TYPE (DECL_RESULT (subr))); |
49ad7cfa | 6014 | } |
5c7675e9 | 6015 | |
49ad7cfa BS |
6016 | /* Make sure all values used by the optimization passes have sane |
6017 | defaults. */ | |
6018 | void | |
6019 | init_function_for_compilation () | |
6020 | { | |
6021 | reg_renumber = 0; | |
0a1c58a2 | 6022 | |
5c7675e9 | 6023 | /* No prologue/epilogue insns yet. */ |
0a1c58a2 JL |
6024 | VARRAY_GROW (prologue, 0); |
6025 | VARRAY_GROW (epilogue, 0); | |
6026 | VARRAY_GROW (sibcall_epilogue, 0); | |
6f086dfc RS |
6027 | } |
6028 | ||
6029 | /* Indicate that the current function uses extra args | |
6030 | not explicitly mentioned in the argument list in any fashion. */ | |
6031 | ||
6032 | void | |
6033 | mark_varargs () | |
6034 | { | |
6035 | current_function_varargs = 1; | |
6036 | } | |
6037 | ||
6038 | /* Expand a call to __main at the beginning of a possible main function. */ | |
6039 | ||
e2fd1d94 JM |
6040 | #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main) |
6041 | #undef HAS_INIT_SECTION | |
6042 | #define HAS_INIT_SECTION | |
6043 | #endif | |
6044 | ||
6f086dfc RS |
6045 | void |
6046 | expand_main_function () | |
6047 | { | |
e2fd1d94 | 6048 | #if !defined (HAS_INIT_SECTION) |
b93a436e JL |
6049 | emit_library_call (gen_rtx_SYMBOL_REF (Pmode, NAME__MAIN), 0, |
6050 | VOIDmode, 0); | |
e2fd1d94 | 6051 | #endif /* not HAS_INIT_SECTION */ |
6f086dfc RS |
6052 | } |
6053 | \f | |
c20bf1f3 JB |
6054 | extern struct obstack permanent_obstack; |
6055 | ||
6f086dfc RS |
6056 | /* Start the RTL for a new function, and set variables used for |
6057 | emitting RTL. | |
6058 | SUBR is the FUNCTION_DECL node. | |
6059 | PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with | |
6060 | the function's parameters, which must be run at any return statement. */ | |
6061 | ||
6062 | void | |
6063 | expand_function_start (subr, parms_have_cleanups) | |
6064 | tree subr; | |
6065 | int parms_have_cleanups; | |
6066 | { | |
6f086dfc | 6067 | tree tem; |
4e86caed | 6068 | rtx last_ptr = NULL_RTX; |
6f086dfc RS |
6069 | |
6070 | /* Make sure volatile mem refs aren't considered | |
6071 | valid operands of arithmetic insns. */ | |
6072 | init_recog_no_volatile (); | |
6073 | ||
7d384cc0 KR |
6074 | /* Set this before generating any memory accesses. */ |
6075 | current_function_check_memory_usage | |
6076 | = (flag_check_memory_usage | |
6077 | && ! DECL_NO_CHECK_MEMORY_USAGE (current_function_decl)); | |
6078 | ||
07417085 KR |
6079 | current_function_instrument_entry_exit |
6080 | = (flag_instrument_function_entry_exit | |
6081 | && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr)); | |
6082 | ||
a157febd GK |
6083 | current_function_limit_stack |
6084 | = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr)); | |
6085 | ||
6f086dfc RS |
6086 | /* If function gets a static chain arg, store it in the stack frame. |
6087 | Do this first, so it gets the first stack slot offset. */ | |
6088 | if (current_function_needs_context) | |
3e2481e9 JW |
6089 | { |
6090 | last_ptr = assign_stack_local (Pmode, GET_MODE_SIZE (Pmode), 0); | |
f0c51a1e | 6091 | |
f0c51a1e RK |
6092 | /* Delay copying static chain if it is not a register to avoid |
6093 | conflicts with regs used for parameters. */ | |
f95182a4 ILT |
6094 | if (! SMALL_REGISTER_CLASSES |
6095 | || GET_CODE (static_chain_incoming_rtx) == REG) | |
718fe406 | 6096 | emit_move_insn (last_ptr, static_chain_incoming_rtx); |
3e2481e9 | 6097 | } |
6f086dfc RS |
6098 | |
6099 | /* If the parameters of this function need cleaning up, get a label | |
6100 | for the beginning of the code which executes those cleanups. This must | |
6101 | be done before doing anything with return_label. */ | |
6102 | if (parms_have_cleanups) | |
6103 | cleanup_label = gen_label_rtx (); | |
6104 | else | |
6105 | cleanup_label = 0; | |
6106 | ||
6107 | /* Make the label for return statements to jump to, if this machine | |
6108 | does not have a one-instruction return and uses an epilogue, | |
6109 | or if it returns a structure, or if it has parm cleanups. */ | |
6110 | #ifdef HAVE_return | |
6111 | if (cleanup_label == 0 && HAVE_return | |
07417085 | 6112 | && ! current_function_instrument_entry_exit |
6f086dfc RS |
6113 | && ! current_function_returns_pcc_struct |
6114 | && ! (current_function_returns_struct && ! optimize)) | |
6115 | return_label = 0; | |
6116 | else | |
6117 | return_label = gen_label_rtx (); | |
6118 | #else | |
6119 | return_label = gen_label_rtx (); | |
6120 | #endif | |
6121 | ||
6122 | /* Initialize rtx used to return the value. */ | |
6123 | /* Do this before assign_parms so that we copy the struct value address | |
6124 | before any library calls that assign parms might generate. */ | |
6125 | ||
6126 | /* Decide whether to return the value in memory or in a register. */ | |
6127 | if (aggregate_value_p (DECL_RESULT (subr))) | |
6128 | { | |
6129 | /* Returning something that won't go in a register. */ | |
4acc00bf | 6130 | register rtx value_address = 0; |
6f086dfc RS |
6131 | |
6132 | #ifdef PCC_STATIC_STRUCT_RETURN | |
6133 | if (current_function_returns_pcc_struct) | |
6134 | { | |
6135 | int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr))); | |
6136 | value_address = assemble_static_space (size); | |
6137 | } | |
6138 | else | |
6139 | #endif | |
6140 | { | |
6141 | /* Expect to be passed the address of a place to store the value. | |
6142 | If it is passed as an argument, assign_parms will take care of | |
6143 | it. */ | |
6144 | if (struct_value_incoming_rtx) | |
6145 | { | |
6146 | value_address = gen_reg_rtx (Pmode); | |
6147 | emit_move_insn (value_address, struct_value_incoming_rtx); | |
6148 | } | |
6149 | } | |
6150 | if (value_address) | |
ccdecf58 RK |
6151 | { |
6152 | DECL_RTL (DECL_RESULT (subr)) | |
38a448ca | 6153 | = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), value_address); |
3bdf5ad1 RK |
6154 | set_mem_attributes (DECL_RTL (DECL_RESULT (subr)), |
6155 | DECL_RESULT (subr), 1); | |
ccdecf58 | 6156 | } |
6f086dfc RS |
6157 | } |
6158 | else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode) | |
6159 | /* If return mode is void, this decl rtl should not be used. */ | |
6160 | DECL_RTL (DECL_RESULT (subr)) = 0; | |
07417085 | 6161 | else if (parms_have_cleanups || current_function_instrument_entry_exit) |
a53e14c0 RK |
6162 | { |
6163 | /* If function will end with cleanup code for parms, | |
6164 | compute the return values into a pseudo reg, | |
6165 | which we will copy into the true return register | |
6166 | after the cleanups are done. */ | |
6167 | ||
6168 | enum machine_mode mode = DECL_MODE (DECL_RESULT (subr)); | |
a5a52dbc | 6169 | |
a53e14c0 RK |
6170 | #ifdef PROMOTE_FUNCTION_RETURN |
6171 | tree type = TREE_TYPE (DECL_RESULT (subr)); | |
6172 | int unsignedp = TREE_UNSIGNED (type); | |
6173 | ||
a5a52dbc | 6174 | mode = promote_mode (type, mode, &unsignedp, 1); |
a53e14c0 RK |
6175 | #endif |
6176 | ||
6177 | DECL_RTL (DECL_RESULT (subr)) = gen_reg_rtx (mode); | |
6178 | } | |
6f086dfc RS |
6179 | else |
6180 | /* Scalar, returned in a register. */ | |
6181 | { | |
6f086dfc | 6182 | DECL_RTL (DECL_RESULT (subr)) |
ab36bd3e | 6183 | = hard_function_value (TREE_TYPE (DECL_RESULT (subr)), subr, 1); |
6f086dfc RS |
6184 | |
6185 | /* Mark this reg as the function's return value. */ | |
6186 | if (GET_CODE (DECL_RTL (DECL_RESULT (subr))) == REG) | |
6187 | { | |
6188 | REG_FUNCTION_VALUE_P (DECL_RTL (DECL_RESULT (subr))) = 1; | |
6189 | /* Needed because we may need to move this to memory | |
6190 | in case it's a named return value whose address is taken. */ | |
a82ad570 | 6191 | DECL_REGISTER (DECL_RESULT (subr)) = 1; |
6f086dfc RS |
6192 | } |
6193 | } | |
6194 | ||
6195 | /* Initialize rtx for parameters and local variables. | |
6196 | In some cases this requires emitting insns. */ | |
6197 | ||
0d1416c6 | 6198 | assign_parms (subr); |
6f086dfc | 6199 | |
f0c51a1e RK |
6200 | /* Copy the static chain now if it wasn't a register. The delay is to |
6201 | avoid conflicts with the parameter passing registers. */ | |
6202 | ||
f95182a4 | 6203 | if (SMALL_REGISTER_CLASSES && current_function_needs_context) |
f0c51a1e RK |
6204 | if (GET_CODE (static_chain_incoming_rtx) != REG) |
6205 | emit_move_insn (last_ptr, static_chain_incoming_rtx); | |
f0c51a1e | 6206 | |
6f086dfc RS |
6207 | /* The following was moved from init_function_start. |
6208 | The move is supposed to make sdb output more accurate. */ | |
6209 | /* Indicate the beginning of the function body, | |
6210 | as opposed to parm setup. */ | |
5f4f0e22 | 6211 | emit_note (NULL_PTR, NOTE_INSN_FUNCTION_BEG); |
6f086dfc | 6212 | |
6f086dfc | 6213 | if (GET_CODE (get_last_insn ()) != NOTE) |
5f4f0e22 | 6214 | emit_note (NULL_PTR, NOTE_INSN_DELETED); |
6f086dfc RS |
6215 | parm_birth_insn = get_last_insn (); |
6216 | ||
6d7306f7 JM |
6217 | context_display = 0; |
6218 | if (current_function_needs_context) | |
ac9e20f0 | 6219 | { |
6d7306f7 JM |
6220 | /* Fetch static chain values for containing functions. */ |
6221 | tem = decl_function_context (current_function_decl); | |
d29c259b RH |
6222 | /* Copy the static chain pointer into a pseudo. If we have |
6223 | small register classes, copy the value from memory if | |
6224 | static_chain_incoming_rtx is a REG. */ | |
6225 | if (tem) | |
6d7306f7 | 6226 | { |
6d7306f7 JM |
6227 | /* If the static chain originally came in a register, put it back |
6228 | there, then move it out in the next insn. The reason for | |
6229 | this peculiar code is to satisfy function integration. */ | |
f95182a4 ILT |
6230 | if (SMALL_REGISTER_CLASSES |
6231 | && GET_CODE (static_chain_incoming_rtx) == REG) | |
6d7306f7 | 6232 | emit_move_insn (static_chain_incoming_rtx, last_ptr); |
6d7306f7 JM |
6233 | last_ptr = copy_to_reg (static_chain_incoming_rtx); |
6234 | } | |
ac9e20f0 | 6235 | |
6d7306f7 JM |
6236 | while (tem) |
6237 | { | |
6238 | tree rtlexp = make_node (RTL_EXPR); | |
6f086dfc | 6239 | |
6d7306f7 JM |
6240 | RTL_EXPR_RTL (rtlexp) = last_ptr; |
6241 | context_display = tree_cons (tem, rtlexp, context_display); | |
6242 | tem = decl_function_context (tem); | |
6243 | if (tem == 0) | |
6244 | break; | |
6245 | /* Chain thru stack frames, assuming pointer to next lexical frame | |
6246 | is found at the place we always store it. */ | |
6f086dfc | 6247 | #ifdef FRAME_GROWS_DOWNWARD |
718fe406 | 6248 | last_ptr = plus_constant (last_ptr, -GET_MODE_SIZE (Pmode)); |
6f086dfc | 6249 | #endif |
3bdf5ad1 RK |
6250 | last_ptr = gen_rtx_MEM (Pmode, memory_address (Pmode, last_ptr)); |
6251 | MEM_ALIAS_SET (last_ptr) = get_frame_alias_set (); | |
6252 | last_ptr = copy_to_reg (last_ptr); | |
6d7306f7 JM |
6253 | |
6254 | /* If we are not optimizing, ensure that we know that this | |
6255 | piece of context is live over the entire function. */ | |
6256 | if (! optimize) | |
38a448ca RH |
6257 | save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, last_ptr, |
6258 | save_expr_regs); | |
6d7306f7 | 6259 | } |
6f086dfc RS |
6260 | } |
6261 | ||
07417085 KR |
6262 | if (current_function_instrument_entry_exit) |
6263 | { | |
6264 | rtx fun = DECL_RTL (current_function_decl); | |
6265 | if (GET_CODE (fun) == MEM) | |
6266 | fun = XEXP (fun, 0); | |
6267 | else | |
6268 | abort (); | |
6269 | emit_library_call (profile_function_entry_libfunc, 0, VOIDmode, 2, | |
6270 | fun, Pmode, | |
6271 | expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS, | |
6272 | 0, | |
6273 | hard_frame_pointer_rtx), | |
6274 | Pmode); | |
6275 | } | |
6276 | ||
6f086dfc RS |
6277 | /* After the display initializations is where the tail-recursion label |
6278 | should go, if we end up needing one. Ensure we have a NOTE here | |
6279 | since some things (like trampolines) get placed before this. */ | |
5f4f0e22 | 6280 | tail_recursion_reentry = emit_note (NULL_PTR, NOTE_INSN_DELETED); |
6f086dfc RS |
6281 | |
6282 | /* Evaluate now the sizes of any types declared among the arguments. */ | |
6283 | for (tem = nreverse (get_pending_sizes ()); tem; tem = TREE_CHAIN (tem)) | |
7b05e286 | 6284 | { |
86fa911a RK |
6285 | expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode, |
6286 | EXPAND_MEMORY_USE_BAD); | |
7b05e286 JW |
6287 | /* Flush the queue in case this parameter declaration has |
6288 | side-effects. */ | |
6289 | emit_queue (); | |
6290 | } | |
6f086dfc RS |
6291 | |
6292 | /* Make sure there is a line number after the function entry setup code. */ | |
6293 | force_next_line_note (); | |
6294 | } | |
6295 | \f | |
49ad7cfa BS |
6296 | /* Undo the effects of init_dummy_function_start. */ |
6297 | void | |
6298 | expand_dummy_function_end () | |
6299 | { | |
6300 | /* End any sequences that failed to be closed due to syntax errors. */ | |
6301 | while (in_sequence_p ()) | |
6302 | end_sequence (); | |
6303 | ||
6304 | /* Outside function body, can't compute type's actual size | |
6305 | until next function's body starts. */ | |
fa51b01b | 6306 | |
01d939e8 BS |
6307 | free_after_parsing (cfun); |
6308 | free_after_compilation (cfun); | |
6309 | free (cfun); | |
6310 | cfun = 0; | |
49ad7cfa BS |
6311 | } |
6312 | ||
c13fde05 RH |
6313 | /* Call DOIT for each hard register used as a return value from |
6314 | the current function. */ | |
bd695e1e RH |
6315 | |
6316 | void | |
c13fde05 RH |
6317 | diddle_return_value (doit, arg) |
6318 | void (*doit) PARAMS ((rtx, void *)); | |
6319 | void *arg; | |
bd695e1e | 6320 | { |
c13fde05 | 6321 | rtx outgoing = current_function_return_rtx; |
5828d725 | 6322 | int pcc; |
c13fde05 RH |
6323 | |
6324 | if (! outgoing) | |
6325 | return; | |
bd695e1e | 6326 | |
5828d725 | 6327 | pcc = (current_function_returns_struct |
718fe406 | 6328 | || current_function_returns_pcc_struct); |
5828d725 RH |
6329 | |
6330 | if ((GET_CODE (outgoing) == REG | |
6331 | && REGNO (outgoing) >= FIRST_PSEUDO_REGISTER) | |
6332 | || pcc) | |
bd695e1e | 6333 | { |
c13fde05 | 6334 | tree type = TREE_TYPE (DECL_RESULT (current_function_decl)); |
5828d725 RH |
6335 | |
6336 | /* A PCC-style return returns a pointer to the memory in which | |
6337 | the structure is stored. */ | |
6338 | if (pcc) | |
6339 | type = build_pointer_type (type); | |
6340 | ||
c13fde05 RH |
6341 | #ifdef FUNCTION_OUTGOING_VALUE |
6342 | outgoing = FUNCTION_OUTGOING_VALUE (type, current_function_decl); | |
6343 | #else | |
6344 | outgoing = FUNCTION_VALUE (type, current_function_decl); | |
6345 | #endif | |
6346 | /* If this is a BLKmode structure being returned in registers, then use | |
6347 | the mode computed in expand_return. */ | |
6348 | if (GET_MODE (outgoing) == BLKmode) | |
6349 | PUT_MODE (outgoing, | |
6350 | GET_MODE (DECL_RTL (DECL_RESULT (current_function_decl)))); | |
5828d725 | 6351 | REG_FUNCTION_VALUE_P (outgoing) = 1; |
c13fde05 | 6352 | } |
bd695e1e | 6353 | |
c13fde05 RH |
6354 | if (GET_CODE (outgoing) == REG) |
6355 | (*doit) (outgoing, arg); | |
6356 | else if (GET_CODE (outgoing) == PARALLEL) | |
6357 | { | |
6358 | int i; | |
bd695e1e | 6359 | |
c13fde05 RH |
6360 | for (i = 0; i < XVECLEN (outgoing, 0); i++) |
6361 | { | |
6362 | rtx x = XEXP (XVECEXP (outgoing, 0, i), 0); | |
6363 | ||
6364 | if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER) | |
6365 | (*doit) (x, arg); | |
bd695e1e RH |
6366 | } |
6367 | } | |
6368 | } | |
6369 | ||
c13fde05 RH |
6370 | static void |
6371 | do_clobber_return_reg (reg, arg) | |
6372 | rtx reg; | |
6373 | void *arg ATTRIBUTE_UNUSED; | |
6374 | { | |
6375 | emit_insn (gen_rtx_CLOBBER (VOIDmode, reg)); | |
6376 | } | |
6377 | ||
6378 | void | |
6379 | clobber_return_register () | |
6380 | { | |
6381 | diddle_return_value (do_clobber_return_reg, NULL); | |
6382 | } | |
6383 | ||
6384 | static void | |
6385 | do_use_return_reg (reg, arg) | |
6386 | rtx reg; | |
6387 | void *arg ATTRIBUTE_UNUSED; | |
6388 | { | |
6389 | emit_insn (gen_rtx_USE (VOIDmode, reg)); | |
6390 | } | |
6391 | ||
6392 | void | |
6393 | use_return_register () | |
6394 | { | |
6395 | diddle_return_value (do_use_return_reg, NULL); | |
6396 | } | |
6397 | ||
6f086dfc | 6398 | /* Generate RTL for the end of the current function. |
718fe406 | 6399 | FILENAME and LINE are the current position in the source file. |
6f086dfc | 6400 | |
980697fd | 6401 | It is up to language-specific callers to do cleanups for parameters-- |
1be07046 | 6402 | or else, supply 1 for END_BINDINGS and we will call expand_end_bindings. */ |
6f086dfc RS |
6403 | |
6404 | void | |
1be07046 | 6405 | expand_function_end (filename, line, end_bindings) |
3b304f5b | 6406 | const char *filename; |
6f086dfc | 6407 | int line; |
1be07046 | 6408 | int end_bindings; |
6f086dfc | 6409 | { |
6f086dfc RS |
6410 | tree link; |
6411 | ||
1e2414db | 6412 | #ifdef TRAMPOLINE_TEMPLATE |
6f086dfc | 6413 | static rtx initial_trampoline; |
1e2414db | 6414 | #endif |
6f086dfc | 6415 | |
49ad7cfa BS |
6416 | finish_expr_for_function (); |
6417 | ||
6f086dfc RS |
6418 | #ifdef NON_SAVING_SETJMP |
6419 | /* Don't put any variables in registers if we call setjmp | |
6420 | on a machine that fails to restore the registers. */ | |
6421 | if (NON_SAVING_SETJMP && current_function_calls_setjmp) | |
6422 | { | |
b88a3142 RK |
6423 | if (DECL_INITIAL (current_function_decl) != error_mark_node) |
6424 | setjmp_protect (DECL_INITIAL (current_function_decl)); | |
6425 | ||
6f086dfc RS |
6426 | setjmp_protect_args (); |
6427 | } | |
6428 | #endif | |
6429 | ||
6430 | /* Save the argument pointer if a save area was made for it. */ | |
6431 | if (arg_pointer_save_area) | |
6432 | { | |
ea0f9a85 JW |
6433 | /* arg_pointer_save_area may not be a valid memory address, so we |
6434 | have to check it and fix it if necessary. */ | |
6435 | rtx seq; | |
6436 | start_sequence (); | |
6437 | emit_move_insn (validize_mem (arg_pointer_save_area), | |
6438 | virtual_incoming_args_rtx); | |
6439 | seq = gen_sequence (); | |
6440 | end_sequence (); | |
6441 | emit_insn_before (seq, tail_recursion_reentry); | |
6f086dfc RS |
6442 | } |
6443 | ||
6444 | /* Initialize any trampolines required by this function. */ | |
6445 | for (link = trampoline_list; link; link = TREE_CHAIN (link)) | |
6446 | { | |
6447 | tree function = TREE_PURPOSE (link); | |
57bed152 | 6448 | rtx context ATTRIBUTE_UNUSED = lookup_static_chain (function); |
6f086dfc | 6449 | rtx tramp = RTL_EXPR_RTL (TREE_VALUE (link)); |
7a87758d | 6450 | #ifdef TRAMPOLINE_TEMPLATE |
1e2414db | 6451 | rtx blktramp; |
7a87758d | 6452 | #endif |
6f086dfc RS |
6453 | rtx seq; |
6454 | ||
1e2414db | 6455 | #ifdef TRAMPOLINE_TEMPLATE |
6f086dfc RS |
6456 | /* First make sure this compilation has a template for |
6457 | initializing trampolines. */ | |
6458 | if (initial_trampoline == 0) | |
86f8eff3 RK |
6459 | { |
6460 | end_temporary_allocation (); | |
6461 | initial_trampoline | |
38a448ca | 6462 | = gen_rtx_MEM (BLKmode, assemble_trampoline_template ()); |
86f8eff3 | 6463 | resume_temporary_allocation (); |
76095e2f RH |
6464 | |
6465 | ggc_add_rtx_root (&initial_trampoline, 1); | |
86f8eff3 | 6466 | } |
1e2414db | 6467 | #endif |
6f086dfc RS |
6468 | |
6469 | /* Generate insns to initialize the trampoline. */ | |
6470 | start_sequence (); | |
1e2414db RK |
6471 | tramp = round_trampoline_addr (XEXP (tramp, 0)); |
6472 | #ifdef TRAMPOLINE_TEMPLATE | |
6473 | blktramp = change_address (initial_trampoline, BLKmode, tramp); | |
6474 | emit_block_move (blktramp, initial_trampoline, | |
6475 | GEN_INT (TRAMPOLINE_SIZE), | |
744bfbfa | 6476 | TRAMPOLINE_ALIGNMENT); |
1e2414db RK |
6477 | #endif |
6478 | INITIALIZE_TRAMPOLINE (tramp, XEXP (DECL_RTL (function), 0), context); | |
6f086dfc RS |
6479 | seq = get_insns (); |
6480 | end_sequence (); | |
6481 | ||
6482 | /* Put those insns at entry to the containing function (this one). */ | |
6483 | emit_insns_before (seq, tail_recursion_reentry); | |
6484 | } | |
6f086dfc | 6485 | |
11044f66 RK |
6486 | /* If we are doing stack checking and this function makes calls, |
6487 | do a stack probe at the start of the function to ensure we have enough | |
6488 | space for another stack frame. */ | |
6489 | if (flag_stack_check && ! STACK_CHECK_BUILTIN) | |
6490 | { | |
6491 | rtx insn, seq; | |
6492 | ||
6493 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
6494 | if (GET_CODE (insn) == CALL_INSN) | |
6495 | { | |
6496 | start_sequence (); | |
6497 | probe_stack_range (STACK_CHECK_PROTECT, | |
6498 | GEN_INT (STACK_CHECK_MAX_FRAME_SIZE)); | |
6499 | seq = get_insns (); | |
6500 | end_sequence (); | |
6501 | emit_insns_before (seq, tail_recursion_reentry); | |
6502 | break; | |
6503 | } | |
6504 | } | |
6505 | ||
db8717d9 | 6506 | /* Warn about unused parms if extra warnings were specified. */ |
078721e1 AC |
6507 | /* Either ``-W -Wunused'' or ``-Wunused-parameter'' enables this |
6508 | warning. WARN_UNUSED_PARAMETER is negative when set by | |
718fe406 | 6509 | -Wunused. */ |
078721e1 AC |
6510 | if (warn_unused_parameter > 0 |
6511 | || (warn_unused_parameter < 0 && extra_warnings)) | |
6f086dfc | 6512 | { |
db8717d9 | 6513 | tree decl; |
6f086dfc RS |
6514 | |
6515 | for (decl = DECL_ARGUMENTS (current_function_decl); | |
6516 | decl; decl = TREE_CHAIN (decl)) | |
497dc802 JM |
6517 | if (! TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL |
6518 | && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl)) | |
6f086dfc RS |
6519 | warning_with_decl (decl, "unused parameter `%s'"); |
6520 | } | |
6f086dfc RS |
6521 | |
6522 | /* Delete handlers for nonlocal gotos if nothing uses them. */ | |
ba716ac9 BS |
6523 | if (nonlocal_goto_handler_slots != 0 |
6524 | && ! current_function_has_nonlocal_label) | |
6f086dfc RS |
6525 | delete_handlers (); |
6526 | ||
6527 | /* End any sequences that failed to be closed due to syntax errors. */ | |
6528 | while (in_sequence_p ()) | |
5f4f0e22 | 6529 | end_sequence (); |
6f086dfc RS |
6530 | |
6531 | /* Outside function body, can't compute type's actual size | |
6532 | until next function's body starts. */ | |
6533 | immediate_size_expand--; | |
6534 | ||
6f086dfc RS |
6535 | clear_pending_stack_adjust (); |
6536 | do_pending_stack_adjust (); | |
6537 | ||
6538 | /* Mark the end of the function body. | |
6539 | If control reaches this insn, the function can drop through | |
6540 | without returning a value. */ | |
5f4f0e22 | 6541 | emit_note (NULL_PTR, NOTE_INSN_FUNCTION_END); |
6f086dfc | 6542 | |
82e415a3 DE |
6543 | /* Must mark the last line number note in the function, so that the test |
6544 | coverage code can avoid counting the last line twice. This just tells | |
6545 | the code to ignore the immediately following line note, since there | |
6546 | already exists a copy of this note somewhere above. This line number | |
6547 | note is still needed for debugging though, so we can't delete it. */ | |
6548 | if (flag_test_coverage) | |
b3b42a4d | 6549 | emit_note (NULL_PTR, NOTE_INSN_REPEATED_LINE_NUMBER); |
82e415a3 | 6550 | |
6f086dfc RS |
6551 | /* Output a linenumber for the end of the function. |
6552 | SDB depends on this. */ | |
6553 | emit_line_note_force (filename, line); | |
6554 | ||
6555 | /* Output the label for the actual return from the function, | |
6556 | if one is expected. This happens either because a function epilogue | |
6557 | is used instead of a return instruction, or because a return was done | |
6558 | with a goto in order to run local cleanups, or because of pcc-style | |
6559 | structure returning. */ | |
6560 | ||
6561 | if (return_label) | |
bd695e1e RH |
6562 | { |
6563 | /* Before the return label, clobber the return registers so that | |
6564 | they are not propogated live to the rest of the function. This | |
6565 | can only happen with functions that drop through; if there had | |
6566 | been a return statement, there would have either been a return | |
6567 | rtx, or a jump to the return label. */ | |
c13fde05 | 6568 | clobber_return_register (); |
bd695e1e RH |
6569 | |
6570 | emit_label (return_label); | |
6571 | } | |
6f086dfc | 6572 | |
1be07046 RS |
6573 | /* C++ uses this. */ |
6574 | if (end_bindings) | |
6575 | expand_end_bindings (0, 0, 0); | |
6576 | ||
e5a1e0e8 MS |
6577 | /* Now handle any leftover exception regions that may have been |
6578 | created for the parameters. */ | |
6579 | { | |
6580 | rtx last = get_last_insn (); | |
6581 | rtx label; | |
6582 | ||
6583 | expand_leftover_cleanups (); | |
6584 | ||
1e4ceb6f MM |
6585 | /* If there are any catch_clauses remaining, output them now. */ |
6586 | emit_insns (catch_clauses); | |
c14f7160 | 6587 | catch_clauses = catch_clauses_last = NULL_RTX; |
e5a1e0e8 MS |
6588 | /* If the above emitted any code, may sure we jump around it. */ |
6589 | if (last != get_last_insn ()) | |
6590 | { | |
6591 | label = gen_label_rtx (); | |
6592 | last = emit_jump_insn_after (gen_jump (label), last); | |
6593 | last = emit_barrier_after (last); | |
6594 | emit_label (label); | |
6595 | } | |
6596 | } | |
6597 | ||
07417085 KR |
6598 | if (current_function_instrument_entry_exit) |
6599 | { | |
6600 | rtx fun = DECL_RTL (current_function_decl); | |
6601 | if (GET_CODE (fun) == MEM) | |
6602 | fun = XEXP (fun, 0); | |
6603 | else | |
6604 | abort (); | |
6605 | emit_library_call (profile_function_exit_libfunc, 0, VOIDmode, 2, | |
6606 | fun, Pmode, | |
6607 | expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS, | |
6608 | 0, | |
6609 | hard_frame_pointer_rtx), | |
6610 | Pmode); | |
6611 | } | |
6612 | ||
6f086dfc RS |
6613 | /* If we had calls to alloca, and this machine needs |
6614 | an accurate stack pointer to exit the function, | |
6615 | insert some code to save and restore the stack pointer. */ | |
6616 | #ifdef EXIT_IGNORE_STACK | |
6617 | if (! EXIT_IGNORE_STACK) | |
6618 | #endif | |
6619 | if (current_function_calls_alloca) | |
6620 | { | |
59257ff7 RK |
6621 | rtx tem = 0; |
6622 | ||
6623 | emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn); | |
5f4f0e22 | 6624 | emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX); |
6f086dfc RS |
6625 | } |
6626 | ||
6627 | /* If scalar return value was computed in a pseudo-reg, | |
6628 | copy that to the hard return register. */ | |
6629 | if (DECL_RTL (DECL_RESULT (current_function_decl)) != 0 | |
6630 | && GET_CODE (DECL_RTL (DECL_RESULT (current_function_decl))) == REG | |
6631 | && (REGNO (DECL_RTL (DECL_RESULT (current_function_decl))) | |
6632 | >= FIRST_PSEUDO_REGISTER)) | |
6633 | { | |
6634 | rtx real_decl_result; | |
6635 | ||
6636 | #ifdef FUNCTION_OUTGOING_VALUE | |
6637 | real_decl_result | |
6638 | = FUNCTION_OUTGOING_VALUE (TREE_TYPE (DECL_RESULT (current_function_decl)), | |
6639 | current_function_decl); | |
6640 | #else | |
6641 | real_decl_result | |
6642 | = FUNCTION_VALUE (TREE_TYPE (DECL_RESULT (current_function_decl)), | |
6643 | current_function_decl); | |
6644 | #endif | |
6645 | REG_FUNCTION_VALUE_P (real_decl_result) = 1; | |
ecec4441 JW |
6646 | /* If this is a BLKmode structure being returned in registers, then use |
6647 | the mode computed in expand_return. */ | |
6648 | if (GET_MODE (real_decl_result) == BLKmode) | |
6649 | PUT_MODE (real_decl_result, | |
6650 | GET_MODE (DECL_RTL (DECL_RESULT (current_function_decl)))); | |
6f086dfc RS |
6651 | emit_move_insn (real_decl_result, |
6652 | DECL_RTL (DECL_RESULT (current_function_decl))); | |
f345de42 JL |
6653 | |
6654 | /* The delay slot scheduler assumes that current_function_return_rtx | |
6655 | holds the hard register containing the return value, not a temporary | |
6656 | pseudo. */ | |
6657 | current_function_return_rtx = real_decl_result; | |
6f086dfc RS |
6658 | } |
6659 | ||
6660 | /* If returning a structure, arrange to return the address of the value | |
6661 | in a place where debuggers expect to find it. | |
6662 | ||
6663 | If returning a structure PCC style, | |
6664 | the caller also depends on this value. | |
6665 | And current_function_returns_pcc_struct is not necessarily set. */ | |
6666 | if (current_function_returns_struct | |
6667 | || current_function_returns_pcc_struct) | |
6668 | { | |
718fe406 KH |
6669 | rtx value_address = |
6670 | XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0); | |
6f086dfc RS |
6671 | tree type = TREE_TYPE (DECL_RESULT (current_function_decl)); |
6672 | #ifdef FUNCTION_OUTGOING_VALUE | |
6673 | rtx outgoing | |
6674 | = FUNCTION_OUTGOING_VALUE (build_pointer_type (type), | |
6675 | current_function_decl); | |
6676 | #else | |
6677 | rtx outgoing | |
6678 | = FUNCTION_VALUE (build_pointer_type (type), | |
6679 | current_function_decl); | |
6680 | #endif | |
6681 | ||
6682 | /* Mark this as a function return value so integrate will delete the | |
6683 | assignment and USE below when inlining this function. */ | |
6684 | REG_FUNCTION_VALUE_P (outgoing) = 1; | |
6685 | ||
6686 | emit_move_insn (outgoing, value_address); | |
6f086dfc RS |
6687 | } |
6688 | ||
c13fde05 RH |
6689 | /* ??? This should no longer be necessary since stupid is no longer with |
6690 | us, but there are some parts of the compiler (eg reload_combine, and | |
6691 | sh mach_dep_reorg) that still try and compute their own lifetime info | |
6692 | instead of using the general framework. */ | |
6693 | use_return_register (); | |
6694 | ||
718fe406 | 6695 | /* If this is an implementation of __throw, do what's necessary to |
71038426 RH |
6696 | communicate between __builtin_eh_return and the epilogue. */ |
6697 | expand_eh_return (); | |
6698 | ||
6f086dfc RS |
6699 | /* Output a return insn if we are using one. |
6700 | Otherwise, let the rtl chain end here, to drop through | |
6701 | into the epilogue. */ | |
6702 | ||
6703 | #ifdef HAVE_return | |
6704 | if (HAVE_return) | |
6705 | { | |
6706 | emit_jump_insn (gen_return ()); | |
6707 | emit_barrier (); | |
6708 | } | |
6709 | #endif | |
6710 | ||
6711 | /* Fix up any gotos that jumped out to the outermost | |
6712 | binding level of the function. | |
6713 | Must follow emitting RETURN_LABEL. */ | |
6714 | ||
6715 | /* If you have any cleanups to do at this point, | |
6716 | and they need to create temporary variables, | |
6717 | then you will lose. */ | |
e15679f8 | 6718 | expand_fixups (get_insns ()); |
6f086dfc | 6719 | } |
bdac5f58 | 6720 | \f |
0a1c58a2 JL |
6721 | /* Extend a vector that records the INSN_UIDs of INSNS (either a |
6722 | sequence or a single insn). */ | |
bdac5f58 | 6723 | |
0a1c58a2 JL |
6724 | static void |
6725 | record_insns (insns, vecp) | |
bdac5f58 | 6726 | rtx insns; |
0a1c58a2 | 6727 | varray_type *vecp; |
bdac5f58 | 6728 | { |
bdac5f58 TW |
6729 | if (GET_CODE (insns) == SEQUENCE) |
6730 | { | |
6731 | int len = XVECLEN (insns, 0); | |
0a1c58a2 JL |
6732 | int i = VARRAY_SIZE (*vecp); |
6733 | ||
6734 | VARRAY_GROW (*vecp, i + len); | |
bdac5f58 | 6735 | while (--len >= 0) |
0a1c58a2 JL |
6736 | { |
6737 | VARRAY_INT (*vecp, i) = INSN_UID (XVECEXP (insns, 0, len)); | |
6738 | ++i; | |
6739 | } | |
bdac5f58 TW |
6740 | } |
6741 | else | |
6742 | { | |
0a1c58a2 JL |
6743 | int i = VARRAY_SIZE (*vecp); |
6744 | VARRAY_GROW (*vecp, i + 1); | |
6745 | VARRAY_INT (*vecp, i) = INSN_UID (insns); | |
bdac5f58 | 6746 | } |
bdac5f58 TW |
6747 | } |
6748 | ||
10914065 | 6749 | /* Determine how many INSN_UIDs in VEC are part of INSN. */ |
bdac5f58 | 6750 | |
10914065 | 6751 | static int |
bdac5f58 TW |
6752 | contains (insn, vec) |
6753 | rtx insn; | |
0a1c58a2 | 6754 | varray_type vec; |
bdac5f58 TW |
6755 | { |
6756 | register int i, j; | |
6757 | ||
6758 | if (GET_CODE (insn) == INSN | |
6759 | && GET_CODE (PATTERN (insn)) == SEQUENCE) | |
6760 | { | |
10914065 | 6761 | int count = 0; |
bdac5f58 | 6762 | for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--) |
0a1c58a2 JL |
6763 | for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j) |
6764 | if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j)) | |
10914065 TW |
6765 | count++; |
6766 | return count; | |
bdac5f58 TW |
6767 | } |
6768 | else | |
6769 | { | |
0a1c58a2 JL |
6770 | for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j) |
6771 | if (INSN_UID (insn) == VARRAY_INT (vec, j)) | |
10914065 | 6772 | return 1; |
bdac5f58 TW |
6773 | } |
6774 | return 0; | |
6775 | } | |
5c7675e9 RH |
6776 | |
6777 | int | |
6778 | prologue_epilogue_contains (insn) | |
6779 | rtx insn; | |
6780 | { | |
0a1c58a2 | 6781 | if (contains (insn, prologue)) |
5c7675e9 | 6782 | return 1; |
0a1c58a2 | 6783 | if (contains (insn, epilogue)) |
5c7675e9 RH |
6784 | return 1; |
6785 | return 0; | |
6786 | } | |
bdac5f58 | 6787 | |
0a1c58a2 JL |
6788 | int |
6789 | sibcall_epilogue_contains (insn) | |
718fe406 | 6790 | rtx insn; |
0a1c58a2 JL |
6791 | { |
6792 | if (sibcall_epilogue) | |
6793 | return contains (insn, sibcall_epilogue); | |
6794 | return 0; | |
6795 | } | |
6796 | ||
73ef99fb | 6797 | #ifdef HAVE_return |
69732dcb RH |
6798 | /* Insert gen_return at the end of block BB. This also means updating |
6799 | block_for_insn appropriately. */ | |
6800 | ||
6801 | static void | |
86c82654 | 6802 | emit_return_into_block (bb, line_note) |
69732dcb | 6803 | basic_block bb; |
86c82654 | 6804 | rtx line_note; |
69732dcb RH |
6805 | { |
6806 | rtx p, end; | |
6807 | ||
718fe406 | 6808 | p = NEXT_INSN (bb->end); |
86c82654 RH |
6809 | end = emit_jump_insn_after (gen_return (), bb->end); |
6810 | if (line_note) | |
6811 | emit_line_note_after (NOTE_SOURCE_FILE (line_note), | |
6812 | NOTE_LINE_NUMBER (line_note), bb->end); | |
6813 | ||
69732dcb RH |
6814 | while (1) |
6815 | { | |
6816 | set_block_for_insn (p, bb); | |
86c82654 | 6817 | if (p == bb->end) |
69732dcb | 6818 | break; |
86c82654 | 6819 | p = PREV_INSN (p); |
69732dcb RH |
6820 | } |
6821 | bb->end = end; | |
6822 | } | |
73ef99fb | 6823 | #endif /* HAVE_return */ |
69732dcb | 6824 | |
7393c642 RK |
6825 | #ifdef HAVE_epilogue |
6826 | ||
6827 | /* Modify SEQ, a SEQUENCE that is part of the epilogue, to no modifications | |
6828 | to the stack pointer. */ | |
6829 | ||
6830 | static void | |
6831 | keep_stack_depressed (seq) | |
6832 | rtx seq; | |
6833 | { | |
6834 | int i; | |
6835 | rtx sp_from_reg = 0; | |
6836 | int sp_modified_unknown = 0; | |
6837 | ||
6838 | /* If the epilogue is just a single instruction, it's OK as is */ | |
6839 | ||
6840 | if (GET_CODE (seq) != SEQUENCE) return; | |
6841 | ||
6842 | /* Scan all insns in SEQ looking for ones that modified the stack | |
6843 | pointer. Record if it modified the stack pointer by copying it | |
6844 | from the frame pointer or if it modified it in some other way. | |
6845 | Then modify any subsequent stack pointer references to take that | |
6846 | into account. We start by only allowing SP to be copied from a | |
6847 | register (presumably FP) and then be subsequently referenced. */ | |
6848 | ||
6849 | for (i = 0; i < XVECLEN (seq, 0); i++) | |
6850 | { | |
6851 | rtx insn = XVECEXP (seq, 0, i); | |
6852 | ||
6853 | if (GET_RTX_CLASS (GET_CODE (insn)) != 'i') | |
6854 | continue; | |
6855 | ||
6856 | if (reg_set_p (stack_pointer_rtx, insn)) | |
6857 | { | |
6858 | rtx set = single_set (insn); | |
6859 | ||
6860 | /* If SP is set as a side-effect, we can't support this. */ | |
6861 | if (set == 0) | |
6862 | abort (); | |
6863 | ||
6864 | if (GET_CODE (SET_SRC (set)) == REG) | |
6865 | sp_from_reg = SET_SRC (set); | |
6866 | else | |
6867 | sp_modified_unknown = 1; | |
6868 | ||
6869 | /* Don't allow the SP modification to happen. */ | |
6870 | PUT_CODE (insn, NOTE); | |
6871 | NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED; | |
6872 | NOTE_SOURCE_FILE (insn) = 0; | |
6873 | } | |
6874 | else if (reg_referenced_p (stack_pointer_rtx, PATTERN (insn))) | |
6875 | { | |
6876 | if (sp_modified_unknown) | |
6877 | abort (); | |
6878 | ||
6879 | else if (sp_from_reg != 0) | |
6880 | PATTERN (insn) | |
6881 | = replace_rtx (PATTERN (insn), stack_pointer_rtx, sp_from_reg); | |
6882 | } | |
6883 | } | |
6884 | } | |
6885 | #endif | |
6886 | ||
9faa82d8 | 6887 | /* Generate the prologue and epilogue RTL if the machine supports it. Thread |
bdac5f58 TW |
6888 | this into place with notes indicating where the prologue ends and where |
6889 | the epilogue begins. Update the basic block information when possible. */ | |
6890 | ||
6891 | void | |
6892 | thread_prologue_and_epilogue_insns (f) | |
54ea1de9 | 6893 | rtx f ATTRIBUTE_UNUSED; |
bdac5f58 | 6894 | { |
ca1117cc | 6895 | int inserted = 0; |
19d3c25c RH |
6896 | edge e; |
6897 | rtx seq; | |
ca1117cc RH |
6898 | #ifdef HAVE_prologue |
6899 | rtx prologue_end = NULL_RTX; | |
6900 | #endif | |
86c82654 RH |
6901 | #if defined (HAVE_epilogue) || defined(HAVE_return) |
6902 | rtx epilogue_end = NULL_RTX; | |
6903 | #endif | |
e881bb1b | 6904 | |
bdac5f58 TW |
6905 | #ifdef HAVE_prologue |
6906 | if (HAVE_prologue) | |
6907 | { | |
e881bb1b | 6908 | start_sequence (); |
718fe406 | 6909 | seq = gen_prologue (); |
e881bb1b | 6910 | emit_insn (seq); |
bdac5f58 TW |
6911 | |
6912 | /* Retain a map of the prologue insns. */ | |
e881bb1b RH |
6913 | if (GET_CODE (seq) != SEQUENCE) |
6914 | seq = get_insns (); | |
0a1c58a2 | 6915 | record_insns (seq, &prologue); |
ca1117cc | 6916 | prologue_end = emit_note (NULL, NOTE_INSN_PROLOGUE_END); |
9185a8d5 | 6917 | |
e881bb1b RH |
6918 | seq = gen_sequence (); |
6919 | end_sequence (); | |
6920 | ||
6921 | /* If optimization is off, and perhaps in an empty function, | |
6922 | the entry block will have no successors. */ | |
6923 | if (ENTRY_BLOCK_PTR->succ) | |
6924 | { | |
6925 | /* Can't deal with multiple successsors of the entry block. */ | |
6926 | if (ENTRY_BLOCK_PTR->succ->succ_next) | |
6927 | abort (); | |
6928 | ||
6929 | insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ); | |
ca1117cc | 6930 | inserted = 1; |
e881bb1b RH |
6931 | } |
6932 | else | |
6933 | emit_insn_after (seq, f); | |
bdac5f58 | 6934 | } |
bdac5f58 | 6935 | #endif |
bdac5f58 | 6936 | |
19d3c25c RH |
6937 | /* If the exit block has no non-fake predecessors, we don't need |
6938 | an epilogue. */ | |
718fe406 | 6939 | for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next) |
19d3c25c RH |
6940 | if ((e->flags & EDGE_FAKE) == 0) |
6941 | break; | |
6942 | if (e == NULL) | |
6943 | goto epilogue_done; | |
6944 | ||
69732dcb RH |
6945 | #ifdef HAVE_return |
6946 | if (optimize && HAVE_return) | |
6947 | { | |
6948 | /* If we're allowed to generate a simple return instruction, | |
6949 | then by definition we don't need a full epilogue. Examine | |
718fe406 KH |
6950 | the block that falls through to EXIT. If it does not |
6951 | contain any code, examine its predecessors and try to | |
69732dcb RH |
6952 | emit (conditional) return instructions. */ |
6953 | ||
6954 | basic_block last; | |
6955 | edge e_next; | |
6956 | rtx label; | |
6957 | ||
718fe406 | 6958 | for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next) |
69732dcb RH |
6959 | if (e->flags & EDGE_FALLTHRU) |
6960 | break; | |
6961 | if (e == NULL) | |
6962 | goto epilogue_done; | |
6963 | last = e->src; | |
6964 | ||
6965 | /* Verify that there are no active instructions in the last block. */ | |
6966 | label = last->end; | |
6967 | while (label && GET_CODE (label) != CODE_LABEL) | |
6968 | { | |
6969 | if (active_insn_p (label)) | |
6970 | break; | |
6971 | label = PREV_INSN (label); | |
6972 | } | |
6973 | ||
6974 | if (last->head == label && GET_CODE (label) == CODE_LABEL) | |
6975 | { | |
718fe406 | 6976 | rtx epilogue_line_note = NULL_RTX; |
86c82654 RH |
6977 | |
6978 | /* Locate the line number associated with the closing brace, | |
6979 | if we can find one. */ | |
6980 | for (seq = get_last_insn (); | |
6981 | seq && ! active_insn_p (seq); | |
6982 | seq = PREV_INSN (seq)) | |
6983 | if (GET_CODE (seq) == NOTE && NOTE_LINE_NUMBER (seq) > 0) | |
6984 | { | |
6985 | epilogue_line_note = seq; | |
6986 | break; | |
6987 | } | |
6988 | ||
718fe406 | 6989 | for (e = last->pred; e; e = e_next) |
69732dcb RH |
6990 | { |
6991 | basic_block bb = e->src; | |
6992 | rtx jump; | |
6993 | ||
6994 | e_next = e->pred_next; | |
6995 | if (bb == ENTRY_BLOCK_PTR) | |
6996 | continue; | |
6997 | ||
6998 | jump = bb->end; | |
a617c13f | 6999 | if ((GET_CODE (jump) != JUMP_INSN) || JUMP_LABEL (jump) != label) |
69732dcb RH |
7000 | continue; |
7001 | ||
7002 | /* If we have an unconditional jump, we can replace that | |
7003 | with a simple return instruction. */ | |
7004 | if (simplejump_p (jump)) | |
7005 | { | |
86c82654 | 7006 | emit_return_into_block (bb, epilogue_line_note); |
69732dcb RH |
7007 | flow_delete_insn (jump); |
7008 | } | |
7009 | ||
7010 | /* If we have a conditional jump, we can try to replace | |
7011 | that with a conditional return instruction. */ | |
7012 | else if (condjump_p (jump)) | |
7013 | { | |
7014 | rtx ret, *loc; | |
7015 | ||
7016 | ret = SET_SRC (PATTERN (jump)); | |
7017 | if (GET_CODE (XEXP (ret, 1)) == LABEL_REF) | |
7018 | loc = &XEXP (ret, 1); | |
7019 | else | |
7020 | loc = &XEXP (ret, 2); | |
7021 | ret = gen_rtx_RETURN (VOIDmode); | |
7022 | ||
7023 | if (! validate_change (jump, loc, ret, 0)) | |
7024 | continue; | |
7025 | if (JUMP_LABEL (jump)) | |
7026 | LABEL_NUSES (JUMP_LABEL (jump))--; | |
718fe406 | 7027 | |
3a75e42e CP |
7028 | /* If this block has only one successor, it both jumps |
7029 | and falls through to the fallthru block, so we can't | |
7030 | delete the edge. */ | |
718fe406 KH |
7031 | if (bb->succ->succ_next == NULL) |
7032 | continue; | |
69732dcb RH |
7033 | } |
7034 | else | |
7035 | continue; | |
7036 | ||
7037 | /* Fix up the CFG for the successful change we just made. */ | |
86c82654 | 7038 | redirect_edge_succ (e, EXIT_BLOCK_PTR); |
69732dcb | 7039 | } |
69732dcb | 7040 | |
2dd8bc01 GK |
7041 | /* Emit a return insn for the exit fallthru block. Whether |
7042 | this is still reachable will be determined later. */ | |
69732dcb | 7043 | |
2dd8bc01 | 7044 | emit_barrier_after (last->end); |
86c82654 RH |
7045 | emit_return_into_block (last, epilogue_line_note); |
7046 | epilogue_end = last->end; | |
718fe406 | 7047 | goto epilogue_done; |
2dd8bc01 | 7048 | } |
69732dcb RH |
7049 | } |
7050 | #endif | |
bdac5f58 TW |
7051 | #ifdef HAVE_epilogue |
7052 | if (HAVE_epilogue) | |
7053 | { | |
19d3c25c RH |
7054 | /* Find the edge that falls through to EXIT. Other edges may exist |
7055 | due to RETURN instructions, but those don't need epilogues. | |
7056 | There really shouldn't be a mixture -- either all should have | |
7057 | been converted or none, however... */ | |
e881bb1b | 7058 | |
718fe406 | 7059 | for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next) |
19d3c25c RH |
7060 | if (e->flags & EDGE_FALLTHRU) |
7061 | break; | |
7062 | if (e == NULL) | |
7063 | goto epilogue_done; | |
a78bdb38 | 7064 | |
19d3c25c | 7065 | start_sequence (); |
86c82654 | 7066 | epilogue_end = emit_note (NULL, NOTE_INSN_EPILOGUE_BEG); |
a78bdb38 | 7067 | |
19d3c25c | 7068 | seq = gen_epilogue (); |
7393c642 RK |
7069 | |
7070 | /* If this function returns with the stack depressed, massage | |
7071 | the epilogue to actually do that. */ | |
43db0363 RK |
7072 | if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE |
7073 | && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl))) | |
7393c642 RK |
7074 | keep_stack_depressed (seq); |
7075 | ||
19d3c25c | 7076 | emit_jump_insn (seq); |
bdac5f58 | 7077 | |
19d3c25c RH |
7078 | /* Retain a map of the epilogue insns. */ |
7079 | if (GET_CODE (seq) != SEQUENCE) | |
7080 | seq = get_insns (); | |
0a1c58a2 | 7081 | record_insns (seq, &epilogue); |
bdac5f58 | 7082 | |
19d3c25c | 7083 | seq = gen_sequence (); |
718fe406 | 7084 | end_sequence (); |
e881bb1b | 7085 | |
19d3c25c | 7086 | insert_insn_on_edge (seq, e); |
ca1117cc | 7087 | inserted = 1; |
bdac5f58 TW |
7088 | } |
7089 | #endif | |
19d3c25c | 7090 | epilogue_done: |
e881bb1b | 7091 | |
ca1117cc | 7092 | if (inserted) |
e881bb1b | 7093 | commit_edge_insertions (); |
0a1c58a2 JL |
7094 | |
7095 | #ifdef HAVE_sibcall_epilogue | |
7096 | /* Emit sibling epilogues before any sibling call sites. */ | |
718fe406 | 7097 | for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next) |
0a1c58a2 JL |
7098 | { |
7099 | basic_block bb = e->src; | |
7100 | rtx insn = bb->end; | |
7101 | rtx i; | |
1b513b77 | 7102 | rtx newinsn; |
0a1c58a2 JL |
7103 | |
7104 | if (GET_CODE (insn) != CALL_INSN | |
7105 | || ! SIBLING_CALL_P (insn)) | |
7106 | continue; | |
7107 | ||
7108 | start_sequence (); | |
7109 | seq = gen_sibcall_epilogue (); | |
7110 | end_sequence (); | |
7111 | ||
7112 | i = PREV_INSN (insn); | |
1b513b77 | 7113 | newinsn = emit_insn_before (seq, insn); |
0a1c58a2 JL |
7114 | |
7115 | /* Update the UID to basic block map. */ | |
7116 | for (i = NEXT_INSN (i); i != insn; i = NEXT_INSN (i)) | |
7117 | set_block_for_insn (i, bb); | |
7118 | ||
7119 | /* Retain a map of the epilogue insns. Used in life analysis to | |
7120 | avoid getting rid of sibcall epilogue insns. */ | |
1b513b77 JH |
7121 | record_insns (GET_CODE (seq) == SEQUENCE |
7122 | ? seq : newinsn, &sibcall_epilogue); | |
0a1c58a2 JL |
7123 | } |
7124 | #endif | |
ca1117cc RH |
7125 | |
7126 | #ifdef HAVE_prologue | |
7127 | if (prologue_end) | |
7128 | { | |
7129 | rtx insn, prev; | |
7130 | ||
7131 | /* GDB handles `break f' by setting a breakpoint on the first | |
30196c1f | 7132 | line note after the prologue. Which means (1) that if |
ca1117cc | 7133 | there are line number notes before where we inserted the |
30196c1f RH |
7134 | prologue we should move them, and (2) we should generate a |
7135 | note before the end of the first basic block, if there isn't | |
7136 | one already there. */ | |
ca1117cc | 7137 | |
718fe406 | 7138 | for (insn = prologue_end; insn; insn = prev) |
ca1117cc RH |
7139 | { |
7140 | prev = PREV_INSN (insn); | |
7141 | if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0) | |
7142 | { | |
7143 | /* Note that we cannot reorder the first insn in the | |
7144 | chain, since rest_of_compilation relies on that | |
30196c1f | 7145 | remaining constant. */ |
ca1117cc | 7146 | if (prev == NULL) |
30196c1f RH |
7147 | break; |
7148 | reorder_insns (insn, insn, prologue_end); | |
ca1117cc RH |
7149 | } |
7150 | } | |
7151 | ||
30196c1f RH |
7152 | /* Find the last line number note in the first block. */ |
7153 | for (insn = BASIC_BLOCK (0)->end; | |
7154 | insn != prologue_end; | |
7155 | insn = PREV_INSN (insn)) | |
7156 | if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0) | |
7157 | break; | |
7158 | ||
7159 | /* If we didn't find one, make a copy of the first line number | |
7160 | we run across. */ | |
7161 | if (! insn) | |
ca1117cc | 7162 | { |
30196c1f RH |
7163 | for (insn = next_active_insn (prologue_end); |
7164 | insn; | |
7165 | insn = PREV_INSN (insn)) | |
7166 | if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0) | |
7167 | { | |
7168 | emit_line_note_after (NOTE_SOURCE_FILE (insn), | |
7169 | NOTE_LINE_NUMBER (insn), | |
7170 | prologue_end); | |
7171 | break; | |
7172 | } | |
ca1117cc RH |
7173 | } |
7174 | } | |
7175 | #endif | |
86c82654 RH |
7176 | #ifdef HAVE_epilogue |
7177 | if (epilogue_end) | |
7178 | { | |
7179 | rtx insn, next; | |
7180 | ||
7181 | /* Similarly, move any line notes that appear after the epilogue. | |
7182 | There is no need, however, to be quite so anal about the existance | |
7183 | of such a note. */ | |
718fe406 | 7184 | for (insn = epilogue_end; insn; insn = next) |
86c82654 RH |
7185 | { |
7186 | next = NEXT_INSN (insn); | |
7187 | if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0) | |
7188 | reorder_insns (insn, insn, PREV_INSN (epilogue_end)); | |
7189 | } | |
7190 | } | |
7191 | #endif | |
bdac5f58 TW |
7192 | } |
7193 | ||
7194 | /* Reposition the prologue-end and epilogue-begin notes after instruction | |
7195 | scheduling and delayed branch scheduling. */ | |
7196 | ||
7197 | void | |
7198 | reposition_prologue_and_epilogue_notes (f) | |
79c9824e | 7199 | rtx f ATTRIBUTE_UNUSED; |
bdac5f58 TW |
7200 | { |
7201 | #if defined (HAVE_prologue) || defined (HAVE_epilogue) | |
0a1c58a2 JL |
7202 | int len; |
7203 | ||
7204 | if ((len = VARRAY_SIZE (prologue)) > 0) | |
bdac5f58 | 7205 | { |
0a1c58a2 | 7206 | register rtx insn, note = 0; |
bdac5f58 | 7207 | |
0a1c58a2 JL |
7208 | /* Scan from the beginning until we reach the last prologue insn. |
7209 | We apparently can't depend on basic_block_{head,end} after | |
7210 | reorg has run. */ | |
7211 | for (insn = f; len && insn; insn = NEXT_INSN (insn)) | |
bdac5f58 | 7212 | { |
0a1c58a2 | 7213 | if (GET_CODE (insn) == NOTE) |
9392c110 | 7214 | { |
0a1c58a2 JL |
7215 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END) |
7216 | note = insn; | |
7217 | } | |
7218 | else if ((len -= contains (insn, prologue)) == 0) | |
7219 | { | |
7220 | rtx next; | |
7221 | /* Find the prologue-end note if we haven't already, and | |
7222 | move it to just after the last prologue insn. */ | |
7223 | if (note == 0) | |
9392c110 | 7224 | { |
0a1c58a2 JL |
7225 | for (note = insn; (note = NEXT_INSN (note));) |
7226 | if (GET_CODE (note) == NOTE | |
7227 | && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END) | |
7228 | break; | |
9392c110 | 7229 | } |
c93b03c2 | 7230 | |
0a1c58a2 | 7231 | next = NEXT_INSN (note); |
c93b03c2 | 7232 | |
718fe406 | 7233 | /* Whether or not we can depend on BLOCK_HEAD, |
0a1c58a2 JL |
7234 | attempt to keep it up-to-date. */ |
7235 | if (BLOCK_HEAD (0) == note) | |
7236 | BLOCK_HEAD (0) = next; | |
c93b03c2 | 7237 | |
0a1c58a2 JL |
7238 | remove_insn (note); |
7239 | add_insn_after (note, insn); | |
9392c110 | 7240 | } |
bdac5f58 | 7241 | } |
0a1c58a2 JL |
7242 | } |
7243 | ||
7244 | if ((len = VARRAY_SIZE (epilogue)) > 0) | |
7245 | { | |
7246 | register rtx insn, note = 0; | |
bdac5f58 | 7247 | |
0a1c58a2 JL |
7248 | /* Scan from the end until we reach the first epilogue insn. |
7249 | We apparently can't depend on basic_block_{head,end} after | |
7250 | reorg has run. */ | |
7251 | for (insn = get_last_insn (); len && insn; insn = PREV_INSN (insn)) | |
bdac5f58 | 7252 | { |
0a1c58a2 | 7253 | if (GET_CODE (insn) == NOTE) |
9392c110 | 7254 | { |
0a1c58a2 JL |
7255 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG) |
7256 | note = insn; | |
7257 | } | |
7258 | else if ((len -= contains (insn, epilogue)) == 0) | |
7259 | { | |
7260 | /* Find the epilogue-begin note if we haven't already, and | |
7261 | move it to just before the first epilogue insn. */ | |
7262 | if (note == 0) | |
9392c110 | 7263 | { |
0a1c58a2 JL |
7264 | for (note = insn; (note = PREV_INSN (note));) |
7265 | if (GET_CODE (note) == NOTE | |
7266 | && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG) | |
7267 | break; | |
9392c110 | 7268 | } |
c93b03c2 | 7269 | |
718fe406 | 7270 | /* Whether or not we can depend on BLOCK_HEAD, |
0a1c58a2 JL |
7271 | attempt to keep it up-to-date. */ |
7272 | if (n_basic_blocks | |
7273 | && BLOCK_HEAD (n_basic_blocks-1) == insn) | |
7274 | BLOCK_HEAD (n_basic_blocks-1) = note; | |
c93b03c2 | 7275 | |
0a1c58a2 JL |
7276 | remove_insn (note); |
7277 | add_insn_before (note, insn); | |
9392c110 | 7278 | } |
bdac5f58 TW |
7279 | } |
7280 | } | |
7281 | #endif /* HAVE_prologue or HAVE_epilogue */ | |
7282 | } | |
87ff9c8e RH |
7283 | |
7284 | /* Mark T for GC. */ | |
7285 | ||
7286 | static void | |
7287 | mark_temp_slot (t) | |
718fe406 | 7288 | struct temp_slot *t; |
87ff9c8e RH |
7289 | { |
7290 | while (t) | |
7291 | { | |
7292 | ggc_mark_rtx (t->slot); | |
7293 | ggc_mark_rtx (t->address); | |
591ccf92 MM |
7294 | ggc_mark_tree (t->rtl_expr); |
7295 | ||
87ff9c8e RH |
7296 | t = t->next; |
7297 | } | |
7298 | } | |
7299 | ||
7300 | /* Mark P for GC. */ | |
7301 | ||
7302 | static void | |
fa51b01b | 7303 | mark_function_status (p) |
87ff9c8e RH |
7304 | struct function *p; |
7305 | { | |
7306 | int i; | |
7307 | rtx *r; | |
7308 | ||
7309 | if (p == 0) | |
7310 | return; | |
7311 | ||
7312 | ggc_mark_rtx (p->arg_offset_rtx); | |
7313 | ||
21cd906e MM |
7314 | if (p->x_parm_reg_stack_loc) |
7315 | for (i = p->x_max_parm_reg, r = p->x_parm_reg_stack_loc; | |
7316 | i > 0; --i, ++r) | |
7317 | ggc_mark_rtx (*r); | |
87ff9c8e RH |
7318 | |
7319 | ggc_mark_rtx (p->return_rtx); | |
7320 | ggc_mark_rtx (p->x_cleanup_label); | |
7321 | ggc_mark_rtx (p->x_return_label); | |
7322 | ggc_mark_rtx (p->x_save_expr_regs); | |
7323 | ggc_mark_rtx (p->x_stack_slot_list); | |
7324 | ggc_mark_rtx (p->x_parm_birth_insn); | |
7325 | ggc_mark_rtx (p->x_tail_recursion_label); | |
7326 | ggc_mark_rtx (p->x_tail_recursion_reentry); | |
7327 | ggc_mark_rtx (p->internal_arg_pointer); | |
7328 | ggc_mark_rtx (p->x_arg_pointer_save_area); | |
7329 | ggc_mark_tree (p->x_rtl_expr_chain); | |
7330 | ggc_mark_rtx (p->x_last_parm_insn); | |
7331 | ggc_mark_tree (p->x_context_display); | |
7332 | ggc_mark_tree (p->x_trampoline_list); | |
7333 | ggc_mark_rtx (p->epilogue_delay_list); | |
7334 | ||
7335 | mark_temp_slot (p->x_temp_slots); | |
7336 | ||
7337 | { | |
7338 | struct var_refs_queue *q = p->fixup_var_refs_queue; | |
7339 | while (q) | |
7340 | { | |
7341 | ggc_mark_rtx (q->modified); | |
7342 | q = q->next; | |
7343 | } | |
7344 | } | |
7345 | ||
7346 | ggc_mark_rtx (p->x_nonlocal_goto_handler_slots); | |
afe3d090 | 7347 | ggc_mark_rtx (p->x_nonlocal_goto_handler_labels); |
87ff9c8e RH |
7348 | ggc_mark_rtx (p->x_nonlocal_goto_stack_level); |
7349 | ggc_mark_tree (p->x_nonlocal_labels); | |
7350 | } | |
7351 | ||
7352 | /* Mark the function chain ARG (which is really a struct function **) | |
7353 | for GC. */ | |
7354 | ||
7355 | static void | |
7356 | mark_function_chain (arg) | |
7357 | void *arg; | |
7358 | { | |
7359 | struct function *f = *(struct function **) arg; | |
7360 | ||
7361 | for (; f; f = f->next_global) | |
7362 | { | |
87ff9c8e RH |
7363 | ggc_mark_tree (f->decl); |
7364 | ||
fa51b01b RH |
7365 | mark_function_status (f); |
7366 | mark_eh_status (f->eh); | |
7367 | mark_stmt_status (f->stmt); | |
7368 | mark_expr_status (f->expr); | |
7369 | mark_emit_status (f->emit); | |
7370 | mark_varasm_status (f->varasm); | |
87ff9c8e RH |
7371 | |
7372 | if (mark_machine_status) | |
7373 | (*mark_machine_status) (f); | |
7374 | if (mark_lang_status) | |
7375 | (*mark_lang_status) (f); | |
7376 | ||
7377 | if (f->original_arg_vector) | |
7378 | ggc_mark_rtvec ((rtvec) f->original_arg_vector); | |
7379 | if (f->original_decl_initial) | |
7380 | ggc_mark_tree (f->original_decl_initial); | |
7381 | } | |
7382 | } | |
7383 | ||
7384 | /* Called once, at initialization, to initialize function.c. */ | |
7385 | ||
7386 | void | |
7387 | init_function_once () | |
7388 | { | |
7389 | ggc_add_root (&all_functions, 1, sizeof all_functions, | |
7390 | mark_function_chain); | |
0a1c58a2 JL |
7391 | |
7392 | VARRAY_INT_INIT (prologue, 0, "prologue"); | |
7393 | VARRAY_INT_INIT (epilogue, 0, "epilogue"); | |
7394 | VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue"); | |
87ff9c8e | 7395 | } |