1 /* Expands front end tree to back end RTL for GNU C-Compiler
2 Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of 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
22 /* This file handles the generation of rtl code from tree structure
23 at the level of the function as a whole.
24 It creates the rtl expressions for parameters and auto variables
25 and has full responsibility for allocating stack slots.
27 `expand_function_start' is called at the beginning of a function,
28 before the function body is parsed, and `expand_function_end' is
29 called after parsing the body.
31 Call `assign_stack_local' to allocate a stack slot for a local variable.
32 This is usually done during the RTL generation for the function body,
33 but it can also be done in the reload pass when a pseudo-register does
34 not get a hard register.
36 Call `put_var_into_stack' when you learn, belatedly, that a variable
37 previously given a pseudo-register must in fact go in the stack.
38 This function changes the DECL_RTL to be a stack slot instead of a reg
39 then scans all the RTL instructions so far generated to correct them. */
51 #include "hard-reg-set.h"
52 #include "insn-config.h"
55 #include "basic-block.h"
61 #include "integrate.h"
63 #ifndef TRAMPOLINE_ALIGNMENT
64 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
67 #ifndef LOCAL_ALIGNMENT
68 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
71 /* Some systems use __main in a way incompatible with its use in gcc, in these
72 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
73 give the same symbol without quotes for an alternative entry point. You
74 must define both, or neither. */
76 #define NAME__MAIN "__main"
77 #define SYMBOL__MAIN __main
80 /* Round a value to the lowest integer less than it that is a multiple of
81 the required alignment. Avoid using division in case the value is
82 negative. Assume the alignment is a power of two. */
83 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
85 /* Similar, but round to the next highest integer that meets the
87 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
89 /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
90 during rtl generation. If they are different register numbers, this is
91 always true. It may also be true if
92 FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
93 generation. See fix_lexical_addr for details. */
95 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
96 #define NEED_SEPARATE_AP
99 /* Nonzero if function being compiled doesn't contain any calls
100 (ignoring the prologue and epilogue). This is set prior to
101 local register allocation and is valid for the remaining
103 int current_function_is_leaf;
105 /* Nonzero if function being compiled doesn't contain any instructions
106 that can throw an exception. This is set prior to final. */
108 int current_function_nothrow;
110 /* Nonzero if function being compiled doesn't modify the stack pointer
111 (ignoring the prologue and epilogue). This is only valid after
112 life_analysis has run. */
113 int current_function_sp_is_unchanging;
115 /* Nonzero if the function being compiled is a leaf function which only
116 uses leaf registers. This is valid after reload (specifically after
117 sched2) and is useful only if the port defines LEAF_REGISTERS. */
118 int current_function_uses_only_leaf_regs;
120 /* Nonzero once virtual register instantiation has been done.
121 assign_stack_local uses frame_pointer_rtx when this is nonzero.
122 calls.c:emit_library_call_value_1 uses it to set up
123 post-instantiation libcalls. */
124 int virtuals_instantiated;
126 /* These variables hold pointers to functions to create and destroy
127 target specific, per-function data structures. */
128 void (*init_machine_status) PARAMS ((struct function *));
129 void (*free_machine_status) PARAMS ((struct function *));
130 /* This variable holds a pointer to a function to register any
131 data items in the target specific, per-function data structure
132 that will need garbage collection. */
133 void (*mark_machine_status) PARAMS ((struct function *));
135 /* Likewise, but for language-specific data. */
136 void (*init_lang_status) PARAMS ((struct function *));
137 void (*save_lang_status) PARAMS ((struct function *));
138 void (*restore_lang_status) PARAMS ((struct function *));
139 void (*mark_lang_status) PARAMS ((struct function *));
140 void (*free_lang_status) PARAMS ((struct function *));
142 /* The FUNCTION_DECL for an inline function currently being expanded. */
143 tree inline_function_decl;
145 /* The currently compiled function. */
146 struct function *cfun = 0;
148 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
149 static varray_type prologue;
150 static varray_type epilogue;
152 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
154 static varray_type sibcall_epilogue;
156 /* In order to evaluate some expressions, such as function calls returning
157 structures in memory, we need to temporarily allocate stack locations.
158 We record each allocated temporary in the following structure.
160 Associated with each temporary slot is a nesting level. When we pop up
161 one level, all temporaries associated with the previous level are freed.
162 Normally, all temporaries are freed after the execution of the statement
163 in which they were created. However, if we are inside a ({...}) grouping,
164 the result may be in a temporary and hence must be preserved. If the
165 result could be in a temporary, we preserve it if we can determine which
166 one it is in. If we cannot determine which temporary may contain the
167 result, all temporaries are preserved. A temporary is preserved by
168 pretending it was allocated at the previous nesting level.
170 Automatic variables are also assigned temporary slots, at the nesting
171 level where they are defined. They are marked a "kept" so that
172 free_temp_slots will not free them. */
176 /* Points to next temporary slot. */
177 struct temp_slot *next;
178 /* The rtx to used to reference the slot. */
180 /* The rtx used to represent the address if not the address of the
181 slot above. May be an EXPR_LIST if multiple addresses exist. */
183 /* The alignment (in bits) of the slot. */
185 /* The size, in units, of the slot. */
187 /* The type of the object in the slot, or zero if it doesn't correspond
188 to a type. We use this to determine whether a slot can be reused.
189 It can be reused if objects of the type of the new slot will always
190 conflict with objects of the type of the old slot. */
192 /* The value of `sequence_rtl_expr' when this temporary is allocated. */
194 /* Non-zero if this temporary is currently in use. */
196 /* Non-zero if this temporary has its address taken. */
198 /* Nesting level at which this slot is being used. */
200 /* Non-zero if this should survive a call to free_temp_slots. */
202 /* The offset of the slot from the frame_pointer, including extra space
203 for alignment. This info is for combine_temp_slots. */
204 HOST_WIDE_INT base_offset;
205 /* The size of the slot, including extra space for alignment. This
206 info is for combine_temp_slots. */
207 HOST_WIDE_INT full_size;
210 /* This structure is used to record MEMs or pseudos used to replace VAR, any
211 SUBREGs of VAR, and any MEMs containing VAR as an address. We need to
212 maintain this list in case two operands of an insn were required to match;
213 in that case we must ensure we use the same replacement. */
215 struct fixup_replacement
219 struct fixup_replacement *next;
222 struct insns_for_mem_entry
224 /* The KEY in HE will be a MEM. */
225 struct hash_entry he;
226 /* These are the INSNS which reference the MEM. */
230 /* Forward declarations. */
232 static rtx assign_stack_local_1 PARAMS ((enum machine_mode, HOST_WIDE_INT,
233 int, struct function *));
234 static rtx assign_stack_temp_for_type PARAMS ((enum machine_mode,
235 HOST_WIDE_INT, int, tree));
236 static struct temp_slot *find_temp_slot_from_address PARAMS ((rtx));
237 static void put_reg_into_stack PARAMS ((struct function *, rtx, tree,
238 enum machine_mode, enum machine_mode,
239 int, unsigned int, int,
240 struct hash_table *));
241 static void schedule_fixup_var_refs PARAMS ((struct function *, rtx, tree,
243 struct hash_table *));
244 static void fixup_var_refs PARAMS ((rtx, enum machine_mode, int,
245 struct hash_table *));
246 static struct fixup_replacement
247 *find_fixup_replacement PARAMS ((struct fixup_replacement **, rtx));
248 static void fixup_var_refs_insns PARAMS ((rtx, rtx, enum machine_mode,
250 static void fixup_var_refs_insns_with_hash
251 PARAMS ((struct hash_table *, rtx,
252 enum machine_mode, int));
253 static void fixup_var_refs_insn PARAMS ((rtx, rtx, enum machine_mode,
255 static void fixup_var_refs_1 PARAMS ((rtx, enum machine_mode, rtx *, rtx,
256 struct fixup_replacement **));
257 static rtx fixup_memory_subreg PARAMS ((rtx, rtx, int));
258 static rtx walk_fixup_memory_subreg PARAMS ((rtx, rtx, int));
259 static rtx fixup_stack_1 PARAMS ((rtx, rtx));
260 static void optimize_bit_field PARAMS ((rtx, rtx, rtx *));
261 static void instantiate_decls PARAMS ((tree, int));
262 static void instantiate_decls_1 PARAMS ((tree, int));
263 static void instantiate_decl PARAMS ((rtx, HOST_WIDE_INT, int));
264 static rtx instantiate_new_reg PARAMS ((rtx, HOST_WIDE_INT *));
265 static int instantiate_virtual_regs_1 PARAMS ((rtx *, rtx, int));
266 static void delete_handlers PARAMS ((void));
267 static void pad_to_arg_alignment PARAMS ((struct args_size *, int,
268 struct args_size *));
269 #ifndef ARGS_GROW_DOWNWARD
270 static void pad_below PARAMS ((struct args_size *, enum machine_mode,
273 static rtx round_trampoline_addr PARAMS ((rtx));
274 static rtx adjust_trampoline_addr PARAMS ((rtx));
275 static tree *identify_blocks_1 PARAMS ((rtx, tree *, tree *, tree *));
276 static void reorder_blocks_0 PARAMS ((tree));
277 static void reorder_blocks_1 PARAMS ((rtx, tree, varray_type *));
278 static void reorder_fix_fragments PARAMS ((tree));
279 static tree blocks_nreverse PARAMS ((tree));
280 static int all_blocks PARAMS ((tree, tree *));
281 static tree *get_block_vector PARAMS ((tree, int *));
282 /* We always define `record_insns' even if its not used so that we
283 can always export `prologue_epilogue_contains'. */
284 static void record_insns PARAMS ((rtx, varray_type *)) ATTRIBUTE_UNUSED;
285 static int contains PARAMS ((rtx, varray_type));
287 static void emit_return_into_block PARAMS ((basic_block, rtx));
289 static void put_addressof_into_stack PARAMS ((rtx, struct hash_table *));
290 static bool purge_addressof_1 PARAMS ((rtx *, rtx, int, int,
291 struct hash_table *));
292 static void purge_single_hard_subreg_set PARAMS ((rtx));
294 static void keep_stack_depressed PARAMS ((rtx));
296 static int is_addressof PARAMS ((rtx *, void *));
297 static struct hash_entry *insns_for_mem_newfunc PARAMS ((struct hash_entry *,
300 static unsigned long insns_for_mem_hash PARAMS ((hash_table_key));
301 static bool insns_for_mem_comp PARAMS ((hash_table_key, hash_table_key));
302 static int insns_for_mem_walk PARAMS ((rtx *, void *));
303 static void compute_insns_for_mem PARAMS ((rtx, rtx, struct hash_table *));
304 static void mark_function_status PARAMS ((struct function *));
305 static void maybe_mark_struct_function PARAMS ((void *));
306 static void prepare_function_start PARAMS ((void));
307 static void do_clobber_return_reg PARAMS ((rtx, void *));
308 static void do_use_return_reg PARAMS ((rtx, void *));
310 /* Pointer to chain of `struct function' for containing functions. */
311 static struct function *outer_function_chain;
313 /* Given a function decl for a containing function,
314 return the `struct function' for it. */
317 find_function_data (decl)
322 for (p = outer_function_chain; p; p = p->outer)
329 /* Save the current context for compilation of a nested function.
330 This is called from language-specific code. The caller should use
331 the save_lang_status callback to save any language-specific state,
332 since this function knows only about language-independent
336 push_function_context_to (context)
343 if (context == current_function_decl)
344 cfun->contains_functions = 1;
347 struct function *containing = find_function_data (context);
348 containing->contains_functions = 1;
353 init_dummy_function_start ();
356 p->outer = outer_function_chain;
357 outer_function_chain = p;
358 p->fixup_var_refs_queue = 0;
360 if (save_lang_status)
361 (*save_lang_status) (p);
367 push_function_context ()
369 push_function_context_to (current_function_decl);
372 /* Restore the last saved context, at the end of a nested function.
373 This function is called from language-specific code. */
376 pop_function_context_from (context)
377 tree context ATTRIBUTE_UNUSED;
379 struct function *p = outer_function_chain;
380 struct var_refs_queue *queue;
383 outer_function_chain = p->outer;
385 current_function_decl = p->decl;
388 restore_emit_status (p);
389 restore_varasm_status (p);
391 if (restore_lang_status)
392 (*restore_lang_status) (p);
394 /* Finish doing put_var_into_stack for any of our variables
395 which became addressable during the nested function. */
396 for (queue = p->fixup_var_refs_queue; queue; queue = queue->next)
397 fixup_var_refs (queue->modified, queue->promoted_mode,
398 queue->unsignedp, 0);
400 p->fixup_var_refs_queue = 0;
402 /* Reset variables that have known state during rtx generation. */
403 rtx_equal_function_value_matters = 1;
404 virtuals_instantiated = 0;
405 generating_concat_p = 1;
409 pop_function_context ()
411 pop_function_context_from (current_function_decl);
414 /* Clear out all parts of the state in F that can safely be discarded
415 after the function has been parsed, but not compiled, to let
416 garbage collection reclaim the memory. */
419 free_after_parsing (f)
422 /* f->expr->forced_labels is used by code generation. */
423 /* f->emit->regno_reg_rtx is used by code generation. */
424 /* f->varasm is used by code generation. */
425 /* f->eh->eh_return_stub_label is used by code generation. */
427 if (free_lang_status)
428 (*free_lang_status) (f);
429 free_stmt_status (f);
432 /* Clear out all parts of the state in F that can safely be discarded
433 after the function has been compiled, to let garbage collection
434 reclaim the memory. */
437 free_after_compilation (f)
441 free_expr_status (f);
442 free_emit_status (f);
443 free_varasm_status (f);
445 if (free_machine_status)
446 (*free_machine_status) (f);
448 if (f->x_parm_reg_stack_loc)
449 free (f->x_parm_reg_stack_loc);
451 f->x_temp_slots = NULL;
452 f->arg_offset_rtx = NULL;
453 f->return_rtx = NULL;
454 f->internal_arg_pointer = NULL;
455 f->x_nonlocal_labels = NULL;
456 f->x_nonlocal_goto_handler_slots = NULL;
457 f->x_nonlocal_goto_handler_labels = NULL;
458 f->x_nonlocal_goto_stack_level = NULL;
459 f->x_cleanup_label = NULL;
460 f->x_return_label = NULL;
461 f->x_save_expr_regs = NULL;
462 f->x_stack_slot_list = NULL;
463 f->x_rtl_expr_chain = NULL;
464 f->x_tail_recursion_label = NULL;
465 f->x_tail_recursion_reentry = NULL;
466 f->x_arg_pointer_save_area = NULL;
467 f->x_clobber_return_insn = NULL;
468 f->x_context_display = NULL;
469 f->x_trampoline_list = NULL;
470 f->x_parm_birth_insn = NULL;
471 f->x_last_parm_insn = NULL;
472 f->x_parm_reg_stack_loc = NULL;
473 f->fixup_var_refs_queue = NULL;
474 f->original_arg_vector = NULL;
475 f->original_decl_initial = NULL;
476 f->inl_last_parm_insn = NULL;
477 f->epilogue_delay_list = NULL;
480 /* Allocate fixed slots in the stack frame of the current function. */
482 /* Return size needed for stack frame based on slots so far allocated in
484 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
485 the caller may have to do that. */
488 get_func_frame_size (f)
491 #ifdef FRAME_GROWS_DOWNWARD
492 return -f->x_frame_offset;
494 return f->x_frame_offset;
498 /* Return size needed for stack frame based on slots so far allocated.
499 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
500 the caller may have to do that. */
504 return get_func_frame_size (cfun);
507 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
508 with machine mode MODE.
510 ALIGN controls the amount of alignment for the address of the slot:
511 0 means according to MODE,
512 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
513 positive specifies alignment boundary in bits.
515 We do not round to stack_boundary here.
517 FUNCTION specifies the function to allocate in. */
520 assign_stack_local_1 (mode, size, align, function)
521 enum machine_mode mode;
524 struct function *function;
527 int bigend_correction = 0;
535 alignment = BIGGEST_ALIGNMENT;
537 alignment = GET_MODE_ALIGNMENT (mode);
539 /* Allow the target to (possibly) increase the alignment of this
541 type = type_for_mode (mode, 0);
543 alignment = LOCAL_ALIGNMENT (type, alignment);
545 alignment /= BITS_PER_UNIT;
547 else if (align == -1)
549 alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
550 size = CEIL_ROUND (size, alignment);
553 alignment = align / BITS_PER_UNIT;
555 #ifdef FRAME_GROWS_DOWNWARD
556 function->x_frame_offset -= size;
559 /* Ignore alignment we can't do with expected alignment of the boundary. */
560 if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY)
561 alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
563 if (function->stack_alignment_needed < alignment * BITS_PER_UNIT)
564 function->stack_alignment_needed = alignment * BITS_PER_UNIT;
566 /* Round frame offset to that alignment.
567 We must be careful here, since FRAME_OFFSET might be negative and
568 division with a negative dividend isn't as well defined as we might
569 like. So we instead assume that ALIGNMENT is a power of two and
570 use logical operations which are unambiguous. */
571 #ifdef FRAME_GROWS_DOWNWARD
572 function->x_frame_offset = FLOOR_ROUND (function->x_frame_offset, alignment);
574 function->x_frame_offset = CEIL_ROUND (function->x_frame_offset, alignment);
577 /* On a big-endian machine, if we are allocating more space than we will use,
578 use the least significant bytes of those that are allocated. */
579 if (BYTES_BIG_ENDIAN && mode != BLKmode)
580 bigend_correction = size - GET_MODE_SIZE (mode);
582 /* If we have already instantiated virtual registers, return the actual
583 address relative to the frame pointer. */
584 if (function == cfun && virtuals_instantiated)
585 addr = plus_constant (frame_pointer_rtx,
586 (frame_offset + bigend_correction
587 + STARTING_FRAME_OFFSET));
589 addr = plus_constant (virtual_stack_vars_rtx,
590 function->x_frame_offset + bigend_correction);
592 #ifndef FRAME_GROWS_DOWNWARD
593 function->x_frame_offset += size;
596 x = gen_rtx_MEM (mode, addr);
598 function->x_stack_slot_list
599 = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list);
604 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
608 assign_stack_local (mode, size, align)
609 enum machine_mode mode;
613 return assign_stack_local_1 (mode, size, align, cfun);
616 /* Allocate a temporary stack slot and record it for possible later
619 MODE is the machine mode to be given to the returned rtx.
621 SIZE is the size in units of the space required. We do no rounding here
622 since assign_stack_local will do any required rounding.
624 KEEP is 1 if this slot is to be retained after a call to
625 free_temp_slots. Automatic variables for a block are allocated
626 with this flag. KEEP is 2 if we allocate a longer term temporary,
627 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
628 if we are to allocate something at an inner level to be treated as
629 a variable in the block (e.g., a SAVE_EXPR).
631 TYPE is the type that will be used for the stack slot. */
634 assign_stack_temp_for_type (mode, size, keep, type)
635 enum machine_mode mode;
641 struct temp_slot *p, *best_p = 0;
643 /* If SIZE is -1 it means that somebody tried to allocate a temporary
644 of a variable size. */
649 align = BIGGEST_ALIGNMENT;
651 align = GET_MODE_ALIGNMENT (mode);
654 type = type_for_mode (mode, 0);
657 align = LOCAL_ALIGNMENT (type, align);
659 /* Try to find an available, already-allocated temporary of the proper
660 mode which meets the size and alignment requirements. Choose the
661 smallest one with the closest alignment. */
662 for (p = temp_slots; p; p = p->next)
663 if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode
665 && objects_must_conflict_p (p->type, type)
666 && (best_p == 0 || best_p->size > p->size
667 || (best_p->size == p->size && best_p->align > p->align)))
669 if (p->align == align && p->size == size)
677 /* Make our best, if any, the one to use. */
680 /* If there are enough aligned bytes left over, make them into a new
681 temp_slot so that the extra bytes don't get wasted. Do this only
682 for BLKmode slots, so that we can be sure of the alignment. */
683 if (GET_MODE (best_p->slot) == BLKmode)
685 int alignment = best_p->align / BITS_PER_UNIT;
686 HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment);
688 if (best_p->size - rounded_size >= alignment)
690 p = (struct temp_slot *) ggc_alloc (sizeof (struct temp_slot));
691 p->in_use = p->addr_taken = 0;
692 p->size = best_p->size - rounded_size;
693 p->base_offset = best_p->base_offset + rounded_size;
694 p->full_size = best_p->full_size - rounded_size;
695 p->slot = gen_rtx_MEM (BLKmode,
696 plus_constant (XEXP (best_p->slot, 0),
698 p->align = best_p->align;
701 p->type = best_p->type;
702 p->next = temp_slots;
705 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot,
708 best_p->size = rounded_size;
709 best_p->full_size = rounded_size;
716 /* If we still didn't find one, make a new temporary. */
719 HOST_WIDE_INT frame_offset_old = frame_offset;
721 p = (struct temp_slot *) ggc_alloc (sizeof (struct temp_slot));
723 /* We are passing an explicit alignment request to assign_stack_local.
724 One side effect of that is assign_stack_local will not round SIZE
725 to ensure the frame offset remains suitably aligned.
727 So for requests which depended on the rounding of SIZE, we go ahead
728 and round it now. We also make sure ALIGNMENT is at least
729 BIGGEST_ALIGNMENT. */
730 if (mode == BLKmode && align < BIGGEST_ALIGNMENT)
732 p->slot = assign_stack_local (mode,
734 ? CEIL_ROUND (size, align / BITS_PER_UNIT)
740 /* The following slot size computation is necessary because we don't
741 know the actual size of the temporary slot until assign_stack_local
742 has performed all the frame alignment and size rounding for the
743 requested temporary. Note that extra space added for alignment
744 can be either above or below this stack slot depending on which
745 way the frame grows. We include the extra space if and only if it
746 is above this slot. */
747 #ifdef FRAME_GROWS_DOWNWARD
748 p->size = frame_offset_old - frame_offset;
753 /* Now define the fields used by combine_temp_slots. */
754 #ifdef FRAME_GROWS_DOWNWARD
755 p->base_offset = frame_offset;
756 p->full_size = frame_offset_old - frame_offset;
758 p->base_offset = frame_offset_old;
759 p->full_size = frame_offset - frame_offset_old;
762 p->next = temp_slots;
768 p->rtl_expr = seq_rtl_expr;
773 p->level = target_temp_slot_level;
778 p->level = var_temp_slot_level;
783 p->level = temp_slot_level;
787 /* We may be reusing an old slot, so clear any MEM flags that may have been
789 RTX_UNCHANGING_P (p->slot) = 0;
790 MEM_IN_STRUCT_P (p->slot) = 0;
791 MEM_SCALAR_P (p->slot) = 0;
792 MEM_VOLATILE_P (p->slot) = 0;
794 /* If we know the alias set for the memory that will be used, use
795 it. If there's no TYPE, then we don't know anything about the
796 alias set for the memory. */
797 set_mem_alias_set (p->slot, type ? get_alias_set (type) : 0);
799 /* If a type is specified, set the relevant flags. */
802 RTX_UNCHANGING_P (p->slot) = TYPE_READONLY (type);
803 MEM_VOLATILE_P (p->slot) = TYPE_VOLATILE (type);
804 MEM_SET_IN_STRUCT_P (p->slot, AGGREGATE_TYPE_P (type));
810 /* Allocate a temporary stack slot and record it for possible later
811 reuse. First three arguments are same as in preceding function. */
814 assign_stack_temp (mode, size, keep)
815 enum machine_mode mode;
819 return assign_stack_temp_for_type (mode, size, keep, NULL_TREE);
822 /* Assign a temporary of given TYPE.
823 KEEP is as for assign_stack_temp.
824 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
825 it is 0 if a register is OK.
826 DONT_PROMOTE is 1 if we should not promote values in register
830 assign_temp (type, keep, memory_required, dont_promote)
834 int dont_promote ATTRIBUTE_UNUSED;
836 enum machine_mode mode = TYPE_MODE (type);
837 #ifndef PROMOTE_FOR_CALL_ONLY
838 int unsignedp = TREE_UNSIGNED (type);
841 if (mode == BLKmode || memory_required)
843 HOST_WIDE_INT size = int_size_in_bytes (type);
846 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
847 problems with allocating the stack space. */
851 /* Unfortunately, we don't yet know how to allocate variable-sized
852 temporaries. However, sometimes we have a fixed upper limit on
853 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
854 instead. This is the case for Chill variable-sized strings. */
855 if (size == -1 && TREE_CODE (type) == ARRAY_TYPE
856 && TYPE_ARRAY_MAX_SIZE (type) != NULL_TREE
857 && host_integerp (TYPE_ARRAY_MAX_SIZE (type), 1))
858 size = tree_low_cst (TYPE_ARRAY_MAX_SIZE (type), 1);
860 tmp = assign_stack_temp_for_type (mode, size, keep, type);
864 #ifndef PROMOTE_FOR_CALL_ONLY
866 mode = promote_mode (type, mode, &unsignedp, 0);
869 return gen_reg_rtx (mode);
872 /* Combine temporary stack slots which are adjacent on the stack.
874 This allows for better use of already allocated stack space. This is only
875 done for BLKmode slots because we can be sure that we won't have alignment
876 problems in this case. */
879 combine_temp_slots ()
881 struct temp_slot *p, *q;
882 struct temp_slot *prev_p, *prev_q;
885 /* We can't combine slots, because the information about which slot
886 is in which alias set will be lost. */
887 if (flag_strict_aliasing)
890 /* If there are a lot of temp slots, don't do anything unless
891 high levels of optimizaton. */
892 if (! flag_expensive_optimizations)
893 for (p = temp_slots, num_slots = 0; p; p = p->next, num_slots++)
894 if (num_slots > 100 || (num_slots > 10 && optimize == 0))
897 for (p = temp_slots, prev_p = 0; p; p = prev_p ? prev_p->next : temp_slots)
901 if (! p->in_use && GET_MODE (p->slot) == BLKmode)
902 for (q = p->next, prev_q = p; q; q = prev_q->next)
905 if (! q->in_use && GET_MODE (q->slot) == BLKmode)
907 if (p->base_offset + p->full_size == q->base_offset)
909 /* Q comes after P; combine Q into P. */
911 p->full_size += q->full_size;
914 else if (q->base_offset + q->full_size == p->base_offset)
916 /* P comes after Q; combine P into Q. */
918 q->full_size += p->full_size;
923 /* Either delete Q or advance past it. */
925 prev_q->next = q->next;
929 /* Either delete P or advance past it. */
933 prev_p->next = p->next;
935 temp_slots = p->next;
942 /* Find the temp slot corresponding to the object at address X. */
944 static struct temp_slot *
945 find_temp_slot_from_address (x)
951 for (p = temp_slots; p; p = p->next)
956 else if (XEXP (p->slot, 0) == x
958 || (GET_CODE (x) == PLUS
959 && XEXP (x, 0) == virtual_stack_vars_rtx
960 && GET_CODE (XEXP (x, 1)) == CONST_INT
961 && INTVAL (XEXP (x, 1)) >= p->base_offset
962 && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size))
965 else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST)
966 for (next = p->address; next; next = XEXP (next, 1))
967 if (XEXP (next, 0) == x)
971 /* If we have a sum involving a register, see if it points to a temp
973 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 0)) == REG
974 && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
976 else if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == REG
977 && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
983 /* Indicate that NEW is an alternate way of referring to the temp slot
984 that previously was known by OLD. */
987 update_temp_slot_address (old, new)
992 if (rtx_equal_p (old, new))
995 p = find_temp_slot_from_address (old);
997 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
998 is a register, see if one operand of the PLUS is a temporary
999 location. If so, NEW points into it. Otherwise, if both OLD and
1000 NEW are a PLUS and if there is a register in common between them.
1001 If so, try a recursive call on those values. */
1004 if (GET_CODE (old) != PLUS)
1007 if (GET_CODE (new) == REG)
1009 update_temp_slot_address (XEXP (old, 0), new);
1010 update_temp_slot_address (XEXP (old, 1), new);
1013 else if (GET_CODE (new) != PLUS)
1016 if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0)))
1017 update_temp_slot_address (XEXP (old, 1), XEXP (new, 1));
1018 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0)))
1019 update_temp_slot_address (XEXP (old, 0), XEXP (new, 1));
1020 else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1)))
1021 update_temp_slot_address (XEXP (old, 1), XEXP (new, 0));
1022 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1)))
1023 update_temp_slot_address (XEXP (old, 0), XEXP (new, 0));
1028 /* Otherwise add an alias for the temp's address. */
1029 else if (p->address == 0)
1033 if (GET_CODE (p->address) != EXPR_LIST)
1034 p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX);
1036 p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address);
1040 /* If X could be a reference to a temporary slot, mark the fact that its
1041 address was taken. */
1044 mark_temp_addr_taken (x)
1047 struct temp_slot *p;
1052 /* If X is not in memory or is at a constant address, it cannot be in
1053 a temporary slot. */
1054 if (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1057 p = find_temp_slot_from_address (XEXP (x, 0));
1062 /* If X could be a reference to a temporary slot, mark that slot as
1063 belonging to the to one level higher than the current level. If X
1064 matched one of our slots, just mark that one. Otherwise, we can't
1065 easily predict which it is, so upgrade all of them. Kept slots
1066 need not be touched.
1068 This is called when an ({...}) construct occurs and a statement
1069 returns a value in memory. */
1072 preserve_temp_slots (x)
1075 struct temp_slot *p = 0;
1077 /* If there is no result, we still might have some objects whose address
1078 were taken, so we need to make sure they stay around. */
1081 for (p = temp_slots; p; p = p->next)
1082 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1088 /* If X is a register that is being used as a pointer, see if we have
1089 a temporary slot we know it points to. To be consistent with
1090 the code below, we really should preserve all non-kept slots
1091 if we can't find a match, but that seems to be much too costly. */
1092 if (GET_CODE (x) == REG && REG_POINTER (x))
1093 p = find_temp_slot_from_address (x);
1095 /* If X is not in memory or is at a constant address, it cannot be in
1096 a temporary slot, but it can contain something whose address was
1098 if (p == 0 && (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0))))
1100 for (p = temp_slots; p; p = p->next)
1101 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1107 /* First see if we can find a match. */
1109 p = find_temp_slot_from_address (XEXP (x, 0));
1113 /* Move everything at our level whose address was taken to our new
1114 level in case we used its address. */
1115 struct temp_slot *q;
1117 if (p->level == temp_slot_level)
1119 for (q = temp_slots; q; q = q->next)
1120 if (q != p && q->addr_taken && q->level == p->level)
1129 /* Otherwise, preserve all non-kept slots at this level. */
1130 for (p = temp_slots; p; p = p->next)
1131 if (p->in_use && p->level == temp_slot_level && ! p->keep)
1135 /* X is the result of an RTL_EXPR. If it is a temporary slot associated
1136 with that RTL_EXPR, promote it into a temporary slot at the present
1137 level so it will not be freed when we free slots made in the
1141 preserve_rtl_expr_result (x)
1144 struct temp_slot *p;
1146 /* If X is not in memory or is at a constant address, it cannot be in
1147 a temporary slot. */
1148 if (x == 0 || GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1151 /* If we can find a match, move it to our level unless it is already at
1153 p = find_temp_slot_from_address (XEXP (x, 0));
1156 p->level = MIN (p->level, temp_slot_level);
1163 /* Free all temporaries used so far. This is normally called at the end
1164 of generating code for a statement. Don't free any temporaries
1165 currently in use for an RTL_EXPR that hasn't yet been emitted.
1166 We could eventually do better than this since it can be reused while
1167 generating the same RTL_EXPR, but this is complex and probably not
1173 struct temp_slot *p;
1175 for (p = temp_slots; p; p = p->next)
1176 if (p->in_use && p->level == temp_slot_level && ! p->keep
1177 && p->rtl_expr == 0)
1180 combine_temp_slots ();
1183 /* Free all temporary slots used in T, an RTL_EXPR node. */
1186 free_temps_for_rtl_expr (t)
1189 struct temp_slot *p;
1191 for (p = temp_slots; p; p = p->next)
1192 if (p->rtl_expr == t)
1194 /* If this slot is below the current TEMP_SLOT_LEVEL, then it
1195 needs to be preserved. This can happen if a temporary in
1196 the RTL_EXPR was addressed; preserve_temp_slots will move
1197 the temporary into a higher level. */
1198 if (temp_slot_level <= p->level)
1201 p->rtl_expr = NULL_TREE;
1204 combine_temp_slots ();
1207 /* Mark all temporaries ever allocated in this function as not suitable
1208 for reuse until the current level is exited. */
1211 mark_all_temps_used ()
1213 struct temp_slot *p;
1215 for (p = temp_slots; p; p = p->next)
1217 p->in_use = p->keep = 1;
1218 p->level = MIN (p->level, temp_slot_level);
1222 /* Push deeper into the nesting level for stack temporaries. */
1230 /* Likewise, but save the new level as the place to allocate variables
1235 push_temp_slots_for_block ()
1239 var_temp_slot_level = temp_slot_level;
1242 /* Likewise, but save the new level as the place to allocate temporaries
1243 for TARGET_EXPRs. */
1246 push_temp_slots_for_target ()
1250 target_temp_slot_level = temp_slot_level;
1253 /* Set and get the value of target_temp_slot_level. The only
1254 permitted use of these functions is to save and restore this value. */
1257 get_target_temp_slot_level ()
1259 return target_temp_slot_level;
1263 set_target_temp_slot_level (level)
1266 target_temp_slot_level = level;
1270 /* Pop a temporary nesting level. All slots in use in the current level
1276 struct temp_slot *p;
1278 for (p = temp_slots; p; p = p->next)
1279 if (p->in_use && p->level == temp_slot_level && p->rtl_expr == 0)
1282 combine_temp_slots ();
1287 /* Initialize temporary slots. */
1292 /* We have not allocated any temporaries yet. */
1294 temp_slot_level = 0;
1295 var_temp_slot_level = 0;
1296 target_temp_slot_level = 0;
1299 /* Retroactively move an auto variable from a register to a stack slot.
1300 This is done when an address-reference to the variable is seen. */
1303 put_var_into_stack (decl)
1307 enum machine_mode promoted_mode, decl_mode;
1308 struct function *function = 0;
1310 int can_use_addressof;
1311 int volatilep = TREE_CODE (decl) != SAVE_EXPR && TREE_THIS_VOLATILE (decl);
1312 int usedp = (TREE_USED (decl)
1313 || (TREE_CODE (decl) != SAVE_EXPR && DECL_INITIAL (decl) != 0));
1315 context = decl_function_context (decl);
1317 /* Get the current rtl used for this object and its original mode. */
1318 reg = (TREE_CODE (decl) == SAVE_EXPR
1319 ? SAVE_EXPR_RTL (decl)
1320 : DECL_RTL_IF_SET (decl));
1322 /* No need to do anything if decl has no rtx yet
1323 since in that case caller is setting TREE_ADDRESSABLE
1324 and a stack slot will be assigned when the rtl is made. */
1328 /* Get the declared mode for this object. */
1329 decl_mode = (TREE_CODE (decl) == SAVE_EXPR ? TYPE_MODE (TREE_TYPE (decl))
1330 : DECL_MODE (decl));
1331 /* Get the mode it's actually stored in. */
1332 promoted_mode = GET_MODE (reg);
1334 /* If this variable comes from an outer function, find that
1335 function's saved context. Don't use find_function_data here,
1336 because it might not be in any active function.
1337 FIXME: Is that really supposed to happen?
1338 It does in ObjC at least. */
1339 if (context != current_function_decl && context != inline_function_decl)
1340 for (function = outer_function_chain; function; function = function->outer)
1341 if (function->decl == context)
1344 /* If this is a variable-size object with a pseudo to address it,
1345 put that pseudo into the stack, if the var is nonlocal. */
1346 if (TREE_CODE (decl) != SAVE_EXPR && DECL_NONLOCAL (decl)
1347 && GET_CODE (reg) == MEM
1348 && GET_CODE (XEXP (reg, 0)) == REG
1349 && REGNO (XEXP (reg, 0)) > LAST_VIRTUAL_REGISTER)
1351 reg = XEXP (reg, 0);
1352 decl_mode = promoted_mode = GET_MODE (reg);
1358 /* FIXME make it work for promoted modes too */
1359 && decl_mode == promoted_mode
1360 #ifdef NON_SAVING_SETJMP
1361 && ! (NON_SAVING_SETJMP && current_function_calls_setjmp)
1365 /* If we can't use ADDRESSOF, make sure we see through one we already
1367 if (! can_use_addressof && GET_CODE (reg) == MEM
1368 && GET_CODE (XEXP (reg, 0)) == ADDRESSOF)
1369 reg = XEXP (XEXP (reg, 0), 0);
1371 /* Now we should have a value that resides in one or more pseudo regs. */
1373 if (GET_CODE (reg) == REG)
1375 /* If this variable lives in the current function and we don't need
1376 to put things in the stack for the sake of setjmp, try to keep it
1377 in a register until we know we actually need the address. */
1378 if (can_use_addressof)
1379 gen_mem_addressof (reg, decl);
1381 put_reg_into_stack (function, reg, TREE_TYPE (decl), promoted_mode,
1382 decl_mode, volatilep, 0, usedp, 0);
1384 else if (GET_CODE (reg) == CONCAT)
1386 /* A CONCAT contains two pseudos; put them both in the stack.
1387 We do it so they end up consecutive.
1388 We fixup references to the parts only after we fixup references
1389 to the whole CONCAT, lest we do double fixups for the latter
1391 enum machine_mode part_mode = GET_MODE (XEXP (reg, 0));
1392 tree part_type = type_for_mode (part_mode, 0);
1393 rtx lopart = XEXP (reg, 0);
1394 rtx hipart = XEXP (reg, 1);
1395 #ifdef FRAME_GROWS_DOWNWARD
1396 /* Since part 0 should have a lower address, do it second. */
1397 put_reg_into_stack (function, hipart, part_type, part_mode,
1398 part_mode, volatilep, 0, 0, 0);
1399 put_reg_into_stack (function, lopart, part_type, part_mode,
1400 part_mode, volatilep, 0, 0, 0);
1402 put_reg_into_stack (function, lopart, part_type, part_mode,
1403 part_mode, volatilep, 0, 0, 0);
1404 put_reg_into_stack (function, hipart, part_type, part_mode,
1405 part_mode, volatilep, 0, 0, 0);
1408 /* Change the CONCAT into a combined MEM for both parts. */
1409 PUT_CODE (reg, MEM);
1410 MEM_ATTRS (reg) = 0;
1412 /* set_mem_attributes uses DECL_RTL to avoid re-generating of
1413 already computed alias sets. Here we want to re-generate. */
1415 SET_DECL_RTL (decl, NULL);
1416 set_mem_attributes (reg, decl, 1);
1418 SET_DECL_RTL (decl, reg);
1420 /* The two parts are in memory order already.
1421 Use the lower parts address as ours. */
1422 XEXP (reg, 0) = XEXP (XEXP (reg, 0), 0);
1423 /* Prevent sharing of rtl that might lose. */
1424 if (GET_CODE (XEXP (reg, 0)) == PLUS)
1425 XEXP (reg, 0) = copy_rtx (XEXP (reg, 0));
1428 schedule_fixup_var_refs (function, reg, TREE_TYPE (decl),
1430 schedule_fixup_var_refs (function, lopart, part_type, part_mode, 0);
1431 schedule_fixup_var_refs (function, hipart, part_type, part_mode, 0);
1437 if (current_function_check_memory_usage)
1438 emit_library_call (chkr_set_right_libfunc, LCT_CONST_MAKE_BLOCK, VOIDmode,
1439 3, XEXP (reg, 0), Pmode,
1440 GEN_INT (GET_MODE_SIZE (GET_MODE (reg))),
1441 TYPE_MODE (sizetype),
1442 GEN_INT (MEMORY_USE_RW),
1443 TYPE_MODE (integer_type_node));
1446 /* Subroutine of put_var_into_stack. This puts a single pseudo reg REG
1447 into the stack frame of FUNCTION (0 means the current function).
1448 DECL_MODE is the machine mode of the user-level data type.
1449 PROMOTED_MODE is the machine mode of the register.
1450 VOLATILE_P is nonzero if this is for a "volatile" decl.
1451 USED_P is nonzero if this reg might have already been used in an insn. */
1454 put_reg_into_stack (function, reg, type, promoted_mode, decl_mode, volatile_p,
1455 original_regno, used_p, ht)
1456 struct function *function;
1459 enum machine_mode promoted_mode, decl_mode;
1461 unsigned int original_regno;
1463 struct hash_table *ht;
1465 struct function *func = function ? function : cfun;
1467 unsigned int regno = original_regno;
1470 regno = REGNO (reg);
1472 if (regno < func->x_max_parm_reg)
1473 new = func->x_parm_reg_stack_loc[regno];
1476 new = assign_stack_local_1 (decl_mode, GET_MODE_SIZE (decl_mode), 0, func);
1478 PUT_CODE (reg, MEM);
1479 PUT_MODE (reg, decl_mode);
1480 XEXP (reg, 0) = XEXP (new, 0);
1481 MEM_ATTRS (reg) = 0;
1482 /* `volatil' bit means one thing for MEMs, another entirely for REGs. */
1483 MEM_VOLATILE_P (reg) = volatile_p;
1485 /* If this is a memory ref that contains aggregate components,
1486 mark it as such for cse and loop optimize. If we are reusing a
1487 previously generated stack slot, then we need to copy the bit in
1488 case it was set for other reasons. For instance, it is set for
1489 __builtin_va_alist. */
1492 MEM_SET_IN_STRUCT_P (reg,
1493 AGGREGATE_TYPE_P (type) || MEM_IN_STRUCT_P (new));
1494 set_mem_alias_set (reg, get_alias_set (type));
1498 schedule_fixup_var_refs (function, reg, type, promoted_mode, ht);
1501 /* Make sure that all refs to the variable, previously made
1502 when it was a register, are fixed up to be valid again.
1503 See function above for meaning of arguments. */
1506 schedule_fixup_var_refs (function, reg, type, promoted_mode, ht)
1507 struct function *function;
1510 enum machine_mode promoted_mode;
1511 struct hash_table *ht;
1513 int unsigned_p = type ? TREE_UNSIGNED (type) : 0;
1517 struct var_refs_queue *temp;
1520 = (struct var_refs_queue *) ggc_alloc (sizeof (struct var_refs_queue));
1521 temp->modified = reg;
1522 temp->promoted_mode = promoted_mode;
1523 temp->unsignedp = unsigned_p;
1524 temp->next = function->fixup_var_refs_queue;
1525 function->fixup_var_refs_queue = temp;
1528 /* Variable is local; fix it up now. */
1529 fixup_var_refs (reg, promoted_mode, unsigned_p, ht);
1533 fixup_var_refs (var, promoted_mode, unsignedp, ht)
1535 enum machine_mode promoted_mode;
1537 struct hash_table *ht;
1540 rtx first_insn = get_insns ();
1541 struct sequence_stack *stack = seq_stack;
1542 tree rtl_exps = rtl_expr_chain;
1544 /* If there's a hash table, it must record all uses of VAR. */
1549 fixup_var_refs_insns_with_hash (ht, var, promoted_mode, unsignedp);
1553 fixup_var_refs_insns (first_insn, var, promoted_mode, unsignedp,
1556 /* Scan all pending sequences too. */
1557 for (; stack; stack = stack->next)
1559 push_to_full_sequence (stack->first, stack->last);
1560 fixup_var_refs_insns (stack->first, var, promoted_mode, unsignedp,
1562 /* Update remembered end of sequence
1563 in case we added an insn at the end. */
1564 stack->last = get_last_insn ();
1568 /* Scan all waiting RTL_EXPRs too. */
1569 for (pending = rtl_exps; pending; pending = TREE_CHAIN (pending))
1571 rtx seq = RTL_EXPR_SEQUENCE (TREE_VALUE (pending));
1572 if (seq != const0_rtx && seq != 0)
1574 push_to_sequence (seq);
1575 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0);
1581 /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is
1582 some part of an insn. Return a struct fixup_replacement whose OLD
1583 value is equal to X. Allocate a new structure if no such entry exists. */
1585 static struct fixup_replacement *
1586 find_fixup_replacement (replacements, x)
1587 struct fixup_replacement **replacements;
1590 struct fixup_replacement *p;
1592 /* See if we have already replaced this. */
1593 for (p = *replacements; p != 0 && ! rtx_equal_p (p->old, x); p = p->next)
1598 p = (struct fixup_replacement *) xmalloc (sizeof (struct fixup_replacement));
1601 p->next = *replacements;
1608 /* Scan the insn-chain starting with INSN for refs to VAR
1609 and fix them up. TOPLEVEL is nonzero if this chain is the
1610 main chain of insns for the current function. */
1613 fixup_var_refs_insns (insn, var, promoted_mode, unsignedp, toplevel)
1616 enum machine_mode promoted_mode;
1622 /* fixup_var_refs_insn might modify insn, so save its next
1624 rtx next = NEXT_INSN (insn);
1626 /* CALL_PLACEHOLDERs are special; we have to switch into each of
1627 the three sequences they (potentially) contain, and process
1628 them recursively. The CALL_INSN itself is not interesting. */
1630 if (GET_CODE (insn) == CALL_INSN
1631 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1635 /* Look at the Normal call, sibling call and tail recursion
1636 sequences attached to the CALL_PLACEHOLDER. */
1637 for (i = 0; i < 3; i++)
1639 rtx seq = XEXP (PATTERN (insn), i);
1642 push_to_sequence (seq);
1643 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0);
1644 XEXP (PATTERN (insn), i) = get_insns ();
1650 else if (INSN_P (insn))
1651 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, toplevel);
1657 /* Look up the insns which reference VAR in HT and fix them up. Other
1658 arguments are the same as fixup_var_refs_insns.
1660 N.B. No need for special processing of CALL_PLACEHOLDERs here,
1661 because the hash table will point straight to the interesting insn
1662 (inside the CALL_PLACEHOLDER). */
1665 fixup_var_refs_insns_with_hash (ht, var, promoted_mode, unsignedp)
1666 struct hash_table *ht;
1668 enum machine_mode promoted_mode;
1671 struct insns_for_mem_entry *ime = (struct insns_for_mem_entry *)
1672 hash_lookup (ht, var, /*create=*/0, /*copy=*/0);
1673 rtx insn_list = ime->insns;
1677 rtx insn = XEXP (insn_list, 0);
1680 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, 1);
1682 insn_list = XEXP (insn_list, 1);
1687 /* Per-insn processing by fixup_var_refs_insns(_with_hash). INSN is
1688 the insn under examination, VAR is the variable to fix up
1689 references to, PROMOTED_MODE and UNSIGNEDP describe VAR, and
1690 TOPLEVEL is nonzero if this is the main insn chain for this
1694 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, toplevel)
1697 enum machine_mode promoted_mode;
1702 rtx set, prev, prev_set;
1705 /* Remember the notes in case we delete the insn. */
1706 note = REG_NOTES (insn);
1708 /* If this is a CLOBBER of VAR, delete it.
1710 If it has a REG_LIBCALL note, delete the REG_LIBCALL
1711 and REG_RETVAL notes too. */
1712 if (GET_CODE (PATTERN (insn)) == CLOBBER
1713 && (XEXP (PATTERN (insn), 0) == var
1714 || (GET_CODE (XEXP (PATTERN (insn), 0)) == CONCAT
1715 && (XEXP (XEXP (PATTERN (insn), 0), 0) == var
1716 || XEXP (XEXP (PATTERN (insn), 0), 1) == var))))
1718 if ((note = find_reg_note (insn, REG_LIBCALL, NULL_RTX)) != 0)
1719 /* The REG_LIBCALL note will go away since we are going to
1720 turn INSN into a NOTE, so just delete the
1721 corresponding REG_RETVAL note. */
1722 remove_note (XEXP (note, 0),
1723 find_reg_note (XEXP (note, 0), REG_RETVAL,
1729 /* The insn to load VAR from a home in the arglist
1730 is now a no-op. When we see it, just delete it.
1731 Similarly if this is storing VAR from a register from which
1732 it was loaded in the previous insn. This will occur
1733 when an ADDRESSOF was made for an arglist slot. */
1735 && (set = single_set (insn)) != 0
1736 && SET_DEST (set) == var
1737 /* If this represents the result of an insn group,
1738 don't delete the insn. */
1739 && find_reg_note (insn, REG_RETVAL, NULL_RTX) == 0
1740 && (rtx_equal_p (SET_SRC (set), var)
1741 || (GET_CODE (SET_SRC (set)) == REG
1742 && (prev = prev_nonnote_insn (insn)) != 0
1743 && (prev_set = single_set (prev)) != 0
1744 && SET_DEST (prev_set) == SET_SRC (set)
1745 && rtx_equal_p (SET_SRC (prev_set), var))))
1751 struct fixup_replacement *replacements = 0;
1752 rtx next_insn = NEXT_INSN (insn);
1754 if (SMALL_REGISTER_CLASSES)
1756 /* If the insn that copies the results of a CALL_INSN
1757 into a pseudo now references VAR, we have to use an
1758 intermediate pseudo since we want the life of the
1759 return value register to be only a single insn.
1761 If we don't use an intermediate pseudo, such things as
1762 address computations to make the address of VAR valid
1763 if it is not can be placed between the CALL_INSN and INSN.
1765 To make sure this doesn't happen, we record the destination
1766 of the CALL_INSN and see if the next insn uses both that
1769 if (call_dest != 0 && GET_CODE (insn) == INSN
1770 && reg_mentioned_p (var, PATTERN (insn))
1771 && reg_mentioned_p (call_dest, PATTERN (insn)))
1773 rtx temp = gen_reg_rtx (GET_MODE (call_dest));
1775 emit_insn_before (gen_move_insn (temp, call_dest), insn);
1777 PATTERN (insn) = replace_rtx (PATTERN (insn),
1781 if (GET_CODE (insn) == CALL_INSN
1782 && GET_CODE (PATTERN (insn)) == SET)
1783 call_dest = SET_DEST (PATTERN (insn));
1784 else if (GET_CODE (insn) == CALL_INSN
1785 && GET_CODE (PATTERN (insn)) == PARALLEL
1786 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET)
1787 call_dest = SET_DEST (XVECEXP (PATTERN (insn), 0, 0));
1792 /* See if we have to do anything to INSN now that VAR is in
1793 memory. If it needs to be loaded into a pseudo, use a single
1794 pseudo for the entire insn in case there is a MATCH_DUP
1795 between two operands. We pass a pointer to the head of
1796 a list of struct fixup_replacements. If fixup_var_refs_1
1797 needs to allocate pseudos or replacement MEMs (for SUBREGs),
1798 it will record them in this list.
1800 If it allocated a pseudo for any replacement, we copy into
1803 fixup_var_refs_1 (var, promoted_mode, &PATTERN (insn), insn,
1806 /* If this is last_parm_insn, and any instructions were output
1807 after it to fix it up, then we must set last_parm_insn to
1808 the last such instruction emitted. */
1809 if (insn == last_parm_insn)
1810 last_parm_insn = PREV_INSN (next_insn);
1812 while (replacements)
1814 struct fixup_replacement *next;
1816 if (GET_CODE (replacements->new) == REG)
1821 /* OLD might be a (subreg (mem)). */
1822 if (GET_CODE (replacements->old) == SUBREG)
1824 = fixup_memory_subreg (replacements->old, insn, 0);
1827 = fixup_stack_1 (replacements->old, insn);
1829 insert_before = insn;
1831 /* If we are changing the mode, do a conversion.
1832 This might be wasteful, but combine.c will
1833 eliminate much of the waste. */
1835 if (GET_MODE (replacements->new)
1836 != GET_MODE (replacements->old))
1839 convert_move (replacements->new,
1840 replacements->old, unsignedp);
1841 seq = gen_sequence ();
1845 seq = gen_move_insn (replacements->new,
1848 emit_insn_before (seq, insert_before);
1851 next = replacements->next;
1852 free (replacements);
1853 replacements = next;
1857 /* Also fix up any invalid exprs in the REG_NOTES of this insn.
1858 But don't touch other insns referred to by reg-notes;
1859 we will get them elsewhere. */
1862 if (GET_CODE (note) != INSN_LIST)
1864 = walk_fixup_memory_subreg (XEXP (note, 0), insn, 1);
1865 note = XEXP (note, 1);
1869 /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
1870 See if the rtx expression at *LOC in INSN needs to be changed.
1872 REPLACEMENTS is a pointer to a list head that starts out zero, but may
1873 contain a list of original rtx's and replacements. If we find that we need
1874 to modify this insn by replacing a memory reference with a pseudo or by
1875 making a new MEM to implement a SUBREG, we consult that list to see if
1876 we have already chosen a replacement. If none has already been allocated,
1877 we allocate it and update the list. fixup_var_refs_insn will copy VAR
1878 or the SUBREG, as appropriate, to the pseudo. */
1881 fixup_var_refs_1 (var, promoted_mode, loc, insn, replacements)
1883 enum machine_mode promoted_mode;
1886 struct fixup_replacement **replacements;
1890 RTX_CODE code = GET_CODE (x);
1893 struct fixup_replacement *replacement;
1898 if (XEXP (x, 0) == var)
1900 /* Prevent sharing of rtl that might lose. */
1901 rtx sub = copy_rtx (XEXP (var, 0));
1903 if (! validate_change (insn, loc, sub, 0))
1905 rtx y = gen_reg_rtx (GET_MODE (sub));
1908 /* We should be able to replace with a register or all is lost.
1909 Note that we can't use validate_change to verify this, since
1910 we're not caring for replacing all dups simultaneously. */
1911 if (! validate_replace_rtx (*loc, y, insn))
1914 /* Careful! First try to recognize a direct move of the
1915 value, mimicking how things are done in gen_reload wrt
1916 PLUS. Consider what happens when insn is a conditional
1917 move instruction and addsi3 clobbers flags. */
1920 new_insn = emit_insn (gen_rtx_SET (VOIDmode, y, sub));
1921 seq = gen_sequence ();
1924 if (recog_memoized (new_insn) < 0)
1926 /* That failed. Fall back on force_operand and hope. */
1929 sub = force_operand (sub, y);
1931 emit_insn (gen_move_insn (y, sub));
1932 seq = gen_sequence ();
1937 /* Don't separate setter from user. */
1938 if (PREV_INSN (insn) && sets_cc0_p (PREV_INSN (insn)))
1939 insn = PREV_INSN (insn);
1942 emit_insn_before (seq, insn);
1950 /* If we already have a replacement, use it. Otherwise,
1951 try to fix up this address in case it is invalid. */
1953 replacement = find_fixup_replacement (replacements, var);
1954 if (replacement->new)
1956 *loc = replacement->new;
1960 *loc = replacement->new = x = fixup_stack_1 (x, insn);
1962 /* Unless we are forcing memory to register or we changed the mode,
1963 we can leave things the way they are if the insn is valid. */
1965 INSN_CODE (insn) = -1;
1966 if (! flag_force_mem && GET_MODE (x) == promoted_mode
1967 && recog_memoized (insn) >= 0)
1970 *loc = replacement->new = gen_reg_rtx (promoted_mode);
1974 /* If X contains VAR, we need to unshare it here so that we update
1975 each occurrence separately. But all identical MEMs in one insn
1976 must be replaced with the same rtx because of the possibility of
1979 if (reg_mentioned_p (var, x))
1981 replacement = find_fixup_replacement (replacements, x);
1982 if (replacement->new == 0)
1983 replacement->new = copy_most_rtx (x, var);
1985 *loc = x = replacement->new;
1986 code = GET_CODE (x);
2002 /* Note that in some cases those types of expressions are altered
2003 by optimize_bit_field, and do not survive to get here. */
2004 if (XEXP (x, 0) == var
2005 || (GET_CODE (XEXP (x, 0)) == SUBREG
2006 && SUBREG_REG (XEXP (x, 0)) == var))
2008 /* Get TEM as a valid MEM in the mode presently in the insn.
2010 We don't worry about the possibility of MATCH_DUP here; it
2011 is highly unlikely and would be tricky to handle. */
2014 if (GET_CODE (tem) == SUBREG)
2016 if (GET_MODE_BITSIZE (GET_MODE (tem))
2017 > GET_MODE_BITSIZE (GET_MODE (var)))
2019 replacement = find_fixup_replacement (replacements, var);
2020 if (replacement->new == 0)
2021 replacement->new = gen_reg_rtx (GET_MODE (var));
2022 SUBREG_REG (tem) = replacement->new;
2024 /* The following code works only if we have a MEM, so we
2025 need to handle the subreg here. We directly substitute
2026 it assuming that a subreg must be OK here. We already
2027 scheduled a replacement to copy the mem into the
2033 tem = fixup_memory_subreg (tem, insn, 0);
2036 tem = fixup_stack_1 (tem, insn);
2038 /* Unless we want to load from memory, get TEM into the proper mode
2039 for an extract from memory. This can only be done if the
2040 extract is at a constant position and length. */
2042 if (! flag_force_mem && GET_CODE (XEXP (x, 1)) == CONST_INT
2043 && GET_CODE (XEXP (x, 2)) == CONST_INT
2044 && ! mode_dependent_address_p (XEXP (tem, 0))
2045 && ! MEM_VOLATILE_P (tem))
2047 enum machine_mode wanted_mode = VOIDmode;
2048 enum machine_mode is_mode = GET_MODE (tem);
2049 HOST_WIDE_INT pos = INTVAL (XEXP (x, 2));
2051 if (GET_CODE (x) == ZERO_EXTRACT)
2053 enum machine_mode new_mode
2054 = mode_for_extraction (EP_extzv, 1);
2055 if (new_mode != MAX_MACHINE_MODE)
2056 wanted_mode = new_mode;
2058 else if (GET_CODE (x) == SIGN_EXTRACT)
2060 enum machine_mode new_mode
2061 = mode_for_extraction (EP_extv, 1);
2062 if (new_mode != MAX_MACHINE_MODE)
2063 wanted_mode = new_mode;
2066 /* If we have a narrower mode, we can do something. */
2067 if (wanted_mode != VOIDmode
2068 && GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2070 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2071 rtx old_pos = XEXP (x, 2);
2074 /* If the bytes and bits are counted differently, we
2075 must adjust the offset. */
2076 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2077 offset = (GET_MODE_SIZE (is_mode)
2078 - GET_MODE_SIZE (wanted_mode) - offset);
2080 pos %= GET_MODE_BITSIZE (wanted_mode);
2082 newmem = adjust_address_nv (tem, wanted_mode, offset);
2084 /* Make the change and see if the insn remains valid. */
2085 INSN_CODE (insn) = -1;
2086 XEXP (x, 0) = newmem;
2087 XEXP (x, 2) = GEN_INT (pos);
2089 if (recog_memoized (insn) >= 0)
2092 /* Otherwise, restore old position. XEXP (x, 0) will be
2094 XEXP (x, 2) = old_pos;
2098 /* If we get here, the bitfield extract insn can't accept a memory
2099 reference. Copy the input into a register. */
2101 tem1 = gen_reg_rtx (GET_MODE (tem));
2102 emit_insn_before (gen_move_insn (tem1, tem), insn);
2109 if (SUBREG_REG (x) == var)
2111 /* If this is a special SUBREG made because VAR was promoted
2112 from a wider mode, replace it with VAR and call ourself
2113 recursively, this time saying that the object previously
2114 had its current mode (by virtue of the SUBREG). */
2116 if (SUBREG_PROMOTED_VAR_P (x))
2119 fixup_var_refs_1 (var, GET_MODE (var), loc, insn, replacements);
2123 /* If this SUBREG makes VAR wider, it has become a paradoxical
2124 SUBREG with VAR in memory, but these aren't allowed at this
2125 stage of the compilation. So load VAR into a pseudo and take
2126 a SUBREG of that pseudo. */
2127 if (GET_MODE_SIZE (GET_MODE (x)) > GET_MODE_SIZE (GET_MODE (var)))
2129 replacement = find_fixup_replacement (replacements, var);
2130 if (replacement->new == 0)
2131 replacement->new = gen_reg_rtx (promoted_mode);
2132 SUBREG_REG (x) = replacement->new;
2136 /* See if we have already found a replacement for this SUBREG.
2137 If so, use it. Otherwise, make a MEM and see if the insn
2138 is recognized. If not, or if we should force MEM into a register,
2139 make a pseudo for this SUBREG. */
2140 replacement = find_fixup_replacement (replacements, x);
2141 if (replacement->new)
2143 *loc = replacement->new;
2147 replacement->new = *loc = fixup_memory_subreg (x, insn, 0);
2149 INSN_CODE (insn) = -1;
2150 if (! flag_force_mem && recog_memoized (insn) >= 0)
2153 *loc = replacement->new = gen_reg_rtx (GET_MODE (x));
2159 /* First do special simplification of bit-field references. */
2160 if (GET_CODE (SET_DEST (x)) == SIGN_EXTRACT
2161 || GET_CODE (SET_DEST (x)) == ZERO_EXTRACT)
2162 optimize_bit_field (x, insn, 0);
2163 if (GET_CODE (SET_SRC (x)) == SIGN_EXTRACT
2164 || GET_CODE (SET_SRC (x)) == ZERO_EXTRACT)
2165 optimize_bit_field (x, insn, 0);
2167 /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object
2168 into a register and then store it back out. */
2169 if (GET_CODE (SET_DEST (x)) == ZERO_EXTRACT
2170 && GET_CODE (XEXP (SET_DEST (x), 0)) == SUBREG
2171 && SUBREG_REG (XEXP (SET_DEST (x), 0)) == var
2172 && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x), 0)))
2173 > GET_MODE_SIZE (GET_MODE (var))))
2175 replacement = find_fixup_replacement (replacements, var);
2176 if (replacement->new == 0)
2177 replacement->new = gen_reg_rtx (GET_MODE (var));
2179 SUBREG_REG (XEXP (SET_DEST (x), 0)) = replacement->new;
2180 emit_insn_after (gen_move_insn (var, replacement->new), insn);
2183 /* If SET_DEST is now a paradoxical SUBREG, put the result of this
2184 insn into a pseudo and store the low part of the pseudo into VAR. */
2185 if (GET_CODE (SET_DEST (x)) == SUBREG
2186 && SUBREG_REG (SET_DEST (x)) == var
2187 && (GET_MODE_SIZE (GET_MODE (SET_DEST (x)))
2188 > GET_MODE_SIZE (GET_MODE (var))))
2190 SET_DEST (x) = tem = gen_reg_rtx (GET_MODE (SET_DEST (x)));
2191 emit_insn_after (gen_move_insn (var, gen_lowpart (GET_MODE (var),
2198 rtx dest = SET_DEST (x);
2199 rtx src = SET_SRC (x);
2200 rtx outerdest = dest;
2202 while (GET_CODE (dest) == SUBREG || GET_CODE (dest) == STRICT_LOW_PART
2203 || GET_CODE (dest) == SIGN_EXTRACT
2204 || GET_CODE (dest) == ZERO_EXTRACT)
2205 dest = XEXP (dest, 0);
2207 if (GET_CODE (src) == SUBREG)
2208 src = SUBREG_REG (src);
2210 /* If VAR does not appear at the top level of the SET
2211 just scan the lower levels of the tree. */
2213 if (src != var && dest != var)
2216 /* We will need to rerecognize this insn. */
2217 INSN_CODE (insn) = -1;
2219 if (GET_CODE (outerdest) == ZERO_EXTRACT && dest == var
2220 && mode_for_extraction (EP_insv, -1) != MAX_MACHINE_MODE)
2222 /* Since this case will return, ensure we fixup all the
2224 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 1),
2225 insn, replacements);
2226 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 2),
2227 insn, replacements);
2228 fixup_var_refs_1 (var, promoted_mode, &SET_SRC (x),
2229 insn, replacements);
2231 tem = XEXP (outerdest, 0);
2233 /* Clean up (SUBREG:SI (MEM:mode ...) 0)
2234 that may appear inside a ZERO_EXTRACT.
2235 This was legitimate when the MEM was a REG. */
2236 if (GET_CODE (tem) == SUBREG
2237 && SUBREG_REG (tem) == var)
2238 tem = fixup_memory_subreg (tem, insn, 0);
2240 tem = fixup_stack_1 (tem, insn);
2242 if (GET_CODE (XEXP (outerdest, 1)) == CONST_INT
2243 && GET_CODE (XEXP (outerdest, 2)) == CONST_INT
2244 && ! mode_dependent_address_p (XEXP (tem, 0))
2245 && ! MEM_VOLATILE_P (tem))
2247 enum machine_mode wanted_mode;
2248 enum machine_mode is_mode = GET_MODE (tem);
2249 HOST_WIDE_INT pos = INTVAL (XEXP (outerdest, 2));
2251 wanted_mode = mode_for_extraction (EP_insv, 0);
2253 /* If we have a narrower mode, we can do something. */
2254 if (GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2256 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2257 rtx old_pos = XEXP (outerdest, 2);
2260 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2261 offset = (GET_MODE_SIZE (is_mode)
2262 - GET_MODE_SIZE (wanted_mode) - offset);
2264 pos %= GET_MODE_BITSIZE (wanted_mode);
2266 newmem = adjust_address_nv (tem, wanted_mode, offset);
2268 /* Make the change and see if the insn remains valid. */
2269 INSN_CODE (insn) = -1;
2270 XEXP (outerdest, 0) = newmem;
2271 XEXP (outerdest, 2) = GEN_INT (pos);
2273 if (recog_memoized (insn) >= 0)
2276 /* Otherwise, restore old position. XEXP (x, 0) will be
2278 XEXP (outerdest, 2) = old_pos;
2282 /* If we get here, the bit-field store doesn't allow memory
2283 or isn't located at a constant position. Load the value into
2284 a register, do the store, and put it back into memory. */
2286 tem1 = gen_reg_rtx (GET_MODE (tem));
2287 emit_insn_before (gen_move_insn (tem1, tem), insn);
2288 emit_insn_after (gen_move_insn (tem, tem1), insn);
2289 XEXP (outerdest, 0) = tem1;
2293 /* STRICT_LOW_PART is a no-op on memory references
2294 and it can cause combinations to be unrecognizable,
2297 if (dest == var && GET_CODE (SET_DEST (x)) == STRICT_LOW_PART)
2298 SET_DEST (x) = XEXP (SET_DEST (x), 0);
2300 /* A valid insn to copy VAR into or out of a register
2301 must be left alone, to avoid an infinite loop here.
2302 If the reference to VAR is by a subreg, fix that up,
2303 since SUBREG is not valid for a memref.
2304 Also fix up the address of the stack slot.
2306 Note that we must not try to recognize the insn until
2307 after we know that we have valid addresses and no
2308 (subreg (mem ...) ...) constructs, since these interfere
2309 with determining the validity of the insn. */
2311 if ((SET_SRC (x) == var
2312 || (GET_CODE (SET_SRC (x)) == SUBREG
2313 && SUBREG_REG (SET_SRC (x)) == var))
2314 && (GET_CODE (SET_DEST (x)) == REG
2315 || (GET_CODE (SET_DEST (x)) == SUBREG
2316 && GET_CODE (SUBREG_REG (SET_DEST (x))) == REG))
2317 && GET_MODE (var) == promoted_mode
2318 && x == single_set (insn))
2322 replacement = find_fixup_replacement (replacements, SET_SRC (x));
2323 if (replacement->new)
2324 SET_SRC (x) = replacement->new;
2325 else if (GET_CODE (SET_SRC (x)) == SUBREG)
2326 SET_SRC (x) = replacement->new
2327 = fixup_memory_subreg (SET_SRC (x), insn, 0);
2329 SET_SRC (x) = replacement->new
2330 = fixup_stack_1 (SET_SRC (x), insn);
2332 if (recog_memoized (insn) >= 0)
2335 /* INSN is not valid, but we know that we want to
2336 copy SET_SRC (x) to SET_DEST (x) in some way. So
2337 we generate the move and see whether it requires more
2338 than one insn. If it does, we emit those insns and
2339 delete INSN. Otherwise, we an just replace the pattern
2340 of INSN; we have already verified above that INSN has
2341 no other function that to do X. */
2343 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2344 if (GET_CODE (pat) == SEQUENCE)
2346 last = emit_insn_before (pat, insn);
2348 /* INSN might have REG_RETVAL or other important notes, so
2349 we need to store the pattern of the last insn in the
2350 sequence into INSN similarly to the normal case. LAST
2351 should not have REG_NOTES, but we allow them if INSN has
2353 if (REG_NOTES (last) && REG_NOTES (insn))
2355 if (REG_NOTES (last))
2356 REG_NOTES (insn) = REG_NOTES (last);
2357 PATTERN (insn) = PATTERN (last);
2362 PATTERN (insn) = pat;
2367 if ((SET_DEST (x) == var
2368 || (GET_CODE (SET_DEST (x)) == SUBREG
2369 && SUBREG_REG (SET_DEST (x)) == var))
2370 && (GET_CODE (SET_SRC (x)) == REG
2371 || (GET_CODE (SET_SRC (x)) == SUBREG
2372 && GET_CODE (SUBREG_REG (SET_SRC (x))) == REG))
2373 && GET_MODE (var) == promoted_mode
2374 && x == single_set (insn))
2378 if (GET_CODE (SET_DEST (x)) == SUBREG)
2379 SET_DEST (x) = fixup_memory_subreg (SET_DEST (x), insn, 0);
2381 SET_DEST (x) = fixup_stack_1 (SET_DEST (x), insn);
2383 if (recog_memoized (insn) >= 0)
2386 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2387 if (GET_CODE (pat) == SEQUENCE)
2389 last = emit_insn_before (pat, insn);
2391 /* INSN might have REG_RETVAL or other important notes, so
2392 we need to store the pattern of the last insn in the
2393 sequence into INSN similarly to the normal case. LAST
2394 should not have REG_NOTES, but we allow them if INSN has
2396 if (REG_NOTES (last) && REG_NOTES (insn))
2398 if (REG_NOTES (last))
2399 REG_NOTES (insn) = REG_NOTES (last);
2400 PATTERN (insn) = PATTERN (last);
2405 PATTERN (insn) = pat;
2410 /* Otherwise, storing into VAR must be handled specially
2411 by storing into a temporary and copying that into VAR
2412 with a new insn after this one. Note that this case
2413 will be used when storing into a promoted scalar since
2414 the insn will now have different modes on the input
2415 and output and hence will be invalid (except for the case
2416 of setting it to a constant, which does not need any
2417 change if it is valid). We generate extra code in that case,
2418 but combine.c will eliminate it. */
2423 rtx fixeddest = SET_DEST (x);
2425 /* STRICT_LOW_PART can be discarded, around a MEM. */
2426 if (GET_CODE (fixeddest) == STRICT_LOW_PART)
2427 fixeddest = XEXP (fixeddest, 0);
2428 /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */
2429 if (GET_CODE (fixeddest) == SUBREG)
2431 fixeddest = fixup_memory_subreg (fixeddest, insn, 0);
2432 promoted_mode = GET_MODE (fixeddest);
2435 fixeddest = fixup_stack_1 (fixeddest, insn);
2437 temp = gen_reg_rtx (promoted_mode);
2439 emit_insn_after (gen_move_insn (fixeddest,
2440 gen_lowpart (GET_MODE (fixeddest),
2444 SET_DEST (x) = temp;
2452 /* Nothing special about this RTX; fix its operands. */
2454 fmt = GET_RTX_FORMAT (code);
2455 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2458 fixup_var_refs_1 (var, promoted_mode, &XEXP (x, i), insn, replacements);
2459 else if (fmt[i] == 'E')
2462 for (j = 0; j < XVECLEN (x, i); j++)
2463 fixup_var_refs_1 (var, promoted_mode, &XVECEXP (x, i, j),
2464 insn, replacements);
2469 /* Given X, an rtx of the form (SUBREG:m1 (MEM:m2 addr)),
2470 return an rtx (MEM:m1 newaddr) which is equivalent.
2471 If any insns must be emitted to compute NEWADDR, put them before INSN.
2473 UNCRITICAL nonzero means accept paradoxical subregs.
2474 This is used for subregs found inside REG_NOTES. */
2477 fixup_memory_subreg (x, insn, uncritical)
2482 int offset = SUBREG_BYTE (x);
2483 rtx addr = XEXP (SUBREG_REG (x), 0);
2484 enum machine_mode mode = GET_MODE (x);
2487 /* Paradoxical SUBREGs are usually invalid during RTL generation. */
2488 if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (GET_MODE (SUBREG_REG (x)))
2492 if (!flag_force_addr
2493 && memory_address_p (mode, plus_constant (addr, offset)))
2494 /* Shortcut if no insns need be emitted. */
2495 return adjust_address (SUBREG_REG (x), mode, offset);
2498 result = adjust_address (SUBREG_REG (x), mode, offset);
2499 emit_insn_before (gen_sequence (), insn);
2504 /* Do fixup_memory_subreg on all (SUBREG (MEM ...) ...) contained in X.
2505 Replace subexpressions of X in place.
2506 If X itself is a (SUBREG (MEM ...) ...), return the replacement expression.
2507 Otherwise return X, with its contents possibly altered.
2509 If any insns must be emitted to compute NEWADDR, put them before INSN.
2511 UNCRITICAL is as in fixup_memory_subreg. */
2514 walk_fixup_memory_subreg (x, insn, uncritical)
2526 code = GET_CODE (x);
2528 if (code == SUBREG && GET_CODE (SUBREG_REG (x)) == MEM)
2529 return fixup_memory_subreg (x, insn, uncritical);
2531 /* Nothing special about this RTX; fix its operands. */
2533 fmt = GET_RTX_FORMAT (code);
2534 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2537 XEXP (x, i) = walk_fixup_memory_subreg (XEXP (x, i), insn, uncritical);
2538 else if (fmt[i] == 'E')
2541 for (j = 0; j < XVECLEN (x, i); j++)
2543 = walk_fixup_memory_subreg (XVECEXP (x, i, j), insn, uncritical);
2549 /* For each memory ref within X, if it refers to a stack slot
2550 with an out of range displacement, put the address in a temp register
2551 (emitting new insns before INSN to load these registers)
2552 and alter the memory ref to use that register.
2553 Replace each such MEM rtx with a copy, to avoid clobberage. */
2556 fixup_stack_1 (x, insn)
2561 RTX_CODE code = GET_CODE (x);
2566 rtx ad = XEXP (x, 0);
2567 /* If we have address of a stack slot but it's not valid
2568 (displacement is too large), compute the sum in a register. */
2569 if (GET_CODE (ad) == PLUS
2570 && GET_CODE (XEXP (ad, 0)) == REG
2571 && ((REGNO (XEXP (ad, 0)) >= FIRST_VIRTUAL_REGISTER
2572 && REGNO (XEXP (ad, 0)) <= LAST_VIRTUAL_REGISTER)
2573 || REGNO (XEXP (ad, 0)) == FRAME_POINTER_REGNUM
2574 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2575 || REGNO (XEXP (ad, 0)) == HARD_FRAME_POINTER_REGNUM
2577 || REGNO (XEXP (ad, 0)) == STACK_POINTER_REGNUM
2578 || REGNO (XEXP (ad, 0)) == ARG_POINTER_REGNUM
2579 || XEXP (ad, 0) == current_function_internal_arg_pointer)
2580 && GET_CODE (XEXP (ad, 1)) == CONST_INT)
2583 if (memory_address_p (GET_MODE (x), ad))
2587 temp = copy_to_reg (ad);
2588 seq = gen_sequence ();
2590 emit_insn_before (seq, insn);
2591 return replace_equiv_address (x, temp);
2596 fmt = GET_RTX_FORMAT (code);
2597 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2600 XEXP (x, i) = fixup_stack_1 (XEXP (x, i), insn);
2601 else if (fmt[i] == 'E')
2604 for (j = 0; j < XVECLEN (x, i); j++)
2605 XVECEXP (x, i, j) = fixup_stack_1 (XVECEXP (x, i, j), insn);
2611 /* Optimization: a bit-field instruction whose field
2612 happens to be a byte or halfword in memory
2613 can be changed to a move instruction.
2615 We call here when INSN is an insn to examine or store into a bit-field.
2616 BODY is the SET-rtx to be altered.
2618 EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0.
2619 (Currently this is called only from function.c, and EQUIV_MEM
2623 optimize_bit_field (body, insn, equiv_mem)
2631 enum machine_mode mode;
2633 if (GET_CODE (SET_DEST (body)) == SIGN_EXTRACT
2634 || GET_CODE (SET_DEST (body)) == ZERO_EXTRACT)
2635 bitfield = SET_DEST (body), destflag = 1;
2637 bitfield = SET_SRC (body), destflag = 0;
2639 /* First check that the field being stored has constant size and position
2640 and is in fact a byte or halfword suitably aligned. */
2642 if (GET_CODE (XEXP (bitfield, 1)) == CONST_INT
2643 && GET_CODE (XEXP (bitfield, 2)) == CONST_INT
2644 && ((mode = mode_for_size (INTVAL (XEXP (bitfield, 1)), MODE_INT, 1))
2646 && INTVAL (XEXP (bitfield, 2)) % INTVAL (XEXP (bitfield, 1)) == 0)
2650 /* Now check that the containing word is memory, not a register,
2651 and that it is safe to change the machine mode. */
2653 if (GET_CODE (XEXP (bitfield, 0)) == MEM)
2654 memref = XEXP (bitfield, 0);
2655 else if (GET_CODE (XEXP (bitfield, 0)) == REG
2657 memref = equiv_mem[REGNO (XEXP (bitfield, 0))];
2658 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2659 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == MEM)
2660 memref = SUBREG_REG (XEXP (bitfield, 0));
2661 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2663 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == REG)
2664 memref = equiv_mem[REGNO (SUBREG_REG (XEXP (bitfield, 0)))];
2667 && ! mode_dependent_address_p (XEXP (memref, 0))
2668 && ! MEM_VOLATILE_P (memref))
2670 /* Now adjust the address, first for any subreg'ing
2671 that we are now getting rid of,
2672 and then for which byte of the word is wanted. */
2674 HOST_WIDE_INT offset = INTVAL (XEXP (bitfield, 2));
2677 /* Adjust OFFSET to count bits from low-address byte. */
2678 if (BITS_BIG_ENDIAN != BYTES_BIG_ENDIAN)
2679 offset = (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield, 0)))
2680 - offset - INTVAL (XEXP (bitfield, 1)));
2682 /* Adjust OFFSET to count bytes from low-address byte. */
2683 offset /= BITS_PER_UNIT;
2684 if (GET_CODE (XEXP (bitfield, 0)) == SUBREG)
2686 offset += (SUBREG_BYTE (XEXP (bitfield, 0))
2687 / UNITS_PER_WORD) * UNITS_PER_WORD;
2688 if (BYTES_BIG_ENDIAN)
2689 offset -= (MIN (UNITS_PER_WORD,
2690 GET_MODE_SIZE (GET_MODE (XEXP (bitfield, 0))))
2691 - MIN (UNITS_PER_WORD,
2692 GET_MODE_SIZE (GET_MODE (memref))));
2696 memref = adjust_address (memref, mode, offset);
2697 insns = get_insns ();
2699 emit_insns_before (insns, insn);
2701 /* Store this memory reference where
2702 we found the bit field reference. */
2706 validate_change (insn, &SET_DEST (body), memref, 1);
2707 if (! CONSTANT_ADDRESS_P (SET_SRC (body)))
2709 rtx src = SET_SRC (body);
2710 while (GET_CODE (src) == SUBREG
2711 && SUBREG_BYTE (src) == 0)
2712 src = SUBREG_REG (src);
2713 if (GET_MODE (src) != GET_MODE (memref))
2714 src = gen_lowpart (GET_MODE (memref), SET_SRC (body));
2715 validate_change (insn, &SET_SRC (body), src, 1);
2717 else if (GET_MODE (SET_SRC (body)) != VOIDmode
2718 && GET_MODE (SET_SRC (body)) != GET_MODE (memref))
2719 /* This shouldn't happen because anything that didn't have
2720 one of these modes should have got converted explicitly
2721 and then referenced through a subreg.
2722 This is so because the original bit-field was
2723 handled by agg_mode and so its tree structure had
2724 the same mode that memref now has. */
2729 rtx dest = SET_DEST (body);
2731 while (GET_CODE (dest) == SUBREG
2732 && SUBREG_BYTE (dest) == 0
2733 && (GET_MODE_CLASS (GET_MODE (dest))
2734 == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest))))
2735 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2737 dest = SUBREG_REG (dest);
2739 validate_change (insn, &SET_DEST (body), dest, 1);
2741 if (GET_MODE (dest) == GET_MODE (memref))
2742 validate_change (insn, &SET_SRC (body), memref, 1);
2745 /* Convert the mem ref to the destination mode. */
2746 rtx newreg = gen_reg_rtx (GET_MODE (dest));
2749 convert_move (newreg, memref,
2750 GET_CODE (SET_SRC (body)) == ZERO_EXTRACT);
2754 validate_change (insn, &SET_SRC (body), newreg, 1);
2758 /* See if we can convert this extraction or insertion into
2759 a simple move insn. We might not be able to do so if this
2760 was, for example, part of a PARALLEL.
2762 If we succeed, write out any needed conversions. If we fail,
2763 it is hard to guess why we failed, so don't do anything
2764 special; just let the optimization be suppressed. */
2766 if (apply_change_group () && seq)
2767 emit_insns_before (seq, insn);
2772 /* These routines are responsible for converting virtual register references
2773 to the actual hard register references once RTL generation is complete.
2775 The following four variables are used for communication between the
2776 routines. They contain the offsets of the virtual registers from their
2777 respective hard registers. */
2779 static int in_arg_offset;
2780 static int var_offset;
2781 static int dynamic_offset;
2782 static int out_arg_offset;
2783 static int cfa_offset;
2785 /* In most machines, the stack pointer register is equivalent to the bottom
2788 #ifndef STACK_POINTER_OFFSET
2789 #define STACK_POINTER_OFFSET 0
2792 /* If not defined, pick an appropriate default for the offset of dynamically
2793 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
2794 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
2796 #ifndef STACK_DYNAMIC_OFFSET
2798 /* The bottom of the stack points to the actual arguments. If
2799 REG_PARM_STACK_SPACE is defined, this includes the space for the register
2800 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
2801 stack space for register parameters is not pushed by the caller, but
2802 rather part of the fixed stack areas and hence not included in
2803 `current_function_outgoing_args_size'. Nevertheless, we must allow
2804 for it when allocating stack dynamic objects. */
2806 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2807 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2808 ((ACCUMULATE_OUTGOING_ARGS \
2809 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
2810 + (STACK_POINTER_OFFSET)) \
2813 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2814 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
2815 + (STACK_POINTER_OFFSET))
2819 /* On most machines, the CFA coincides with the first incoming parm. */
2821 #ifndef ARG_POINTER_CFA_OFFSET
2822 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
2825 /* Build up a (MEM (ADDRESSOF (REG))) rtx for a register REG that just had
2826 its address taken. DECL is the decl for the object stored in the
2827 register, for later use if we do need to force REG into the stack.
2828 REG is overwritten by the MEM like in put_reg_into_stack. */
2831 gen_mem_addressof (reg, decl)
2835 rtx r = gen_rtx_ADDRESSOF (Pmode, gen_reg_rtx (GET_MODE (reg)),
2838 /* Calculate this before we start messing with decl's RTL. */
2839 HOST_WIDE_INT set = decl ? get_alias_set (decl) : 0;
2841 /* If the original REG was a user-variable, then so is the REG whose
2842 address is being taken. Likewise for unchanging. */
2843 REG_USERVAR_P (XEXP (r, 0)) = REG_USERVAR_P (reg);
2844 RTX_UNCHANGING_P (XEXP (r, 0)) = RTX_UNCHANGING_P (reg);
2846 PUT_CODE (reg, MEM);
2847 MEM_ATTRS (reg) = 0;
2852 tree type = TREE_TYPE (decl);
2853 enum machine_mode decl_mode
2854 = (TREE_CODE (decl) == SAVE_EXPR ? TYPE_MODE (TREE_TYPE (decl))
2855 : DECL_MODE (decl));
2856 rtx decl_rtl = decl ? DECL_RTL_IF_SET (decl) : 0;
2858 PUT_MODE (reg, decl_mode);
2860 /* Clear DECL_RTL momentarily so functions below will work
2861 properly, then set it again. */
2862 if (decl_rtl == reg)
2863 SET_DECL_RTL (decl, 0);
2865 set_mem_attributes (reg, decl, 1);
2866 set_mem_alias_set (reg, set);
2868 if (decl_rtl == reg)
2869 SET_DECL_RTL (decl, reg);
2871 if (TREE_USED (decl) || DECL_INITIAL (decl) != 0)
2872 fixup_var_refs (reg, GET_MODE (reg), TREE_UNSIGNED (type), 0);
2875 fixup_var_refs (reg, GET_MODE (reg), 0, 0);
2880 /* If DECL has an RTL that is an ADDRESSOF rtx, put it into the stack. */
2883 flush_addressof (decl)
2886 if ((TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == VAR_DECL)
2887 && DECL_RTL (decl) != 0
2888 && GET_CODE (DECL_RTL (decl)) == MEM
2889 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF
2890 && GET_CODE (XEXP (XEXP (DECL_RTL (decl), 0), 0)) == REG)
2891 put_addressof_into_stack (XEXP (DECL_RTL (decl), 0), 0);
2894 /* Force the register pointed to by R, an ADDRESSOF rtx, into the stack. */
2897 put_addressof_into_stack (r, ht)
2899 struct hash_table *ht;
2902 int volatile_p, used_p;
2904 rtx reg = XEXP (r, 0);
2906 if (GET_CODE (reg) != REG)
2909 decl = ADDRESSOF_DECL (r);
2912 type = TREE_TYPE (decl);
2913 volatile_p = (TREE_CODE (decl) != SAVE_EXPR
2914 && TREE_THIS_VOLATILE (decl));
2915 used_p = (TREE_USED (decl)
2916 || (TREE_CODE (decl) != SAVE_EXPR
2917 && DECL_INITIAL (decl) != 0));
2926 put_reg_into_stack (0, reg, type, GET_MODE (reg), GET_MODE (reg),
2927 volatile_p, ADDRESSOF_REGNO (r), used_p, ht);
2930 /* List of replacements made below in purge_addressof_1 when creating
2931 bitfield insertions. */
2932 static rtx purge_bitfield_addressof_replacements;
2934 /* List of replacements made below in purge_addressof_1 for patterns
2935 (MEM (ADDRESSOF (REG ...))). The key of the list entry is the
2936 corresponding (ADDRESSOF (REG ...)) and value is a substitution for
2937 the all pattern. List PURGE_BITFIELD_ADDRESSOF_REPLACEMENTS is not
2938 enough in complex cases, e.g. when some field values can be
2939 extracted by usage MEM with narrower mode. */
2940 static rtx purge_addressof_replacements;
2942 /* Helper function for purge_addressof. See if the rtx expression at *LOC
2943 in INSN needs to be changed. If FORCE, always put any ADDRESSOFs into
2944 the stack. If the function returns FALSE then the replacement could not
2948 purge_addressof_1 (loc, insn, force, store, ht)
2952 struct hash_table *ht;
2960 /* Re-start here to avoid recursion in common cases. */
2967 code = GET_CODE (x);
2969 /* If we don't return in any of the cases below, we will recurse inside
2970 the RTX, which will normally result in any ADDRESSOF being forced into
2974 result = purge_addressof_1 (&SET_DEST (x), insn, force, 1, ht);
2975 result &= purge_addressof_1 (&SET_SRC (x), insn, force, 0, ht);
2978 else if (code == ADDRESSOF)
2982 if (GET_CODE (XEXP (x, 0)) != MEM)
2984 put_addressof_into_stack (x, ht);
2988 /* We must create a copy of the rtx because it was created by
2989 overwriting a REG rtx which is always shared. */
2990 sub = copy_rtx (XEXP (XEXP (x, 0), 0));
2991 if (validate_change (insn, loc, sub, 0)
2992 || validate_replace_rtx (x, sub, insn))
2996 sub = force_operand (sub, NULL_RTX);
2997 if (! validate_change (insn, loc, sub, 0)
2998 && ! validate_replace_rtx (x, sub, insn))
3001 insns = gen_sequence ();
3003 emit_insn_before (insns, insn);
3007 else if (code == MEM && GET_CODE (XEXP (x, 0)) == ADDRESSOF && ! force)
3009 rtx sub = XEXP (XEXP (x, 0), 0);
3011 if (GET_CODE (sub) == MEM)
3012 sub = adjust_address_nv (sub, GET_MODE (x), 0);
3013 else if (GET_CODE (sub) == REG
3014 && (MEM_VOLATILE_P (x) || GET_MODE (x) == BLKmode))
3016 else if (GET_CODE (sub) == REG && GET_MODE (x) != GET_MODE (sub))
3018 int size_x, size_sub;
3022 /* When processing REG_NOTES look at the list of
3023 replacements done on the insn to find the register that X
3027 for (tem = purge_bitfield_addressof_replacements;
3029 tem = XEXP (XEXP (tem, 1), 1))
3030 if (rtx_equal_p (x, XEXP (tem, 0)))
3032 *loc = XEXP (XEXP (tem, 1), 0);
3036 /* See comment for purge_addressof_replacements. */
3037 for (tem = purge_addressof_replacements;
3039 tem = XEXP (XEXP (tem, 1), 1))
3040 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3042 rtx z = XEXP (XEXP (tem, 1), 0);
3044 if (GET_MODE (x) == GET_MODE (z)
3045 || (GET_CODE (XEXP (XEXP (tem, 1), 0)) != REG
3046 && GET_CODE (XEXP (XEXP (tem, 1), 0)) != SUBREG))
3049 /* It can happen that the note may speak of things
3050 in a wider (or just different) mode than the
3051 code did. This is especially true of
3054 if (GET_CODE (z) == SUBREG && SUBREG_BYTE (z) == 0)
3057 if (GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD
3058 && (GET_MODE_SIZE (GET_MODE (x))
3059 > GET_MODE_SIZE (GET_MODE (z))))
3061 /* This can occur as a result in invalid
3062 pointer casts, e.g. float f; ...
3063 *(long long int *)&f.
3064 ??? We could emit a warning here, but
3065 without a line number that wouldn't be
3067 z = gen_rtx_SUBREG (GET_MODE (x), z, 0);
3070 z = gen_lowpart (GET_MODE (x), z);
3076 /* Sometimes we may not be able to find the replacement. For
3077 example when the original insn was a MEM in a wider mode,
3078 and the note is part of a sign extension of a narrowed
3079 version of that MEM. Gcc testcase compile/990829-1.c can
3080 generate an example of this siutation. Rather than complain
3081 we return false, which will prompt our caller to remove the
3086 size_x = GET_MODE_BITSIZE (GET_MODE (x));
3087 size_sub = GET_MODE_BITSIZE (GET_MODE (sub));
3089 /* Don't even consider working with paradoxical subregs,
3090 or the moral equivalent seen here. */
3091 if (size_x <= size_sub
3092 && int_mode_for_mode (GET_MODE (sub)) != BLKmode)
3094 /* Do a bitfield insertion to mirror what would happen
3101 rtx p = PREV_INSN (insn);
3104 val = gen_reg_rtx (GET_MODE (x));
3105 if (! validate_change (insn, loc, val, 0))
3107 /* Discard the current sequence and put the
3108 ADDRESSOF on stack. */
3112 seq = gen_sequence ();
3114 emit_insn_before (seq, insn);
3115 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3119 store_bit_field (sub, size_x, 0, GET_MODE (x),
3120 val, GET_MODE_SIZE (GET_MODE (sub)),
3121 GET_MODE_ALIGNMENT (GET_MODE (sub)));
3123 /* Make sure to unshare any shared rtl that store_bit_field
3124 might have created. */
3125 unshare_all_rtl_again (get_insns ());
3127 seq = gen_sequence ();
3129 p = emit_insn_after (seq, insn);
3130 if (NEXT_INSN (insn))
3131 compute_insns_for_mem (NEXT_INSN (insn),
3132 p ? NEXT_INSN (p) : NULL_RTX,
3137 rtx p = PREV_INSN (insn);
3140 val = extract_bit_field (sub, size_x, 0, 1, NULL_RTX,
3141 GET_MODE (x), GET_MODE (x),
3142 GET_MODE_SIZE (GET_MODE (sub)),
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 proessing. */
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 appropriet 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 requivalent 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. */
3986 case STRICT_LOW_PART:
3988 case PRE_DEC: case PRE_INC: case POST_DEC: case POST_INC:
3989 case SIGN_EXTEND: case ZERO_EXTEND:
3990 case TRUNCATE: case FLOAT_EXTEND: case FLOAT_TRUNCATE:
3991 case FLOAT: case FIX:
3992 case UNSIGNED_FIX: case UNSIGNED_FLOAT:
3996 /* These case either have just one operand or we know that we need not
3997 check the rest of the operands. */
4003 /* If the operand is a MEM, see if the change is a valid MEM. If not,
4004 go ahead and make the invalid one, but do it to a copy. For a REG,
4005 just make the recursive call, since there's no chance of a problem. */
4007 if ((GET_CODE (XEXP (x, 0)) == MEM
4008 && instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), XEXP (x, 0),
4010 || (GET_CODE (XEXP (x, 0)) == REG
4011 && instantiate_virtual_regs_1 (&XEXP (x, 0), object, 0)))
4014 XEXP (x, 0) = copy_rtx (XEXP (x, 0));
4019 /* Try to replace with a PLUS. If that doesn't work, compute the sum
4020 in front of this insn and substitute the temporary. */
4021 if ((new = instantiate_new_reg (x, &offset)) != 0)
4023 temp = plus_constant (new, offset);
4024 if (!validate_change (object, loc, temp, 0))
4030 temp = force_operand (temp, NULL_RTX);
4034 emit_insns_before (seq, object);
4035 if (! validate_change (object, loc, temp, 0)
4036 && ! validate_replace_rtx (x, temp, object))
4044 if (GET_CODE (XEXP (x, 0)) == REG)
4047 else if (GET_CODE (XEXP (x, 0)) == MEM)
4049 /* If we have a (addressof (mem ..)), do any instantiation inside
4050 since we know we'll be making the inside valid when we finally
4051 remove the ADDRESSOF. */
4052 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), NULL_RTX, 0);
4061 /* Scan all subexpressions. */
4062 fmt = GET_RTX_FORMAT (code);
4063 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
4066 if (!instantiate_virtual_regs_1 (&XEXP (x, i), object, extra_insns))
4069 else if (*fmt == 'E')
4070 for (j = 0; j < XVECLEN (x, i); j++)
4071 if (! instantiate_virtual_regs_1 (&XVECEXP (x, i, j), object,
4078 /* Optimization: assuming this function does not receive nonlocal gotos,
4079 delete the handlers for such, as well as the insns to establish
4080 and disestablish them. */
4086 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4088 /* Delete the handler by turning off the flag that would
4089 prevent jump_optimize from deleting it.
4090 Also permit deletion of the nonlocal labels themselves
4091 if nothing local refers to them. */
4092 if (GET_CODE (insn) == CODE_LABEL)
4096 LABEL_PRESERVE_P (insn) = 0;
4098 /* Remove it from the nonlocal_label list, to avoid confusing
4100 for (t = nonlocal_labels, last_t = 0; t;
4101 last_t = t, t = TREE_CHAIN (t))
4102 if (DECL_RTL (TREE_VALUE (t)) == insn)
4107 nonlocal_labels = TREE_CHAIN (nonlocal_labels);
4109 TREE_CHAIN (last_t) = TREE_CHAIN (t);
4112 if (GET_CODE (insn) == INSN)
4116 for (t = nonlocal_goto_handler_slots; t != 0; t = XEXP (t, 1))
4117 if (reg_mentioned_p (t, PATTERN (insn)))
4123 || (nonlocal_goto_stack_level != 0
4124 && reg_mentioned_p (nonlocal_goto_stack_level,
4126 delete_related_insns (insn);
4134 return max_parm_reg;
4137 /* Return the first insn following those generated by `assign_parms'. */
4140 get_first_nonparm_insn ()
4143 return NEXT_INSN (last_parm_insn);
4144 return get_insns ();
4147 /* Return the first NOTE_INSN_BLOCK_BEG note in the function.
4148 Crash if there is none. */
4151 get_first_block_beg ()
4154 rtx insn = get_first_nonparm_insn ();
4156 for (searcher = insn; searcher; searcher = NEXT_INSN (searcher))
4157 if (GET_CODE (searcher) == NOTE
4158 && NOTE_LINE_NUMBER (searcher) == NOTE_INSN_BLOCK_BEG)
4161 abort (); /* Invalid call to this function. (See comments above.) */
4165 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
4166 This means a type for which function calls must pass an address to the
4167 function or get an address back from the function.
4168 EXP may be a type node or an expression (whose type is tested). */
4171 aggregate_value_p (exp)
4174 int i, regno, nregs;
4177 tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
4179 if (TREE_CODE (type) == VOID_TYPE)
4181 if (RETURN_IN_MEMORY (type))
4183 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
4184 and thus can't be returned in registers. */
4185 if (TREE_ADDRESSABLE (type))
4187 if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
4189 /* Make sure we have suitable call-clobbered regs to return
4190 the value in; if not, we must return it in memory. */
4191 reg = hard_function_value (type, 0, 0);
4193 /* If we have something other than a REG (e.g. a PARALLEL), then assume
4195 if (GET_CODE (reg) != REG)
4198 regno = REGNO (reg);
4199 nregs = HARD_REGNO_NREGS (regno, TYPE_MODE (type));
4200 for (i = 0; i < nregs; i++)
4201 if (! call_used_regs[regno + i])
4206 /* Assign RTL expressions to the function's parameters.
4207 This may involve copying them into registers and using
4208 those registers as the RTL for them. */
4211 assign_parms (fndecl)
4217 CUMULATIVE_ARGS args_so_far;
4218 enum machine_mode promoted_mode, passed_mode;
4219 enum machine_mode nominal_mode, promoted_nominal_mode;
4221 /* Total space needed so far for args on the stack,
4222 given as a constant and a tree-expression. */
4223 struct args_size stack_args_size;
4224 tree fntype = TREE_TYPE (fndecl);
4225 tree fnargs = DECL_ARGUMENTS (fndecl);
4226 /* This is used for the arg pointer when referring to stack args. */
4227 rtx internal_arg_pointer;
4228 /* This is a dummy PARM_DECL that we used for the function result if
4229 the function returns a structure. */
4230 tree function_result_decl = 0;
4231 #ifdef SETUP_INCOMING_VARARGS
4232 int varargs_setup = 0;
4234 rtx conversion_insns = 0;
4235 struct args_size alignment_pad;
4237 /* Nonzero if the last arg is named `__builtin_va_alist',
4238 which is used on some machines for old-fashioned non-ANSI varargs.h;
4239 this should be stuck onto the stack as if it had arrived there. */
4241 = (current_function_varargs
4243 && (parm = tree_last (fnargs)) != 0
4245 && (! strcmp (IDENTIFIER_POINTER (DECL_NAME (parm)),
4246 "__builtin_va_alist")));
4248 /* Nonzero if function takes extra anonymous args.
4249 This means the last named arg must be on the stack
4250 right before the anonymous ones. */
4252 = (TYPE_ARG_TYPES (fntype) != 0
4253 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
4254 != void_type_node));
4256 current_function_stdarg = stdarg;
4258 /* If the reg that the virtual arg pointer will be translated into is
4259 not a fixed reg or is the stack pointer, make a copy of the virtual
4260 arg pointer, and address parms via the copy. The frame pointer is
4261 considered fixed even though it is not marked as such.
4263 The second time through, simply use ap to avoid generating rtx. */
4265 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
4266 || ! (fixed_regs[ARG_POINTER_REGNUM]
4267 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
4268 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
4270 internal_arg_pointer = virtual_incoming_args_rtx;
4271 current_function_internal_arg_pointer = internal_arg_pointer;
4273 stack_args_size.constant = 0;
4274 stack_args_size.var = 0;
4276 /* If struct value address is treated as the first argument, make it so. */
4277 if (aggregate_value_p (DECL_RESULT (fndecl))
4278 && ! current_function_returns_pcc_struct
4279 && struct_value_incoming_rtx == 0)
4281 tree type = build_pointer_type (TREE_TYPE (fntype));
4283 function_result_decl = build_decl (PARM_DECL, NULL_TREE, type);
4285 DECL_ARG_TYPE (function_result_decl) = type;
4286 TREE_CHAIN (function_result_decl) = fnargs;
4287 fnargs = function_result_decl;
4290 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
4291 parm_reg_stack_loc = (rtx *) xcalloc (max_parm_reg, sizeof (rtx));
4293 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
4294 INIT_CUMULATIVE_INCOMING_ARGS (args_so_far, fntype, NULL_RTX);
4296 INIT_CUMULATIVE_ARGS (args_so_far, fntype, NULL_RTX, 0);
4299 /* We haven't yet found an argument that we must push and pretend the
4301 current_function_pretend_args_size = 0;
4303 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
4305 struct args_size stack_offset;
4306 struct args_size arg_size;
4307 int passed_pointer = 0;
4308 int did_conversion = 0;
4309 tree passed_type = DECL_ARG_TYPE (parm);
4310 tree nominal_type = TREE_TYPE (parm);
4313 /* Set LAST_NAMED if this is last named arg before some
4315 int last_named = ((TREE_CHAIN (parm) == 0
4316 || DECL_NAME (TREE_CHAIN (parm)) == 0)
4317 && (stdarg || current_function_varargs));
4318 /* Set NAMED_ARG if this arg should be treated as a named arg. For
4319 most machines, if this is a varargs/stdarg function, then we treat
4320 the last named arg as if it were anonymous too. */
4321 int named_arg = STRICT_ARGUMENT_NAMING ? 1 : ! last_named;
4323 if (TREE_TYPE (parm) == error_mark_node
4324 /* This can happen after weird syntax errors
4325 or if an enum type is defined among the parms. */
4326 || TREE_CODE (parm) != PARM_DECL
4327 || passed_type == NULL)
4329 SET_DECL_RTL (parm, gen_rtx_MEM (BLKmode, const0_rtx));
4330 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4331 TREE_USED (parm) = 1;
4335 /* For varargs.h function, save info about regs and stack space
4336 used by the individual args, not including the va_alist arg. */
4337 if (hide_last_arg && last_named)
4338 current_function_args_info = args_so_far;
4340 /* Find mode of arg as it is passed, and mode of arg
4341 as it should be during execution of this function. */
4342 passed_mode = TYPE_MODE (passed_type);
4343 nominal_mode = TYPE_MODE (nominal_type);
4345 /* If the parm's mode is VOID, its value doesn't matter,
4346 and avoid the usual things like emit_move_insn that could crash. */
4347 if (nominal_mode == VOIDmode)
4349 SET_DECL_RTL (parm, const0_rtx);
4350 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4354 /* If the parm is to be passed as a transparent union, use the
4355 type of the first field for the tests below. We have already
4356 verified that the modes are the same. */
4357 if (DECL_TRANSPARENT_UNION (parm)
4358 || (TREE_CODE (passed_type) == UNION_TYPE
4359 && TYPE_TRANSPARENT_UNION (passed_type)))
4360 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
4362 /* See if this arg was passed by invisible reference. It is if
4363 it is an object whose size depends on the contents of the
4364 object itself or if the machine requires these objects be passed
4367 if ((TREE_CODE (TYPE_SIZE (passed_type)) != INTEGER_CST
4368 && contains_placeholder_p (TYPE_SIZE (passed_type)))
4369 || TREE_ADDRESSABLE (passed_type)
4370 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
4371 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, passed_mode,
4372 passed_type, named_arg)
4376 passed_type = nominal_type = build_pointer_type (passed_type);
4378 passed_mode = nominal_mode = Pmode;
4381 promoted_mode = passed_mode;
4383 #ifdef PROMOTE_FUNCTION_ARGS
4384 /* Compute the mode in which the arg is actually extended to. */
4385 unsignedp = TREE_UNSIGNED (passed_type);
4386 promoted_mode = promote_mode (passed_type, promoted_mode, &unsignedp, 1);
4389 /* Let machine desc say which reg (if any) the parm arrives in.
4390 0 means it arrives on the stack. */
4391 #ifdef FUNCTION_INCOMING_ARG
4392 entry_parm = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4393 passed_type, named_arg);
4395 entry_parm = FUNCTION_ARG (args_so_far, promoted_mode,
4396 passed_type, named_arg);
4399 if (entry_parm == 0)
4400 promoted_mode = passed_mode;
4402 #ifdef SETUP_INCOMING_VARARGS
4403 /* If this is the last named parameter, do any required setup for
4404 varargs or stdargs. We need to know about the case of this being an
4405 addressable type, in which case we skip the registers it
4406 would have arrived in.
4408 For stdargs, LAST_NAMED will be set for two parameters, the one that
4409 is actually the last named, and the dummy parameter. We only
4410 want to do this action once.
4412 Also, indicate when RTL generation is to be suppressed. */
4413 if (last_named && !varargs_setup)
4415 SETUP_INCOMING_VARARGS (args_so_far, promoted_mode, passed_type,
4416 current_function_pretend_args_size, 0);
4421 /* Determine parm's home in the stack,
4422 in case it arrives in the stack or we should pretend it did.
4424 Compute the stack position and rtx where the argument arrives
4427 There is one complexity here: If this was a parameter that would
4428 have been passed in registers, but wasn't only because it is
4429 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
4430 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
4431 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
4432 0 as it was the previous time. */
4434 pretend_named = named_arg || PRETEND_OUTGOING_VARARGS_NAMED;
4435 locate_and_pad_parm (promoted_mode, passed_type,
4436 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4439 #ifdef FUNCTION_INCOMING_ARG
4440 FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4442 pretend_named) != 0,
4444 FUNCTION_ARG (args_so_far, promoted_mode,
4446 pretend_named) != 0,
4449 fndecl, &stack_args_size, &stack_offset, &arg_size,
4453 rtx offset_rtx = ARGS_SIZE_RTX (stack_offset);
4455 if (offset_rtx == const0_rtx)
4456 stack_parm = gen_rtx_MEM (promoted_mode, internal_arg_pointer);
4458 stack_parm = gen_rtx_MEM (promoted_mode,
4459 gen_rtx_PLUS (Pmode,
4460 internal_arg_pointer,
4463 set_mem_attributes (stack_parm, parm, 1);
4466 /* If this parameter was passed both in registers and in the stack,
4467 use the copy on the stack. */
4468 if (MUST_PASS_IN_STACK (promoted_mode, passed_type))
4471 #ifdef FUNCTION_ARG_PARTIAL_NREGS
4472 /* If this parm was passed part in regs and part in memory,
4473 pretend it arrived entirely in memory
4474 by pushing the register-part onto the stack.
4476 In the special case of a DImode or DFmode that is split,
4477 we could put it together in a pseudoreg directly,
4478 but for now that's not worth bothering with. */
4482 int nregs = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, promoted_mode,
4483 passed_type, named_arg);
4487 current_function_pretend_args_size
4488 = (((nregs * UNITS_PER_WORD) + (PARM_BOUNDARY / BITS_PER_UNIT) - 1)
4489 / (PARM_BOUNDARY / BITS_PER_UNIT)
4490 * (PARM_BOUNDARY / BITS_PER_UNIT));
4492 /* Handle calls that pass values in multiple non-contiguous
4493 locations. The Irix 6 ABI has examples of this. */
4494 if (GET_CODE (entry_parm) == PARALLEL)
4495 emit_group_store (validize_mem (stack_parm), entry_parm,
4496 int_size_in_bytes (TREE_TYPE (parm)),
4497 TYPE_ALIGN (TREE_TYPE (parm)));
4500 move_block_from_reg (REGNO (entry_parm),
4501 validize_mem (stack_parm), nregs,
4502 int_size_in_bytes (TREE_TYPE (parm)));
4504 entry_parm = stack_parm;
4509 /* If we didn't decide this parm came in a register,
4510 by default it came on the stack. */
4511 if (entry_parm == 0)
4512 entry_parm = stack_parm;
4514 /* Record permanently how this parm was passed. */
4515 DECL_INCOMING_RTL (parm) = entry_parm;
4517 /* If there is actually space on the stack for this parm,
4518 count it in stack_args_size; otherwise set stack_parm to 0
4519 to indicate there is no preallocated stack slot for the parm. */
4521 if (entry_parm == stack_parm
4522 || (GET_CODE (entry_parm) == PARALLEL
4523 && XEXP (XVECEXP (entry_parm, 0, 0), 0) == NULL_RTX)
4524 #if defined (REG_PARM_STACK_SPACE) && ! defined (MAYBE_REG_PARM_STACK_SPACE)
4525 /* On some machines, even if a parm value arrives in a register
4526 there is still an (uninitialized) stack slot allocated for it.
4528 ??? When MAYBE_REG_PARM_STACK_SPACE is defined, we can't tell
4529 whether this parameter already has a stack slot allocated,
4530 because an arg block exists only if current_function_args_size
4531 is larger than some threshold, and we haven't calculated that
4532 yet. So, for now, we just assume that stack slots never exist
4534 || REG_PARM_STACK_SPACE (fndecl) > 0
4538 stack_args_size.constant += arg_size.constant;
4540 ADD_PARM_SIZE (stack_args_size, arg_size.var);
4543 /* No stack slot was pushed for this parm. */
4546 /* Update info on where next arg arrives in registers. */
4548 FUNCTION_ARG_ADVANCE (args_so_far, promoted_mode,
4549 passed_type, named_arg);
4551 /* If we can't trust the parm stack slot to be aligned enough
4552 for its ultimate type, don't use that slot after entry.
4553 We'll make another stack slot, if we need one. */
4555 unsigned int thisparm_boundary
4556 = FUNCTION_ARG_BOUNDARY (promoted_mode, passed_type);
4558 if (GET_MODE_ALIGNMENT (nominal_mode) > thisparm_boundary)
4562 /* If parm was passed in memory, and we need to convert it on entry,
4563 don't store it back in that same slot. */
4565 && nominal_mode != BLKmode && nominal_mode != passed_mode)
4568 /* When an argument is passed in multiple locations, we can't
4569 make use of this information, but we can save some copying if
4570 the whole argument is passed in a single register. */
4571 if (GET_CODE (entry_parm) == PARALLEL
4572 && nominal_mode != BLKmode && passed_mode != BLKmode)
4574 int i, len = XVECLEN (entry_parm, 0);
4576 for (i = 0; i < len; i++)
4577 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
4578 && GET_CODE (XEXP (XVECEXP (entry_parm, 0, i), 0)) == REG
4579 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
4581 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
4583 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
4584 DECL_INCOMING_RTL (parm) = entry_parm;
4589 /* ENTRY_PARM is an RTX for the parameter as it arrives,
4590 in the mode in which it arrives.
4591 STACK_PARM is an RTX for a stack slot where the parameter can live
4592 during the function (in case we want to put it there).
4593 STACK_PARM is 0 if no stack slot was pushed for it.
4595 Now output code if necessary to convert ENTRY_PARM to
4596 the type in which this function declares it,
4597 and store that result in an appropriate place,
4598 which may be a pseudo reg, may be STACK_PARM,
4599 or may be a local stack slot if STACK_PARM is 0.
4601 Set DECL_RTL to that place. */
4603 if (nominal_mode == BLKmode || GET_CODE (entry_parm) == PARALLEL)
4605 /* If a BLKmode arrives in registers, copy it to a stack slot.
4606 Handle calls that pass values in multiple non-contiguous
4607 locations. The Irix 6 ABI has examples of this. */
4608 if (GET_CODE (entry_parm) == REG
4609 || GET_CODE (entry_parm) == PARALLEL)
4612 = CEIL_ROUND (int_size_in_bytes (TREE_TYPE (parm)),
4615 /* Note that we will be storing an integral number of words.
4616 So we have to be careful to ensure that we allocate an
4617 integral number of words. We do this below in the
4618 assign_stack_local if space was not allocated in the argument
4619 list. If it was, this will not work if PARM_BOUNDARY is not
4620 a multiple of BITS_PER_WORD. It isn't clear how to fix this
4621 if it becomes a problem. */
4623 if (stack_parm == 0)
4626 = assign_stack_local (GET_MODE (entry_parm),
4628 set_mem_attributes (stack_parm, parm, 1);
4631 else if (PARM_BOUNDARY % BITS_PER_WORD != 0)
4634 /* Handle calls that pass values in multiple non-contiguous
4635 locations. The Irix 6 ABI has examples of this. */
4636 if (GET_CODE (entry_parm) == PARALLEL)
4637 emit_group_store (validize_mem (stack_parm), entry_parm,
4638 int_size_in_bytes (TREE_TYPE (parm)),
4639 TYPE_ALIGN (TREE_TYPE (parm)));
4641 move_block_from_reg (REGNO (entry_parm),
4642 validize_mem (stack_parm),
4643 size_stored / UNITS_PER_WORD,
4644 int_size_in_bytes (TREE_TYPE (parm)));
4646 SET_DECL_RTL (parm, stack_parm);
4648 else if (! ((! optimize
4649 && ! DECL_REGISTER (parm)
4650 && ! DECL_INLINE (fndecl))
4651 || TREE_SIDE_EFFECTS (parm)
4652 /* If -ffloat-store specified, don't put explicit
4653 float variables into registers. */
4654 || (flag_float_store
4655 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))
4656 /* Always assign pseudo to structure return or item passed
4657 by invisible reference. */
4658 || passed_pointer || parm == function_result_decl)
4660 /* Store the parm in a pseudoregister during the function, but we
4661 may need to do it in a wider mode. */
4664 unsigned int regno, regnoi = 0, regnor = 0;
4666 unsignedp = TREE_UNSIGNED (TREE_TYPE (parm));
4668 promoted_nominal_mode
4669 = promote_mode (TREE_TYPE (parm), nominal_mode, &unsignedp, 0);
4671 parmreg = gen_reg_rtx (promoted_nominal_mode);
4672 mark_user_reg (parmreg);
4674 /* If this was an item that we received a pointer to, set DECL_RTL
4678 rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type)),
4680 set_mem_attributes (x, parm, 1);
4681 SET_DECL_RTL (parm, x);
4685 SET_DECL_RTL (parm, parmreg);
4686 maybe_set_unchanging (DECL_RTL (parm), parm);
4689 /* Copy the value into the register. */
4690 if (nominal_mode != passed_mode
4691 || promoted_nominal_mode != promoted_mode)
4694 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
4695 mode, by the caller. We now have to convert it to
4696 NOMINAL_MODE, if different. However, PARMREG may be in
4697 a different mode than NOMINAL_MODE if it is being stored
4700 If ENTRY_PARM is a hard register, it might be in a register
4701 not valid for operating in its mode (e.g., an odd-numbered
4702 register for a DFmode). In that case, moves are the only
4703 thing valid, so we can't do a convert from there. This
4704 occurs when the calling sequence allow such misaligned
4707 In addition, the conversion may involve a call, which could
4708 clobber parameters which haven't been copied to pseudo
4709 registers yet. Therefore, we must first copy the parm to
4710 a pseudo reg here, and save the conversion until after all
4711 parameters have been moved. */
4713 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
4715 emit_move_insn (tempreg, validize_mem (entry_parm));
4717 push_to_sequence (conversion_insns);
4718 tempreg = convert_to_mode (nominal_mode, tempreg, unsignedp);
4720 if (GET_CODE (tempreg) == SUBREG
4721 && GET_MODE (tempreg) == nominal_mode
4722 && GET_CODE (SUBREG_REG (tempreg)) == REG
4723 && nominal_mode == passed_mode
4724 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (entry_parm)
4725 && GET_MODE_SIZE (GET_MODE (tempreg))
4726 < GET_MODE_SIZE (GET_MODE (entry_parm)))
4728 /* The argument is already sign/zero extended, so note it
4730 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
4731 SUBREG_PROMOTED_UNSIGNED_P (tempreg) = unsignedp;
4734 /* TREE_USED gets set erroneously during expand_assignment. */
4735 save_tree_used = TREE_USED (parm);
4736 expand_assignment (parm,
4737 make_tree (nominal_type, tempreg), 0, 0);
4738 TREE_USED (parm) = save_tree_used;
4739 conversion_insns = get_insns ();
4744 emit_move_insn (parmreg, validize_mem (entry_parm));
4746 /* If we were passed a pointer but the actual value
4747 can safely live in a register, put it in one. */
4748 if (passed_pointer && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
4750 && ! DECL_REGISTER (parm)
4751 && ! DECL_INLINE (fndecl))
4752 || TREE_SIDE_EFFECTS (parm)
4753 /* If -ffloat-store specified, don't put explicit
4754 float variables into registers. */
4755 || (flag_float_store
4756 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE)))
4758 /* We can't use nominal_mode, because it will have been set to
4759 Pmode above. We must use the actual mode of the parm. */
4760 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
4761 mark_user_reg (parmreg);
4762 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
4764 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
4765 int unsigned_p = TREE_UNSIGNED (TREE_TYPE (parm));
4766 push_to_sequence (conversion_insns);
4767 emit_move_insn (tempreg, DECL_RTL (parm));
4769 convert_to_mode (GET_MODE (parmreg),
4772 emit_move_insn (parmreg, DECL_RTL (parm));
4773 conversion_insns = get_insns();
4778 emit_move_insn (parmreg, DECL_RTL (parm));
4779 SET_DECL_RTL (parm, parmreg);
4780 /* STACK_PARM is the pointer, not the parm, and PARMREG is
4784 #ifdef FUNCTION_ARG_CALLEE_COPIES
4785 /* If we are passed an arg by reference and it is our responsibility
4786 to make a copy, do it now.
4787 PASSED_TYPE and PASSED mode now refer to the pointer, not the
4788 original argument, so we must recreate them in the call to
4789 FUNCTION_ARG_CALLEE_COPIES. */
4790 /* ??? Later add code to handle the case that if the argument isn't
4791 modified, don't do the copy. */
4793 else if (passed_pointer
4794 && FUNCTION_ARG_CALLEE_COPIES (args_so_far,
4795 TYPE_MODE (DECL_ARG_TYPE (parm)),
4796 DECL_ARG_TYPE (parm),
4798 && ! TREE_ADDRESSABLE (DECL_ARG_TYPE (parm)))
4801 tree type = DECL_ARG_TYPE (parm);
4803 /* This sequence may involve a library call perhaps clobbering
4804 registers that haven't been copied to pseudos yet. */
4806 push_to_sequence (conversion_insns);
4808 if (!COMPLETE_TYPE_P (type)
4809 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4810 /* This is a variable sized object. */
4811 copy = gen_rtx_MEM (BLKmode,
4812 allocate_dynamic_stack_space
4813 (expr_size (parm), NULL_RTX,
4814 TYPE_ALIGN (type)));
4816 copy = assign_stack_temp (TYPE_MODE (type),
4817 int_size_in_bytes (type), 1);
4818 set_mem_attributes (copy, parm, 1);
4820 store_expr (parm, copy, 0);
4821 emit_move_insn (parmreg, XEXP (copy, 0));
4822 if (current_function_check_memory_usage)
4823 emit_library_call (chkr_set_right_libfunc,
4824 LCT_CONST_MAKE_BLOCK, VOIDmode, 3,
4825 XEXP (copy, 0), Pmode,
4826 GEN_INT (int_size_in_bytes (type)),
4827 TYPE_MODE (sizetype),
4828 GEN_INT (MEMORY_USE_RW),
4829 TYPE_MODE (integer_type_node));
4830 conversion_insns = get_insns ();
4834 #endif /* FUNCTION_ARG_CALLEE_COPIES */
4836 /* In any case, record the parm's desired stack location
4837 in case we later discover it must live in the stack.
4839 If it is a COMPLEX value, store the stack location for both
4842 if (GET_CODE (parmreg) == CONCAT)
4843 regno = MAX (REGNO (XEXP (parmreg, 0)), REGNO (XEXP (parmreg, 1)));
4845 regno = REGNO (parmreg);
4847 if (regno >= max_parm_reg)
4850 int old_max_parm_reg = max_parm_reg;
4852 /* It's slow to expand this one register at a time,
4853 but it's also rare and we need max_parm_reg to be
4854 precisely correct. */
4855 max_parm_reg = regno + 1;
4856 new = (rtx *) xrealloc (parm_reg_stack_loc,
4857 max_parm_reg * sizeof (rtx));
4858 memset ((char *) (new + old_max_parm_reg), 0,
4859 (max_parm_reg - old_max_parm_reg) * sizeof (rtx));
4860 parm_reg_stack_loc = new;
4863 if (GET_CODE (parmreg) == CONCAT)
4865 enum machine_mode submode = GET_MODE (XEXP (parmreg, 0));
4867 regnor = REGNO (gen_realpart (submode, parmreg));
4868 regnoi = REGNO (gen_imagpart (submode, parmreg));
4870 if (stack_parm != 0)
4872 parm_reg_stack_loc[regnor]
4873 = gen_realpart (submode, stack_parm);
4874 parm_reg_stack_loc[regnoi]
4875 = gen_imagpart (submode, stack_parm);
4879 parm_reg_stack_loc[regnor] = 0;
4880 parm_reg_stack_loc[regnoi] = 0;
4884 parm_reg_stack_loc[REGNO (parmreg)] = stack_parm;
4886 /* Mark the register as eliminable if we did no conversion
4887 and it was copied from memory at a fixed offset,
4888 and the arg pointer was not copied to a pseudo-reg.
4889 If the arg pointer is a pseudo reg or the offset formed
4890 an invalid address, such memory-equivalences
4891 as we make here would screw up life analysis for it. */
4892 if (nominal_mode == passed_mode
4895 && GET_CODE (stack_parm) == MEM
4896 && stack_offset.var == 0
4897 && reg_mentioned_p (virtual_incoming_args_rtx,
4898 XEXP (stack_parm, 0)))
4900 rtx linsn = get_last_insn ();
4903 /* Mark complex types separately. */
4904 if (GET_CODE (parmreg) == CONCAT)
4905 /* Scan backwards for the set of the real and
4907 for (sinsn = linsn; sinsn != 0;
4908 sinsn = prev_nonnote_insn (sinsn))
4910 set = single_set (sinsn);
4912 && SET_DEST (set) == regno_reg_rtx [regnoi])
4914 = gen_rtx_EXPR_LIST (REG_EQUIV,
4915 parm_reg_stack_loc[regnoi],
4918 && SET_DEST (set) == regno_reg_rtx [regnor])
4920 = gen_rtx_EXPR_LIST (REG_EQUIV,
4921 parm_reg_stack_loc[regnor],
4924 else if ((set = single_set (linsn)) != 0
4925 && SET_DEST (set) == parmreg)
4927 = gen_rtx_EXPR_LIST (REG_EQUIV,
4928 stack_parm, REG_NOTES (linsn));
4931 /* For pointer data type, suggest pointer register. */
4932 if (POINTER_TYPE_P (TREE_TYPE (parm)))
4933 mark_reg_pointer (parmreg,
4934 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
4936 /* If something wants our address, try to use ADDRESSOF. */
4937 if (TREE_ADDRESSABLE (parm))
4939 /* If we end up putting something into the stack,
4940 fixup_var_refs_insns will need to make a pass over
4941 all the instructions. It looks throughs the pending
4942 sequences -- but it can't see the ones in the
4943 CONVERSION_INSNS, if they're not on the sequence
4944 stack. So, we go back to that sequence, just so that
4945 the fixups will happen. */
4946 push_to_sequence (conversion_insns);
4947 put_var_into_stack (parm);
4948 conversion_insns = get_insns ();
4954 /* Value must be stored in the stack slot STACK_PARM
4955 during function execution. */
4957 if (promoted_mode != nominal_mode)
4959 /* Conversion is required. */
4960 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
4962 emit_move_insn (tempreg, validize_mem (entry_parm));
4964 push_to_sequence (conversion_insns);
4965 entry_parm = convert_to_mode (nominal_mode, tempreg,
4966 TREE_UNSIGNED (TREE_TYPE (parm)));
4968 /* ??? This may need a big-endian conversion on sparc64. */
4969 stack_parm = adjust_address (stack_parm, nominal_mode, 0);
4971 conversion_insns = get_insns ();
4976 if (entry_parm != stack_parm)
4978 if (stack_parm == 0)
4981 = assign_stack_local (GET_MODE (entry_parm),
4982 GET_MODE_SIZE (GET_MODE (entry_parm)), 0);
4983 set_mem_attributes (stack_parm, parm, 1);
4986 if (promoted_mode != nominal_mode)
4988 push_to_sequence (conversion_insns);
4989 emit_move_insn (validize_mem (stack_parm),
4990 validize_mem (entry_parm));
4991 conversion_insns = get_insns ();
4995 emit_move_insn (validize_mem (stack_parm),
4996 validize_mem (entry_parm));
4998 if (current_function_check_memory_usage)
5000 push_to_sequence (conversion_insns);
5001 emit_library_call (chkr_set_right_libfunc, LCT_CONST_MAKE_BLOCK,
5002 VOIDmode, 3, XEXP (stack_parm, 0), Pmode,
5003 GEN_INT (GET_MODE_SIZE (GET_MODE
5005 TYPE_MODE (sizetype),
5006 GEN_INT (MEMORY_USE_RW),
5007 TYPE_MODE (integer_type_node));
5009 conversion_insns = get_insns ();
5012 SET_DECL_RTL (parm, stack_parm);
5015 /* If this "parameter" was the place where we are receiving the
5016 function's incoming structure pointer, set up the result. */
5017 if (parm == function_result_decl)
5019 tree result = DECL_RESULT (fndecl);
5020 rtx x = gen_rtx_MEM (DECL_MODE (result), DECL_RTL (parm));
5022 set_mem_attributes (x, result, 1);
5023 SET_DECL_RTL (result, x);
5026 if (GET_CODE (DECL_RTL (parm)) == REG)
5027 REGNO_DECL (REGNO (DECL_RTL (parm))) = parm;
5028 else if (GET_CODE (DECL_RTL (parm)) == CONCAT)
5030 REGNO_DECL (REGNO (XEXP (DECL_RTL (parm), 0))) = parm;
5031 REGNO_DECL (REGNO (XEXP (DECL_RTL (parm), 1))) = parm;
5036 /* Output all parameter conversion instructions (possibly including calls)
5037 now that all parameters have been copied out of hard registers. */
5038 emit_insns (conversion_insns);
5040 last_parm_insn = get_last_insn ();
5042 current_function_args_size = stack_args_size.constant;
5044 /* Adjust function incoming argument size for alignment and
5047 #ifdef REG_PARM_STACK_SPACE
5048 #ifndef MAYBE_REG_PARM_STACK_SPACE
5049 current_function_args_size = MAX (current_function_args_size,
5050 REG_PARM_STACK_SPACE (fndecl));
5054 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
5056 current_function_args_size
5057 = ((current_function_args_size + STACK_BYTES - 1)
5058 / STACK_BYTES) * STACK_BYTES;
5060 #ifdef ARGS_GROW_DOWNWARD
5061 current_function_arg_offset_rtx
5062 = (stack_args_size.var == 0 ? GEN_INT (-stack_args_size.constant)
5063 : expand_expr (size_diffop (stack_args_size.var,
5064 size_int (-stack_args_size.constant)),
5065 NULL_RTX, VOIDmode, EXPAND_MEMORY_USE_BAD));
5067 current_function_arg_offset_rtx = ARGS_SIZE_RTX (stack_args_size);
5070 /* See how many bytes, if any, of its args a function should try to pop
5073 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
5074 current_function_args_size);
5076 /* For stdarg.h function, save info about
5077 regs and stack space used by the named args. */
5080 current_function_args_info = args_so_far;
5082 /* Set the rtx used for the function return value. Put this in its
5083 own variable so any optimizers that need this information don't have
5084 to include tree.h. Do this here so it gets done when an inlined
5085 function gets output. */
5087 current_function_return_rtx
5088 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
5089 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
5092 /* Indicate whether REGNO is an incoming argument to the current function
5093 that was promoted to a wider mode. If so, return the RTX for the
5094 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
5095 that REGNO is promoted from and whether the promotion was signed or
5098 #ifdef PROMOTE_FUNCTION_ARGS
5101 promoted_input_arg (regno, pmode, punsignedp)
5103 enum machine_mode *pmode;
5108 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
5109 arg = TREE_CHAIN (arg))
5110 if (GET_CODE (DECL_INCOMING_RTL (arg)) == REG
5111 && REGNO (DECL_INCOMING_RTL (arg)) == regno
5112 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
5114 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
5115 int unsignedp = TREE_UNSIGNED (TREE_TYPE (arg));
5117 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
5118 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
5119 && mode != DECL_MODE (arg))
5121 *pmode = DECL_MODE (arg);
5122 *punsignedp = unsignedp;
5123 return DECL_INCOMING_RTL (arg);
5132 /* Compute the size and offset from the start of the stacked arguments for a
5133 parm passed in mode PASSED_MODE and with type TYPE.
5135 INITIAL_OFFSET_PTR points to the current offset into the stacked
5138 The starting offset and size for this parm are returned in *OFFSET_PTR
5139 and *ARG_SIZE_PTR, respectively.
5141 IN_REGS is non-zero if the argument will be passed in registers. It will
5142 never be set if REG_PARM_STACK_SPACE is not defined.
5144 FNDECL is the function in which the argument was defined.
5146 There are two types of rounding that are done. The first, controlled by
5147 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
5148 list to be aligned to the specific boundary (in bits). This rounding
5149 affects the initial and starting offsets, but not the argument size.
5151 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
5152 optionally rounds the size of the parm to PARM_BOUNDARY. The
5153 initial offset is not affected by this rounding, while the size always
5154 is and the starting offset may be. */
5156 /* offset_ptr will be negative for ARGS_GROW_DOWNWARD case;
5157 initial_offset_ptr is positive because locate_and_pad_parm's
5158 callers pass in the total size of args so far as
5159 initial_offset_ptr. arg_size_ptr is always positive.*/
5162 locate_and_pad_parm (passed_mode, type, in_regs, fndecl,
5163 initial_offset_ptr, offset_ptr, arg_size_ptr,
5165 enum machine_mode passed_mode;
5167 int in_regs ATTRIBUTE_UNUSED;
5168 tree fndecl ATTRIBUTE_UNUSED;
5169 struct args_size *initial_offset_ptr;
5170 struct args_size *offset_ptr;
5171 struct args_size *arg_size_ptr;
5172 struct args_size *alignment_pad;
5176 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
5177 enum direction where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
5178 int boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
5180 #ifdef REG_PARM_STACK_SPACE
5181 /* If we have found a stack parm before we reach the end of the
5182 area reserved for registers, skip that area. */
5185 int reg_parm_stack_space = 0;
5187 #ifdef MAYBE_REG_PARM_STACK_SPACE
5188 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
5190 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
5192 if (reg_parm_stack_space > 0)
5194 if (initial_offset_ptr->var)
5196 initial_offset_ptr->var
5197 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
5198 ssize_int (reg_parm_stack_space));
5199 initial_offset_ptr->constant = 0;
5201 else if (initial_offset_ptr->constant < reg_parm_stack_space)
5202 initial_offset_ptr->constant = reg_parm_stack_space;
5205 #endif /* REG_PARM_STACK_SPACE */
5207 arg_size_ptr->var = 0;
5208 arg_size_ptr->constant = 0;
5209 alignment_pad->var = 0;
5210 alignment_pad->constant = 0;
5212 #ifdef ARGS_GROW_DOWNWARD
5213 if (initial_offset_ptr->var)
5215 offset_ptr->constant = 0;
5216 offset_ptr->var = size_binop (MINUS_EXPR, ssize_int (0),
5217 initial_offset_ptr->var);
5221 offset_ptr->constant = -initial_offset_ptr->constant;
5222 offset_ptr->var = 0;
5224 if (where_pad != none
5225 && (!host_integerp (sizetree, 1)
5226 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5227 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5228 SUB_PARM_SIZE (*offset_ptr, sizetree);
5229 if (where_pad != downward)
5230 pad_to_arg_alignment (offset_ptr, boundary, alignment_pad);
5231 if (initial_offset_ptr->var)
5232 arg_size_ptr->var = size_binop (MINUS_EXPR,
5233 size_binop (MINUS_EXPR,
5235 initial_offset_ptr->var),
5239 arg_size_ptr->constant = (-initial_offset_ptr->constant
5240 - offset_ptr->constant);
5242 #else /* !ARGS_GROW_DOWNWARD */
5244 #ifdef REG_PARM_STACK_SPACE
5245 || REG_PARM_STACK_SPACE (fndecl) > 0
5248 pad_to_arg_alignment (initial_offset_ptr, boundary, alignment_pad);
5249 *offset_ptr = *initial_offset_ptr;
5251 #ifdef PUSH_ROUNDING
5252 if (passed_mode != BLKmode)
5253 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
5256 /* Pad_below needs the pre-rounded size to know how much to pad below
5257 so this must be done before rounding up. */
5258 if (where_pad == downward
5259 /* However, BLKmode args passed in regs have their padding done elsewhere.
5260 The stack slot must be able to hold the entire register. */
5261 && !(in_regs && passed_mode == BLKmode))
5262 pad_below (offset_ptr, passed_mode, sizetree);
5264 if (where_pad != none
5265 && (!host_integerp (sizetree, 1)
5266 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5267 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5269 ADD_PARM_SIZE (*arg_size_ptr, sizetree);
5270 #endif /* ARGS_GROW_DOWNWARD */
5273 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
5274 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
5277 pad_to_arg_alignment (offset_ptr, boundary, alignment_pad)
5278 struct args_size *offset_ptr;
5280 struct args_size *alignment_pad;
5282 tree save_var = NULL_TREE;
5283 HOST_WIDE_INT save_constant = 0;
5285 int boundary_in_bytes = boundary / BITS_PER_UNIT;
5287 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5289 save_var = offset_ptr->var;
5290 save_constant = offset_ptr->constant;
5293 alignment_pad->var = NULL_TREE;
5294 alignment_pad->constant = 0;
5296 if (boundary > BITS_PER_UNIT)
5298 if (offset_ptr->var)
5301 #ifdef ARGS_GROW_DOWNWARD
5306 (ARGS_SIZE_TREE (*offset_ptr),
5307 boundary / BITS_PER_UNIT);
5308 offset_ptr->constant = 0; /*?*/
5309 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5310 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
5315 offset_ptr->constant =
5316 #ifdef ARGS_GROW_DOWNWARD
5317 FLOOR_ROUND (offset_ptr->constant, boundary_in_bytes);
5319 CEIL_ROUND (offset_ptr->constant, boundary_in_bytes);
5321 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5322 alignment_pad->constant = offset_ptr->constant - save_constant;
5327 #ifndef ARGS_GROW_DOWNWARD
5329 pad_below (offset_ptr, passed_mode, sizetree)
5330 struct args_size *offset_ptr;
5331 enum machine_mode passed_mode;
5334 if (passed_mode != BLKmode)
5336 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
5337 offset_ptr->constant
5338 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
5339 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
5340 - GET_MODE_SIZE (passed_mode));
5344 if (TREE_CODE (sizetree) != INTEGER_CST
5345 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
5347 /* Round the size up to multiple of PARM_BOUNDARY bits. */
5348 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5350 ADD_PARM_SIZE (*offset_ptr, s2);
5351 SUB_PARM_SIZE (*offset_ptr, sizetree);
5357 /* Walk the tree of blocks describing the binding levels within a function
5358 and warn about uninitialized variables.
5359 This is done after calling flow_analysis and before global_alloc
5360 clobbers the pseudo-regs to hard regs. */
5363 uninitialized_vars_warning (block)
5367 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5369 if (warn_uninitialized
5370 && TREE_CODE (decl) == VAR_DECL
5371 /* These warnings are unreliable for and aggregates
5372 because assigning the fields one by one can fail to convince
5373 flow.c that the entire aggregate was initialized.
5374 Unions are troublesome because members may be shorter. */
5375 && ! AGGREGATE_TYPE_P (TREE_TYPE (decl))
5376 && DECL_RTL (decl) != 0
5377 && GET_CODE (DECL_RTL (decl)) == REG
5378 /* Global optimizations can make it difficult to determine if a
5379 particular variable has been initialized. However, a VAR_DECL
5380 with a nonzero DECL_INITIAL had an initializer, so do not
5381 claim it is potentially uninitialized.
5383 We do not care about the actual value in DECL_INITIAL, so we do
5384 not worry that it may be a dangling pointer. */
5385 && DECL_INITIAL (decl) == NULL_TREE
5386 && regno_uninitialized (REGNO (DECL_RTL (decl))))
5387 warning_with_decl (decl,
5388 "`%s' might be used uninitialized in this function");
5390 && TREE_CODE (decl) == VAR_DECL
5391 && DECL_RTL (decl) != 0
5392 && GET_CODE (DECL_RTL (decl)) == REG
5393 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5394 warning_with_decl (decl,
5395 "variable `%s' might be clobbered by `longjmp' or `vfork'");
5397 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5398 uninitialized_vars_warning (sub);
5401 /* Do the appropriate part of uninitialized_vars_warning
5402 but for arguments instead of local variables. */
5405 setjmp_args_warning ()
5408 for (decl = DECL_ARGUMENTS (current_function_decl);
5409 decl; decl = TREE_CHAIN (decl))
5410 if (DECL_RTL (decl) != 0
5411 && GET_CODE (DECL_RTL (decl)) == REG
5412 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5413 warning_with_decl (decl,
5414 "argument `%s' might be clobbered by `longjmp' or `vfork'");
5417 /* If this function call setjmp, put all vars into the stack
5418 unless they were declared `register'. */
5421 setjmp_protect (block)
5425 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5426 if ((TREE_CODE (decl) == VAR_DECL
5427 || TREE_CODE (decl) == PARM_DECL)
5428 && DECL_RTL (decl) != 0
5429 && (GET_CODE (DECL_RTL (decl)) == REG
5430 || (GET_CODE (DECL_RTL (decl)) == MEM
5431 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5432 /* If this variable came from an inline function, it must be
5433 that its life doesn't overlap the setjmp. If there was a
5434 setjmp in the function, it would already be in memory. We
5435 must exclude such variable because their DECL_RTL might be
5436 set to strange things such as virtual_stack_vars_rtx. */
5437 && ! DECL_FROM_INLINE (decl)
5439 #ifdef NON_SAVING_SETJMP
5440 /* If longjmp doesn't restore the registers,
5441 don't put anything in them. */
5445 ! DECL_REGISTER (decl)))
5446 put_var_into_stack (decl);
5447 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5448 setjmp_protect (sub);
5451 /* Like the previous function, but for args instead of local variables. */
5454 setjmp_protect_args ()
5457 for (decl = DECL_ARGUMENTS (current_function_decl);
5458 decl; decl = TREE_CHAIN (decl))
5459 if ((TREE_CODE (decl) == VAR_DECL
5460 || TREE_CODE (decl) == PARM_DECL)
5461 && DECL_RTL (decl) != 0
5462 && (GET_CODE (DECL_RTL (decl)) == REG
5463 || (GET_CODE (DECL_RTL (decl)) == MEM
5464 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5466 /* If longjmp doesn't restore the registers,
5467 don't put anything in them. */
5468 #ifdef NON_SAVING_SETJMP
5472 ! DECL_REGISTER (decl)))
5473 put_var_into_stack (decl);
5476 /* Return the context-pointer register corresponding to DECL,
5477 or 0 if it does not need one. */
5480 lookup_static_chain (decl)
5483 tree context = decl_function_context (decl);
5487 || (TREE_CODE (decl) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (decl)))
5490 /* We treat inline_function_decl as an alias for the current function
5491 because that is the inline function whose vars, types, etc.
5492 are being merged into the current function.
5493 See expand_inline_function. */
5494 if (context == current_function_decl || context == inline_function_decl)
5495 return virtual_stack_vars_rtx;
5497 for (link = context_display; link; link = TREE_CHAIN (link))
5498 if (TREE_PURPOSE (link) == context)
5499 return RTL_EXPR_RTL (TREE_VALUE (link));
5504 /* Convert a stack slot address ADDR for variable VAR
5505 (from a containing function)
5506 into an address valid in this function (using a static chain). */
5509 fix_lexical_addr (addr, var)
5514 HOST_WIDE_INT displacement;
5515 tree context = decl_function_context (var);
5516 struct function *fp;
5519 /* If this is the present function, we need not do anything. */
5520 if (context == current_function_decl || context == inline_function_decl)
5523 fp = find_function_data (context);
5525 if (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == MEM)
5526 addr = XEXP (XEXP (addr, 0), 0);
5528 /* Decode given address as base reg plus displacement. */
5529 if (GET_CODE (addr) == REG)
5530 basereg = addr, displacement = 0;
5531 else if (GET_CODE (addr) == PLUS && GET_CODE (XEXP (addr, 1)) == CONST_INT)
5532 basereg = XEXP (addr, 0), displacement = INTVAL (XEXP (addr, 1));
5536 /* We accept vars reached via the containing function's
5537 incoming arg pointer and via its stack variables pointer. */
5538 if (basereg == fp->internal_arg_pointer)
5540 /* If reached via arg pointer, get the arg pointer value
5541 out of that function's stack frame.
5543 There are two cases: If a separate ap is needed, allocate a
5544 slot in the outer function for it and dereference it that way.
5545 This is correct even if the real ap is actually a pseudo.
5546 Otherwise, just adjust the offset from the frame pointer to
5549 #ifdef NEED_SEPARATE_AP
5552 addr = get_arg_pointer_save_area (fp);
5553 addr = fix_lexical_addr (XEXP (addr, 0), var);
5554 addr = memory_address (Pmode, addr);
5556 base = gen_rtx_MEM (Pmode, addr);
5557 set_mem_alias_set (base, get_frame_alias_set ());
5558 base = copy_to_reg (base);
5560 displacement += (FIRST_PARM_OFFSET (context) - STARTING_FRAME_OFFSET);
5561 base = lookup_static_chain (var);
5565 else if (basereg == virtual_stack_vars_rtx)
5567 /* This is the same code as lookup_static_chain, duplicated here to
5568 avoid an extra call to decl_function_context. */
5571 for (link = context_display; link; link = TREE_CHAIN (link))
5572 if (TREE_PURPOSE (link) == context)
5574 base = RTL_EXPR_RTL (TREE_VALUE (link));
5582 /* Use same offset, relative to appropriate static chain or argument
5584 return plus_constant (base, displacement);
5587 /* Return the address of the trampoline for entering nested fn FUNCTION.
5588 If necessary, allocate a trampoline (in the stack frame)
5589 and emit rtl to initialize its contents (at entry to this function). */
5592 trampoline_address (function)
5598 struct function *fp;
5601 /* Find an existing trampoline and return it. */
5602 for (link = trampoline_list; link; link = TREE_CHAIN (link))
5603 if (TREE_PURPOSE (link) == function)
5605 adjust_trampoline_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0));
5607 for (fp = outer_function_chain; fp; fp = fp->outer)
5608 for (link = fp->x_trampoline_list; link; link = TREE_CHAIN (link))
5609 if (TREE_PURPOSE (link) == function)
5611 tramp = fix_lexical_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0),
5613 return adjust_trampoline_addr (tramp);
5616 /* None exists; we must make one. */
5618 /* Find the `struct function' for the function containing FUNCTION. */
5620 fn_context = decl_function_context (function);
5621 if (fn_context != current_function_decl
5622 && fn_context != inline_function_decl)
5623 fp = find_function_data (fn_context);
5625 /* Allocate run-time space for this trampoline
5626 (usually in the defining function's stack frame). */
5627 #ifdef ALLOCATE_TRAMPOLINE
5628 tramp = ALLOCATE_TRAMPOLINE (fp);
5630 /* If rounding needed, allocate extra space
5631 to ensure we have TRAMPOLINE_SIZE bytes left after rounding up. */
5632 #ifdef TRAMPOLINE_ALIGNMENT
5633 #define TRAMPOLINE_REAL_SIZE \
5634 (TRAMPOLINE_SIZE + (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT) - 1)
5636 #define TRAMPOLINE_REAL_SIZE (TRAMPOLINE_SIZE)
5638 tramp = assign_stack_local_1 (BLKmode, TRAMPOLINE_REAL_SIZE, 0,
5642 /* Record the trampoline for reuse and note it for later initialization
5643 by expand_function_end. */
5646 rtlexp = make_node (RTL_EXPR);
5647 RTL_EXPR_RTL (rtlexp) = tramp;
5648 fp->x_trampoline_list = tree_cons (function, rtlexp,
5649 fp->x_trampoline_list);
5653 /* Make the RTL_EXPR node temporary, not momentary, so that the
5654 trampoline_list doesn't become garbage. */
5655 rtlexp = make_node (RTL_EXPR);
5657 RTL_EXPR_RTL (rtlexp) = tramp;
5658 trampoline_list = tree_cons (function, rtlexp, trampoline_list);
5661 tramp = fix_lexical_addr (XEXP (tramp, 0), function);
5662 return adjust_trampoline_addr (tramp);
5665 /* Given a trampoline address,
5666 round it to multiple of TRAMPOLINE_ALIGNMENT. */
5669 round_trampoline_addr (tramp)
5672 #ifdef TRAMPOLINE_ALIGNMENT
5673 /* Round address up to desired boundary. */
5674 rtx temp = gen_reg_rtx (Pmode);
5675 rtx addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
5676 rtx mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
5678 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
5679 temp, 0, OPTAB_LIB_WIDEN);
5680 tramp = expand_simple_binop (Pmode, AND, temp, mask,
5681 temp, 0, OPTAB_LIB_WIDEN);
5686 /* Given a trampoline address, round it then apply any
5687 platform-specific adjustments so that the result can be used for a
5691 adjust_trampoline_addr (tramp)
5694 tramp = round_trampoline_addr (tramp);
5695 #ifdef TRAMPOLINE_ADJUST_ADDRESS
5696 TRAMPOLINE_ADJUST_ADDRESS (tramp);
5701 /* Put all this function's BLOCK nodes including those that are chained
5702 onto the first block into a vector, and return it.
5703 Also store in each NOTE for the beginning or end of a block
5704 the index of that block in the vector.
5705 The arguments are BLOCK, the chain of top-level blocks of the function,
5706 and INSNS, the insn chain of the function. */
5712 tree *block_vector, *last_block_vector;
5714 tree block = DECL_INITIAL (current_function_decl);
5719 /* Fill the BLOCK_VECTOR with all of the BLOCKs in this function, in
5720 depth-first order. */
5721 block_vector = get_block_vector (block, &n_blocks);
5722 block_stack = (tree *) xmalloc (n_blocks * sizeof (tree));
5724 last_block_vector = identify_blocks_1 (get_insns (),
5726 block_vector + n_blocks,
5729 /* If we didn't use all of the subblocks, we've misplaced block notes. */
5730 /* ??? This appears to happen all the time. Latent bugs elsewhere? */
5731 if (0 && last_block_vector != block_vector + n_blocks)
5734 free (block_vector);
5738 /* Subroutine of identify_blocks. Do the block substitution on the
5739 insn chain beginning with INSNS. Recurse for CALL_PLACEHOLDER chains.
5741 BLOCK_STACK is pushed and popped for each BLOCK_BEGIN/BLOCK_END pair.
5742 BLOCK_VECTOR is incremented for each block seen. */
5745 identify_blocks_1 (insns, block_vector, end_block_vector, orig_block_stack)
5748 tree *end_block_vector;
5749 tree *orig_block_stack;
5752 tree *block_stack = orig_block_stack;
5754 for (insn = insns; insn; insn = NEXT_INSN (insn))
5756 if (GET_CODE (insn) == NOTE)
5758 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
5762 /* If there are more block notes than BLOCKs, something
5764 if (block_vector == end_block_vector)
5767 b = *block_vector++;
5768 NOTE_BLOCK (insn) = b;
5771 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
5773 /* If there are more NOTE_INSN_BLOCK_ENDs than
5774 NOTE_INSN_BLOCK_BEGs, something is badly wrong. */
5775 if (block_stack == orig_block_stack)
5778 NOTE_BLOCK (insn) = *--block_stack;
5781 else if (GET_CODE (insn) == CALL_INSN
5782 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
5784 rtx cp = PATTERN (insn);
5786 block_vector = identify_blocks_1 (XEXP (cp, 0), block_vector,
5787 end_block_vector, block_stack);
5789 block_vector = identify_blocks_1 (XEXP (cp, 1), block_vector,
5790 end_block_vector, block_stack);
5792 block_vector = identify_blocks_1 (XEXP (cp, 2), block_vector,
5793 end_block_vector, block_stack);
5797 /* If there are more NOTE_INSN_BLOCK_BEGINs than NOTE_INSN_BLOCK_ENDs,
5798 something is badly wrong. */
5799 if (block_stack != orig_block_stack)
5802 return block_vector;
5805 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
5806 and create duplicate blocks. */
5807 /* ??? Need an option to either create block fragments or to create
5808 abstract origin duplicates of a source block. It really depends
5809 on what optimization has been performed. */
5814 tree block = DECL_INITIAL (current_function_decl);
5815 varray_type block_stack;
5817 if (block == NULL_TREE)
5820 VARRAY_TREE_INIT (block_stack, 10, "block_stack");
5822 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
5823 reorder_blocks_0 (block);
5825 /* Prune the old trees away, so that they don't get in the way. */
5826 BLOCK_SUBBLOCKS (block) = NULL_TREE;
5827 BLOCK_CHAIN (block) = NULL_TREE;
5829 /* Recreate the block tree from the note nesting. */
5830 reorder_blocks_1 (get_insns (), block, &block_stack);
5831 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
5833 /* Remove deleted blocks from the block fragment chains. */
5834 reorder_fix_fragments (block);
5836 VARRAY_FREE (block_stack);
5839 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
5842 reorder_blocks_0 (block)
5847 TREE_ASM_WRITTEN (block) = 0;
5848 reorder_blocks_0 (BLOCK_SUBBLOCKS (block));
5849 block = BLOCK_CHAIN (block);
5854 reorder_blocks_1 (insns, current_block, p_block_stack)
5857 varray_type *p_block_stack;
5861 for (insn = insns; insn; insn = NEXT_INSN (insn))
5863 if (GET_CODE (insn) == NOTE)
5865 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
5867 tree block = NOTE_BLOCK (insn);
5869 /* If we have seen this block before, that means it now
5870 spans multiple address regions. Create a new fragment. */
5871 if (TREE_ASM_WRITTEN (block))
5873 tree new_block = copy_node (block);
5876 origin = (BLOCK_FRAGMENT_ORIGIN (block)
5877 ? BLOCK_FRAGMENT_ORIGIN (block)
5879 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
5880 BLOCK_FRAGMENT_CHAIN (new_block)
5881 = BLOCK_FRAGMENT_CHAIN (origin);
5882 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
5884 NOTE_BLOCK (insn) = new_block;
5888 BLOCK_SUBBLOCKS (block) = 0;
5889 TREE_ASM_WRITTEN (block) = 1;
5890 BLOCK_SUPERCONTEXT (block) = current_block;
5891 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
5892 BLOCK_SUBBLOCKS (current_block) = block;
5893 current_block = block;
5894 VARRAY_PUSH_TREE (*p_block_stack, block);
5896 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
5898 NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack);
5899 VARRAY_POP (*p_block_stack);
5900 BLOCK_SUBBLOCKS (current_block)
5901 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
5902 current_block = BLOCK_SUPERCONTEXT (current_block);
5905 else if (GET_CODE (insn) == CALL_INSN
5906 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
5908 rtx cp = PATTERN (insn);
5909 reorder_blocks_1 (XEXP (cp, 0), current_block, p_block_stack);
5911 reorder_blocks_1 (XEXP (cp, 1), current_block, p_block_stack);
5913 reorder_blocks_1 (XEXP (cp, 2), current_block, p_block_stack);
5918 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
5919 appears in the block tree, select one of the fragments to become
5920 the new origin block. */
5923 reorder_fix_fragments (block)
5928 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
5929 tree new_origin = NULL_TREE;
5933 if (! TREE_ASM_WRITTEN (dup_origin))
5935 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
5937 /* Find the first of the remaining fragments. There must
5938 be at least one -- the current block. */
5939 while (! TREE_ASM_WRITTEN (new_origin))
5940 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
5941 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
5944 else if (! dup_origin)
5947 /* Re-root the rest of the fragments to the new origin. In the
5948 case that DUP_ORIGIN was null, that means BLOCK was the origin
5949 of a chain of fragments and we want to remove those fragments
5950 that didn't make it to the output. */
5953 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
5958 if (TREE_ASM_WRITTEN (chain))
5960 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
5962 pp = &BLOCK_FRAGMENT_CHAIN (chain);
5964 chain = BLOCK_FRAGMENT_CHAIN (chain);
5969 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
5970 block = BLOCK_CHAIN (block);
5974 /* Reverse the order of elements in the chain T of blocks,
5975 and return the new head of the chain (old last element). */
5981 tree prev = 0, decl, next;
5982 for (decl = t; decl; decl = next)
5984 next = BLOCK_CHAIN (decl);
5985 BLOCK_CHAIN (decl) = prev;
5991 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
5992 non-NULL, list them all into VECTOR, in a depth-first preorder
5993 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
5997 all_blocks (block, vector)
6005 TREE_ASM_WRITTEN (block) = 0;
6007 /* Record this block. */
6009 vector[n_blocks] = block;
6013 /* Record the subblocks, and their subblocks... */
6014 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
6015 vector ? vector + n_blocks : 0);
6016 block = BLOCK_CHAIN (block);
6022 /* Return a vector containing all the blocks rooted at BLOCK. The
6023 number of elements in the vector is stored in N_BLOCKS_P. The
6024 vector is dynamically allocated; it is the caller's responsibility
6025 to call `free' on the pointer returned. */
6028 get_block_vector (block, n_blocks_p)
6034 *n_blocks_p = all_blocks (block, NULL);
6035 block_vector = (tree *) xmalloc (*n_blocks_p * sizeof (tree));
6036 all_blocks (block, block_vector);
6038 return block_vector;
6041 static int next_block_index = 2;
6043 /* Set BLOCK_NUMBER for all the blocks in FN. */
6053 /* For SDB and XCOFF debugging output, we start numbering the blocks
6054 from 1 within each function, rather than keeping a running
6056 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
6057 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
6058 next_block_index = 1;
6061 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
6063 /* The top-level BLOCK isn't numbered at all. */
6064 for (i = 1; i < n_blocks; ++i)
6065 /* We number the blocks from two. */
6066 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
6068 free (block_vector);
6073 /* Allocate a function structure and reset its contents to the defaults. */
6076 prepare_function_start ()
6078 cfun = (struct function *) ggc_alloc_cleared (sizeof (struct function));
6080 init_stmt_for_function ();
6081 init_eh_for_function ();
6083 cse_not_expected = ! optimize;
6085 /* Caller save not needed yet. */
6086 caller_save_needed = 0;
6088 /* No stack slots have been made yet. */
6089 stack_slot_list = 0;
6091 current_function_has_nonlocal_label = 0;
6092 current_function_has_nonlocal_goto = 0;
6094 /* There is no stack slot for handling nonlocal gotos. */
6095 nonlocal_goto_handler_slots = 0;
6096 nonlocal_goto_stack_level = 0;
6098 /* No labels have been declared for nonlocal use. */
6099 nonlocal_labels = 0;
6100 nonlocal_goto_handler_labels = 0;
6102 /* No function calls so far in this function. */
6103 function_call_count = 0;
6105 /* No parm regs have been allocated.
6106 (This is important for output_inline_function.) */
6107 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
6109 /* Initialize the RTL mechanism. */
6112 /* Initialize the queue of pending postincrement and postdecrements,
6113 and some other info in expr.c. */
6116 /* We haven't done register allocation yet. */
6119 init_varasm_status (cfun);
6121 /* Clear out data used for inlining. */
6122 cfun->inlinable = 0;
6123 cfun->original_decl_initial = 0;
6124 cfun->original_arg_vector = 0;
6126 cfun->stack_alignment_needed = STACK_BOUNDARY;
6127 cfun->preferred_stack_boundary = STACK_BOUNDARY;
6129 /* Set if a call to setjmp is seen. */
6130 current_function_calls_setjmp = 0;
6132 /* Set if a call to longjmp is seen. */
6133 current_function_calls_longjmp = 0;
6135 current_function_calls_alloca = 0;
6136 current_function_contains_functions = 0;
6137 current_function_is_leaf = 0;
6138 current_function_nothrow = 0;
6139 current_function_sp_is_unchanging = 0;
6140 current_function_uses_only_leaf_regs = 0;
6141 current_function_has_computed_jump = 0;
6142 current_function_is_thunk = 0;
6144 current_function_returns_pcc_struct = 0;
6145 current_function_returns_struct = 0;
6146 current_function_epilogue_delay_list = 0;
6147 current_function_uses_const_pool = 0;
6148 current_function_uses_pic_offset_table = 0;
6149 current_function_cannot_inline = 0;
6151 /* We have not yet needed to make a label to jump to for tail-recursion. */
6152 tail_recursion_label = 0;
6154 /* We haven't had a need to make a save area for ap yet. */
6155 arg_pointer_save_area = 0;
6157 /* No stack slots allocated yet. */
6160 /* No SAVE_EXPRs in this function yet. */
6163 /* No RTL_EXPRs in this function yet. */
6166 /* Set up to allocate temporaries. */
6169 /* Indicate that we need to distinguish between the return value of the
6170 present function and the return value of a function being called. */
6171 rtx_equal_function_value_matters = 1;
6173 /* Indicate that we have not instantiated virtual registers yet. */
6174 virtuals_instantiated = 0;
6176 /* Indicate that we want CONCATs now. */
6177 generating_concat_p = 1;
6179 /* Indicate we have no need of a frame pointer yet. */
6180 frame_pointer_needed = 0;
6182 /* By default assume not varargs or stdarg. */
6183 current_function_varargs = 0;
6184 current_function_stdarg = 0;
6186 /* We haven't made any trampolines for this function yet. */
6187 trampoline_list = 0;
6189 init_pending_stack_adjust ();
6190 inhibit_defer_pop = 0;
6192 current_function_outgoing_args_size = 0;
6194 if (init_lang_status)
6195 (*init_lang_status) (cfun);
6196 if (init_machine_status)
6197 (*init_machine_status) (cfun);
6200 /* Initialize the rtl expansion mechanism so that we can do simple things
6201 like generate sequences. This is used to provide a context during global
6202 initialization of some passes. */
6204 init_dummy_function_start ()
6206 prepare_function_start ();
6209 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
6210 and initialize static variables for generating RTL for the statements
6214 init_function_start (subr, filename, line)
6216 const char *filename;
6219 prepare_function_start ();
6221 current_function_name = (*decl_printable_name) (subr, 2);
6224 /* Nonzero if this is a nested function that uses a static chain. */
6226 current_function_needs_context
6227 = (decl_function_context (current_function_decl) != 0
6228 && ! DECL_NO_STATIC_CHAIN (current_function_decl));
6230 /* Within function body, compute a type's size as soon it is laid out. */
6231 immediate_size_expand++;
6233 /* Prevent ever trying to delete the first instruction of a function.
6234 Also tell final how to output a linenum before the function prologue.
6235 Note linenums could be missing, e.g. when compiling a Java .class file. */
6237 emit_line_note (filename, line);
6239 /* Make sure first insn is a note even if we don't want linenums.
6240 This makes sure the first insn will never be deleted.
6241 Also, final expects a note to appear there. */
6242 emit_note (NULL, NOTE_INSN_DELETED);
6244 /* Set flags used by final.c. */
6245 if (aggregate_value_p (DECL_RESULT (subr)))
6247 #ifdef PCC_STATIC_STRUCT_RETURN
6248 current_function_returns_pcc_struct = 1;
6250 current_function_returns_struct = 1;
6253 /* Warn if this value is an aggregate type,
6254 regardless of which calling convention we are using for it. */
6255 if (warn_aggregate_return
6256 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
6257 warning ("function returns an aggregate");
6259 current_function_returns_pointer
6260 = POINTER_TYPE_P (TREE_TYPE (DECL_RESULT (subr)));
6263 /* Make sure all values used by the optimization passes have sane
6266 init_function_for_compilation ()
6270 /* No prologue/epilogue insns yet. */
6271 VARRAY_GROW (prologue, 0);
6272 VARRAY_GROW (epilogue, 0);
6273 VARRAY_GROW (sibcall_epilogue, 0);
6276 /* Indicate that the current function uses extra args
6277 not explicitly mentioned in the argument list in any fashion. */
6282 current_function_varargs = 1;
6285 /* Expand a call to __main at the beginning of a possible main function. */
6287 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
6288 #undef HAS_INIT_SECTION
6289 #define HAS_INIT_SECTION
6293 expand_main_function ()
6295 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
6296 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
6298 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
6301 /* Forcibly align the stack. */
6302 #ifdef STACK_GROWS_DOWNWARD
6303 tmp = expand_simple_binop (Pmode, AND, stack_pointer_rtx, GEN_INT(-align),
6304 stack_pointer_rtx, 1, OPTAB_WIDEN);
6306 tmp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
6307 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
6308 tmp = expand_simple_binop (Pmode, AND, tmp, GEN_INT (-align),
6309 stack_pointer_rtx, 1, OPTAB_WIDEN);
6311 if (tmp != stack_pointer_rtx)
6312 emit_move_insn (stack_pointer_rtx, tmp);
6314 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
6315 tmp = force_reg (Pmode, const0_rtx);
6316 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
6320 #ifndef HAS_INIT_SECTION
6321 emit_library_call (gen_rtx_SYMBOL_REF (Pmode, NAME__MAIN), 0,
6326 extern struct obstack permanent_obstack;
6328 /* The PENDING_SIZES represent the sizes of variable-sized types.
6329 Create RTL for the various sizes now (using temporary variables),
6330 so that we can refer to the sizes from the RTL we are generating
6331 for the current function. The PENDING_SIZES are a TREE_LIST. The
6332 TREE_VALUE of each node is a SAVE_EXPR. */
6335 expand_pending_sizes (pending_sizes)
6340 /* Evaluate now the sizes of any types declared among the arguments. */
6341 for (tem = pending_sizes; tem; tem = TREE_CHAIN (tem))
6343 expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode,
6344 EXPAND_MEMORY_USE_BAD);
6345 /* Flush the queue in case this parameter declaration has
6351 /* Start the RTL for a new function, and set variables used for
6353 SUBR is the FUNCTION_DECL node.
6354 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
6355 the function's parameters, which must be run at any return statement. */
6358 expand_function_start (subr, parms_have_cleanups)
6360 int parms_have_cleanups;
6363 rtx last_ptr = NULL_RTX;
6365 /* Make sure volatile mem refs aren't considered
6366 valid operands of arithmetic insns. */
6367 init_recog_no_volatile ();
6369 /* Set this before generating any memory accesses. */
6370 current_function_check_memory_usage
6371 = (flag_check_memory_usage
6372 && ! DECL_NO_CHECK_MEMORY_USAGE (current_function_decl));
6374 current_function_instrument_entry_exit
6375 = (flag_instrument_function_entry_exit
6376 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
6378 current_function_limit_stack
6379 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
6381 /* If function gets a static chain arg, store it in the stack frame.
6382 Do this first, so it gets the first stack slot offset. */
6383 if (current_function_needs_context)
6385 last_ptr = assign_stack_local (Pmode, GET_MODE_SIZE (Pmode), 0);
6387 /* Delay copying static chain if it is not a register to avoid
6388 conflicts with regs used for parameters. */
6389 if (! SMALL_REGISTER_CLASSES
6390 || GET_CODE (static_chain_incoming_rtx) == REG)
6391 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6394 /* If the parameters of this function need cleaning up, get a label
6395 for the beginning of the code which executes those cleanups. This must
6396 be done before doing anything with return_label. */
6397 if (parms_have_cleanups)
6398 cleanup_label = gen_label_rtx ();
6402 /* Make the label for return statements to jump to. Do not special
6403 case machines with special return instructions -- they will be
6404 handled later during jump, ifcvt, or epilogue creation. */
6405 return_label = gen_label_rtx ();
6407 /* Initialize rtx used to return the value. */
6408 /* Do this before assign_parms so that we copy the struct value address
6409 before any library calls that assign parms might generate. */
6411 /* Decide whether to return the value in memory or in a register. */
6412 if (aggregate_value_p (DECL_RESULT (subr)))
6414 /* Returning something that won't go in a register. */
6415 rtx value_address = 0;
6417 #ifdef PCC_STATIC_STRUCT_RETURN
6418 if (current_function_returns_pcc_struct)
6420 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
6421 value_address = assemble_static_space (size);
6426 /* Expect to be passed the address of a place to store the value.
6427 If it is passed as an argument, assign_parms will take care of
6429 if (struct_value_incoming_rtx)
6431 value_address = gen_reg_rtx (Pmode);
6432 emit_move_insn (value_address, struct_value_incoming_rtx);
6437 rtx x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), value_address);
6438 set_mem_attributes (x, DECL_RESULT (subr), 1);
6439 SET_DECL_RTL (DECL_RESULT (subr), x);
6442 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
6443 /* If return mode is void, this decl rtl should not be used. */
6444 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
6447 /* Compute the return values into a pseudo reg, which we will copy
6448 into the true return register after the cleanups are done. */
6450 /* In order to figure out what mode to use for the pseudo, we
6451 figure out what the mode of the eventual return register will
6452 actually be, and use that. */
6454 = hard_function_value (TREE_TYPE (DECL_RESULT (subr)),
6457 /* Structures that are returned in registers are not aggregate_value_p,
6458 so we may see a PARALLEL. Don't play pseudo games with this. */
6459 if (! REG_P (hard_reg))
6460 SET_DECL_RTL (DECL_RESULT (subr), hard_reg);
6463 /* Create the pseudo. */
6464 SET_DECL_RTL (DECL_RESULT (subr), gen_reg_rtx (GET_MODE (hard_reg)));
6466 /* Needed because we may need to move this to memory
6467 in case it's a named return value whose address is taken. */
6468 DECL_REGISTER (DECL_RESULT (subr)) = 1;
6472 /* Initialize rtx for parameters and local variables.
6473 In some cases this requires emitting insns. */
6475 assign_parms (subr);
6477 /* Copy the static chain now if it wasn't a register. The delay is to
6478 avoid conflicts with the parameter passing registers. */
6480 if (SMALL_REGISTER_CLASSES && current_function_needs_context)
6481 if (GET_CODE (static_chain_incoming_rtx) != REG)
6482 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6484 /* The following was moved from init_function_start.
6485 The move is supposed to make sdb output more accurate. */
6486 /* Indicate the beginning of the function body,
6487 as opposed to parm setup. */
6488 emit_note (NULL, NOTE_INSN_FUNCTION_BEG);
6490 if (GET_CODE (get_last_insn ()) != NOTE)
6491 emit_note (NULL, NOTE_INSN_DELETED);
6492 parm_birth_insn = get_last_insn ();
6494 context_display = 0;
6495 if (current_function_needs_context)
6497 /* Fetch static chain values for containing functions. */
6498 tem = decl_function_context (current_function_decl);
6499 /* Copy the static chain pointer into a pseudo. If we have
6500 small register classes, copy the value from memory if
6501 static_chain_incoming_rtx is a REG. */
6504 /* If the static chain originally came in a register, put it back
6505 there, then move it out in the next insn. The reason for
6506 this peculiar code is to satisfy function integration. */
6507 if (SMALL_REGISTER_CLASSES
6508 && GET_CODE (static_chain_incoming_rtx) == REG)
6509 emit_move_insn (static_chain_incoming_rtx, last_ptr);
6510 last_ptr = copy_to_reg (static_chain_incoming_rtx);
6515 tree rtlexp = make_node (RTL_EXPR);
6517 RTL_EXPR_RTL (rtlexp) = last_ptr;
6518 context_display = tree_cons (tem, rtlexp, context_display);
6519 tem = decl_function_context (tem);
6522 /* Chain thru stack frames, assuming pointer to next lexical frame
6523 is found at the place we always store it. */
6524 #ifdef FRAME_GROWS_DOWNWARD
6525 last_ptr = plus_constant (last_ptr,
6526 -(HOST_WIDE_INT) GET_MODE_SIZE (Pmode));
6528 last_ptr = gen_rtx_MEM (Pmode, memory_address (Pmode, last_ptr));
6529 set_mem_alias_set (last_ptr, get_frame_alias_set ());
6530 last_ptr = copy_to_reg (last_ptr);
6532 /* If we are not optimizing, ensure that we know that this
6533 piece of context is live over the entire function. */
6535 save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, last_ptr,
6540 if (current_function_instrument_entry_exit)
6542 rtx fun = DECL_RTL (current_function_decl);
6543 if (GET_CODE (fun) == MEM)
6544 fun = XEXP (fun, 0);
6547 emit_library_call (profile_function_entry_libfunc, 0, VOIDmode, 2,
6549 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
6551 hard_frame_pointer_rtx),
6557 PROFILE_HOOK (profile_label_no);
6560 /* After the display initializations is where the tail-recursion label
6561 should go, if we end up needing one. Ensure we have a NOTE here
6562 since some things (like trampolines) get placed before this. */
6563 tail_recursion_reentry = emit_note (NULL, NOTE_INSN_DELETED);
6565 /* Evaluate now the sizes of any types declared among the arguments. */
6566 expand_pending_sizes (nreverse (get_pending_sizes ()));
6568 /* Make sure there is a line number after the function entry setup code. */
6569 force_next_line_note ();
6572 /* Undo the effects of init_dummy_function_start. */
6574 expand_dummy_function_end ()
6576 /* End any sequences that failed to be closed due to syntax errors. */
6577 while (in_sequence_p ())
6580 /* Outside function body, can't compute type's actual size
6581 until next function's body starts. */
6583 free_after_parsing (cfun);
6584 free_after_compilation (cfun);
6588 /* Call DOIT for each hard register used as a return value from
6589 the current function. */
6592 diddle_return_value (doit, arg)
6593 void (*doit) PARAMS ((rtx, void *));
6596 rtx outgoing = current_function_return_rtx;
6601 if (GET_CODE (outgoing) == REG)
6602 (*doit) (outgoing, arg);
6603 else if (GET_CODE (outgoing) == PARALLEL)
6607 for (i = 0; i < XVECLEN (outgoing, 0); i++)
6609 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
6611 if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
6618 do_clobber_return_reg (reg, arg)
6620 void *arg ATTRIBUTE_UNUSED;
6622 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
6626 clobber_return_register ()
6628 diddle_return_value (do_clobber_return_reg, NULL);
6630 /* In case we do use pseudo to return value, clobber it too. */
6631 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6633 tree decl_result = DECL_RESULT (current_function_decl);
6634 rtx decl_rtl = DECL_RTL (decl_result);
6635 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
6637 do_clobber_return_reg (decl_rtl, NULL);
6643 do_use_return_reg (reg, arg)
6645 void *arg ATTRIBUTE_UNUSED;
6647 emit_insn (gen_rtx_USE (VOIDmode, reg));
6651 use_return_register ()
6653 diddle_return_value (do_use_return_reg, NULL);
6656 /* Generate RTL for the end of the current function.
6657 FILENAME and LINE are the current position in the source file.
6659 It is up to language-specific callers to do cleanups for parameters--
6660 or else, supply 1 for END_BINDINGS and we will call expand_end_bindings. */
6663 expand_function_end (filename, line, end_bindings)
6664 const char *filename;
6671 #ifdef TRAMPOLINE_TEMPLATE
6672 static rtx initial_trampoline;
6675 finish_expr_for_function ();
6677 /* If arg_pointer_save_area was referenced only from a nested
6678 function, we will not have initialized it yet. Do that now. */
6679 if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
6680 get_arg_pointer_save_area (cfun);
6682 #ifdef NON_SAVING_SETJMP
6683 /* Don't put any variables in registers if we call setjmp
6684 on a machine that fails to restore the registers. */
6685 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
6687 if (DECL_INITIAL (current_function_decl) != error_mark_node)
6688 setjmp_protect (DECL_INITIAL (current_function_decl));
6690 setjmp_protect_args ();
6694 /* Initialize any trampolines required by this function. */
6695 for (link = trampoline_list; link; link = TREE_CHAIN (link))
6697 tree function = TREE_PURPOSE (link);
6698 rtx context ATTRIBUTE_UNUSED = lookup_static_chain (function);
6699 rtx tramp = RTL_EXPR_RTL (TREE_VALUE (link));
6700 #ifdef TRAMPOLINE_TEMPLATE
6705 #ifdef TRAMPOLINE_TEMPLATE
6706 /* First make sure this compilation has a template for
6707 initializing trampolines. */
6708 if (initial_trampoline == 0)
6711 = gen_rtx_MEM (BLKmode, assemble_trampoline_template ());
6713 ggc_add_rtx_root (&initial_trampoline, 1);
6717 /* Generate insns to initialize the trampoline. */
6719 tramp = round_trampoline_addr (XEXP (tramp, 0));
6720 #ifdef TRAMPOLINE_TEMPLATE
6721 blktramp = change_address (initial_trampoline, BLKmode, tramp);
6722 emit_block_move (blktramp, initial_trampoline,
6723 GEN_INT (TRAMPOLINE_SIZE),
6724 TRAMPOLINE_ALIGNMENT);
6726 INITIALIZE_TRAMPOLINE (tramp, XEXP (DECL_RTL (function), 0), context);
6730 /* Put those insns at entry to the containing function (this one). */
6731 emit_insns_before (seq, tail_recursion_reentry);
6734 /* If we are doing stack checking and this function makes calls,
6735 do a stack probe at the start of the function to ensure we have enough
6736 space for another stack frame. */
6737 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
6741 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
6742 if (GET_CODE (insn) == CALL_INSN)
6745 probe_stack_range (STACK_CHECK_PROTECT,
6746 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
6749 emit_insns_before (seq, tail_recursion_reentry);
6754 /* Warn about unused parms if extra warnings were specified. */
6755 /* Either ``-W -Wunused'' or ``-Wunused-parameter'' enables this
6756 warning. WARN_UNUSED_PARAMETER is negative when set by
6758 if (warn_unused_parameter > 0
6759 || (warn_unused_parameter < 0 && extra_warnings))
6763 for (decl = DECL_ARGUMENTS (current_function_decl);
6764 decl; decl = TREE_CHAIN (decl))
6765 if (! TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
6766 && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl))
6767 warning_with_decl (decl, "unused parameter `%s'");
6770 /* Delete handlers for nonlocal gotos if nothing uses them. */
6771 if (nonlocal_goto_handler_slots != 0
6772 && ! current_function_has_nonlocal_label)
6775 /* End any sequences that failed to be closed due to syntax errors. */
6776 while (in_sequence_p ())
6779 /* Outside function body, can't compute type's actual size
6780 until next function's body starts. */
6781 immediate_size_expand--;
6783 clear_pending_stack_adjust ();
6784 do_pending_stack_adjust ();
6786 /* Mark the end of the function body.
6787 If control reaches this insn, the function can drop through
6788 without returning a value. */
6789 emit_note (NULL, NOTE_INSN_FUNCTION_END);
6791 /* Must mark the last line number note in the function, so that the test
6792 coverage code can avoid counting the last line twice. This just tells
6793 the code to ignore the immediately following line note, since there
6794 already exists a copy of this note somewhere above. This line number
6795 note is still needed for debugging though, so we can't delete it. */
6796 if (flag_test_coverage)
6797 emit_note (NULL, NOTE_INSN_REPEATED_LINE_NUMBER);
6799 /* Output a linenumber for the end of the function.
6800 SDB depends on this. */
6801 emit_line_note_force (filename, line);
6803 /* Before the return label (if any), clobber the return
6804 registers so that they are not propogated live to the rest of
6805 the function. This can only happen with functions that drop
6806 through; if there had been a return statement, there would
6807 have either been a return rtx, or a jump to the return label.
6809 We delay actual code generation after the current_function_value_rtx
6811 clobber_after = get_last_insn ();
6813 /* Output the label for the actual return from the function,
6814 if one is expected. This happens either because a function epilogue
6815 is used instead of a return instruction, or because a return was done
6816 with a goto in order to run local cleanups, or because of pcc-style
6817 structure returning. */
6819 emit_label (return_label);
6821 /* C++ uses this. */
6823 expand_end_bindings (0, 0, 0);
6825 if (current_function_instrument_entry_exit)
6827 rtx fun = DECL_RTL (current_function_decl);
6828 if (GET_CODE (fun) == MEM)
6829 fun = XEXP (fun, 0);
6832 emit_library_call (profile_function_exit_libfunc, 0, VOIDmode, 2,
6834 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
6836 hard_frame_pointer_rtx),
6840 /* Let except.c know where it should emit the call to unregister
6841 the function context for sjlj exceptions. */
6842 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
6843 sjlj_emit_function_exit_after (get_last_insn ());
6845 /* If we had calls to alloca, and this machine needs
6846 an accurate stack pointer to exit the function,
6847 insert some code to save and restore the stack pointer. */
6848 #ifdef EXIT_IGNORE_STACK
6849 if (! EXIT_IGNORE_STACK)
6851 if (current_function_calls_alloca)
6855 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
6856 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
6859 /* If scalar return value was computed in a pseudo-reg, or was a named
6860 return value that got dumped to the stack, copy that to the hard
6862 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6864 tree decl_result = DECL_RESULT (current_function_decl);
6865 rtx decl_rtl = DECL_RTL (decl_result);
6867 if (REG_P (decl_rtl)
6868 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
6869 : DECL_REGISTER (decl_result))
6873 #ifdef FUNCTION_OUTGOING_VALUE
6874 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
6875 current_function_decl);
6877 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
6878 current_function_decl);
6880 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
6882 /* If this is a BLKmode structure being returned in registers,
6883 then use the mode computed in expand_return. Note that if
6884 decl_rtl is memory, then its mode may have been changed,
6885 but that current_function_return_rtx has not. */
6886 if (GET_MODE (real_decl_rtl) == BLKmode)
6887 PUT_MODE (real_decl_rtl, GET_MODE (current_function_return_rtx));
6889 /* If a named return value dumped decl_return to memory, then
6890 we may need to re-do the PROMOTE_MODE signed/unsigned
6892 if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
6894 int unsignedp = TREE_UNSIGNED (TREE_TYPE (decl_result));
6896 #ifdef PROMOTE_FUNCTION_RETURN
6897 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
6901 convert_move (real_decl_rtl, decl_rtl, unsignedp);
6903 else if (GET_CODE (real_decl_rtl) == PARALLEL)
6904 emit_group_load (real_decl_rtl, decl_rtl,
6905 int_size_in_bytes (TREE_TYPE (decl_result)),
6906 TYPE_ALIGN (TREE_TYPE (decl_result)));
6908 emit_move_insn (real_decl_rtl, decl_rtl);
6910 /* The delay slot scheduler assumes that current_function_return_rtx
6911 holds the hard register containing the return value, not a
6912 temporary pseudo. */
6913 current_function_return_rtx = real_decl_rtl;
6917 /* If returning a structure, arrange to return the address of the value
6918 in a place where debuggers expect to find it.
6920 If returning a structure PCC style,
6921 the caller also depends on this value.
6922 And current_function_returns_pcc_struct is not necessarily set. */
6923 if (current_function_returns_struct
6924 || current_function_returns_pcc_struct)
6927 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
6928 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
6929 #ifdef FUNCTION_OUTGOING_VALUE
6931 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
6932 current_function_decl);
6935 = FUNCTION_VALUE (build_pointer_type (type), current_function_decl);
6938 /* Mark this as a function return value so integrate will delete the
6939 assignment and USE below when inlining this function. */
6940 REG_FUNCTION_VALUE_P (outgoing) = 1;
6942 #ifdef POINTERS_EXTEND_UNSIGNED
6943 /* The address may be ptr_mode and OUTGOING may be Pmode. */
6944 if (GET_MODE (outgoing) != GET_MODE (value_address))
6945 value_address = convert_memory_address (GET_MODE (outgoing),
6949 emit_move_insn (outgoing, value_address);
6951 /* Show return register used to hold result (in this case the address
6953 current_function_return_rtx = outgoing;
6956 /* If this is an implementation of throw, do what's necessary to
6957 communicate between __builtin_eh_return and the epilogue. */
6958 expand_eh_return ();
6960 /* Emit the actual code to clobber return register. */
6965 clobber_return_register ();
6966 seq = gen_sequence ();
6969 after = emit_insn_after (seq, clobber_after);
6971 if (clobber_after != after)
6972 cfun->x_clobber_return_insn = after;
6975 /* ??? This should no longer be necessary since stupid is no longer with
6976 us, but there are some parts of the compiler (eg reload_combine, and
6977 sh mach_dep_reorg) that still try and compute their own lifetime info
6978 instead of using the general framework. */
6979 use_return_register ();
6981 /* Fix up any gotos that jumped out to the outermost
6982 binding level of the function.
6983 Must follow emitting RETURN_LABEL. */
6985 /* If you have any cleanups to do at this point,
6986 and they need to create temporary variables,
6987 then you will lose. */
6988 expand_fixups (get_insns ());
6992 get_arg_pointer_save_area (f)
6995 rtx ret = f->x_arg_pointer_save_area;
6999 ret = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, f);
7000 f->x_arg_pointer_save_area = ret;
7003 if (f == cfun && ! f->arg_pointer_save_area_init)
7007 /* Save the arg pointer at the beginning of the function. The
7008 generated stack slot may not be a valid memory address, so we
7009 have to check it and fix it if necessary. */
7011 emit_move_insn (validize_mem (ret), virtual_incoming_args_rtx);
7012 seq = gen_sequence ();
7015 push_topmost_sequence ();
7016 emit_insn_after (seq, get_insns ());
7017 pop_topmost_sequence ();
7023 /* Extend a vector that records the INSN_UIDs of INSNS (either a
7024 sequence or a single insn). */
7027 record_insns (insns, vecp)
7031 if (GET_CODE (insns) == SEQUENCE)
7033 int len = XVECLEN (insns, 0);
7034 int i = VARRAY_SIZE (*vecp);
7036 VARRAY_GROW (*vecp, i + len);
7039 VARRAY_INT (*vecp, i) = INSN_UID (XVECEXP (insns, 0, len));
7045 int i = VARRAY_SIZE (*vecp);
7046 VARRAY_GROW (*vecp, i + 1);
7047 VARRAY_INT (*vecp, i) = INSN_UID (insns);
7051 /* Determine how many INSN_UIDs in VEC are part of INSN. */
7054 contains (insn, vec)
7060 if (GET_CODE (insn) == INSN
7061 && GET_CODE (PATTERN (insn)) == SEQUENCE)
7064 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
7065 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7066 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j))
7072 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7073 if (INSN_UID (insn) == VARRAY_INT (vec, j))
7080 prologue_epilogue_contains (insn)
7083 if (contains (insn, prologue))
7085 if (contains (insn, epilogue))
7091 sibcall_epilogue_contains (insn)
7094 if (sibcall_epilogue)
7095 return contains (insn, sibcall_epilogue);
7100 /* Insert gen_return at the end of block BB. This also means updating
7101 block_for_insn appropriately. */
7104 emit_return_into_block (bb, line_note)
7110 p = NEXT_INSN (bb->end);
7111 end = emit_jump_insn_after (gen_return (), bb->end);
7113 emit_line_note_after (NOTE_SOURCE_FILE (line_note),
7114 NOTE_LINE_NUMBER (line_note), PREV_INSN (bb->end));
7116 #endif /* HAVE_return */
7118 #ifdef HAVE_epilogue
7120 /* Modify SEQ, a SEQUENCE that is part of the epilogue, to no modifications
7121 to the stack pointer. */
7124 keep_stack_depressed (seq)
7128 rtx sp_from_reg = 0;
7129 int sp_modified_unknown = 0;
7131 /* If the epilogue is just a single instruction, it's OK as is */
7133 if (GET_CODE (seq) != SEQUENCE)
7136 /* Scan all insns in SEQ looking for ones that modified the stack
7137 pointer. Record if it modified the stack pointer by copying it
7138 from the frame pointer or if it modified it in some other way.
7139 Then modify any subsequent stack pointer references to take that
7140 into account. We start by only allowing SP to be copied from a
7141 register (presumably FP) and then be subsequently referenced. */
7143 for (i = 0; i < XVECLEN (seq, 0); i++)
7145 rtx insn = XVECEXP (seq, 0, i);
7147 if (GET_RTX_CLASS (GET_CODE (insn)) != 'i')
7150 if (reg_set_p (stack_pointer_rtx, insn))
7152 rtx set = single_set (insn);
7154 /* If SP is set as a side-effect, we can't support this. */
7158 if (GET_CODE (SET_SRC (set)) == REG)
7159 sp_from_reg = SET_SRC (set);
7161 sp_modified_unknown = 1;
7163 /* Don't allow the SP modification to happen. We don't call
7164 delete_insn here since INSN isn't in any chain. */
7165 PUT_CODE (insn, NOTE);
7166 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
7167 NOTE_SOURCE_FILE (insn) = 0;
7169 else if (reg_referenced_p (stack_pointer_rtx, PATTERN (insn)))
7171 if (sp_modified_unknown)
7174 else if (sp_from_reg != 0)
7176 = replace_rtx (PATTERN (insn), stack_pointer_rtx, sp_from_reg);
7182 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
7183 this into place with notes indicating where the prologue ends and where
7184 the epilogue begins. Update the basic block information when possible. */
7187 thread_prologue_and_epilogue_insns (f)
7188 rtx f ATTRIBUTE_UNUSED;
7193 #ifdef HAVE_prologue
7194 rtx prologue_end = NULL_RTX;
7196 #if defined (HAVE_epilogue) || defined(HAVE_return)
7197 rtx epilogue_end = NULL_RTX;
7200 #ifdef HAVE_prologue
7204 seq = gen_prologue ();
7207 /* Retain a map of the prologue insns. */
7208 if (GET_CODE (seq) != SEQUENCE)
7210 record_insns (seq, &prologue);
7211 prologue_end = emit_note (NULL, NOTE_INSN_PROLOGUE_END);
7213 seq = gen_sequence ();
7216 /* Can't deal with multiple successsors of the entry block
7217 at the moment. Function should always have at least one
7219 if (!ENTRY_BLOCK_PTR->succ || ENTRY_BLOCK_PTR->succ->succ_next)
7222 insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ);
7227 /* If the exit block has no non-fake predecessors, we don't need
7229 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7230 if ((e->flags & EDGE_FAKE) == 0)
7236 if (optimize && HAVE_return)
7238 /* If we're allowed to generate a simple return instruction,
7239 then by definition we don't need a full epilogue. Examine
7240 the block that falls through to EXIT. If it does not
7241 contain any code, examine its predecessors and try to
7242 emit (conditional) return instructions. */
7248 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7249 if (e->flags & EDGE_FALLTHRU)
7255 /* Verify that there are no active instructions in the last block. */
7257 while (label && GET_CODE (label) != CODE_LABEL)
7259 if (active_insn_p (label))
7261 label = PREV_INSN (label);
7264 if (last->head == label && GET_CODE (label) == CODE_LABEL)
7266 rtx epilogue_line_note = NULL_RTX;
7268 /* Locate the line number associated with the closing brace,
7269 if we can find one. */
7270 for (seq = get_last_insn ();
7271 seq && ! active_insn_p (seq);
7272 seq = PREV_INSN (seq))
7273 if (GET_CODE (seq) == NOTE && NOTE_LINE_NUMBER (seq) > 0)
7275 epilogue_line_note = seq;
7279 for (e = last->pred; e; e = e_next)
7281 basic_block bb = e->src;
7284 e_next = e->pred_next;
7285 if (bb == ENTRY_BLOCK_PTR)
7289 if ((GET_CODE (jump) != JUMP_INSN) || JUMP_LABEL (jump) != label)
7292 /* If we have an unconditional jump, we can replace that
7293 with a simple return instruction. */
7294 if (simplejump_p (jump))
7296 emit_return_into_block (bb, epilogue_line_note);
7300 /* If we have a conditional jump, we can try to replace
7301 that with a conditional return instruction. */
7302 else if (condjump_p (jump))
7306 ret = SET_SRC (PATTERN (jump));
7307 if (GET_CODE (XEXP (ret, 1)) == LABEL_REF)
7308 loc = &XEXP (ret, 1);
7310 loc = &XEXP (ret, 2);
7311 ret = gen_rtx_RETURN (VOIDmode);
7313 if (! validate_change (jump, loc, ret, 0))
7315 if (JUMP_LABEL (jump))
7316 LABEL_NUSES (JUMP_LABEL (jump))--;
7318 /* If this block has only one successor, it both jumps
7319 and falls through to the fallthru block, so we can't
7321 if (bb->succ->succ_next == NULL)
7327 /* Fix up the CFG for the successful change we just made. */
7328 redirect_edge_succ (e, EXIT_BLOCK_PTR);
7331 /* Emit a return insn for the exit fallthru block. Whether
7332 this is still reachable will be determined later. */
7334 emit_barrier_after (last->end);
7335 emit_return_into_block (last, epilogue_line_note);
7336 epilogue_end = last->end;
7337 last->succ->flags &= ~EDGE_FALLTHRU;
7342 #ifdef HAVE_epilogue
7345 /* Find the edge that falls through to EXIT. Other edges may exist
7346 due to RETURN instructions, but those don't need epilogues.
7347 There really shouldn't be a mixture -- either all should have
7348 been converted or none, however... */
7350 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7351 if (e->flags & EDGE_FALLTHRU)
7357 epilogue_end = emit_note (NULL, NOTE_INSN_EPILOGUE_BEG);
7359 seq = gen_epilogue ();
7361 /* If this function returns with the stack depressed, massage
7362 the epilogue to actually do that. */
7363 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
7364 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
7365 keep_stack_depressed (seq);
7367 emit_jump_insn (seq);
7369 /* Retain a map of the epilogue insns. */
7370 if (GET_CODE (seq) != SEQUENCE)
7372 record_insns (seq, &epilogue);
7374 seq = gen_sequence ();
7377 insert_insn_on_edge (seq, e);
7384 commit_edge_insertions ();
7386 #ifdef HAVE_sibcall_epilogue
7387 /* Emit sibling epilogues before any sibling call sites. */
7388 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7390 basic_block bb = e->src;
7395 if (GET_CODE (insn) != CALL_INSN
7396 || ! SIBLING_CALL_P (insn))
7400 seq = gen_sibcall_epilogue ();
7403 i = PREV_INSN (insn);
7404 newinsn = emit_insn_before (seq, insn);
7406 /* Retain a map of the epilogue insns. Used in life analysis to
7407 avoid getting rid of sibcall epilogue insns. */
7408 record_insns (GET_CODE (seq) == SEQUENCE
7409 ? seq : newinsn, &sibcall_epilogue);
7413 #ifdef HAVE_prologue
7418 /* GDB handles `break f' by setting a breakpoint on the first
7419 line note after the prologue. Which means (1) that if
7420 there are line number notes before where we inserted the
7421 prologue we should move them, and (2) we should generate a
7422 note before the end of the first basic block, if there isn't
7425 ??? This behaviour is completely broken when dealing with
7426 multiple entry functions. We simply place the note always
7427 into first basic block and let alternate entry points
7431 for (insn = prologue_end; insn; insn = prev)
7433 prev = PREV_INSN (insn);
7434 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7436 /* Note that we cannot reorder the first insn in the
7437 chain, since rest_of_compilation relies on that
7438 remaining constant. */
7441 reorder_insns (insn, insn, prologue_end);
7445 /* Find the last line number note in the first block. */
7446 for (insn = BASIC_BLOCK (0)->end;
7447 insn != prologue_end && insn;
7448 insn = PREV_INSN (insn))
7449 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7452 /* If we didn't find one, make a copy of the first line number
7456 for (insn = next_active_insn (prologue_end);
7458 insn = PREV_INSN (insn))
7459 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7461 emit_line_note_after (NOTE_SOURCE_FILE (insn),
7462 NOTE_LINE_NUMBER (insn),
7469 #ifdef HAVE_epilogue
7474 /* Similarly, move any line notes that appear after the epilogue.
7475 There is no need, however, to be quite so anal about the existance
7477 for (insn = epilogue_end; insn; insn = next)
7479 next = NEXT_INSN (insn);
7480 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7481 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
7487 /* Reposition the prologue-end and epilogue-begin notes after instruction
7488 scheduling and delayed branch scheduling. */
7491 reposition_prologue_and_epilogue_notes (f)
7492 rtx f ATTRIBUTE_UNUSED;
7494 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
7497 if ((len = VARRAY_SIZE (prologue)) > 0)
7501 /* Scan from the beginning until we reach the last prologue insn.
7502 We apparently can't depend on basic_block_{head,end} after
7504 for (insn = f; len && insn; insn = NEXT_INSN (insn))
7506 if (GET_CODE (insn) == NOTE)
7508 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
7511 else if ((len -= contains (insn, prologue)) == 0)
7514 /* Find the prologue-end note if we haven't already, and
7515 move it to just after the last prologue insn. */
7518 for (note = insn; (note = NEXT_INSN (note));)
7519 if (GET_CODE (note) == NOTE
7520 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
7524 next = NEXT_INSN (note);
7526 /* Whether or not we can depend on BLOCK_HEAD,
7527 attempt to keep it up-to-date. */
7528 if (BLOCK_HEAD (0) == note)
7529 BLOCK_HEAD (0) = next;
7532 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
7533 if (GET_CODE (insn) == CODE_LABEL)
7534 insn = NEXT_INSN (insn);
7535 add_insn_after (note, insn);
7540 if ((len = VARRAY_SIZE (epilogue)) > 0)
7544 /* Scan from the end until we reach the first epilogue insn.
7545 We apparently can't depend on basic_block_{head,end} after
7547 for (insn = get_last_insn (); len && insn; insn = PREV_INSN (insn))
7549 if (GET_CODE (insn) == NOTE)
7551 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
7554 else if ((len -= contains (insn, epilogue)) == 0)
7556 /* Find the epilogue-begin note if we haven't already, and
7557 move it to just before the first epilogue insn. */
7560 for (note = insn; (note = PREV_INSN (note));)
7561 if (GET_CODE (note) == NOTE
7562 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
7566 /* Whether or not we can depend on BLOCK_HEAD,
7567 attempt to keep it up-to-date. */
7569 && BLOCK_HEAD (n_basic_blocks-1) == insn)
7570 BLOCK_HEAD (n_basic_blocks-1) = note;
7573 add_insn_before (note, insn);
7577 #endif /* HAVE_prologue or HAVE_epilogue */
7580 /* Mark P for GC. */
7583 mark_function_status (p)
7586 struct var_refs_queue *q;
7587 struct temp_slot *t;
7594 ggc_mark_rtx (p->arg_offset_rtx);
7596 if (p->x_parm_reg_stack_loc)
7597 for (i = p->x_max_parm_reg, r = p->x_parm_reg_stack_loc;
7601 ggc_mark_rtx (p->return_rtx);
7602 ggc_mark_rtx (p->x_cleanup_label);
7603 ggc_mark_rtx (p->x_return_label);
7604 ggc_mark_rtx (p->x_save_expr_regs);
7605 ggc_mark_rtx (p->x_stack_slot_list);
7606 ggc_mark_rtx (p->x_parm_birth_insn);
7607 ggc_mark_rtx (p->x_tail_recursion_label);
7608 ggc_mark_rtx (p->x_tail_recursion_reentry);
7609 ggc_mark_rtx (p->internal_arg_pointer);
7610 ggc_mark_rtx (p->x_arg_pointer_save_area);
7611 ggc_mark_tree (p->x_rtl_expr_chain);
7612 ggc_mark_rtx (p->x_last_parm_insn);
7613 ggc_mark_tree (p->x_context_display);
7614 ggc_mark_tree (p->x_trampoline_list);
7615 ggc_mark_rtx (p->epilogue_delay_list);
7616 ggc_mark_rtx (p->x_clobber_return_insn);
7618 for (t = p->x_temp_slots; t != 0; t = t->next)
7621 ggc_mark_rtx (t->slot);
7622 ggc_mark_rtx (t->address);
7623 ggc_mark_tree (t->rtl_expr);
7624 ggc_mark_tree (t->type);
7627 for (q = p->fixup_var_refs_queue; q != 0; q = q->next)
7630 ggc_mark_rtx (q->modified);
7633 ggc_mark_rtx (p->x_nonlocal_goto_handler_slots);
7634 ggc_mark_rtx (p->x_nonlocal_goto_handler_labels);
7635 ggc_mark_rtx (p->x_nonlocal_goto_stack_level);
7636 ggc_mark_tree (p->x_nonlocal_labels);
7638 mark_hard_reg_initial_vals (p);
7641 /* Mark the struct function pointed to by *ARG for GC, if it is not
7642 NULL. This is used to mark the current function and the outer
7646 maybe_mark_struct_function (arg)
7649 struct function *f = *(struct function **) arg;
7654 ggc_mark_struct_function (f);
7657 /* Mark a struct function * for GC. This is called from ggc-common.c. */
7660 ggc_mark_struct_function (f)
7664 ggc_mark_tree (f->decl);
7666 mark_function_status (f);
7667 mark_eh_status (f->eh);
7668 mark_stmt_status (f->stmt);
7669 mark_expr_status (f->expr);
7670 mark_emit_status (f->emit);
7671 mark_varasm_status (f->varasm);
7673 if (mark_machine_status)
7674 (*mark_machine_status) (f);
7675 if (mark_lang_status)
7676 (*mark_lang_status) (f);
7678 if (f->original_arg_vector)
7679 ggc_mark_rtvec ((rtvec) f->original_arg_vector);
7680 if (f->original_decl_initial)
7681 ggc_mark_tree (f->original_decl_initial);
7683 ggc_mark_struct_function (f->outer);
7686 /* Called once, at initialization, to initialize function.c. */
7689 init_function_once ()
7691 ggc_add_root (&cfun, 1, sizeof cfun, maybe_mark_struct_function);
7692 ggc_add_root (&outer_function_chain, 1, sizeof outer_function_chain,
7693 maybe_mark_struct_function);
7695 VARRAY_INT_INIT (prologue, 0, "prologue");
7696 VARRAY_INT_INIT (epilogue, 0, "epilogue");
7697 VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue");