1 /* Expands front end tree to back end RTL for GNU C-Compiler
2 Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of GNU CC.
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)
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.
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
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
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.
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.
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.
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. */
50 #include "hard-reg-set.h"
51 #include "insn-config.h"
54 #include "basic-block.h"
60 #include "integrate.h"
62 #ifndef TRAMPOLINE_ALIGNMENT
63 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
66 #ifndef LOCAL_ALIGNMENT
67 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
70 /* Some systems use __main in a way incompatible with its use in gcc, in these
71 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
72 give the same symbol without quotes for an alternative entry point. You
73 must define both, or neither. */
75 #define NAME__MAIN "__main"
76 #define SYMBOL__MAIN __main
79 /* Round a value to the lowest integer less than it that is a multiple of
80 the required alignment. Avoid using division in case the value is
81 negative. Assume the alignment is a power of two. */
82 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
84 /* Similar, but round to the next highest integer that meets the
86 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
88 /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
89 during rtl generation. If they are different register numbers, this is
90 always true. It may also be true if
91 FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
92 generation. See fix_lexical_addr for details. */
94 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
95 #define NEED_SEPARATE_AP
98 /* Nonzero if function being compiled doesn't contain any calls
99 (ignoring the prologue and epilogue). This is set prior to
100 local register allocation and is valid for the remaining
102 int current_function_is_leaf;
104 /* Nonzero if function being compiled doesn't contain any instructions
105 that can throw an exception. This is set prior to final. */
107 int current_function_nothrow;
109 /* Nonzero if function being compiled doesn't modify the stack pointer
110 (ignoring the prologue and epilogue). This is only valid after
111 life_analysis has run. */
112 int current_function_sp_is_unchanging;
114 /* Nonzero if the function being compiled is a leaf function which only
115 uses leaf registers. This is valid after reload (specifically after
116 sched2) and is useful only if the port defines LEAF_REGISTERS. */
117 int current_function_uses_only_leaf_regs;
119 /* Nonzero once virtual register instantiation has been done.
120 assign_stack_local uses frame_pointer_rtx when this is nonzero.
121 calls.c:emit_library_call_value_1 uses it to set up
122 post-instantiation libcalls. */
123 int virtuals_instantiated;
125 /* These variables hold pointers to functions to create and destroy
126 target specific, per-function data structures. */
127 void (*init_machine_status) PARAMS ((struct function *));
128 void (*free_machine_status) PARAMS ((struct function *));
129 /* This variable holds a pointer to a function to register any
130 data items in the target specific, per-function data structure
131 that will need garbage collection. */
132 void (*mark_machine_status) PARAMS ((struct function *));
134 /* Likewise, but for language-specific data. */
135 void (*init_lang_status) PARAMS ((struct function *));
136 void (*save_lang_status) PARAMS ((struct function *));
137 void (*restore_lang_status) PARAMS ((struct function *));
138 void (*mark_lang_status) PARAMS ((struct function *));
139 void (*free_lang_status) PARAMS ((struct function *));
141 /* The FUNCTION_DECL for an inline function currently being expanded. */
142 tree inline_function_decl;
144 /* The currently compiled function. */
145 struct function *cfun = 0;
147 /* Global list of all compiled functions. */
148 struct function *all_functions = 0;
150 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
151 static varray_type prologue;
152 static varray_type epilogue;
154 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
156 static varray_type sibcall_epilogue;
158 /* In order to evaluate some expressions, such as function calls returning
159 structures in memory, we need to temporarily allocate stack locations.
160 We record each allocated temporary in the following structure.
162 Associated with each temporary slot is a nesting level. When we pop up
163 one level, all temporaries associated with the previous level are freed.
164 Normally, all temporaries are freed after the execution of the statement
165 in which they were created. However, if we are inside a ({...}) grouping,
166 the result may be in a temporary and hence must be preserved. If the
167 result could be in a temporary, we preserve it if we can determine which
168 one it is in. If we cannot determine which temporary may contain the
169 result, all temporaries are preserved. A temporary is preserved by
170 pretending it was allocated at the previous nesting level.
172 Automatic variables are also assigned temporary slots, at the nesting
173 level where they are defined. They are marked a "kept" so that
174 free_temp_slots will not free them. */
178 /* Points to next temporary slot. */
179 struct temp_slot *next;
180 /* The rtx to used to reference the slot. */
182 /* The rtx used to represent the address if not the address of the
183 slot above. May be an EXPR_LIST if multiple addresses exist. */
185 /* The alignment (in bits) of the slot. */
187 /* The size, in units, of the slot. */
189 /* The type of the object in the slot, or zero if it doesn't correspond
190 to a type. We use this to determine whether a slot can be reused.
191 It can be reused if objects of the type of the new slot will always
192 conflict with objects of the type of the old slot. */
194 /* The value of `sequence_rtl_expr' when this temporary is allocated. */
196 /* Non-zero if this temporary is currently in use. */
198 /* Non-zero if this temporary has its address taken. */
200 /* Nesting level at which this slot is being used. */
202 /* Non-zero if this should survive a call to free_temp_slots. */
204 /* The offset of the slot from the frame_pointer, including extra space
205 for alignment. This info is for combine_temp_slots. */
206 HOST_WIDE_INT base_offset;
207 /* The size of the slot, including extra space for alignment. This
208 info is for combine_temp_slots. */
209 HOST_WIDE_INT full_size;
212 /* This structure is used to record MEMs or pseudos used to replace VAR, any
213 SUBREGs of VAR, and any MEMs containing VAR as an address. We need to
214 maintain this list in case two operands of an insn were required to match;
215 in that case we must ensure we use the same replacement. */
217 struct fixup_replacement
221 struct fixup_replacement *next;
224 struct insns_for_mem_entry {
225 /* The KEY in HE will be a MEM. */
226 struct hash_entry he;
227 /* These are the INSNS which reference the MEM. */
231 /* Forward declarations. */
233 static rtx assign_stack_local_1 PARAMS ((enum machine_mode, HOST_WIDE_INT,
234 int, struct function *));
235 static rtx assign_stack_temp_for_type PARAMS ((enum machine_mode,
236 HOST_WIDE_INT, int, tree));
237 static struct temp_slot *find_temp_slot_from_address PARAMS ((rtx));
238 static void put_reg_into_stack PARAMS ((struct function *, rtx, tree,
239 enum machine_mode, enum machine_mode,
240 int, unsigned int, int,
241 struct hash_table *));
242 static void schedule_fixup_var_refs PARAMS ((struct function *, rtx, tree,
244 struct hash_table *));
245 static void fixup_var_refs PARAMS ((rtx, enum machine_mode, int,
246 struct hash_table *));
247 static struct fixup_replacement
248 *find_fixup_replacement PARAMS ((struct fixup_replacement **, rtx));
249 static void fixup_var_refs_insns PARAMS ((rtx, rtx, enum machine_mode,
251 static void fixup_var_refs_insns_with_hash
252 PARAMS ((struct hash_table *, rtx,
253 enum machine_mode, int));
254 static void fixup_var_refs_insn PARAMS ((rtx, rtx, enum machine_mode,
256 static void fixup_var_refs_1 PARAMS ((rtx, enum machine_mode, rtx *, rtx,
257 struct fixup_replacement **));
258 static rtx fixup_memory_subreg PARAMS ((rtx, rtx, int));
259 static rtx walk_fixup_memory_subreg PARAMS ((rtx, rtx, int));
260 static rtx fixup_stack_1 PARAMS ((rtx, rtx));
261 static void optimize_bit_field PARAMS ((rtx, rtx, rtx *));
262 static void instantiate_decls PARAMS ((tree, int));
263 static void instantiate_decls_1 PARAMS ((tree, int));
264 static void instantiate_decl PARAMS ((rtx, HOST_WIDE_INT, int));
265 static rtx instantiate_new_reg PARAMS ((rtx, HOST_WIDE_INT *));
266 static int instantiate_virtual_regs_1 PARAMS ((rtx *, rtx, int));
267 static void delete_handlers PARAMS ((void));
268 static void pad_to_arg_alignment PARAMS ((struct args_size *, int,
269 struct args_size *));
270 #ifndef ARGS_GROW_DOWNWARD
271 static void pad_below PARAMS ((struct args_size *, enum machine_mode,
274 static rtx round_trampoline_addr PARAMS ((rtx));
275 static rtx adjust_trampoline_addr PARAMS ((rtx));
276 static tree *identify_blocks_1 PARAMS ((rtx, tree *, tree *, tree *));
277 static void reorder_blocks_0 PARAMS ((tree));
278 static void reorder_blocks_1 PARAMS ((rtx, tree, varray_type *));
279 static void reorder_fix_fragments PARAMS ((tree));
280 static tree blocks_nreverse PARAMS ((tree));
281 static int all_blocks PARAMS ((tree, tree *));
282 static tree *get_block_vector PARAMS ((tree, int *));
283 /* We always define `record_insns' even if its not used so that we
284 can always export `prologue_epilogue_contains'. */
285 static void record_insns PARAMS ((rtx, varray_type *)) ATTRIBUTE_UNUSED;
286 static int contains PARAMS ((rtx, varray_type));
288 static void emit_return_into_block PARAMS ((basic_block, rtx));
290 static void put_addressof_into_stack PARAMS ((rtx, struct hash_table *));
291 static bool purge_addressof_1 PARAMS ((rtx *, rtx, int, int,
292 struct hash_table *));
293 static void purge_single_hard_subreg_set PARAMS ((rtx));
295 static void keep_stack_depressed PARAMS ((rtx));
297 static int is_addressof PARAMS ((rtx *, void *));
298 static struct hash_entry *insns_for_mem_newfunc PARAMS ((struct hash_entry *,
301 static unsigned long insns_for_mem_hash PARAMS ((hash_table_key));
302 static bool insns_for_mem_comp PARAMS ((hash_table_key, hash_table_key));
303 static int insns_for_mem_walk PARAMS ((rtx *, void *));
304 static void compute_insns_for_mem PARAMS ((rtx, rtx, struct hash_table *));
305 static void mark_temp_slot PARAMS ((struct temp_slot *));
306 static void mark_function_status PARAMS ((struct function *));
307 static void mark_function_chain PARAMS ((void *));
308 static void prepare_function_start PARAMS ((void));
309 static void do_clobber_return_reg PARAMS ((rtx, void *));
310 static void do_use_return_reg PARAMS ((rtx, void *));
312 /* Pointer to chain of `struct function' for containing functions. */
313 struct function *outer_function_chain;
315 /* Given a function decl for a containing function,
316 return the `struct function' for it. */
319 find_function_data (decl)
324 for (p = outer_function_chain; p; p = p->next)
331 /* Save the current context for compilation of a nested function.
332 This is called from language-specific code. The caller should use
333 the save_lang_status callback to save any language-specific state,
334 since this function knows only about language-independent
338 push_function_context_to (context)
341 struct function *p, *context_data;
345 context_data = (context == current_function_decl
347 : find_function_data (context));
348 context_data->contains_functions = 1;
352 init_dummy_function_start ();
355 p->next = outer_function_chain;
356 outer_function_chain = p;
357 p->fixup_var_refs_queue = 0;
359 if (save_lang_status)
360 (*save_lang_status) (p);
366 push_function_context ()
368 push_function_context_to (current_function_decl);
371 /* Restore the last saved context, at the end of a nested function.
372 This function is called from language-specific code. */
375 pop_function_context_from (context)
376 tree context ATTRIBUTE_UNUSED;
378 struct function *p = outer_function_chain;
379 struct var_refs_queue *queue;
380 struct var_refs_queue *next;
383 outer_function_chain = p->next;
385 current_function_decl = p->decl;
388 restore_emit_status (p);
390 if (restore_lang_status)
391 (*restore_lang_status) (p);
393 /* Finish doing put_var_into_stack for any of our variables
394 which became addressable during the nested function. */
395 for (queue = p->fixup_var_refs_queue; queue; queue = next)
398 fixup_var_refs (queue->modified, queue->promoted_mode,
399 queue->unsignedp, 0);
402 p->fixup_var_refs_queue = 0;
404 /* Reset variables that have known state during rtx generation. */
405 rtx_equal_function_value_matters = 1;
406 virtuals_instantiated = 0;
407 generating_concat_p = 1;
411 pop_function_context ()
413 pop_function_context_from (current_function_decl);
416 /* Clear out all parts of the state in F that can safely be discarded
417 after the function has been parsed, but not compiled, to let
418 garbage collection reclaim the memory. */
421 free_after_parsing (f)
424 /* f->expr->forced_labels is used by code generation. */
425 /* f->emit->regno_reg_rtx is used by code generation. */
426 /* f->varasm is used by code generation. */
427 /* f->eh->eh_return_stub_label is used by code generation. */
429 if (free_lang_status)
430 (*free_lang_status) (f);
431 free_stmt_status (f);
434 /* Clear out all parts of the state in F that can safely be discarded
435 after the function has been compiled, to let garbage collection
436 reclaim the memory. */
439 free_after_compilation (f)
442 struct temp_slot *ts;
443 struct temp_slot *next;
446 free_expr_status (f);
447 free_emit_status (f);
448 free_varasm_status (f);
450 if (free_machine_status)
451 (*free_machine_status) (f);
453 if (f->x_parm_reg_stack_loc)
454 free (f->x_parm_reg_stack_loc);
456 for (ts = f->x_temp_slots; ts; ts = next)
461 f->x_temp_slots = NULL;
463 f->arg_offset_rtx = NULL;
464 f->return_rtx = NULL;
465 f->internal_arg_pointer = NULL;
466 f->x_nonlocal_labels = NULL;
467 f->x_nonlocal_goto_handler_slots = NULL;
468 f->x_nonlocal_goto_handler_labels = NULL;
469 f->x_nonlocal_goto_stack_level = NULL;
470 f->x_cleanup_label = NULL;
471 f->x_return_label = NULL;
472 f->x_save_expr_regs = NULL;
473 f->x_stack_slot_list = NULL;
474 f->x_rtl_expr_chain = NULL;
475 f->x_tail_recursion_label = NULL;
476 f->x_tail_recursion_reentry = NULL;
477 f->x_arg_pointer_save_area = NULL;
478 f->x_clobber_return_insn = NULL;
479 f->x_context_display = NULL;
480 f->x_trampoline_list = NULL;
481 f->x_parm_birth_insn = NULL;
482 f->x_last_parm_insn = NULL;
483 f->x_parm_reg_stack_loc = NULL;
484 f->fixup_var_refs_queue = NULL;
485 f->original_arg_vector = NULL;
486 f->original_decl_initial = NULL;
487 f->inl_last_parm_insn = NULL;
488 f->epilogue_delay_list = NULL;
491 /* Allocate fixed slots in the stack frame of the current function. */
493 /* Return size needed for stack frame based on slots so far allocated in
495 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
496 the caller may have to do that. */
499 get_func_frame_size (f)
502 #ifdef FRAME_GROWS_DOWNWARD
503 return -f->x_frame_offset;
505 return f->x_frame_offset;
509 /* Return size needed for stack frame based on slots so far allocated.
510 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
511 the caller may have to do that. */
515 return get_func_frame_size (cfun);
518 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
519 with machine mode MODE.
521 ALIGN controls the amount of alignment for the address of the slot:
522 0 means according to MODE,
523 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
524 positive specifies alignment boundary in bits.
526 We do not round to stack_boundary here.
528 FUNCTION specifies the function to allocate in. */
531 assign_stack_local_1 (mode, size, align, function)
532 enum machine_mode mode;
535 struct function *function;
537 register rtx x, addr;
538 int bigend_correction = 0;
546 alignment = BIGGEST_ALIGNMENT;
548 alignment = GET_MODE_ALIGNMENT (mode);
550 /* Allow the target to (possibly) increase the alignment of this
552 type = type_for_mode (mode, 0);
554 alignment = LOCAL_ALIGNMENT (type, alignment);
556 alignment /= BITS_PER_UNIT;
558 else if (align == -1)
560 alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
561 size = CEIL_ROUND (size, alignment);
564 alignment = align / BITS_PER_UNIT;
566 #ifdef FRAME_GROWS_DOWNWARD
567 function->x_frame_offset -= size;
570 /* Ignore alignment we can't do with expected alignment of the boundary. */
571 if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY)
572 alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
574 if (function->stack_alignment_needed < alignment * BITS_PER_UNIT)
575 function->stack_alignment_needed = alignment * BITS_PER_UNIT;
577 /* Round frame offset to that alignment.
578 We must be careful here, since FRAME_OFFSET might be negative and
579 division with a negative dividend isn't as well defined as we might
580 like. So we instead assume that ALIGNMENT is a power of two and
581 use logical operations which are unambiguous. */
582 #ifdef FRAME_GROWS_DOWNWARD
583 function->x_frame_offset = FLOOR_ROUND (function->x_frame_offset, alignment);
585 function->x_frame_offset = CEIL_ROUND (function->x_frame_offset, alignment);
588 /* On a big-endian machine, if we are allocating more space than we will use,
589 use the least significant bytes of those that are allocated. */
590 if (BYTES_BIG_ENDIAN && mode != BLKmode)
591 bigend_correction = size - GET_MODE_SIZE (mode);
593 /* If we have already instantiated virtual registers, return the actual
594 address relative to the frame pointer. */
595 if (function == cfun && virtuals_instantiated)
596 addr = plus_constant (frame_pointer_rtx,
597 (frame_offset + bigend_correction
598 + STARTING_FRAME_OFFSET));
600 addr = plus_constant (virtual_stack_vars_rtx,
601 function->x_frame_offset + bigend_correction);
603 #ifndef FRAME_GROWS_DOWNWARD
604 function->x_frame_offset += size;
607 x = gen_rtx_MEM (mode, addr);
609 function->x_stack_slot_list
610 = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list);
615 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
619 assign_stack_local (mode, size, align)
620 enum machine_mode mode;
624 return assign_stack_local_1 (mode, size, align, cfun);
627 /* Allocate a temporary stack slot and record it for possible later
630 MODE is the machine mode to be given to the returned rtx.
632 SIZE is the size in units of the space required. We do no rounding here
633 since assign_stack_local will do any required rounding.
635 KEEP is 1 if this slot is to be retained after a call to
636 free_temp_slots. Automatic variables for a block are allocated
637 with this flag. KEEP is 2 if we allocate a longer term temporary,
638 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
639 if we are to allocate something at an inner level to be treated as
640 a variable in the block (e.g., a SAVE_EXPR).
642 TYPE is the type that will be used for the stack slot. */
645 assign_stack_temp_for_type (mode, size, keep, type)
646 enum machine_mode mode;
652 struct temp_slot *p, *best_p = 0;
654 /* If SIZE is -1 it means that somebody tried to allocate a temporary
655 of a variable size. */
660 align = BIGGEST_ALIGNMENT;
662 align = GET_MODE_ALIGNMENT (mode);
665 type = type_for_mode (mode, 0);
668 align = LOCAL_ALIGNMENT (type, align);
670 /* Try to find an available, already-allocated temporary of the proper
671 mode which meets the size and alignment requirements. Choose the
672 smallest one with the closest alignment. */
673 for (p = temp_slots; p; p = p->next)
674 if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode
676 && objects_must_conflict_p (p->type, type)
677 && (best_p == 0 || best_p->size > p->size
678 || (best_p->size == p->size && best_p->align > p->align)))
680 if (p->align == align && p->size == size)
688 /* Make our best, if any, the one to use. */
691 /* If there are enough aligned bytes left over, make them into a new
692 temp_slot so that the extra bytes don't get wasted. Do this only
693 for BLKmode slots, so that we can be sure of the alignment. */
694 if (GET_MODE (best_p->slot) == BLKmode)
696 int alignment = best_p->align / BITS_PER_UNIT;
697 HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment);
699 if (best_p->size - rounded_size >= alignment)
701 p = (struct temp_slot *) xmalloc (sizeof (struct temp_slot));
702 p->in_use = p->addr_taken = 0;
703 p->size = best_p->size - rounded_size;
704 p->base_offset = best_p->base_offset + rounded_size;
705 p->full_size = best_p->full_size - rounded_size;
706 p->slot = gen_rtx_MEM (BLKmode,
707 plus_constant (XEXP (best_p->slot, 0),
709 p->align = best_p->align;
712 p->type = best_p->type;
713 p->next = temp_slots;
716 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot,
719 best_p->size = rounded_size;
720 best_p->full_size = rounded_size;
727 /* If we still didn't find one, make a new temporary. */
730 HOST_WIDE_INT frame_offset_old = frame_offset;
732 p = (struct temp_slot *) xmalloc (sizeof (struct temp_slot));
734 /* We are passing an explicit alignment request to assign_stack_local.
735 One side effect of that is assign_stack_local will not round SIZE
736 to ensure the frame offset remains suitably aligned.
738 So for requests which depended on the rounding of SIZE, we go ahead
739 and round it now. We also make sure ALIGNMENT is at least
740 BIGGEST_ALIGNMENT. */
741 if (mode == BLKmode && align < BIGGEST_ALIGNMENT)
743 p->slot = assign_stack_local (mode,
745 ? CEIL_ROUND (size, align / BITS_PER_UNIT)
751 /* The following slot size computation is necessary because we don't
752 know the actual size of the temporary slot until assign_stack_local
753 has performed all the frame alignment and size rounding for the
754 requested temporary. Note that extra space added for alignment
755 can be either above or below this stack slot depending on which
756 way the frame grows. We include the extra space if and only if it
757 is above this slot. */
758 #ifdef FRAME_GROWS_DOWNWARD
759 p->size = frame_offset_old - frame_offset;
764 /* Now define the fields used by combine_temp_slots. */
765 #ifdef FRAME_GROWS_DOWNWARD
766 p->base_offset = frame_offset;
767 p->full_size = frame_offset_old - frame_offset;
769 p->base_offset = frame_offset_old;
770 p->full_size = frame_offset - frame_offset_old;
773 p->next = temp_slots;
779 p->rtl_expr = seq_rtl_expr;
784 p->level = target_temp_slot_level;
789 p->level = var_temp_slot_level;
794 p->level = temp_slot_level;
798 /* We may be reusing an old slot, so clear any MEM flags that may have been
800 RTX_UNCHANGING_P (p->slot) = 0;
801 MEM_IN_STRUCT_P (p->slot) = 0;
802 MEM_SCALAR_P (p->slot) = 0;
803 MEM_VOLATILE_P (p->slot) = 0;
805 /* If we know the alias set for the memory that will be used, use
806 it. If there's no TYPE, then we don't know anything about the
807 alias set for the memory. */
808 set_mem_alias_set (p->slot, type ? get_alias_set (type) : 0);
810 /* If a type is specified, set the relevant flags. */
813 RTX_UNCHANGING_P (p->slot) = TYPE_READONLY (type);
814 MEM_VOLATILE_P (p->slot) = TYPE_VOLATILE (type);
815 MEM_SET_IN_STRUCT_P (p->slot, AGGREGATE_TYPE_P (type));
821 /* Allocate a temporary stack slot and record it for possible later
822 reuse. First three arguments are same as in preceding function. */
825 assign_stack_temp (mode, size, keep)
826 enum machine_mode mode;
830 return assign_stack_temp_for_type (mode, size, keep, NULL_TREE);
833 /* Assign a temporary of given TYPE.
834 KEEP is as for assign_stack_temp.
835 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
836 it is 0 if a register is OK.
837 DONT_PROMOTE is 1 if we should not promote values in register
841 assign_temp (type, keep, memory_required, dont_promote)
845 int dont_promote ATTRIBUTE_UNUSED;
847 enum machine_mode mode = TYPE_MODE (type);
848 #ifndef PROMOTE_FOR_CALL_ONLY
849 int unsignedp = TREE_UNSIGNED (type);
852 if (mode == BLKmode || memory_required)
854 HOST_WIDE_INT size = int_size_in_bytes (type);
857 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
858 problems with allocating the stack space. */
862 /* Unfortunately, we don't yet know how to allocate variable-sized
863 temporaries. However, sometimes we have a fixed upper limit on
864 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
865 instead. This is the case for Chill variable-sized strings. */
866 if (size == -1 && TREE_CODE (type) == ARRAY_TYPE
867 && TYPE_ARRAY_MAX_SIZE (type) != NULL_TREE
868 && host_integerp (TYPE_ARRAY_MAX_SIZE (type), 1))
869 size = tree_low_cst (TYPE_ARRAY_MAX_SIZE (type), 1);
871 tmp = assign_stack_temp_for_type (mode, size, keep, type);
875 #ifndef PROMOTE_FOR_CALL_ONLY
877 mode = promote_mode (type, mode, &unsignedp, 0);
880 return gen_reg_rtx (mode);
883 /* Combine temporary stack slots which are adjacent on the stack.
885 This allows for better use of already allocated stack space. This is only
886 done for BLKmode slots because we can be sure that we won't have alignment
887 problems in this case. */
890 combine_temp_slots ()
892 struct temp_slot *p, *q;
893 struct temp_slot *prev_p, *prev_q;
896 /* We can't combine slots, because the information about which slot
897 is in which alias set will be lost. */
898 if (flag_strict_aliasing)
901 /* If there are a lot of temp slots, don't do anything unless
902 high levels of optimizaton. */
903 if (! flag_expensive_optimizations)
904 for (p = temp_slots, num_slots = 0; p; p = p->next, num_slots++)
905 if (num_slots > 100 || (num_slots > 10 && optimize == 0))
908 for (p = temp_slots, prev_p = 0; p; p = prev_p ? prev_p->next : temp_slots)
912 if (! p->in_use && GET_MODE (p->slot) == BLKmode)
913 for (q = p->next, prev_q = p; q; q = prev_q->next)
916 if (! q->in_use && GET_MODE (q->slot) == BLKmode)
918 if (p->base_offset + p->full_size == q->base_offset)
920 /* Q comes after P; combine Q into P. */
922 p->full_size += q->full_size;
925 else if (q->base_offset + q->full_size == p->base_offset)
927 /* P comes after Q; combine P into Q. */
929 q->full_size += p->full_size;
934 /* Either delete Q or advance past it. */
937 prev_q->next = q->next;
943 /* Either delete P or advance past it. */
947 prev_p->next = p->next;
949 temp_slots = p->next;
956 /* Find the temp slot corresponding to the object at address X. */
958 static struct temp_slot *
959 find_temp_slot_from_address (x)
965 for (p = temp_slots; p; p = p->next)
970 else if (XEXP (p->slot, 0) == x
972 || (GET_CODE (x) == PLUS
973 && XEXP (x, 0) == virtual_stack_vars_rtx
974 && GET_CODE (XEXP (x, 1)) == CONST_INT
975 && INTVAL (XEXP (x, 1)) >= p->base_offset
976 && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size))
979 else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST)
980 for (next = p->address; next; next = XEXP (next, 1))
981 if (XEXP (next, 0) == x)
985 /* If we have a sum involving a register, see if it points to a temp
987 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 0)) == REG
988 && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
990 else if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == REG
991 && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
997 /* Indicate that NEW is an alternate way of referring to the temp slot
998 that previously was known by OLD. */
1001 update_temp_slot_address (old, new)
1004 struct temp_slot *p;
1006 if (rtx_equal_p (old, new))
1009 p = find_temp_slot_from_address (old);
1011 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
1012 is a register, see if one operand of the PLUS is a temporary
1013 location. If so, NEW points into it. Otherwise, if both OLD and
1014 NEW are a PLUS and if there is a register in common between them.
1015 If so, try a recursive call on those values. */
1018 if (GET_CODE (old) != PLUS)
1021 if (GET_CODE (new) == REG)
1023 update_temp_slot_address (XEXP (old, 0), new);
1024 update_temp_slot_address (XEXP (old, 1), new);
1027 else if (GET_CODE (new) != PLUS)
1030 if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0)))
1031 update_temp_slot_address (XEXP (old, 1), XEXP (new, 1));
1032 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0)))
1033 update_temp_slot_address (XEXP (old, 0), XEXP (new, 1));
1034 else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1)))
1035 update_temp_slot_address (XEXP (old, 1), XEXP (new, 0));
1036 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1)))
1037 update_temp_slot_address (XEXP (old, 0), XEXP (new, 0));
1042 /* Otherwise add an alias for the temp's address. */
1043 else if (p->address == 0)
1047 if (GET_CODE (p->address) != EXPR_LIST)
1048 p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX);
1050 p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address);
1054 /* If X could be a reference to a temporary slot, mark the fact that its
1055 address was taken. */
1058 mark_temp_addr_taken (x)
1061 struct temp_slot *p;
1066 /* If X is not in memory or is at a constant address, it cannot be in
1067 a temporary slot. */
1068 if (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1071 p = find_temp_slot_from_address (XEXP (x, 0));
1076 /* If X could be a reference to a temporary slot, mark that slot as
1077 belonging to the to one level higher than the current level. If X
1078 matched one of our slots, just mark that one. Otherwise, we can't
1079 easily predict which it is, so upgrade all of them. Kept slots
1080 need not be touched.
1082 This is called when an ({...}) construct occurs and a statement
1083 returns a value in memory. */
1086 preserve_temp_slots (x)
1089 struct temp_slot *p = 0;
1091 /* If there is no result, we still might have some objects whose address
1092 were taken, so we need to make sure they stay around. */
1095 for (p = temp_slots; p; p = p->next)
1096 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1102 /* If X is a register that is being used as a pointer, see if we have
1103 a temporary slot we know it points to. To be consistent with
1104 the code below, we really should preserve all non-kept slots
1105 if we can't find a match, but that seems to be much too costly. */
1106 if (GET_CODE (x) == REG && REG_POINTER (x))
1107 p = find_temp_slot_from_address (x);
1109 /* If X is not in memory or is at a constant address, it cannot be in
1110 a temporary slot, but it can contain something whose address was
1112 if (p == 0 && (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0))))
1114 for (p = temp_slots; p; p = p->next)
1115 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1121 /* First see if we can find a match. */
1123 p = find_temp_slot_from_address (XEXP (x, 0));
1127 /* Move everything at our level whose address was taken to our new
1128 level in case we used its address. */
1129 struct temp_slot *q;
1131 if (p->level == temp_slot_level)
1133 for (q = temp_slots; q; q = q->next)
1134 if (q != p && q->addr_taken && q->level == p->level)
1143 /* Otherwise, preserve all non-kept slots at this level. */
1144 for (p = temp_slots; p; p = p->next)
1145 if (p->in_use && p->level == temp_slot_level && ! p->keep)
1149 /* X is the result of an RTL_EXPR. If it is a temporary slot associated
1150 with that RTL_EXPR, promote it into a temporary slot at the present
1151 level so it will not be freed when we free slots made in the
1155 preserve_rtl_expr_result (x)
1158 struct temp_slot *p;
1160 /* If X is not in memory or is at a constant address, it cannot be in
1161 a temporary slot. */
1162 if (x == 0 || GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1165 /* If we can find a match, move it to our level unless it is already at
1167 p = find_temp_slot_from_address (XEXP (x, 0));
1170 p->level = MIN (p->level, temp_slot_level);
1177 /* Free all temporaries used so far. This is normally called at the end
1178 of generating code for a statement. Don't free any temporaries
1179 currently in use for an RTL_EXPR that hasn't yet been emitted.
1180 We could eventually do better than this since it can be reused while
1181 generating the same RTL_EXPR, but this is complex and probably not
1187 struct temp_slot *p;
1189 for (p = temp_slots; p; p = p->next)
1190 if (p->in_use && p->level == temp_slot_level && ! p->keep
1191 && p->rtl_expr == 0)
1194 combine_temp_slots ();
1197 /* Free all temporary slots used in T, an RTL_EXPR node. */
1200 free_temps_for_rtl_expr (t)
1203 struct temp_slot *p;
1205 for (p = temp_slots; p; p = p->next)
1206 if (p->rtl_expr == t)
1208 /* If this slot is below the current TEMP_SLOT_LEVEL, then it
1209 needs to be preserved. This can happen if a temporary in
1210 the RTL_EXPR was addressed; preserve_temp_slots will move
1211 the temporary into a higher level. */
1212 if (temp_slot_level <= p->level)
1215 p->rtl_expr = NULL_TREE;
1218 combine_temp_slots ();
1221 /* Mark all temporaries ever allocated in this function as not suitable
1222 for reuse until the current level is exited. */
1225 mark_all_temps_used ()
1227 struct temp_slot *p;
1229 for (p = temp_slots; p; p = p->next)
1231 p->in_use = p->keep = 1;
1232 p->level = MIN (p->level, temp_slot_level);
1236 /* Push deeper into the nesting level for stack temporaries. */
1244 /* Likewise, but save the new level as the place to allocate variables
1249 push_temp_slots_for_block ()
1253 var_temp_slot_level = temp_slot_level;
1256 /* Likewise, but save the new level as the place to allocate temporaries
1257 for TARGET_EXPRs. */
1260 push_temp_slots_for_target ()
1264 target_temp_slot_level = temp_slot_level;
1267 /* Set and get the value of target_temp_slot_level. The only
1268 permitted use of these functions is to save and restore this value. */
1271 get_target_temp_slot_level ()
1273 return target_temp_slot_level;
1277 set_target_temp_slot_level (level)
1280 target_temp_slot_level = level;
1284 /* Pop a temporary nesting level. All slots in use in the current level
1290 struct temp_slot *p;
1292 for (p = temp_slots; p; p = p->next)
1293 if (p->in_use && p->level == temp_slot_level && p->rtl_expr == 0)
1296 combine_temp_slots ();
1301 /* Initialize temporary slots. */
1306 /* We have not allocated any temporaries yet. */
1308 temp_slot_level = 0;
1309 var_temp_slot_level = 0;
1310 target_temp_slot_level = 0;
1313 /* Retroactively move an auto variable from a register to a stack slot.
1314 This is done when an address-reference to the variable is seen. */
1317 put_var_into_stack (decl)
1321 enum machine_mode promoted_mode, decl_mode;
1322 struct function *function = 0;
1324 int can_use_addressof;
1325 int volatilep = TREE_CODE (decl) != SAVE_EXPR && TREE_THIS_VOLATILE (decl);
1326 int usedp = (TREE_USED (decl)
1327 || (TREE_CODE (decl) != SAVE_EXPR && DECL_INITIAL (decl) != 0));
1329 context = decl_function_context (decl);
1331 /* Get the current rtl used for this object and its original mode. */
1332 reg = (TREE_CODE (decl) == SAVE_EXPR
1333 ? SAVE_EXPR_RTL (decl)
1334 : DECL_RTL_IF_SET (decl));
1336 /* No need to do anything if decl has no rtx yet
1337 since in that case caller is setting TREE_ADDRESSABLE
1338 and a stack slot will be assigned when the rtl is made. */
1342 /* Get the declared mode for this object. */
1343 decl_mode = (TREE_CODE (decl) == SAVE_EXPR ? TYPE_MODE (TREE_TYPE (decl))
1344 : DECL_MODE (decl));
1345 /* Get the mode it's actually stored in. */
1346 promoted_mode = GET_MODE (reg);
1348 /* If this variable comes from an outer function,
1349 find that function's saved context. */
1350 if (context != current_function_decl && context != inline_function_decl)
1351 for (function = outer_function_chain; function; function = function->next)
1352 if (function->decl == context)
1355 /* If this is a variable-size object with a pseudo to address it,
1356 put that pseudo into the stack, if the var is nonlocal. */
1357 if (TREE_CODE (decl) != SAVE_EXPR && DECL_NONLOCAL (decl)
1358 && GET_CODE (reg) == MEM
1359 && GET_CODE (XEXP (reg, 0)) == REG
1360 && REGNO (XEXP (reg, 0)) > LAST_VIRTUAL_REGISTER)
1362 reg = XEXP (reg, 0);
1363 decl_mode = promoted_mode = GET_MODE (reg);
1369 /* FIXME make it work for promoted modes too */
1370 && decl_mode == promoted_mode
1371 #ifdef NON_SAVING_SETJMP
1372 && ! (NON_SAVING_SETJMP && current_function_calls_setjmp)
1376 /* If we can't use ADDRESSOF, make sure we see through one we already
1378 if (! can_use_addressof && GET_CODE (reg) == MEM
1379 && GET_CODE (XEXP (reg, 0)) == ADDRESSOF)
1380 reg = XEXP (XEXP (reg, 0), 0);
1382 /* Now we should have a value that resides in one or more pseudo regs. */
1384 if (GET_CODE (reg) == REG)
1386 /* If this variable lives in the current function and we don't need
1387 to put things in the stack for the sake of setjmp, try to keep it
1388 in a register until we know we actually need the address. */
1389 if (can_use_addressof)
1390 gen_mem_addressof (reg, decl);
1392 put_reg_into_stack (function, reg, TREE_TYPE (decl), promoted_mode,
1393 decl_mode, volatilep, 0, usedp, 0);
1395 else if (GET_CODE (reg) == CONCAT)
1397 /* A CONCAT contains two pseudos; put them both in the stack.
1398 We do it so they end up consecutive.
1399 We fixup references to the parts only after we fixup references
1400 to the whole CONCAT, lest we do double fixups for the latter
1402 enum machine_mode part_mode = GET_MODE (XEXP (reg, 0));
1403 tree part_type = type_for_mode (part_mode, 0);
1404 rtx lopart = XEXP (reg, 0);
1405 rtx hipart = XEXP (reg, 1);
1406 #ifdef FRAME_GROWS_DOWNWARD
1407 /* Since part 0 should have a lower address, do it second. */
1408 put_reg_into_stack (function, hipart, part_type, part_mode,
1409 part_mode, volatilep, 0, 0, 0);
1410 put_reg_into_stack (function, lopart, part_type, part_mode,
1411 part_mode, volatilep, 0, 0, 0);
1413 put_reg_into_stack (function, lopart, part_type, part_mode,
1414 part_mode, volatilep, 0, 0, 0);
1415 put_reg_into_stack (function, hipart, part_type, part_mode,
1416 part_mode, volatilep, 0, 0, 0);
1419 /* Change the CONCAT into a combined MEM for both parts. */
1420 PUT_CODE (reg, MEM);
1421 set_mem_attributes (reg, decl, 1);
1423 /* The two parts are in memory order already.
1424 Use the lower parts address as ours. */
1425 XEXP (reg, 0) = XEXP (XEXP (reg, 0), 0);
1426 /* Prevent sharing of rtl that might lose. */
1427 if (GET_CODE (XEXP (reg, 0)) == PLUS)
1428 XEXP (reg, 0) = copy_rtx (XEXP (reg, 0));
1431 schedule_fixup_var_refs (function, reg, TREE_TYPE (decl),
1433 schedule_fixup_var_refs (function, lopart, part_type, part_mode, 0);
1434 schedule_fixup_var_refs (function, hipart, part_type, part_mode, 0);
1440 if (current_function_check_memory_usage)
1441 emit_library_call (chkr_set_right_libfunc, LCT_CONST_MAKE_BLOCK, VOIDmode,
1442 3, XEXP (reg, 0), Pmode,
1443 GEN_INT (GET_MODE_SIZE (GET_MODE (reg))),
1444 TYPE_MODE (sizetype),
1445 GEN_INT (MEMORY_USE_RW),
1446 TYPE_MODE (integer_type_node));
1449 /* Subroutine of put_var_into_stack. This puts a single pseudo reg REG
1450 into the stack frame of FUNCTION (0 means the current function).
1451 DECL_MODE is the machine mode of the user-level data type.
1452 PROMOTED_MODE is the machine mode of the register.
1453 VOLATILE_P is nonzero if this is for a "volatile" decl.
1454 USED_P is nonzero if this reg might have already been used in an insn. */
1457 put_reg_into_stack (function, reg, type, promoted_mode, decl_mode, volatile_p,
1458 original_regno, used_p, ht)
1459 struct function *function;
1462 enum machine_mode promoted_mode, decl_mode;
1464 unsigned int original_regno;
1466 struct hash_table *ht;
1468 struct function *func = function ? function : cfun;
1470 unsigned int regno = original_regno;
1473 regno = REGNO (reg);
1475 if (regno < func->x_max_parm_reg)
1476 new = func->x_parm_reg_stack_loc[regno];
1479 new = assign_stack_local_1 (decl_mode, GET_MODE_SIZE (decl_mode), 0, func);
1481 PUT_CODE (reg, MEM);
1482 PUT_MODE (reg, decl_mode);
1483 XEXP (reg, 0) = XEXP (new, 0);
1484 /* `volatil' bit means one thing for MEMs, another entirely for REGs. */
1485 MEM_VOLATILE_P (reg) = volatile_p;
1487 /* If this is a memory ref that contains aggregate components,
1488 mark it as such for cse and loop optimize. If we are reusing a
1489 previously generated stack slot, then we need to copy the bit in
1490 case it was set for other reasons. For instance, it is set for
1491 __builtin_va_alist. */
1494 MEM_SET_IN_STRUCT_P (reg,
1495 AGGREGATE_TYPE_P (type) || MEM_IN_STRUCT_P (new));
1496 set_mem_alias_set (reg, get_alias_set (type));
1499 schedule_fixup_var_refs (function, reg, type, promoted_mode, ht);
1502 /* Make sure that all refs to the variable, previously made
1503 when it was a register, are fixed up to be valid again.
1504 See function above for meaning of arguments. */
1507 schedule_fixup_var_refs (function, reg, type, promoted_mode, ht)
1508 struct function *function;
1511 enum machine_mode promoted_mode;
1512 struct hash_table *ht;
1514 int unsigned_p = type ? TREE_UNSIGNED (type) : 0;
1518 struct var_refs_queue *temp;
1521 = (struct var_refs_queue *) xmalloc (sizeof (struct var_refs_queue));
1522 temp->modified = reg;
1523 temp->promoted_mode = promoted_mode;
1524 temp->unsignedp = unsigned_p;
1525 temp->next = function->fixup_var_refs_queue;
1526 function->fixup_var_refs_queue = temp;
1529 /* Variable is local; fix it up now. */
1530 fixup_var_refs (reg, promoted_mode, unsigned_p, ht);
1534 fixup_var_refs (var, promoted_mode, unsignedp, ht)
1536 enum machine_mode promoted_mode;
1538 struct hash_table *ht;
1541 rtx first_insn = get_insns ();
1542 struct sequence_stack *stack = seq_stack;
1543 tree rtl_exps = rtl_expr_chain;
1545 /* If there's a hash table, it must record all uses of VAR. */
1550 fixup_var_refs_insns_with_hash (ht, var, promoted_mode, unsignedp);
1554 fixup_var_refs_insns (first_insn, var, promoted_mode, unsignedp,
1557 /* Scan all pending sequences too. */
1558 for (; stack; stack = stack->next)
1560 push_to_full_sequence (stack->first, stack->last);
1561 fixup_var_refs_insns (stack->first, var, promoted_mode, unsignedp,
1563 /* Update remembered end of sequence
1564 in case we added an insn at the end. */
1565 stack->last = get_last_insn ();
1569 /* Scan all waiting RTL_EXPRs too. */
1570 for (pending = rtl_exps; pending; pending = TREE_CHAIN (pending))
1572 rtx seq = RTL_EXPR_SEQUENCE (TREE_VALUE (pending));
1573 if (seq != const0_rtx && seq != 0)
1575 push_to_sequence (seq);
1576 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0);
1582 /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is
1583 some part of an insn. Return a struct fixup_replacement whose OLD
1584 value is equal to X. Allocate a new structure if no such entry exists. */
1586 static struct fixup_replacement *
1587 find_fixup_replacement (replacements, x)
1588 struct fixup_replacement **replacements;
1591 struct fixup_replacement *p;
1593 /* See if we have already replaced this. */
1594 for (p = *replacements; p != 0 && ! rtx_equal_p (p->old, x); p = p->next)
1599 p = (struct fixup_replacement *) xmalloc (sizeof (struct fixup_replacement));
1602 p->next = *replacements;
1609 /* Scan the insn-chain starting with INSN for refs to VAR
1610 and fix them up. TOPLEVEL is nonzero if this chain is the
1611 main chain of insns for the current function. */
1614 fixup_var_refs_insns (insn, var, promoted_mode, unsignedp, toplevel)
1617 enum machine_mode promoted_mode;
1623 /* fixup_var_refs_insn might modify insn, so save its next
1625 rtx next = NEXT_INSN (insn);
1627 /* CALL_PLACEHOLDERs are special; we have to switch into each of
1628 the three sequences they (potentially) contain, and process
1629 them recursively. The CALL_INSN itself is not interesting. */
1631 if (GET_CODE (insn) == CALL_INSN
1632 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1636 /* Look at the Normal call, sibling call and tail recursion
1637 sequences attached to the CALL_PLACEHOLDER. */
1638 for (i = 0; i < 3; i++)
1640 rtx seq = XEXP (PATTERN (insn), i);
1643 push_to_sequence (seq);
1644 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0);
1645 XEXP (PATTERN (insn), i) = get_insns ();
1651 else if (INSN_P (insn))
1652 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, toplevel);
1658 /* Look up the insns which reference VAR in HT and fix them up. Other
1659 arguments are the same as fixup_var_refs_insns.
1661 N.B. No need for special processing of CALL_PLACEHOLDERs here,
1662 because the hash table will point straight to the interesting insn
1663 (inside the CALL_PLACEHOLDER). */
1665 fixup_var_refs_insns_with_hash (ht, var, promoted_mode, unsignedp)
1666 struct hash_table *ht;
1668 enum machine_mode promoted_mode;
1671 struct insns_for_mem_entry *ime = (struct insns_for_mem_entry *)
1672 hash_lookup (ht, var, /*create=*/0, /*copy=*/0);
1673 rtx insn_list = ime->insns;
1677 rtx insn = XEXP (insn_list, 0);
1680 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, 1);
1682 insn_list = XEXP (insn_list, 1);
1687 /* Per-insn processing by fixup_var_refs_insns(_with_hash). INSN is
1688 the insn under examination, VAR is the variable to fix up
1689 references to, PROMOTED_MODE and UNSIGNEDP describe VAR, and
1690 TOPLEVEL is nonzero if this is the main insn chain for this
1693 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, toplevel)
1696 enum machine_mode promoted_mode;
1701 rtx set, prev, prev_set;
1704 /* Remember the notes in case we delete the insn. */
1705 note = REG_NOTES (insn);
1707 /* If this is a CLOBBER of VAR, delete it.
1709 If it has a REG_LIBCALL note, delete the REG_LIBCALL
1710 and REG_RETVAL notes too. */
1711 if (GET_CODE (PATTERN (insn)) == CLOBBER
1712 && (XEXP (PATTERN (insn), 0) == var
1713 || (GET_CODE (XEXP (PATTERN (insn), 0)) == CONCAT
1714 && (XEXP (XEXP (PATTERN (insn), 0), 0) == var
1715 || XEXP (XEXP (PATTERN (insn), 0), 1) == var))))
1717 if ((note = find_reg_note (insn, REG_LIBCALL, NULL_RTX)) != 0)
1718 /* The REG_LIBCALL note will go away since we are going to
1719 turn INSN into a NOTE, so just delete the
1720 corresponding REG_RETVAL note. */
1721 remove_note (XEXP (note, 0),
1722 find_reg_note (XEXP (note, 0), REG_RETVAL,
1725 /* In unoptimized compilation, we shouldn't call delete_insn
1726 except in jump.c doing warnings. */
1727 PUT_CODE (insn, NOTE);
1728 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1729 NOTE_SOURCE_FILE (insn) = 0;
1732 /* The insn to load VAR from a home in the arglist
1733 is now a no-op. When we see it, just delete it.
1734 Similarly if this is storing VAR from a register from which
1735 it was loaded in the previous insn. This will occur
1736 when an ADDRESSOF was made for an arglist slot. */
1738 && (set = single_set (insn)) != 0
1739 && SET_DEST (set) == var
1740 /* If this represents the result of an insn group,
1741 don't delete the insn. */
1742 && find_reg_note (insn, REG_RETVAL, NULL_RTX) == 0
1743 && (rtx_equal_p (SET_SRC (set), var)
1744 || (GET_CODE (SET_SRC (set)) == REG
1745 && (prev = prev_nonnote_insn (insn)) != 0
1746 && (prev_set = single_set (prev)) != 0
1747 && SET_DEST (prev_set) == SET_SRC (set)
1748 && rtx_equal_p (SET_SRC (prev_set), var))))
1750 /* In unoptimized compilation, we shouldn't call delete_insn
1751 except in jump.c doing warnings. */
1752 PUT_CODE (insn, NOTE);
1753 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1754 NOTE_SOURCE_FILE (insn) = 0;
1758 struct fixup_replacement *replacements = 0;
1759 rtx next_insn = NEXT_INSN (insn);
1761 if (SMALL_REGISTER_CLASSES)
1763 /* If the insn that copies the results of a CALL_INSN
1764 into a pseudo now references VAR, we have to use an
1765 intermediate pseudo since we want the life of the
1766 return value register to be only a single insn.
1768 If we don't use an intermediate pseudo, such things as
1769 address computations to make the address of VAR valid
1770 if it is not can be placed between the CALL_INSN and INSN.
1772 To make sure this doesn't happen, we record the destination
1773 of the CALL_INSN and see if the next insn uses both that
1776 if (call_dest != 0 && GET_CODE (insn) == INSN
1777 && reg_mentioned_p (var, PATTERN (insn))
1778 && reg_mentioned_p (call_dest, PATTERN (insn)))
1780 rtx temp = gen_reg_rtx (GET_MODE (call_dest));
1782 emit_insn_before (gen_move_insn (temp, call_dest), insn);
1784 PATTERN (insn) = replace_rtx (PATTERN (insn),
1788 if (GET_CODE (insn) == CALL_INSN
1789 && GET_CODE (PATTERN (insn)) == SET)
1790 call_dest = SET_DEST (PATTERN (insn));
1791 else if (GET_CODE (insn) == CALL_INSN
1792 && GET_CODE (PATTERN (insn)) == PARALLEL
1793 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET)
1794 call_dest = SET_DEST (XVECEXP (PATTERN (insn), 0, 0));
1799 /* See if we have to do anything to INSN now that VAR is in
1800 memory. If it needs to be loaded into a pseudo, use a single
1801 pseudo for the entire insn in case there is a MATCH_DUP
1802 between two operands. We pass a pointer to the head of
1803 a list of struct fixup_replacements. If fixup_var_refs_1
1804 needs to allocate pseudos or replacement MEMs (for SUBREGs),
1805 it will record them in this list.
1807 If it allocated a pseudo for any replacement, we copy into
1810 fixup_var_refs_1 (var, promoted_mode, &PATTERN (insn), insn,
1813 /* If this is last_parm_insn, and any instructions were output
1814 after it to fix it up, then we must set last_parm_insn to
1815 the last such instruction emitted. */
1816 if (insn == last_parm_insn)
1817 last_parm_insn = PREV_INSN (next_insn);
1819 while (replacements)
1821 struct fixup_replacement *next;
1823 if (GET_CODE (replacements->new) == REG)
1828 /* OLD might be a (subreg (mem)). */
1829 if (GET_CODE (replacements->old) == SUBREG)
1831 = fixup_memory_subreg (replacements->old, insn, 0);
1834 = fixup_stack_1 (replacements->old, insn);
1836 insert_before = insn;
1838 /* If we are changing the mode, do a conversion.
1839 This might be wasteful, but combine.c will
1840 eliminate much of the waste. */
1842 if (GET_MODE (replacements->new)
1843 != GET_MODE (replacements->old))
1846 convert_move (replacements->new,
1847 replacements->old, unsignedp);
1848 seq = gen_sequence ();
1852 seq = gen_move_insn (replacements->new,
1855 emit_insn_before (seq, insert_before);
1858 next = replacements->next;
1859 free (replacements);
1860 replacements = next;
1864 /* Also fix up any invalid exprs in the REG_NOTES of this insn.
1865 But don't touch other insns referred to by reg-notes;
1866 we will get them elsewhere. */
1869 if (GET_CODE (note) != INSN_LIST)
1871 = walk_fixup_memory_subreg (XEXP (note, 0), insn, 1);
1872 note = XEXP (note, 1);
1876 /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
1877 See if the rtx expression at *LOC in INSN needs to be changed.
1879 REPLACEMENTS is a pointer to a list head that starts out zero, but may
1880 contain a list of original rtx's and replacements. If we find that we need
1881 to modify this insn by replacing a memory reference with a pseudo or by
1882 making a new MEM to implement a SUBREG, we consult that list to see if
1883 we have already chosen a replacement. If none has already been allocated,
1884 we allocate it and update the list. fixup_var_refs_insn will copy VAR
1885 or the SUBREG, as appropriate, to the pseudo. */
1888 fixup_var_refs_1 (var, promoted_mode, loc, insn, replacements)
1890 enum machine_mode promoted_mode;
1893 struct fixup_replacement **replacements;
1896 register rtx x = *loc;
1897 RTX_CODE code = GET_CODE (x);
1898 register const char *fmt;
1899 register rtx tem, tem1;
1900 struct fixup_replacement *replacement;
1905 if (XEXP (x, 0) == var)
1907 /* Prevent sharing of rtl that might lose. */
1908 rtx sub = copy_rtx (XEXP (var, 0));
1910 if (! validate_change (insn, loc, sub, 0))
1912 rtx y = gen_reg_rtx (GET_MODE (sub));
1915 /* We should be able to replace with a register or all is lost.
1916 Note that we can't use validate_change to verify this, since
1917 we're not caring for replacing all dups simultaneously. */
1918 if (! validate_replace_rtx (*loc, y, insn))
1921 /* Careful! First try to recognize a direct move of the
1922 value, mimicking how things are done in gen_reload wrt
1923 PLUS. Consider what happens when insn is a conditional
1924 move instruction and addsi3 clobbers flags. */
1927 new_insn = emit_insn (gen_rtx_SET (VOIDmode, y, sub));
1928 seq = gen_sequence ();
1931 if (recog_memoized (new_insn) < 0)
1933 /* That failed. Fall back on force_operand and hope. */
1936 sub = force_operand (sub, y);
1938 emit_insn (gen_move_insn (y, sub));
1939 seq = gen_sequence ();
1944 /* Don't separate setter from user. */
1945 if (PREV_INSN (insn) && sets_cc0_p (PREV_INSN (insn)))
1946 insn = PREV_INSN (insn);
1949 emit_insn_before (seq, insn);
1957 /* If we already have a replacement, use it. Otherwise,
1958 try to fix up this address in case it is invalid. */
1960 replacement = find_fixup_replacement (replacements, var);
1961 if (replacement->new)
1963 *loc = replacement->new;
1967 *loc = replacement->new = x = fixup_stack_1 (x, insn);
1969 /* Unless we are forcing memory to register or we changed the mode,
1970 we can leave things the way they are if the insn is valid. */
1972 INSN_CODE (insn) = -1;
1973 if (! flag_force_mem && GET_MODE (x) == promoted_mode
1974 && recog_memoized (insn) >= 0)
1977 *loc = replacement->new = gen_reg_rtx (promoted_mode);
1981 /* If X contains VAR, we need to unshare it here so that we update
1982 each occurrence separately. But all identical MEMs in one insn
1983 must be replaced with the same rtx because of the possibility of
1986 if (reg_mentioned_p (var, x))
1988 replacement = find_fixup_replacement (replacements, x);
1989 if (replacement->new == 0)
1990 replacement->new = copy_most_rtx (x, var);
1992 *loc = x = replacement->new;
1993 code = GET_CODE (x);
2009 /* Note that in some cases those types of expressions are altered
2010 by optimize_bit_field, and do not survive to get here. */
2011 if (XEXP (x, 0) == var
2012 || (GET_CODE (XEXP (x, 0)) == SUBREG
2013 && SUBREG_REG (XEXP (x, 0)) == var))
2015 /* Get TEM as a valid MEM in the mode presently in the insn.
2017 We don't worry about the possibility of MATCH_DUP here; it
2018 is highly unlikely and would be tricky to handle. */
2021 if (GET_CODE (tem) == SUBREG)
2023 if (GET_MODE_BITSIZE (GET_MODE (tem))
2024 > GET_MODE_BITSIZE (GET_MODE (var)))
2026 replacement = find_fixup_replacement (replacements, var);
2027 if (replacement->new == 0)
2028 replacement->new = gen_reg_rtx (GET_MODE (var));
2029 SUBREG_REG (tem) = replacement->new;
2031 /* The following code works only if we have a MEM, so we
2032 need to handle the subreg here. We directly substitute
2033 it assuming that a subreg must be OK here. We already
2034 scheduled a replacement to copy the mem into the
2040 tem = fixup_memory_subreg (tem, insn, 0);
2043 tem = fixup_stack_1 (tem, insn);
2045 /* Unless we want to load from memory, get TEM into the proper mode
2046 for an extract from memory. This can only be done if the
2047 extract is at a constant position and length. */
2049 if (! flag_force_mem && GET_CODE (XEXP (x, 1)) == CONST_INT
2050 && GET_CODE (XEXP (x, 2)) == CONST_INT
2051 && ! mode_dependent_address_p (XEXP (tem, 0))
2052 && ! MEM_VOLATILE_P (tem))
2054 enum machine_mode wanted_mode = VOIDmode;
2055 enum machine_mode is_mode = GET_MODE (tem);
2056 HOST_WIDE_INT pos = INTVAL (XEXP (x, 2));
2059 if (GET_CODE (x) == ZERO_EXTRACT)
2062 = insn_data[(int) CODE_FOR_extzv].operand[1].mode;
2063 if (wanted_mode == VOIDmode)
2064 wanted_mode = word_mode;
2068 if (GET_CODE (x) == SIGN_EXTRACT)
2070 wanted_mode = insn_data[(int) CODE_FOR_extv].operand[1].mode;
2071 if (wanted_mode == VOIDmode)
2072 wanted_mode = word_mode;
2075 /* If we have a narrower mode, we can do something. */
2076 if (wanted_mode != VOIDmode
2077 && GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2079 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2080 rtx old_pos = XEXP (x, 2);
2083 /* If the bytes and bits are counted differently, we
2084 must adjust the offset. */
2085 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2086 offset = (GET_MODE_SIZE (is_mode)
2087 - GET_MODE_SIZE (wanted_mode) - offset);
2089 pos %= GET_MODE_BITSIZE (wanted_mode);
2091 newmem = adjust_address_nv (tem, wanted_mode, offset);
2093 /* Make the change and see if the insn remains valid. */
2094 INSN_CODE (insn) = -1;
2095 XEXP (x, 0) = newmem;
2096 XEXP (x, 2) = GEN_INT (pos);
2098 if (recog_memoized (insn) >= 0)
2101 /* Otherwise, restore old position. XEXP (x, 0) will be
2103 XEXP (x, 2) = old_pos;
2107 /* If we get here, the bitfield extract insn can't accept a memory
2108 reference. Copy the input into a register. */
2110 tem1 = gen_reg_rtx (GET_MODE (tem));
2111 emit_insn_before (gen_move_insn (tem1, tem), insn);
2118 if (SUBREG_REG (x) == var)
2120 /* If this is a special SUBREG made because VAR was promoted
2121 from a wider mode, replace it with VAR and call ourself
2122 recursively, this time saying that the object previously
2123 had its current mode (by virtue of the SUBREG). */
2125 if (SUBREG_PROMOTED_VAR_P (x))
2128 fixup_var_refs_1 (var, GET_MODE (var), loc, insn, replacements);
2132 /* If this SUBREG makes VAR wider, it has become a paradoxical
2133 SUBREG with VAR in memory, but these aren't allowed at this
2134 stage of the compilation. So load VAR into a pseudo and take
2135 a SUBREG of that pseudo. */
2136 if (GET_MODE_SIZE (GET_MODE (x)) > GET_MODE_SIZE (GET_MODE (var)))
2138 replacement = find_fixup_replacement (replacements, var);
2139 if (replacement->new == 0)
2140 replacement->new = gen_reg_rtx (promoted_mode);
2141 SUBREG_REG (x) = replacement->new;
2145 /* See if we have already found a replacement for this SUBREG.
2146 If so, use it. Otherwise, make a MEM and see if the insn
2147 is recognized. If not, or if we should force MEM into a register,
2148 make a pseudo for this SUBREG. */
2149 replacement = find_fixup_replacement (replacements, x);
2150 if (replacement->new)
2152 *loc = replacement->new;
2156 replacement->new = *loc = fixup_memory_subreg (x, insn, 0);
2158 INSN_CODE (insn) = -1;
2159 if (! flag_force_mem && recog_memoized (insn) >= 0)
2162 *loc = replacement->new = gen_reg_rtx (GET_MODE (x));
2168 /* First do special simplification of bit-field references. */
2169 if (GET_CODE (SET_DEST (x)) == SIGN_EXTRACT
2170 || GET_CODE (SET_DEST (x)) == ZERO_EXTRACT)
2171 optimize_bit_field (x, insn, 0);
2172 if (GET_CODE (SET_SRC (x)) == SIGN_EXTRACT
2173 || GET_CODE (SET_SRC (x)) == ZERO_EXTRACT)
2174 optimize_bit_field (x, insn, 0);
2176 /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object
2177 into a register and then store it back out. */
2178 if (GET_CODE (SET_DEST (x)) == ZERO_EXTRACT
2179 && GET_CODE (XEXP (SET_DEST (x), 0)) == SUBREG
2180 && SUBREG_REG (XEXP (SET_DEST (x), 0)) == var
2181 && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x), 0)))
2182 > GET_MODE_SIZE (GET_MODE (var))))
2184 replacement = find_fixup_replacement (replacements, var);
2185 if (replacement->new == 0)
2186 replacement->new = gen_reg_rtx (GET_MODE (var));
2188 SUBREG_REG (XEXP (SET_DEST (x), 0)) = replacement->new;
2189 emit_insn_after (gen_move_insn (var, replacement->new), insn);
2192 /* If SET_DEST is now a paradoxical SUBREG, put the result of this
2193 insn into a pseudo and store the low part of the pseudo into VAR. */
2194 if (GET_CODE (SET_DEST (x)) == SUBREG
2195 && SUBREG_REG (SET_DEST (x)) == var
2196 && (GET_MODE_SIZE (GET_MODE (SET_DEST (x)))
2197 > GET_MODE_SIZE (GET_MODE (var))))
2199 SET_DEST (x) = tem = gen_reg_rtx (GET_MODE (SET_DEST (x)));
2200 emit_insn_after (gen_move_insn (var, gen_lowpart (GET_MODE (var),
2207 rtx dest = SET_DEST (x);
2208 rtx src = SET_SRC (x);
2210 rtx outerdest = dest;
2213 while (GET_CODE (dest) == SUBREG || GET_CODE (dest) == STRICT_LOW_PART
2214 || GET_CODE (dest) == SIGN_EXTRACT
2215 || GET_CODE (dest) == ZERO_EXTRACT)
2216 dest = XEXP (dest, 0);
2218 if (GET_CODE (src) == SUBREG)
2219 src = SUBREG_REG (src);
2221 /* If VAR does not appear at the top level of the SET
2222 just scan the lower levels of the tree. */
2224 if (src != var && dest != var)
2227 /* We will need to rerecognize this insn. */
2228 INSN_CODE (insn) = -1;
2231 if (GET_CODE (outerdest) == ZERO_EXTRACT && dest == var)
2233 /* Since this case will return, ensure we fixup all the
2235 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 1),
2236 insn, replacements);
2237 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 2),
2238 insn, replacements);
2239 fixup_var_refs_1 (var, promoted_mode, &SET_SRC (x),
2240 insn, replacements);
2242 tem = XEXP (outerdest, 0);
2244 /* Clean up (SUBREG:SI (MEM:mode ...) 0)
2245 that may appear inside a ZERO_EXTRACT.
2246 This was legitimate when the MEM was a REG. */
2247 if (GET_CODE (tem) == SUBREG
2248 && SUBREG_REG (tem) == var)
2249 tem = fixup_memory_subreg (tem, insn, 0);
2251 tem = fixup_stack_1 (tem, insn);
2253 if (GET_CODE (XEXP (outerdest, 1)) == CONST_INT
2254 && GET_CODE (XEXP (outerdest, 2)) == CONST_INT
2255 && ! mode_dependent_address_p (XEXP (tem, 0))
2256 && ! MEM_VOLATILE_P (tem))
2258 enum machine_mode wanted_mode;
2259 enum machine_mode is_mode = GET_MODE (tem);
2260 HOST_WIDE_INT pos = INTVAL (XEXP (outerdest, 2));
2262 wanted_mode = insn_data[(int) CODE_FOR_insv].operand[0].mode;
2263 if (wanted_mode == VOIDmode)
2264 wanted_mode = word_mode;
2266 /* If we have a narrower mode, we can do something. */
2267 if (GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2269 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2270 rtx old_pos = XEXP (outerdest, 2);
2273 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2274 offset = (GET_MODE_SIZE (is_mode)
2275 - GET_MODE_SIZE (wanted_mode) - offset);
2277 pos %= GET_MODE_BITSIZE (wanted_mode);
2279 newmem = adjust_address_nv (tem, wanted_mode, offset);
2281 /* Make the change and see if the insn remains valid. */
2282 INSN_CODE (insn) = -1;
2283 XEXP (outerdest, 0) = newmem;
2284 XEXP (outerdest, 2) = GEN_INT (pos);
2286 if (recog_memoized (insn) >= 0)
2289 /* Otherwise, restore old position. XEXP (x, 0) will be
2291 XEXP (outerdest, 2) = old_pos;
2295 /* If we get here, the bit-field store doesn't allow memory
2296 or isn't located at a constant position. Load the value into
2297 a register, do the store, and put it back into memory. */
2299 tem1 = gen_reg_rtx (GET_MODE (tem));
2300 emit_insn_before (gen_move_insn (tem1, tem), insn);
2301 emit_insn_after (gen_move_insn (tem, tem1), insn);
2302 XEXP (outerdest, 0) = tem1;
2307 /* STRICT_LOW_PART is a no-op on memory references
2308 and it can cause combinations to be unrecognizable,
2311 if (dest == var && GET_CODE (SET_DEST (x)) == STRICT_LOW_PART)
2312 SET_DEST (x) = XEXP (SET_DEST (x), 0);
2314 /* A valid insn to copy VAR into or out of a register
2315 must be left alone, to avoid an infinite loop here.
2316 If the reference to VAR is by a subreg, fix that up,
2317 since SUBREG is not valid for a memref.
2318 Also fix up the address of the stack slot.
2320 Note that we must not try to recognize the insn until
2321 after we know that we have valid addresses and no
2322 (subreg (mem ...) ...) constructs, since these interfere
2323 with determining the validity of the insn. */
2325 if ((SET_SRC (x) == var
2326 || (GET_CODE (SET_SRC (x)) == SUBREG
2327 && SUBREG_REG (SET_SRC (x)) == var))
2328 && (GET_CODE (SET_DEST (x)) == REG
2329 || (GET_CODE (SET_DEST (x)) == SUBREG
2330 && GET_CODE (SUBREG_REG (SET_DEST (x))) == REG))
2331 && GET_MODE (var) == promoted_mode
2332 && x == single_set (insn))
2336 replacement = find_fixup_replacement (replacements, SET_SRC (x));
2337 if (replacement->new)
2338 SET_SRC (x) = replacement->new;
2339 else if (GET_CODE (SET_SRC (x)) == SUBREG)
2340 SET_SRC (x) = replacement->new
2341 = fixup_memory_subreg (SET_SRC (x), insn, 0);
2343 SET_SRC (x) = replacement->new
2344 = fixup_stack_1 (SET_SRC (x), insn);
2346 if (recog_memoized (insn) >= 0)
2349 /* INSN is not valid, but we know that we want to
2350 copy SET_SRC (x) to SET_DEST (x) in some way. So
2351 we generate the move and see whether it requires more
2352 than one insn. If it does, we emit those insns and
2353 delete INSN. Otherwise, we an just replace the pattern
2354 of INSN; we have already verified above that INSN has
2355 no other function that to do X. */
2357 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2358 if (GET_CODE (pat) == SEQUENCE)
2360 last = emit_insn_before (pat, insn);
2362 /* INSN might have REG_RETVAL or other important notes, so
2363 we need to store the pattern of the last insn in the
2364 sequence into INSN similarly to the normal case. LAST
2365 should not have REG_NOTES, but we allow them if INSN has
2367 if (REG_NOTES (last) && REG_NOTES (insn))
2369 if (REG_NOTES (last))
2370 REG_NOTES (insn) = REG_NOTES (last);
2371 PATTERN (insn) = PATTERN (last);
2373 PUT_CODE (last, NOTE);
2374 NOTE_LINE_NUMBER (last) = NOTE_INSN_DELETED;
2375 NOTE_SOURCE_FILE (last) = 0;
2378 PATTERN (insn) = pat;
2383 if ((SET_DEST (x) == var
2384 || (GET_CODE (SET_DEST (x)) == SUBREG
2385 && SUBREG_REG (SET_DEST (x)) == var))
2386 && (GET_CODE (SET_SRC (x)) == REG
2387 || (GET_CODE (SET_SRC (x)) == SUBREG
2388 && GET_CODE (SUBREG_REG (SET_SRC (x))) == REG))
2389 && GET_MODE (var) == promoted_mode
2390 && x == single_set (insn))
2394 if (GET_CODE (SET_DEST (x)) == SUBREG)
2395 SET_DEST (x) = fixup_memory_subreg (SET_DEST (x), insn, 0);
2397 SET_DEST (x) = fixup_stack_1 (SET_DEST (x), insn);
2399 if (recog_memoized (insn) >= 0)
2402 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2403 if (GET_CODE (pat) == SEQUENCE)
2405 last = emit_insn_before (pat, insn);
2407 /* INSN might have REG_RETVAL or other important notes, so
2408 we need to store the pattern of the last insn in the
2409 sequence into INSN similarly to the normal case. LAST
2410 should not have REG_NOTES, but we allow them if INSN has
2412 if (REG_NOTES (last) && REG_NOTES (insn))
2414 if (REG_NOTES (last))
2415 REG_NOTES (insn) = REG_NOTES (last);
2416 PATTERN (insn) = PATTERN (last);
2418 PUT_CODE (last, NOTE);
2419 NOTE_LINE_NUMBER (last) = NOTE_INSN_DELETED;
2420 NOTE_SOURCE_FILE (last) = 0;
2423 PATTERN (insn) = pat;
2428 /* Otherwise, storing into VAR must be handled specially
2429 by storing into a temporary and copying that into VAR
2430 with a new insn after this one. Note that this case
2431 will be used when storing into a promoted scalar since
2432 the insn will now have different modes on the input
2433 and output and hence will be invalid (except for the case
2434 of setting it to a constant, which does not need any
2435 change if it is valid). We generate extra code in that case,
2436 but combine.c will eliminate it. */
2441 rtx fixeddest = SET_DEST (x);
2443 /* STRICT_LOW_PART can be discarded, around a MEM. */
2444 if (GET_CODE (fixeddest) == STRICT_LOW_PART)
2445 fixeddest = XEXP (fixeddest, 0);
2446 /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */
2447 if (GET_CODE (fixeddest) == SUBREG)
2449 fixeddest = fixup_memory_subreg (fixeddest, insn, 0);
2450 promoted_mode = GET_MODE (fixeddest);
2453 fixeddest = fixup_stack_1 (fixeddest, insn);
2455 temp = gen_reg_rtx (promoted_mode);
2457 emit_insn_after (gen_move_insn (fixeddest,
2458 gen_lowpart (GET_MODE (fixeddest),
2462 SET_DEST (x) = temp;
2470 /* Nothing special about this RTX; fix its operands. */
2472 fmt = GET_RTX_FORMAT (code);
2473 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2476 fixup_var_refs_1 (var, promoted_mode, &XEXP (x, i), insn, replacements);
2477 else if (fmt[i] == 'E')
2480 for (j = 0; j < XVECLEN (x, i); j++)
2481 fixup_var_refs_1 (var, promoted_mode, &XVECEXP (x, i, j),
2482 insn, replacements);
2487 /* Given X, an rtx of the form (SUBREG:m1 (MEM:m2 addr)),
2488 return an rtx (MEM:m1 newaddr) which is equivalent.
2489 If any insns must be emitted to compute NEWADDR, put them before INSN.
2491 UNCRITICAL nonzero means accept paradoxical subregs.
2492 This is used for subregs found inside REG_NOTES. */
2495 fixup_memory_subreg (x, insn, uncritical)
2500 int offset = SUBREG_BYTE (x);
2501 rtx addr = XEXP (SUBREG_REG (x), 0);
2502 enum machine_mode mode = GET_MODE (x);
2505 /* Paradoxical SUBREGs are usually invalid during RTL generation. */
2506 if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (GET_MODE (SUBREG_REG (x)))
2510 if (!flag_force_addr
2511 && memory_address_p (mode, plus_constant (addr, offset)))
2512 /* Shortcut if no insns need be emitted. */
2513 return adjust_address (SUBREG_REG (x), mode, offset);
2516 result = adjust_address (SUBREG_REG (x), mode, offset);
2517 emit_insn_before (gen_sequence (), insn);
2522 /* Do fixup_memory_subreg on all (SUBREG (MEM ...) ...) contained in X.
2523 Replace subexpressions of X in place.
2524 If X itself is a (SUBREG (MEM ...) ...), return the replacement expression.
2525 Otherwise return X, with its contents possibly altered.
2527 If any insns must be emitted to compute NEWADDR, put them before INSN.
2529 UNCRITICAL is as in fixup_memory_subreg. */
2532 walk_fixup_memory_subreg (x, insn, uncritical)
2537 register enum rtx_code code;
2538 register const char *fmt;
2544 code = GET_CODE (x);
2546 if (code == SUBREG && GET_CODE (SUBREG_REG (x)) == MEM)
2547 return fixup_memory_subreg (x, insn, uncritical);
2549 /* Nothing special about this RTX; fix its operands. */
2551 fmt = GET_RTX_FORMAT (code);
2552 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2555 XEXP (x, i) = walk_fixup_memory_subreg (XEXP (x, i), insn, uncritical);
2556 else if (fmt[i] == 'E')
2559 for (j = 0; j < XVECLEN (x, i); j++)
2561 = walk_fixup_memory_subreg (XVECEXP (x, i, j), insn, uncritical);
2567 /* For each memory ref within X, if it refers to a stack slot
2568 with an out of range displacement, put the address in a temp register
2569 (emitting new insns before INSN to load these registers)
2570 and alter the memory ref to use that register.
2571 Replace each such MEM rtx with a copy, to avoid clobberage. */
2574 fixup_stack_1 (x, insn)
2579 register RTX_CODE code = GET_CODE (x);
2580 register const char *fmt;
2584 register rtx ad = XEXP (x, 0);
2585 /* If we have address of a stack slot but it's not valid
2586 (displacement is too large), compute the sum in a register. */
2587 if (GET_CODE (ad) == PLUS
2588 && GET_CODE (XEXP (ad, 0)) == REG
2589 && ((REGNO (XEXP (ad, 0)) >= FIRST_VIRTUAL_REGISTER
2590 && REGNO (XEXP (ad, 0)) <= LAST_VIRTUAL_REGISTER)
2591 || REGNO (XEXP (ad, 0)) == FRAME_POINTER_REGNUM
2592 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2593 || REGNO (XEXP (ad, 0)) == HARD_FRAME_POINTER_REGNUM
2595 || REGNO (XEXP (ad, 0)) == STACK_POINTER_REGNUM
2596 || REGNO (XEXP (ad, 0)) == ARG_POINTER_REGNUM
2597 || XEXP (ad, 0) == current_function_internal_arg_pointer)
2598 && GET_CODE (XEXP (ad, 1)) == CONST_INT)
2601 if (memory_address_p (GET_MODE (x), ad))
2605 temp = copy_to_reg (ad);
2606 seq = gen_sequence ();
2608 emit_insn_before (seq, insn);
2609 return replace_equiv_address (x, temp);
2614 fmt = GET_RTX_FORMAT (code);
2615 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2618 XEXP (x, i) = fixup_stack_1 (XEXP (x, i), insn);
2619 else if (fmt[i] == 'E')
2622 for (j = 0; j < XVECLEN (x, i); j++)
2623 XVECEXP (x, i, j) = fixup_stack_1 (XVECEXP (x, i, j), insn);
2629 /* Optimization: a bit-field instruction whose field
2630 happens to be a byte or halfword in memory
2631 can be changed to a move instruction.
2633 We call here when INSN is an insn to examine or store into a bit-field.
2634 BODY is the SET-rtx to be altered.
2636 EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0.
2637 (Currently this is called only from function.c, and EQUIV_MEM
2641 optimize_bit_field (body, insn, equiv_mem)
2646 register rtx bitfield;
2649 enum machine_mode mode;
2651 if (GET_CODE (SET_DEST (body)) == SIGN_EXTRACT
2652 || GET_CODE (SET_DEST (body)) == ZERO_EXTRACT)
2653 bitfield = SET_DEST (body), destflag = 1;
2655 bitfield = SET_SRC (body), destflag = 0;
2657 /* First check that the field being stored has constant size and position
2658 and is in fact a byte or halfword suitably aligned. */
2660 if (GET_CODE (XEXP (bitfield, 1)) == CONST_INT
2661 && GET_CODE (XEXP (bitfield, 2)) == CONST_INT
2662 && ((mode = mode_for_size (INTVAL (XEXP (bitfield, 1)), MODE_INT, 1))
2664 && INTVAL (XEXP (bitfield, 2)) % INTVAL (XEXP (bitfield, 1)) == 0)
2666 register rtx memref = 0;
2668 /* Now check that the containing word is memory, not a register,
2669 and that it is safe to change the machine mode. */
2671 if (GET_CODE (XEXP (bitfield, 0)) == MEM)
2672 memref = XEXP (bitfield, 0);
2673 else if (GET_CODE (XEXP (bitfield, 0)) == REG
2675 memref = equiv_mem[REGNO (XEXP (bitfield, 0))];
2676 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2677 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == MEM)
2678 memref = SUBREG_REG (XEXP (bitfield, 0));
2679 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2681 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == REG)
2682 memref = equiv_mem[REGNO (SUBREG_REG (XEXP (bitfield, 0)))];
2685 && ! mode_dependent_address_p (XEXP (memref, 0))
2686 && ! MEM_VOLATILE_P (memref))
2688 /* Now adjust the address, first for any subreg'ing
2689 that we are now getting rid of,
2690 and then for which byte of the word is wanted. */
2692 HOST_WIDE_INT offset = INTVAL (XEXP (bitfield, 2));
2695 /* Adjust OFFSET to count bits from low-address byte. */
2696 if (BITS_BIG_ENDIAN != BYTES_BIG_ENDIAN)
2697 offset = (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield, 0)))
2698 - offset - INTVAL (XEXP (bitfield, 1)));
2700 /* Adjust OFFSET to count bytes from low-address byte. */
2701 offset /= BITS_PER_UNIT;
2702 if (GET_CODE (XEXP (bitfield, 0)) == SUBREG)
2704 offset += (SUBREG_BYTE (XEXP (bitfield, 0))
2705 / UNITS_PER_WORD) * UNITS_PER_WORD;
2706 if (BYTES_BIG_ENDIAN)
2707 offset -= (MIN (UNITS_PER_WORD,
2708 GET_MODE_SIZE (GET_MODE (XEXP (bitfield, 0))))
2709 - MIN (UNITS_PER_WORD,
2710 GET_MODE_SIZE (GET_MODE (memref))));
2714 memref = adjust_address (memref, mode, offset);
2715 insns = get_insns ();
2717 emit_insns_before (insns, insn);
2719 /* Store this memory reference where
2720 we found the bit field reference. */
2724 validate_change (insn, &SET_DEST (body), memref, 1);
2725 if (! CONSTANT_ADDRESS_P (SET_SRC (body)))
2727 rtx src = SET_SRC (body);
2728 while (GET_CODE (src) == SUBREG
2729 && SUBREG_BYTE (src) == 0)
2730 src = SUBREG_REG (src);
2731 if (GET_MODE (src) != GET_MODE (memref))
2732 src = gen_lowpart (GET_MODE (memref), SET_SRC (body));
2733 validate_change (insn, &SET_SRC (body), src, 1);
2735 else if (GET_MODE (SET_SRC (body)) != VOIDmode
2736 && GET_MODE (SET_SRC (body)) != GET_MODE (memref))
2737 /* This shouldn't happen because anything that didn't have
2738 one of these modes should have got converted explicitly
2739 and then referenced through a subreg.
2740 This is so because the original bit-field was
2741 handled by agg_mode and so its tree structure had
2742 the same mode that memref now has. */
2747 rtx dest = SET_DEST (body);
2749 while (GET_CODE (dest) == SUBREG
2750 && SUBREG_BYTE (dest) == 0
2751 && (GET_MODE_CLASS (GET_MODE (dest))
2752 == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest))))
2753 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2755 dest = SUBREG_REG (dest);
2757 validate_change (insn, &SET_DEST (body), dest, 1);
2759 if (GET_MODE (dest) == GET_MODE (memref))
2760 validate_change (insn, &SET_SRC (body), memref, 1);
2763 /* Convert the mem ref to the destination mode. */
2764 rtx newreg = gen_reg_rtx (GET_MODE (dest));
2767 convert_move (newreg, memref,
2768 GET_CODE (SET_SRC (body)) == ZERO_EXTRACT);
2772 validate_change (insn, &SET_SRC (body), newreg, 1);
2776 /* See if we can convert this extraction or insertion into
2777 a simple move insn. We might not be able to do so if this
2778 was, for example, part of a PARALLEL.
2780 If we succeed, write out any needed conversions. If we fail,
2781 it is hard to guess why we failed, so don't do anything
2782 special; just let the optimization be suppressed. */
2784 if (apply_change_group () && seq)
2785 emit_insns_before (seq, insn);
2790 /* These routines are responsible for converting virtual register references
2791 to the actual hard register references once RTL generation is complete.
2793 The following four variables are used for communication between the
2794 routines. They contain the offsets of the virtual registers from their
2795 respective hard registers. */
2797 static int in_arg_offset;
2798 static int var_offset;
2799 static int dynamic_offset;
2800 static int out_arg_offset;
2801 static int cfa_offset;
2803 /* In most machines, the stack pointer register is equivalent to the bottom
2806 #ifndef STACK_POINTER_OFFSET
2807 #define STACK_POINTER_OFFSET 0
2810 /* If not defined, pick an appropriate default for the offset of dynamically
2811 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
2812 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
2814 #ifndef STACK_DYNAMIC_OFFSET
2816 /* The bottom of the stack points to the actual arguments. If
2817 REG_PARM_STACK_SPACE is defined, this includes the space for the register
2818 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
2819 stack space for register parameters is not pushed by the caller, but
2820 rather part of the fixed stack areas and hence not included in
2821 `current_function_outgoing_args_size'. Nevertheless, we must allow
2822 for it when allocating stack dynamic objects. */
2824 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2825 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2826 ((ACCUMULATE_OUTGOING_ARGS \
2827 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
2828 + (STACK_POINTER_OFFSET)) \
2831 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2832 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
2833 + (STACK_POINTER_OFFSET))
2837 /* On most machines, the CFA coincides with the first incoming parm. */
2839 #ifndef ARG_POINTER_CFA_OFFSET
2840 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
2843 /* Build up a (MEM (ADDRESSOF (REG))) rtx for a register REG that just had
2844 its address taken. DECL is the decl for the object stored in the
2845 register, for later use if we do need to force REG into the stack.
2846 REG is overwritten by the MEM like in put_reg_into_stack. */
2849 gen_mem_addressof (reg, decl)
2853 rtx r = gen_rtx_ADDRESSOF (Pmode, gen_reg_rtx (GET_MODE (reg)),
2856 /* Calculate this before we start messing with decl's RTL. */
2857 HOST_WIDE_INT set = get_alias_set (decl);
2859 /* If the original REG was a user-variable, then so is the REG whose
2860 address is being taken. Likewise for unchanging. */
2861 REG_USERVAR_P (XEXP (r, 0)) = REG_USERVAR_P (reg);
2862 RTX_UNCHANGING_P (XEXP (r, 0)) = RTX_UNCHANGING_P (reg);
2864 PUT_CODE (reg, MEM);
2868 tree type = TREE_TYPE (decl);
2869 enum machine_mode decl_mode
2870 = (TREE_CODE (decl) == SAVE_EXPR ? TYPE_MODE (TREE_TYPE (decl))
2871 : DECL_MODE (decl));
2873 PUT_MODE (reg, decl_mode);
2874 MEM_VOLATILE_P (reg) = TREE_SIDE_EFFECTS (decl);
2875 MEM_SET_IN_STRUCT_P (reg, AGGREGATE_TYPE_P (type));
2876 set_mem_alias_set (reg, set);
2878 if (TREE_USED (decl) || DECL_INITIAL (decl) != 0)
2879 fixup_var_refs (reg, GET_MODE (reg), TREE_UNSIGNED (type), 0);
2883 /* We have no alias information about this newly created MEM. */
2884 set_mem_alias_set (reg, 0);
2886 fixup_var_refs (reg, GET_MODE (reg), 0, 0);
2892 /* If DECL has an RTL that is an ADDRESSOF rtx, put it into the stack. */
2895 flush_addressof (decl)
2898 if ((TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == VAR_DECL)
2899 && DECL_RTL (decl) != 0
2900 && GET_CODE (DECL_RTL (decl)) == MEM
2901 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF
2902 && GET_CODE (XEXP (XEXP (DECL_RTL (decl), 0), 0)) == REG)
2903 put_addressof_into_stack (XEXP (DECL_RTL (decl), 0), 0);
2906 /* Force the register pointed to by R, an ADDRESSOF rtx, into the stack. */
2909 put_addressof_into_stack (r, ht)
2911 struct hash_table *ht;
2914 int volatile_p, used_p;
2916 rtx reg = XEXP (r, 0);
2918 if (GET_CODE (reg) != REG)
2921 decl = ADDRESSOF_DECL (r);
2924 type = TREE_TYPE (decl);
2925 volatile_p = (TREE_CODE (decl) != SAVE_EXPR
2926 && TREE_THIS_VOLATILE (decl));
2927 used_p = (TREE_USED (decl)
2928 || (TREE_CODE (decl) != SAVE_EXPR
2929 && DECL_INITIAL (decl) != 0));
2938 put_reg_into_stack (0, reg, type, GET_MODE (reg), GET_MODE (reg),
2939 volatile_p, ADDRESSOF_REGNO (r), used_p, ht);
2942 /* List of replacements made below in purge_addressof_1 when creating
2943 bitfield insertions. */
2944 static rtx purge_bitfield_addressof_replacements;
2946 /* List of replacements made below in purge_addressof_1 for patterns
2947 (MEM (ADDRESSOF (REG ...))). The key of the list entry is the
2948 corresponding (ADDRESSOF (REG ...)) and value is a substitution for
2949 the all pattern. List PURGE_BITFIELD_ADDRESSOF_REPLACEMENTS is not
2950 enough in complex cases, e.g. when some field values can be
2951 extracted by usage MEM with narrower mode. */
2952 static rtx purge_addressof_replacements;
2954 /* Helper function for purge_addressof. See if the rtx expression at *LOC
2955 in INSN needs to be changed. If FORCE, always put any ADDRESSOFs into
2956 the stack. If the function returns FALSE then the replacement could not
2960 purge_addressof_1 (loc, insn, force, store, ht)
2964 struct hash_table *ht;
2972 /* Re-start here to avoid recursion in common cases. */
2979 code = GET_CODE (x);
2981 /* If we don't return in any of the cases below, we will recurse inside
2982 the RTX, which will normally result in any ADDRESSOF being forced into
2986 result = purge_addressof_1 (&SET_DEST (x), insn, force, 1, ht);
2987 result &= purge_addressof_1 (&SET_SRC (x), insn, force, 0, ht);
2990 else if (code == ADDRESSOF)
2994 if (GET_CODE (XEXP (x, 0)) != MEM)
2996 put_addressof_into_stack (x, ht);
3000 /* We must create a copy of the rtx because it was created by
3001 overwriting a REG rtx which is always shared. */
3002 sub = copy_rtx (XEXP (XEXP (x, 0), 0));
3003 if (validate_change (insn, loc, sub, 0)
3004 || validate_replace_rtx (x, sub, insn))
3008 sub = force_operand (sub, NULL_RTX);
3009 if (! validate_change (insn, loc, sub, 0)
3010 && ! validate_replace_rtx (x, sub, insn))
3013 insns = gen_sequence ();
3015 emit_insn_before (insns, insn);
3019 else if (code == MEM && GET_CODE (XEXP (x, 0)) == ADDRESSOF && ! force)
3021 rtx sub = XEXP (XEXP (x, 0), 0);
3023 if (GET_CODE (sub) == MEM)
3024 sub = adjust_address_nv (sub, GET_MODE (x), 0);
3025 else if (GET_CODE (sub) == REG
3026 && (MEM_VOLATILE_P (x) || GET_MODE (x) == BLKmode))
3028 else if (GET_CODE (sub) == REG && GET_MODE (x) != GET_MODE (sub))
3030 int size_x, size_sub;
3034 /* When processing REG_NOTES look at the list of
3035 replacements done on the insn to find the register that X
3039 for (tem = purge_bitfield_addressof_replacements;
3041 tem = XEXP (XEXP (tem, 1), 1))
3042 if (rtx_equal_p (x, XEXP (tem, 0)))
3044 *loc = XEXP (XEXP (tem, 1), 0);
3048 /* See comment for purge_addressof_replacements. */
3049 for (tem = purge_addressof_replacements;
3051 tem = XEXP (XEXP (tem, 1), 1))
3052 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3054 rtx z = XEXP (XEXP (tem, 1), 0);
3056 if (GET_MODE (x) == GET_MODE (z)
3057 || (GET_CODE (XEXP (XEXP (tem, 1), 0)) != REG
3058 && GET_CODE (XEXP (XEXP (tem, 1), 0)) != SUBREG))
3061 /* It can happen that the note may speak of things
3062 in a wider (or just different) mode than the
3063 code did. This is especially true of
3066 if (GET_CODE (z) == SUBREG && SUBREG_BYTE (z) == 0)
3069 if (GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD
3070 && (GET_MODE_SIZE (GET_MODE (x))
3071 > GET_MODE_SIZE (GET_MODE (z))))
3073 /* This can occur as a result in invalid
3074 pointer casts, e.g. float f; ...
3075 *(long long int *)&f.
3076 ??? We could emit a warning here, but
3077 without a line number that wouldn't be
3079 z = gen_rtx_SUBREG (GET_MODE (x), z, 0);
3082 z = gen_lowpart (GET_MODE (x), z);
3088 /* Sometimes we may not be able to find the replacement. For
3089 example when the original insn was a MEM in a wider mode,
3090 and the note is part of a sign extension of a narrowed
3091 version of that MEM. Gcc testcase compile/990829-1.c can
3092 generate an example of this siutation. Rather than complain
3093 we return false, which will prompt our caller to remove the
3098 size_x = GET_MODE_BITSIZE (GET_MODE (x));
3099 size_sub = GET_MODE_BITSIZE (GET_MODE (sub));
3101 /* Don't even consider working with paradoxical subregs,
3102 or the moral equivalent seen here. */
3103 if (size_x <= size_sub
3104 && int_mode_for_mode (GET_MODE (sub)) != BLKmode)
3106 /* Do a bitfield insertion to mirror what would happen
3113 rtx p = PREV_INSN (insn);
3116 val = gen_reg_rtx (GET_MODE (x));
3117 if (! validate_change (insn, loc, val, 0))
3119 /* Discard the current sequence and put the
3120 ADDRESSOF on stack. */
3124 seq = gen_sequence ();
3126 emit_insn_before (seq, insn);
3127 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3131 store_bit_field (sub, size_x, 0, GET_MODE (x),
3132 val, GET_MODE_SIZE (GET_MODE (sub)),
3133 GET_MODE_ALIGNMENT (GET_MODE (sub)));
3135 /* Make sure to unshare any shared rtl that store_bit_field
3136 might have created. */
3137 unshare_all_rtl_again (get_insns ());
3139 seq = gen_sequence ();
3141 p = emit_insn_after (seq, insn);
3142 if (NEXT_INSN (insn))
3143 compute_insns_for_mem (NEXT_INSN (insn),
3144 p ? NEXT_INSN (p) : NULL_RTX,
3149 rtx p = PREV_INSN (insn);
3152 val = extract_bit_field (sub, size_x, 0, 1, NULL_RTX,
3153 GET_MODE (x), GET_MODE (x),
3154 GET_MODE_SIZE (GET_MODE (sub)),
3155 GET_MODE_SIZE (GET_MODE (sub)));
3157 if (! validate_change (insn, loc, val, 0))
3159 /* Discard the current sequence and put the
3160 ADDRESSOF on stack. */
3165 seq = gen_sequence ();
3167 emit_insn_before (seq, insn);
3168 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3172 /* Remember the replacement so that the same one can be done
3173 on the REG_NOTES. */
3174 purge_bitfield_addressof_replacements
3175 = gen_rtx_EXPR_LIST (VOIDmode, x,
3178 purge_bitfield_addressof_replacements));
3180 /* We replaced with a reg -- all done. */
3185 else if (validate_change (insn, loc, sub, 0))
3187 /* Remember the replacement so that the same one can be done
3188 on the REG_NOTES. */
3189 if (GET_CODE (sub) == REG || GET_CODE (sub) == SUBREG)
3193 for (tem = purge_addressof_replacements;
3195 tem = XEXP (XEXP (tem, 1), 1))
3196 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3198 XEXP (XEXP (tem, 1), 0) = sub;
3201 purge_addressof_replacements
3202 = gen_rtx (EXPR_LIST, VOIDmode, XEXP (x, 0),
3203 gen_rtx_EXPR_LIST (VOIDmode, sub,
3204 purge_addressof_replacements));
3212 /* Scan all subexpressions. */
3213 fmt = GET_RTX_FORMAT (code);
3214 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
3217 result &= purge_addressof_1 (&XEXP (x, i), insn, force, 0, ht);
3218 else if (*fmt == 'E')
3219 for (j = 0; j < XVECLEN (x, i); j++)
3220 result &= purge_addressof_1 (&XVECEXP (x, i, j), insn, force, 0, ht);
3226 /* Return a new hash table entry in HT. */
3228 static struct hash_entry *
3229 insns_for_mem_newfunc (he, ht, k)
3230 struct hash_entry *he;
3231 struct hash_table *ht;
3232 hash_table_key k ATTRIBUTE_UNUSED;
3234 struct insns_for_mem_entry *ifmhe;
3238 ifmhe = ((struct insns_for_mem_entry *)
3239 hash_allocate (ht, sizeof (struct insns_for_mem_entry)));
3240 ifmhe->insns = NULL_RTX;
3245 /* Return a hash value for K, a REG. */
3247 static unsigned long
3248 insns_for_mem_hash (k)
3251 /* K is really a RTX. Just use the address as the hash value. */
3252 return (unsigned long) k;
3255 /* Return non-zero if K1 and K2 (two REGs) are the same. */
3258 insns_for_mem_comp (k1, k2)
3265 struct insns_for_mem_walk_info {
3266 /* The hash table that we are using to record which INSNs use which
3268 struct hash_table *ht;
3270 /* The INSN we are currently proessing. */
3273 /* Zero if we are walking to find ADDRESSOFs, one if we are walking
3274 to find the insns that use the REGs in the ADDRESSOFs. */
3278 /* Called from compute_insns_for_mem via for_each_rtx. If R is a REG
3279 that might be used in an ADDRESSOF expression, record this INSN in
3280 the hash table given by DATA (which is really a pointer to an
3281 insns_for_mem_walk_info structure). */
3284 insns_for_mem_walk (r, data)
3288 struct insns_for_mem_walk_info *ifmwi
3289 = (struct insns_for_mem_walk_info *) data;
3291 if (ifmwi->pass == 0 && *r && GET_CODE (*r) == ADDRESSOF
3292 && GET_CODE (XEXP (*r, 0)) == REG)
3293 hash_lookup (ifmwi->ht, XEXP (*r, 0), /*create=*/1, /*copy=*/0);
3294 else if (ifmwi->pass == 1 && *r && GET_CODE (*r) == REG)
3296 /* Lookup this MEM in the hashtable, creating it if necessary. */
3297 struct insns_for_mem_entry *ifme
3298 = (struct insns_for_mem_entry *) hash_lookup (ifmwi->ht,
3303 /* If we have not already recorded this INSN, do so now. Since
3304 we process the INSNs in order, we know that if we have
3305 recorded it it must be at the front of the list. */
3306 if (ifme && (!ifme->insns || XEXP (ifme->insns, 0) != ifmwi->insn))
3307 ifme->insns = gen_rtx_EXPR_LIST (VOIDmode, ifmwi->insn,
3314 /* Walk the INSNS, until we reach LAST_INSN, recording which INSNs use
3315 which REGs in HT. */
3318 compute_insns_for_mem (insns, last_insn, ht)
3321 struct hash_table *ht;
3324 struct insns_for_mem_walk_info ifmwi;
3327 for (ifmwi.pass = 0; ifmwi.pass < 2; ++ifmwi.pass)
3328 for (insn = insns; insn != last_insn; insn = NEXT_INSN (insn))
3332 for_each_rtx (&insn, insns_for_mem_walk, &ifmwi);
3336 /* Helper function for purge_addressof called through for_each_rtx.
3337 Returns true iff the rtl is an ADDRESSOF. */
3340 is_addressof (rtl, data)
3342 void *data ATTRIBUTE_UNUSED;
3344 return GET_CODE (*rtl) == ADDRESSOF;
3347 /* Eliminate all occurrences of ADDRESSOF from INSNS. Elide any remaining
3348 (MEM (ADDRESSOF)) patterns, and force any needed registers into the
3352 purge_addressof (insns)
3356 struct hash_table ht;
3358 /* When we actually purge ADDRESSOFs, we turn REGs into MEMs. That
3359 requires a fixup pass over the instruction stream to correct
3360 INSNs that depended on the REG being a REG, and not a MEM. But,
3361 these fixup passes are slow. Furthermore, most MEMs are not
3362 mentioned in very many instructions. So, we speed up the process
3363 by pre-calculating which REGs occur in which INSNs; that allows
3364 us to perform the fixup passes much more quickly. */
3365 hash_table_init (&ht,
3366 insns_for_mem_newfunc,
3368 insns_for_mem_comp);
3369 compute_insns_for_mem (insns, NULL_RTX, &ht);
3371 for (insn = insns; insn; insn = NEXT_INSN (insn))
3372 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
3373 || GET_CODE (insn) == CALL_INSN)
3375 if (! purge_addressof_1 (&PATTERN (insn), insn,
3376 asm_noperands (PATTERN (insn)) > 0, 0, &ht))
3377 /* If we could not replace the ADDRESSOFs in the insn,
3378 something is wrong. */
3381 if (! purge_addressof_1 (®_NOTES (insn), NULL_RTX, 0, 0, &ht))
3383 /* If we could not replace the ADDRESSOFs in the insn's notes,
3384 we can just remove the offending notes instead. */
3387 for (note = REG_NOTES (insn); note; note = XEXP (note, 1))
3389 /* If we find a REG_RETVAL note then the insn is a libcall.
3390 Such insns must have REG_EQUAL notes as well, in order
3391 for later passes of the compiler to work. So it is not
3392 safe to delete the notes here, and instead we abort. */
3393 if (REG_NOTE_KIND (note) == REG_RETVAL)
3395 if (for_each_rtx (¬e, is_addressof, NULL))
3396 remove_note (insn, note);
3402 hash_table_free (&ht);
3403 purge_bitfield_addressof_replacements = 0;
3404 purge_addressof_replacements = 0;
3406 /* REGs are shared. purge_addressof will destructively replace a REG
3407 with a MEM, which creates shared MEMs.
3409 Unfortunately, the children of put_reg_into_stack assume that MEMs
3410 referring to the same stack slot are shared (fixup_var_refs and
3411 the associated hash table code).
3413 So, we have to do another unsharing pass after we have flushed any
3414 REGs that had their address taken into the stack.
3416 It may be worth tracking whether or not we converted any REGs into
3417 MEMs to avoid this overhead when it is not needed. */
3418 unshare_all_rtl_again (get_insns ());
3421 /* Convert a SET of a hard subreg to a set of the appropriet hard
3422 register. A subroutine of purge_hard_subreg_sets. */
3425 purge_single_hard_subreg_set (pattern)
3428 rtx reg = SET_DEST (pattern);
3429 enum machine_mode mode = GET_MODE (SET_DEST (pattern));
3432 if (GET_CODE (reg) == SUBREG && GET_CODE (SUBREG_REG (reg)) == REG
3433 && REGNO (SUBREG_REG (reg)) < FIRST_PSEUDO_REGISTER)
3435 offset = subreg_regno_offset (REGNO (SUBREG_REG (reg)),
3436 GET_MODE (SUBREG_REG (reg)),
3439 reg = SUBREG_REG (reg);
3443 if (GET_CODE (reg) == REG && REGNO (reg) < FIRST_PSEUDO_REGISTER)
3445 reg = gen_rtx_REG (mode, REGNO (reg) + offset);
3446 SET_DEST (pattern) = reg;
3450 /* Eliminate all occurrences of SETs of hard subregs from INSNS. The
3451 only such SETs that we expect to see are those left in because
3452 integrate can't handle sets of parts of a return value register.
3454 We don't use alter_subreg because we only want to eliminate subregs
3455 of hard registers. */
3458 purge_hard_subreg_sets (insn)
3461 for (; insn; insn = NEXT_INSN (insn))
3465 rtx pattern = PATTERN (insn);
3466 switch (GET_CODE (pattern))
3469 if (GET_CODE (SET_DEST (pattern)) == SUBREG)
3470 purge_single_hard_subreg_set (pattern);
3475 for (j = XVECLEN (pattern, 0) - 1; j >= 0; j--)
3477 rtx inner_pattern = XVECEXP (pattern, 0, j);
3478 if (GET_CODE (inner_pattern) == SET
3479 && GET_CODE (SET_DEST (inner_pattern)) == SUBREG)
3480 purge_single_hard_subreg_set (inner_pattern);
3491 /* Pass through the INSNS of function FNDECL and convert virtual register
3492 references to hard register references. */
3495 instantiate_virtual_regs (fndecl, insns)
3502 /* Compute the offsets to use for this function. */
3503 in_arg_offset = FIRST_PARM_OFFSET (fndecl);
3504 var_offset = STARTING_FRAME_OFFSET;
3505 dynamic_offset = STACK_DYNAMIC_OFFSET (fndecl);
3506 out_arg_offset = STACK_POINTER_OFFSET;
3507 cfa_offset = ARG_POINTER_CFA_OFFSET (fndecl);
3509 /* Scan all variables and parameters of this function. For each that is
3510 in memory, instantiate all virtual registers if the result is a valid
3511 address. If not, we do it later. That will handle most uses of virtual
3512 regs on many machines. */
3513 instantiate_decls (fndecl, 1);
3515 /* Initialize recognition, indicating that volatile is OK. */
3518 /* Scan through all the insns, instantiating every virtual register still
3520 for (insn = insns; insn; insn = NEXT_INSN (insn))
3521 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
3522 || GET_CODE (insn) == CALL_INSN)
3524 instantiate_virtual_regs_1 (&PATTERN (insn), insn, 1);
3525 instantiate_virtual_regs_1 (®_NOTES (insn), NULL_RTX, 0);
3526 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
3527 if (GET_CODE (insn) == CALL_INSN)
3528 instantiate_virtual_regs_1 (&CALL_INSN_FUNCTION_USAGE (insn),
3532 /* Instantiate the stack slots for the parm registers, for later use in
3533 addressof elimination. */
3534 for (i = 0; i < max_parm_reg; ++i)
3535 if (parm_reg_stack_loc[i])
3536 instantiate_virtual_regs_1 (&parm_reg_stack_loc[i], NULL_RTX, 0);
3538 /* Now instantiate the remaining register equivalences for debugging info.
3539 These will not be valid addresses. */
3540 instantiate_decls (fndecl, 0);
3542 /* Indicate that, from now on, assign_stack_local should use
3543 frame_pointer_rtx. */
3544 virtuals_instantiated = 1;
3547 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
3548 all virtual registers in their DECL_RTL's.
3550 If VALID_ONLY, do this only if the resulting address is still valid.
3551 Otherwise, always do it. */
3554 instantiate_decls (fndecl, valid_only)
3560 /* Process all parameters of the function. */
3561 for (decl = DECL_ARGUMENTS (fndecl); decl; decl = TREE_CHAIN (decl))
3563 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (decl));
3564 HOST_WIDE_INT size_rtl;
3566 instantiate_decl (DECL_RTL (decl), size, valid_only);
3568 /* If the parameter was promoted, then the incoming RTL mode may be
3569 larger than the declared type size. We must use the larger of
3571 size_rtl = GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl)));
3572 size = MAX (size_rtl, size);
3573 instantiate_decl (DECL_INCOMING_RTL (decl), size, valid_only);
3576 /* Now process all variables defined in the function or its subblocks. */
3577 instantiate_decls_1 (DECL_INITIAL (fndecl), valid_only);
3580 /* Subroutine of instantiate_decls: Process all decls in the given
3581 BLOCK node and all its subblocks. */
3584 instantiate_decls_1 (let, valid_only)
3590 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
3591 if (DECL_RTL_SET_P (t))
3592 instantiate_decl (DECL_RTL (t),
3593 int_size_in_bytes (TREE_TYPE (t)),
3596 /* Process all subblocks. */
3597 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
3598 instantiate_decls_1 (t, valid_only);
3601 /* Subroutine of the preceding procedures: Given RTL representing a
3602 decl and the size of the object, do any instantiation required.
3604 If VALID_ONLY is non-zero, it means that the RTL should only be
3605 changed if the new address is valid. */
3608 instantiate_decl (x, size, valid_only)
3613 enum machine_mode mode;
3616 /* If this is not a MEM, no need to do anything. Similarly if the
3617 address is a constant or a register that is not a virtual register. */
3619 if (x == 0 || GET_CODE (x) != MEM)
3623 if (CONSTANT_P (addr)
3624 || (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == REG)
3625 || (GET_CODE (addr) == REG
3626 && (REGNO (addr) < FIRST_VIRTUAL_REGISTER
3627 || REGNO (addr) > LAST_VIRTUAL_REGISTER)))
3630 /* If we should only do this if the address is valid, copy the address.
3631 We need to do this so we can undo any changes that might make the
3632 address invalid. This copy is unfortunate, but probably can't be
3636 addr = copy_rtx (addr);
3638 instantiate_virtual_regs_1 (&addr, NULL_RTX, 0);
3640 if (valid_only && size >= 0)
3642 unsigned HOST_WIDE_INT decl_size = size;
3644 /* Now verify that the resulting address is valid for every integer or
3645 floating-point mode up to and including SIZE bytes long. We do this
3646 since the object might be accessed in any mode and frame addresses
3649 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3650 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3651 mode = GET_MODE_WIDER_MODE (mode))
3652 if (! memory_address_p (mode, addr))
3655 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
3656 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3657 mode = GET_MODE_WIDER_MODE (mode))
3658 if (! memory_address_p (mode, addr))
3662 /* Put back the address now that we have updated it and we either know
3663 it is valid or we don't care whether it is valid. */
3668 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
3669 is a virtual register, return the requivalent hard register and set the
3670 offset indirectly through the pointer. Otherwise, return 0. */
3673 instantiate_new_reg (x, poffset)
3675 HOST_WIDE_INT *poffset;
3678 HOST_WIDE_INT offset;
3680 if (x == virtual_incoming_args_rtx)
3681 new = arg_pointer_rtx, offset = in_arg_offset;
3682 else if (x == virtual_stack_vars_rtx)
3683 new = frame_pointer_rtx, offset = var_offset;
3684 else if (x == virtual_stack_dynamic_rtx)
3685 new = stack_pointer_rtx, offset = dynamic_offset;
3686 else if (x == virtual_outgoing_args_rtx)
3687 new = stack_pointer_rtx, offset = out_arg_offset;
3688 else if (x == virtual_cfa_rtx)
3689 new = arg_pointer_rtx, offset = cfa_offset;
3697 /* Given a pointer to a piece of rtx and an optional pointer to the
3698 containing object, instantiate any virtual registers present in it.
3700 If EXTRA_INSNS, we always do the replacement and generate
3701 any extra insns before OBJECT. If it zero, we do nothing if replacement
3704 Return 1 if we either had nothing to do or if we were able to do the
3705 needed replacement. Return 0 otherwise; we only return zero if
3706 EXTRA_INSNS is zero.
3708 We first try some simple transformations to avoid the creation of extra
3712 instantiate_virtual_regs_1 (loc, object, extra_insns)
3720 HOST_WIDE_INT offset = 0;
3726 /* Re-start here to avoid recursion in common cases. */
3733 code = GET_CODE (x);
3735 /* Check for some special cases. */
3752 /* We are allowed to set the virtual registers. This means that
3753 the actual register should receive the source minus the
3754 appropriate offset. This is used, for example, in the handling
3755 of non-local gotos. */
3756 if ((new = instantiate_new_reg (SET_DEST (x), &offset)) != 0)
3758 rtx src = SET_SRC (x);
3760 /* We are setting the register, not using it, so the relevant
3761 offset is the negative of the offset to use were we using
3764 instantiate_virtual_regs_1 (&src, NULL_RTX, 0);
3766 /* The only valid sources here are PLUS or REG. Just do
3767 the simplest possible thing to handle them. */
3768 if (GET_CODE (src) != REG && GET_CODE (src) != PLUS)
3772 if (GET_CODE (src) != REG)
3773 temp = force_operand (src, NULL_RTX);
3776 temp = force_operand (plus_constant (temp, offset), NULL_RTX);
3780 emit_insns_before (seq, object);
3783 if (! validate_change (object, &SET_SRC (x), temp, 0)
3790 instantiate_virtual_regs_1 (&SET_DEST (x), object, extra_insns);
3795 /* Handle special case of virtual register plus constant. */
3796 if (CONSTANT_P (XEXP (x, 1)))
3798 rtx old, new_offset;
3800 /* Check for (plus (plus VIRT foo) (const_int)) first. */
3801 if (GET_CODE (XEXP (x, 0)) == PLUS)
3803 if ((new = instantiate_new_reg (XEXP (XEXP (x, 0), 0), &offset)))
3805 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 1), object,
3807 new = gen_rtx_PLUS (Pmode, new, XEXP (XEXP (x, 0), 1));
3816 #ifdef POINTERS_EXTEND_UNSIGNED
3817 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
3818 we can commute the PLUS and SUBREG because pointers into the
3819 frame are well-behaved. */
3820 else if (GET_CODE (XEXP (x, 0)) == SUBREG && GET_MODE (x) == ptr_mode
3821 && GET_CODE (XEXP (x, 1)) == CONST_INT
3823 = instantiate_new_reg (SUBREG_REG (XEXP (x, 0)),
3825 && validate_change (object, loc,
3826 plus_constant (gen_lowpart (ptr_mode,
3829 + INTVAL (XEXP (x, 1))),
3833 else if ((new = instantiate_new_reg (XEXP (x, 0), &offset)) == 0)
3835 /* We know the second operand is a constant. Unless the
3836 first operand is a REG (which has been already checked),
3837 it needs to be checked. */
3838 if (GET_CODE (XEXP (x, 0)) != REG)
3846 new_offset = plus_constant (XEXP (x, 1), offset);
3848 /* If the new constant is zero, try to replace the sum with just
3850 if (new_offset == const0_rtx
3851 && validate_change (object, loc, new, 0))
3854 /* Next try to replace the register and new offset.
3855 There are two changes to validate here and we can't assume that
3856 in the case of old offset equals new just changing the register
3857 will yield a valid insn. In the interests of a little efficiency,
3858 however, we only call validate change once (we don't queue up the
3859 changes and then call apply_change_group). */
3863 ? ! validate_change (object, &XEXP (x, 0), new, 0)
3864 : (XEXP (x, 0) = new,
3865 ! validate_change (object, &XEXP (x, 1), new_offset, 0)))
3873 /* Otherwise copy the new constant into a register and replace
3874 constant with that register. */
3875 temp = gen_reg_rtx (Pmode);
3877 if (validate_change (object, &XEXP (x, 1), temp, 0))
3878 emit_insn_before (gen_move_insn (temp, new_offset), object);
3881 /* If that didn't work, replace this expression with a
3882 register containing the sum. */
3885 new = gen_rtx_PLUS (Pmode, new, new_offset);
3888 temp = force_operand (new, NULL_RTX);
3892 emit_insns_before (seq, object);
3893 if (! validate_change (object, loc, temp, 0)
3894 && ! validate_replace_rtx (x, temp, object))
3902 /* Fall through to generic two-operand expression case. */
3908 case DIV: case UDIV:
3909 case MOD: case UMOD:
3910 case AND: case IOR: case XOR:
3911 case ROTATERT: case ROTATE:
3912 case ASHIFTRT: case LSHIFTRT: case ASHIFT:
3914 case GE: case GT: case GEU: case GTU:
3915 case LE: case LT: case LEU: case LTU:
3916 if (XEXP (x, 1) && ! CONSTANT_P (XEXP (x, 1)))
3917 instantiate_virtual_regs_1 (&XEXP (x, 1), object, extra_insns);
3922 /* Most cases of MEM that convert to valid addresses have already been
3923 handled by our scan of decls. The only special handling we
3924 need here is to make a copy of the rtx to ensure it isn't being
3925 shared if we have to change it to a pseudo.
3927 If the rtx is a simple reference to an address via a virtual register,
3928 it can potentially be shared. In such cases, first try to make it
3929 a valid address, which can also be shared. Otherwise, copy it and
3932 First check for common cases that need no processing. These are
3933 usually due to instantiation already being done on a previous instance
3937 if (CONSTANT_ADDRESS_P (temp)
3938 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3939 || temp == arg_pointer_rtx
3941 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3942 || temp == hard_frame_pointer_rtx
3944 || temp == frame_pointer_rtx)
3947 if (GET_CODE (temp) == PLUS
3948 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
3949 && (XEXP (temp, 0) == frame_pointer_rtx
3950 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3951 || XEXP (temp, 0) == hard_frame_pointer_rtx
3953 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3954 || XEXP (temp, 0) == arg_pointer_rtx
3959 if (temp == virtual_stack_vars_rtx
3960 || temp == virtual_incoming_args_rtx
3961 || (GET_CODE (temp) == PLUS
3962 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
3963 && (XEXP (temp, 0) == virtual_stack_vars_rtx
3964 || XEXP (temp, 0) == virtual_incoming_args_rtx)))
3966 /* This MEM may be shared. If the substitution can be done without
3967 the need to generate new pseudos, we want to do it in place
3968 so all copies of the shared rtx benefit. The call below will
3969 only make substitutions if the resulting address is still
3972 Note that we cannot pass X as the object in the recursive call
3973 since the insn being processed may not allow all valid
3974 addresses. However, if we were not passed on object, we can
3975 only modify X without copying it if X will have a valid
3978 ??? Also note that this can still lose if OBJECT is an insn that
3979 has less restrictions on an address that some other insn.
3980 In that case, we will modify the shared address. This case
3981 doesn't seem very likely, though. One case where this could
3982 happen is in the case of a USE or CLOBBER reference, but we
3983 take care of that below. */
3985 if (instantiate_virtual_regs_1 (&XEXP (x, 0),
3986 object ? object : x, 0))
3989 /* Otherwise make a copy and process that copy. We copy the entire
3990 RTL expression since it might be a PLUS which could also be
3992 *loc = x = copy_rtx (x);
3995 /* Fall through to generic unary operation case. */
3997 case STRICT_LOW_PART:
3999 case PRE_DEC: case PRE_INC: case POST_DEC: case POST_INC:
4000 case SIGN_EXTEND: case ZERO_EXTEND:
4001 case TRUNCATE: case FLOAT_EXTEND: case FLOAT_TRUNCATE:
4002 case FLOAT: case FIX:
4003 case UNSIGNED_FIX: case UNSIGNED_FLOAT:
4007 /* These case either have just one operand or we know that we need not
4008 check the rest of the operands. */
4014 /* If the operand is a MEM, see if the change is a valid MEM. If not,
4015 go ahead and make the invalid one, but do it to a copy. For a REG,
4016 just make the recursive call, since there's no chance of a problem. */
4018 if ((GET_CODE (XEXP (x, 0)) == MEM
4019 && instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), XEXP (x, 0),
4021 || (GET_CODE (XEXP (x, 0)) == REG
4022 && instantiate_virtual_regs_1 (&XEXP (x, 0), object, 0)))
4025 XEXP (x, 0) = copy_rtx (XEXP (x, 0));
4030 /* Try to replace with a PLUS. If that doesn't work, compute the sum
4031 in front of this insn and substitute the temporary. */
4032 if ((new = instantiate_new_reg (x, &offset)) != 0)
4034 temp = plus_constant (new, offset);
4035 if (!validate_change (object, loc, temp, 0))
4041 temp = force_operand (temp, NULL_RTX);
4045 emit_insns_before (seq, object);
4046 if (! validate_change (object, loc, temp, 0)
4047 && ! validate_replace_rtx (x, temp, object))
4055 if (GET_CODE (XEXP (x, 0)) == REG)
4058 else if (GET_CODE (XEXP (x, 0)) == MEM)
4060 /* If we have a (addressof (mem ..)), do any instantiation inside
4061 since we know we'll be making the inside valid when we finally
4062 remove the ADDRESSOF. */
4063 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), NULL_RTX, 0);
4072 /* Scan all subexpressions. */
4073 fmt = GET_RTX_FORMAT (code);
4074 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
4077 if (!instantiate_virtual_regs_1 (&XEXP (x, i), object, extra_insns))
4080 else if (*fmt == 'E')
4081 for (j = 0; j < XVECLEN (x, i); j++)
4082 if (! instantiate_virtual_regs_1 (&XVECEXP (x, i, j), object,
4089 /* Optimization: assuming this function does not receive nonlocal gotos,
4090 delete the handlers for such, as well as the insns to establish
4091 and disestablish them. */
4097 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4099 /* Delete the handler by turning off the flag that would
4100 prevent jump_optimize from deleting it.
4101 Also permit deletion of the nonlocal labels themselves
4102 if nothing local refers to them. */
4103 if (GET_CODE (insn) == CODE_LABEL)
4107 LABEL_PRESERVE_P (insn) = 0;
4109 /* Remove it from the nonlocal_label list, to avoid confusing
4111 for (t = nonlocal_labels, last_t = 0; t;
4112 last_t = t, t = TREE_CHAIN (t))
4113 if (DECL_RTL (TREE_VALUE (t)) == insn)
4118 nonlocal_labels = TREE_CHAIN (nonlocal_labels);
4120 TREE_CHAIN (last_t) = TREE_CHAIN (t);
4123 if (GET_CODE (insn) == INSN)
4127 for (t = nonlocal_goto_handler_slots; t != 0; t = XEXP (t, 1))
4128 if (reg_mentioned_p (t, PATTERN (insn)))
4134 || (nonlocal_goto_stack_level != 0
4135 && reg_mentioned_p (nonlocal_goto_stack_level,
4145 return max_parm_reg;
4148 /* Return the first insn following those generated by `assign_parms'. */
4151 get_first_nonparm_insn ()
4154 return NEXT_INSN (last_parm_insn);
4155 return get_insns ();
4158 /* Return the first NOTE_INSN_BLOCK_BEG note in the function.
4159 Crash if there is none. */
4162 get_first_block_beg ()
4164 register rtx searcher;
4165 register rtx insn = get_first_nonparm_insn ();
4167 for (searcher = insn; searcher; searcher = NEXT_INSN (searcher))
4168 if (GET_CODE (searcher) == NOTE
4169 && NOTE_LINE_NUMBER (searcher) == NOTE_INSN_BLOCK_BEG)
4172 abort (); /* Invalid call to this function. (See comments above.) */
4176 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
4177 This means a type for which function calls must pass an address to the
4178 function or get an address back from the function.
4179 EXP may be a type node or an expression (whose type is tested). */
4182 aggregate_value_p (exp)
4185 int i, regno, nregs;
4188 tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
4190 if (TREE_CODE (type) == VOID_TYPE)
4192 if (RETURN_IN_MEMORY (type))
4194 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
4195 and thus can't be returned in registers. */
4196 if (TREE_ADDRESSABLE (type))
4198 if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
4200 /* Make sure we have suitable call-clobbered regs to return
4201 the value in; if not, we must return it in memory. */
4202 reg = hard_function_value (type, 0, 0);
4204 /* If we have something other than a REG (e.g. a PARALLEL), then assume
4206 if (GET_CODE (reg) != REG)
4209 regno = REGNO (reg);
4210 nregs = HARD_REGNO_NREGS (regno, TYPE_MODE (type));
4211 for (i = 0; i < nregs; i++)
4212 if (! call_used_regs[regno + i])
4217 /* Assign RTL expressions to the function's parameters.
4218 This may involve copying them into registers and using
4219 those registers as the RTL for them. */
4222 assign_parms (fndecl)
4226 register rtx entry_parm = 0;
4227 register rtx stack_parm = 0;
4228 CUMULATIVE_ARGS args_so_far;
4229 enum machine_mode promoted_mode, passed_mode;
4230 enum machine_mode nominal_mode, promoted_nominal_mode;
4232 /* Total space needed so far for args on the stack,
4233 given as a constant and a tree-expression. */
4234 struct args_size stack_args_size;
4235 tree fntype = TREE_TYPE (fndecl);
4236 tree fnargs = DECL_ARGUMENTS (fndecl);
4237 /* This is used for the arg pointer when referring to stack args. */
4238 rtx internal_arg_pointer;
4239 /* This is a dummy PARM_DECL that we used for the function result if
4240 the function returns a structure. */
4241 tree function_result_decl = 0;
4242 #ifdef SETUP_INCOMING_VARARGS
4243 int varargs_setup = 0;
4245 rtx conversion_insns = 0;
4246 struct args_size alignment_pad;
4248 /* Nonzero if the last arg is named `__builtin_va_alist',
4249 which is used on some machines for old-fashioned non-ANSI varargs.h;
4250 this should be stuck onto the stack as if it had arrived there. */
4252 = (current_function_varargs
4254 && (parm = tree_last (fnargs)) != 0
4256 && (! strcmp (IDENTIFIER_POINTER (DECL_NAME (parm)),
4257 "__builtin_va_alist")));
4259 /* Nonzero if function takes extra anonymous args.
4260 This means the last named arg must be on the stack
4261 right before the anonymous ones. */
4263 = (TYPE_ARG_TYPES (fntype) != 0
4264 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
4265 != void_type_node));
4267 current_function_stdarg = stdarg;
4269 /* If the reg that the virtual arg pointer will be translated into is
4270 not a fixed reg or is the stack pointer, make a copy of the virtual
4271 arg pointer, and address parms via the copy. The frame pointer is
4272 considered fixed even though it is not marked as such.
4274 The second time through, simply use ap to avoid generating rtx. */
4276 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
4277 || ! (fixed_regs[ARG_POINTER_REGNUM]
4278 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
4279 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
4281 internal_arg_pointer = virtual_incoming_args_rtx;
4282 current_function_internal_arg_pointer = internal_arg_pointer;
4284 stack_args_size.constant = 0;
4285 stack_args_size.var = 0;
4287 /* If struct value address is treated as the first argument, make it so. */
4288 if (aggregate_value_p (DECL_RESULT (fndecl))
4289 && ! current_function_returns_pcc_struct
4290 && struct_value_incoming_rtx == 0)
4292 tree type = build_pointer_type (TREE_TYPE (fntype));
4294 function_result_decl = build_decl (PARM_DECL, NULL_TREE, type);
4296 DECL_ARG_TYPE (function_result_decl) = type;
4297 TREE_CHAIN (function_result_decl) = fnargs;
4298 fnargs = function_result_decl;
4301 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
4302 parm_reg_stack_loc = (rtx *) xcalloc (max_parm_reg, sizeof (rtx));
4304 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
4305 INIT_CUMULATIVE_INCOMING_ARGS (args_so_far, fntype, NULL_RTX);
4307 INIT_CUMULATIVE_ARGS (args_so_far, fntype, NULL_RTX, 0);
4310 /* We haven't yet found an argument that we must push and pretend the
4312 current_function_pretend_args_size = 0;
4314 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
4316 struct args_size stack_offset;
4317 struct args_size arg_size;
4318 int passed_pointer = 0;
4319 int did_conversion = 0;
4320 tree passed_type = DECL_ARG_TYPE (parm);
4321 tree nominal_type = TREE_TYPE (parm);
4324 /* Set LAST_NAMED if this is last named arg before some
4326 int last_named = ((TREE_CHAIN (parm) == 0
4327 || DECL_NAME (TREE_CHAIN (parm)) == 0)
4328 && (stdarg || current_function_varargs));
4329 /* Set NAMED_ARG if this arg should be treated as a named arg. For
4330 most machines, if this is a varargs/stdarg function, then we treat
4331 the last named arg as if it were anonymous too. */
4332 int named_arg = STRICT_ARGUMENT_NAMING ? 1 : ! last_named;
4334 if (TREE_TYPE (parm) == error_mark_node
4335 /* This can happen after weird syntax errors
4336 or if an enum type is defined among the parms. */
4337 || TREE_CODE (parm) != PARM_DECL
4338 || passed_type == NULL)
4340 SET_DECL_RTL (parm, gen_rtx_MEM (BLKmode, const0_rtx));
4341 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4342 TREE_USED (parm) = 1;
4346 /* For varargs.h function, save info about regs and stack space
4347 used by the individual args, not including the va_alist arg. */
4348 if (hide_last_arg && last_named)
4349 current_function_args_info = args_so_far;
4351 /* Find mode of arg as it is passed, and mode of arg
4352 as it should be during execution of this function. */
4353 passed_mode = TYPE_MODE (passed_type);
4354 nominal_mode = TYPE_MODE (nominal_type);
4356 /* If the parm's mode is VOID, its value doesn't matter,
4357 and avoid the usual things like emit_move_insn that could crash. */
4358 if (nominal_mode == VOIDmode)
4360 SET_DECL_RTL (parm, const0_rtx);
4361 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4365 /* If the parm is to be passed as a transparent union, use the
4366 type of the first field for the tests below. We have already
4367 verified that the modes are the same. */
4368 if (DECL_TRANSPARENT_UNION (parm)
4369 || (TREE_CODE (passed_type) == UNION_TYPE
4370 && TYPE_TRANSPARENT_UNION (passed_type)))
4371 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
4373 /* See if this arg was passed by invisible reference. It is if
4374 it is an object whose size depends on the contents of the
4375 object itself or if the machine requires these objects be passed
4378 if ((TREE_CODE (TYPE_SIZE (passed_type)) != INTEGER_CST
4379 && contains_placeholder_p (TYPE_SIZE (passed_type)))
4380 || TREE_ADDRESSABLE (passed_type)
4381 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
4382 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, passed_mode,
4383 passed_type, named_arg)
4387 passed_type = nominal_type = build_pointer_type (passed_type);
4389 passed_mode = nominal_mode = Pmode;
4392 promoted_mode = passed_mode;
4394 #ifdef PROMOTE_FUNCTION_ARGS
4395 /* Compute the mode in which the arg is actually extended to. */
4396 unsignedp = TREE_UNSIGNED (passed_type);
4397 promoted_mode = promote_mode (passed_type, promoted_mode, &unsignedp, 1);
4400 /* Let machine desc say which reg (if any) the parm arrives in.
4401 0 means it arrives on the stack. */
4402 #ifdef FUNCTION_INCOMING_ARG
4403 entry_parm = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4404 passed_type, named_arg);
4406 entry_parm = FUNCTION_ARG (args_so_far, promoted_mode,
4407 passed_type, named_arg);
4410 if (entry_parm == 0)
4411 promoted_mode = passed_mode;
4413 #ifdef SETUP_INCOMING_VARARGS
4414 /* If this is the last named parameter, do any required setup for
4415 varargs or stdargs. We need to know about the case of this being an
4416 addressable type, in which case we skip the registers it
4417 would have arrived in.
4419 For stdargs, LAST_NAMED will be set for two parameters, the one that
4420 is actually the last named, and the dummy parameter. We only
4421 want to do this action once.
4423 Also, indicate when RTL generation is to be suppressed. */
4424 if (last_named && !varargs_setup)
4426 SETUP_INCOMING_VARARGS (args_so_far, promoted_mode, passed_type,
4427 current_function_pretend_args_size, 0);
4432 /* Determine parm's home in the stack,
4433 in case it arrives in the stack or we should pretend it did.
4435 Compute the stack position and rtx where the argument arrives
4438 There is one complexity here: If this was a parameter that would
4439 have been passed in registers, but wasn't only because it is
4440 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
4441 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
4442 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
4443 0 as it was the previous time. */
4445 pretend_named = named_arg || PRETEND_OUTGOING_VARARGS_NAMED;
4446 locate_and_pad_parm (promoted_mode, passed_type,
4447 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4450 #ifdef FUNCTION_INCOMING_ARG
4451 FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4453 pretend_named) != 0,
4455 FUNCTION_ARG (args_so_far, promoted_mode,
4457 pretend_named) != 0,
4460 fndecl, &stack_args_size, &stack_offset, &arg_size,
4464 rtx offset_rtx = ARGS_SIZE_RTX (stack_offset);
4466 if (offset_rtx == const0_rtx)
4467 stack_parm = gen_rtx_MEM (promoted_mode, internal_arg_pointer);
4469 stack_parm = gen_rtx_MEM (promoted_mode,
4470 gen_rtx_PLUS (Pmode,
4471 internal_arg_pointer,
4474 set_mem_attributes (stack_parm, parm, 1);
4477 /* If this parameter was passed both in registers and in the stack,
4478 use the copy on the stack. */
4479 if (MUST_PASS_IN_STACK (promoted_mode, passed_type))
4482 #ifdef FUNCTION_ARG_PARTIAL_NREGS
4483 /* If this parm was passed part in regs and part in memory,
4484 pretend it arrived entirely in memory
4485 by pushing the register-part onto the stack.
4487 In the special case of a DImode or DFmode that is split,
4488 we could put it together in a pseudoreg directly,
4489 but for now that's not worth bothering with. */
4493 int nregs = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, promoted_mode,
4494 passed_type, named_arg);
4498 current_function_pretend_args_size
4499 = (((nregs * UNITS_PER_WORD) + (PARM_BOUNDARY / BITS_PER_UNIT) - 1)
4500 / (PARM_BOUNDARY / BITS_PER_UNIT)
4501 * (PARM_BOUNDARY / BITS_PER_UNIT));
4503 /* Handle calls that pass values in multiple non-contiguous
4504 locations. The Irix 6 ABI has examples of this. */
4505 if (GET_CODE (entry_parm) == PARALLEL)
4506 emit_group_store (validize_mem (stack_parm), entry_parm,
4507 int_size_in_bytes (TREE_TYPE (parm)),
4508 TYPE_ALIGN (TREE_TYPE (parm)));
4511 move_block_from_reg (REGNO (entry_parm),
4512 validize_mem (stack_parm), nregs,
4513 int_size_in_bytes (TREE_TYPE (parm)));
4515 entry_parm = stack_parm;
4520 /* If we didn't decide this parm came in a register,
4521 by default it came on the stack. */
4522 if (entry_parm == 0)
4523 entry_parm = stack_parm;
4525 /* Record permanently how this parm was passed. */
4526 DECL_INCOMING_RTL (parm) = entry_parm;
4528 /* If there is actually space on the stack for this parm,
4529 count it in stack_args_size; otherwise set stack_parm to 0
4530 to indicate there is no preallocated stack slot for the parm. */
4532 if (entry_parm == stack_parm
4533 || (GET_CODE (entry_parm) == PARALLEL
4534 && XEXP (XVECEXP (entry_parm, 0, 0), 0) == NULL_RTX)
4535 #if defined (REG_PARM_STACK_SPACE) && ! defined (MAYBE_REG_PARM_STACK_SPACE)
4536 /* On some machines, even if a parm value arrives in a register
4537 there is still an (uninitialized) stack slot allocated for it.
4539 ??? When MAYBE_REG_PARM_STACK_SPACE is defined, we can't tell
4540 whether this parameter already has a stack slot allocated,
4541 because an arg block exists only if current_function_args_size
4542 is larger than some threshold, and we haven't calculated that
4543 yet. So, for now, we just assume that stack slots never exist
4545 || REG_PARM_STACK_SPACE (fndecl) > 0
4549 stack_args_size.constant += arg_size.constant;
4551 ADD_PARM_SIZE (stack_args_size, arg_size.var);
4554 /* No stack slot was pushed for this parm. */
4557 /* Update info on where next arg arrives in registers. */
4559 FUNCTION_ARG_ADVANCE (args_so_far, promoted_mode,
4560 passed_type, named_arg);
4562 /* If we can't trust the parm stack slot to be aligned enough
4563 for its ultimate type, don't use that slot after entry.
4564 We'll make another stack slot, if we need one. */
4566 unsigned int thisparm_boundary
4567 = FUNCTION_ARG_BOUNDARY (promoted_mode, passed_type);
4569 if (GET_MODE_ALIGNMENT (nominal_mode) > thisparm_boundary)
4573 /* If parm was passed in memory, and we need to convert it on entry,
4574 don't store it back in that same slot. */
4576 && nominal_mode != BLKmode && nominal_mode != passed_mode)
4579 /* When an argument is passed in multiple locations, we can't
4580 make use of this information, but we can save some copying if
4581 the whole argument is passed in a single register. */
4582 if (GET_CODE (entry_parm) == PARALLEL
4583 && nominal_mode != BLKmode && passed_mode != BLKmode)
4585 int i, len = XVECLEN (entry_parm, 0);
4587 for (i = 0; i < len; i++)
4588 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
4589 && GET_CODE (XEXP (XVECEXP (entry_parm, 0, i), 0)) == REG
4590 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
4592 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
4594 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
4595 DECL_INCOMING_RTL (parm) = entry_parm;
4600 /* ENTRY_PARM is an RTX for the parameter as it arrives,
4601 in the mode in which it arrives.
4602 STACK_PARM is an RTX for a stack slot where the parameter can live
4603 during the function (in case we want to put it there).
4604 STACK_PARM is 0 if no stack slot was pushed for it.
4606 Now output code if necessary to convert ENTRY_PARM to
4607 the type in which this function declares it,
4608 and store that result in an appropriate place,
4609 which may be a pseudo reg, may be STACK_PARM,
4610 or may be a local stack slot if STACK_PARM is 0.
4612 Set DECL_RTL to that place. */
4614 if (nominal_mode == BLKmode || GET_CODE (entry_parm) == PARALLEL)
4616 /* If a BLKmode arrives in registers, copy it to a stack slot.
4617 Handle calls that pass values in multiple non-contiguous
4618 locations. The Irix 6 ABI has examples of this. */
4619 if (GET_CODE (entry_parm) == REG
4620 || GET_CODE (entry_parm) == PARALLEL)
4623 = CEIL_ROUND (int_size_in_bytes (TREE_TYPE (parm)),
4626 /* Note that we will be storing an integral number of words.
4627 So we have to be careful to ensure that we allocate an
4628 integral number of words. We do this below in the
4629 assign_stack_local if space was not allocated in the argument
4630 list. If it was, this will not work if PARM_BOUNDARY is not
4631 a multiple of BITS_PER_WORD. It isn't clear how to fix this
4632 if it becomes a problem. */
4634 if (stack_parm == 0)
4637 = assign_stack_local (GET_MODE (entry_parm),
4639 set_mem_attributes (stack_parm, parm, 1);
4642 else if (PARM_BOUNDARY % BITS_PER_WORD != 0)
4645 /* Handle calls that pass values in multiple non-contiguous
4646 locations. The Irix 6 ABI has examples of this. */
4647 if (GET_CODE (entry_parm) == PARALLEL)
4648 emit_group_store (validize_mem (stack_parm), entry_parm,
4649 int_size_in_bytes (TREE_TYPE (parm)),
4650 TYPE_ALIGN (TREE_TYPE (parm)));
4652 move_block_from_reg (REGNO (entry_parm),
4653 validize_mem (stack_parm),
4654 size_stored / UNITS_PER_WORD,
4655 int_size_in_bytes (TREE_TYPE (parm)));
4657 SET_DECL_RTL (parm, stack_parm);
4659 else if (! ((! optimize
4660 && ! DECL_REGISTER (parm)
4661 && ! DECL_INLINE (fndecl))
4662 || TREE_SIDE_EFFECTS (parm)
4663 /* If -ffloat-store specified, don't put explicit
4664 float variables into registers. */
4665 || (flag_float_store
4666 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))
4667 /* Always assign pseudo to structure return or item passed
4668 by invisible reference. */
4669 || passed_pointer || parm == function_result_decl)
4671 /* Store the parm in a pseudoregister during the function, but we
4672 may need to do it in a wider mode. */
4674 register rtx parmreg;
4675 unsigned int regno, regnoi = 0, regnor = 0;
4677 unsignedp = TREE_UNSIGNED (TREE_TYPE (parm));
4679 promoted_nominal_mode
4680 = promote_mode (TREE_TYPE (parm), nominal_mode, &unsignedp, 0);
4682 parmreg = gen_reg_rtx (promoted_nominal_mode);
4683 mark_user_reg (parmreg);
4685 /* If this was an item that we received a pointer to, set DECL_RTL
4690 gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type)),
4692 set_mem_attributes (DECL_RTL (parm), parm, 1);
4696 SET_DECL_RTL (parm, parmreg);
4697 maybe_set_unchanging (DECL_RTL (parm), parm);
4700 /* Copy the value into the register. */
4701 if (nominal_mode != passed_mode
4702 || promoted_nominal_mode != promoted_mode)
4705 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
4706 mode, by the caller. We now have to convert it to
4707 NOMINAL_MODE, if different. However, PARMREG may be in
4708 a different mode than NOMINAL_MODE if it is being stored
4711 If ENTRY_PARM is a hard register, it might be in a register
4712 not valid for operating in its mode (e.g., an odd-numbered
4713 register for a DFmode). In that case, moves are the only
4714 thing valid, so we can't do a convert from there. This
4715 occurs when the calling sequence allow such misaligned
4718 In addition, the conversion may involve a call, which could
4719 clobber parameters which haven't been copied to pseudo
4720 registers yet. Therefore, we must first copy the parm to
4721 a pseudo reg here, and save the conversion until after all
4722 parameters have been moved. */
4724 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
4726 emit_move_insn (tempreg, validize_mem (entry_parm));
4728 push_to_sequence (conversion_insns);
4729 tempreg = convert_to_mode (nominal_mode, tempreg, unsignedp);
4731 if (GET_CODE (tempreg) == SUBREG
4732 && GET_MODE (tempreg) == nominal_mode
4733 && GET_CODE (SUBREG_REG (tempreg)) == REG
4734 && nominal_mode == passed_mode
4735 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (entry_parm)
4736 && GET_MODE_SIZE (GET_MODE (tempreg))
4737 < GET_MODE_SIZE (GET_MODE (entry_parm)))
4739 /* The argument is already sign/zero extended, so note it
4741 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
4742 SUBREG_PROMOTED_UNSIGNED_P (tempreg) = unsignedp;
4745 /* TREE_USED gets set erroneously during expand_assignment. */
4746 save_tree_used = TREE_USED (parm);
4747 expand_assignment (parm,
4748 make_tree (nominal_type, tempreg), 0, 0);
4749 TREE_USED (parm) = save_tree_used;
4750 conversion_insns = get_insns ();
4755 emit_move_insn (parmreg, validize_mem (entry_parm));
4757 /* If we were passed a pointer but the actual value
4758 can safely live in a register, put it in one. */
4759 if (passed_pointer && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
4761 && ! DECL_REGISTER (parm)
4762 && ! DECL_INLINE (fndecl))
4763 || TREE_SIDE_EFFECTS (parm)
4764 /* If -ffloat-store specified, don't put explicit
4765 float variables into registers. */
4766 || (flag_float_store
4767 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE)))
4769 /* We can't use nominal_mode, because it will have been set to
4770 Pmode above. We must use the actual mode of the parm. */
4771 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
4772 mark_user_reg (parmreg);
4773 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
4775 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
4776 int unsigned_p = TREE_UNSIGNED (TREE_TYPE (parm));
4777 push_to_sequence (conversion_insns);
4778 emit_move_insn (tempreg, DECL_RTL (parm));
4780 convert_to_mode (GET_MODE (parmreg),
4783 emit_move_insn (parmreg, DECL_RTL (parm));
4784 conversion_insns = get_insns();
4789 emit_move_insn (parmreg, DECL_RTL (parm));
4790 SET_DECL_RTL (parm, parmreg);
4791 /* STACK_PARM is the pointer, not the parm, and PARMREG is
4795 #ifdef FUNCTION_ARG_CALLEE_COPIES
4796 /* If we are passed an arg by reference and it is our responsibility
4797 to make a copy, do it now.
4798 PASSED_TYPE and PASSED mode now refer to the pointer, not the
4799 original argument, so we must recreate them in the call to
4800 FUNCTION_ARG_CALLEE_COPIES. */
4801 /* ??? Later add code to handle the case that if the argument isn't
4802 modified, don't do the copy. */
4804 else if (passed_pointer
4805 && FUNCTION_ARG_CALLEE_COPIES (args_so_far,
4806 TYPE_MODE (DECL_ARG_TYPE (parm)),
4807 DECL_ARG_TYPE (parm),
4809 && ! TREE_ADDRESSABLE (DECL_ARG_TYPE (parm)))
4812 tree type = DECL_ARG_TYPE (parm);
4814 /* This sequence may involve a library call perhaps clobbering
4815 registers that haven't been copied to pseudos yet. */
4817 push_to_sequence (conversion_insns);
4819 if (!COMPLETE_TYPE_P (type)
4820 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4821 /* This is a variable sized object. */
4822 copy = gen_rtx_MEM (BLKmode,
4823 allocate_dynamic_stack_space
4824 (expr_size (parm), NULL_RTX,
4825 TYPE_ALIGN (type)));
4827 copy = assign_stack_temp (TYPE_MODE (type),
4828 int_size_in_bytes (type), 1);
4829 set_mem_attributes (copy, parm, 1);
4831 store_expr (parm, copy, 0);
4832 emit_move_insn (parmreg, XEXP (copy, 0));
4833 if (current_function_check_memory_usage)
4834 emit_library_call (chkr_set_right_libfunc,
4835 LCT_CONST_MAKE_BLOCK, VOIDmode, 3,
4836 XEXP (copy, 0), Pmode,
4837 GEN_INT (int_size_in_bytes (type)),
4838 TYPE_MODE (sizetype),
4839 GEN_INT (MEMORY_USE_RW),
4840 TYPE_MODE (integer_type_node));
4841 conversion_insns = get_insns ();
4845 #endif /* FUNCTION_ARG_CALLEE_COPIES */
4847 /* In any case, record the parm's desired stack location
4848 in case we later discover it must live in the stack.
4850 If it is a COMPLEX value, store the stack location for both
4853 if (GET_CODE (parmreg) == CONCAT)
4854 regno = MAX (REGNO (XEXP (parmreg, 0)), REGNO (XEXP (parmreg, 1)));
4856 regno = REGNO (parmreg);
4858 if (regno >= max_parm_reg)
4861 int old_max_parm_reg = max_parm_reg;
4863 /* It's slow to expand this one register at a time,
4864 but it's also rare and we need max_parm_reg to be
4865 precisely correct. */
4866 max_parm_reg = regno + 1;
4867 new = (rtx *) xrealloc (parm_reg_stack_loc,
4868 max_parm_reg * sizeof (rtx));
4869 memset ((char *) (new + old_max_parm_reg), 0,
4870 (max_parm_reg - old_max_parm_reg) * sizeof (rtx));
4871 parm_reg_stack_loc = new;
4874 if (GET_CODE (parmreg) == CONCAT)
4876 enum machine_mode submode = GET_MODE (XEXP (parmreg, 0));
4878 regnor = REGNO (gen_realpart (submode, parmreg));
4879 regnoi = REGNO (gen_imagpart (submode, parmreg));
4881 if (stack_parm != 0)
4883 parm_reg_stack_loc[regnor]
4884 = gen_realpart (submode, stack_parm);
4885 parm_reg_stack_loc[regnoi]
4886 = gen_imagpart (submode, stack_parm);
4890 parm_reg_stack_loc[regnor] = 0;
4891 parm_reg_stack_loc[regnoi] = 0;
4895 parm_reg_stack_loc[REGNO (parmreg)] = stack_parm;
4897 /* Mark the register as eliminable if we did no conversion
4898 and it was copied from memory at a fixed offset,
4899 and the arg pointer was not copied to a pseudo-reg.
4900 If the arg pointer is a pseudo reg or the offset formed
4901 an invalid address, such memory-equivalences
4902 as we make here would screw up life analysis for it. */
4903 if (nominal_mode == passed_mode
4906 && GET_CODE (stack_parm) == MEM
4907 && stack_offset.var == 0
4908 && reg_mentioned_p (virtual_incoming_args_rtx,
4909 XEXP (stack_parm, 0)))
4911 rtx linsn = get_last_insn ();
4914 /* Mark complex types separately. */
4915 if (GET_CODE (parmreg) == CONCAT)
4916 /* Scan backwards for the set of the real and
4918 for (sinsn = linsn; sinsn != 0;
4919 sinsn = prev_nonnote_insn (sinsn))
4921 set = single_set (sinsn);
4923 && SET_DEST (set) == regno_reg_rtx [regnoi])
4925 = gen_rtx_EXPR_LIST (REG_EQUIV,
4926 parm_reg_stack_loc[regnoi],
4929 && SET_DEST (set) == regno_reg_rtx [regnor])
4931 = gen_rtx_EXPR_LIST (REG_EQUIV,
4932 parm_reg_stack_loc[regnor],
4935 else if ((set = single_set (linsn)) != 0
4936 && SET_DEST (set) == parmreg)
4938 = gen_rtx_EXPR_LIST (REG_EQUIV,
4939 stack_parm, REG_NOTES (linsn));
4942 /* For pointer data type, suggest pointer register. */
4943 if (POINTER_TYPE_P (TREE_TYPE (parm)))
4944 mark_reg_pointer (parmreg,
4945 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
4947 /* If something wants our address, try to use ADDRESSOF. */
4948 if (TREE_ADDRESSABLE (parm))
4950 /* If we end up putting something into the stack,
4951 fixup_var_refs_insns will need to make a pass over
4952 all the instructions. It looks throughs the pending
4953 sequences -- but it can't see the ones in the
4954 CONVERSION_INSNS, if they're not on the sequence
4955 stack. So, we go back to that sequence, just so that
4956 the fixups will happen. */
4957 push_to_sequence (conversion_insns);
4958 put_var_into_stack (parm);
4959 conversion_insns = get_insns ();
4965 /* Value must be stored in the stack slot STACK_PARM
4966 during function execution. */
4968 if (promoted_mode != nominal_mode)
4970 /* Conversion is required. */
4971 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
4973 emit_move_insn (tempreg, validize_mem (entry_parm));
4975 push_to_sequence (conversion_insns);
4976 entry_parm = convert_to_mode (nominal_mode, tempreg,
4977 TREE_UNSIGNED (TREE_TYPE (parm)));
4979 /* ??? This may need a big-endian conversion on sparc64. */
4980 stack_parm = adjust_address (stack_parm, nominal_mode, 0);
4982 conversion_insns = get_insns ();
4987 if (entry_parm != stack_parm)
4989 if (stack_parm == 0)
4992 = assign_stack_local (GET_MODE (entry_parm),
4993 GET_MODE_SIZE (GET_MODE (entry_parm)), 0);
4994 set_mem_attributes (stack_parm, parm, 1);
4997 if (promoted_mode != nominal_mode)
4999 push_to_sequence (conversion_insns);
5000 emit_move_insn (validize_mem (stack_parm),
5001 validize_mem (entry_parm));
5002 conversion_insns = get_insns ();
5006 emit_move_insn (validize_mem (stack_parm),
5007 validize_mem (entry_parm));
5009 if (current_function_check_memory_usage)
5011 push_to_sequence (conversion_insns);
5012 emit_library_call (chkr_set_right_libfunc, LCT_CONST_MAKE_BLOCK,
5013 VOIDmode, 3, XEXP (stack_parm, 0), Pmode,
5014 GEN_INT (GET_MODE_SIZE (GET_MODE
5016 TYPE_MODE (sizetype),
5017 GEN_INT (MEMORY_USE_RW),
5018 TYPE_MODE (integer_type_node));
5020 conversion_insns = get_insns ();
5023 SET_DECL_RTL (parm, stack_parm);
5026 /* If this "parameter" was the place where we are receiving the
5027 function's incoming structure pointer, set up the result. */
5028 if (parm == function_result_decl)
5030 tree result = DECL_RESULT (fndecl);
5032 SET_DECL_RTL (result,
5033 gen_rtx_MEM (DECL_MODE (result), DECL_RTL (parm)));
5035 set_mem_attributes (DECL_RTL (result), result, 1);
5039 /* Output all parameter conversion instructions (possibly including calls)
5040 now that all parameters have been copied out of hard registers. */
5041 emit_insns (conversion_insns);
5043 last_parm_insn = get_last_insn ();
5045 current_function_args_size = stack_args_size.constant;
5047 /* Adjust function incoming argument size for alignment and
5050 #ifdef REG_PARM_STACK_SPACE
5051 #ifndef MAYBE_REG_PARM_STACK_SPACE
5052 current_function_args_size = MAX (current_function_args_size,
5053 REG_PARM_STACK_SPACE (fndecl));
5057 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
5059 current_function_args_size
5060 = ((current_function_args_size + STACK_BYTES - 1)
5061 / STACK_BYTES) * STACK_BYTES;
5063 #ifdef ARGS_GROW_DOWNWARD
5064 current_function_arg_offset_rtx
5065 = (stack_args_size.var == 0 ? GEN_INT (-stack_args_size.constant)
5066 : expand_expr (size_diffop (stack_args_size.var,
5067 size_int (-stack_args_size.constant)),
5068 NULL_RTX, VOIDmode, EXPAND_MEMORY_USE_BAD));
5070 current_function_arg_offset_rtx = ARGS_SIZE_RTX (stack_args_size);
5073 /* See how many bytes, if any, of its args a function should try to pop
5076 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
5077 current_function_args_size);
5079 /* For stdarg.h function, save info about
5080 regs and stack space used by the named args. */
5083 current_function_args_info = args_so_far;
5085 /* Set the rtx used for the function return value. Put this in its
5086 own variable so any optimizers that need this information don't have
5087 to include tree.h. Do this here so it gets done when an inlined
5088 function gets output. */
5090 current_function_return_rtx
5091 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
5092 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
5095 /* Indicate whether REGNO is an incoming argument to the current function
5096 that was promoted to a wider mode. If so, return the RTX for the
5097 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
5098 that REGNO is promoted from and whether the promotion was signed or
5101 #ifdef PROMOTE_FUNCTION_ARGS
5104 promoted_input_arg (regno, pmode, punsignedp)
5106 enum machine_mode *pmode;
5111 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
5112 arg = TREE_CHAIN (arg))
5113 if (GET_CODE (DECL_INCOMING_RTL (arg)) == REG
5114 && REGNO (DECL_INCOMING_RTL (arg)) == regno
5115 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
5117 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
5118 int unsignedp = TREE_UNSIGNED (TREE_TYPE (arg));
5120 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
5121 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
5122 && mode != DECL_MODE (arg))
5124 *pmode = DECL_MODE (arg);
5125 *punsignedp = unsignedp;
5126 return DECL_INCOMING_RTL (arg);
5135 /* Compute the size and offset from the start of the stacked arguments for a
5136 parm passed in mode PASSED_MODE and with type TYPE.
5138 INITIAL_OFFSET_PTR points to the current offset into the stacked
5141 The starting offset and size for this parm are returned in *OFFSET_PTR
5142 and *ARG_SIZE_PTR, respectively.
5144 IN_REGS is non-zero if the argument will be passed in registers. It will
5145 never be set if REG_PARM_STACK_SPACE is not defined.
5147 FNDECL is the function in which the argument was defined.
5149 There are two types of rounding that are done. The first, controlled by
5150 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
5151 list to be aligned to the specific boundary (in bits). This rounding
5152 affects the initial and starting offsets, but not the argument size.
5154 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
5155 optionally rounds the size of the parm to PARM_BOUNDARY. The
5156 initial offset is not affected by this rounding, while the size always
5157 is and the starting offset may be. */
5159 /* offset_ptr will be negative for ARGS_GROW_DOWNWARD case;
5160 initial_offset_ptr is positive because locate_and_pad_parm's
5161 callers pass in the total size of args so far as
5162 initial_offset_ptr. arg_size_ptr is always positive.*/
5165 locate_and_pad_parm (passed_mode, type, in_regs, fndecl,
5166 initial_offset_ptr, offset_ptr, arg_size_ptr,
5168 enum machine_mode passed_mode;
5170 int in_regs ATTRIBUTE_UNUSED;
5171 tree fndecl ATTRIBUTE_UNUSED;
5172 struct args_size *initial_offset_ptr;
5173 struct args_size *offset_ptr;
5174 struct args_size *arg_size_ptr;
5175 struct args_size *alignment_pad;
5179 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
5180 enum direction where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
5181 int boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
5183 #ifdef REG_PARM_STACK_SPACE
5184 /* If we have found a stack parm before we reach the end of the
5185 area reserved for registers, skip that area. */
5188 int reg_parm_stack_space = 0;
5190 #ifdef MAYBE_REG_PARM_STACK_SPACE
5191 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
5193 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
5195 if (reg_parm_stack_space > 0)
5197 if (initial_offset_ptr->var)
5199 initial_offset_ptr->var
5200 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
5201 ssize_int (reg_parm_stack_space));
5202 initial_offset_ptr->constant = 0;
5204 else if (initial_offset_ptr->constant < reg_parm_stack_space)
5205 initial_offset_ptr->constant = reg_parm_stack_space;
5208 #endif /* REG_PARM_STACK_SPACE */
5210 arg_size_ptr->var = 0;
5211 arg_size_ptr->constant = 0;
5212 alignment_pad->var = 0;
5213 alignment_pad->constant = 0;
5215 #ifdef ARGS_GROW_DOWNWARD
5216 if (initial_offset_ptr->var)
5218 offset_ptr->constant = 0;
5219 offset_ptr->var = size_binop (MINUS_EXPR, ssize_int (0),
5220 initial_offset_ptr->var);
5224 offset_ptr->constant = -initial_offset_ptr->constant;
5225 offset_ptr->var = 0;
5227 if (where_pad != none
5228 && (!host_integerp (sizetree, 1)
5229 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5230 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5231 SUB_PARM_SIZE (*offset_ptr, sizetree);
5232 if (where_pad != downward)
5233 pad_to_arg_alignment (offset_ptr, boundary, alignment_pad);
5234 if (initial_offset_ptr->var)
5235 arg_size_ptr->var = size_binop (MINUS_EXPR,
5236 size_binop (MINUS_EXPR,
5238 initial_offset_ptr->var),
5242 arg_size_ptr->constant = (-initial_offset_ptr->constant
5243 - offset_ptr->constant);
5245 #else /* !ARGS_GROW_DOWNWARD */
5247 #ifdef REG_PARM_STACK_SPACE
5248 || REG_PARM_STACK_SPACE (fndecl) > 0
5251 pad_to_arg_alignment (initial_offset_ptr, boundary, alignment_pad);
5252 *offset_ptr = *initial_offset_ptr;
5254 #ifdef PUSH_ROUNDING
5255 if (passed_mode != BLKmode)
5256 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
5259 /* Pad_below needs the pre-rounded size to know how much to pad below
5260 so this must be done before rounding up. */
5261 if (where_pad == downward
5262 /* However, BLKmode args passed in regs have their padding done elsewhere.
5263 The stack slot must be able to hold the entire register. */
5264 && !(in_regs && passed_mode == BLKmode))
5265 pad_below (offset_ptr, passed_mode, sizetree);
5267 if (where_pad != none
5268 && (!host_integerp (sizetree, 1)
5269 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5270 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5272 ADD_PARM_SIZE (*arg_size_ptr, sizetree);
5273 #endif /* ARGS_GROW_DOWNWARD */
5276 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
5277 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
5280 pad_to_arg_alignment (offset_ptr, boundary, alignment_pad)
5281 struct args_size *offset_ptr;
5283 struct args_size *alignment_pad;
5285 tree save_var = NULL_TREE;
5286 HOST_WIDE_INT save_constant = 0;
5288 int boundary_in_bytes = boundary / BITS_PER_UNIT;
5290 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5292 save_var = offset_ptr->var;
5293 save_constant = offset_ptr->constant;
5296 alignment_pad->var = NULL_TREE;
5297 alignment_pad->constant = 0;
5299 if (boundary > BITS_PER_UNIT)
5301 if (offset_ptr->var)
5304 #ifdef ARGS_GROW_DOWNWARD
5309 (ARGS_SIZE_TREE (*offset_ptr),
5310 boundary / BITS_PER_UNIT);
5311 offset_ptr->constant = 0; /*?*/
5312 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5313 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
5318 offset_ptr->constant =
5319 #ifdef ARGS_GROW_DOWNWARD
5320 FLOOR_ROUND (offset_ptr->constant, boundary_in_bytes);
5322 CEIL_ROUND (offset_ptr->constant, boundary_in_bytes);
5324 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5325 alignment_pad->constant = offset_ptr->constant - save_constant;
5330 #ifndef ARGS_GROW_DOWNWARD
5332 pad_below (offset_ptr, passed_mode, sizetree)
5333 struct args_size *offset_ptr;
5334 enum machine_mode passed_mode;
5337 if (passed_mode != BLKmode)
5339 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
5340 offset_ptr->constant
5341 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
5342 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
5343 - GET_MODE_SIZE (passed_mode));
5347 if (TREE_CODE (sizetree) != INTEGER_CST
5348 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
5350 /* Round the size up to multiple of PARM_BOUNDARY bits. */
5351 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5353 ADD_PARM_SIZE (*offset_ptr, s2);
5354 SUB_PARM_SIZE (*offset_ptr, sizetree);
5360 /* Walk the tree of blocks describing the binding levels within a function
5361 and warn about uninitialized variables.
5362 This is done after calling flow_analysis and before global_alloc
5363 clobbers the pseudo-regs to hard regs. */
5366 uninitialized_vars_warning (block)
5369 register tree decl, sub;
5370 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5372 if (warn_uninitialized
5373 && TREE_CODE (decl) == VAR_DECL
5374 /* These warnings are unreliable for and aggregates
5375 because assigning the fields one by one can fail to convince
5376 flow.c that the entire aggregate was initialized.
5377 Unions are troublesome because members may be shorter. */
5378 && ! AGGREGATE_TYPE_P (TREE_TYPE (decl))
5379 && DECL_RTL (decl) != 0
5380 && GET_CODE (DECL_RTL (decl)) == REG
5381 /* Global optimizations can make it difficult to determine if a
5382 particular variable has been initialized. However, a VAR_DECL
5383 with a nonzero DECL_INITIAL had an initializer, so do not
5384 claim it is potentially uninitialized.
5386 We do not care about the actual value in DECL_INITIAL, so we do
5387 not worry that it may be a dangling pointer. */
5388 && DECL_INITIAL (decl) == NULL_TREE
5389 && regno_uninitialized (REGNO (DECL_RTL (decl))))
5390 warning_with_decl (decl,
5391 "`%s' might be used uninitialized in this function");
5393 && TREE_CODE (decl) == VAR_DECL
5394 && DECL_RTL (decl) != 0
5395 && GET_CODE (DECL_RTL (decl)) == REG
5396 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5397 warning_with_decl (decl,
5398 "variable `%s' might be clobbered by `longjmp' or `vfork'");
5400 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5401 uninitialized_vars_warning (sub);
5404 /* Do the appropriate part of uninitialized_vars_warning
5405 but for arguments instead of local variables. */
5408 setjmp_args_warning ()
5411 for (decl = DECL_ARGUMENTS (current_function_decl);
5412 decl; decl = TREE_CHAIN (decl))
5413 if (DECL_RTL (decl) != 0
5414 && GET_CODE (DECL_RTL (decl)) == REG
5415 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5416 warning_with_decl (decl,
5417 "argument `%s' might be clobbered by `longjmp' or `vfork'");
5420 /* If this function call setjmp, put all vars into the stack
5421 unless they were declared `register'. */
5424 setjmp_protect (block)
5427 register tree decl, sub;
5428 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5429 if ((TREE_CODE (decl) == VAR_DECL
5430 || TREE_CODE (decl) == PARM_DECL)
5431 && DECL_RTL (decl) != 0
5432 && (GET_CODE (DECL_RTL (decl)) == REG
5433 || (GET_CODE (DECL_RTL (decl)) == MEM
5434 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5435 /* If this variable came from an inline function, it must be
5436 that its life doesn't overlap the setjmp. If there was a
5437 setjmp in the function, it would already be in memory. We
5438 must exclude such variable because their DECL_RTL might be
5439 set to strange things such as virtual_stack_vars_rtx. */
5440 && ! DECL_FROM_INLINE (decl)
5442 #ifdef NON_SAVING_SETJMP
5443 /* If longjmp doesn't restore the registers,
5444 don't put anything in them. */
5448 ! DECL_REGISTER (decl)))
5449 put_var_into_stack (decl);
5450 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5451 setjmp_protect (sub);
5454 /* Like the previous function, but for args instead of local variables. */
5457 setjmp_protect_args ()
5460 for (decl = DECL_ARGUMENTS (current_function_decl);
5461 decl; decl = TREE_CHAIN (decl))
5462 if ((TREE_CODE (decl) == VAR_DECL
5463 || TREE_CODE (decl) == PARM_DECL)
5464 && DECL_RTL (decl) != 0
5465 && (GET_CODE (DECL_RTL (decl)) == REG
5466 || (GET_CODE (DECL_RTL (decl)) == MEM
5467 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5469 /* If longjmp doesn't restore the registers,
5470 don't put anything in them. */
5471 #ifdef NON_SAVING_SETJMP
5475 ! DECL_REGISTER (decl)))
5476 put_var_into_stack (decl);
5479 /* Return the context-pointer register corresponding to DECL,
5480 or 0 if it does not need one. */
5483 lookup_static_chain (decl)
5486 tree context = decl_function_context (decl);
5490 || (TREE_CODE (decl) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (decl)))
5493 /* We treat inline_function_decl as an alias for the current function
5494 because that is the inline function whose vars, types, etc.
5495 are being merged into the current function.
5496 See expand_inline_function. */
5497 if (context == current_function_decl || context == inline_function_decl)
5498 return virtual_stack_vars_rtx;
5500 for (link = context_display; link; link = TREE_CHAIN (link))
5501 if (TREE_PURPOSE (link) == context)
5502 return RTL_EXPR_RTL (TREE_VALUE (link));
5507 /* Convert a stack slot address ADDR for variable VAR
5508 (from a containing function)
5509 into an address valid in this function (using a static chain). */
5512 fix_lexical_addr (addr, var)
5517 HOST_WIDE_INT displacement;
5518 tree context = decl_function_context (var);
5519 struct function *fp;
5522 /* If this is the present function, we need not do anything. */
5523 if (context == current_function_decl || context == inline_function_decl)
5526 for (fp = outer_function_chain; fp; fp = fp->next)
5527 if (fp->decl == context)
5533 if (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == MEM)
5534 addr = XEXP (XEXP (addr, 0), 0);
5536 /* Decode given address as base reg plus displacement. */
5537 if (GET_CODE (addr) == REG)
5538 basereg = addr, displacement = 0;
5539 else if (GET_CODE (addr) == PLUS && GET_CODE (XEXP (addr, 1)) == CONST_INT)
5540 basereg = XEXP (addr, 0), displacement = INTVAL (XEXP (addr, 1));
5544 /* We accept vars reached via the containing function's
5545 incoming arg pointer and via its stack variables pointer. */
5546 if (basereg == fp->internal_arg_pointer)
5548 /* If reached via arg pointer, get the arg pointer value
5549 out of that function's stack frame.
5551 There are two cases: If a separate ap is needed, allocate a
5552 slot in the outer function for it and dereference it that way.
5553 This is correct even if the real ap is actually a pseudo.
5554 Otherwise, just adjust the offset from the frame pointer to
5557 #ifdef NEED_SEPARATE_AP
5560 if (fp->x_arg_pointer_save_area == 0)
5561 fp->x_arg_pointer_save_area
5562 = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, fp);
5564 addr = fix_lexical_addr (XEXP (fp->x_arg_pointer_save_area, 0), var);
5565 addr = memory_address (Pmode, addr);
5567 base = gen_rtx_MEM (Pmode, addr);
5568 MEM_ALIAS_SET (base) = get_frame_alias_set ();
5569 base = copy_to_reg (base);
5571 displacement += (FIRST_PARM_OFFSET (context) - STARTING_FRAME_OFFSET);
5572 base = lookup_static_chain (var);
5576 else if (basereg == virtual_stack_vars_rtx)
5578 /* This is the same code as lookup_static_chain, duplicated here to
5579 avoid an extra call to decl_function_context. */
5582 for (link = context_display; link; link = TREE_CHAIN (link))
5583 if (TREE_PURPOSE (link) == context)
5585 base = RTL_EXPR_RTL (TREE_VALUE (link));
5593 /* Use same offset, relative to appropriate static chain or argument
5595 return plus_constant (base, displacement);
5598 /* Return the address of the trampoline for entering nested fn FUNCTION.
5599 If necessary, allocate a trampoline (in the stack frame)
5600 and emit rtl to initialize its contents (at entry to this function). */
5603 trampoline_address (function)
5609 struct function *fp;
5612 /* Find an existing trampoline and return it. */
5613 for (link = trampoline_list; link; link = TREE_CHAIN (link))
5614 if (TREE_PURPOSE (link) == function)
5616 adjust_trampoline_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0));
5618 for (fp = outer_function_chain; fp; fp = fp->next)
5619 for (link = fp->x_trampoline_list; link; link = TREE_CHAIN (link))
5620 if (TREE_PURPOSE (link) == function)
5622 tramp = fix_lexical_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0),
5624 return adjust_trampoline_addr (tramp);
5627 /* None exists; we must make one. */
5629 /* Find the `struct function' for the function containing FUNCTION. */
5631 fn_context = decl_function_context (function);
5632 if (fn_context != current_function_decl
5633 && fn_context != inline_function_decl)
5634 for (fp = outer_function_chain; fp; fp = fp->next)
5635 if (fp->decl == fn_context)
5638 /* Allocate run-time space for this trampoline
5639 (usually in the defining function's stack frame). */
5640 #ifdef ALLOCATE_TRAMPOLINE
5641 tramp = ALLOCATE_TRAMPOLINE (fp);
5643 /* If rounding needed, allocate extra space
5644 to ensure we have TRAMPOLINE_SIZE bytes left after rounding up. */
5645 #ifdef TRAMPOLINE_ALIGNMENT
5646 #define TRAMPOLINE_REAL_SIZE \
5647 (TRAMPOLINE_SIZE + (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT) - 1)
5649 #define TRAMPOLINE_REAL_SIZE (TRAMPOLINE_SIZE)
5651 tramp = assign_stack_local_1 (BLKmode, TRAMPOLINE_REAL_SIZE, 0,
5655 /* Record the trampoline for reuse and note it for later initialization
5656 by expand_function_end. */
5659 rtlexp = make_node (RTL_EXPR);
5660 RTL_EXPR_RTL (rtlexp) = tramp;
5661 fp->x_trampoline_list = tree_cons (function, rtlexp,
5662 fp->x_trampoline_list);
5666 /* Make the RTL_EXPR node temporary, not momentary, so that the
5667 trampoline_list doesn't become garbage. */
5668 rtlexp = make_node (RTL_EXPR);
5670 RTL_EXPR_RTL (rtlexp) = tramp;
5671 trampoline_list = tree_cons (function, rtlexp, trampoline_list);
5674 tramp = fix_lexical_addr (XEXP (tramp, 0), function);
5675 return adjust_trampoline_addr (tramp);
5678 /* Given a trampoline address,
5679 round it to multiple of TRAMPOLINE_ALIGNMENT. */
5682 round_trampoline_addr (tramp)
5685 #ifdef TRAMPOLINE_ALIGNMENT
5686 /* Round address up to desired boundary. */
5687 rtx temp = gen_reg_rtx (Pmode);
5688 temp = expand_binop (Pmode, add_optab, tramp,
5689 GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1),
5690 temp, 0, OPTAB_LIB_WIDEN);
5691 tramp = expand_binop (Pmode, and_optab, temp,
5692 GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT),
5693 temp, 0, OPTAB_LIB_WIDEN);
5698 /* Given a trampoline address, round it then apply any
5699 platform-specific adjustments so that the result can be used for a
5703 adjust_trampoline_addr (tramp)
5706 tramp = round_trampoline_addr (tramp);
5707 #ifdef TRAMPOLINE_ADJUST_ADDRESS
5708 TRAMPOLINE_ADJUST_ADDRESS (tramp);
5713 /* Put all this function's BLOCK nodes including those that are chained
5714 onto the first block into a vector, and return it.
5715 Also store in each NOTE for the beginning or end of a block
5716 the index of that block in the vector.
5717 The arguments are BLOCK, the chain of top-level blocks of the function,
5718 and INSNS, the insn chain of the function. */
5724 tree *block_vector, *last_block_vector;
5726 tree block = DECL_INITIAL (current_function_decl);
5731 /* Fill the BLOCK_VECTOR with all of the BLOCKs in this function, in
5732 depth-first order. */
5733 block_vector = get_block_vector (block, &n_blocks);
5734 block_stack = (tree *) xmalloc (n_blocks * sizeof (tree));
5736 last_block_vector = identify_blocks_1 (get_insns (),
5738 block_vector + n_blocks,
5741 /* If we didn't use all of the subblocks, we've misplaced block notes. */
5742 /* ??? This appears to happen all the time. Latent bugs elsewhere? */
5743 if (0 && last_block_vector != block_vector + n_blocks)
5746 free (block_vector);
5750 /* Subroutine of identify_blocks. Do the block substitution on the
5751 insn chain beginning with INSNS. Recurse for CALL_PLACEHOLDER chains.
5753 BLOCK_STACK is pushed and popped for each BLOCK_BEGIN/BLOCK_END pair.
5754 BLOCK_VECTOR is incremented for each block seen. */
5757 identify_blocks_1 (insns, block_vector, end_block_vector, orig_block_stack)
5760 tree *end_block_vector;
5761 tree *orig_block_stack;
5764 tree *block_stack = orig_block_stack;
5766 for (insn = insns; insn; insn = NEXT_INSN (insn))
5768 if (GET_CODE (insn) == NOTE)
5770 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
5774 /* If there are more block notes than BLOCKs, something
5776 if (block_vector == end_block_vector)
5779 b = *block_vector++;
5780 NOTE_BLOCK (insn) = b;
5783 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
5785 /* If there are more NOTE_INSN_BLOCK_ENDs than
5786 NOTE_INSN_BLOCK_BEGs, something is badly wrong. */
5787 if (block_stack == orig_block_stack)
5790 NOTE_BLOCK (insn) = *--block_stack;
5793 else if (GET_CODE (insn) == CALL_INSN
5794 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
5796 rtx cp = PATTERN (insn);
5798 block_vector = identify_blocks_1 (XEXP (cp, 0), block_vector,
5799 end_block_vector, block_stack);
5801 block_vector = identify_blocks_1 (XEXP (cp, 1), block_vector,
5802 end_block_vector, block_stack);
5804 block_vector = identify_blocks_1 (XEXP (cp, 2), block_vector,
5805 end_block_vector, block_stack);
5809 /* If there are more NOTE_INSN_BLOCK_BEGINs than NOTE_INSN_BLOCK_ENDs,
5810 something is badly wrong. */
5811 if (block_stack != orig_block_stack)
5814 return block_vector;
5817 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
5818 and create duplicate blocks. */
5819 /* ??? Need an option to either create block fragments or to create
5820 abstract origin duplicates of a source block. It really depends
5821 on what optimization has been performed. */
5826 tree block = DECL_INITIAL (current_function_decl);
5827 varray_type block_stack;
5829 if (block == NULL_TREE)
5832 VARRAY_TREE_INIT (block_stack, 10, "block_stack");
5834 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
5835 reorder_blocks_0 (block);
5837 /* Prune the old trees away, so that they don't get in the way. */
5838 BLOCK_SUBBLOCKS (block) = NULL_TREE;
5839 BLOCK_CHAIN (block) = NULL_TREE;
5841 /* Recreate the block tree from the note nesting. */
5842 reorder_blocks_1 (get_insns (), block, &block_stack);
5843 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
5845 /* Remove deleted blocks from the block fragment chains. */
5846 reorder_fix_fragments (block);
5848 VARRAY_FREE (block_stack);
5851 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
5854 reorder_blocks_0 (block)
5859 TREE_ASM_WRITTEN (block) = 0;
5860 reorder_blocks_0 (BLOCK_SUBBLOCKS (block));
5861 block = BLOCK_CHAIN (block);
5866 reorder_blocks_1 (insns, current_block, p_block_stack)
5869 varray_type *p_block_stack;
5873 for (insn = insns; insn; insn = NEXT_INSN (insn))
5875 if (GET_CODE (insn) == NOTE)
5877 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
5879 tree block = NOTE_BLOCK (insn);
5881 /* If we have seen this block before, that means it now
5882 spans multiple address regions. Create a new fragment. */
5883 if (TREE_ASM_WRITTEN (block))
5885 tree new_block = copy_node (block);
5888 origin = (BLOCK_FRAGMENT_ORIGIN (block)
5889 ? BLOCK_FRAGMENT_ORIGIN (block)
5891 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
5892 BLOCK_FRAGMENT_CHAIN (new_block)
5893 = BLOCK_FRAGMENT_CHAIN (origin);
5894 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
5896 NOTE_BLOCK (insn) = new_block;
5900 BLOCK_SUBBLOCKS (block) = 0;
5901 TREE_ASM_WRITTEN (block) = 1;
5902 BLOCK_SUPERCONTEXT (block) = current_block;
5903 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
5904 BLOCK_SUBBLOCKS (current_block) = block;
5905 current_block = block;
5906 VARRAY_PUSH_TREE (*p_block_stack, block);
5908 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
5910 NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack);
5911 VARRAY_POP (*p_block_stack);
5912 BLOCK_SUBBLOCKS (current_block)
5913 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
5914 current_block = BLOCK_SUPERCONTEXT (current_block);
5917 else if (GET_CODE (insn) == CALL_INSN
5918 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
5920 rtx cp = PATTERN (insn);
5921 reorder_blocks_1 (XEXP (cp, 0), current_block, p_block_stack);
5923 reorder_blocks_1 (XEXP (cp, 1), current_block, p_block_stack);
5925 reorder_blocks_1 (XEXP (cp, 2), current_block, p_block_stack);
5930 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
5931 appears in the block tree, select one of the fragments to become
5932 the new origin block. */
5935 reorder_fix_fragments (block)
5940 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
5941 tree new_origin = NULL_TREE;
5945 if (! TREE_ASM_WRITTEN (dup_origin))
5947 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
5949 /* Find the first of the remaining fragments. There must
5950 be at least one -- the current block. */
5951 while (! TREE_ASM_WRITTEN (new_origin))
5952 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
5953 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
5956 else if (! dup_origin)
5959 /* Re-root the rest of the fragments to the new origin. In the
5960 case that DUP_ORIGIN was null, that means BLOCK was the origin
5961 of a chain of fragments and we want to remove those fragments
5962 that didn't make it to the output. */
5965 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
5970 if (TREE_ASM_WRITTEN (chain))
5972 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
5974 pp = &BLOCK_FRAGMENT_CHAIN (chain);
5976 chain = BLOCK_FRAGMENT_CHAIN (chain);
5981 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
5982 block = BLOCK_CHAIN (block);
5986 /* Reverse the order of elements in the chain T of blocks,
5987 and return the new head of the chain (old last element). */
5993 register tree prev = 0, decl, next;
5994 for (decl = t; decl; decl = next)
5996 next = BLOCK_CHAIN (decl);
5997 BLOCK_CHAIN (decl) = prev;
6003 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
6004 non-NULL, list them all into VECTOR, in a depth-first preorder
6005 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
6009 all_blocks (block, vector)
6017 TREE_ASM_WRITTEN (block) = 0;
6019 /* Record this block. */
6021 vector[n_blocks] = block;
6025 /* Record the subblocks, and their subblocks... */
6026 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
6027 vector ? vector + n_blocks : 0);
6028 block = BLOCK_CHAIN (block);
6034 /* Return a vector containing all the blocks rooted at BLOCK. The
6035 number of elements in the vector is stored in N_BLOCKS_P. The
6036 vector is dynamically allocated; it is the caller's responsibility
6037 to call `free' on the pointer returned. */
6040 get_block_vector (block, n_blocks_p)
6046 *n_blocks_p = all_blocks (block, NULL);
6047 block_vector = (tree *) xmalloc (*n_blocks_p * sizeof (tree));
6048 all_blocks (block, block_vector);
6050 return block_vector;
6053 static int next_block_index = 2;
6055 /* Set BLOCK_NUMBER for all the blocks in FN. */
6065 /* For SDB and XCOFF debugging output, we start numbering the blocks
6066 from 1 within each function, rather than keeping a running
6068 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
6069 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
6070 next_block_index = 1;
6073 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
6075 /* The top-level BLOCK isn't numbered at all. */
6076 for (i = 1; i < n_blocks; ++i)
6077 /* We number the blocks from two. */
6078 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
6080 free (block_vector);
6085 /* Allocate a function structure and reset its contents to the defaults. */
6087 prepare_function_start ()
6089 cfun = (struct function *) xcalloc (1, sizeof (struct function));
6091 init_stmt_for_function ();
6092 init_eh_for_function ();
6094 cse_not_expected = ! optimize;
6096 /* Caller save not needed yet. */
6097 caller_save_needed = 0;
6099 /* No stack slots have been made yet. */
6100 stack_slot_list = 0;
6102 current_function_has_nonlocal_label = 0;
6103 current_function_has_nonlocal_goto = 0;
6105 /* There is no stack slot for handling nonlocal gotos. */
6106 nonlocal_goto_handler_slots = 0;
6107 nonlocal_goto_stack_level = 0;
6109 /* No labels have been declared for nonlocal use. */
6110 nonlocal_labels = 0;
6111 nonlocal_goto_handler_labels = 0;
6113 /* No function calls so far in this function. */
6114 function_call_count = 0;
6116 /* No parm regs have been allocated.
6117 (This is important for output_inline_function.) */
6118 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
6120 /* Initialize the RTL mechanism. */
6123 /* Initialize the queue of pending postincrement and postdecrements,
6124 and some other info in expr.c. */
6127 /* We haven't done register allocation yet. */
6130 init_varasm_status (cfun);
6132 /* Clear out data used for inlining. */
6133 cfun->inlinable = 0;
6134 cfun->original_decl_initial = 0;
6135 cfun->original_arg_vector = 0;
6137 cfun->stack_alignment_needed = STACK_BOUNDARY;
6138 cfun->preferred_stack_boundary = STACK_BOUNDARY;
6140 /* Set if a call to setjmp is seen. */
6141 current_function_calls_setjmp = 0;
6143 /* Set if a call to longjmp is seen. */
6144 current_function_calls_longjmp = 0;
6146 current_function_calls_alloca = 0;
6147 current_function_contains_functions = 0;
6148 current_function_is_leaf = 0;
6149 current_function_nothrow = 0;
6150 current_function_sp_is_unchanging = 0;
6151 current_function_uses_only_leaf_regs = 0;
6152 current_function_has_computed_jump = 0;
6153 current_function_is_thunk = 0;
6155 current_function_returns_pcc_struct = 0;
6156 current_function_returns_struct = 0;
6157 current_function_epilogue_delay_list = 0;
6158 current_function_uses_const_pool = 0;
6159 current_function_uses_pic_offset_table = 0;
6160 current_function_cannot_inline = 0;
6162 /* We have not yet needed to make a label to jump to for tail-recursion. */
6163 tail_recursion_label = 0;
6165 /* We haven't had a need to make a save area for ap yet. */
6166 arg_pointer_save_area = 0;
6168 /* No stack slots allocated yet. */
6171 /* No SAVE_EXPRs in this function yet. */
6174 /* No RTL_EXPRs in this function yet. */
6177 /* Set up to allocate temporaries. */
6180 /* Indicate that we need to distinguish between the return value of the
6181 present function and the return value of a function being called. */
6182 rtx_equal_function_value_matters = 1;
6184 /* Indicate that we have not instantiated virtual registers yet. */
6185 virtuals_instantiated = 0;
6187 /* Indicate that we want CONCATs now. */
6188 generating_concat_p = 1;
6190 /* Indicate we have no need of a frame pointer yet. */
6191 frame_pointer_needed = 0;
6193 /* By default assume not varargs or stdarg. */
6194 current_function_varargs = 0;
6195 current_function_stdarg = 0;
6197 /* We haven't made any trampolines for this function yet. */
6198 trampoline_list = 0;
6200 init_pending_stack_adjust ();
6201 inhibit_defer_pop = 0;
6203 current_function_outgoing_args_size = 0;
6205 if (init_lang_status)
6206 (*init_lang_status) (cfun);
6207 if (init_machine_status)
6208 (*init_machine_status) (cfun);
6211 /* Initialize the rtl expansion mechanism so that we can do simple things
6212 like generate sequences. This is used to provide a context during global
6213 initialization of some passes. */
6215 init_dummy_function_start ()
6217 prepare_function_start ();
6220 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
6221 and initialize static variables for generating RTL for the statements
6225 init_function_start (subr, filename, line)
6227 const char *filename;
6230 prepare_function_start ();
6232 /* Remember this function for later. */
6233 cfun->next_global = all_functions;
6234 all_functions = cfun;
6236 current_function_name = (*decl_printable_name) (subr, 2);
6239 /* Nonzero if this is a nested function that uses a static chain. */
6241 current_function_needs_context
6242 = (decl_function_context (current_function_decl) != 0
6243 && ! DECL_NO_STATIC_CHAIN (current_function_decl));
6245 /* Within function body, compute a type's size as soon it is laid out. */
6246 immediate_size_expand++;
6248 /* Prevent ever trying to delete the first instruction of a function.
6249 Also tell final how to output a linenum before the function prologue.
6250 Note linenums could be missing, e.g. when compiling a Java .class file. */
6252 emit_line_note (filename, line);
6254 /* Make sure first insn is a note even if we don't want linenums.
6255 This makes sure the first insn will never be deleted.
6256 Also, final expects a note to appear there. */
6257 emit_note (NULL, NOTE_INSN_DELETED);
6259 /* Set flags used by final.c. */
6260 if (aggregate_value_p (DECL_RESULT (subr)))
6262 #ifdef PCC_STATIC_STRUCT_RETURN
6263 current_function_returns_pcc_struct = 1;
6265 current_function_returns_struct = 1;
6268 /* Warn if this value is an aggregate type,
6269 regardless of which calling convention we are using for it. */
6270 if (warn_aggregate_return
6271 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
6272 warning ("function returns an aggregate");
6274 current_function_returns_pointer
6275 = POINTER_TYPE_P (TREE_TYPE (DECL_RESULT (subr)));
6278 /* Make sure all values used by the optimization passes have sane
6281 init_function_for_compilation ()
6285 /* No prologue/epilogue insns yet. */
6286 VARRAY_GROW (prologue, 0);
6287 VARRAY_GROW (epilogue, 0);
6288 VARRAY_GROW (sibcall_epilogue, 0);
6291 /* Indicate that the current function uses extra args
6292 not explicitly mentioned in the argument list in any fashion. */
6297 current_function_varargs = 1;
6300 /* Expand a call to __main at the beginning of a possible main function. */
6302 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
6303 #undef HAS_INIT_SECTION
6304 #define HAS_INIT_SECTION
6308 expand_main_function ()
6310 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
6311 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
6313 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
6316 /* Forcably align the stack. */
6317 #ifdef STACK_GROWS_DOWNWARD
6318 tmp = expand_binop (Pmode, and_optab, stack_pointer_rtx,
6319 GEN_INT (-align), stack_pointer_rtx, 1, OPTAB_WIDEN);
6321 tmp = expand_binop (Pmode, add_optab, stack_pointer_rtx,
6322 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
6323 tmp = expand_binop (Pmode, and_optab, tmp, GEN_INT (-align),
6324 stack_pointer_rtx, 1, OPTAB_WIDEN);
6326 if (tmp != stack_pointer_rtx)
6327 emit_move_insn (stack_pointer_rtx, tmp);
6329 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
6330 tmp = force_reg (Pmode, const0_rtx);
6331 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
6335 #ifndef HAS_INIT_SECTION
6336 emit_library_call (gen_rtx_SYMBOL_REF (Pmode, NAME__MAIN), 0,
6341 extern struct obstack permanent_obstack;
6343 /* The PENDING_SIZES represent the sizes of variable-sized types.
6344 Create RTL for the various sizes now (using temporary variables),
6345 so that we can refer to the sizes from the RTL we are generating
6346 for the current function. The PENDING_SIZES are a TREE_LIST. The
6347 TREE_VALUE of each node is a SAVE_EXPR. */
6350 expand_pending_sizes (pending_sizes)
6355 /* Evaluate now the sizes of any types declared among the arguments. */
6356 for (tem = pending_sizes; tem; tem = TREE_CHAIN (tem))
6358 expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode,
6359 EXPAND_MEMORY_USE_BAD);
6360 /* Flush the queue in case this parameter declaration has
6366 /* Start the RTL for a new function, and set variables used for
6368 SUBR is the FUNCTION_DECL node.
6369 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
6370 the function's parameters, which must be run at any return statement. */
6373 expand_function_start (subr, parms_have_cleanups)
6375 int parms_have_cleanups;
6378 rtx last_ptr = NULL_RTX;
6380 /* Make sure volatile mem refs aren't considered
6381 valid operands of arithmetic insns. */
6382 init_recog_no_volatile ();
6384 /* Set this before generating any memory accesses. */
6385 current_function_check_memory_usage
6386 = (flag_check_memory_usage
6387 && ! DECL_NO_CHECK_MEMORY_USAGE (current_function_decl));
6389 current_function_instrument_entry_exit
6390 = (flag_instrument_function_entry_exit
6391 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
6393 current_function_limit_stack
6394 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
6396 /* If function gets a static chain arg, store it in the stack frame.
6397 Do this first, so it gets the first stack slot offset. */
6398 if (current_function_needs_context)
6400 last_ptr = assign_stack_local (Pmode, GET_MODE_SIZE (Pmode), 0);
6402 /* Delay copying static chain if it is not a register to avoid
6403 conflicts with regs used for parameters. */
6404 if (! SMALL_REGISTER_CLASSES
6405 || GET_CODE (static_chain_incoming_rtx) == REG)
6406 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6409 /* If the parameters of this function need cleaning up, get a label
6410 for the beginning of the code which executes those cleanups. This must
6411 be done before doing anything with return_label. */
6412 if (parms_have_cleanups)
6413 cleanup_label = gen_label_rtx ();
6417 /* Make the label for return statements to jump to. Do not special
6418 case machines with special return instructions -- they will be
6419 handled later during jump, ifcvt, or epilogue creation. */
6420 return_label = gen_label_rtx ();
6422 /* Initialize rtx used to return the value. */
6423 /* Do this before assign_parms so that we copy the struct value address
6424 before any library calls that assign parms might generate. */
6426 /* Decide whether to return the value in memory or in a register. */
6427 if (aggregate_value_p (DECL_RESULT (subr)))
6429 /* Returning something that won't go in a register. */
6430 register rtx value_address = 0;
6432 #ifdef PCC_STATIC_STRUCT_RETURN
6433 if (current_function_returns_pcc_struct)
6435 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
6436 value_address = assemble_static_space (size);
6441 /* Expect to be passed the address of a place to store the value.
6442 If it is passed as an argument, assign_parms will take care of
6444 if (struct_value_incoming_rtx)
6446 value_address = gen_reg_rtx (Pmode);
6447 emit_move_insn (value_address, struct_value_incoming_rtx);
6452 SET_DECL_RTL (DECL_RESULT (subr),
6453 gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)),
6455 set_mem_attributes (DECL_RTL (DECL_RESULT (subr)),
6456 DECL_RESULT (subr), 1);
6459 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
6460 /* If return mode is void, this decl rtl should not be used. */
6461 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
6464 /* Compute the return values into a pseudo reg, which we will copy
6465 into the true return register after the cleanups are done. */
6467 /* In order to figure out what mode to use for the pseudo, we
6468 figure out what the mode of the eventual return register will
6469 actually be, and use that. */
6471 = hard_function_value (TREE_TYPE (DECL_RESULT (subr)),
6474 /* Structures that are returned in registers are not aggregate_value_p,
6475 so we may see a PARALLEL. Don't play pseudo games with this. */
6476 if (! REG_P (hard_reg))
6477 SET_DECL_RTL (DECL_RESULT (subr), hard_reg);
6480 /* Create the pseudo. */
6481 SET_DECL_RTL (DECL_RESULT (subr), gen_reg_rtx (GET_MODE (hard_reg)));
6483 /* Needed because we may need to move this to memory
6484 in case it's a named return value whose address is taken. */
6485 DECL_REGISTER (DECL_RESULT (subr)) = 1;
6489 /* Initialize rtx for parameters and local variables.
6490 In some cases this requires emitting insns. */
6492 assign_parms (subr);
6494 /* Copy the static chain now if it wasn't a register. The delay is to
6495 avoid conflicts with the parameter passing registers. */
6497 if (SMALL_REGISTER_CLASSES && current_function_needs_context)
6498 if (GET_CODE (static_chain_incoming_rtx) != REG)
6499 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6501 /* The following was moved from init_function_start.
6502 The move is supposed to make sdb output more accurate. */
6503 /* Indicate the beginning of the function body,
6504 as opposed to parm setup. */
6505 emit_note (NULL, NOTE_INSN_FUNCTION_BEG);
6507 if (GET_CODE (get_last_insn ()) != NOTE)
6508 emit_note (NULL, NOTE_INSN_DELETED);
6509 parm_birth_insn = get_last_insn ();
6511 context_display = 0;
6512 if (current_function_needs_context)
6514 /* Fetch static chain values for containing functions. */
6515 tem = decl_function_context (current_function_decl);
6516 /* Copy the static chain pointer into a pseudo. If we have
6517 small register classes, copy the value from memory if
6518 static_chain_incoming_rtx is a REG. */
6521 /* If the static chain originally came in a register, put it back
6522 there, then move it out in the next insn. The reason for
6523 this peculiar code is to satisfy function integration. */
6524 if (SMALL_REGISTER_CLASSES
6525 && GET_CODE (static_chain_incoming_rtx) == REG)
6526 emit_move_insn (static_chain_incoming_rtx, last_ptr);
6527 last_ptr = copy_to_reg (static_chain_incoming_rtx);
6532 tree rtlexp = make_node (RTL_EXPR);
6534 RTL_EXPR_RTL (rtlexp) = last_ptr;
6535 context_display = tree_cons (tem, rtlexp, context_display);
6536 tem = decl_function_context (tem);
6539 /* Chain thru stack frames, assuming pointer to next lexical frame
6540 is found at the place we always store it. */
6541 #ifdef FRAME_GROWS_DOWNWARD
6542 last_ptr = plus_constant (last_ptr,
6543 -(HOST_WIDE_INT) GET_MODE_SIZE (Pmode));
6545 last_ptr = gen_rtx_MEM (Pmode, memory_address (Pmode, last_ptr));
6546 MEM_ALIAS_SET (last_ptr) = get_frame_alias_set ();
6547 last_ptr = copy_to_reg (last_ptr);
6549 /* If we are not optimizing, ensure that we know that this
6550 piece of context is live over the entire function. */
6552 save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, last_ptr,
6557 if (current_function_instrument_entry_exit)
6559 rtx fun = DECL_RTL (current_function_decl);
6560 if (GET_CODE (fun) == MEM)
6561 fun = XEXP (fun, 0);
6564 emit_library_call (profile_function_entry_libfunc, 0, VOIDmode, 2,
6566 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
6568 hard_frame_pointer_rtx),
6574 PROFILE_HOOK (profile_label_no);
6577 /* After the display initializations is where the tail-recursion label
6578 should go, if we end up needing one. Ensure we have a NOTE here
6579 since some things (like trampolines) get placed before this. */
6580 tail_recursion_reentry = emit_note (NULL, NOTE_INSN_DELETED);
6582 /* Evaluate now the sizes of any types declared among the arguments. */
6583 expand_pending_sizes (nreverse (get_pending_sizes ()));
6585 /* Make sure there is a line number after the function entry setup code. */
6586 force_next_line_note ();
6589 /* Undo the effects of init_dummy_function_start. */
6591 expand_dummy_function_end ()
6593 /* End any sequences that failed to be closed due to syntax errors. */
6594 while (in_sequence_p ())
6597 /* Outside function body, can't compute type's actual size
6598 until next function's body starts. */
6600 free_after_parsing (cfun);
6601 free_after_compilation (cfun);
6606 /* Call DOIT for each hard register used as a return value from
6607 the current function. */
6610 diddle_return_value (doit, arg)
6611 void (*doit) PARAMS ((rtx, void *));
6614 rtx outgoing = current_function_return_rtx;
6619 if (GET_CODE (outgoing) == REG)
6620 (*doit) (outgoing, arg);
6621 else if (GET_CODE (outgoing) == PARALLEL)
6625 for (i = 0; i < XVECLEN (outgoing, 0); i++)
6627 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
6629 if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
6636 do_clobber_return_reg (reg, arg)
6638 void *arg ATTRIBUTE_UNUSED;
6640 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
6644 clobber_return_register ()
6646 diddle_return_value (do_clobber_return_reg, NULL);
6648 /* In case we do use pseudo to return value, clobber it too. */
6649 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6651 tree decl_result = DECL_RESULT (current_function_decl);
6652 rtx decl_rtl = DECL_RTL (decl_result);
6653 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
6655 do_clobber_return_reg (decl_rtl, NULL);
6661 do_use_return_reg (reg, arg)
6663 void *arg ATTRIBUTE_UNUSED;
6665 emit_insn (gen_rtx_USE (VOIDmode, reg));
6669 use_return_register ()
6671 diddle_return_value (do_use_return_reg, NULL);
6674 /* Generate RTL for the end of the current function.
6675 FILENAME and LINE are the current position in the source file.
6677 It is up to language-specific callers to do cleanups for parameters--
6678 or else, supply 1 for END_BINDINGS and we will call expand_end_bindings. */
6681 expand_function_end (filename, line, end_bindings)
6682 const char *filename;
6689 #ifdef TRAMPOLINE_TEMPLATE
6690 static rtx initial_trampoline;
6693 finish_expr_for_function ();
6695 #ifdef NON_SAVING_SETJMP
6696 /* Don't put any variables in registers if we call setjmp
6697 on a machine that fails to restore the registers. */
6698 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
6700 if (DECL_INITIAL (current_function_decl) != error_mark_node)
6701 setjmp_protect (DECL_INITIAL (current_function_decl));
6703 setjmp_protect_args ();
6707 /* Save the argument pointer if a save area was made for it. */
6708 if (arg_pointer_save_area)
6710 /* arg_pointer_save_area may not be a valid memory address, so we
6711 have to check it and fix it if necessary. */
6714 emit_move_insn (validize_mem (arg_pointer_save_area),
6715 virtual_incoming_args_rtx);
6716 seq = gen_sequence ();
6718 emit_insn_before (seq, tail_recursion_reentry);
6721 /* Initialize any trampolines required by this function. */
6722 for (link = trampoline_list; link; link = TREE_CHAIN (link))
6724 tree function = TREE_PURPOSE (link);
6725 rtx context ATTRIBUTE_UNUSED = lookup_static_chain (function);
6726 rtx tramp = RTL_EXPR_RTL (TREE_VALUE (link));
6727 #ifdef TRAMPOLINE_TEMPLATE
6732 #ifdef TRAMPOLINE_TEMPLATE
6733 /* First make sure this compilation has a template for
6734 initializing trampolines. */
6735 if (initial_trampoline == 0)
6738 = gen_rtx_MEM (BLKmode, assemble_trampoline_template ());
6740 ggc_add_rtx_root (&initial_trampoline, 1);
6744 /* Generate insns to initialize the trampoline. */
6746 tramp = round_trampoline_addr (XEXP (tramp, 0));
6747 #ifdef TRAMPOLINE_TEMPLATE
6748 blktramp = change_address (initial_trampoline, BLKmode, tramp);
6749 emit_block_move (blktramp, initial_trampoline,
6750 GEN_INT (TRAMPOLINE_SIZE),
6751 TRAMPOLINE_ALIGNMENT);
6753 INITIALIZE_TRAMPOLINE (tramp, XEXP (DECL_RTL (function), 0), context);
6757 /* Put those insns at entry to the containing function (this one). */
6758 emit_insns_before (seq, tail_recursion_reentry);
6761 /* If we are doing stack checking and this function makes calls,
6762 do a stack probe at the start of the function to ensure we have enough
6763 space for another stack frame. */
6764 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
6768 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
6769 if (GET_CODE (insn) == CALL_INSN)
6772 probe_stack_range (STACK_CHECK_PROTECT,
6773 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
6776 emit_insns_before (seq, tail_recursion_reentry);
6781 /* Warn about unused parms if extra warnings were specified. */
6782 /* Either ``-W -Wunused'' or ``-Wunused-parameter'' enables this
6783 warning. WARN_UNUSED_PARAMETER is negative when set by
6785 if (warn_unused_parameter > 0
6786 || (warn_unused_parameter < 0 && extra_warnings))
6790 for (decl = DECL_ARGUMENTS (current_function_decl);
6791 decl; decl = TREE_CHAIN (decl))
6792 if (! TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
6793 && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl))
6794 warning_with_decl (decl, "unused parameter `%s'");
6797 /* Delete handlers for nonlocal gotos if nothing uses them. */
6798 if (nonlocal_goto_handler_slots != 0
6799 && ! current_function_has_nonlocal_label)
6802 /* End any sequences that failed to be closed due to syntax errors. */
6803 while (in_sequence_p ())
6806 /* Outside function body, can't compute type's actual size
6807 until next function's body starts. */
6808 immediate_size_expand--;
6810 clear_pending_stack_adjust ();
6811 do_pending_stack_adjust ();
6813 /* Mark the end of the function body.
6814 If control reaches this insn, the function can drop through
6815 without returning a value. */
6816 emit_note (NULL, NOTE_INSN_FUNCTION_END);
6818 /* Must mark the last line number note in the function, so that the test
6819 coverage code can avoid counting the last line twice. This just tells
6820 the code to ignore the immediately following line note, since there
6821 already exists a copy of this note somewhere above. This line number
6822 note is still needed for debugging though, so we can't delete it. */
6823 if (flag_test_coverage)
6824 emit_note (NULL, NOTE_INSN_REPEATED_LINE_NUMBER);
6826 /* Output a linenumber for the end of the function.
6827 SDB depends on this. */
6828 emit_line_note_force (filename, line);
6830 /* Before the return label (if any), clobber the return
6831 registers so that they are not propogated live to the rest of
6832 the function. This can only happen with functions that drop
6833 through; if there had been a return statement, there would
6834 have either been a return rtx, or a jump to the return label.
6836 We delay actual code generation after the current_function_value_rtx
6838 clobber_after = get_last_insn ();
6840 /* Output the label for the actual return from the function,
6841 if one is expected. This happens either because a function epilogue
6842 is used instead of a return instruction, or because a return was done
6843 with a goto in order to run local cleanups, or because of pcc-style
6844 structure returning. */
6846 emit_label (return_label);
6848 /* C++ uses this. */
6850 expand_end_bindings (0, 0, 0);
6852 if (current_function_instrument_entry_exit)
6854 rtx fun = DECL_RTL (current_function_decl);
6855 if (GET_CODE (fun) == MEM)
6856 fun = XEXP (fun, 0);
6859 emit_library_call (profile_function_exit_libfunc, 0, VOIDmode, 2,
6861 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
6863 hard_frame_pointer_rtx),
6867 /* Let except.c know where it should emit the call to unregister
6868 the function context for sjlj exceptions. */
6869 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
6870 sjlj_emit_function_exit_after (get_last_insn ());
6872 /* If we had calls to alloca, and this machine needs
6873 an accurate stack pointer to exit the function,
6874 insert some code to save and restore the stack pointer. */
6875 #ifdef EXIT_IGNORE_STACK
6876 if (! EXIT_IGNORE_STACK)
6878 if (current_function_calls_alloca)
6882 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
6883 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
6886 /* If scalar return value was computed in a pseudo-reg, or was a named
6887 return value that got dumped to the stack, copy that to the hard
6889 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6891 tree decl_result = DECL_RESULT (current_function_decl);
6892 rtx decl_rtl = DECL_RTL (decl_result);
6894 if (REG_P (decl_rtl)
6895 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
6896 : DECL_REGISTER (decl_result))
6900 #ifdef FUNCTION_OUTGOING_VALUE
6901 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
6902 current_function_decl);
6904 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
6905 current_function_decl);
6907 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
6909 /* If this is a BLKmode structure being returned in registers,
6910 then use the mode computed in expand_return. Note that if
6911 decl_rtl is memory, then its mode may have been changed,
6912 but that current_function_return_rtx has not. */
6913 if (GET_MODE (real_decl_rtl) == BLKmode)
6914 PUT_MODE (real_decl_rtl, GET_MODE (current_function_return_rtx));
6916 /* If a named return value dumped decl_return to memory, then
6917 we may need to re-do the PROMOTE_MODE signed/unsigned
6919 if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
6921 int unsignedp = TREE_UNSIGNED (TREE_TYPE (decl_result));
6923 #ifdef PROMOTE_FUNCTION_RETURN
6924 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
6928 convert_move (real_decl_rtl, decl_rtl, unsignedp);
6930 else if (GET_CODE (real_decl_rtl) == PARALLEL)
6931 emit_group_load (real_decl_rtl, decl_rtl,
6932 int_size_in_bytes (TREE_TYPE (decl_result)),
6933 TYPE_ALIGN (TREE_TYPE (decl_result)));
6935 emit_move_insn (real_decl_rtl, decl_rtl);
6937 /* The delay slot scheduler assumes that current_function_return_rtx
6938 holds the hard register containing the return value, not a
6939 temporary pseudo. */
6940 current_function_return_rtx = real_decl_rtl;
6944 /* If returning a structure, arrange to return the address of the value
6945 in a place where debuggers expect to find it.
6947 If returning a structure PCC style,
6948 the caller also depends on this value.
6949 And current_function_returns_pcc_struct is not necessarily set. */
6950 if (current_function_returns_struct
6951 || current_function_returns_pcc_struct)
6954 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
6955 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
6956 #ifdef FUNCTION_OUTGOING_VALUE
6958 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
6959 current_function_decl);
6962 = FUNCTION_VALUE (build_pointer_type (type), current_function_decl);
6965 /* Mark this as a function return value so integrate will delete the
6966 assignment and USE below when inlining this function. */
6967 REG_FUNCTION_VALUE_P (outgoing) = 1;
6969 #ifdef POINTERS_EXTEND_UNSIGNED
6970 /* The address may be ptr_mode and OUTGOING may be Pmode. */
6971 if (GET_MODE (outgoing) != GET_MODE (value_address))
6972 value_address = convert_memory_address (GET_MODE (outgoing),
6976 emit_move_insn (outgoing, value_address);
6978 /* Show return register used to hold result (in this case the address
6980 current_function_return_rtx = outgoing;
6983 /* If this is an implementation of throw, do what's necessary to
6984 communicate between __builtin_eh_return and the epilogue. */
6985 expand_eh_return ();
6987 /* Emit the actual code to clobber return register. */
6992 clobber_return_register ();
6993 seq = gen_sequence ();
6996 after = emit_insn_after (seq, clobber_after);
6998 if (clobber_after != after)
6999 cfun->x_clobber_return_insn = after;
7002 /* ??? This should no longer be necessary since stupid is no longer with
7003 us, but there are some parts of the compiler (eg reload_combine, and
7004 sh mach_dep_reorg) that still try and compute their own lifetime info
7005 instead of using the general framework. */
7006 use_return_register ();
7008 /* Fix up any gotos that jumped out to the outermost
7009 binding level of the function.
7010 Must follow emitting RETURN_LABEL. */
7012 /* If you have any cleanups to do at this point,
7013 and they need to create temporary variables,
7014 then you will lose. */
7015 expand_fixups (get_insns ());
7018 /* Extend a vector that records the INSN_UIDs of INSNS (either a
7019 sequence or a single insn). */
7022 record_insns (insns, vecp)
7026 if (GET_CODE (insns) == SEQUENCE)
7028 int len = XVECLEN (insns, 0);
7029 int i = VARRAY_SIZE (*vecp);
7031 VARRAY_GROW (*vecp, i + len);
7034 VARRAY_INT (*vecp, i) = INSN_UID (XVECEXP (insns, 0, len));
7040 int i = VARRAY_SIZE (*vecp);
7041 VARRAY_GROW (*vecp, i + 1);
7042 VARRAY_INT (*vecp, i) = INSN_UID (insns);
7046 /* Determine how many INSN_UIDs in VEC are part of INSN. */
7049 contains (insn, vec)
7055 if (GET_CODE (insn) == INSN
7056 && GET_CODE (PATTERN (insn)) == SEQUENCE)
7059 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
7060 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7061 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j))
7067 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7068 if (INSN_UID (insn) == VARRAY_INT (vec, j))
7075 prologue_epilogue_contains (insn)
7078 if (contains (insn, prologue))
7080 if (contains (insn, epilogue))
7086 sibcall_epilogue_contains (insn)
7089 if (sibcall_epilogue)
7090 return contains (insn, sibcall_epilogue);
7095 /* Insert gen_return at the end of block BB. This also means updating
7096 block_for_insn appropriately. */
7099 emit_return_into_block (bb, line_note)
7105 p = NEXT_INSN (bb->end);
7106 end = emit_jump_insn_after (gen_return (), bb->end);
7108 emit_line_note_after (NOTE_SOURCE_FILE (line_note),
7109 NOTE_LINE_NUMBER (line_note), bb->end);
7113 set_block_for_insn (p, bb);
7120 #endif /* HAVE_return */
7122 #ifdef HAVE_epilogue
7124 /* Modify SEQ, a SEQUENCE that is part of the epilogue, to no modifications
7125 to the stack pointer. */
7128 keep_stack_depressed (seq)
7132 rtx sp_from_reg = 0;
7133 int sp_modified_unknown = 0;
7135 /* If the epilogue is just a single instruction, it's OK as is */
7137 if (GET_CODE (seq) != SEQUENCE)
7140 /* Scan all insns in SEQ looking for ones that modified the stack
7141 pointer. Record if it modified the stack pointer by copying it
7142 from the frame pointer or if it modified it in some other way.
7143 Then modify any subsequent stack pointer references to take that
7144 into account. We start by only allowing SP to be copied from a
7145 register (presumably FP) and then be subsequently referenced. */
7147 for (i = 0; i < XVECLEN (seq, 0); i++)
7149 rtx insn = XVECEXP (seq, 0, i);
7151 if (GET_RTX_CLASS (GET_CODE (insn)) != 'i')
7154 if (reg_set_p (stack_pointer_rtx, insn))
7156 rtx set = single_set (insn);
7158 /* If SP is set as a side-effect, we can't support this. */
7162 if (GET_CODE (SET_SRC (set)) == REG)
7163 sp_from_reg = SET_SRC (set);
7165 sp_modified_unknown = 1;
7167 /* Don't allow the SP modification to happen. */
7168 PUT_CODE (insn, NOTE);
7169 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
7170 NOTE_SOURCE_FILE (insn) = 0;
7172 else if (reg_referenced_p (stack_pointer_rtx, PATTERN (insn)))
7174 if (sp_modified_unknown)
7177 else if (sp_from_reg != 0)
7179 = replace_rtx (PATTERN (insn), stack_pointer_rtx, sp_from_reg);
7185 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
7186 this into place with notes indicating where the prologue ends and where
7187 the epilogue begins. Update the basic block information when possible. */
7190 thread_prologue_and_epilogue_insns (f)
7191 rtx f ATTRIBUTE_UNUSED;
7196 #ifdef HAVE_prologue
7197 rtx prologue_end = NULL_RTX;
7199 #if defined (HAVE_epilogue) || defined(HAVE_return)
7200 rtx epilogue_end = NULL_RTX;
7203 #ifdef HAVE_prologue
7207 seq = gen_prologue ();
7210 /* Retain a map of the prologue insns. */
7211 if (GET_CODE (seq) != SEQUENCE)
7213 record_insns (seq, &prologue);
7214 prologue_end = emit_note (NULL, NOTE_INSN_PROLOGUE_END);
7216 seq = gen_sequence ();
7219 /* Can't deal with multiple successsors of the entry block
7220 at the moment. Function should always have at least one
7222 if (!ENTRY_BLOCK_PTR->succ || ENTRY_BLOCK_PTR->succ->succ_next)
7225 insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ);
7230 /* If the exit block has no non-fake predecessors, we don't need
7232 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7233 if ((e->flags & EDGE_FAKE) == 0)
7239 if (optimize && HAVE_return)
7241 /* If we're allowed to generate a simple return instruction,
7242 then by definition we don't need a full epilogue. Examine
7243 the block that falls through to EXIT. If it does not
7244 contain any code, examine its predecessors and try to
7245 emit (conditional) return instructions. */
7251 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7252 if (e->flags & EDGE_FALLTHRU)
7258 /* Verify that there are no active instructions in the last block. */
7260 while (label && GET_CODE (label) != CODE_LABEL)
7262 if (active_insn_p (label))
7264 label = PREV_INSN (label);
7267 if (last->head == label && GET_CODE (label) == CODE_LABEL)
7269 rtx epilogue_line_note = NULL_RTX;
7271 /* Locate the line number associated with the closing brace,
7272 if we can find one. */
7273 for (seq = get_last_insn ();
7274 seq && ! active_insn_p (seq);
7275 seq = PREV_INSN (seq))
7276 if (GET_CODE (seq) == NOTE && NOTE_LINE_NUMBER (seq) > 0)
7278 epilogue_line_note = seq;
7282 for (e = last->pred; e; e = e_next)
7284 basic_block bb = e->src;
7287 e_next = e->pred_next;
7288 if (bb == ENTRY_BLOCK_PTR)
7292 if ((GET_CODE (jump) != JUMP_INSN) || JUMP_LABEL (jump) != label)
7295 /* If we have an unconditional jump, we can replace that
7296 with a simple return instruction. */
7297 if (simplejump_p (jump))
7299 emit_return_into_block (bb, epilogue_line_note);
7300 flow_delete_insn (jump);
7303 /* If we have a conditional jump, we can try to replace
7304 that with a conditional return instruction. */
7305 else if (condjump_p (jump))
7309 ret = SET_SRC (PATTERN (jump));
7310 if (GET_CODE (XEXP (ret, 1)) == LABEL_REF)
7311 loc = &XEXP (ret, 1);
7313 loc = &XEXP (ret, 2);
7314 ret = gen_rtx_RETURN (VOIDmode);
7316 if (! validate_change (jump, loc, ret, 0))
7318 if (JUMP_LABEL (jump))
7319 LABEL_NUSES (JUMP_LABEL (jump))--;
7321 /* If this block has only one successor, it both jumps
7322 and falls through to the fallthru block, so we can't
7324 if (bb->succ->succ_next == NULL)
7330 /* Fix up the CFG for the successful change we just made. */
7331 redirect_edge_succ (e, EXIT_BLOCK_PTR);
7334 /* Emit a return insn for the exit fallthru block. Whether
7335 this is still reachable will be determined later. */
7337 emit_barrier_after (last->end);
7338 emit_return_into_block (last, epilogue_line_note);
7339 epilogue_end = last->end;
7344 #ifdef HAVE_epilogue
7347 /* Find the edge that falls through to EXIT. Other edges may exist
7348 due to RETURN instructions, but those don't need epilogues.
7349 There really shouldn't be a mixture -- either all should have
7350 been converted or none, however... */
7352 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7353 if (e->flags & EDGE_FALLTHRU)
7359 epilogue_end = emit_note (NULL, NOTE_INSN_EPILOGUE_BEG);
7361 seq = gen_epilogue ();
7363 /* If this function returns with the stack depressed, massage
7364 the epilogue to actually do that. */
7365 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
7366 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
7367 keep_stack_depressed (seq);
7369 emit_jump_insn (seq);
7371 /* Retain a map of the epilogue insns. */
7372 if (GET_CODE (seq) != SEQUENCE)
7374 record_insns (seq, &epilogue);
7376 seq = gen_sequence ();
7379 insert_insn_on_edge (seq, e);
7386 commit_edge_insertions ();
7388 #ifdef HAVE_sibcall_epilogue
7389 /* Emit sibling epilogues before any sibling call sites. */
7390 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7392 basic_block bb = e->src;
7397 if (GET_CODE (insn) != CALL_INSN
7398 || ! SIBLING_CALL_P (insn))
7402 seq = gen_sibcall_epilogue ();
7405 i = PREV_INSN (insn);
7406 newinsn = emit_insn_before (seq, insn);
7408 /* Update the UID to basic block map. */
7409 for (i = NEXT_INSN (i); i != insn; i = NEXT_INSN (i))
7410 set_block_for_insn (i, bb);
7412 /* Retain a map of the epilogue insns. Used in life analysis to
7413 avoid getting rid of sibcall epilogue insns. */
7414 record_insns (GET_CODE (seq) == SEQUENCE
7415 ? seq : newinsn, &sibcall_epilogue);
7419 #ifdef HAVE_prologue
7424 /* GDB handles `break f' by setting a breakpoint on the first
7425 line note after the prologue. Which means (1) that if
7426 there are line number notes before where we inserted the
7427 prologue we should move them, and (2) we should generate a
7428 note before the end of the first basic block, if there isn't
7431 ??? This behaviour is completely broken when dealing with
7432 multiple entry functions. We simply place the note always
7433 into first basic block and let alternate entry points
7437 for (insn = prologue_end; insn; insn = prev)
7439 prev = PREV_INSN (insn);
7440 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7442 /* Note that we cannot reorder the first insn in the
7443 chain, since rest_of_compilation relies on that
7444 remaining constant. */
7447 reorder_insns (insn, insn, prologue_end);
7451 /* Find the last line number note in the first block. */
7452 for (insn = BASIC_BLOCK (0)->end;
7453 insn != prologue_end && insn;
7454 insn = PREV_INSN (insn))
7455 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7458 /* If we didn't find one, make a copy of the first line number
7462 for (insn = next_active_insn (prologue_end);
7464 insn = PREV_INSN (insn))
7465 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7467 emit_line_note_after (NOTE_SOURCE_FILE (insn),
7468 NOTE_LINE_NUMBER (insn),
7475 #ifdef HAVE_epilogue
7480 /* Similarly, move any line notes that appear after the epilogue.
7481 There is no need, however, to be quite so anal about the existance
7483 for (insn = epilogue_end; insn; insn = next)
7485 next = NEXT_INSN (insn);
7486 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7487 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
7493 /* Reposition the prologue-end and epilogue-begin notes after instruction
7494 scheduling and delayed branch scheduling. */
7497 reposition_prologue_and_epilogue_notes (f)
7498 rtx f ATTRIBUTE_UNUSED;
7500 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
7503 if ((len = VARRAY_SIZE (prologue)) > 0)
7505 register rtx insn, note = 0;
7507 /* Scan from the beginning until we reach the last prologue insn.
7508 We apparently can't depend on basic_block_{head,end} after
7510 for (insn = f; len && insn; insn = NEXT_INSN (insn))
7512 if (GET_CODE (insn) == NOTE)
7514 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
7517 else if ((len -= contains (insn, prologue)) == 0)
7520 /* Find the prologue-end note if we haven't already, and
7521 move it to just after the last prologue insn. */
7524 for (note = insn; (note = NEXT_INSN (note));)
7525 if (GET_CODE (note) == NOTE
7526 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
7530 next = NEXT_INSN (note);
7532 /* Whether or not we can depend on BLOCK_HEAD,
7533 attempt to keep it up-to-date. */
7534 if (BLOCK_HEAD (0) == note)
7535 BLOCK_HEAD (0) = next;
7538 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
7539 if (GET_CODE (insn) == CODE_LABEL)
7540 insn = NEXT_INSN (insn);
7541 add_insn_after (note, insn);
7546 if ((len = VARRAY_SIZE (epilogue)) > 0)
7548 register rtx insn, note = 0;
7550 /* Scan from the end until we reach the first epilogue insn.
7551 We apparently can't depend on basic_block_{head,end} after
7553 for (insn = get_last_insn (); len && insn; insn = PREV_INSN (insn))
7555 if (GET_CODE (insn) == NOTE)
7557 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
7560 else if ((len -= contains (insn, epilogue)) == 0)
7562 /* Find the epilogue-begin note if we haven't already, and
7563 move it to just before the first epilogue insn. */
7566 for (note = insn; (note = PREV_INSN (note));)
7567 if (GET_CODE (note) == NOTE
7568 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
7572 /* Whether or not we can depend on BLOCK_HEAD,
7573 attempt to keep it up-to-date. */
7575 && BLOCK_HEAD (n_basic_blocks-1) == insn)
7576 BLOCK_HEAD (n_basic_blocks-1) = note;
7579 add_insn_before (note, insn);
7583 #endif /* HAVE_prologue or HAVE_epilogue */
7586 /* Mark T for GC. */
7590 struct temp_slot *t;
7594 ggc_mark_rtx (t->slot);
7595 ggc_mark_rtx (t->address);
7596 ggc_mark_tree (t->rtl_expr);
7597 ggc_mark_tree (t->type);
7603 /* Mark P for GC. */
7606 mark_function_status (p)
7615 ggc_mark_rtx (p->arg_offset_rtx);
7617 if (p->x_parm_reg_stack_loc)
7618 for (i = p->x_max_parm_reg, r = p->x_parm_reg_stack_loc;
7622 ggc_mark_rtx (p->return_rtx);
7623 ggc_mark_rtx (p->x_cleanup_label);
7624 ggc_mark_rtx (p->x_return_label);
7625 ggc_mark_rtx (p->x_save_expr_regs);
7626 ggc_mark_rtx (p->x_stack_slot_list);
7627 ggc_mark_rtx (p->x_parm_birth_insn);
7628 ggc_mark_rtx (p->x_tail_recursion_label);
7629 ggc_mark_rtx (p->x_tail_recursion_reentry);
7630 ggc_mark_rtx (p->internal_arg_pointer);
7631 ggc_mark_rtx (p->x_arg_pointer_save_area);
7632 ggc_mark_tree (p->x_rtl_expr_chain);
7633 ggc_mark_rtx (p->x_last_parm_insn);
7634 ggc_mark_tree (p->x_context_display);
7635 ggc_mark_tree (p->x_trampoline_list);
7636 ggc_mark_rtx (p->epilogue_delay_list);
7637 ggc_mark_rtx (p->x_clobber_return_insn);
7639 mark_temp_slot (p->x_temp_slots);
7642 struct var_refs_queue *q = p->fixup_var_refs_queue;
7645 ggc_mark_rtx (q->modified);
7650 ggc_mark_rtx (p->x_nonlocal_goto_handler_slots);
7651 ggc_mark_rtx (p->x_nonlocal_goto_handler_labels);
7652 ggc_mark_rtx (p->x_nonlocal_goto_stack_level);
7653 ggc_mark_tree (p->x_nonlocal_labels);
7655 mark_hard_reg_initial_vals (p);
7658 /* Mark the function chain ARG (which is really a struct function **)
7662 mark_function_chain (arg)
7665 struct function *f = *(struct function **) arg;
7667 for (; f; f = f->next_global)
7669 ggc_mark_tree (f->decl);
7671 mark_function_status (f);
7672 mark_eh_status (f->eh);
7673 mark_stmt_status (f->stmt);
7674 mark_expr_status (f->expr);
7675 mark_emit_status (f->emit);
7676 mark_varasm_status (f->varasm);
7678 if (mark_machine_status)
7679 (*mark_machine_status) (f);
7680 if (mark_lang_status)
7681 (*mark_lang_status) (f);
7683 if (f->original_arg_vector)
7684 ggc_mark_rtvec ((rtvec) f->original_arg_vector);
7685 if (f->original_decl_initial)
7686 ggc_mark_tree (f->original_decl_initial);
7690 /* Called once, at initialization, to initialize function.c. */
7693 init_function_once ()
7695 ggc_add_root (&all_functions, 1, sizeof all_functions,
7696 mark_function_chain);
7698 VARRAY_INT_INIT (prologue, 0, "prologue");
7699 VARRAY_INT_INIT (epilogue, 0, "epilogue");
7700 VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue");