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, 2002 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
26 /* This file handles the generation of rtl code from tree structure
27 at the level of the function as a whole.
28 It creates the rtl expressions for parameters and auto variables
29 and has full responsibility for allocating stack slots.
31 `expand_function_start' is called at the beginning of a function,
32 before the function body is parsed, and `expand_function_end' is
33 called after parsing the body.
35 Call `assign_stack_local' to allocate a stack slot for a local variable.
36 This is usually done during the RTL generation for the function body,
37 but it can also be done in the reload pass when a pseudo-register does
38 not get a hard register.
40 Call `put_var_into_stack' when you learn, belatedly, that a variable
41 previously given a pseudo-register must in fact go in the stack.
42 This function changes the DECL_RTL to be a stack slot instead of a reg
43 then scans all the RTL instructions so far generated to correct them. */
55 #include "hard-reg-set.h"
56 #include "insn-config.h"
59 #include "basic-block.h"
65 #include "integrate.h"
67 #ifndef TRAMPOLINE_ALIGNMENT
68 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
71 #ifndef LOCAL_ALIGNMENT
72 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
75 /* Some systems use __main in a way incompatible with its use in gcc, in these
76 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
77 give the same symbol without quotes for an alternative entry point. You
78 must define both, or neither. */
80 #define NAME__MAIN "__main"
81 #define SYMBOL__MAIN __main
84 /* Round a value to the lowest integer less than it that is a multiple of
85 the required alignment. Avoid using division in case the value is
86 negative. Assume the alignment is a power of two. */
87 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
89 /* Similar, but round to the next highest integer that meets the
91 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
93 /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
94 during rtl generation. If they are different register numbers, this is
95 always true. It may also be true if
96 FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
97 generation. See fix_lexical_addr for details. */
99 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
100 #define NEED_SEPARATE_AP
103 /* Nonzero if function being compiled doesn't contain any calls
104 (ignoring the prologue and epilogue). This is set prior to
105 local register allocation and is valid for the remaining
107 int current_function_is_leaf;
109 /* Nonzero if function being compiled doesn't contain any instructions
110 that can throw an exception. This is set prior to final. */
112 int current_function_nothrow;
114 /* Nonzero if function being compiled doesn't modify the stack pointer
115 (ignoring the prologue and epilogue). This is only valid after
116 life_analysis has run. */
117 int current_function_sp_is_unchanging;
119 /* Nonzero if the function being compiled is a leaf function which only
120 uses leaf registers. This is valid after reload (specifically after
121 sched2) and is useful only if the port defines LEAF_REGISTERS. */
122 int current_function_uses_only_leaf_regs;
124 /* Nonzero once virtual register instantiation has been done.
125 assign_stack_local uses frame_pointer_rtx when this is nonzero.
126 calls.c:emit_library_call_value_1 uses it to set up
127 post-instantiation libcalls. */
128 int virtuals_instantiated;
130 /* These variables hold pointers to functions to create and destroy
131 target specific, per-function data structures. */
132 void (*init_machine_status) PARAMS ((struct function *));
133 void (*free_machine_status) PARAMS ((struct function *));
134 /* This variable holds a pointer to a function to register any
135 data items in the target specific, per-function data structure
136 that will need garbage collection. */
137 void (*mark_machine_status) PARAMS ((struct function *));
139 /* Likewise, but for language-specific data. */
140 void (*init_lang_status) PARAMS ((struct function *));
141 void (*save_lang_status) PARAMS ((struct function *));
142 void (*restore_lang_status) PARAMS ((struct function *));
143 void (*mark_lang_status) PARAMS ((struct function *));
144 void (*free_lang_status) PARAMS ((struct function *));
146 /* The FUNCTION_DECL for an inline function currently being expanded. */
147 tree inline_function_decl;
149 /* The currently compiled function. */
150 struct function *cfun = 0;
152 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
153 static varray_type prologue;
154 static varray_type epilogue;
156 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
158 static varray_type sibcall_epilogue;
160 /* In order to evaluate some expressions, such as function calls returning
161 structures in memory, we need to temporarily allocate stack locations.
162 We record each allocated temporary in the following structure.
164 Associated with each temporary slot is a nesting level. When we pop up
165 one level, all temporaries associated with the previous level are freed.
166 Normally, all temporaries are freed after the execution of the statement
167 in which they were created. However, if we are inside a ({...}) grouping,
168 the result may be in a temporary and hence must be preserved. If the
169 result could be in a temporary, we preserve it if we can determine which
170 one it is in. If we cannot determine which temporary may contain the
171 result, all temporaries are preserved. A temporary is preserved by
172 pretending it was allocated at the previous nesting level.
174 Automatic variables are also assigned temporary slots, at the nesting
175 level where they are defined. They are marked a "kept" so that
176 free_temp_slots will not free them. */
180 /* Points to next temporary slot. */
181 struct temp_slot *next;
182 /* The rtx to used to reference the slot. */
184 /* The rtx used to represent the address if not the address of the
185 slot above. May be an EXPR_LIST if multiple addresses exist. */
187 /* The alignment (in bits) of the slot. */
189 /* The size, in units, of the slot. */
191 /* The type of the object in the slot, or zero if it doesn't correspond
192 to a type. We use this to determine whether a slot can be reused.
193 It can be reused if objects of the type of the new slot will always
194 conflict with objects of the type of the old slot. */
196 /* The value of `sequence_rtl_expr' when this temporary is allocated. */
198 /* Non-zero if this temporary is currently in use. */
200 /* Non-zero if this temporary has its address taken. */
202 /* Nesting level at which this slot is being used. */
204 /* Non-zero if this should survive a call to free_temp_slots. */
206 /* The offset of the slot from the frame_pointer, including extra space
207 for alignment. This info is for combine_temp_slots. */
208 HOST_WIDE_INT base_offset;
209 /* The size of the slot, including extra space for alignment. This
210 info is for combine_temp_slots. */
211 HOST_WIDE_INT full_size;
214 /* This structure is used to record MEMs or pseudos used to replace VAR, any
215 SUBREGs of VAR, and any MEMs containing VAR as an address. We need to
216 maintain this list in case two operands of an insn were required to match;
217 in that case we must ensure we use the same replacement. */
219 struct fixup_replacement
223 struct fixup_replacement *next;
226 struct insns_for_mem_entry
228 /* The KEY in HE will be a MEM. */
229 struct hash_entry he;
230 /* These are the INSNS which reference the MEM. */
234 /* Forward declarations. */
236 static rtx assign_stack_local_1 PARAMS ((enum machine_mode, HOST_WIDE_INT,
237 int, struct function *));
238 static struct temp_slot *find_temp_slot_from_address PARAMS ((rtx));
239 static void put_reg_into_stack PARAMS ((struct function *, rtx, tree,
240 enum machine_mode, enum machine_mode,
241 int, unsigned int, int,
242 struct hash_table *));
243 static void schedule_fixup_var_refs PARAMS ((struct function *, rtx, tree,
245 struct hash_table *));
246 static void fixup_var_refs PARAMS ((rtx, enum machine_mode, int,
247 struct hash_table *));
248 static struct fixup_replacement
249 *find_fixup_replacement PARAMS ((struct fixup_replacement **, rtx));
250 static void fixup_var_refs_insns PARAMS ((rtx, rtx, enum machine_mode,
252 static void fixup_var_refs_insns_with_hash
253 PARAMS ((struct hash_table *, rtx,
254 enum machine_mode, int));
255 static void fixup_var_refs_insn PARAMS ((rtx, rtx, enum machine_mode,
257 static void fixup_var_refs_1 PARAMS ((rtx, enum machine_mode, rtx *, rtx,
258 struct fixup_replacement **));
259 static rtx fixup_memory_subreg PARAMS ((rtx, rtx, int));
260 static rtx walk_fixup_memory_subreg PARAMS ((rtx, rtx, int));
261 static rtx fixup_stack_1 PARAMS ((rtx, rtx));
262 static void optimize_bit_field PARAMS ((rtx, rtx, rtx *));
263 static void instantiate_decls PARAMS ((tree, int));
264 static void instantiate_decls_1 PARAMS ((tree, int));
265 static void instantiate_decl PARAMS ((rtx, HOST_WIDE_INT, int));
266 static rtx instantiate_new_reg PARAMS ((rtx, HOST_WIDE_INT *));
267 static int instantiate_virtual_regs_1 PARAMS ((rtx *, rtx, int));
268 static void delete_handlers PARAMS ((void));
269 static void pad_to_arg_alignment PARAMS ((struct args_size *, int,
270 struct args_size *));
271 #ifndef ARGS_GROW_DOWNWARD
272 static void pad_below PARAMS ((struct args_size *, enum machine_mode,
275 static rtx round_trampoline_addr PARAMS ((rtx));
276 static rtx adjust_trampoline_addr PARAMS ((rtx));
277 static tree *identify_blocks_1 PARAMS ((rtx, tree *, tree *, tree *));
278 static void reorder_blocks_0 PARAMS ((tree));
279 static void reorder_blocks_1 PARAMS ((rtx, tree, varray_type *));
280 static void reorder_fix_fragments PARAMS ((tree));
281 static tree blocks_nreverse PARAMS ((tree));
282 static int all_blocks PARAMS ((tree, tree *));
283 static tree *get_block_vector PARAMS ((tree, int *));
284 extern tree debug_find_var_in_block_tree PARAMS ((tree, tree));
285 /* We always define `record_insns' even if its not used so that we
286 can always export `prologue_epilogue_contains'. */
287 static void record_insns PARAMS ((rtx, varray_type *)) ATTRIBUTE_UNUSED;
288 static int contains PARAMS ((rtx, varray_type));
290 static void emit_return_into_block PARAMS ((basic_block, rtx));
292 static void put_addressof_into_stack PARAMS ((rtx, struct hash_table *));
293 static bool purge_addressof_1 PARAMS ((rtx *, rtx, int, int,
294 struct hash_table *));
295 static void purge_single_hard_subreg_set PARAMS ((rtx));
296 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
297 static rtx keep_stack_depressed PARAMS ((rtx));
299 static int is_addressof PARAMS ((rtx *, void *));
300 static struct hash_entry *insns_for_mem_newfunc PARAMS ((struct hash_entry *,
303 static unsigned long insns_for_mem_hash PARAMS ((hash_table_key));
304 static bool insns_for_mem_comp PARAMS ((hash_table_key, hash_table_key));
305 static int insns_for_mem_walk PARAMS ((rtx *, void *));
306 static void compute_insns_for_mem PARAMS ((rtx, rtx, struct hash_table *));
307 static void mark_function_status PARAMS ((struct function *));
308 static void maybe_mark_struct_function PARAMS ((void *));
309 static void prepare_function_start PARAMS ((void));
310 static void do_clobber_return_reg PARAMS ((rtx, void *));
311 static void do_use_return_reg PARAMS ((rtx, void *));
313 /* Pointer to chain of `struct function' for containing functions. */
314 static struct function *outer_function_chain;
316 /* Given a function decl for a containing function,
317 return the `struct function' for it. */
320 find_function_data (decl)
325 for (p = outer_function_chain; p; p = p->outer)
332 /* Save the current context for compilation of a nested function.
333 This is called from language-specific code. The caller should use
334 the save_lang_status callback to save any language-specific state,
335 since this function knows only about language-independent
339 push_function_context_to (context)
346 if (context == current_function_decl)
347 cfun->contains_functions = 1;
350 struct function *containing = find_function_data (context);
351 containing->contains_functions = 1;
356 init_dummy_function_start ();
359 p->outer = outer_function_chain;
360 outer_function_chain = p;
361 p->fixup_var_refs_queue = 0;
363 if (save_lang_status)
364 (*save_lang_status) (p);
370 push_function_context ()
372 push_function_context_to (current_function_decl);
375 /* Restore the last saved context, at the end of a nested function.
376 This function is called from language-specific code. */
379 pop_function_context_from (context)
380 tree context ATTRIBUTE_UNUSED;
382 struct function *p = outer_function_chain;
383 struct var_refs_queue *queue;
386 outer_function_chain = p->outer;
388 current_function_decl = p->decl;
391 restore_emit_status (p);
393 if (restore_lang_status)
394 (*restore_lang_status) (p);
396 /* Finish doing put_var_into_stack for any of our variables
397 which became addressable during the nested function. */
398 for (queue = p->fixup_var_refs_queue; queue; queue = queue->next)
399 fixup_var_refs (queue->modified, queue->promoted_mode,
400 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)
443 free_expr_status (f);
444 free_emit_status (f);
445 free_varasm_status (f);
447 if (free_machine_status)
448 (*free_machine_status) (f);
450 if (f->x_parm_reg_stack_loc)
451 free (f->x_parm_reg_stack_loc);
453 f->x_temp_slots = NULL;
454 f->arg_offset_rtx = NULL;
455 f->return_rtx = NULL;
456 f->internal_arg_pointer = NULL;
457 f->x_nonlocal_labels = NULL;
458 f->x_nonlocal_goto_handler_slots = NULL;
459 f->x_nonlocal_goto_handler_labels = NULL;
460 f->x_nonlocal_goto_stack_level = NULL;
461 f->x_cleanup_label = NULL;
462 f->x_return_label = NULL;
463 f->x_save_expr_regs = NULL;
464 f->x_stack_slot_list = NULL;
465 f->x_rtl_expr_chain = NULL;
466 f->x_tail_recursion_label = NULL;
467 f->x_tail_recursion_reentry = NULL;
468 f->x_arg_pointer_save_area = NULL;
469 f->x_clobber_return_insn = NULL;
470 f->x_context_display = NULL;
471 f->x_trampoline_list = NULL;
472 f->x_parm_birth_insn = NULL;
473 f->x_last_parm_insn = NULL;
474 f->x_parm_reg_stack_loc = NULL;
475 f->fixup_var_refs_queue = NULL;
476 f->original_arg_vector = NULL;
477 f->original_decl_initial = NULL;
478 f->inl_last_parm_insn = NULL;
479 f->epilogue_delay_list = NULL;
482 /* Allocate fixed slots in the stack frame of the current function. */
484 /* Return size needed for stack frame based on slots so far allocated in
486 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
487 the caller may have to do that. */
490 get_func_frame_size (f)
493 #ifdef FRAME_GROWS_DOWNWARD
494 return -f->x_frame_offset;
496 return f->x_frame_offset;
500 /* Return size needed for stack frame based on slots so far allocated.
501 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
502 the caller may have to do that. */
506 return get_func_frame_size (cfun);
509 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
510 with machine mode MODE.
512 ALIGN controls the amount of alignment for the address of the slot:
513 0 means according to MODE,
514 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
515 positive specifies alignment boundary in bits.
517 We do not round to stack_boundary here.
519 FUNCTION specifies the function to allocate in. */
522 assign_stack_local_1 (mode, size, align, function)
523 enum machine_mode mode;
526 struct function *function;
529 int bigend_correction = 0;
531 int frame_off, frame_alignment, frame_phase;
538 alignment = BIGGEST_ALIGNMENT;
540 alignment = GET_MODE_ALIGNMENT (mode);
542 /* Allow the target to (possibly) increase the alignment of this
544 type = type_for_mode (mode, 0);
546 alignment = LOCAL_ALIGNMENT (type, alignment);
548 alignment /= BITS_PER_UNIT;
550 else if (align == -1)
552 alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
553 size = CEIL_ROUND (size, alignment);
556 alignment = align / BITS_PER_UNIT;
558 #ifdef FRAME_GROWS_DOWNWARD
559 function->x_frame_offset -= size;
562 /* Ignore alignment we can't do with expected alignment of the boundary. */
563 if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY)
564 alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
566 if (function->stack_alignment_needed < alignment * BITS_PER_UNIT)
567 function->stack_alignment_needed = alignment * BITS_PER_UNIT;
569 /* Calculate how many bytes the start of local variables is off from
571 frame_alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
572 frame_off = STARTING_FRAME_OFFSET % frame_alignment;
573 frame_phase = frame_off ? frame_alignment - frame_off : 0;
575 /* Round frame offset to that alignment.
576 We must be careful here, since FRAME_OFFSET might be negative and
577 division with a negative dividend isn't as well defined as we might
578 like. So we instead assume that ALIGNMENT is a power of two and
579 use logical operations which are unambiguous. */
580 #ifdef FRAME_GROWS_DOWNWARD
581 function->x_frame_offset = FLOOR_ROUND (function->x_frame_offset - frame_phase, alignment) + frame_phase;
583 function->x_frame_offset = CEIL_ROUND (function->x_frame_offset - frame_phase, alignment) + frame_phase;
586 /* On a big-endian machine, if we are allocating more space than we will use,
587 use the least significant bytes of those that are allocated. */
588 if (BYTES_BIG_ENDIAN && mode != BLKmode)
589 bigend_correction = size - GET_MODE_SIZE (mode);
591 /* If we have already instantiated virtual registers, return the actual
592 address relative to the frame pointer. */
593 if (function == cfun && virtuals_instantiated)
594 addr = plus_constant (frame_pointer_rtx,
595 (frame_offset + bigend_correction
596 + STARTING_FRAME_OFFSET));
598 addr = plus_constant (virtual_stack_vars_rtx,
599 function->x_frame_offset + bigend_correction);
601 #ifndef FRAME_GROWS_DOWNWARD
602 function->x_frame_offset += size;
605 x = gen_rtx_MEM (mode, addr);
607 function->x_stack_slot_list
608 = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list);
613 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
617 assign_stack_local (mode, size, align)
618 enum machine_mode mode;
622 return assign_stack_local_1 (mode, size, align, cfun);
625 /* Allocate a temporary stack slot and record it for possible later
628 MODE is the machine mode to be given to the returned rtx.
630 SIZE is the size in units of the space required. We do no rounding here
631 since assign_stack_local will do any required rounding.
633 KEEP is 1 if this slot is to be retained after a call to
634 free_temp_slots. Automatic variables for a block are allocated
635 with this flag. KEEP is 2 if we allocate a longer term temporary,
636 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
637 if we are to allocate something at an inner level to be treated as
638 a variable in the block (e.g., a SAVE_EXPR).
640 TYPE is the type that will be used for the stack slot. */
643 assign_stack_temp_for_type (mode, size, keep, type)
644 enum machine_mode mode;
650 struct temp_slot *p, *best_p = 0;
652 /* If SIZE is -1 it means that somebody tried to allocate a temporary
653 of a variable size. */
658 align = BIGGEST_ALIGNMENT;
660 align = GET_MODE_ALIGNMENT (mode);
663 type = type_for_mode (mode, 0);
666 align = LOCAL_ALIGNMENT (type, align);
668 /* Try to find an available, already-allocated temporary of the proper
669 mode which meets the size and alignment requirements. Choose the
670 smallest one with the closest alignment. */
671 for (p = temp_slots; p; p = p->next)
672 if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode
674 && objects_must_conflict_p (p->type, type)
675 && (best_p == 0 || best_p->size > p->size
676 || (best_p->size == p->size && best_p->align > p->align)))
678 if (p->align == align && p->size == size)
686 /* Make our best, if any, the one to use. */
689 /* If there are enough aligned bytes left over, make them into a new
690 temp_slot so that the extra bytes don't get wasted. Do this only
691 for BLKmode slots, so that we can be sure of the alignment. */
692 if (GET_MODE (best_p->slot) == BLKmode)
694 int alignment = best_p->align / BITS_PER_UNIT;
695 HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment);
697 if (best_p->size - rounded_size >= alignment)
699 p = (struct temp_slot *) ggc_alloc (sizeof (struct temp_slot));
700 p->in_use = p->addr_taken = 0;
701 p->size = best_p->size - rounded_size;
702 p->base_offset = best_p->base_offset + rounded_size;
703 p->full_size = best_p->full_size - rounded_size;
704 p->slot = gen_rtx_MEM (BLKmode,
705 plus_constant (XEXP (best_p->slot, 0),
707 p->align = best_p->align;
710 p->type = best_p->type;
711 p->next = temp_slots;
714 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot,
717 best_p->size = rounded_size;
718 best_p->full_size = rounded_size;
725 /* If we still didn't find one, make a new temporary. */
728 HOST_WIDE_INT frame_offset_old = frame_offset;
730 p = (struct temp_slot *) ggc_alloc (sizeof (struct temp_slot));
732 /* We are passing an explicit alignment request to assign_stack_local.
733 One side effect of that is assign_stack_local will not round SIZE
734 to ensure the frame offset remains suitably aligned.
736 So for requests which depended on the rounding of SIZE, we go ahead
737 and round it now. We also make sure ALIGNMENT is at least
738 BIGGEST_ALIGNMENT. */
739 if (mode == BLKmode && align < BIGGEST_ALIGNMENT)
741 p->slot = assign_stack_local (mode,
743 ? CEIL_ROUND (size, align / BITS_PER_UNIT)
749 /* The following slot size computation is necessary because we don't
750 know the actual size of the temporary slot until assign_stack_local
751 has performed all the frame alignment and size rounding for the
752 requested temporary. Note that extra space added for alignment
753 can be either above or below this stack slot depending on which
754 way the frame grows. We include the extra space if and only if it
755 is above this slot. */
756 #ifdef FRAME_GROWS_DOWNWARD
757 p->size = frame_offset_old - frame_offset;
762 /* Now define the fields used by combine_temp_slots. */
763 #ifdef FRAME_GROWS_DOWNWARD
764 p->base_offset = frame_offset;
765 p->full_size = frame_offset_old - frame_offset;
767 p->base_offset = frame_offset_old;
768 p->full_size = frame_offset - frame_offset_old;
771 p->next = temp_slots;
777 p->rtl_expr = seq_rtl_expr;
782 p->level = target_temp_slot_level;
787 p->level = var_temp_slot_level;
792 p->level = temp_slot_level;
796 /* We may be reusing an old slot, so clear any MEM flags that may have been
798 RTX_UNCHANGING_P (p->slot) = 0;
799 MEM_IN_STRUCT_P (p->slot) = 0;
800 MEM_SCALAR_P (p->slot) = 0;
801 MEM_VOLATILE_P (p->slot) = 0;
802 set_mem_alias_set (p->slot, 0);
804 /* If we know the alias set for the memory that will be used, use
805 it. If there's no TYPE, then we don't know anything about the
806 alias set for the memory. */
807 set_mem_alias_set (p->slot, type ? get_alias_set (type) : 0);
808 set_mem_align (p->slot, align);
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 optimization. */
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. */
936 prev_q->next = q->next;
940 /* Either delete P or advance past it. */
944 prev_p->next = p->next;
946 temp_slots = p->next;
953 /* Find the temp slot corresponding to the object at address X. */
955 static struct temp_slot *
956 find_temp_slot_from_address (x)
962 for (p = temp_slots; p; p = p->next)
967 else if (XEXP (p->slot, 0) == x
969 || (GET_CODE (x) == PLUS
970 && XEXP (x, 0) == virtual_stack_vars_rtx
971 && GET_CODE (XEXP (x, 1)) == CONST_INT
972 && INTVAL (XEXP (x, 1)) >= p->base_offset
973 && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size))
976 else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST)
977 for (next = p->address; next; next = XEXP (next, 1))
978 if (XEXP (next, 0) == x)
982 /* If we have a sum involving a register, see if it points to a temp
984 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 0)) == REG
985 && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
987 else if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == REG
988 && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
994 /* Indicate that NEW is an alternate way of referring to the temp slot
995 that previously was known by OLD. */
998 update_temp_slot_address (old, new)
1001 struct temp_slot *p;
1003 if (rtx_equal_p (old, new))
1006 p = find_temp_slot_from_address (old);
1008 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
1009 is a register, see if one operand of the PLUS is a temporary
1010 location. If so, NEW points into it. Otherwise, if both OLD and
1011 NEW are a PLUS and if there is a register in common between them.
1012 If so, try a recursive call on those values. */
1015 if (GET_CODE (old) != PLUS)
1018 if (GET_CODE (new) == REG)
1020 update_temp_slot_address (XEXP (old, 0), new);
1021 update_temp_slot_address (XEXP (old, 1), new);
1024 else if (GET_CODE (new) != PLUS)
1027 if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0)))
1028 update_temp_slot_address (XEXP (old, 1), XEXP (new, 1));
1029 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0)))
1030 update_temp_slot_address (XEXP (old, 0), XEXP (new, 1));
1031 else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1)))
1032 update_temp_slot_address (XEXP (old, 1), XEXP (new, 0));
1033 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1)))
1034 update_temp_slot_address (XEXP (old, 0), XEXP (new, 0));
1039 /* Otherwise add an alias for the temp's address. */
1040 else if (p->address == 0)
1044 if (GET_CODE (p->address) != EXPR_LIST)
1045 p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX);
1047 p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address);
1051 /* If X could be a reference to a temporary slot, mark the fact that its
1052 address was taken. */
1055 mark_temp_addr_taken (x)
1058 struct temp_slot *p;
1063 /* If X is not in memory or is at a constant address, it cannot be in
1064 a temporary slot. */
1065 if (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1068 p = find_temp_slot_from_address (XEXP (x, 0));
1073 /* If X could be a reference to a temporary slot, mark that slot as
1074 belonging to the to one level higher than the current level. If X
1075 matched one of our slots, just mark that one. Otherwise, we can't
1076 easily predict which it is, so upgrade all of them. Kept slots
1077 need not be touched.
1079 This is called when an ({...}) construct occurs and a statement
1080 returns a value in memory. */
1083 preserve_temp_slots (x)
1086 struct temp_slot *p = 0;
1088 /* If there is no result, we still might have some objects whose address
1089 were taken, so we need to make sure they stay around. */
1092 for (p = temp_slots; p; p = p->next)
1093 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1099 /* If X is a register that is being used as a pointer, see if we have
1100 a temporary slot we know it points to. To be consistent with
1101 the code below, we really should preserve all non-kept slots
1102 if we can't find a match, but that seems to be much too costly. */
1103 if (GET_CODE (x) == REG && REG_POINTER (x))
1104 p = find_temp_slot_from_address (x);
1106 /* If X is not in memory or is at a constant address, it cannot be in
1107 a temporary slot, but it can contain something whose address was
1109 if (p == 0 && (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0))))
1111 for (p = temp_slots; p; p = p->next)
1112 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1118 /* First see if we can find a match. */
1120 p = find_temp_slot_from_address (XEXP (x, 0));
1124 /* Move everything at our level whose address was taken to our new
1125 level in case we used its address. */
1126 struct temp_slot *q;
1128 if (p->level == temp_slot_level)
1130 for (q = temp_slots; q; q = q->next)
1131 if (q != p && q->addr_taken && q->level == p->level)
1140 /* Otherwise, preserve all non-kept slots at this level. */
1141 for (p = temp_slots; p; p = p->next)
1142 if (p->in_use && p->level == temp_slot_level && ! p->keep)
1146 /* X is the result of an RTL_EXPR. If it is a temporary slot associated
1147 with that RTL_EXPR, promote it into a temporary slot at the present
1148 level so it will not be freed when we free slots made in the
1152 preserve_rtl_expr_result (x)
1155 struct temp_slot *p;
1157 /* If X is not in memory or is at a constant address, it cannot be in
1158 a temporary slot. */
1159 if (x == 0 || GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1162 /* If we can find a match, move it to our level unless it is already at
1164 p = find_temp_slot_from_address (XEXP (x, 0));
1167 p->level = MIN (p->level, temp_slot_level);
1174 /* Free all temporaries used so far. This is normally called at the end
1175 of generating code for a statement. Don't free any temporaries
1176 currently in use for an RTL_EXPR that hasn't yet been emitted.
1177 We could eventually do better than this since it can be reused while
1178 generating the same RTL_EXPR, but this is complex and probably not
1184 struct temp_slot *p;
1186 for (p = temp_slots; p; p = p->next)
1187 if (p->in_use && p->level == temp_slot_level && ! p->keep
1188 && p->rtl_expr == 0)
1191 combine_temp_slots ();
1194 /* Free all temporary slots used in T, an RTL_EXPR node. */
1197 free_temps_for_rtl_expr (t)
1200 struct temp_slot *p;
1202 for (p = temp_slots; p; p = p->next)
1203 if (p->rtl_expr == t)
1205 /* If this slot is below the current TEMP_SLOT_LEVEL, then it
1206 needs to be preserved. This can happen if a temporary in
1207 the RTL_EXPR was addressed; preserve_temp_slots will move
1208 the temporary into a higher level. */
1209 if (temp_slot_level <= p->level)
1212 p->rtl_expr = NULL_TREE;
1215 combine_temp_slots ();
1218 /* Mark all temporaries ever allocated in this function as not suitable
1219 for reuse until the current level is exited. */
1222 mark_all_temps_used ()
1224 struct temp_slot *p;
1226 for (p = temp_slots; p; p = p->next)
1228 p->in_use = p->keep = 1;
1229 p->level = MIN (p->level, temp_slot_level);
1233 /* Push deeper into the nesting level for stack temporaries. */
1241 /* Likewise, but save the new level as the place to allocate variables
1246 push_temp_slots_for_block ()
1250 var_temp_slot_level = temp_slot_level;
1253 /* Likewise, but save the new level as the place to allocate temporaries
1254 for TARGET_EXPRs. */
1257 push_temp_slots_for_target ()
1261 target_temp_slot_level = temp_slot_level;
1264 /* Set and get the value of target_temp_slot_level. The only
1265 permitted use of these functions is to save and restore this value. */
1268 get_target_temp_slot_level ()
1270 return target_temp_slot_level;
1274 set_target_temp_slot_level (level)
1277 target_temp_slot_level = level;
1281 /* Pop a temporary nesting level. All slots in use in the current level
1287 struct temp_slot *p;
1289 for (p = temp_slots; p; p = p->next)
1290 if (p->in_use && p->level == temp_slot_level && p->rtl_expr == 0)
1293 combine_temp_slots ();
1298 /* Initialize temporary slots. */
1303 /* We have not allocated any temporaries yet. */
1305 temp_slot_level = 0;
1306 var_temp_slot_level = 0;
1307 target_temp_slot_level = 0;
1310 /* Retroactively move an auto variable from a register to a stack slot.
1311 This is done when an address-reference to the variable is seen. */
1314 put_var_into_stack (decl)
1318 enum machine_mode promoted_mode, decl_mode;
1319 struct function *function = 0;
1321 int can_use_addressof;
1322 int volatilep = TREE_CODE (decl) != SAVE_EXPR && TREE_THIS_VOLATILE (decl);
1323 int usedp = (TREE_USED (decl)
1324 || (TREE_CODE (decl) != SAVE_EXPR && DECL_INITIAL (decl) != 0));
1326 context = decl_function_context (decl);
1328 /* Get the current rtl used for this object and its original mode. */
1329 reg = (TREE_CODE (decl) == SAVE_EXPR
1330 ? SAVE_EXPR_RTL (decl)
1331 : DECL_RTL_IF_SET (decl));
1333 /* No need to do anything if decl has no rtx yet
1334 since in that case caller is setting TREE_ADDRESSABLE
1335 and a stack slot will be assigned when the rtl is made. */
1339 /* Get the declared mode for this object. */
1340 decl_mode = (TREE_CODE (decl) == SAVE_EXPR ? TYPE_MODE (TREE_TYPE (decl))
1341 : DECL_MODE (decl));
1342 /* Get the mode it's actually stored in. */
1343 promoted_mode = GET_MODE (reg);
1345 /* If this variable comes from an outer function, find that
1346 function's saved context. Don't use find_function_data here,
1347 because it might not be in any active function.
1348 FIXME: Is that really supposed to happen?
1349 It does in ObjC at least. */
1350 if (context != current_function_decl && context != inline_function_decl)
1351 for (function = outer_function_chain; function; function = function->outer)
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 MEM_ATTRS (reg) = 0;
1423 /* set_mem_attributes uses DECL_RTL to avoid re-generating of
1424 already computed alias sets. Here we want to re-generate. */
1426 SET_DECL_RTL (decl, NULL);
1427 set_mem_attributes (reg, decl, 1);
1429 SET_DECL_RTL (decl, reg);
1431 /* The two parts are in memory order already.
1432 Use the lower parts address as ours. */
1433 XEXP (reg, 0) = XEXP (XEXP (reg, 0), 0);
1434 /* Prevent sharing of rtl that might lose. */
1435 if (GET_CODE (XEXP (reg, 0)) == PLUS)
1436 XEXP (reg, 0) = copy_rtx (XEXP (reg, 0));
1439 schedule_fixup_var_refs (function, reg, TREE_TYPE (decl),
1441 schedule_fixup_var_refs (function, lopart, part_type, part_mode, 0);
1442 schedule_fixup_var_refs (function, hipart, part_type, part_mode, 0);
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 MEM_ATTRS (reg) = 0;
1485 /* `volatil' bit means one thing for MEMs, another entirely for REGs. */
1486 MEM_VOLATILE_P (reg) = volatile_p;
1488 /* If this is a memory ref that contains aggregate components,
1489 mark it as such for cse and loop optimize. If we are reusing a
1490 previously generated stack slot, then we need to copy the bit in
1491 case it was set for other reasons. For instance, it is set for
1492 __builtin_va_alist. */
1495 MEM_SET_IN_STRUCT_P (reg,
1496 AGGREGATE_TYPE_P (type) || MEM_IN_STRUCT_P (new));
1497 set_mem_alias_set (reg, get_alias_set (type));
1501 schedule_fixup_var_refs (function, reg, type, promoted_mode, ht);
1504 /* Make sure that all refs to the variable, previously made
1505 when it was a register, are fixed up to be valid again.
1506 See function above for meaning of arguments. */
1509 schedule_fixup_var_refs (function, reg, type, promoted_mode, ht)
1510 struct function *function;
1513 enum machine_mode promoted_mode;
1514 struct hash_table *ht;
1516 int unsigned_p = type ? TREE_UNSIGNED (type) : 0;
1520 struct var_refs_queue *temp;
1523 = (struct var_refs_queue *) ggc_alloc (sizeof (struct var_refs_queue));
1524 temp->modified = reg;
1525 temp->promoted_mode = promoted_mode;
1526 temp->unsignedp = unsigned_p;
1527 temp->next = function->fixup_var_refs_queue;
1528 function->fixup_var_refs_queue = temp;
1531 /* Variable is local; fix it up now. */
1532 fixup_var_refs (reg, promoted_mode, unsigned_p, ht);
1536 fixup_var_refs (var, promoted_mode, unsignedp, ht)
1538 enum machine_mode promoted_mode;
1540 struct hash_table *ht;
1543 rtx first_insn = get_insns ();
1544 struct sequence_stack *stack = seq_stack;
1545 tree rtl_exps = rtl_expr_chain;
1547 /* If there's a hash table, it must record all uses of VAR. */
1552 fixup_var_refs_insns_with_hash (ht, var, promoted_mode, unsignedp);
1556 fixup_var_refs_insns (first_insn, var, promoted_mode, unsignedp,
1559 /* Scan all pending sequences too. */
1560 for (; stack; stack = stack->next)
1562 push_to_full_sequence (stack->first, stack->last);
1563 fixup_var_refs_insns (stack->first, var, promoted_mode, unsignedp,
1565 /* Update remembered end of sequence
1566 in case we added an insn at the end. */
1567 stack->last = get_last_insn ();
1571 /* Scan all waiting RTL_EXPRs too. */
1572 for (pending = rtl_exps; pending; pending = TREE_CHAIN (pending))
1574 rtx seq = RTL_EXPR_SEQUENCE (TREE_VALUE (pending));
1575 if (seq != const0_rtx && seq != 0)
1577 push_to_sequence (seq);
1578 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0);
1584 /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is
1585 some part of an insn. Return a struct fixup_replacement whose OLD
1586 value is equal to X. Allocate a new structure if no such entry exists. */
1588 static struct fixup_replacement *
1589 find_fixup_replacement (replacements, x)
1590 struct fixup_replacement **replacements;
1593 struct fixup_replacement *p;
1595 /* See if we have already replaced this. */
1596 for (p = *replacements; p != 0 && ! rtx_equal_p (p->old, x); p = p->next)
1601 p = (struct fixup_replacement *) xmalloc (sizeof (struct fixup_replacement));
1604 p->next = *replacements;
1611 /* Scan the insn-chain starting with INSN for refs to VAR
1612 and fix them up. TOPLEVEL is nonzero if this chain is the
1613 main chain of insns for the current function. */
1616 fixup_var_refs_insns (insn, var, promoted_mode, unsignedp, toplevel)
1619 enum machine_mode promoted_mode;
1625 /* fixup_var_refs_insn might modify insn, so save its next
1627 rtx next = NEXT_INSN (insn);
1629 /* CALL_PLACEHOLDERs are special; we have to switch into each of
1630 the three sequences they (potentially) contain, and process
1631 them recursively. The CALL_INSN itself is not interesting. */
1633 if (GET_CODE (insn) == CALL_INSN
1634 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1638 /* Look at the Normal call, sibling call and tail recursion
1639 sequences attached to the CALL_PLACEHOLDER. */
1640 for (i = 0; i < 3; i++)
1642 rtx seq = XEXP (PATTERN (insn), i);
1645 push_to_sequence (seq);
1646 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0);
1647 XEXP (PATTERN (insn), i) = get_insns ();
1653 else if (INSN_P (insn))
1654 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, toplevel);
1660 /* Look up the insns which reference VAR in HT and fix them up. Other
1661 arguments are the same as fixup_var_refs_insns.
1663 N.B. No need for special processing of CALL_PLACEHOLDERs here,
1664 because the hash table will point straight to the interesting insn
1665 (inside the CALL_PLACEHOLDER). */
1668 fixup_var_refs_insns_with_hash (ht, var, promoted_mode, unsignedp)
1669 struct hash_table *ht;
1671 enum machine_mode promoted_mode;
1674 struct insns_for_mem_entry *ime = (struct insns_for_mem_entry *)
1675 hash_lookup (ht, var, /*create=*/0, /*copy=*/0);
1676 rtx insn_list = ime->insns;
1680 rtx insn = XEXP (insn_list, 0);
1683 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, 1);
1685 insn_list = XEXP (insn_list, 1);
1690 /* Per-insn processing by fixup_var_refs_insns(_with_hash). INSN is
1691 the insn under examination, VAR is the variable to fix up
1692 references to, PROMOTED_MODE and UNSIGNEDP describe VAR, and
1693 TOPLEVEL is nonzero if this is the main insn chain for this
1697 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, toplevel)
1700 enum machine_mode promoted_mode;
1705 rtx set, prev, prev_set;
1708 /* Remember the notes in case we delete the insn. */
1709 note = REG_NOTES (insn);
1711 /* If this is a CLOBBER of VAR, delete it.
1713 If it has a REG_LIBCALL note, delete the REG_LIBCALL
1714 and REG_RETVAL notes too. */
1715 if (GET_CODE (PATTERN (insn)) == CLOBBER
1716 && (XEXP (PATTERN (insn), 0) == var
1717 || (GET_CODE (XEXP (PATTERN (insn), 0)) == CONCAT
1718 && (XEXP (XEXP (PATTERN (insn), 0), 0) == var
1719 || XEXP (XEXP (PATTERN (insn), 0), 1) == var))))
1721 if ((note = find_reg_note (insn, REG_LIBCALL, NULL_RTX)) != 0)
1722 /* The REG_LIBCALL note will go away since we are going to
1723 turn INSN into a NOTE, so just delete the
1724 corresponding REG_RETVAL note. */
1725 remove_note (XEXP (note, 0),
1726 find_reg_note (XEXP (note, 0), REG_RETVAL,
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))))
1754 struct fixup_replacement *replacements = 0;
1755 rtx next_insn = NEXT_INSN (insn);
1757 if (SMALL_REGISTER_CLASSES)
1759 /* If the insn that copies the results of a CALL_INSN
1760 into a pseudo now references VAR, we have to use an
1761 intermediate pseudo since we want the life of the
1762 return value register to be only a single insn.
1764 If we don't use an intermediate pseudo, such things as
1765 address computations to make the address of VAR valid
1766 if it is not can be placed between the CALL_INSN and INSN.
1768 To make sure this doesn't happen, we record the destination
1769 of the CALL_INSN and see if the next insn uses both that
1772 if (call_dest != 0 && GET_CODE (insn) == INSN
1773 && reg_mentioned_p (var, PATTERN (insn))
1774 && reg_mentioned_p (call_dest, PATTERN (insn)))
1776 rtx temp = gen_reg_rtx (GET_MODE (call_dest));
1778 emit_insn_before (gen_move_insn (temp, call_dest), insn);
1780 PATTERN (insn) = replace_rtx (PATTERN (insn),
1784 if (GET_CODE (insn) == CALL_INSN
1785 && GET_CODE (PATTERN (insn)) == SET)
1786 call_dest = SET_DEST (PATTERN (insn));
1787 else if (GET_CODE (insn) == CALL_INSN
1788 && GET_CODE (PATTERN (insn)) == PARALLEL
1789 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET)
1790 call_dest = SET_DEST (XVECEXP (PATTERN (insn), 0, 0));
1795 /* See if we have to do anything to INSN now that VAR is in
1796 memory. If it needs to be loaded into a pseudo, use a single
1797 pseudo for the entire insn in case there is a MATCH_DUP
1798 between two operands. We pass a pointer to the head of
1799 a list of struct fixup_replacements. If fixup_var_refs_1
1800 needs to allocate pseudos or replacement MEMs (for SUBREGs),
1801 it will record them in this list.
1803 If it allocated a pseudo for any replacement, we copy into
1806 fixup_var_refs_1 (var, promoted_mode, &PATTERN (insn), insn,
1809 /* If this is last_parm_insn, and any instructions were output
1810 after it to fix it up, then we must set last_parm_insn to
1811 the last such instruction emitted. */
1812 if (insn == last_parm_insn)
1813 last_parm_insn = PREV_INSN (next_insn);
1815 while (replacements)
1817 struct fixup_replacement *next;
1819 if (GET_CODE (replacements->new) == REG)
1824 /* OLD might be a (subreg (mem)). */
1825 if (GET_CODE (replacements->old) == SUBREG)
1827 = fixup_memory_subreg (replacements->old, insn, 0);
1830 = fixup_stack_1 (replacements->old, insn);
1832 insert_before = insn;
1834 /* If we are changing the mode, do a conversion.
1835 This might be wasteful, but combine.c will
1836 eliminate much of the waste. */
1838 if (GET_MODE (replacements->new)
1839 != GET_MODE (replacements->old))
1842 convert_move (replacements->new,
1843 replacements->old, unsignedp);
1844 seq = gen_sequence ();
1848 seq = gen_move_insn (replacements->new,
1851 emit_insn_before (seq, insert_before);
1854 next = replacements->next;
1855 free (replacements);
1856 replacements = next;
1860 /* Also fix up any invalid exprs in the REG_NOTES of this insn.
1861 But don't touch other insns referred to by reg-notes;
1862 we will get them elsewhere. */
1865 if (GET_CODE (note) != INSN_LIST)
1867 = walk_fixup_memory_subreg (XEXP (note, 0), insn, 1);
1868 note = XEXP (note, 1);
1872 /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
1873 See if the rtx expression at *LOC in INSN needs to be changed.
1875 REPLACEMENTS is a pointer to a list head that starts out zero, but may
1876 contain a list of original rtx's and replacements. If we find that we need
1877 to modify this insn by replacing a memory reference with a pseudo or by
1878 making a new MEM to implement a SUBREG, we consult that list to see if
1879 we have already chosen a replacement. If none has already been allocated,
1880 we allocate it and update the list. fixup_var_refs_insn will copy VAR
1881 or the SUBREG, as appropriate, to the pseudo. */
1884 fixup_var_refs_1 (var, promoted_mode, loc, insn, replacements)
1886 enum machine_mode promoted_mode;
1889 struct fixup_replacement **replacements;
1893 RTX_CODE code = GET_CODE (x);
1896 struct fixup_replacement *replacement;
1901 if (XEXP (x, 0) == var)
1903 /* Prevent sharing of rtl that might lose. */
1904 rtx sub = copy_rtx (XEXP (var, 0));
1906 if (! validate_change (insn, loc, sub, 0))
1908 rtx y = gen_reg_rtx (GET_MODE (sub));
1911 /* We should be able to replace with a register or all is lost.
1912 Note that we can't use validate_change to verify this, since
1913 we're not caring for replacing all dups simultaneously. */
1914 if (! validate_replace_rtx (*loc, y, insn))
1917 /* Careful! First try to recognize a direct move of the
1918 value, mimicking how things are done in gen_reload wrt
1919 PLUS. Consider what happens when insn is a conditional
1920 move instruction and addsi3 clobbers flags. */
1923 new_insn = emit_insn (gen_rtx_SET (VOIDmode, y, sub));
1924 seq = gen_sequence ();
1927 if (recog_memoized (new_insn) < 0)
1929 /* That failed. Fall back on force_operand and hope. */
1932 sub = force_operand (sub, y);
1934 emit_insn (gen_move_insn (y, sub));
1935 seq = gen_sequence ();
1940 /* Don't separate setter from user. */
1941 if (PREV_INSN (insn) && sets_cc0_p (PREV_INSN (insn)))
1942 insn = PREV_INSN (insn);
1945 emit_insn_before (seq, insn);
1953 /* If we already have a replacement, use it. Otherwise,
1954 try to fix up this address in case it is invalid. */
1956 replacement = find_fixup_replacement (replacements, var);
1957 if (replacement->new)
1959 *loc = replacement->new;
1963 *loc = replacement->new = x = fixup_stack_1 (x, insn);
1965 /* Unless we are forcing memory to register or we changed the mode,
1966 we can leave things the way they are if the insn is valid. */
1968 INSN_CODE (insn) = -1;
1969 if (! flag_force_mem && GET_MODE (x) == promoted_mode
1970 && recog_memoized (insn) >= 0)
1973 *loc = replacement->new = gen_reg_rtx (promoted_mode);
1977 /* If X contains VAR, we need to unshare it here so that we update
1978 each occurrence separately. But all identical MEMs in one insn
1979 must be replaced with the same rtx because of the possibility of
1982 if (reg_mentioned_p (var, x))
1984 replacement = find_fixup_replacement (replacements, x);
1985 if (replacement->new == 0)
1986 replacement->new = copy_most_rtx (x, var);
1988 *loc = x = replacement->new;
1989 code = GET_CODE (x);
2005 /* Note that in some cases those types of expressions are altered
2006 by optimize_bit_field, and do not survive to get here. */
2007 if (XEXP (x, 0) == var
2008 || (GET_CODE (XEXP (x, 0)) == SUBREG
2009 && SUBREG_REG (XEXP (x, 0)) == var))
2011 /* Get TEM as a valid MEM in the mode presently in the insn.
2013 We don't worry about the possibility of MATCH_DUP here; it
2014 is highly unlikely and would be tricky to handle. */
2017 if (GET_CODE (tem) == SUBREG)
2019 if (GET_MODE_BITSIZE (GET_MODE (tem))
2020 > GET_MODE_BITSIZE (GET_MODE (var)))
2022 replacement = find_fixup_replacement (replacements, var);
2023 if (replacement->new == 0)
2024 replacement->new = gen_reg_rtx (GET_MODE (var));
2025 SUBREG_REG (tem) = replacement->new;
2027 /* The following code works only if we have a MEM, so we
2028 need to handle the subreg here. We directly substitute
2029 it assuming that a subreg must be OK here. We already
2030 scheduled a replacement to copy the mem into the
2036 tem = fixup_memory_subreg (tem, insn, 0);
2039 tem = fixup_stack_1 (tem, insn);
2041 /* Unless we want to load from memory, get TEM into the proper mode
2042 for an extract from memory. This can only be done if the
2043 extract is at a constant position and length. */
2045 if (! flag_force_mem && GET_CODE (XEXP (x, 1)) == CONST_INT
2046 && GET_CODE (XEXP (x, 2)) == CONST_INT
2047 && ! mode_dependent_address_p (XEXP (tem, 0))
2048 && ! MEM_VOLATILE_P (tem))
2050 enum machine_mode wanted_mode = VOIDmode;
2051 enum machine_mode is_mode = GET_MODE (tem);
2052 HOST_WIDE_INT pos = INTVAL (XEXP (x, 2));
2054 if (GET_CODE (x) == ZERO_EXTRACT)
2056 enum machine_mode new_mode
2057 = mode_for_extraction (EP_extzv, 1);
2058 if (new_mode != MAX_MACHINE_MODE)
2059 wanted_mode = new_mode;
2061 else if (GET_CODE (x) == SIGN_EXTRACT)
2063 enum machine_mode new_mode
2064 = mode_for_extraction (EP_extv, 1);
2065 if (new_mode != MAX_MACHINE_MODE)
2066 wanted_mode = new_mode;
2069 /* If we have a narrower mode, we can do something. */
2070 if (wanted_mode != VOIDmode
2071 && GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2073 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2074 rtx old_pos = XEXP (x, 2);
2077 /* If the bytes and bits are counted differently, we
2078 must adjust the offset. */
2079 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2080 offset = (GET_MODE_SIZE (is_mode)
2081 - GET_MODE_SIZE (wanted_mode) - offset);
2083 pos %= GET_MODE_BITSIZE (wanted_mode);
2085 newmem = adjust_address_nv (tem, wanted_mode, offset);
2087 /* Make the change and see if the insn remains valid. */
2088 INSN_CODE (insn) = -1;
2089 XEXP (x, 0) = newmem;
2090 XEXP (x, 2) = GEN_INT (pos);
2092 if (recog_memoized (insn) >= 0)
2095 /* Otherwise, restore old position. XEXP (x, 0) will be
2097 XEXP (x, 2) = old_pos;
2101 /* If we get here, the bitfield extract insn can't accept a memory
2102 reference. Copy the input into a register. */
2104 tem1 = gen_reg_rtx (GET_MODE (tem));
2105 emit_insn_before (gen_move_insn (tem1, tem), insn);
2112 if (SUBREG_REG (x) == var)
2114 /* If this is a special SUBREG made because VAR was promoted
2115 from a wider mode, replace it with VAR and call ourself
2116 recursively, this time saying that the object previously
2117 had its current mode (by virtue of the SUBREG). */
2119 if (SUBREG_PROMOTED_VAR_P (x))
2122 fixup_var_refs_1 (var, GET_MODE (var), loc, insn, replacements);
2126 /* If this SUBREG makes VAR wider, it has become a paradoxical
2127 SUBREG with VAR in memory, but these aren't allowed at this
2128 stage of the compilation. So load VAR into a pseudo and take
2129 a SUBREG of that pseudo. */
2130 if (GET_MODE_SIZE (GET_MODE (x)) > GET_MODE_SIZE (GET_MODE (var)))
2132 replacement = find_fixup_replacement (replacements, var);
2133 if (replacement->new == 0)
2134 replacement->new = gen_reg_rtx (promoted_mode);
2135 SUBREG_REG (x) = replacement->new;
2139 /* See if we have already found a replacement for this SUBREG.
2140 If so, use it. Otherwise, make a MEM and see if the insn
2141 is recognized. If not, or if we should force MEM into a register,
2142 make a pseudo for this SUBREG. */
2143 replacement = find_fixup_replacement (replacements, x);
2144 if (replacement->new)
2146 *loc = replacement->new;
2150 replacement->new = *loc = fixup_memory_subreg (x, insn, 0);
2152 INSN_CODE (insn) = -1;
2153 if (! flag_force_mem && recog_memoized (insn) >= 0)
2156 *loc = replacement->new = gen_reg_rtx (GET_MODE (x));
2162 /* First do special simplification of bit-field references. */
2163 if (GET_CODE (SET_DEST (x)) == SIGN_EXTRACT
2164 || GET_CODE (SET_DEST (x)) == ZERO_EXTRACT)
2165 optimize_bit_field (x, insn, 0);
2166 if (GET_CODE (SET_SRC (x)) == SIGN_EXTRACT
2167 || GET_CODE (SET_SRC (x)) == ZERO_EXTRACT)
2168 optimize_bit_field (x, insn, 0);
2170 /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object
2171 into a register and then store it back out. */
2172 if (GET_CODE (SET_DEST (x)) == ZERO_EXTRACT
2173 && GET_CODE (XEXP (SET_DEST (x), 0)) == SUBREG
2174 && SUBREG_REG (XEXP (SET_DEST (x), 0)) == var
2175 && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x), 0)))
2176 > GET_MODE_SIZE (GET_MODE (var))))
2178 replacement = find_fixup_replacement (replacements, var);
2179 if (replacement->new == 0)
2180 replacement->new = gen_reg_rtx (GET_MODE (var));
2182 SUBREG_REG (XEXP (SET_DEST (x), 0)) = replacement->new;
2183 emit_insn_after (gen_move_insn (var, replacement->new), insn);
2186 /* If SET_DEST is now a paradoxical SUBREG, put the result of this
2187 insn into a pseudo and store the low part of the pseudo into VAR. */
2188 if (GET_CODE (SET_DEST (x)) == SUBREG
2189 && SUBREG_REG (SET_DEST (x)) == var
2190 && (GET_MODE_SIZE (GET_MODE (SET_DEST (x)))
2191 > GET_MODE_SIZE (GET_MODE (var))))
2193 SET_DEST (x) = tem = gen_reg_rtx (GET_MODE (SET_DEST (x)));
2194 emit_insn_after (gen_move_insn (var, gen_lowpart (GET_MODE (var),
2201 rtx dest = SET_DEST (x);
2202 rtx src = SET_SRC (x);
2203 rtx outerdest = dest;
2205 while (GET_CODE (dest) == SUBREG || GET_CODE (dest) == STRICT_LOW_PART
2206 || GET_CODE (dest) == SIGN_EXTRACT
2207 || GET_CODE (dest) == ZERO_EXTRACT)
2208 dest = XEXP (dest, 0);
2210 if (GET_CODE (src) == SUBREG)
2211 src = SUBREG_REG (src);
2213 /* If VAR does not appear at the top level of the SET
2214 just scan the lower levels of the tree. */
2216 if (src != var && dest != var)
2219 /* We will need to rerecognize this insn. */
2220 INSN_CODE (insn) = -1;
2222 if (GET_CODE (outerdest) == ZERO_EXTRACT && dest == var
2223 && mode_for_extraction (EP_insv, -1) != MAX_MACHINE_MODE)
2225 /* Since this case will return, ensure we fixup all the
2227 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 1),
2228 insn, replacements);
2229 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 2),
2230 insn, replacements);
2231 fixup_var_refs_1 (var, promoted_mode, &SET_SRC (x),
2232 insn, replacements);
2234 tem = XEXP (outerdest, 0);
2236 /* Clean up (SUBREG:SI (MEM:mode ...) 0)
2237 that may appear inside a ZERO_EXTRACT.
2238 This was legitimate when the MEM was a REG. */
2239 if (GET_CODE (tem) == SUBREG
2240 && SUBREG_REG (tem) == var)
2241 tem = fixup_memory_subreg (tem, insn, 0);
2243 tem = fixup_stack_1 (tem, insn);
2245 if (GET_CODE (XEXP (outerdest, 1)) == CONST_INT
2246 && GET_CODE (XEXP (outerdest, 2)) == CONST_INT
2247 && ! mode_dependent_address_p (XEXP (tem, 0))
2248 && ! MEM_VOLATILE_P (tem))
2250 enum machine_mode wanted_mode;
2251 enum machine_mode is_mode = GET_MODE (tem);
2252 HOST_WIDE_INT pos = INTVAL (XEXP (outerdest, 2));
2254 wanted_mode = mode_for_extraction (EP_insv, 0);
2256 /* If we have a narrower mode, we can do something. */
2257 if (GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2259 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2260 rtx old_pos = XEXP (outerdest, 2);
2263 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2264 offset = (GET_MODE_SIZE (is_mode)
2265 - GET_MODE_SIZE (wanted_mode) - offset);
2267 pos %= GET_MODE_BITSIZE (wanted_mode);
2269 newmem = adjust_address_nv (tem, wanted_mode, offset);
2271 /* Make the change and see if the insn remains valid. */
2272 INSN_CODE (insn) = -1;
2273 XEXP (outerdest, 0) = newmem;
2274 XEXP (outerdest, 2) = GEN_INT (pos);
2276 if (recog_memoized (insn) >= 0)
2279 /* Otherwise, restore old position. XEXP (x, 0) will be
2281 XEXP (outerdest, 2) = old_pos;
2285 /* If we get here, the bit-field store doesn't allow memory
2286 or isn't located at a constant position. Load the value into
2287 a register, do the store, and put it back into memory. */
2289 tem1 = gen_reg_rtx (GET_MODE (tem));
2290 emit_insn_before (gen_move_insn (tem1, tem), insn);
2291 emit_insn_after (gen_move_insn (tem, tem1), insn);
2292 XEXP (outerdest, 0) = tem1;
2296 /* STRICT_LOW_PART is a no-op on memory references
2297 and it can cause combinations to be unrecognizable,
2300 if (dest == var && GET_CODE (SET_DEST (x)) == STRICT_LOW_PART)
2301 SET_DEST (x) = XEXP (SET_DEST (x), 0);
2303 /* A valid insn to copy VAR into or out of a register
2304 must be left alone, to avoid an infinite loop here.
2305 If the reference to VAR is by a subreg, fix that up,
2306 since SUBREG is not valid for a memref.
2307 Also fix up the address of the stack slot.
2309 Note that we must not try to recognize the insn until
2310 after we know that we have valid addresses and no
2311 (subreg (mem ...) ...) constructs, since these interfere
2312 with determining the validity of the insn. */
2314 if ((SET_SRC (x) == var
2315 || (GET_CODE (SET_SRC (x)) == SUBREG
2316 && SUBREG_REG (SET_SRC (x)) == var))
2317 && (GET_CODE (SET_DEST (x)) == REG
2318 || (GET_CODE (SET_DEST (x)) == SUBREG
2319 && GET_CODE (SUBREG_REG (SET_DEST (x))) == REG))
2320 && GET_MODE (var) == promoted_mode
2321 && x == single_set (insn))
2325 replacement = find_fixup_replacement (replacements, SET_SRC (x));
2326 if (replacement->new)
2327 SET_SRC (x) = replacement->new;
2328 else if (GET_CODE (SET_SRC (x)) == SUBREG)
2329 SET_SRC (x) = replacement->new
2330 = fixup_memory_subreg (SET_SRC (x), insn, 0);
2332 SET_SRC (x) = replacement->new
2333 = fixup_stack_1 (SET_SRC (x), insn);
2335 if (recog_memoized (insn) >= 0)
2338 /* INSN is not valid, but we know that we want to
2339 copy SET_SRC (x) to SET_DEST (x) in some way. So
2340 we generate the move and see whether it requires more
2341 than one insn. If it does, we emit those insns and
2342 delete INSN. Otherwise, we an just replace the pattern
2343 of INSN; we have already verified above that INSN has
2344 no other function that to do X. */
2346 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2347 if (GET_CODE (pat) == SEQUENCE)
2349 last = emit_insn_before (pat, insn);
2351 /* INSN might have REG_RETVAL or other important notes, so
2352 we need to store the pattern of the last insn in the
2353 sequence into INSN similarly to the normal case. LAST
2354 should not have REG_NOTES, but we allow them if INSN has
2356 if (REG_NOTES (last) && REG_NOTES (insn))
2358 if (REG_NOTES (last))
2359 REG_NOTES (insn) = REG_NOTES (last);
2360 PATTERN (insn) = PATTERN (last);
2365 PATTERN (insn) = pat;
2370 if ((SET_DEST (x) == var
2371 || (GET_CODE (SET_DEST (x)) == SUBREG
2372 && SUBREG_REG (SET_DEST (x)) == var))
2373 && (GET_CODE (SET_SRC (x)) == REG
2374 || (GET_CODE (SET_SRC (x)) == SUBREG
2375 && GET_CODE (SUBREG_REG (SET_SRC (x))) == REG))
2376 && GET_MODE (var) == promoted_mode
2377 && x == single_set (insn))
2381 if (GET_CODE (SET_DEST (x)) == SUBREG)
2382 SET_DEST (x) = fixup_memory_subreg (SET_DEST (x), insn, 0);
2384 SET_DEST (x) = fixup_stack_1 (SET_DEST (x), insn);
2386 if (recog_memoized (insn) >= 0)
2389 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2390 if (GET_CODE (pat) == SEQUENCE)
2392 last = emit_insn_before (pat, insn);
2394 /* INSN might have REG_RETVAL or other important notes, so
2395 we need to store the pattern of the last insn in the
2396 sequence into INSN similarly to the normal case. LAST
2397 should not have REG_NOTES, but we allow them if INSN has
2399 if (REG_NOTES (last) && REG_NOTES (insn))
2401 if (REG_NOTES (last))
2402 REG_NOTES (insn) = REG_NOTES (last);
2403 PATTERN (insn) = PATTERN (last);
2408 PATTERN (insn) = pat;
2413 /* Otherwise, storing into VAR must be handled specially
2414 by storing into a temporary and copying that into VAR
2415 with a new insn after this one. Note that this case
2416 will be used when storing into a promoted scalar since
2417 the insn will now have different modes on the input
2418 and output and hence will be invalid (except for the case
2419 of setting it to a constant, which does not need any
2420 change if it is valid). We generate extra code in that case,
2421 but combine.c will eliminate it. */
2426 rtx fixeddest = SET_DEST (x);
2428 /* STRICT_LOW_PART can be discarded, around a MEM. */
2429 if (GET_CODE (fixeddest) == STRICT_LOW_PART)
2430 fixeddest = XEXP (fixeddest, 0);
2431 /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */
2432 if (GET_CODE (fixeddest) == SUBREG)
2434 fixeddest = fixup_memory_subreg (fixeddest, insn, 0);
2435 promoted_mode = GET_MODE (fixeddest);
2438 fixeddest = fixup_stack_1 (fixeddest, insn);
2440 temp = gen_reg_rtx (promoted_mode);
2442 emit_insn_after (gen_move_insn (fixeddest,
2443 gen_lowpart (GET_MODE (fixeddest),
2447 SET_DEST (x) = temp;
2455 /* Nothing special about this RTX; fix its operands. */
2457 fmt = GET_RTX_FORMAT (code);
2458 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2461 fixup_var_refs_1 (var, promoted_mode, &XEXP (x, i), insn, replacements);
2462 else if (fmt[i] == 'E')
2465 for (j = 0; j < XVECLEN (x, i); j++)
2466 fixup_var_refs_1 (var, promoted_mode, &XVECEXP (x, i, j),
2467 insn, replacements);
2472 /* Given X, an rtx of the form (SUBREG:m1 (MEM:m2 addr)),
2473 return an rtx (MEM:m1 newaddr) which is equivalent.
2474 If any insns must be emitted to compute NEWADDR, put them before INSN.
2476 UNCRITICAL nonzero means accept paradoxical subregs.
2477 This is used for subregs found inside REG_NOTES. */
2480 fixup_memory_subreg (x, insn, uncritical)
2485 int offset = SUBREG_BYTE (x);
2486 rtx addr = XEXP (SUBREG_REG (x), 0);
2487 enum machine_mode mode = GET_MODE (x);
2490 /* Paradoxical SUBREGs are usually invalid during RTL generation. */
2491 if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (GET_MODE (SUBREG_REG (x)))
2495 if (!flag_force_addr
2496 && memory_address_p (mode, plus_constant (addr, offset)))
2497 /* Shortcut if no insns need be emitted. */
2498 return adjust_address (SUBREG_REG (x), mode, offset);
2501 result = adjust_address (SUBREG_REG (x), mode, offset);
2502 emit_insn_before (gen_sequence (), insn);
2507 /* Do fixup_memory_subreg on all (SUBREG (MEM ...) ...) contained in X.
2508 Replace subexpressions of X in place.
2509 If X itself is a (SUBREG (MEM ...) ...), return the replacement expression.
2510 Otherwise return X, with its contents possibly altered.
2512 If any insns must be emitted to compute NEWADDR, put them before INSN.
2514 UNCRITICAL is as in fixup_memory_subreg. */
2517 walk_fixup_memory_subreg (x, insn, uncritical)
2529 code = GET_CODE (x);
2531 if (code == SUBREG && GET_CODE (SUBREG_REG (x)) == MEM)
2532 return fixup_memory_subreg (x, insn, uncritical);
2534 /* Nothing special about this RTX; fix its operands. */
2536 fmt = GET_RTX_FORMAT (code);
2537 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2540 XEXP (x, i) = walk_fixup_memory_subreg (XEXP (x, i), insn, uncritical);
2541 else if (fmt[i] == 'E')
2544 for (j = 0; j < XVECLEN (x, i); j++)
2546 = walk_fixup_memory_subreg (XVECEXP (x, i, j), insn, uncritical);
2552 /* For each memory ref within X, if it refers to a stack slot
2553 with an out of range displacement, put the address in a temp register
2554 (emitting new insns before INSN to load these registers)
2555 and alter the memory ref to use that register.
2556 Replace each such MEM rtx with a copy, to avoid clobberage. */
2559 fixup_stack_1 (x, insn)
2564 RTX_CODE code = GET_CODE (x);
2569 rtx ad = XEXP (x, 0);
2570 /* If we have address of a stack slot but it's not valid
2571 (displacement is too large), compute the sum in a register. */
2572 if (GET_CODE (ad) == PLUS
2573 && GET_CODE (XEXP (ad, 0)) == REG
2574 && ((REGNO (XEXP (ad, 0)) >= FIRST_VIRTUAL_REGISTER
2575 && REGNO (XEXP (ad, 0)) <= LAST_VIRTUAL_REGISTER)
2576 || REGNO (XEXP (ad, 0)) == FRAME_POINTER_REGNUM
2577 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2578 || REGNO (XEXP (ad, 0)) == HARD_FRAME_POINTER_REGNUM
2580 || REGNO (XEXP (ad, 0)) == STACK_POINTER_REGNUM
2581 || REGNO (XEXP (ad, 0)) == ARG_POINTER_REGNUM
2582 || XEXP (ad, 0) == current_function_internal_arg_pointer)
2583 && GET_CODE (XEXP (ad, 1)) == CONST_INT)
2586 if (memory_address_p (GET_MODE (x), ad))
2590 temp = copy_to_reg (ad);
2591 seq = gen_sequence ();
2593 emit_insn_before (seq, insn);
2594 return replace_equiv_address (x, temp);
2599 fmt = GET_RTX_FORMAT (code);
2600 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2603 XEXP (x, i) = fixup_stack_1 (XEXP (x, i), insn);
2604 else if (fmt[i] == 'E')
2607 for (j = 0; j < XVECLEN (x, i); j++)
2608 XVECEXP (x, i, j) = fixup_stack_1 (XVECEXP (x, i, j), insn);
2614 /* Optimization: a bit-field instruction whose field
2615 happens to be a byte or halfword in memory
2616 can be changed to a move instruction.
2618 We call here when INSN is an insn to examine or store into a bit-field.
2619 BODY is the SET-rtx to be altered.
2621 EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0.
2622 (Currently this is called only from function.c, and EQUIV_MEM
2626 optimize_bit_field (body, insn, equiv_mem)
2634 enum machine_mode mode;
2636 if (GET_CODE (SET_DEST (body)) == SIGN_EXTRACT
2637 || GET_CODE (SET_DEST (body)) == ZERO_EXTRACT)
2638 bitfield = SET_DEST (body), destflag = 1;
2640 bitfield = SET_SRC (body), destflag = 0;
2642 /* First check that the field being stored has constant size and position
2643 and is in fact a byte or halfword suitably aligned. */
2645 if (GET_CODE (XEXP (bitfield, 1)) == CONST_INT
2646 && GET_CODE (XEXP (bitfield, 2)) == CONST_INT
2647 && ((mode = mode_for_size (INTVAL (XEXP (bitfield, 1)), MODE_INT, 1))
2649 && INTVAL (XEXP (bitfield, 2)) % INTVAL (XEXP (bitfield, 1)) == 0)
2653 /* Now check that the containing word is memory, not a register,
2654 and that it is safe to change the machine mode. */
2656 if (GET_CODE (XEXP (bitfield, 0)) == MEM)
2657 memref = XEXP (bitfield, 0);
2658 else if (GET_CODE (XEXP (bitfield, 0)) == REG
2660 memref = equiv_mem[REGNO (XEXP (bitfield, 0))];
2661 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2662 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == MEM)
2663 memref = SUBREG_REG (XEXP (bitfield, 0));
2664 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2666 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == REG)
2667 memref = equiv_mem[REGNO (SUBREG_REG (XEXP (bitfield, 0)))];
2670 && ! mode_dependent_address_p (XEXP (memref, 0))
2671 && ! MEM_VOLATILE_P (memref))
2673 /* Now adjust the address, first for any subreg'ing
2674 that we are now getting rid of,
2675 and then for which byte of the word is wanted. */
2677 HOST_WIDE_INT offset = INTVAL (XEXP (bitfield, 2));
2680 /* Adjust OFFSET to count bits from low-address byte. */
2681 if (BITS_BIG_ENDIAN != BYTES_BIG_ENDIAN)
2682 offset = (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield, 0)))
2683 - offset - INTVAL (XEXP (bitfield, 1)));
2685 /* Adjust OFFSET to count bytes from low-address byte. */
2686 offset /= BITS_PER_UNIT;
2687 if (GET_CODE (XEXP (bitfield, 0)) == SUBREG)
2689 offset += (SUBREG_BYTE (XEXP (bitfield, 0))
2690 / UNITS_PER_WORD) * UNITS_PER_WORD;
2691 if (BYTES_BIG_ENDIAN)
2692 offset -= (MIN (UNITS_PER_WORD,
2693 GET_MODE_SIZE (GET_MODE (XEXP (bitfield, 0))))
2694 - MIN (UNITS_PER_WORD,
2695 GET_MODE_SIZE (GET_MODE (memref))));
2699 memref = adjust_address (memref, mode, offset);
2700 insns = get_insns ();
2702 emit_insns_before (insns, insn);
2704 /* Store this memory reference where
2705 we found the bit field reference. */
2709 validate_change (insn, &SET_DEST (body), memref, 1);
2710 if (! CONSTANT_ADDRESS_P (SET_SRC (body)))
2712 rtx src = SET_SRC (body);
2713 while (GET_CODE (src) == SUBREG
2714 && SUBREG_BYTE (src) == 0)
2715 src = SUBREG_REG (src);
2716 if (GET_MODE (src) != GET_MODE (memref))
2717 src = gen_lowpart (GET_MODE (memref), SET_SRC (body));
2718 validate_change (insn, &SET_SRC (body), src, 1);
2720 else if (GET_MODE (SET_SRC (body)) != VOIDmode
2721 && GET_MODE (SET_SRC (body)) != GET_MODE (memref))
2722 /* This shouldn't happen because anything that didn't have
2723 one of these modes should have got converted explicitly
2724 and then referenced through a subreg.
2725 This is so because the original bit-field was
2726 handled by agg_mode and so its tree structure had
2727 the same mode that memref now has. */
2732 rtx dest = SET_DEST (body);
2734 while (GET_CODE (dest) == SUBREG
2735 && SUBREG_BYTE (dest) == 0
2736 && (GET_MODE_CLASS (GET_MODE (dest))
2737 == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest))))
2738 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2740 dest = SUBREG_REG (dest);
2742 validate_change (insn, &SET_DEST (body), dest, 1);
2744 if (GET_MODE (dest) == GET_MODE (memref))
2745 validate_change (insn, &SET_SRC (body), memref, 1);
2748 /* Convert the mem ref to the destination mode. */
2749 rtx newreg = gen_reg_rtx (GET_MODE (dest));
2752 convert_move (newreg, memref,
2753 GET_CODE (SET_SRC (body)) == ZERO_EXTRACT);
2757 validate_change (insn, &SET_SRC (body), newreg, 1);
2761 /* See if we can convert this extraction or insertion into
2762 a simple move insn. We might not be able to do so if this
2763 was, for example, part of a PARALLEL.
2765 If we succeed, write out any needed conversions. If we fail,
2766 it is hard to guess why we failed, so don't do anything
2767 special; just let the optimization be suppressed. */
2769 if (apply_change_group () && seq)
2770 emit_insns_before (seq, insn);
2775 /* These routines are responsible for converting virtual register references
2776 to the actual hard register references once RTL generation is complete.
2778 The following four variables are used for communication between the
2779 routines. They contain the offsets of the virtual registers from their
2780 respective hard registers. */
2782 static int in_arg_offset;
2783 static int var_offset;
2784 static int dynamic_offset;
2785 static int out_arg_offset;
2786 static int cfa_offset;
2788 /* In most machines, the stack pointer register is equivalent to the bottom
2791 #ifndef STACK_POINTER_OFFSET
2792 #define STACK_POINTER_OFFSET 0
2795 /* If not defined, pick an appropriate default for the offset of dynamically
2796 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
2797 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
2799 #ifndef STACK_DYNAMIC_OFFSET
2801 /* The bottom of the stack points to the actual arguments. If
2802 REG_PARM_STACK_SPACE is defined, this includes the space for the register
2803 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
2804 stack space for register parameters is not pushed by the caller, but
2805 rather part of the fixed stack areas and hence not included in
2806 `current_function_outgoing_args_size'. Nevertheless, we must allow
2807 for it when allocating stack dynamic objects. */
2809 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2810 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2811 ((ACCUMULATE_OUTGOING_ARGS \
2812 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
2813 + (STACK_POINTER_OFFSET)) \
2816 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2817 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
2818 + (STACK_POINTER_OFFSET))
2822 /* On most machines, the CFA coincides with the first incoming parm. */
2824 #ifndef ARG_POINTER_CFA_OFFSET
2825 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
2828 /* Build up a (MEM (ADDRESSOF (REG))) rtx for a register REG that just had its
2829 address taken. DECL is the decl or SAVE_EXPR for the object stored in the
2830 register, for later use if we do need to force REG into the stack. REG is
2831 overwritten by the MEM like in put_reg_into_stack. */
2834 gen_mem_addressof (reg, decl)
2838 rtx r = gen_rtx_ADDRESSOF (Pmode, gen_reg_rtx (GET_MODE (reg)),
2841 /* Calculate this before we start messing with decl's RTL. */
2842 HOST_WIDE_INT set = decl ? get_alias_set (decl) : 0;
2844 /* If the original REG was a user-variable, then so is the REG whose
2845 address is being taken. Likewise for unchanging. */
2846 REG_USERVAR_P (XEXP (r, 0)) = REG_USERVAR_P (reg);
2847 RTX_UNCHANGING_P (XEXP (r, 0)) = RTX_UNCHANGING_P (reg);
2849 PUT_CODE (reg, MEM);
2850 MEM_ATTRS (reg) = 0;
2855 tree type = TREE_TYPE (decl);
2856 enum machine_mode decl_mode
2857 = (DECL_P (decl) ? DECL_MODE (decl) : TYPE_MODE (TREE_TYPE (decl)));
2858 rtx decl_rtl = (TREE_CODE (decl) == SAVE_EXPR ? SAVE_EXPR_RTL (decl)
2859 : DECL_RTL_IF_SET (decl));
2861 PUT_MODE (reg, decl_mode);
2863 /* Clear DECL_RTL momentarily so functions below will work
2864 properly, then set it again. */
2865 if (DECL_P (decl) && decl_rtl == reg)
2866 SET_DECL_RTL (decl, 0);
2868 set_mem_attributes (reg, decl, 1);
2869 set_mem_alias_set (reg, set);
2871 if (DECL_P (decl) && decl_rtl == reg)
2872 SET_DECL_RTL (decl, reg);
2874 if (TREE_USED (decl) || (DECL_P (decl) && DECL_INITIAL (decl) != 0))
2875 fixup_var_refs (reg, GET_MODE (reg), TREE_UNSIGNED (type), 0);
2878 fixup_var_refs (reg, GET_MODE (reg), 0, 0);
2883 /* If DECL has an RTL that is an ADDRESSOF rtx, put it into the stack. */
2886 flush_addressof (decl)
2889 if ((TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == VAR_DECL)
2890 && DECL_RTL (decl) != 0
2891 && GET_CODE (DECL_RTL (decl)) == MEM
2892 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF
2893 && GET_CODE (XEXP (XEXP (DECL_RTL (decl), 0), 0)) == REG)
2894 put_addressof_into_stack (XEXP (DECL_RTL (decl), 0), 0);
2897 /* Force the register pointed to by R, an ADDRESSOF rtx, into the stack. */
2900 put_addressof_into_stack (r, ht)
2902 struct hash_table *ht;
2905 int volatile_p, used_p;
2907 rtx reg = XEXP (r, 0);
2909 if (GET_CODE (reg) != REG)
2912 decl = ADDRESSOF_DECL (r);
2915 type = TREE_TYPE (decl);
2916 volatile_p = (TREE_CODE (decl) != SAVE_EXPR
2917 && TREE_THIS_VOLATILE (decl));
2918 used_p = (TREE_USED (decl)
2919 || (DECL_P (decl) && DECL_INITIAL (decl) != 0));
2928 put_reg_into_stack (0, reg, type, GET_MODE (reg), GET_MODE (reg),
2929 volatile_p, ADDRESSOF_REGNO (r), used_p, ht);
2932 /* List of replacements made below in purge_addressof_1 when creating
2933 bitfield insertions. */
2934 static rtx purge_bitfield_addressof_replacements;
2936 /* List of replacements made below in purge_addressof_1 for patterns
2937 (MEM (ADDRESSOF (REG ...))). The key of the list entry is the
2938 corresponding (ADDRESSOF (REG ...)) and value is a substitution for
2939 the all pattern. List PURGE_BITFIELD_ADDRESSOF_REPLACEMENTS is not
2940 enough in complex cases, e.g. when some field values can be
2941 extracted by usage MEM with narrower mode. */
2942 static rtx purge_addressof_replacements;
2944 /* Helper function for purge_addressof. See if the rtx expression at *LOC
2945 in INSN needs to be changed. If FORCE, always put any ADDRESSOFs into
2946 the stack. If the function returns FALSE then the replacement could not
2950 purge_addressof_1 (loc, insn, force, store, ht)
2954 struct hash_table *ht;
2962 /* Re-start here to avoid recursion in common cases. */
2969 code = GET_CODE (x);
2971 /* If we don't return in any of the cases below, we will recurse inside
2972 the RTX, which will normally result in any ADDRESSOF being forced into
2976 result = purge_addressof_1 (&SET_DEST (x), insn, force, 1, ht);
2977 result &= purge_addressof_1 (&SET_SRC (x), insn, force, 0, ht);
2980 else if (code == ADDRESSOF)
2984 if (GET_CODE (XEXP (x, 0)) != MEM)
2986 put_addressof_into_stack (x, ht);
2990 /* We must create a copy of the rtx because it was created by
2991 overwriting a REG rtx which is always shared. */
2992 sub = copy_rtx (XEXP (XEXP (x, 0), 0));
2993 if (validate_change (insn, loc, sub, 0)
2994 || validate_replace_rtx (x, sub, insn))
2998 sub = force_operand (sub, NULL_RTX);
2999 if (! validate_change (insn, loc, sub, 0)
3000 && ! validate_replace_rtx (x, sub, insn))
3003 insns = gen_sequence ();
3005 emit_insn_before (insns, insn);
3009 else if (code == MEM && GET_CODE (XEXP (x, 0)) == ADDRESSOF && ! force)
3011 rtx sub = XEXP (XEXP (x, 0), 0);
3013 if (GET_CODE (sub) == MEM)
3014 sub = adjust_address_nv (sub, GET_MODE (x), 0);
3015 else if (GET_CODE (sub) == REG
3016 && (MEM_VOLATILE_P (x) || GET_MODE (x) == BLKmode))
3018 else if (GET_CODE (sub) == REG && GET_MODE (x) != GET_MODE (sub))
3020 int size_x, size_sub;
3024 /* When processing REG_NOTES look at the list of
3025 replacements done on the insn to find the register that X
3029 for (tem = purge_bitfield_addressof_replacements;
3031 tem = XEXP (XEXP (tem, 1), 1))
3032 if (rtx_equal_p (x, XEXP (tem, 0)))
3034 *loc = XEXP (XEXP (tem, 1), 0);
3038 /* See comment for purge_addressof_replacements. */
3039 for (tem = purge_addressof_replacements;
3041 tem = XEXP (XEXP (tem, 1), 1))
3042 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3044 rtx z = XEXP (XEXP (tem, 1), 0);
3046 if (GET_MODE (x) == GET_MODE (z)
3047 || (GET_CODE (XEXP (XEXP (tem, 1), 0)) != REG
3048 && GET_CODE (XEXP (XEXP (tem, 1), 0)) != SUBREG))
3051 /* It can happen that the note may speak of things
3052 in a wider (or just different) mode than the
3053 code did. This is especially true of
3056 if (GET_CODE (z) == SUBREG && SUBREG_BYTE (z) == 0)
3059 if (GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD
3060 && (GET_MODE_SIZE (GET_MODE (x))
3061 > GET_MODE_SIZE (GET_MODE (z))))
3063 /* This can occur as a result in invalid
3064 pointer casts, e.g. float f; ...
3065 *(long long int *)&f.
3066 ??? We could emit a warning here, but
3067 without a line number that wouldn't be
3069 z = gen_rtx_SUBREG (GET_MODE (x), z, 0);
3072 z = gen_lowpart (GET_MODE (x), z);
3078 /* Sometimes we may not be able to find the replacement. For
3079 example when the original insn was a MEM in a wider mode,
3080 and the note is part of a sign extension of a narrowed
3081 version of that MEM. Gcc testcase compile/990829-1.c can
3082 generate an example of this situation. Rather than complain
3083 we return false, which will prompt our caller to remove the
3088 size_x = GET_MODE_BITSIZE (GET_MODE (x));
3089 size_sub = GET_MODE_BITSIZE (GET_MODE (sub));
3091 /* Don't even consider working with paradoxical subregs,
3092 or the moral equivalent seen here. */
3093 if (size_x <= size_sub
3094 && int_mode_for_mode (GET_MODE (sub)) != BLKmode)
3096 /* Do a bitfield insertion to mirror what would happen
3103 rtx p = PREV_INSN (insn);
3106 val = gen_reg_rtx (GET_MODE (x));
3107 if (! validate_change (insn, loc, val, 0))
3109 /* Discard the current sequence and put the
3110 ADDRESSOF on stack. */
3114 seq = gen_sequence ();
3116 emit_insn_before (seq, insn);
3117 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3121 store_bit_field (sub, size_x, 0, GET_MODE (x),
3122 val, GET_MODE_SIZE (GET_MODE (sub)));
3124 /* Make sure to unshare any shared rtl that store_bit_field
3125 might have created. */
3126 unshare_all_rtl_again (get_insns ());
3128 seq = gen_sequence ();
3130 p = emit_insn_after (seq, insn);
3131 if (NEXT_INSN (insn))
3132 compute_insns_for_mem (NEXT_INSN (insn),
3133 p ? NEXT_INSN (p) : NULL_RTX,
3138 rtx p = PREV_INSN (insn);
3141 val = extract_bit_field (sub, size_x, 0, 1, NULL_RTX,
3142 GET_MODE (x), GET_MODE (x),
3143 GET_MODE_SIZE (GET_MODE (sub)));
3145 if (! validate_change (insn, loc, val, 0))
3147 /* Discard the current sequence and put the
3148 ADDRESSOF on stack. */
3153 seq = gen_sequence ();
3155 emit_insn_before (seq, insn);
3156 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3160 /* Remember the replacement so that the same one can be done
3161 on the REG_NOTES. */
3162 purge_bitfield_addressof_replacements
3163 = gen_rtx_EXPR_LIST (VOIDmode, x,
3166 purge_bitfield_addressof_replacements));
3168 /* We replaced with a reg -- all done. */
3173 else if (validate_change (insn, loc, sub, 0))
3175 /* Remember the replacement so that the same one can be done
3176 on the REG_NOTES. */
3177 if (GET_CODE (sub) == REG || GET_CODE (sub) == SUBREG)
3181 for (tem = purge_addressof_replacements;
3183 tem = XEXP (XEXP (tem, 1), 1))
3184 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3186 XEXP (XEXP (tem, 1), 0) = sub;
3189 purge_addressof_replacements
3190 = gen_rtx (EXPR_LIST, VOIDmode, XEXP (x, 0),
3191 gen_rtx_EXPR_LIST (VOIDmode, sub,
3192 purge_addressof_replacements));
3200 /* Scan all subexpressions. */
3201 fmt = GET_RTX_FORMAT (code);
3202 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
3205 result &= purge_addressof_1 (&XEXP (x, i), insn, force, 0, ht);
3206 else if (*fmt == 'E')
3207 for (j = 0; j < XVECLEN (x, i); j++)
3208 result &= purge_addressof_1 (&XVECEXP (x, i, j), insn, force, 0, ht);
3214 /* Return a new hash table entry in HT. */
3216 static struct hash_entry *
3217 insns_for_mem_newfunc (he, ht, k)
3218 struct hash_entry *he;
3219 struct hash_table *ht;
3220 hash_table_key k ATTRIBUTE_UNUSED;
3222 struct insns_for_mem_entry *ifmhe;
3226 ifmhe = ((struct insns_for_mem_entry *)
3227 hash_allocate (ht, sizeof (struct insns_for_mem_entry)));
3228 ifmhe->insns = NULL_RTX;
3233 /* Return a hash value for K, a REG. */
3235 static unsigned long
3236 insns_for_mem_hash (k)
3239 /* K is really a RTX. Just use the address as the hash value. */
3240 return (unsigned long) k;
3243 /* Return non-zero if K1 and K2 (two REGs) are the same. */
3246 insns_for_mem_comp (k1, k2)
3253 struct insns_for_mem_walk_info
3255 /* The hash table that we are using to record which INSNs use which
3257 struct hash_table *ht;
3259 /* The INSN we are currently processing. */
3262 /* Zero if we are walking to find ADDRESSOFs, one if we are walking
3263 to find the insns that use the REGs in the ADDRESSOFs. */
3267 /* Called from compute_insns_for_mem via for_each_rtx. If R is a REG
3268 that might be used in an ADDRESSOF expression, record this INSN in
3269 the hash table given by DATA (which is really a pointer to an
3270 insns_for_mem_walk_info structure). */
3273 insns_for_mem_walk (r, data)
3277 struct insns_for_mem_walk_info *ifmwi
3278 = (struct insns_for_mem_walk_info *) data;
3280 if (ifmwi->pass == 0 && *r && GET_CODE (*r) == ADDRESSOF
3281 && GET_CODE (XEXP (*r, 0)) == REG)
3282 hash_lookup (ifmwi->ht, XEXP (*r, 0), /*create=*/1, /*copy=*/0);
3283 else if (ifmwi->pass == 1 && *r && GET_CODE (*r) == REG)
3285 /* Lookup this MEM in the hashtable, creating it if necessary. */
3286 struct insns_for_mem_entry *ifme
3287 = (struct insns_for_mem_entry *) hash_lookup (ifmwi->ht,
3292 /* If we have not already recorded this INSN, do so now. Since
3293 we process the INSNs in order, we know that if we have
3294 recorded it it must be at the front of the list. */
3295 if (ifme && (!ifme->insns || XEXP (ifme->insns, 0) != ifmwi->insn))
3296 ifme->insns = gen_rtx_EXPR_LIST (VOIDmode, ifmwi->insn,
3303 /* Walk the INSNS, until we reach LAST_INSN, recording which INSNs use
3304 which REGs in HT. */
3307 compute_insns_for_mem (insns, last_insn, ht)
3310 struct hash_table *ht;
3313 struct insns_for_mem_walk_info ifmwi;
3316 for (ifmwi.pass = 0; ifmwi.pass < 2; ++ifmwi.pass)
3317 for (insn = insns; insn != last_insn; insn = NEXT_INSN (insn))
3321 for_each_rtx (&insn, insns_for_mem_walk, &ifmwi);
3325 /* Helper function for purge_addressof called through for_each_rtx.
3326 Returns true iff the rtl is an ADDRESSOF. */
3329 is_addressof (rtl, data)
3331 void *data ATTRIBUTE_UNUSED;
3333 return GET_CODE (*rtl) == ADDRESSOF;
3336 /* Eliminate all occurrences of ADDRESSOF from INSNS. Elide any remaining
3337 (MEM (ADDRESSOF)) patterns, and force any needed registers into the
3341 purge_addressof (insns)
3345 struct hash_table ht;
3347 /* When we actually purge ADDRESSOFs, we turn REGs into MEMs. That
3348 requires a fixup pass over the instruction stream to correct
3349 INSNs that depended on the REG being a REG, and not a MEM. But,
3350 these fixup passes are slow. Furthermore, most MEMs are not
3351 mentioned in very many instructions. So, we speed up the process
3352 by pre-calculating which REGs occur in which INSNs; that allows
3353 us to perform the fixup passes much more quickly. */
3354 hash_table_init (&ht,
3355 insns_for_mem_newfunc,
3357 insns_for_mem_comp);
3358 compute_insns_for_mem (insns, NULL_RTX, &ht);
3360 for (insn = insns; insn; insn = NEXT_INSN (insn))
3361 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
3362 || GET_CODE (insn) == CALL_INSN)
3364 if (! purge_addressof_1 (&PATTERN (insn), insn,
3365 asm_noperands (PATTERN (insn)) > 0, 0, &ht))
3366 /* If we could not replace the ADDRESSOFs in the insn,
3367 something is wrong. */
3370 if (! purge_addressof_1 (®_NOTES (insn), NULL_RTX, 0, 0, &ht))
3372 /* If we could not replace the ADDRESSOFs in the insn's notes,
3373 we can just remove the offending notes instead. */
3376 for (note = REG_NOTES (insn); note; note = XEXP (note, 1))
3378 /* If we find a REG_RETVAL note then the insn is a libcall.
3379 Such insns must have REG_EQUAL notes as well, in order
3380 for later passes of the compiler to work. So it is not
3381 safe to delete the notes here, and instead we abort. */
3382 if (REG_NOTE_KIND (note) == REG_RETVAL)
3384 if (for_each_rtx (¬e, is_addressof, NULL))
3385 remove_note (insn, note);
3391 hash_table_free (&ht);
3392 purge_bitfield_addressof_replacements = 0;
3393 purge_addressof_replacements = 0;
3395 /* REGs are shared. purge_addressof will destructively replace a REG
3396 with a MEM, which creates shared MEMs.
3398 Unfortunately, the children of put_reg_into_stack assume that MEMs
3399 referring to the same stack slot are shared (fixup_var_refs and
3400 the associated hash table code).
3402 So, we have to do another unsharing pass after we have flushed any
3403 REGs that had their address taken into the stack.
3405 It may be worth tracking whether or not we converted any REGs into
3406 MEMs to avoid this overhead when it is not needed. */
3407 unshare_all_rtl_again (get_insns ());
3410 /* Convert a SET of a hard subreg to a set of the appropriate hard
3411 register. A subroutine of purge_hard_subreg_sets. */
3414 purge_single_hard_subreg_set (pattern)
3417 rtx reg = SET_DEST (pattern);
3418 enum machine_mode mode = GET_MODE (SET_DEST (pattern));
3421 if (GET_CODE (reg) == SUBREG && GET_CODE (SUBREG_REG (reg)) == REG
3422 && REGNO (SUBREG_REG (reg)) < FIRST_PSEUDO_REGISTER)
3424 offset = subreg_regno_offset (REGNO (SUBREG_REG (reg)),
3425 GET_MODE (SUBREG_REG (reg)),
3428 reg = SUBREG_REG (reg);
3432 if (GET_CODE (reg) == REG && REGNO (reg) < FIRST_PSEUDO_REGISTER)
3434 reg = gen_rtx_REG (mode, REGNO (reg) + offset);
3435 SET_DEST (pattern) = reg;
3439 /* Eliminate all occurrences of SETs of hard subregs from INSNS. The
3440 only such SETs that we expect to see are those left in because
3441 integrate can't handle sets of parts of a return value register.
3443 We don't use alter_subreg because we only want to eliminate subregs
3444 of hard registers. */
3447 purge_hard_subreg_sets (insn)
3450 for (; insn; insn = NEXT_INSN (insn))
3454 rtx pattern = PATTERN (insn);
3455 switch (GET_CODE (pattern))
3458 if (GET_CODE (SET_DEST (pattern)) == SUBREG)
3459 purge_single_hard_subreg_set (pattern);
3464 for (j = XVECLEN (pattern, 0) - 1; j >= 0; j--)
3466 rtx inner_pattern = XVECEXP (pattern, 0, j);
3467 if (GET_CODE (inner_pattern) == SET
3468 && GET_CODE (SET_DEST (inner_pattern)) == SUBREG)
3469 purge_single_hard_subreg_set (inner_pattern);
3480 /* Pass through the INSNS of function FNDECL and convert virtual register
3481 references to hard register references. */
3484 instantiate_virtual_regs (fndecl, insns)
3491 /* Compute the offsets to use for this function. */
3492 in_arg_offset = FIRST_PARM_OFFSET (fndecl);
3493 var_offset = STARTING_FRAME_OFFSET;
3494 dynamic_offset = STACK_DYNAMIC_OFFSET (fndecl);
3495 out_arg_offset = STACK_POINTER_OFFSET;
3496 cfa_offset = ARG_POINTER_CFA_OFFSET (fndecl);
3498 /* Scan all variables and parameters of this function. For each that is
3499 in memory, instantiate all virtual registers if the result is a valid
3500 address. If not, we do it later. That will handle most uses of virtual
3501 regs on many machines. */
3502 instantiate_decls (fndecl, 1);
3504 /* Initialize recognition, indicating that volatile is OK. */
3507 /* Scan through all the insns, instantiating every virtual register still
3509 for (insn = insns; insn; insn = NEXT_INSN (insn))
3510 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
3511 || GET_CODE (insn) == CALL_INSN)
3513 instantiate_virtual_regs_1 (&PATTERN (insn), insn, 1);
3514 instantiate_virtual_regs_1 (®_NOTES (insn), NULL_RTX, 0);
3515 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
3516 if (GET_CODE (insn) == CALL_INSN)
3517 instantiate_virtual_regs_1 (&CALL_INSN_FUNCTION_USAGE (insn),
3521 /* Instantiate the stack slots for the parm registers, for later use in
3522 addressof elimination. */
3523 for (i = 0; i < max_parm_reg; ++i)
3524 if (parm_reg_stack_loc[i])
3525 instantiate_virtual_regs_1 (&parm_reg_stack_loc[i], NULL_RTX, 0);
3527 /* Now instantiate the remaining register equivalences for debugging info.
3528 These will not be valid addresses. */
3529 instantiate_decls (fndecl, 0);
3531 /* Indicate that, from now on, assign_stack_local should use
3532 frame_pointer_rtx. */
3533 virtuals_instantiated = 1;
3536 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
3537 all virtual registers in their DECL_RTL's.
3539 If VALID_ONLY, do this only if the resulting address is still valid.
3540 Otherwise, always do it. */
3543 instantiate_decls (fndecl, valid_only)
3549 /* Process all parameters of the function. */
3550 for (decl = DECL_ARGUMENTS (fndecl); decl; decl = TREE_CHAIN (decl))
3552 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (decl));
3553 HOST_WIDE_INT size_rtl;
3555 instantiate_decl (DECL_RTL (decl), size, valid_only);
3557 /* If the parameter was promoted, then the incoming RTL mode may be
3558 larger than the declared type size. We must use the larger of
3560 size_rtl = GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl)));
3561 size = MAX (size_rtl, size);
3562 instantiate_decl (DECL_INCOMING_RTL (decl), size, valid_only);
3565 /* Now process all variables defined in the function or its subblocks. */
3566 instantiate_decls_1 (DECL_INITIAL (fndecl), valid_only);
3569 /* Subroutine of instantiate_decls: Process all decls in the given
3570 BLOCK node and all its subblocks. */
3573 instantiate_decls_1 (let, valid_only)
3579 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
3580 if (DECL_RTL_SET_P (t))
3581 instantiate_decl (DECL_RTL (t),
3582 int_size_in_bytes (TREE_TYPE (t)),
3585 /* Process all subblocks. */
3586 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
3587 instantiate_decls_1 (t, valid_only);
3590 /* Subroutine of the preceding procedures: Given RTL representing a
3591 decl and the size of the object, do any instantiation required.
3593 If VALID_ONLY is non-zero, it means that the RTL should only be
3594 changed if the new address is valid. */
3597 instantiate_decl (x, size, valid_only)
3602 enum machine_mode mode;
3605 /* If this is not a MEM, no need to do anything. Similarly if the
3606 address is a constant or a register that is not a virtual register. */
3608 if (x == 0 || GET_CODE (x) != MEM)
3612 if (CONSTANT_P (addr)
3613 || (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == REG)
3614 || (GET_CODE (addr) == REG
3615 && (REGNO (addr) < FIRST_VIRTUAL_REGISTER
3616 || REGNO (addr) > LAST_VIRTUAL_REGISTER)))
3619 /* If we should only do this if the address is valid, copy the address.
3620 We need to do this so we can undo any changes that might make the
3621 address invalid. This copy is unfortunate, but probably can't be
3625 addr = copy_rtx (addr);
3627 instantiate_virtual_regs_1 (&addr, NULL_RTX, 0);
3629 if (valid_only && size >= 0)
3631 unsigned HOST_WIDE_INT decl_size = size;
3633 /* Now verify that the resulting address is valid for every integer or
3634 floating-point mode up to and including SIZE bytes long. We do this
3635 since the object might be accessed in any mode and frame addresses
3638 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3639 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3640 mode = GET_MODE_WIDER_MODE (mode))
3641 if (! memory_address_p (mode, addr))
3644 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
3645 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3646 mode = GET_MODE_WIDER_MODE (mode))
3647 if (! memory_address_p (mode, addr))
3651 /* Put back the address now that we have updated it and we either know
3652 it is valid or we don't care whether it is valid. */
3657 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
3658 is a virtual register, return the equivalent hard register and set the
3659 offset indirectly through the pointer. Otherwise, return 0. */
3662 instantiate_new_reg (x, poffset)
3664 HOST_WIDE_INT *poffset;
3667 HOST_WIDE_INT offset;
3669 if (x == virtual_incoming_args_rtx)
3670 new = arg_pointer_rtx, offset = in_arg_offset;
3671 else if (x == virtual_stack_vars_rtx)
3672 new = frame_pointer_rtx, offset = var_offset;
3673 else if (x == virtual_stack_dynamic_rtx)
3674 new = stack_pointer_rtx, offset = dynamic_offset;
3675 else if (x == virtual_outgoing_args_rtx)
3676 new = stack_pointer_rtx, offset = out_arg_offset;
3677 else if (x == virtual_cfa_rtx)
3678 new = arg_pointer_rtx, offset = cfa_offset;
3686 /* Given a pointer to a piece of rtx and an optional pointer to the
3687 containing object, instantiate any virtual registers present in it.
3689 If EXTRA_INSNS, we always do the replacement and generate
3690 any extra insns before OBJECT. If it zero, we do nothing if replacement
3693 Return 1 if we either had nothing to do or if we were able to do the
3694 needed replacement. Return 0 otherwise; we only return zero if
3695 EXTRA_INSNS is zero.
3697 We first try some simple transformations to avoid the creation of extra
3701 instantiate_virtual_regs_1 (loc, object, extra_insns)
3709 HOST_WIDE_INT offset = 0;
3715 /* Re-start here to avoid recursion in common cases. */
3722 code = GET_CODE (x);
3724 /* Check for some special cases. */
3741 /* We are allowed to set the virtual registers. This means that
3742 the actual register should receive the source minus the
3743 appropriate offset. This is used, for example, in the handling
3744 of non-local gotos. */
3745 if ((new = instantiate_new_reg (SET_DEST (x), &offset)) != 0)
3747 rtx src = SET_SRC (x);
3749 /* We are setting the register, not using it, so the relevant
3750 offset is the negative of the offset to use were we using
3753 instantiate_virtual_regs_1 (&src, NULL_RTX, 0);
3755 /* The only valid sources here are PLUS or REG. Just do
3756 the simplest possible thing to handle them. */
3757 if (GET_CODE (src) != REG && GET_CODE (src) != PLUS)
3761 if (GET_CODE (src) != REG)
3762 temp = force_operand (src, NULL_RTX);
3765 temp = force_operand (plus_constant (temp, offset), NULL_RTX);
3769 emit_insns_before (seq, object);
3772 if (! validate_change (object, &SET_SRC (x), temp, 0)
3779 instantiate_virtual_regs_1 (&SET_DEST (x), object, extra_insns);
3784 /* Handle special case of virtual register plus constant. */
3785 if (CONSTANT_P (XEXP (x, 1)))
3787 rtx old, new_offset;
3789 /* Check for (plus (plus VIRT foo) (const_int)) first. */
3790 if (GET_CODE (XEXP (x, 0)) == PLUS)
3792 if ((new = instantiate_new_reg (XEXP (XEXP (x, 0), 0), &offset)))
3794 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 1), object,
3796 new = gen_rtx_PLUS (Pmode, new, XEXP (XEXP (x, 0), 1));
3805 #ifdef POINTERS_EXTEND_UNSIGNED
3806 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
3807 we can commute the PLUS and SUBREG because pointers into the
3808 frame are well-behaved. */
3809 else if (GET_CODE (XEXP (x, 0)) == SUBREG && GET_MODE (x) == ptr_mode
3810 && GET_CODE (XEXP (x, 1)) == CONST_INT
3812 = instantiate_new_reg (SUBREG_REG (XEXP (x, 0)),
3814 && validate_change (object, loc,
3815 plus_constant (gen_lowpart (ptr_mode,
3818 + INTVAL (XEXP (x, 1))),
3822 else if ((new = instantiate_new_reg (XEXP (x, 0), &offset)) == 0)
3824 /* We know the second operand is a constant. Unless the
3825 first operand is a REG (which has been already checked),
3826 it needs to be checked. */
3827 if (GET_CODE (XEXP (x, 0)) != REG)
3835 new_offset = plus_constant (XEXP (x, 1), offset);
3837 /* If the new constant is zero, try to replace the sum with just
3839 if (new_offset == const0_rtx
3840 && validate_change (object, loc, new, 0))
3843 /* Next try to replace the register and new offset.
3844 There are two changes to validate here and we can't assume that
3845 in the case of old offset equals new just changing the register
3846 will yield a valid insn. In the interests of a little efficiency,
3847 however, we only call validate change once (we don't queue up the
3848 changes and then call apply_change_group). */
3852 ? ! validate_change (object, &XEXP (x, 0), new, 0)
3853 : (XEXP (x, 0) = new,
3854 ! validate_change (object, &XEXP (x, 1), new_offset, 0)))
3862 /* Otherwise copy the new constant into a register and replace
3863 constant with that register. */
3864 temp = gen_reg_rtx (Pmode);
3866 if (validate_change (object, &XEXP (x, 1), temp, 0))
3867 emit_insn_before (gen_move_insn (temp, new_offset), object);
3870 /* If that didn't work, replace this expression with a
3871 register containing the sum. */
3874 new = gen_rtx_PLUS (Pmode, new, new_offset);
3877 temp = force_operand (new, NULL_RTX);
3881 emit_insns_before (seq, object);
3882 if (! validate_change (object, loc, temp, 0)
3883 && ! validate_replace_rtx (x, temp, object))
3891 /* Fall through to generic two-operand expression case. */
3897 case DIV: case UDIV:
3898 case MOD: case UMOD:
3899 case AND: case IOR: case XOR:
3900 case ROTATERT: case ROTATE:
3901 case ASHIFTRT: case LSHIFTRT: case ASHIFT:
3903 case GE: case GT: case GEU: case GTU:
3904 case LE: case LT: case LEU: case LTU:
3905 if (XEXP (x, 1) && ! CONSTANT_P (XEXP (x, 1)))
3906 instantiate_virtual_regs_1 (&XEXP (x, 1), object, extra_insns);
3911 /* Most cases of MEM that convert to valid addresses have already been
3912 handled by our scan of decls. The only special handling we
3913 need here is to make a copy of the rtx to ensure it isn't being
3914 shared if we have to change it to a pseudo.
3916 If the rtx is a simple reference to an address via a virtual register,
3917 it can potentially be shared. In such cases, first try to make it
3918 a valid address, which can also be shared. Otherwise, copy it and
3921 First check for common cases that need no processing. These are
3922 usually due to instantiation already being done on a previous instance
3926 if (CONSTANT_ADDRESS_P (temp)
3927 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3928 || temp == arg_pointer_rtx
3930 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3931 || temp == hard_frame_pointer_rtx
3933 || temp == frame_pointer_rtx)
3936 if (GET_CODE (temp) == PLUS
3937 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
3938 && (XEXP (temp, 0) == frame_pointer_rtx
3939 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3940 || XEXP (temp, 0) == hard_frame_pointer_rtx
3942 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3943 || XEXP (temp, 0) == arg_pointer_rtx
3948 if (temp == virtual_stack_vars_rtx
3949 || temp == virtual_incoming_args_rtx
3950 || (GET_CODE (temp) == PLUS
3951 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
3952 && (XEXP (temp, 0) == virtual_stack_vars_rtx
3953 || XEXP (temp, 0) == virtual_incoming_args_rtx)))
3955 /* This MEM may be shared. If the substitution can be done without
3956 the need to generate new pseudos, we want to do it in place
3957 so all copies of the shared rtx benefit. The call below will
3958 only make substitutions if the resulting address is still
3961 Note that we cannot pass X as the object in the recursive call
3962 since the insn being processed may not allow all valid
3963 addresses. However, if we were not passed on object, we can
3964 only modify X without copying it if X will have a valid
3967 ??? Also note that this can still lose if OBJECT is an insn that
3968 has less restrictions on an address that some other insn.
3969 In that case, we will modify the shared address. This case
3970 doesn't seem very likely, though. One case where this could
3971 happen is in the case of a USE or CLOBBER reference, but we
3972 take care of that below. */
3974 if (instantiate_virtual_regs_1 (&XEXP (x, 0),
3975 object ? object : x, 0))
3978 /* Otherwise make a copy and process that copy. We copy the entire
3979 RTL expression since it might be a PLUS which could also be
3981 *loc = x = copy_rtx (x);
3984 /* Fall through to generic unary operation case. */
3987 case STRICT_LOW_PART:
3989 case PRE_DEC: case PRE_INC: case POST_DEC: case POST_INC:
3990 case SIGN_EXTEND: case ZERO_EXTEND:
3991 case TRUNCATE: case FLOAT_EXTEND: case FLOAT_TRUNCATE:
3992 case FLOAT: case FIX:
3993 case UNSIGNED_FIX: case UNSIGNED_FLOAT:
3997 /* These case either have just one operand or we know that we need not
3998 check the rest of the operands. */
4004 /* If the operand is a MEM, see if the change is a valid MEM. If not,
4005 go ahead and make the invalid one, but do it to a copy. For a REG,
4006 just make the recursive call, since there's no chance of a problem. */
4008 if ((GET_CODE (XEXP (x, 0)) == MEM
4009 && instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), XEXP (x, 0),
4011 || (GET_CODE (XEXP (x, 0)) == REG
4012 && instantiate_virtual_regs_1 (&XEXP (x, 0), object, 0)))
4015 XEXP (x, 0) = copy_rtx (XEXP (x, 0));
4020 /* Try to replace with a PLUS. If that doesn't work, compute the sum
4021 in front of this insn and substitute the temporary. */
4022 if ((new = instantiate_new_reg (x, &offset)) != 0)
4024 temp = plus_constant (new, offset);
4025 if (!validate_change (object, loc, temp, 0))
4031 temp = force_operand (temp, NULL_RTX);
4035 emit_insns_before (seq, object);
4036 if (! validate_change (object, loc, temp, 0)
4037 && ! validate_replace_rtx (x, temp, object))
4045 if (GET_CODE (XEXP (x, 0)) == REG)
4048 else if (GET_CODE (XEXP (x, 0)) == MEM)
4050 /* If we have a (addressof (mem ..)), do any instantiation inside
4051 since we know we'll be making the inside valid when we finally
4052 remove the ADDRESSOF. */
4053 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), NULL_RTX, 0);
4062 /* Scan all subexpressions. */
4063 fmt = GET_RTX_FORMAT (code);
4064 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
4067 if (!instantiate_virtual_regs_1 (&XEXP (x, i), object, extra_insns))
4070 else if (*fmt == 'E')
4071 for (j = 0; j < XVECLEN (x, i); j++)
4072 if (! instantiate_virtual_regs_1 (&XVECEXP (x, i, j), object,
4079 /* Optimization: assuming this function does not receive nonlocal gotos,
4080 delete the handlers for such, as well as the insns to establish
4081 and disestablish them. */
4087 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4089 /* Delete the handler by turning off the flag that would
4090 prevent jump_optimize from deleting it.
4091 Also permit deletion of the nonlocal labels themselves
4092 if nothing local refers to them. */
4093 if (GET_CODE (insn) == CODE_LABEL)
4097 LABEL_PRESERVE_P (insn) = 0;
4099 /* Remove it from the nonlocal_label list, to avoid confusing
4101 for (t = nonlocal_labels, last_t = 0; t;
4102 last_t = t, t = TREE_CHAIN (t))
4103 if (DECL_RTL (TREE_VALUE (t)) == insn)
4108 nonlocal_labels = TREE_CHAIN (nonlocal_labels);
4110 TREE_CHAIN (last_t) = TREE_CHAIN (t);
4113 if (GET_CODE (insn) == INSN)
4117 for (t = nonlocal_goto_handler_slots; t != 0; t = XEXP (t, 1))
4118 if (reg_mentioned_p (t, PATTERN (insn)))
4124 || (nonlocal_goto_stack_level != 0
4125 && reg_mentioned_p (nonlocal_goto_stack_level,
4127 delete_related_insns (insn);
4135 return max_parm_reg;
4138 /* Return the first insn following those generated by `assign_parms'. */
4141 get_first_nonparm_insn ()
4144 return NEXT_INSN (last_parm_insn);
4145 return get_insns ();
4148 /* Return the first NOTE_INSN_BLOCK_BEG note in the function.
4149 Crash if there is none. */
4152 get_first_block_beg ()
4155 rtx insn = get_first_nonparm_insn ();
4157 for (searcher = insn; searcher; searcher = NEXT_INSN (searcher))
4158 if (GET_CODE (searcher) == NOTE
4159 && NOTE_LINE_NUMBER (searcher) == NOTE_INSN_BLOCK_BEG)
4162 abort (); /* Invalid call to this function. (See comments above.) */
4166 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
4167 This means a type for which function calls must pass an address to the
4168 function or get an address back from the function.
4169 EXP may be a type node or an expression (whose type is tested). */
4172 aggregate_value_p (exp)
4175 int i, regno, nregs;
4178 tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
4180 if (TREE_CODE (type) == VOID_TYPE)
4182 if (RETURN_IN_MEMORY (type))
4184 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
4185 and thus can't be returned in registers. */
4186 if (TREE_ADDRESSABLE (type))
4188 if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
4190 /* Make sure we have suitable call-clobbered regs to return
4191 the value in; if not, we must return it in memory. */
4192 reg = hard_function_value (type, 0, 0);
4194 /* If we have something other than a REG (e.g. a PARALLEL), then assume
4196 if (GET_CODE (reg) != REG)
4199 regno = REGNO (reg);
4200 nregs = HARD_REGNO_NREGS (regno, TYPE_MODE (type));
4201 for (i = 0; i < nregs; i++)
4202 if (! call_used_regs[regno + i])
4207 /* Assign RTL expressions to the function's parameters.
4208 This may involve copying them into registers and using
4209 those registers as the RTL for them. */
4212 assign_parms (fndecl)
4218 CUMULATIVE_ARGS args_so_far;
4219 enum machine_mode promoted_mode, passed_mode;
4220 enum machine_mode nominal_mode, promoted_nominal_mode;
4222 /* Total space needed so far for args on the stack,
4223 given as a constant and a tree-expression. */
4224 struct args_size stack_args_size;
4225 tree fntype = TREE_TYPE (fndecl);
4226 tree fnargs = DECL_ARGUMENTS (fndecl);
4227 /* This is used for the arg pointer when referring to stack args. */
4228 rtx internal_arg_pointer;
4229 /* This is a dummy PARM_DECL that we used for the function result if
4230 the function returns a structure. */
4231 tree function_result_decl = 0;
4232 #ifdef SETUP_INCOMING_VARARGS
4233 int varargs_setup = 0;
4235 rtx conversion_insns = 0;
4236 struct args_size alignment_pad;
4238 /* Nonzero if the last arg is named `__builtin_va_alist',
4239 which is used on some machines for old-fashioned non-ANSI varargs.h;
4240 this should be stuck onto the stack as if it had arrived there. */
4242 = (current_function_varargs
4244 && (parm = tree_last (fnargs)) != 0
4246 && (! strcmp (IDENTIFIER_POINTER (DECL_NAME (parm)),
4247 "__builtin_va_alist")));
4249 /* Nonzero if function takes extra anonymous args.
4250 This means the last named arg must be on the stack
4251 right before the anonymous ones. */
4253 = (TYPE_ARG_TYPES (fntype) != 0
4254 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
4255 != void_type_node));
4257 current_function_stdarg = stdarg;
4259 /* If the reg that the virtual arg pointer will be translated into is
4260 not a fixed reg or is the stack pointer, make a copy of the virtual
4261 arg pointer, and address parms via the copy. The frame pointer is
4262 considered fixed even though it is not marked as such.
4264 The second time through, simply use ap to avoid generating rtx. */
4266 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
4267 || ! (fixed_regs[ARG_POINTER_REGNUM]
4268 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
4269 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
4271 internal_arg_pointer = virtual_incoming_args_rtx;
4272 current_function_internal_arg_pointer = internal_arg_pointer;
4274 stack_args_size.constant = 0;
4275 stack_args_size.var = 0;
4277 /* If struct value address is treated as the first argument, make it so. */
4278 if (aggregate_value_p (DECL_RESULT (fndecl))
4279 && ! current_function_returns_pcc_struct
4280 && struct_value_incoming_rtx == 0)
4282 tree type = build_pointer_type (TREE_TYPE (fntype));
4284 function_result_decl = build_decl (PARM_DECL, NULL_TREE, type);
4286 DECL_ARG_TYPE (function_result_decl) = type;
4287 TREE_CHAIN (function_result_decl) = fnargs;
4288 fnargs = function_result_decl;
4291 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
4292 parm_reg_stack_loc = (rtx *) xcalloc (max_parm_reg, sizeof (rtx));
4294 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
4295 INIT_CUMULATIVE_INCOMING_ARGS (args_so_far, fntype, NULL_RTX);
4297 INIT_CUMULATIVE_ARGS (args_so_far, fntype, NULL_RTX, 0);
4300 /* We haven't yet found an argument that we must push and pretend the
4302 current_function_pretend_args_size = 0;
4304 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
4306 struct args_size stack_offset;
4307 struct args_size arg_size;
4308 int passed_pointer = 0;
4309 int did_conversion = 0;
4310 tree passed_type = DECL_ARG_TYPE (parm);
4311 tree nominal_type = TREE_TYPE (parm);
4313 int last_named = 0, named_arg;
4315 /* Set LAST_NAMED if this is last named arg before last
4317 if (stdarg || current_function_varargs)
4321 for (tem = TREE_CHAIN (parm); tem; tem = TREE_CHAIN (tem))
4322 if (DECL_NAME (tem))
4328 /* Set NAMED_ARG if this arg should be treated as a named arg. For
4329 most machines, if this is a varargs/stdarg function, then we treat
4330 the last named arg as if it were anonymous too. */
4331 named_arg = STRICT_ARGUMENT_NAMING ? 1 : ! last_named;
4333 if (TREE_TYPE (parm) == error_mark_node
4334 /* This can happen after weird syntax errors
4335 or if an enum type is defined among the parms. */
4336 || TREE_CODE (parm) != PARM_DECL
4337 || passed_type == NULL)
4339 SET_DECL_RTL (parm, gen_rtx_MEM (BLKmode, const0_rtx));
4340 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4341 TREE_USED (parm) = 1;
4345 /* For varargs.h function, save info about regs and stack space
4346 used by the individual args, not including the va_alist arg. */
4347 if (hide_last_arg && last_named)
4348 current_function_args_info = args_so_far;
4350 /* Find mode of arg as it is passed, and mode of arg
4351 as it should be during execution of this function. */
4352 passed_mode = TYPE_MODE (passed_type);
4353 nominal_mode = TYPE_MODE (nominal_type);
4355 /* If the parm's mode is VOID, its value doesn't matter,
4356 and avoid the usual things like emit_move_insn that could crash. */
4357 if (nominal_mode == VOIDmode)
4359 SET_DECL_RTL (parm, const0_rtx);
4360 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4364 /* If the parm is to be passed as a transparent union, use the
4365 type of the first field for the tests below. We have already
4366 verified that the modes are the same. */
4367 if (DECL_TRANSPARENT_UNION (parm)
4368 || (TREE_CODE (passed_type) == UNION_TYPE
4369 && TYPE_TRANSPARENT_UNION (passed_type)))
4370 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
4372 /* See if this arg was passed by invisible reference. It is if
4373 it is an object whose size depends on the contents of the
4374 object itself or if the machine requires these objects be passed
4377 if ((TREE_CODE (TYPE_SIZE (passed_type)) != INTEGER_CST
4378 && contains_placeholder_p (TYPE_SIZE (passed_type)))
4379 || TREE_ADDRESSABLE (passed_type)
4380 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
4381 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, passed_mode,
4382 passed_type, named_arg)
4386 passed_type = nominal_type = build_pointer_type (passed_type);
4388 passed_mode = nominal_mode = Pmode;
4391 promoted_mode = passed_mode;
4393 #ifdef PROMOTE_FUNCTION_ARGS
4394 /* Compute the mode in which the arg is actually extended to. */
4395 unsignedp = TREE_UNSIGNED (passed_type);
4396 promoted_mode = promote_mode (passed_type, promoted_mode, &unsignedp, 1);
4399 /* Let machine desc say which reg (if any) the parm arrives in.
4400 0 means it arrives on the stack. */
4401 #ifdef FUNCTION_INCOMING_ARG
4402 entry_parm = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4403 passed_type, named_arg);
4405 entry_parm = FUNCTION_ARG (args_so_far, promoted_mode,
4406 passed_type, named_arg);
4409 if (entry_parm == 0)
4410 promoted_mode = passed_mode;
4412 #ifdef SETUP_INCOMING_VARARGS
4413 /* If this is the last named parameter, do any required setup for
4414 varargs or stdargs. We need to know about the case of this being an
4415 addressable type, in which case we skip the registers it
4416 would have arrived in.
4418 For stdargs, LAST_NAMED will be set for two parameters, the one that
4419 is actually the last named, and the dummy parameter. We only
4420 want to do this action once.
4422 Also, indicate when RTL generation is to be suppressed. */
4423 if (last_named && !varargs_setup)
4425 SETUP_INCOMING_VARARGS (args_so_far, promoted_mode, passed_type,
4426 current_function_pretend_args_size, 0);
4431 /* Determine parm's home in the stack,
4432 in case it arrives in the stack or we should pretend it did.
4434 Compute the stack position and rtx where the argument arrives
4437 There is one complexity here: If this was a parameter that would
4438 have been passed in registers, but wasn't only because it is
4439 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
4440 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
4441 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
4442 0 as it was the previous time. */
4444 pretend_named = named_arg || PRETEND_OUTGOING_VARARGS_NAMED;
4445 locate_and_pad_parm (promoted_mode, passed_type,
4446 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4449 #ifdef FUNCTION_INCOMING_ARG
4450 FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4452 pretend_named) != 0,
4454 FUNCTION_ARG (args_so_far, promoted_mode,
4456 pretend_named) != 0,
4459 fndecl, &stack_args_size, &stack_offset, &arg_size,
4463 rtx offset_rtx = ARGS_SIZE_RTX (stack_offset);
4465 if (offset_rtx == const0_rtx)
4466 stack_parm = gen_rtx_MEM (promoted_mode, internal_arg_pointer);
4468 stack_parm = gen_rtx_MEM (promoted_mode,
4469 gen_rtx_PLUS (Pmode,
4470 internal_arg_pointer,
4473 set_mem_attributes (stack_parm, parm, 1);
4476 /* If this parameter was passed both in registers and in the stack,
4477 use the copy on the stack. */
4478 if (MUST_PASS_IN_STACK (promoted_mode, passed_type))
4481 #ifdef FUNCTION_ARG_PARTIAL_NREGS
4482 /* If this parm was passed part in regs and part in memory,
4483 pretend it arrived entirely in memory
4484 by pushing the register-part onto the stack.
4486 In the special case of a DImode or DFmode that is split,
4487 we could put it together in a pseudoreg directly,
4488 but for now that's not worth bothering with. */
4492 int nregs = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, promoted_mode,
4493 passed_type, named_arg);
4497 current_function_pretend_args_size
4498 = (((nregs * UNITS_PER_WORD) + (PARM_BOUNDARY / BITS_PER_UNIT) - 1)
4499 / (PARM_BOUNDARY / BITS_PER_UNIT)
4500 * (PARM_BOUNDARY / BITS_PER_UNIT));
4502 /* Handle calls that pass values in multiple non-contiguous
4503 locations. The Irix 6 ABI has examples of this. */
4504 if (GET_CODE (entry_parm) == PARALLEL)
4505 emit_group_store (validize_mem (stack_parm), entry_parm,
4506 int_size_in_bytes (TREE_TYPE (parm)));
4509 move_block_from_reg (REGNO (entry_parm),
4510 validize_mem (stack_parm), nregs,
4511 int_size_in_bytes (TREE_TYPE (parm)));
4513 entry_parm = stack_parm;
4518 /* If we didn't decide this parm came in a register,
4519 by default it came on the stack. */
4520 if (entry_parm == 0)
4521 entry_parm = stack_parm;
4523 /* Record permanently how this parm was passed. */
4524 DECL_INCOMING_RTL (parm) = entry_parm;
4526 /* If there is actually space on the stack for this parm,
4527 count it in stack_args_size; otherwise set stack_parm to 0
4528 to indicate there is no preallocated stack slot for the parm. */
4530 if (entry_parm == stack_parm
4531 || (GET_CODE (entry_parm) == PARALLEL
4532 && XEXP (XVECEXP (entry_parm, 0, 0), 0) == NULL_RTX)
4533 #if defined (REG_PARM_STACK_SPACE) && ! defined (MAYBE_REG_PARM_STACK_SPACE)
4534 /* On some machines, even if a parm value arrives in a register
4535 there is still an (uninitialized) stack slot allocated for it.
4537 ??? When MAYBE_REG_PARM_STACK_SPACE is defined, we can't tell
4538 whether this parameter already has a stack slot allocated,
4539 because an arg block exists only if current_function_args_size
4540 is larger than some threshold, and we haven't calculated that
4541 yet. So, for now, we just assume that stack slots never exist
4543 || REG_PARM_STACK_SPACE (fndecl) > 0
4547 stack_args_size.constant += arg_size.constant;
4549 ADD_PARM_SIZE (stack_args_size, arg_size.var);
4552 /* No stack slot was pushed for this parm. */
4555 /* Update info on where next arg arrives in registers. */
4557 FUNCTION_ARG_ADVANCE (args_so_far, promoted_mode,
4558 passed_type, named_arg);
4560 /* If we can't trust the parm stack slot to be aligned enough
4561 for its ultimate type, don't use that slot after entry.
4562 We'll make another stack slot, if we need one. */
4564 unsigned int thisparm_boundary
4565 = FUNCTION_ARG_BOUNDARY (promoted_mode, passed_type);
4567 if (GET_MODE_ALIGNMENT (nominal_mode) > thisparm_boundary)
4571 /* If parm was passed in memory, and we need to convert it on entry,
4572 don't store it back in that same slot. */
4574 && nominal_mode != BLKmode && nominal_mode != passed_mode)
4577 /* When an argument is passed in multiple locations, we can't
4578 make use of this information, but we can save some copying if
4579 the whole argument is passed in a single register. */
4580 if (GET_CODE (entry_parm) == PARALLEL
4581 && nominal_mode != BLKmode && passed_mode != BLKmode)
4583 int i, len = XVECLEN (entry_parm, 0);
4585 for (i = 0; i < len; i++)
4586 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
4587 && GET_CODE (XEXP (XVECEXP (entry_parm, 0, i), 0)) == REG
4588 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
4590 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
4592 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
4593 DECL_INCOMING_RTL (parm) = entry_parm;
4598 /* ENTRY_PARM is an RTX for the parameter as it arrives,
4599 in the mode in which it arrives.
4600 STACK_PARM is an RTX for a stack slot where the parameter can live
4601 during the function (in case we want to put it there).
4602 STACK_PARM is 0 if no stack slot was pushed for it.
4604 Now output code if necessary to convert ENTRY_PARM to
4605 the type in which this function declares it,
4606 and store that result in an appropriate place,
4607 which may be a pseudo reg, may be STACK_PARM,
4608 or may be a local stack slot if STACK_PARM is 0.
4610 Set DECL_RTL to that place. */
4612 if (nominal_mode == BLKmode || GET_CODE (entry_parm) == PARALLEL)
4614 /* If a BLKmode arrives in registers, copy it to a stack slot.
4615 Handle calls that pass values in multiple non-contiguous
4616 locations. The Irix 6 ABI has examples of this. */
4617 if (GET_CODE (entry_parm) == REG
4618 || GET_CODE (entry_parm) == PARALLEL)
4621 = CEIL_ROUND (int_size_in_bytes (TREE_TYPE (parm)),
4624 /* Note that we will be storing an integral number of words.
4625 So we have to be careful to ensure that we allocate an
4626 integral number of words. We do this below in the
4627 assign_stack_local if space was not allocated in the argument
4628 list. If it was, this will not work if PARM_BOUNDARY is not
4629 a multiple of BITS_PER_WORD. It isn't clear how to fix this
4630 if it becomes a problem. */
4632 if (stack_parm == 0)
4635 = assign_stack_local (GET_MODE (entry_parm),
4637 set_mem_attributes (stack_parm, parm, 1);
4640 else if (PARM_BOUNDARY % BITS_PER_WORD != 0)
4643 /* Handle calls that pass values in multiple non-contiguous
4644 locations. The Irix 6 ABI has examples of this. */
4645 if (GET_CODE (entry_parm) == PARALLEL)
4646 emit_group_store (validize_mem (stack_parm), entry_parm,
4647 int_size_in_bytes (TREE_TYPE (parm)));
4649 move_block_from_reg (REGNO (entry_parm),
4650 validize_mem (stack_parm),
4651 size_stored / UNITS_PER_WORD,
4652 int_size_in_bytes (TREE_TYPE (parm)));
4654 SET_DECL_RTL (parm, stack_parm);
4656 else if (! ((! optimize
4657 && ! DECL_REGISTER (parm))
4658 || TREE_SIDE_EFFECTS (parm)
4659 /* If -ffloat-store specified, don't put explicit
4660 float variables into registers. */
4661 || (flag_float_store
4662 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))
4663 /* Always assign pseudo to structure return or item passed
4664 by invisible reference. */
4665 || passed_pointer || parm == function_result_decl)
4667 /* Store the parm in a pseudoregister during the function, but we
4668 may need to do it in a wider mode. */
4671 unsigned int regno, regnoi = 0, regnor = 0;
4673 unsignedp = TREE_UNSIGNED (TREE_TYPE (parm));
4675 promoted_nominal_mode
4676 = promote_mode (TREE_TYPE (parm), nominal_mode, &unsignedp, 0);
4678 parmreg = gen_reg_rtx (promoted_nominal_mode);
4679 mark_user_reg (parmreg);
4681 /* If this was an item that we received a pointer to, set DECL_RTL
4685 rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type)),
4687 set_mem_attributes (x, parm, 1);
4688 SET_DECL_RTL (parm, x);
4692 SET_DECL_RTL (parm, parmreg);
4693 maybe_set_unchanging (DECL_RTL (parm), parm);
4696 /* Copy the value into the register. */
4697 if (nominal_mode != passed_mode
4698 || promoted_nominal_mode != promoted_mode)
4701 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
4702 mode, by the caller. We now have to convert it to
4703 NOMINAL_MODE, if different. However, PARMREG may be in
4704 a different mode than NOMINAL_MODE if it is being stored
4707 If ENTRY_PARM is a hard register, it might be in a register
4708 not valid for operating in its mode (e.g., an odd-numbered
4709 register for a DFmode). In that case, moves are the only
4710 thing valid, so we can't do a convert from there. This
4711 occurs when the calling sequence allow such misaligned
4714 In addition, the conversion may involve a call, which could
4715 clobber parameters which haven't been copied to pseudo
4716 registers yet. Therefore, we must first copy the parm to
4717 a pseudo reg here, and save the conversion until after all
4718 parameters have been moved. */
4720 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
4722 emit_move_insn (tempreg, validize_mem (entry_parm));
4724 push_to_sequence (conversion_insns);
4725 tempreg = convert_to_mode (nominal_mode, tempreg, unsignedp);
4727 if (GET_CODE (tempreg) == SUBREG
4728 && GET_MODE (tempreg) == nominal_mode
4729 && GET_CODE (SUBREG_REG (tempreg)) == REG
4730 && nominal_mode == passed_mode
4731 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (entry_parm)
4732 && GET_MODE_SIZE (GET_MODE (tempreg))
4733 < GET_MODE_SIZE (GET_MODE (entry_parm)))
4735 /* The argument is already sign/zero extended, so note it
4737 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
4738 SUBREG_PROMOTED_UNSIGNED_P (tempreg) = unsignedp;
4741 /* TREE_USED gets set erroneously during expand_assignment. */
4742 save_tree_used = TREE_USED (parm);
4743 expand_assignment (parm,
4744 make_tree (nominal_type, tempreg), 0, 0);
4745 TREE_USED (parm) = save_tree_used;
4746 conversion_insns = get_insns ();
4751 emit_move_insn (parmreg, validize_mem (entry_parm));
4753 /* If we were passed a pointer but the actual value
4754 can safely live in a register, put it in one. */
4755 if (passed_pointer && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
4757 && ! DECL_REGISTER (parm))
4758 || TREE_SIDE_EFFECTS (parm)
4759 /* If -ffloat-store specified, don't put explicit
4760 float variables into registers. */
4761 || (flag_float_store
4762 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE)))
4764 /* We can't use nominal_mode, because it will have been set to
4765 Pmode above. We must use the actual mode of the parm. */
4766 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
4767 mark_user_reg (parmreg);
4768 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
4770 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
4771 int unsigned_p = TREE_UNSIGNED (TREE_TYPE (parm));
4772 push_to_sequence (conversion_insns);
4773 emit_move_insn (tempreg, DECL_RTL (parm));
4775 convert_to_mode (GET_MODE (parmreg),
4778 emit_move_insn (parmreg, DECL_RTL (parm));
4779 conversion_insns = get_insns();
4784 emit_move_insn (parmreg, DECL_RTL (parm));
4785 SET_DECL_RTL (parm, parmreg);
4786 /* STACK_PARM is the pointer, not the parm, and PARMREG is
4790 #ifdef FUNCTION_ARG_CALLEE_COPIES
4791 /* If we are passed an arg by reference and it is our responsibility
4792 to make a copy, do it now.
4793 PASSED_TYPE and PASSED mode now refer to the pointer, not the
4794 original argument, so we must recreate them in the call to
4795 FUNCTION_ARG_CALLEE_COPIES. */
4796 /* ??? Later add code to handle the case that if the argument isn't
4797 modified, don't do the copy. */
4799 else if (passed_pointer
4800 && FUNCTION_ARG_CALLEE_COPIES (args_so_far,
4801 TYPE_MODE (DECL_ARG_TYPE (parm)),
4802 DECL_ARG_TYPE (parm),
4804 && ! TREE_ADDRESSABLE (DECL_ARG_TYPE (parm)))
4807 tree type = DECL_ARG_TYPE (parm);
4809 /* This sequence may involve a library call perhaps clobbering
4810 registers that haven't been copied to pseudos yet. */
4812 push_to_sequence (conversion_insns);
4814 if (!COMPLETE_TYPE_P (type)
4815 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4816 /* This is a variable sized object. */
4817 copy = gen_rtx_MEM (BLKmode,
4818 allocate_dynamic_stack_space
4819 (expr_size (parm), NULL_RTX,
4820 TYPE_ALIGN (type)));
4822 copy = assign_stack_temp (TYPE_MODE (type),
4823 int_size_in_bytes (type), 1);
4824 set_mem_attributes (copy, parm, 1);
4826 store_expr (parm, copy, 0);
4827 emit_move_insn (parmreg, XEXP (copy, 0));
4828 conversion_insns = get_insns ();
4832 #endif /* FUNCTION_ARG_CALLEE_COPIES */
4834 /* In any case, record the parm's desired stack location
4835 in case we later discover it must live in the stack.
4837 If it is a COMPLEX value, store the stack location for both
4840 if (GET_CODE (parmreg) == CONCAT)
4841 regno = MAX (REGNO (XEXP (parmreg, 0)), REGNO (XEXP (parmreg, 1)));
4843 regno = REGNO (parmreg);
4845 if (regno >= max_parm_reg)
4848 int old_max_parm_reg = max_parm_reg;
4850 /* It's slow to expand this one register at a time,
4851 but it's also rare and we need max_parm_reg to be
4852 precisely correct. */
4853 max_parm_reg = regno + 1;
4854 new = (rtx *) xrealloc (parm_reg_stack_loc,
4855 max_parm_reg * sizeof (rtx));
4856 memset ((char *) (new + old_max_parm_reg), 0,
4857 (max_parm_reg - old_max_parm_reg) * sizeof (rtx));
4858 parm_reg_stack_loc = new;
4861 if (GET_CODE (parmreg) == CONCAT)
4863 enum machine_mode submode = GET_MODE (XEXP (parmreg, 0));
4865 regnor = REGNO (gen_realpart (submode, parmreg));
4866 regnoi = REGNO (gen_imagpart (submode, parmreg));
4868 if (stack_parm != 0)
4870 parm_reg_stack_loc[regnor]
4871 = gen_realpart (submode, stack_parm);
4872 parm_reg_stack_loc[regnoi]
4873 = gen_imagpart (submode, stack_parm);
4877 parm_reg_stack_loc[regnor] = 0;
4878 parm_reg_stack_loc[regnoi] = 0;
4882 parm_reg_stack_loc[REGNO (parmreg)] = stack_parm;
4884 /* Mark the register as eliminable if we did no conversion
4885 and it was copied from memory at a fixed offset,
4886 and the arg pointer was not copied to a pseudo-reg.
4887 If the arg pointer is a pseudo reg or the offset formed
4888 an invalid address, such memory-equivalences
4889 as we make here would screw up life analysis for it. */
4890 if (nominal_mode == passed_mode
4893 && GET_CODE (stack_parm) == MEM
4894 && stack_offset.var == 0
4895 && reg_mentioned_p (virtual_incoming_args_rtx,
4896 XEXP (stack_parm, 0)))
4898 rtx linsn = get_last_insn ();
4901 /* Mark complex types separately. */
4902 if (GET_CODE (parmreg) == CONCAT)
4903 /* Scan backwards for the set of the real and
4905 for (sinsn = linsn; sinsn != 0;
4906 sinsn = prev_nonnote_insn (sinsn))
4908 set = single_set (sinsn);
4910 && SET_DEST (set) == regno_reg_rtx [regnoi])
4912 = gen_rtx_EXPR_LIST (REG_EQUIV,
4913 parm_reg_stack_loc[regnoi],
4916 && SET_DEST (set) == regno_reg_rtx [regnor])
4918 = gen_rtx_EXPR_LIST (REG_EQUIV,
4919 parm_reg_stack_loc[regnor],
4922 else if ((set = single_set (linsn)) != 0
4923 && SET_DEST (set) == parmreg)
4925 = gen_rtx_EXPR_LIST (REG_EQUIV,
4926 stack_parm, REG_NOTES (linsn));
4929 /* For pointer data type, suggest pointer register. */
4930 if (POINTER_TYPE_P (TREE_TYPE (parm)))
4931 mark_reg_pointer (parmreg,
4932 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
4934 /* If something wants our address, try to use ADDRESSOF. */
4935 if (TREE_ADDRESSABLE (parm))
4937 /* If we end up putting something into the stack,
4938 fixup_var_refs_insns will need to make a pass over
4939 all the instructions. It looks through the pending
4940 sequences -- but it can't see the ones in the
4941 CONVERSION_INSNS, if they're not on the sequence
4942 stack. So, we go back to that sequence, just so that
4943 the fixups will happen. */
4944 push_to_sequence (conversion_insns);
4945 put_var_into_stack (parm);
4946 conversion_insns = get_insns ();
4952 /* Value must be stored in the stack slot STACK_PARM
4953 during function execution. */
4955 if (promoted_mode != nominal_mode)
4957 /* Conversion is required. */
4958 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
4960 emit_move_insn (tempreg, validize_mem (entry_parm));
4962 push_to_sequence (conversion_insns);
4963 entry_parm = convert_to_mode (nominal_mode, tempreg,
4964 TREE_UNSIGNED (TREE_TYPE (parm)));
4966 /* ??? This may need a big-endian conversion on sparc64. */
4967 stack_parm = adjust_address (stack_parm, nominal_mode, 0);
4969 conversion_insns = get_insns ();
4974 if (entry_parm != stack_parm)
4976 if (stack_parm == 0)
4979 = assign_stack_local (GET_MODE (entry_parm),
4980 GET_MODE_SIZE (GET_MODE (entry_parm)), 0);
4981 set_mem_attributes (stack_parm, parm, 1);
4984 if (promoted_mode != nominal_mode)
4986 push_to_sequence (conversion_insns);
4987 emit_move_insn (validize_mem (stack_parm),
4988 validize_mem (entry_parm));
4989 conversion_insns = get_insns ();
4993 emit_move_insn (validize_mem (stack_parm),
4994 validize_mem (entry_parm));
4997 SET_DECL_RTL (parm, stack_parm);
5000 /* If this "parameter" was the place where we are receiving the
5001 function's incoming structure pointer, set up the result. */
5002 if (parm == function_result_decl)
5004 tree result = DECL_RESULT (fndecl);
5005 rtx addr = DECL_RTL (parm);
5008 #ifdef POINTERS_EXTEND_UNSIGNED
5009 if (GET_MODE (addr) != Pmode)
5010 addr = convert_memory_address (Pmode, addr);
5013 x = gen_rtx_MEM (DECL_MODE (result), addr);
5014 set_mem_attributes (x, result, 1);
5015 SET_DECL_RTL (result, x);
5018 if (GET_CODE (DECL_RTL (parm)) == REG)
5019 REGNO_DECL (REGNO (DECL_RTL (parm))) = parm;
5020 else if (GET_CODE (DECL_RTL (parm)) == CONCAT)
5022 REGNO_DECL (REGNO (XEXP (DECL_RTL (parm), 0))) = parm;
5023 REGNO_DECL (REGNO (XEXP (DECL_RTL (parm), 1))) = parm;
5028 /* Output all parameter conversion instructions (possibly including calls)
5029 now that all parameters have been copied out of hard registers. */
5030 emit_insns (conversion_insns);
5032 last_parm_insn = get_last_insn ();
5034 current_function_args_size = stack_args_size.constant;
5036 /* Adjust function incoming argument size for alignment and
5039 #ifdef REG_PARM_STACK_SPACE
5040 #ifndef MAYBE_REG_PARM_STACK_SPACE
5041 current_function_args_size = MAX (current_function_args_size,
5042 REG_PARM_STACK_SPACE (fndecl));
5046 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
5048 current_function_args_size
5049 = ((current_function_args_size + STACK_BYTES - 1)
5050 / STACK_BYTES) * STACK_BYTES;
5052 #ifdef ARGS_GROW_DOWNWARD
5053 current_function_arg_offset_rtx
5054 = (stack_args_size.var == 0 ? GEN_INT (-stack_args_size.constant)
5055 : expand_expr (size_diffop (stack_args_size.var,
5056 size_int (-stack_args_size.constant)),
5057 NULL_RTX, VOIDmode, 0));
5059 current_function_arg_offset_rtx = ARGS_SIZE_RTX (stack_args_size);
5062 /* See how many bytes, if any, of its args a function should try to pop
5065 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
5066 current_function_args_size);
5068 /* For stdarg.h function, save info about
5069 regs and stack space used by the named args. */
5072 current_function_args_info = args_so_far;
5074 /* Set the rtx used for the function return value. Put this in its
5075 own variable so any optimizers that need this information don't have
5076 to include tree.h. Do this here so it gets done when an inlined
5077 function gets output. */
5079 current_function_return_rtx
5080 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
5081 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
5084 /* Indicate whether REGNO is an incoming argument to the current function
5085 that was promoted to a wider mode. If so, return the RTX for the
5086 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
5087 that REGNO is promoted from and whether the promotion was signed or
5090 #ifdef PROMOTE_FUNCTION_ARGS
5093 promoted_input_arg (regno, pmode, punsignedp)
5095 enum machine_mode *pmode;
5100 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
5101 arg = TREE_CHAIN (arg))
5102 if (GET_CODE (DECL_INCOMING_RTL (arg)) == REG
5103 && REGNO (DECL_INCOMING_RTL (arg)) == regno
5104 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
5106 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
5107 int unsignedp = TREE_UNSIGNED (TREE_TYPE (arg));
5109 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
5110 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
5111 && mode != DECL_MODE (arg))
5113 *pmode = DECL_MODE (arg);
5114 *punsignedp = unsignedp;
5115 return DECL_INCOMING_RTL (arg);
5124 /* Compute the size and offset from the start of the stacked arguments for a
5125 parm passed in mode PASSED_MODE and with type TYPE.
5127 INITIAL_OFFSET_PTR points to the current offset into the stacked
5130 The starting offset and size for this parm are returned in *OFFSET_PTR
5131 and *ARG_SIZE_PTR, respectively.
5133 IN_REGS is non-zero if the argument will be passed in registers. It will
5134 never be set if REG_PARM_STACK_SPACE is not defined.
5136 FNDECL is the function in which the argument was defined.
5138 There are two types of rounding that are done. The first, controlled by
5139 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
5140 list to be aligned to the specific boundary (in bits). This rounding
5141 affects the initial and starting offsets, but not the argument size.
5143 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
5144 optionally rounds the size of the parm to PARM_BOUNDARY. The
5145 initial offset is not affected by this rounding, while the size always
5146 is and the starting offset may be. */
5148 /* offset_ptr will be negative for ARGS_GROW_DOWNWARD case;
5149 initial_offset_ptr is positive because locate_and_pad_parm's
5150 callers pass in the total size of args so far as
5151 initial_offset_ptr. arg_size_ptr is always positive. */
5154 locate_and_pad_parm (passed_mode, type, in_regs, fndecl,
5155 initial_offset_ptr, offset_ptr, arg_size_ptr,
5157 enum machine_mode passed_mode;
5159 int in_regs ATTRIBUTE_UNUSED;
5160 tree fndecl ATTRIBUTE_UNUSED;
5161 struct args_size *initial_offset_ptr;
5162 struct args_size *offset_ptr;
5163 struct args_size *arg_size_ptr;
5164 struct args_size *alignment_pad;
5168 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
5169 enum direction where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
5170 int boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
5172 #ifdef REG_PARM_STACK_SPACE
5173 /* If we have found a stack parm before we reach the end of the
5174 area reserved for registers, skip that area. */
5177 int reg_parm_stack_space = 0;
5179 #ifdef MAYBE_REG_PARM_STACK_SPACE
5180 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
5182 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
5184 if (reg_parm_stack_space > 0)
5186 if (initial_offset_ptr->var)
5188 initial_offset_ptr->var
5189 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
5190 ssize_int (reg_parm_stack_space));
5191 initial_offset_ptr->constant = 0;
5193 else if (initial_offset_ptr->constant < reg_parm_stack_space)
5194 initial_offset_ptr->constant = reg_parm_stack_space;
5197 #endif /* REG_PARM_STACK_SPACE */
5199 arg_size_ptr->var = 0;
5200 arg_size_ptr->constant = 0;
5201 alignment_pad->var = 0;
5202 alignment_pad->constant = 0;
5204 #ifdef ARGS_GROW_DOWNWARD
5205 if (initial_offset_ptr->var)
5207 offset_ptr->constant = 0;
5208 offset_ptr->var = size_binop (MINUS_EXPR, ssize_int (0),
5209 initial_offset_ptr->var);
5213 offset_ptr->constant = -initial_offset_ptr->constant;
5214 offset_ptr->var = 0;
5216 if (where_pad != none
5217 && (!host_integerp (sizetree, 1)
5218 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5219 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5220 SUB_PARM_SIZE (*offset_ptr, sizetree);
5221 if (where_pad != downward)
5222 pad_to_arg_alignment (offset_ptr, boundary, alignment_pad);
5223 if (initial_offset_ptr->var)
5224 arg_size_ptr->var = size_binop (MINUS_EXPR,
5225 size_binop (MINUS_EXPR,
5227 initial_offset_ptr->var),
5231 arg_size_ptr->constant = (-initial_offset_ptr->constant
5232 - offset_ptr->constant);
5234 #else /* !ARGS_GROW_DOWNWARD */
5236 #ifdef REG_PARM_STACK_SPACE
5237 || REG_PARM_STACK_SPACE (fndecl) > 0
5240 pad_to_arg_alignment (initial_offset_ptr, boundary, alignment_pad);
5241 *offset_ptr = *initial_offset_ptr;
5243 #ifdef PUSH_ROUNDING
5244 if (passed_mode != BLKmode)
5245 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
5248 /* Pad_below needs the pre-rounded size to know how much to pad below
5249 so this must be done before rounding up. */
5250 if (where_pad == downward
5251 /* However, BLKmode args passed in regs have their padding done elsewhere.
5252 The stack slot must be able to hold the entire register. */
5253 && !(in_regs && passed_mode == BLKmode))
5254 pad_below (offset_ptr, passed_mode, sizetree);
5256 if (where_pad != none
5257 && (!host_integerp (sizetree, 1)
5258 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5259 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5261 ADD_PARM_SIZE (*arg_size_ptr, sizetree);
5262 #endif /* ARGS_GROW_DOWNWARD */
5265 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
5266 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
5269 pad_to_arg_alignment (offset_ptr, boundary, alignment_pad)
5270 struct args_size *offset_ptr;
5272 struct args_size *alignment_pad;
5274 tree save_var = NULL_TREE;
5275 HOST_WIDE_INT save_constant = 0;
5277 int boundary_in_bytes = boundary / BITS_PER_UNIT;
5279 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5281 save_var = offset_ptr->var;
5282 save_constant = offset_ptr->constant;
5285 alignment_pad->var = NULL_TREE;
5286 alignment_pad->constant = 0;
5288 if (boundary > BITS_PER_UNIT)
5290 if (offset_ptr->var)
5293 #ifdef ARGS_GROW_DOWNWARD
5298 (ARGS_SIZE_TREE (*offset_ptr),
5299 boundary / BITS_PER_UNIT);
5300 offset_ptr->constant = 0; /*?*/
5301 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5302 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
5307 offset_ptr->constant =
5308 #ifdef ARGS_GROW_DOWNWARD
5309 FLOOR_ROUND (offset_ptr->constant, boundary_in_bytes);
5311 CEIL_ROUND (offset_ptr->constant, boundary_in_bytes);
5313 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5314 alignment_pad->constant = offset_ptr->constant - save_constant;
5319 #ifndef ARGS_GROW_DOWNWARD
5321 pad_below (offset_ptr, passed_mode, sizetree)
5322 struct args_size *offset_ptr;
5323 enum machine_mode passed_mode;
5326 if (passed_mode != BLKmode)
5328 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
5329 offset_ptr->constant
5330 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
5331 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
5332 - GET_MODE_SIZE (passed_mode));
5336 if (TREE_CODE (sizetree) != INTEGER_CST
5337 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
5339 /* Round the size up to multiple of PARM_BOUNDARY bits. */
5340 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5342 ADD_PARM_SIZE (*offset_ptr, s2);
5343 SUB_PARM_SIZE (*offset_ptr, sizetree);
5349 /* Walk the tree of blocks describing the binding levels within a function
5350 and warn about uninitialized variables.
5351 This is done after calling flow_analysis and before global_alloc
5352 clobbers the pseudo-regs to hard regs. */
5355 uninitialized_vars_warning (block)
5359 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5361 if (warn_uninitialized
5362 && TREE_CODE (decl) == VAR_DECL
5363 /* These warnings are unreliable for and aggregates
5364 because assigning the fields one by one can fail to convince
5365 flow.c that the entire aggregate was initialized.
5366 Unions are troublesome because members may be shorter. */
5367 && ! AGGREGATE_TYPE_P (TREE_TYPE (decl))
5368 && DECL_RTL (decl) != 0
5369 && GET_CODE (DECL_RTL (decl)) == REG
5370 /* Global optimizations can make it difficult to determine if a
5371 particular variable has been initialized. However, a VAR_DECL
5372 with a nonzero DECL_INITIAL had an initializer, so do not
5373 claim it is potentially uninitialized.
5375 We do not care about the actual value in DECL_INITIAL, so we do
5376 not worry that it may be a dangling pointer. */
5377 && DECL_INITIAL (decl) == NULL_TREE
5378 && regno_uninitialized (REGNO (DECL_RTL (decl))))
5379 warning_with_decl (decl,
5380 "`%s' might be used uninitialized in this function");
5382 && TREE_CODE (decl) == VAR_DECL
5383 && DECL_RTL (decl) != 0
5384 && GET_CODE (DECL_RTL (decl)) == REG
5385 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5386 warning_with_decl (decl,
5387 "variable `%s' might be clobbered by `longjmp' or `vfork'");
5389 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5390 uninitialized_vars_warning (sub);
5393 /* Do the appropriate part of uninitialized_vars_warning
5394 but for arguments instead of local variables. */
5397 setjmp_args_warning ()
5400 for (decl = DECL_ARGUMENTS (current_function_decl);
5401 decl; decl = TREE_CHAIN (decl))
5402 if (DECL_RTL (decl) != 0
5403 && GET_CODE (DECL_RTL (decl)) == REG
5404 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5405 warning_with_decl (decl,
5406 "argument `%s' might be clobbered by `longjmp' or `vfork'");
5409 /* If this function call setjmp, put all vars into the stack
5410 unless they were declared `register'. */
5413 setjmp_protect (block)
5417 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5418 if ((TREE_CODE (decl) == VAR_DECL
5419 || TREE_CODE (decl) == PARM_DECL)
5420 && DECL_RTL (decl) != 0
5421 && (GET_CODE (DECL_RTL (decl)) == REG
5422 || (GET_CODE (DECL_RTL (decl)) == MEM
5423 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5424 /* If this variable came from an inline function, it must be
5425 that its life doesn't overlap the setjmp. If there was a
5426 setjmp in the function, it would already be in memory. We
5427 must exclude such variable because their DECL_RTL might be
5428 set to strange things such as virtual_stack_vars_rtx. */
5429 && ! DECL_FROM_INLINE (decl)
5431 #ifdef NON_SAVING_SETJMP
5432 /* If longjmp doesn't restore the registers,
5433 don't put anything in them. */
5437 ! DECL_REGISTER (decl)))
5438 put_var_into_stack (decl);
5439 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5440 setjmp_protect (sub);
5443 /* Like the previous function, but for args instead of local variables. */
5446 setjmp_protect_args ()
5449 for (decl = DECL_ARGUMENTS (current_function_decl);
5450 decl; decl = TREE_CHAIN (decl))
5451 if ((TREE_CODE (decl) == VAR_DECL
5452 || TREE_CODE (decl) == PARM_DECL)
5453 && DECL_RTL (decl) != 0
5454 && (GET_CODE (DECL_RTL (decl)) == REG
5455 || (GET_CODE (DECL_RTL (decl)) == MEM
5456 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5458 /* If longjmp doesn't restore the registers,
5459 don't put anything in them. */
5460 #ifdef NON_SAVING_SETJMP
5464 ! DECL_REGISTER (decl)))
5465 put_var_into_stack (decl);
5468 /* Return the context-pointer register corresponding to DECL,
5469 or 0 if it does not need one. */
5472 lookup_static_chain (decl)
5475 tree context = decl_function_context (decl);
5479 || (TREE_CODE (decl) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (decl)))
5482 /* We treat inline_function_decl as an alias for the current function
5483 because that is the inline function whose vars, types, etc.
5484 are being merged into the current function.
5485 See expand_inline_function. */
5486 if (context == current_function_decl || context == inline_function_decl)
5487 return virtual_stack_vars_rtx;
5489 for (link = context_display; link; link = TREE_CHAIN (link))
5490 if (TREE_PURPOSE (link) == context)
5491 return RTL_EXPR_RTL (TREE_VALUE (link));
5496 /* Convert a stack slot address ADDR for variable VAR
5497 (from a containing function)
5498 into an address valid in this function (using a static chain). */
5501 fix_lexical_addr (addr, var)
5506 HOST_WIDE_INT displacement;
5507 tree context = decl_function_context (var);
5508 struct function *fp;
5511 /* If this is the present function, we need not do anything. */
5512 if (context == current_function_decl || context == inline_function_decl)
5515 fp = find_function_data (context);
5517 if (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == MEM)
5518 addr = XEXP (XEXP (addr, 0), 0);
5520 /* Decode given address as base reg plus displacement. */
5521 if (GET_CODE (addr) == REG)
5522 basereg = addr, displacement = 0;
5523 else if (GET_CODE (addr) == PLUS && GET_CODE (XEXP (addr, 1)) == CONST_INT)
5524 basereg = XEXP (addr, 0), displacement = INTVAL (XEXP (addr, 1));
5528 /* We accept vars reached via the containing function's
5529 incoming arg pointer and via its stack variables pointer. */
5530 if (basereg == fp->internal_arg_pointer)
5532 /* If reached via arg pointer, get the arg pointer value
5533 out of that function's stack frame.
5535 There are two cases: If a separate ap is needed, allocate a
5536 slot in the outer function for it and dereference it that way.
5537 This is correct even if the real ap is actually a pseudo.
5538 Otherwise, just adjust the offset from the frame pointer to
5541 #ifdef NEED_SEPARATE_AP
5544 addr = get_arg_pointer_save_area (fp);
5545 addr = fix_lexical_addr (XEXP (addr, 0), var);
5546 addr = memory_address (Pmode, addr);
5548 base = gen_rtx_MEM (Pmode, addr);
5549 set_mem_alias_set (base, get_frame_alias_set ());
5550 base = copy_to_reg (base);
5552 displacement += (FIRST_PARM_OFFSET (context) - STARTING_FRAME_OFFSET);
5553 base = lookup_static_chain (var);
5557 else if (basereg == virtual_stack_vars_rtx)
5559 /* This is the same code as lookup_static_chain, duplicated here to
5560 avoid an extra call to decl_function_context. */
5563 for (link = context_display; link; link = TREE_CHAIN (link))
5564 if (TREE_PURPOSE (link) == context)
5566 base = RTL_EXPR_RTL (TREE_VALUE (link));
5574 /* Use same offset, relative to appropriate static chain or argument
5576 return plus_constant (base, displacement);
5579 /* Return the address of the trampoline for entering nested fn FUNCTION.
5580 If necessary, allocate a trampoline (in the stack frame)
5581 and emit rtl to initialize its contents (at entry to this function). */
5584 trampoline_address (function)
5590 struct function *fp;
5593 /* Find an existing trampoline and return it. */
5594 for (link = trampoline_list; link; link = TREE_CHAIN (link))
5595 if (TREE_PURPOSE (link) == function)
5597 adjust_trampoline_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0));
5599 for (fp = outer_function_chain; fp; fp = fp->outer)
5600 for (link = fp->x_trampoline_list; link; link = TREE_CHAIN (link))
5601 if (TREE_PURPOSE (link) == function)
5603 tramp = fix_lexical_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0),
5605 return adjust_trampoline_addr (tramp);
5608 /* None exists; we must make one. */
5610 /* Find the `struct function' for the function containing FUNCTION. */
5612 fn_context = decl_function_context (function);
5613 if (fn_context != current_function_decl
5614 && fn_context != inline_function_decl)
5615 fp = find_function_data (fn_context);
5617 /* Allocate run-time space for this trampoline
5618 (usually in the defining function's stack frame). */
5619 #ifdef ALLOCATE_TRAMPOLINE
5620 tramp = ALLOCATE_TRAMPOLINE (fp);
5622 /* If rounding needed, allocate extra space
5623 to ensure we have TRAMPOLINE_SIZE bytes left after rounding up. */
5624 #ifdef TRAMPOLINE_ALIGNMENT
5625 #define TRAMPOLINE_REAL_SIZE \
5626 (TRAMPOLINE_SIZE + (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT) - 1)
5628 #define TRAMPOLINE_REAL_SIZE (TRAMPOLINE_SIZE)
5630 tramp = assign_stack_local_1 (BLKmode, TRAMPOLINE_REAL_SIZE, 0,
5634 /* Record the trampoline for reuse and note it for later initialization
5635 by expand_function_end. */
5638 rtlexp = make_node (RTL_EXPR);
5639 RTL_EXPR_RTL (rtlexp) = tramp;
5640 fp->x_trampoline_list = tree_cons (function, rtlexp,
5641 fp->x_trampoline_list);
5645 /* Make the RTL_EXPR node temporary, not momentary, so that the
5646 trampoline_list doesn't become garbage. */
5647 rtlexp = make_node (RTL_EXPR);
5649 RTL_EXPR_RTL (rtlexp) = tramp;
5650 trampoline_list = tree_cons (function, rtlexp, trampoline_list);
5653 tramp = fix_lexical_addr (XEXP (tramp, 0), function);
5654 return adjust_trampoline_addr (tramp);
5657 /* Given a trampoline address,
5658 round it to multiple of TRAMPOLINE_ALIGNMENT. */
5661 round_trampoline_addr (tramp)
5664 #ifdef TRAMPOLINE_ALIGNMENT
5665 /* Round address up to desired boundary. */
5666 rtx temp = gen_reg_rtx (Pmode);
5667 rtx addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
5668 rtx mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
5670 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
5671 temp, 0, OPTAB_LIB_WIDEN);
5672 tramp = expand_simple_binop (Pmode, AND, temp, mask,
5673 temp, 0, OPTAB_LIB_WIDEN);
5678 /* Given a trampoline address, round it then apply any
5679 platform-specific adjustments so that the result can be used for a
5683 adjust_trampoline_addr (tramp)
5686 tramp = round_trampoline_addr (tramp);
5687 #ifdef TRAMPOLINE_ADJUST_ADDRESS
5688 TRAMPOLINE_ADJUST_ADDRESS (tramp);
5693 /* Put all this function's BLOCK nodes including those that are chained
5694 onto the first block into a vector, and return it.
5695 Also store in each NOTE for the beginning or end of a block
5696 the index of that block in the vector.
5697 The arguments are BLOCK, the chain of top-level blocks of the function,
5698 and INSNS, the insn chain of the function. */
5704 tree *block_vector, *last_block_vector;
5706 tree block = DECL_INITIAL (current_function_decl);
5711 /* Fill the BLOCK_VECTOR with all of the BLOCKs in this function, in
5712 depth-first order. */
5713 block_vector = get_block_vector (block, &n_blocks);
5714 block_stack = (tree *) xmalloc (n_blocks * sizeof (tree));
5716 last_block_vector = identify_blocks_1 (get_insns (),
5718 block_vector + n_blocks,
5721 /* If we didn't use all of the subblocks, we've misplaced block notes. */
5722 /* ??? This appears to happen all the time. Latent bugs elsewhere? */
5723 if (0 && last_block_vector != block_vector + n_blocks)
5726 free (block_vector);
5730 /* Subroutine of identify_blocks. Do the block substitution on the
5731 insn chain beginning with INSNS. Recurse for CALL_PLACEHOLDER chains.
5733 BLOCK_STACK is pushed and popped for each BLOCK_BEGIN/BLOCK_END pair.
5734 BLOCK_VECTOR is incremented for each block seen. */
5737 identify_blocks_1 (insns, block_vector, end_block_vector, orig_block_stack)
5740 tree *end_block_vector;
5741 tree *orig_block_stack;
5744 tree *block_stack = orig_block_stack;
5746 for (insn = insns; insn; insn = NEXT_INSN (insn))
5748 if (GET_CODE (insn) == NOTE)
5750 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
5754 /* If there are more block notes than BLOCKs, something
5756 if (block_vector == end_block_vector)
5759 b = *block_vector++;
5760 NOTE_BLOCK (insn) = b;
5763 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
5765 /* If there are more NOTE_INSN_BLOCK_ENDs than
5766 NOTE_INSN_BLOCK_BEGs, something is badly wrong. */
5767 if (block_stack == orig_block_stack)
5770 NOTE_BLOCK (insn) = *--block_stack;
5773 else if (GET_CODE (insn) == CALL_INSN
5774 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
5776 rtx cp = PATTERN (insn);
5778 block_vector = identify_blocks_1 (XEXP (cp, 0), block_vector,
5779 end_block_vector, block_stack);
5781 block_vector = identify_blocks_1 (XEXP (cp, 1), block_vector,
5782 end_block_vector, block_stack);
5784 block_vector = identify_blocks_1 (XEXP (cp, 2), block_vector,
5785 end_block_vector, block_stack);
5789 /* If there are more NOTE_INSN_BLOCK_BEGINs than NOTE_INSN_BLOCK_ENDs,
5790 something is badly wrong. */
5791 if (block_stack != orig_block_stack)
5794 return block_vector;
5797 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
5798 and create duplicate blocks. */
5799 /* ??? Need an option to either create block fragments or to create
5800 abstract origin duplicates of a source block. It really depends
5801 on what optimization has been performed. */
5806 tree block = DECL_INITIAL (current_function_decl);
5807 varray_type block_stack;
5809 if (block == NULL_TREE)
5812 VARRAY_TREE_INIT (block_stack, 10, "block_stack");
5814 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
5815 reorder_blocks_0 (block);
5817 /* Prune the old trees away, so that they don't get in the way. */
5818 BLOCK_SUBBLOCKS (block) = NULL_TREE;
5819 BLOCK_CHAIN (block) = NULL_TREE;
5821 /* Recreate the block tree from the note nesting. */
5822 reorder_blocks_1 (get_insns (), block, &block_stack);
5823 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
5825 /* Remove deleted blocks from the block fragment chains. */
5826 reorder_fix_fragments (block);
5828 VARRAY_FREE (block_stack);
5831 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
5834 reorder_blocks_0 (block)
5839 TREE_ASM_WRITTEN (block) = 0;
5840 reorder_blocks_0 (BLOCK_SUBBLOCKS (block));
5841 block = BLOCK_CHAIN (block);
5846 reorder_blocks_1 (insns, current_block, p_block_stack)
5849 varray_type *p_block_stack;
5853 for (insn = insns; insn; insn = NEXT_INSN (insn))
5855 if (GET_CODE (insn) == NOTE)
5857 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
5859 tree block = NOTE_BLOCK (insn);
5861 /* If we have seen this block before, that means it now
5862 spans multiple address regions. Create a new fragment. */
5863 if (TREE_ASM_WRITTEN (block))
5865 tree new_block = copy_node (block);
5868 origin = (BLOCK_FRAGMENT_ORIGIN (block)
5869 ? BLOCK_FRAGMENT_ORIGIN (block)
5871 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
5872 BLOCK_FRAGMENT_CHAIN (new_block)
5873 = BLOCK_FRAGMENT_CHAIN (origin);
5874 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
5876 NOTE_BLOCK (insn) = new_block;
5880 BLOCK_SUBBLOCKS (block) = 0;
5881 TREE_ASM_WRITTEN (block) = 1;
5882 BLOCK_SUPERCONTEXT (block) = current_block;
5883 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
5884 BLOCK_SUBBLOCKS (current_block) = block;
5885 current_block = block;
5886 VARRAY_PUSH_TREE (*p_block_stack, block);
5888 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
5890 NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack);
5891 VARRAY_POP (*p_block_stack);
5892 BLOCK_SUBBLOCKS (current_block)
5893 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
5894 current_block = BLOCK_SUPERCONTEXT (current_block);
5897 else if (GET_CODE (insn) == CALL_INSN
5898 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
5900 rtx cp = PATTERN (insn);
5901 reorder_blocks_1 (XEXP (cp, 0), current_block, p_block_stack);
5903 reorder_blocks_1 (XEXP (cp, 1), current_block, p_block_stack);
5905 reorder_blocks_1 (XEXP (cp, 2), current_block, p_block_stack);
5910 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
5911 appears in the block tree, select one of the fragments to become
5912 the new origin block. */
5915 reorder_fix_fragments (block)
5920 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
5921 tree new_origin = NULL_TREE;
5925 if (! TREE_ASM_WRITTEN (dup_origin))
5927 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
5929 /* Find the first of the remaining fragments. There must
5930 be at least one -- the current block. */
5931 while (! TREE_ASM_WRITTEN (new_origin))
5932 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
5933 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
5936 else if (! dup_origin)
5939 /* Re-root the rest of the fragments to the new origin. In the
5940 case that DUP_ORIGIN was null, that means BLOCK was the origin
5941 of a chain of fragments and we want to remove those fragments
5942 that didn't make it to the output. */
5945 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
5950 if (TREE_ASM_WRITTEN (chain))
5952 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
5954 pp = &BLOCK_FRAGMENT_CHAIN (chain);
5956 chain = BLOCK_FRAGMENT_CHAIN (chain);
5961 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
5962 block = BLOCK_CHAIN (block);
5966 /* Reverse the order of elements in the chain T of blocks,
5967 and return the new head of the chain (old last element). */
5973 tree prev = 0, decl, next;
5974 for (decl = t; decl; decl = next)
5976 next = BLOCK_CHAIN (decl);
5977 BLOCK_CHAIN (decl) = prev;
5983 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
5984 non-NULL, list them all into VECTOR, in a depth-first preorder
5985 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
5989 all_blocks (block, vector)
5997 TREE_ASM_WRITTEN (block) = 0;
5999 /* Record this block. */
6001 vector[n_blocks] = block;
6005 /* Record the subblocks, and their subblocks... */
6006 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
6007 vector ? vector + n_blocks : 0);
6008 block = BLOCK_CHAIN (block);
6014 /* Return a vector containing all the blocks rooted at BLOCK. The
6015 number of elements in the vector is stored in N_BLOCKS_P. The
6016 vector is dynamically allocated; it is the caller's responsibility
6017 to call `free' on the pointer returned. */
6020 get_block_vector (block, n_blocks_p)
6026 *n_blocks_p = all_blocks (block, NULL);
6027 block_vector = (tree *) xmalloc (*n_blocks_p * sizeof (tree));
6028 all_blocks (block, block_vector);
6030 return block_vector;
6033 static int next_block_index = 2;
6035 /* Set BLOCK_NUMBER for all the blocks in FN. */
6045 /* For SDB and XCOFF debugging output, we start numbering the blocks
6046 from 1 within each function, rather than keeping a running
6048 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
6049 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
6050 next_block_index = 1;
6053 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
6055 /* The top-level BLOCK isn't numbered at all. */
6056 for (i = 1; i < n_blocks; ++i)
6057 /* We number the blocks from two. */
6058 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
6060 free (block_vector);
6065 /* If VAR is present in a subblock of BLOCK, return the subblock. */
6068 debug_find_var_in_block_tree (var, block)
6074 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
6078 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
6080 tree ret = debug_find_var_in_block_tree (var, t);
6088 /* Allocate a function structure and reset its contents to the defaults. */
6091 prepare_function_start ()
6093 cfun = (struct function *) ggc_alloc_cleared (sizeof (struct function));
6095 init_stmt_for_function ();
6096 init_eh_for_function ();
6098 cse_not_expected = ! optimize;
6100 /* Caller save not needed yet. */
6101 caller_save_needed = 0;
6103 /* No stack slots have been made yet. */
6104 stack_slot_list = 0;
6106 current_function_has_nonlocal_label = 0;
6107 current_function_has_nonlocal_goto = 0;
6109 /* There is no stack slot for handling nonlocal gotos. */
6110 nonlocal_goto_handler_slots = 0;
6111 nonlocal_goto_stack_level = 0;
6113 /* No labels have been declared for nonlocal use. */
6114 nonlocal_labels = 0;
6115 nonlocal_goto_handler_labels = 0;
6117 /* No function calls so far in this function. */
6118 function_call_count = 0;
6120 /* No parm regs have been allocated.
6121 (This is important for output_inline_function.) */
6122 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
6124 /* Initialize the RTL mechanism. */
6127 /* Initialize the queue of pending postincrement and postdecrements,
6128 and some other info in expr.c. */
6131 /* We haven't done register allocation yet. */
6134 init_varasm_status (cfun);
6136 /* Clear out data used for inlining. */
6137 cfun->inlinable = 0;
6138 cfun->original_decl_initial = 0;
6139 cfun->original_arg_vector = 0;
6141 cfun->stack_alignment_needed = STACK_BOUNDARY;
6142 cfun->preferred_stack_boundary = STACK_BOUNDARY;
6144 /* Set if a call to setjmp is seen. */
6145 current_function_calls_setjmp = 0;
6147 /* Set if a call to longjmp is seen. */
6148 current_function_calls_longjmp = 0;
6150 current_function_calls_alloca = 0;
6151 current_function_contains_functions = 0;
6152 current_function_is_leaf = 0;
6153 current_function_nothrow = 0;
6154 current_function_sp_is_unchanging = 0;
6155 current_function_uses_only_leaf_regs = 0;
6156 current_function_has_computed_jump = 0;
6157 current_function_is_thunk = 0;
6159 current_function_returns_pcc_struct = 0;
6160 current_function_returns_struct = 0;
6161 current_function_epilogue_delay_list = 0;
6162 current_function_uses_const_pool = 0;
6163 current_function_uses_pic_offset_table = 0;
6164 current_function_cannot_inline = 0;
6166 /* We have not yet needed to make a label to jump to for tail-recursion. */
6167 tail_recursion_label = 0;
6169 /* We haven't had a need to make a save area for ap yet. */
6170 arg_pointer_save_area = 0;
6172 /* No stack slots allocated yet. */
6175 /* No SAVE_EXPRs in this function yet. */
6178 /* No RTL_EXPRs in this function yet. */
6181 /* Set up to allocate temporaries. */
6184 /* Indicate that we need to distinguish between the return value of the
6185 present function and the return value of a function being called. */
6186 rtx_equal_function_value_matters = 1;
6188 /* Indicate that we have not instantiated virtual registers yet. */
6189 virtuals_instantiated = 0;
6191 /* Indicate that we want CONCATs now. */
6192 generating_concat_p = 1;
6194 /* Indicate we have no need of a frame pointer yet. */
6195 frame_pointer_needed = 0;
6197 /* By default assume not varargs or stdarg. */
6198 current_function_varargs = 0;
6199 current_function_stdarg = 0;
6201 /* We haven't made any trampolines for this function yet. */
6202 trampoline_list = 0;
6204 init_pending_stack_adjust ();
6205 inhibit_defer_pop = 0;
6207 current_function_outgoing_args_size = 0;
6209 if (init_lang_status)
6210 (*init_lang_status) (cfun);
6211 if (init_machine_status)
6212 (*init_machine_status) (cfun);
6215 /* Initialize the rtl expansion mechanism so that we can do simple things
6216 like generate sequences. This is used to provide a context during global
6217 initialization of some passes. */
6219 init_dummy_function_start ()
6221 prepare_function_start ();
6224 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
6225 and initialize static variables for generating RTL for the statements
6229 init_function_start (subr, filename, line)
6231 const char *filename;
6234 prepare_function_start ();
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
6307 #ifndef GEN_CALL__MAIN
6308 #define GEN_CALL__MAIN \
6310 emit_library_call (gen_rtx_SYMBOL_REF (Pmode, NAME__MAIN), LCT_NORMAL, \
6316 expand_main_function ()
6318 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
6319 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
6321 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
6325 /* Forcibly align the stack. */
6326 #ifdef STACK_GROWS_DOWNWARD
6327 tmp = expand_simple_binop (Pmode, AND, stack_pointer_rtx, GEN_INT(-align),
6328 stack_pointer_rtx, 1, OPTAB_WIDEN);
6330 tmp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
6331 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
6332 tmp = expand_simple_binop (Pmode, AND, tmp, GEN_INT (-align),
6333 stack_pointer_rtx, 1, OPTAB_WIDEN);
6335 if (tmp != stack_pointer_rtx)
6336 emit_move_insn (stack_pointer_rtx, tmp);
6338 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
6339 tmp = force_reg (Pmode, const0_rtx);
6340 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
6341 seq = gen_sequence ();
6344 for (tmp = get_last_insn (); tmp; tmp = PREV_INSN (tmp))
6345 if (NOTE_P (tmp) && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_FUNCTION_BEG)
6348 emit_insn_before (seq, tmp);
6354 #if defined(INVOKE__main) || !defined (HAS_INIT_SECTION)
6359 extern struct obstack permanent_obstack;
6361 /* The PENDING_SIZES represent the sizes of variable-sized types.
6362 Create RTL for the various sizes now (using temporary variables),
6363 so that we can refer to the sizes from the RTL we are generating
6364 for the current function. The PENDING_SIZES are a TREE_LIST. The
6365 TREE_VALUE of each node is a SAVE_EXPR. */
6368 expand_pending_sizes (pending_sizes)
6373 /* Evaluate now the sizes of any types declared among the arguments. */
6374 for (tem = pending_sizes; tem; tem = TREE_CHAIN (tem))
6376 expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode, 0);
6377 /* Flush the queue in case this parameter declaration has
6383 /* Start the RTL for a new function, and set variables used for
6385 SUBR is the FUNCTION_DECL node.
6386 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
6387 the function's parameters, which must be run at any return statement. */
6390 expand_function_start (subr, parms_have_cleanups)
6392 int parms_have_cleanups;
6395 rtx last_ptr = NULL_RTX;
6397 /* Make sure volatile mem refs aren't considered
6398 valid operands of arithmetic insns. */
6399 init_recog_no_volatile ();
6401 current_function_instrument_entry_exit
6402 = (flag_instrument_function_entry_exit
6403 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
6405 current_function_profile
6407 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
6409 current_function_limit_stack
6410 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
6412 /* If function gets a static chain arg, store it in the stack frame.
6413 Do this first, so it gets the first stack slot offset. */
6414 if (current_function_needs_context)
6416 last_ptr = assign_stack_local (Pmode, GET_MODE_SIZE (Pmode), 0);
6418 /* Delay copying static chain if it is not a register to avoid
6419 conflicts with regs used for parameters. */
6420 if (! SMALL_REGISTER_CLASSES
6421 || GET_CODE (static_chain_incoming_rtx) == REG)
6422 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6425 /* If the parameters of this function need cleaning up, get a label
6426 for the beginning of the code which executes those cleanups. This must
6427 be done before doing anything with return_label. */
6428 if (parms_have_cleanups)
6429 cleanup_label = gen_label_rtx ();
6433 /* Make the label for return statements to jump to. Do not special
6434 case machines with special return instructions -- they will be
6435 handled later during jump, ifcvt, or epilogue creation. */
6436 return_label = gen_label_rtx ();
6438 /* Initialize rtx used to return the value. */
6439 /* Do this before assign_parms so that we copy the struct value address
6440 before any library calls that assign parms might generate. */
6442 /* Decide whether to return the value in memory or in a register. */
6443 if (aggregate_value_p (DECL_RESULT (subr)))
6445 /* Returning something that won't go in a register. */
6446 rtx value_address = 0;
6448 #ifdef PCC_STATIC_STRUCT_RETURN
6449 if (current_function_returns_pcc_struct)
6451 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
6452 value_address = assemble_static_space (size);
6457 /* Expect to be passed the address of a place to store the value.
6458 If it is passed as an argument, assign_parms will take care of
6460 if (struct_value_incoming_rtx)
6462 value_address = gen_reg_rtx (Pmode);
6463 emit_move_insn (value_address, struct_value_incoming_rtx);
6468 rtx x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), value_address);
6469 set_mem_attributes (x, DECL_RESULT (subr), 1);
6470 SET_DECL_RTL (DECL_RESULT (subr), x);
6473 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
6474 /* If return mode is void, this decl rtl should not be used. */
6475 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
6478 /* Compute the return values into a pseudo reg, which we will copy
6479 into the true return register after the cleanups are done. */
6481 /* In order to figure out what mode to use for the pseudo, we
6482 figure out what the mode of the eventual return register will
6483 actually be, and use that. */
6485 = hard_function_value (TREE_TYPE (DECL_RESULT (subr)),
6488 /* Structures that are returned in registers are not aggregate_value_p,
6489 so we may see a PARALLEL. Don't play pseudo games with this. */
6490 if (! REG_P (hard_reg))
6491 SET_DECL_RTL (DECL_RESULT (subr), hard_reg);
6494 /* Create the pseudo. */
6495 SET_DECL_RTL (DECL_RESULT (subr), gen_reg_rtx (GET_MODE (hard_reg)));
6497 /* Needed because we may need to move this to memory
6498 in case it's a named return value whose address is taken. */
6499 DECL_REGISTER (DECL_RESULT (subr)) = 1;
6503 /* Initialize rtx for parameters and local variables.
6504 In some cases this requires emitting insns. */
6506 assign_parms (subr);
6508 /* Copy the static chain now if it wasn't a register. The delay is to
6509 avoid conflicts with the parameter passing registers. */
6511 if (SMALL_REGISTER_CLASSES && current_function_needs_context)
6512 if (GET_CODE (static_chain_incoming_rtx) != REG)
6513 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6515 /* The following was moved from init_function_start.
6516 The move is supposed to make sdb output more accurate. */
6517 /* Indicate the beginning of the function body,
6518 as opposed to parm setup. */
6519 emit_note (NULL, NOTE_INSN_FUNCTION_BEG);
6521 if (GET_CODE (get_last_insn ()) != NOTE)
6522 emit_note (NULL, NOTE_INSN_DELETED);
6523 parm_birth_insn = get_last_insn ();
6525 context_display = 0;
6526 if (current_function_needs_context)
6528 /* Fetch static chain values for containing functions. */
6529 tem = decl_function_context (current_function_decl);
6530 /* Copy the static chain pointer into a pseudo. If we have
6531 small register classes, copy the value from memory if
6532 static_chain_incoming_rtx is a REG. */
6535 /* If the static chain originally came in a register, put it back
6536 there, then move it out in the next insn. The reason for
6537 this peculiar code is to satisfy function integration. */
6538 if (SMALL_REGISTER_CLASSES
6539 && GET_CODE (static_chain_incoming_rtx) == REG)
6540 emit_move_insn (static_chain_incoming_rtx, last_ptr);
6541 last_ptr = copy_to_reg (static_chain_incoming_rtx);
6546 tree rtlexp = make_node (RTL_EXPR);
6548 RTL_EXPR_RTL (rtlexp) = last_ptr;
6549 context_display = tree_cons (tem, rtlexp, context_display);
6550 tem = decl_function_context (tem);
6553 /* Chain thru stack frames, assuming pointer to next lexical frame
6554 is found at the place we always store it. */
6555 #ifdef FRAME_GROWS_DOWNWARD
6556 last_ptr = plus_constant (last_ptr,
6557 -(HOST_WIDE_INT) GET_MODE_SIZE (Pmode));
6559 last_ptr = gen_rtx_MEM (Pmode, memory_address (Pmode, last_ptr));
6560 set_mem_alias_set (last_ptr, get_frame_alias_set ());
6561 last_ptr = copy_to_reg (last_ptr);
6563 /* If we are not optimizing, ensure that we know that this
6564 piece of context is live over the entire function. */
6566 save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, last_ptr,
6571 if (current_function_instrument_entry_exit)
6573 rtx fun = DECL_RTL (current_function_decl);
6574 if (GET_CODE (fun) == MEM)
6575 fun = XEXP (fun, 0);
6578 emit_library_call (profile_function_entry_libfunc, LCT_NORMAL, VOIDmode,
6580 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
6582 hard_frame_pointer_rtx),
6587 if (current_function_profile)
6588 PROFILE_HOOK (profile_label_no);
6591 /* After the display initializations is where the tail-recursion label
6592 should go, if we end up needing one. Ensure we have a NOTE here
6593 since some things (like trampolines) get placed before this. */
6594 tail_recursion_reentry = emit_note (NULL, NOTE_INSN_DELETED);
6596 /* Evaluate now the sizes of any types declared among the arguments. */
6597 expand_pending_sizes (nreverse (get_pending_sizes ()));
6599 /* Make sure there is a line number after the function entry setup code. */
6600 force_next_line_note ();
6603 /* Undo the effects of init_dummy_function_start. */
6605 expand_dummy_function_end ()
6607 /* End any sequences that failed to be closed due to syntax errors. */
6608 while (in_sequence_p ())
6611 /* Outside function body, can't compute type's actual size
6612 until next function's body starts. */
6614 free_after_parsing (cfun);
6615 free_after_compilation (cfun);
6619 /* Call DOIT for each hard register used as a return value from
6620 the current function. */
6623 diddle_return_value (doit, arg)
6624 void (*doit) PARAMS ((rtx, void *));
6627 rtx outgoing = current_function_return_rtx;
6632 if (GET_CODE (outgoing) == REG)
6633 (*doit) (outgoing, arg);
6634 else if (GET_CODE (outgoing) == PARALLEL)
6638 for (i = 0; i < XVECLEN (outgoing, 0); i++)
6640 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
6642 if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
6649 do_clobber_return_reg (reg, arg)
6651 void *arg ATTRIBUTE_UNUSED;
6653 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
6657 clobber_return_register ()
6659 diddle_return_value (do_clobber_return_reg, NULL);
6661 /* In case we do use pseudo to return value, clobber it too. */
6662 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6664 tree decl_result = DECL_RESULT (current_function_decl);
6665 rtx decl_rtl = DECL_RTL (decl_result);
6666 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
6668 do_clobber_return_reg (decl_rtl, NULL);
6674 do_use_return_reg (reg, arg)
6676 void *arg ATTRIBUTE_UNUSED;
6678 emit_insn (gen_rtx_USE (VOIDmode, reg));
6682 use_return_register ()
6684 diddle_return_value (do_use_return_reg, NULL);
6687 /* Generate RTL for the end of the current function.
6688 FILENAME and LINE are the current position in the source file.
6690 It is up to language-specific callers to do cleanups for parameters--
6691 or else, supply 1 for END_BINDINGS and we will call expand_end_bindings. */
6694 expand_function_end (filename, line, end_bindings)
6695 const char *filename;
6702 #ifdef TRAMPOLINE_TEMPLATE
6703 static rtx initial_trampoline;
6706 finish_expr_for_function ();
6708 /* If arg_pointer_save_area was referenced only from a nested
6709 function, we will not have initialized it yet. Do that now. */
6710 if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
6711 get_arg_pointer_save_area (cfun);
6713 #ifdef NON_SAVING_SETJMP
6714 /* Don't put any variables in registers if we call setjmp
6715 on a machine that fails to restore the registers. */
6716 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
6718 if (DECL_INITIAL (current_function_decl) != error_mark_node)
6719 setjmp_protect (DECL_INITIAL (current_function_decl));
6721 setjmp_protect_args ();
6725 /* Initialize any trampolines required by this function. */
6726 for (link = trampoline_list; link; link = TREE_CHAIN (link))
6728 tree function = TREE_PURPOSE (link);
6729 rtx context ATTRIBUTE_UNUSED = lookup_static_chain (function);
6730 rtx tramp = RTL_EXPR_RTL (TREE_VALUE (link));
6731 #ifdef TRAMPOLINE_TEMPLATE
6736 #ifdef TRAMPOLINE_TEMPLATE
6737 /* First make sure this compilation has a template for
6738 initializing trampolines. */
6739 if (initial_trampoline == 0)
6742 = gen_rtx_MEM (BLKmode, assemble_trampoline_template ());
6743 set_mem_align (initial_trampoline, TRAMPOLINE_ALIGNMENT);
6745 ggc_add_rtx_root (&initial_trampoline, 1);
6749 /* Generate insns to initialize the trampoline. */
6751 tramp = round_trampoline_addr (XEXP (tramp, 0));
6752 #ifdef TRAMPOLINE_TEMPLATE
6753 blktramp = replace_equiv_address (initial_trampoline, tramp);
6754 emit_block_move (blktramp, initial_trampoline,
6755 GEN_INT (TRAMPOLINE_SIZE));
6757 INITIALIZE_TRAMPOLINE (tramp, XEXP (DECL_RTL (function), 0), context);
6761 /* Put those insns at entry to the containing function (this one). */
6762 emit_insns_before (seq, tail_recursion_reentry);
6765 /* If we are doing stack checking and this function makes calls,
6766 do a stack probe at the start of the function to ensure we have enough
6767 space for another stack frame. */
6768 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
6772 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
6773 if (GET_CODE (insn) == CALL_INSN)
6776 probe_stack_range (STACK_CHECK_PROTECT,
6777 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
6780 emit_insns_before (seq, tail_recursion_reentry);
6785 /* Warn about unused parms if extra warnings were specified. */
6786 /* Either ``-W -Wunused'' or ``-Wunused-parameter'' enables this
6787 warning. WARN_UNUSED_PARAMETER is negative when set by
6789 if (warn_unused_parameter > 0
6790 || (warn_unused_parameter < 0 && extra_warnings))
6794 for (decl = DECL_ARGUMENTS (current_function_decl);
6795 decl; decl = TREE_CHAIN (decl))
6796 if (! TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
6797 && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl))
6798 warning_with_decl (decl, "unused parameter `%s'");
6801 /* Delete handlers for nonlocal gotos if nothing uses them. */
6802 if (nonlocal_goto_handler_slots != 0
6803 && ! current_function_has_nonlocal_label)
6806 /* End any sequences that failed to be closed due to syntax errors. */
6807 while (in_sequence_p ())
6810 /* Outside function body, can't compute type's actual size
6811 until next function's body starts. */
6812 immediate_size_expand--;
6814 clear_pending_stack_adjust ();
6815 do_pending_stack_adjust ();
6817 /* Mark the end of the function body.
6818 If control reaches this insn, the function can drop through
6819 without returning a value. */
6820 emit_note (NULL, NOTE_INSN_FUNCTION_END);
6822 /* Must mark the last line number note in the function, so that the test
6823 coverage code can avoid counting the last line twice. This just tells
6824 the code to ignore the immediately following line note, since there
6825 already exists a copy of this note somewhere above. This line number
6826 note is still needed for debugging though, so we can't delete it. */
6827 if (flag_test_coverage)
6828 emit_note (NULL, NOTE_INSN_REPEATED_LINE_NUMBER);
6830 /* Output a linenumber for the end of the function.
6831 SDB depends on this. */
6832 emit_line_note_force (filename, line);
6834 /* Before the return label (if any), clobber the return
6835 registers so that they are not propagated live to the rest of
6836 the function. This can only happen with functions that drop
6837 through; if there had been a return statement, there would
6838 have either been a return rtx, or a jump to the return label.
6840 We delay actual code generation after the current_function_value_rtx
6842 clobber_after = get_last_insn ();
6844 /* Output the label for the actual return from the function,
6845 if one is expected. This happens either because a function epilogue
6846 is used instead of a return instruction, or because a return was done
6847 with a goto in order to run local cleanups, or because of pcc-style
6848 structure returning. */
6850 emit_label (return_label);
6852 /* C++ uses this. */
6854 expand_end_bindings (0, 0, 0);
6856 if (current_function_instrument_entry_exit)
6858 rtx fun = DECL_RTL (current_function_decl);
6859 if (GET_CODE (fun) == MEM)
6860 fun = XEXP (fun, 0);
6863 emit_library_call (profile_function_exit_libfunc, LCT_NORMAL, VOIDmode,
6865 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
6867 hard_frame_pointer_rtx),
6871 /* Let except.c know where it should emit the call to unregister
6872 the function context for sjlj exceptions. */
6873 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
6874 sjlj_emit_function_exit_after (get_last_insn ());
6876 /* If we had calls to alloca, and this machine needs
6877 an accurate stack pointer to exit the function,
6878 insert some code to save and restore the stack pointer. */
6879 #ifdef EXIT_IGNORE_STACK
6880 if (! EXIT_IGNORE_STACK)
6882 if (current_function_calls_alloca)
6886 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
6887 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
6890 /* If scalar return value was computed in a pseudo-reg, or was a named
6891 return value that got dumped to the stack, copy that to the hard
6893 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6895 tree decl_result = DECL_RESULT (current_function_decl);
6896 rtx decl_rtl = DECL_RTL (decl_result);
6898 if (REG_P (decl_rtl)
6899 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
6900 : DECL_REGISTER (decl_result))
6904 #ifdef FUNCTION_OUTGOING_VALUE
6905 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
6906 current_function_decl);
6908 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
6909 current_function_decl);
6911 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
6913 /* If this is a BLKmode structure being returned in registers,
6914 then use the mode computed in expand_return. Note that if
6915 decl_rtl is memory, then its mode may have been changed,
6916 but that current_function_return_rtx has not. */
6917 if (GET_MODE (real_decl_rtl) == BLKmode)
6918 PUT_MODE (real_decl_rtl, GET_MODE (current_function_return_rtx));
6920 /* If a named return value dumped decl_return to memory, then
6921 we may need to re-do the PROMOTE_MODE signed/unsigned
6923 if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
6925 int unsignedp = TREE_UNSIGNED (TREE_TYPE (decl_result));
6927 #ifdef PROMOTE_FUNCTION_RETURN
6928 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
6932 convert_move (real_decl_rtl, decl_rtl, unsignedp);
6934 else if (GET_CODE (real_decl_rtl) == PARALLEL)
6935 emit_group_load (real_decl_rtl, decl_rtl,
6936 int_size_in_bytes (TREE_TYPE (decl_result)));
6938 emit_move_insn (real_decl_rtl, decl_rtl);
6940 /* The delay slot scheduler assumes that current_function_return_rtx
6941 holds the hard register containing the return value, not a
6942 temporary pseudo. */
6943 current_function_return_rtx = real_decl_rtl;
6947 /* If returning a structure, arrange to return the address of the value
6948 in a place where debuggers expect to find it.
6950 If returning a structure PCC style,
6951 the caller also depends on this value.
6952 And current_function_returns_pcc_struct is not necessarily set. */
6953 if (current_function_returns_struct
6954 || current_function_returns_pcc_struct)
6957 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
6958 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
6959 #ifdef FUNCTION_OUTGOING_VALUE
6961 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
6962 current_function_decl);
6965 = FUNCTION_VALUE (build_pointer_type (type), current_function_decl);
6968 /* Mark this as a function return value so integrate will delete the
6969 assignment and USE below when inlining this function. */
6970 REG_FUNCTION_VALUE_P (outgoing) = 1;
6972 #ifdef POINTERS_EXTEND_UNSIGNED
6973 /* The address may be ptr_mode and OUTGOING may be Pmode. */
6974 if (GET_MODE (outgoing) != GET_MODE (value_address))
6975 value_address = convert_memory_address (GET_MODE (outgoing),
6979 emit_move_insn (outgoing, value_address);
6981 /* Show return register used to hold result (in this case the address
6983 current_function_return_rtx = outgoing;
6986 /* If this is an implementation of throw, do what's necessary to
6987 communicate between __builtin_eh_return and the epilogue. */
6988 expand_eh_return ();
6990 /* Emit the actual code to clobber return register. */
6995 clobber_return_register ();
6996 seq = gen_sequence ();
6999 after = emit_insn_after (seq, clobber_after);
7001 if (clobber_after != after)
7002 cfun->x_clobber_return_insn = after;
7005 /* ??? This should no longer be necessary since stupid is no longer with
7006 us, but there are some parts of the compiler (eg reload_combine, and
7007 sh mach_dep_reorg) that still try and compute their own lifetime info
7008 instead of using the general framework. */
7009 use_return_register ();
7011 /* Fix up any gotos that jumped out to the outermost
7012 binding level of the function.
7013 Must follow emitting RETURN_LABEL. */
7015 /* If you have any cleanups to do at this point,
7016 and they need to create temporary variables,
7017 then you will lose. */
7018 expand_fixups (get_insns ());
7022 get_arg_pointer_save_area (f)
7025 rtx ret = f->x_arg_pointer_save_area;
7029 ret = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, f);
7030 f->x_arg_pointer_save_area = ret;
7033 if (f == cfun && ! f->arg_pointer_save_area_init)
7037 /* Save the arg pointer at the beginning of the function. The
7038 generated stack slot may not be a valid memory address, so we
7039 have to check it and fix it if necessary. */
7041 emit_move_insn (validize_mem (ret), virtual_incoming_args_rtx);
7042 seq = gen_sequence ();
7045 push_topmost_sequence ();
7046 emit_insn_after (seq, get_insns ());
7047 pop_topmost_sequence ();
7053 /* Extend a vector that records the INSN_UIDs of INSNS (either a
7054 sequence or a single insn). */
7057 record_insns (insns, vecp)
7061 if (GET_CODE (insns) == SEQUENCE)
7063 int len = XVECLEN (insns, 0);
7064 int i = VARRAY_SIZE (*vecp);
7066 VARRAY_GROW (*vecp, i + len);
7069 VARRAY_INT (*vecp, i) = INSN_UID (XVECEXP (insns, 0, len));
7075 int i = VARRAY_SIZE (*vecp);
7076 VARRAY_GROW (*vecp, i + 1);
7077 VARRAY_INT (*vecp, i) = INSN_UID (insns);
7081 /* Determine how many INSN_UIDs in VEC are part of INSN. */
7084 contains (insn, vec)
7090 if (GET_CODE (insn) == INSN
7091 && GET_CODE (PATTERN (insn)) == SEQUENCE)
7094 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
7095 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7096 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j))
7102 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7103 if (INSN_UID (insn) == VARRAY_INT (vec, j))
7110 prologue_epilogue_contains (insn)
7113 if (contains (insn, prologue))
7115 if (contains (insn, epilogue))
7121 sibcall_epilogue_contains (insn)
7124 if (sibcall_epilogue)
7125 return contains (insn, sibcall_epilogue);
7130 /* Insert gen_return at the end of block BB. This also means updating
7131 block_for_insn appropriately. */
7134 emit_return_into_block (bb, line_note)
7140 p = NEXT_INSN (bb->end);
7141 end = emit_jump_insn_after (gen_return (), bb->end);
7143 emit_line_note_after (NOTE_SOURCE_FILE (line_note),
7144 NOTE_LINE_NUMBER (line_note), PREV_INSN (bb->end));
7146 #endif /* HAVE_return */
7148 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
7150 /* These functions convert the epilogue into a variant that does not modify the
7151 stack pointer. This is used in cases where a function returns an object
7152 whose size is not known until it is computed. The called function leaves the
7153 object on the stack, leaves the stack depressed, and returns a pointer to
7156 What we need to do is track all modifications and references to the stack
7157 pointer, deleting the modifications and changing the references to point to
7158 the location the stack pointer would have pointed to had the modifications
7161 These functions need to be portable so we need to make as few assumptions
7162 about the epilogue as we can. However, the epilogue basically contains
7163 three things: instructions to reset the stack pointer, instructions to
7164 reload registers, possibly including the frame pointer, and an
7165 instruction to return to the caller.
7167 If we can't be sure of what a relevant epilogue insn is doing, we abort.
7168 We also make no attempt to validate the insns we make since if they are
7169 invalid, we probably can't do anything valid. The intent is that these
7170 routines get "smarter" as more and more machines start to use them and
7171 they try operating on different epilogues.
7173 We use the following structure to track what the part of the epilogue that
7174 we've already processed has done. We keep two copies of the SP equivalence,
7175 one for use during the insn we are processing and one for use in the next
7176 insn. The difference is because one part of a PARALLEL may adjust SP
7177 and the other may use it. */
7181 rtx sp_equiv_reg; /* REG that SP is set from, perhaps SP. */
7182 HOST_WIDE_INT sp_offset; /* Offset from SP_EQUIV_REG of present SP. */
7183 rtx new_sp_equiv_reg; /* REG to be used at end of insn. */
7184 HOST_WIDE_INT new_sp_offset; /* Offset to be used at end of insn. */
7185 rtx equiv_reg_src; /* If nonzero, the value that SP_EQUIV_REG
7186 should be set to once we no longer need
7190 static void handle_epilogue_set PARAMS ((rtx, struct epi_info *));
7191 static void emit_equiv_load PARAMS ((struct epi_info *));
7193 /* Modify SEQ, a SEQUENCE that is part of the epilogue, to no modifications
7194 to the stack pointer. Return the new sequence. */
7197 keep_stack_depressed (seq)
7201 struct epi_info info;
7203 /* If the epilogue is just a single instruction, it ust be OK as is. */
7205 if (GET_CODE (seq) != SEQUENCE)
7208 /* Otherwise, start a sequence, initialize the information we have, and
7209 process all the insns we were given. */
7212 info.sp_equiv_reg = stack_pointer_rtx;
7214 info.equiv_reg_src = 0;
7216 for (i = 0; i < XVECLEN (seq, 0); i++)
7218 rtx insn = XVECEXP (seq, 0, i);
7226 /* If this insn references the register that SP is equivalent to and
7227 we have a pending load to that register, we must force out the load
7228 first and then indicate we no longer know what SP's equivalent is. */
7229 if (info.equiv_reg_src != 0
7230 && reg_referenced_p (info.sp_equiv_reg, PATTERN (insn)))
7232 emit_equiv_load (&info);
7233 info.sp_equiv_reg = 0;
7236 info.new_sp_equiv_reg = info.sp_equiv_reg;
7237 info.new_sp_offset = info.sp_offset;
7239 /* If this is a (RETURN) and the return address is on the stack,
7240 update the address and change to an indirect jump. */
7241 if (GET_CODE (PATTERN (insn)) == RETURN
7242 || (GET_CODE (PATTERN (insn)) == PARALLEL
7243 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
7245 rtx retaddr = INCOMING_RETURN_ADDR_RTX;
7247 HOST_WIDE_INT offset = 0;
7248 rtx jump_insn, jump_set;
7250 /* If the return address is in a register, we can emit the insn
7251 unchanged. Otherwise, it must be a MEM and we see what the
7252 base register and offset are. In any case, we have to emit any
7253 pending load to the equivalent reg of SP, if any. */
7254 if (GET_CODE (retaddr) == REG)
7256 emit_equiv_load (&info);
7260 else if (GET_CODE (retaddr) == MEM
7261 && GET_CODE (XEXP (retaddr, 0)) == REG)
7262 base = gen_rtx_REG (Pmode, REGNO (XEXP (retaddr, 0))), offset = 0;
7263 else if (GET_CODE (retaddr) == MEM
7264 && GET_CODE (XEXP (retaddr, 0)) == PLUS
7265 && GET_CODE (XEXP (XEXP (retaddr, 0), 0)) == REG
7266 && GET_CODE (XEXP (XEXP (retaddr, 0), 1)) == CONST_INT)
7268 base = gen_rtx_REG (Pmode, REGNO (XEXP (XEXP (retaddr, 0), 0)));
7269 offset = INTVAL (XEXP (XEXP (retaddr, 0), 1));
7274 /* If the base of the location containing the return pointer
7275 is SP, we must update it with the replacement address. Otherwise,
7276 just build the necessary MEM. */
7277 retaddr = plus_constant (base, offset);
7278 if (base == stack_pointer_rtx)
7279 retaddr = simplify_replace_rtx (retaddr, stack_pointer_rtx,
7280 plus_constant (info.sp_equiv_reg,
7283 retaddr = gen_rtx_MEM (Pmode, retaddr);
7285 /* If there is a pending load to the equivalent register for SP
7286 and we reference that register, we must load our address into
7287 a scratch register and then do that load. */
7288 if (info.equiv_reg_src
7289 && reg_overlap_mentioned_p (info.equiv_reg_src, retaddr))
7294 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
7295 if (HARD_REGNO_MODE_OK (regno, Pmode)
7296 && !fixed_regs[regno]
7297 && TEST_HARD_REG_BIT (regs_invalidated_by_call, regno)
7298 && !REGNO_REG_SET_P (EXIT_BLOCK_PTR->global_live_at_start,
7300 && !refers_to_regno_p (regno,
7301 regno + HARD_REGNO_NREGS (regno,
7303 info.equiv_reg_src, NULL))
7306 if (regno == FIRST_PSEUDO_REGISTER)
7309 reg = gen_rtx_REG (Pmode, regno);
7310 emit_move_insn (reg, retaddr);
7314 emit_equiv_load (&info);
7315 jump_insn = emit_jump_insn (gen_indirect_jump (retaddr));
7317 /* Show the SET in the above insn is a RETURN. */
7318 jump_set = single_set (jump_insn);
7322 SET_IS_RETURN_P (jump_set) = 1;
7325 /* If SP is not mentioned in the pattern and its equivalent register, if
7326 any, is not modified, just emit it. Otherwise, if neither is set,
7327 replace the reference to SP and emit the insn. If none of those are
7328 true, handle each SET individually. */
7329 else if (!reg_mentioned_p (stack_pointer_rtx, PATTERN (insn))
7330 && (info.sp_equiv_reg == stack_pointer_rtx
7331 || !reg_set_p (info.sp_equiv_reg, insn)))
7333 else if (! reg_set_p (stack_pointer_rtx, insn)
7334 && (info.sp_equiv_reg == stack_pointer_rtx
7335 || !reg_set_p (info.sp_equiv_reg, insn)))
7337 if (! validate_replace_rtx (stack_pointer_rtx,
7338 plus_constant (info.sp_equiv_reg,
7345 else if (GET_CODE (PATTERN (insn)) == SET)
7346 handle_epilogue_set (PATTERN (insn), &info);
7347 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
7349 for (j = 0; j < XVECLEN (PATTERN (insn), 0); j++)
7350 if (GET_CODE (XVECEXP (PATTERN (insn), 0, j)) == SET)
7351 handle_epilogue_set (XVECEXP (PATTERN (insn), 0, j), &info);
7356 info.sp_equiv_reg = info.new_sp_equiv_reg;
7357 info.sp_offset = info.new_sp_offset;
7360 seq = gen_sequence ();
7365 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
7366 structure that contains information about what we've seen so far. We
7367 process this SET by either updating that data or by emitting one or
7371 handle_epilogue_set (set, p)
7375 /* First handle the case where we are setting SP. Record what it is being
7376 set from. If unknown, abort. */
7377 if (reg_set_p (stack_pointer_rtx, set))
7379 if (SET_DEST (set) != stack_pointer_rtx)
7382 if (GET_CODE (SET_SRC (set)) == PLUS
7383 && GET_CODE (XEXP (SET_SRC (set), 1)) == CONST_INT)
7385 p->new_sp_equiv_reg = XEXP (SET_SRC (set), 0);
7386 p->new_sp_offset = INTVAL (XEXP (SET_SRC (set), 1));
7389 p->new_sp_equiv_reg = SET_SRC (set), p->new_sp_offset = 0;
7391 /* If we are adjusting SP, we adjust from the old data. */
7392 if (p->new_sp_equiv_reg == stack_pointer_rtx)
7394 p->new_sp_equiv_reg = p->sp_equiv_reg;
7395 p->new_sp_offset += p->sp_offset;
7398 if (p->new_sp_equiv_reg == 0 || GET_CODE (p->new_sp_equiv_reg) != REG)
7404 /* Next handle the case where we are setting SP's equivalent register.
7405 If we already have a value to set it to, abort. We could update, but
7406 there seems little point in handling that case. Note that we have
7407 to allow for the case where we are setting the register set in
7408 the previous part of a PARALLEL inside a single insn. But use the
7409 old offset for any updates within this insn. */
7410 else if (p->new_sp_equiv_reg != 0 && reg_set_p (p->new_sp_equiv_reg, set))
7412 if (!rtx_equal_p (p->new_sp_equiv_reg, SET_DEST (set))
7413 || p->equiv_reg_src != 0)
7417 = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
7418 plus_constant (p->sp_equiv_reg,
7422 /* Otherwise, replace any references to SP in the insn to its new value
7423 and emit the insn. */
7426 SET_SRC (set) = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
7427 plus_constant (p->sp_equiv_reg,
7429 SET_DEST (set) = simplify_replace_rtx (SET_DEST (set), stack_pointer_rtx,
7430 plus_constant (p->sp_equiv_reg,
7436 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
7442 if (p->equiv_reg_src != 0)
7443 emit_move_insn (p->sp_equiv_reg, p->equiv_reg_src);
7445 p->equiv_reg_src = 0;
7449 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
7450 this into place with notes indicating where the prologue ends and where
7451 the epilogue begins. Update the basic block information when possible. */
7454 thread_prologue_and_epilogue_insns (f)
7455 rtx f ATTRIBUTE_UNUSED;
7459 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
7462 #ifdef HAVE_prologue
7463 rtx prologue_end = NULL_RTX;
7465 #if defined (HAVE_epilogue) || defined(HAVE_return)
7466 rtx epilogue_end = NULL_RTX;
7469 #ifdef HAVE_prologue
7473 seq = gen_prologue ();
7476 /* Retain a map of the prologue insns. */
7477 if (GET_CODE (seq) != SEQUENCE)
7479 record_insns (seq, &prologue);
7480 prologue_end = emit_note (NULL, NOTE_INSN_PROLOGUE_END);
7482 seq = gen_sequence ();
7485 /* Can't deal with multiple successors of the entry block
7486 at the moment. Function should always have at least one
7488 if (!ENTRY_BLOCK_PTR->succ || ENTRY_BLOCK_PTR->succ->succ_next)
7491 insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ);
7496 /* If the exit block has no non-fake predecessors, we don't need
7498 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7499 if ((e->flags & EDGE_FAKE) == 0)
7505 if (optimize && HAVE_return)
7507 /* If we're allowed to generate a simple return instruction,
7508 then by definition we don't need a full epilogue. Examine
7509 the block that falls through to EXIT. If it does not
7510 contain any code, examine its predecessors and try to
7511 emit (conditional) return instructions. */
7517 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7518 if (e->flags & EDGE_FALLTHRU)
7524 /* Verify that there are no active instructions in the last block. */
7526 while (label && GET_CODE (label) != CODE_LABEL)
7528 if (active_insn_p (label))
7530 label = PREV_INSN (label);
7533 if (last->head == label && GET_CODE (label) == CODE_LABEL)
7535 rtx epilogue_line_note = NULL_RTX;
7537 /* Locate the line number associated with the closing brace,
7538 if we can find one. */
7539 for (seq = get_last_insn ();
7540 seq && ! active_insn_p (seq);
7541 seq = PREV_INSN (seq))
7542 if (GET_CODE (seq) == NOTE && NOTE_LINE_NUMBER (seq) > 0)
7544 epilogue_line_note = seq;
7548 for (e = last->pred; e; e = e_next)
7550 basic_block bb = e->src;
7553 e_next = e->pred_next;
7554 if (bb == ENTRY_BLOCK_PTR)
7558 if ((GET_CODE (jump) != JUMP_INSN) || JUMP_LABEL (jump) != label)
7561 /* If we have an unconditional jump, we can replace that
7562 with a simple return instruction. */
7563 if (simplejump_p (jump))
7565 emit_return_into_block (bb, epilogue_line_note);
7569 /* If we have a conditional jump, we can try to replace
7570 that with a conditional return instruction. */
7571 else if (condjump_p (jump))
7575 ret = SET_SRC (PATTERN (jump));
7576 if (GET_CODE (XEXP (ret, 1)) == LABEL_REF)
7577 loc = &XEXP (ret, 1);
7579 loc = &XEXP (ret, 2);
7580 ret = gen_rtx_RETURN (VOIDmode);
7582 if (! validate_change (jump, loc, ret, 0))
7584 if (JUMP_LABEL (jump))
7585 LABEL_NUSES (JUMP_LABEL (jump))--;
7587 /* If this block has only one successor, it both jumps
7588 and falls through to the fallthru block, so we can't
7590 if (bb->succ->succ_next == NULL)
7596 /* Fix up the CFG for the successful change we just made. */
7597 redirect_edge_succ (e, EXIT_BLOCK_PTR);
7600 /* Emit a return insn for the exit fallthru block. Whether
7601 this is still reachable will be determined later. */
7603 emit_barrier_after (last->end);
7604 emit_return_into_block (last, epilogue_line_note);
7605 epilogue_end = last->end;
7606 last->succ->flags &= ~EDGE_FALLTHRU;
7611 #ifdef HAVE_epilogue
7614 /* Find the edge that falls through to EXIT. Other edges may exist
7615 due to RETURN instructions, but those don't need epilogues.
7616 There really shouldn't be a mixture -- either all should have
7617 been converted or none, however... */
7619 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7620 if (e->flags & EDGE_FALLTHRU)
7626 epilogue_end = emit_note (NULL, NOTE_INSN_EPILOGUE_BEG);
7628 seq = gen_epilogue ();
7630 #ifdef INCOMING_RETURN_ADDR_RTX
7631 /* If this function returns with the stack depressed and we can support
7632 it, massage the epilogue to actually do that. */
7633 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
7634 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
7635 seq = keep_stack_depressed (seq);
7638 emit_jump_insn (seq);
7640 /* Retain a map of the epilogue insns. */
7641 if (GET_CODE (seq) != SEQUENCE)
7643 record_insns (seq, &epilogue);
7645 seq = gen_sequence ();
7648 insert_insn_on_edge (seq, e);
7655 commit_edge_insertions ();
7657 #ifdef HAVE_sibcall_epilogue
7658 /* Emit sibling epilogues before any sibling call sites. */
7659 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7661 basic_block bb = e->src;
7666 if (GET_CODE (insn) != CALL_INSN
7667 || ! SIBLING_CALL_P (insn))
7671 seq = gen_sibcall_epilogue ();
7674 i = PREV_INSN (insn);
7675 newinsn = emit_insn_before (seq, insn);
7677 /* Retain a map of the epilogue insns. Used in life analysis to
7678 avoid getting rid of sibcall epilogue insns. */
7679 record_insns (GET_CODE (seq) == SEQUENCE
7680 ? seq : newinsn, &sibcall_epilogue);
7684 #ifdef HAVE_prologue
7689 /* GDB handles `break f' by setting a breakpoint on the first
7690 line note after the prologue. Which means (1) that if
7691 there are line number notes before where we inserted the
7692 prologue we should move them, and (2) we should generate a
7693 note before the end of the first basic block, if there isn't
7696 ??? This behaviour is completely broken when dealing with
7697 multiple entry functions. We simply place the note always
7698 into first basic block and let alternate entry points
7702 for (insn = prologue_end; insn; insn = prev)
7704 prev = PREV_INSN (insn);
7705 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7707 /* Note that we cannot reorder the first insn in the
7708 chain, since rest_of_compilation relies on that
7709 remaining constant. */
7712 reorder_insns (insn, insn, prologue_end);
7716 /* Find the last line number note in the first block. */
7717 for (insn = BASIC_BLOCK (0)->end;
7718 insn != prologue_end && insn;
7719 insn = PREV_INSN (insn))
7720 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7723 /* If we didn't find one, make a copy of the first line number
7727 for (insn = next_active_insn (prologue_end);
7729 insn = PREV_INSN (insn))
7730 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7732 emit_line_note_after (NOTE_SOURCE_FILE (insn),
7733 NOTE_LINE_NUMBER (insn),
7740 #ifdef HAVE_epilogue
7745 /* Similarly, move any line notes that appear after the epilogue.
7746 There is no need, however, to be quite so anal about the existence
7748 for (insn = epilogue_end; insn; insn = next)
7750 next = NEXT_INSN (insn);
7751 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7752 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
7758 /* Reposition the prologue-end and epilogue-begin notes after instruction
7759 scheduling and delayed branch scheduling. */
7762 reposition_prologue_and_epilogue_notes (f)
7763 rtx f ATTRIBUTE_UNUSED;
7765 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
7768 if ((len = VARRAY_SIZE (prologue)) > 0)
7772 /* Scan from the beginning until we reach the last prologue insn.
7773 We apparently can't depend on basic_block_{head,end} after
7775 for (insn = f; len && insn; insn = NEXT_INSN (insn))
7777 if (GET_CODE (insn) == NOTE)
7779 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
7782 else if ((len -= contains (insn, prologue)) == 0)
7785 /* Find the prologue-end note if we haven't already, and
7786 move it to just after the last prologue insn. */
7789 for (note = insn; (note = NEXT_INSN (note));)
7790 if (GET_CODE (note) == NOTE
7791 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
7795 next = NEXT_INSN (note);
7797 /* Whether or not we can depend on BLOCK_HEAD,
7798 attempt to keep it up-to-date. */
7799 if (BLOCK_HEAD (0) == note)
7800 BLOCK_HEAD (0) = next;
7803 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
7804 if (GET_CODE (insn) == CODE_LABEL)
7805 insn = NEXT_INSN (insn);
7806 add_insn_after (note, insn);
7811 if ((len = VARRAY_SIZE (epilogue)) > 0)
7815 /* Scan from the end until we reach the first epilogue insn.
7816 We apparently can't depend on basic_block_{head,end} after
7818 for (insn = get_last_insn (); len && insn; insn = PREV_INSN (insn))
7820 if (GET_CODE (insn) == NOTE)
7822 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
7825 else if ((len -= contains (insn, epilogue)) == 0)
7827 /* Find the epilogue-begin note if we haven't already, and
7828 move it to just before the first epilogue insn. */
7831 for (note = insn; (note = PREV_INSN (note));)
7832 if (GET_CODE (note) == NOTE
7833 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
7837 /* Whether or not we can depend on BLOCK_HEAD,
7838 attempt to keep it up-to-date. */
7840 && BLOCK_HEAD (n_basic_blocks-1) == insn)
7841 BLOCK_HEAD (n_basic_blocks-1) = note;
7844 add_insn_before (note, insn);
7848 #endif /* HAVE_prologue or HAVE_epilogue */
7851 /* Mark P for GC. */
7854 mark_function_status (p)
7857 struct var_refs_queue *q;
7858 struct temp_slot *t;
7865 ggc_mark_rtx (p->arg_offset_rtx);
7867 if (p->x_parm_reg_stack_loc)
7868 for (i = p->x_max_parm_reg, r = p->x_parm_reg_stack_loc;
7872 ggc_mark_rtx (p->return_rtx);
7873 ggc_mark_rtx (p->x_cleanup_label);
7874 ggc_mark_rtx (p->x_return_label);
7875 ggc_mark_rtx (p->x_save_expr_regs);
7876 ggc_mark_rtx (p->x_stack_slot_list);
7877 ggc_mark_rtx (p->x_parm_birth_insn);
7878 ggc_mark_rtx (p->x_tail_recursion_label);
7879 ggc_mark_rtx (p->x_tail_recursion_reentry);
7880 ggc_mark_rtx (p->internal_arg_pointer);
7881 ggc_mark_rtx (p->x_arg_pointer_save_area);
7882 ggc_mark_tree (p->x_rtl_expr_chain);
7883 ggc_mark_rtx (p->x_last_parm_insn);
7884 ggc_mark_tree (p->x_context_display);
7885 ggc_mark_tree (p->x_trampoline_list);
7886 ggc_mark_rtx (p->epilogue_delay_list);
7887 ggc_mark_rtx (p->x_clobber_return_insn);
7889 for (t = p->x_temp_slots; t != 0; t = t->next)
7892 ggc_mark_rtx (t->slot);
7893 ggc_mark_rtx (t->address);
7894 ggc_mark_tree (t->rtl_expr);
7895 ggc_mark_tree (t->type);
7898 for (q = p->fixup_var_refs_queue; q != 0; q = q->next)
7901 ggc_mark_rtx (q->modified);
7904 ggc_mark_rtx (p->x_nonlocal_goto_handler_slots);
7905 ggc_mark_rtx (p->x_nonlocal_goto_handler_labels);
7906 ggc_mark_rtx (p->x_nonlocal_goto_stack_level);
7907 ggc_mark_tree (p->x_nonlocal_labels);
7909 mark_hard_reg_initial_vals (p);
7912 /* Mark the struct function pointed to by *ARG for GC, if it is not
7913 NULL. This is used to mark the current function and the outer
7917 maybe_mark_struct_function (arg)
7920 struct function *f = *(struct function **) arg;
7925 ggc_mark_struct_function (f);
7928 /* Mark a struct function * for GC. This is called from ggc-common.c. */
7931 ggc_mark_struct_function (f)
7935 ggc_mark_tree (f->decl);
7937 mark_function_status (f);
7938 mark_eh_status (f->eh);
7939 mark_stmt_status (f->stmt);
7940 mark_expr_status (f->expr);
7941 mark_emit_status (f->emit);
7942 mark_varasm_status (f->varasm);
7944 if (mark_machine_status)
7945 (*mark_machine_status) (f);
7946 if (mark_lang_status)
7947 (*mark_lang_status) (f);
7949 if (f->original_arg_vector)
7950 ggc_mark_rtvec ((rtvec) f->original_arg_vector);
7951 if (f->original_decl_initial)
7952 ggc_mark_tree (f->original_decl_initial);
7954 ggc_mark_struct_function (f->outer);
7957 /* Called once, at initialization, to initialize function.c. */
7960 init_function_once ()
7962 ggc_add_root (&cfun, 1, sizeof cfun, maybe_mark_struct_function);
7963 ggc_add_root (&outer_function_chain, 1, sizeof outer_function_chain,
7964 maybe_mark_struct_function);
7966 VARRAY_INT_INIT (prologue, 0, "prologue");
7967 VARRAY_INT_INIT (epilogue, 0, "epilogue");
7968 VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue");