1 /* Expands front end tree to back end RTL for GNU C-Compiler
2 Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
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"
62 #include "langhooks.h"
64 #ifndef TRAMPOLINE_ALIGNMENT
65 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
68 #ifndef LOCAL_ALIGNMENT
69 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
72 /* Some systems use __main in a way incompatible with its use in gcc, in these
73 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
74 give the same symbol without quotes for an alternative entry point. You
75 must define both, or neither. */
77 #define NAME__MAIN "__main"
78 #define SYMBOL__MAIN __main
81 /* Round a value to the lowest integer less than it that is a multiple of
82 the required alignment. Avoid using division in case the value is
83 negative. Assume the alignment is a power of two. */
84 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
86 /* Similar, but round to the next highest integer that meets the
88 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
90 /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
91 during rtl generation. If they are different register numbers, this is
92 always true. It may also be true if
93 FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
94 generation. See fix_lexical_addr for details. */
96 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
97 #define NEED_SEPARATE_AP
100 /* Nonzero if function being compiled doesn't contain any calls
101 (ignoring the prologue and epilogue). This is set prior to
102 local register allocation and is valid for the remaining
104 int current_function_is_leaf;
106 /* Nonzero if function being compiled doesn't contain any instructions
107 that can throw an exception. This is set prior to final. */
109 int current_function_nothrow;
111 /* Nonzero if function being compiled doesn't modify the stack pointer
112 (ignoring the prologue and epilogue). This is only valid after
113 life_analysis has run. */
114 int current_function_sp_is_unchanging;
116 /* Nonzero if the function being compiled is a leaf function which only
117 uses leaf registers. This is valid after reload (specifically after
118 sched2) and is useful only if the port defines LEAF_REGISTERS. */
119 int current_function_uses_only_leaf_regs;
121 /* Nonzero once virtual register instantiation has been done.
122 assign_stack_local uses frame_pointer_rtx when this is nonzero.
123 calls.c:emit_library_call_value_1 uses it to set up
124 post-instantiation libcalls. */
125 int virtuals_instantiated;
127 /* Assign unique numbers to labels generated for profiling. */
128 static int profile_label_no;
130 /* These variables hold pointers to functions to create and destroy
131 target specific, per-function data structures. */
132 struct machine_function * (*init_machine_status) PARAMS ((void));
134 /* The FUNCTION_DECL for an inline function currently being expanded. */
135 tree inline_function_decl;
137 /* The currently compiled function. */
138 struct function *cfun = 0;
140 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
141 static GTY(()) varray_type prologue;
142 static GTY(()) varray_type epilogue;
144 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
146 static GTY(()) varray_type sibcall_epilogue;
148 /* In order to evaluate some expressions, such as function calls returning
149 structures in memory, we need to temporarily allocate stack locations.
150 We record each allocated temporary in the following structure.
152 Associated with each temporary slot is a nesting level. When we pop up
153 one level, all temporaries associated with the previous level are freed.
154 Normally, all temporaries are freed after the execution of the statement
155 in which they were created. However, if we are inside a ({...}) grouping,
156 the result may be in a temporary and hence must be preserved. If the
157 result could be in a temporary, we preserve it if we can determine which
158 one it is in. If we cannot determine which temporary may contain the
159 result, all temporaries are preserved. A temporary is preserved by
160 pretending it was allocated at the previous nesting level.
162 Automatic variables are also assigned temporary slots, at the nesting
163 level where they are defined. They are marked a "kept" so that
164 free_temp_slots will not free them. */
166 struct temp_slot GTY(())
168 /* Points to next temporary slot. */
169 struct temp_slot *next;
170 /* The rtx to used to reference the slot. */
172 /* The rtx used to represent the address if not the address of the
173 slot above. May be an EXPR_LIST if multiple addresses exist. */
175 /* The alignment (in bits) of the slot. */
177 /* The size, in units, of the slot. */
179 /* The type of the object in the slot, or zero if it doesn't correspond
180 to a type. We use this to determine whether a slot can be reused.
181 It can be reused if objects of the type of the new slot will always
182 conflict with objects of the type of the old slot. */
184 /* The value of `sequence_rtl_expr' when this temporary is allocated. */
186 /* Non-zero if this temporary is currently in use. */
188 /* Non-zero if this temporary has its address taken. */
190 /* Nesting level at which this slot is being used. */
192 /* Non-zero if this should survive a call to free_temp_slots. */
194 /* The offset of the slot from the frame_pointer, including extra space
195 for alignment. This info is for combine_temp_slots. */
196 HOST_WIDE_INT base_offset;
197 /* The size of the slot, including extra space for alignment. This
198 info is for combine_temp_slots. */
199 HOST_WIDE_INT full_size;
202 /* This structure is used to record MEMs or pseudos used to replace VAR, any
203 SUBREGs of VAR, and any MEMs containing VAR as an address. We need to
204 maintain this list in case two operands of an insn were required to match;
205 in that case we must ensure we use the same replacement. */
207 struct fixup_replacement GTY(())
211 struct fixup_replacement *next;
214 struct insns_for_mem_entry
218 /* These are the INSNs which reference the MEM. */
222 /* Forward declarations. */
224 static rtx assign_stack_local_1 PARAMS ((enum machine_mode, HOST_WIDE_INT,
225 int, struct function *));
226 static struct temp_slot *find_temp_slot_from_address PARAMS ((rtx));
227 static void put_reg_into_stack PARAMS ((struct function *, rtx, tree,
228 enum machine_mode, enum machine_mode,
229 int, unsigned int, int,
231 static void schedule_fixup_var_refs PARAMS ((struct function *, rtx, tree,
234 static void fixup_var_refs PARAMS ((rtx, enum machine_mode, int, rtx,
236 static struct fixup_replacement
237 *find_fixup_replacement PARAMS ((struct fixup_replacement **, rtx));
238 static void fixup_var_refs_insns PARAMS ((rtx, rtx, enum machine_mode,
240 static void fixup_var_refs_insns_with_hash
241 PARAMS ((htab_t, rtx,
242 enum machine_mode, int, rtx));
243 static void fixup_var_refs_insn PARAMS ((rtx, rtx, enum machine_mode,
245 static void fixup_var_refs_1 PARAMS ((rtx, enum machine_mode, rtx *, rtx,
246 struct fixup_replacement **, rtx));
247 static rtx fixup_memory_subreg PARAMS ((rtx, rtx, enum machine_mode, int));
248 static rtx walk_fixup_memory_subreg PARAMS ((rtx, rtx, enum machine_mode,
250 static rtx fixup_stack_1 PARAMS ((rtx, rtx));
251 static void optimize_bit_field PARAMS ((rtx, rtx, rtx *));
252 static void instantiate_decls PARAMS ((tree, int));
253 static void instantiate_decls_1 PARAMS ((tree, int));
254 static void instantiate_decl PARAMS ((rtx, HOST_WIDE_INT, int));
255 static rtx instantiate_new_reg PARAMS ((rtx, HOST_WIDE_INT *));
256 static int instantiate_virtual_regs_1 PARAMS ((rtx *, rtx, int));
257 static void delete_handlers PARAMS ((void));
258 static void pad_to_arg_alignment PARAMS ((struct args_size *, int,
259 struct args_size *));
260 #ifndef ARGS_GROW_DOWNWARD
261 static void pad_below PARAMS ((struct args_size *, enum machine_mode,
264 static rtx round_trampoline_addr PARAMS ((rtx));
265 static rtx adjust_trampoline_addr PARAMS ((rtx));
266 static tree *identify_blocks_1 PARAMS ((rtx, tree *, tree *, tree *));
267 static void reorder_blocks_0 PARAMS ((tree));
268 static void reorder_blocks_1 PARAMS ((rtx, tree, varray_type *));
269 static void reorder_fix_fragments PARAMS ((tree));
270 static tree blocks_nreverse PARAMS ((tree));
271 static int all_blocks PARAMS ((tree, tree *));
272 static tree *get_block_vector PARAMS ((tree, int *));
273 extern tree debug_find_var_in_block_tree PARAMS ((tree, tree));
274 /* We always define `record_insns' even if its not used so that we
275 can always export `prologue_epilogue_contains'. */
276 static void record_insns PARAMS ((rtx, varray_type *)) ATTRIBUTE_UNUSED;
277 static int contains PARAMS ((rtx, varray_type));
279 static void emit_return_into_block PARAMS ((basic_block, rtx));
281 static void put_addressof_into_stack PARAMS ((rtx, htab_t));
282 static bool purge_addressof_1 PARAMS ((rtx *, rtx, int, int,
284 static void purge_single_hard_subreg_set PARAMS ((rtx));
285 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
286 static rtx keep_stack_depressed PARAMS ((rtx));
288 static int is_addressof PARAMS ((rtx *, void *));
289 static hashval_t insns_for_mem_hash PARAMS ((const void *));
290 static int insns_for_mem_comp PARAMS ((const void *, const void *));
291 static int insns_for_mem_walk PARAMS ((rtx *, void *));
292 static void compute_insns_for_mem PARAMS ((rtx, rtx, htab_t));
293 static void prepare_function_start PARAMS ((void));
294 static void do_clobber_return_reg PARAMS ((rtx, void *));
295 static void do_use_return_reg PARAMS ((rtx, void *));
297 /* Pointer to chain of `struct function' for containing functions. */
298 static GTY(()) struct function *outer_function_chain;
300 /* Given a function decl for a containing function,
301 return the `struct function' for it. */
304 find_function_data (decl)
309 for (p = outer_function_chain; p; p = p->outer)
316 /* Save the current context for compilation of a nested function.
317 This is called from language-specific code. The caller should use
318 the enter_nested langhook to save any language-specific state,
319 since this function knows only about language-independent
323 push_function_context_to (context)
330 if (context == current_function_decl)
331 cfun->contains_functions = 1;
334 struct function *containing = find_function_data (context);
335 containing->contains_functions = 1;
340 init_dummy_function_start ();
343 p->outer = outer_function_chain;
344 outer_function_chain = p;
345 p->fixup_var_refs_queue = 0;
347 (*lang_hooks.function.enter_nested) (p);
353 push_function_context ()
355 push_function_context_to (current_function_decl);
358 /* Restore the last saved context, at the end of a nested function.
359 This function is called from language-specific code. */
362 pop_function_context_from (context)
363 tree context ATTRIBUTE_UNUSED;
365 struct function *p = outer_function_chain;
366 struct var_refs_queue *queue;
369 outer_function_chain = p->outer;
371 current_function_decl = p->decl;
374 restore_emit_status (p);
376 (*lang_hooks.function.leave_nested) (p);
378 /* Finish doing put_var_into_stack for any of our variables which became
379 addressable during the nested function. If only one entry has to be
380 fixed up, just do that one. Otherwise, first make a list of MEMs that
381 are not to be unshared. */
382 if (p->fixup_var_refs_queue == 0)
384 else if (p->fixup_var_refs_queue->next == 0)
385 fixup_var_refs (p->fixup_var_refs_queue->modified,
386 p->fixup_var_refs_queue->promoted_mode,
387 p->fixup_var_refs_queue->unsignedp,
388 p->fixup_var_refs_queue->modified, 0);
393 for (queue = p->fixup_var_refs_queue; queue; queue = queue->next)
394 list = gen_rtx_EXPR_LIST (VOIDmode, queue->modified, list);
396 for (queue = p->fixup_var_refs_queue; queue; queue = queue->next)
397 fixup_var_refs (queue->modified, queue->promoted_mode,
398 queue->unsignedp, list, 0);
402 p->fixup_var_refs_queue = 0;
404 /* Reset variables that have known state during rtx generation. */
405 rtx_equal_function_value_matters = 1;
406 virtuals_instantiated = 0;
407 generating_concat_p = 1;
411 pop_function_context ()
413 pop_function_context_from (current_function_decl);
416 /* Clear out all parts of the state in F that can safely be discarded
417 after the function has been parsed, but not compiled, to let
418 garbage collection reclaim the memory. */
421 free_after_parsing (f)
424 /* f->expr->forced_labels is used by code generation. */
425 /* f->emit->regno_reg_rtx is used by code generation. */
426 /* f->varasm is used by code generation. */
427 /* f->eh->eh_return_stub_label is used by code generation. */
429 (*lang_hooks.function.final) (f);
433 /* Clear out all parts of the state in F that can safely be discarded
434 after the function has been compiled, to let garbage collection
435 reclaim the memory. */
438 free_after_compilation (f)
447 f->x_temp_slots = NULL;
448 f->arg_offset_rtx = NULL;
449 f->return_rtx = NULL;
450 f->internal_arg_pointer = NULL;
451 f->x_nonlocal_labels = NULL;
452 f->x_nonlocal_goto_handler_slots = NULL;
453 f->x_nonlocal_goto_handler_labels = NULL;
454 f->x_nonlocal_goto_stack_level = NULL;
455 f->x_cleanup_label = NULL;
456 f->x_return_label = NULL;
457 f->x_save_expr_regs = NULL;
458 f->x_stack_slot_list = NULL;
459 f->x_rtl_expr_chain = NULL;
460 f->x_tail_recursion_label = NULL;
461 f->x_tail_recursion_reentry = NULL;
462 f->x_arg_pointer_save_area = NULL;
463 f->x_clobber_return_insn = NULL;
464 f->x_context_display = NULL;
465 f->x_trampoline_list = NULL;
466 f->x_parm_birth_insn = NULL;
467 f->x_last_parm_insn = NULL;
468 f->x_parm_reg_stack_loc = NULL;
469 f->fixup_var_refs_queue = NULL;
470 f->original_arg_vector = NULL;
471 f->original_decl_initial = NULL;
472 f->inl_last_parm_insn = NULL;
473 f->epilogue_delay_list = NULL;
476 /* Allocate fixed slots in the stack frame of the current function. */
478 /* Return size needed for stack frame based on slots so far allocated in
480 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
481 the caller may have to do that. */
484 get_func_frame_size (f)
487 #ifdef FRAME_GROWS_DOWNWARD
488 return -f->x_frame_offset;
490 return f->x_frame_offset;
494 /* Return size needed for stack frame based on slots so far allocated.
495 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
496 the caller may have to do that. */
500 return get_func_frame_size (cfun);
503 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
504 with machine mode MODE.
506 ALIGN controls the amount of alignment for the address of the slot:
507 0 means according to MODE,
508 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
509 positive specifies alignment boundary in bits.
511 We do not round to stack_boundary here.
513 FUNCTION specifies the function to allocate in. */
516 assign_stack_local_1 (mode, size, align, function)
517 enum machine_mode mode;
520 struct function *function;
523 int bigend_correction = 0;
525 int frame_off, frame_alignment, frame_phase;
532 alignment = BIGGEST_ALIGNMENT;
534 alignment = GET_MODE_ALIGNMENT (mode);
536 /* Allow the target to (possibly) increase the alignment of this
538 type = (*lang_hooks.types.type_for_mode) (mode, 0);
540 alignment = LOCAL_ALIGNMENT (type, alignment);
542 alignment /= BITS_PER_UNIT;
544 else if (align == -1)
546 alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
547 size = CEIL_ROUND (size, alignment);
550 alignment = align / BITS_PER_UNIT;
552 #ifdef FRAME_GROWS_DOWNWARD
553 function->x_frame_offset -= size;
556 /* Ignore alignment we can't do with expected alignment of the boundary. */
557 if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY)
558 alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
560 if (function->stack_alignment_needed < alignment * BITS_PER_UNIT)
561 function->stack_alignment_needed = alignment * BITS_PER_UNIT;
563 /* Calculate how many bytes the start of local variables is off from
565 frame_alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
566 frame_off = STARTING_FRAME_OFFSET % frame_alignment;
567 frame_phase = frame_off ? frame_alignment - frame_off : 0;
569 /* Round frame offset to that alignment.
570 We must be careful here, since FRAME_OFFSET might be negative and
571 division with a negative dividend isn't as well defined as we might
572 like. So we instead assume that ALIGNMENT is a power of two and
573 use logical operations which are unambiguous. */
574 #ifdef FRAME_GROWS_DOWNWARD
575 function->x_frame_offset = FLOOR_ROUND (function->x_frame_offset - frame_phase, alignment) + frame_phase;
577 function->x_frame_offset = CEIL_ROUND (function->x_frame_offset - frame_phase, alignment) + frame_phase;
580 /* On a big-endian machine, if we are allocating more space than we will use,
581 use the least significant bytes of those that are allocated. */
582 if (BYTES_BIG_ENDIAN && mode != BLKmode)
583 bigend_correction = size - GET_MODE_SIZE (mode);
585 /* If we have already instantiated virtual registers, return the actual
586 address relative to the frame pointer. */
587 if (function == cfun && virtuals_instantiated)
588 addr = plus_constant (frame_pointer_rtx,
589 (frame_offset + bigend_correction
590 + STARTING_FRAME_OFFSET));
592 addr = plus_constant (virtual_stack_vars_rtx,
593 function->x_frame_offset + bigend_correction);
595 #ifndef FRAME_GROWS_DOWNWARD
596 function->x_frame_offset += size;
599 x = gen_rtx_MEM (mode, addr);
601 function->x_stack_slot_list
602 = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list);
607 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
611 assign_stack_local (mode, size, align)
612 enum machine_mode mode;
616 return assign_stack_local_1 (mode, size, align, cfun);
619 /* Allocate a temporary stack slot and record it for possible later
622 MODE is the machine mode to be given to the returned rtx.
624 SIZE is the size in units of the space required. We do no rounding here
625 since assign_stack_local will do any required rounding.
627 KEEP is 1 if this slot is to be retained after a call to
628 free_temp_slots. Automatic variables for a block are allocated
629 with this flag. KEEP is 2 if we allocate a longer term temporary,
630 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
631 if we are to allocate something at an inner level to be treated as
632 a variable in the block (e.g., a SAVE_EXPR).
634 TYPE is the type that will be used for the stack slot. */
637 assign_stack_temp_for_type (mode, size, keep, type)
638 enum machine_mode mode;
644 struct temp_slot *p, *best_p = 0;
646 /* If SIZE is -1 it means that somebody tried to allocate a temporary
647 of a variable size. */
652 align = BIGGEST_ALIGNMENT;
654 align = GET_MODE_ALIGNMENT (mode);
657 type = (*lang_hooks.types.type_for_mode) (mode, 0);
660 align = LOCAL_ALIGNMENT (type, align);
662 /* Try to find an available, already-allocated temporary of the proper
663 mode which meets the size and alignment requirements. Choose the
664 smallest one with the closest alignment. */
665 for (p = temp_slots; p; p = p->next)
666 if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode
668 && objects_must_conflict_p (p->type, type)
669 && (best_p == 0 || best_p->size > p->size
670 || (best_p->size == p->size && best_p->align > p->align)))
672 if (p->align == align && p->size == size)
680 /* Make our best, if any, the one to use. */
683 /* If there are enough aligned bytes left over, make them into a new
684 temp_slot so that the extra bytes don't get wasted. Do this only
685 for BLKmode slots, so that we can be sure of the alignment. */
686 if (GET_MODE (best_p->slot) == BLKmode)
688 int alignment = best_p->align / BITS_PER_UNIT;
689 HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment);
691 if (best_p->size - rounded_size >= alignment)
693 p = (struct temp_slot *) ggc_alloc (sizeof (struct temp_slot));
694 p->in_use = p->addr_taken = 0;
695 p->size = best_p->size - rounded_size;
696 p->base_offset = best_p->base_offset + rounded_size;
697 p->full_size = best_p->full_size - rounded_size;
698 p->slot = gen_rtx_MEM (BLKmode,
699 plus_constant (XEXP (best_p->slot, 0),
701 p->align = best_p->align;
704 p->type = best_p->type;
705 p->next = temp_slots;
708 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot,
711 best_p->size = rounded_size;
712 best_p->full_size = rounded_size;
719 /* If we still didn't find one, make a new temporary. */
722 HOST_WIDE_INT frame_offset_old = frame_offset;
724 p = (struct temp_slot *) ggc_alloc (sizeof (struct temp_slot));
726 /* We are passing an explicit alignment request to assign_stack_local.
727 One side effect of that is assign_stack_local will not round SIZE
728 to ensure the frame offset remains suitably aligned.
730 So for requests which depended on the rounding of SIZE, we go ahead
731 and round it now. We also make sure ALIGNMENT is at least
732 BIGGEST_ALIGNMENT. */
733 if (mode == BLKmode && align < BIGGEST_ALIGNMENT)
735 p->slot = assign_stack_local (mode,
737 ? CEIL_ROUND (size, align / BITS_PER_UNIT)
743 /* The following slot size computation is necessary because we don't
744 know the actual size of the temporary slot until assign_stack_local
745 has performed all the frame alignment and size rounding for the
746 requested temporary. Note that extra space added for alignment
747 can be either above or below this stack slot depending on which
748 way the frame grows. We include the extra space if and only if it
749 is above this slot. */
750 #ifdef FRAME_GROWS_DOWNWARD
751 p->size = frame_offset_old - frame_offset;
756 /* Now define the fields used by combine_temp_slots. */
757 #ifdef FRAME_GROWS_DOWNWARD
758 p->base_offset = frame_offset;
759 p->full_size = frame_offset_old - frame_offset;
761 p->base_offset = frame_offset_old;
762 p->full_size = frame_offset - frame_offset_old;
765 p->next = temp_slots;
771 p->rtl_expr = seq_rtl_expr;
776 p->level = target_temp_slot_level;
781 p->level = var_temp_slot_level;
786 p->level = temp_slot_level;
790 /* We may be reusing an old slot, so clear any MEM flags that may have been
792 RTX_UNCHANGING_P (p->slot) = 0;
793 MEM_IN_STRUCT_P (p->slot) = 0;
794 MEM_SCALAR_P (p->slot) = 0;
795 MEM_VOLATILE_P (p->slot) = 0;
796 set_mem_alias_set (p->slot, 0);
798 /* If we know the alias set for the memory that will be used, use
799 it. If there's no TYPE, then we don't know anything about the
800 alias set for the memory. */
801 set_mem_alias_set (p->slot, type ? get_alias_set (type) : 0);
802 set_mem_align (p->slot, align);
804 /* If a type is specified, set the relevant flags. */
807 RTX_UNCHANGING_P (p->slot) = TYPE_READONLY (type);
808 MEM_VOLATILE_P (p->slot) = TYPE_VOLATILE (type);
809 MEM_SET_IN_STRUCT_P (p->slot, AGGREGATE_TYPE_P (type));
815 /* Allocate a temporary stack slot and record it for possible later
816 reuse. First three arguments are same as in preceding function. */
819 assign_stack_temp (mode, size, keep)
820 enum machine_mode mode;
824 return assign_stack_temp_for_type (mode, size, keep, NULL_TREE);
827 /* Assign a temporary.
828 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
829 and so that should be used in error messages. In either case, we
830 allocate of the given type.
831 KEEP is as for assign_stack_temp.
832 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
833 it is 0 if a register is OK.
834 DONT_PROMOTE is 1 if we should not promote values in register
838 assign_temp (type_or_decl, keep, memory_required, dont_promote)
842 int dont_promote ATTRIBUTE_UNUSED;
845 enum machine_mode mode;
846 #ifndef PROMOTE_FOR_CALL_ONLY
850 if (DECL_P (type_or_decl))
851 decl = type_or_decl, type = TREE_TYPE (decl);
853 decl = NULL, type = type_or_decl;
855 mode = TYPE_MODE (type);
856 #ifndef PROMOTE_FOR_CALL_ONLY
857 unsignedp = TREE_UNSIGNED (type);
860 if (mode == BLKmode || memory_required)
862 HOST_WIDE_INT size = int_size_in_bytes (type);
865 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
866 problems with allocating the stack space. */
870 /* Unfortunately, we don't yet know how to allocate variable-sized
871 temporaries. However, sometimes we have a fixed upper limit on
872 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
873 instead. This is the case for Chill variable-sized strings. */
874 if (size == -1 && TREE_CODE (type) == ARRAY_TYPE
875 && TYPE_ARRAY_MAX_SIZE (type) != NULL_TREE
876 && host_integerp (TYPE_ARRAY_MAX_SIZE (type), 1))
877 size = tree_low_cst (TYPE_ARRAY_MAX_SIZE (type), 1);
879 /* The size of the temporary may be too large to fit into an integer. */
880 /* ??? Not sure this should happen except for user silliness, so limit
881 this to things that aren't compiler-generated temporaries. The
882 rest of the time we'll abort in assign_stack_temp_for_type. */
883 if (decl && size == -1
884 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST)
886 error_with_decl (decl, "size of variable `%s' is too large");
890 tmp = assign_stack_temp_for_type (mode, size, keep, type);
894 #ifndef PROMOTE_FOR_CALL_ONLY
896 mode = promote_mode (type, mode, &unsignedp, 0);
899 return gen_reg_rtx (mode);
902 /* Combine temporary stack slots which are adjacent on the stack.
904 This allows for better use of already allocated stack space. This is only
905 done for BLKmode slots because we can be sure that we won't have alignment
906 problems in this case. */
909 combine_temp_slots ()
911 struct temp_slot *p, *q;
912 struct temp_slot *prev_p, *prev_q;
915 /* We can't combine slots, because the information about which slot
916 is in which alias set will be lost. */
917 if (flag_strict_aliasing)
920 /* If there are a lot of temp slots, don't do anything unless
921 high levels of optimization. */
922 if (! flag_expensive_optimizations)
923 for (p = temp_slots, num_slots = 0; p; p = p->next, num_slots++)
924 if (num_slots > 100 || (num_slots > 10 && optimize == 0))
927 for (p = temp_slots, prev_p = 0; p; p = prev_p ? prev_p->next : temp_slots)
931 if (! p->in_use && GET_MODE (p->slot) == BLKmode)
932 for (q = p->next, prev_q = p; q; q = prev_q->next)
935 if (! q->in_use && GET_MODE (q->slot) == BLKmode)
937 if (p->base_offset + p->full_size == q->base_offset)
939 /* Q comes after P; combine Q into P. */
941 p->full_size += q->full_size;
944 else if (q->base_offset + q->full_size == p->base_offset)
946 /* P comes after Q; combine P into Q. */
948 q->full_size += p->full_size;
953 /* Either delete Q or advance past it. */
955 prev_q->next = q->next;
959 /* Either delete P or advance past it. */
963 prev_p->next = p->next;
965 temp_slots = p->next;
972 /* Find the temp slot corresponding to the object at address X. */
974 static struct temp_slot *
975 find_temp_slot_from_address (x)
981 for (p = temp_slots; p; p = p->next)
986 else if (XEXP (p->slot, 0) == x
988 || (GET_CODE (x) == PLUS
989 && XEXP (x, 0) == virtual_stack_vars_rtx
990 && GET_CODE (XEXP (x, 1)) == CONST_INT
991 && INTVAL (XEXP (x, 1)) >= p->base_offset
992 && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size))
995 else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST)
996 for (next = p->address; next; next = XEXP (next, 1))
997 if (XEXP (next, 0) == x)
1001 /* If we have a sum involving a register, see if it points to a temp
1003 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 0)) == REG
1004 && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
1006 else if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == REG
1007 && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
1013 /* Indicate that NEW is an alternate way of referring to the temp slot
1014 that previously was known by OLD. */
1017 update_temp_slot_address (old, new)
1020 struct temp_slot *p;
1022 if (rtx_equal_p (old, new))
1025 p = find_temp_slot_from_address (old);
1027 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
1028 is a register, see if one operand of the PLUS is a temporary
1029 location. If so, NEW points into it. Otherwise, if both OLD and
1030 NEW are a PLUS and if there is a register in common between them.
1031 If so, try a recursive call on those values. */
1034 if (GET_CODE (old) != PLUS)
1037 if (GET_CODE (new) == REG)
1039 update_temp_slot_address (XEXP (old, 0), new);
1040 update_temp_slot_address (XEXP (old, 1), new);
1043 else if (GET_CODE (new) != PLUS)
1046 if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0)))
1047 update_temp_slot_address (XEXP (old, 1), XEXP (new, 1));
1048 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0)))
1049 update_temp_slot_address (XEXP (old, 0), XEXP (new, 1));
1050 else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1)))
1051 update_temp_slot_address (XEXP (old, 1), XEXP (new, 0));
1052 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1)))
1053 update_temp_slot_address (XEXP (old, 0), XEXP (new, 0));
1058 /* Otherwise add an alias for the temp's address. */
1059 else if (p->address == 0)
1063 if (GET_CODE (p->address) != EXPR_LIST)
1064 p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX);
1066 p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address);
1070 /* If X could be a reference to a temporary slot, mark the fact that its
1071 address was taken. */
1074 mark_temp_addr_taken (x)
1077 struct temp_slot *p;
1082 /* If X is not in memory or is at a constant address, it cannot be in
1083 a temporary slot. */
1084 if (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1087 p = find_temp_slot_from_address (XEXP (x, 0));
1092 /* If X could be a reference to a temporary slot, mark that slot as
1093 belonging to the to one level higher than the current level. If X
1094 matched one of our slots, just mark that one. Otherwise, we can't
1095 easily predict which it is, so upgrade all of them. Kept slots
1096 need not be touched.
1098 This is called when an ({...}) construct occurs and a statement
1099 returns a value in memory. */
1102 preserve_temp_slots (x)
1105 struct temp_slot *p = 0;
1107 /* If there is no result, we still might have some objects whose address
1108 were taken, so we need to make sure they stay around. */
1111 for (p = temp_slots; p; p = p->next)
1112 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1118 /* If X is a register that is being used as a pointer, see if we have
1119 a temporary slot we know it points to. To be consistent with
1120 the code below, we really should preserve all non-kept slots
1121 if we can't find a match, but that seems to be much too costly. */
1122 if (GET_CODE (x) == REG && REG_POINTER (x))
1123 p = find_temp_slot_from_address (x);
1125 /* If X is not in memory or is at a constant address, it cannot be in
1126 a temporary slot, but it can contain something whose address was
1128 if (p == 0 && (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0))))
1130 for (p = temp_slots; p; p = p->next)
1131 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1137 /* First see if we can find a match. */
1139 p = find_temp_slot_from_address (XEXP (x, 0));
1143 /* Move everything at our level whose address was taken to our new
1144 level in case we used its address. */
1145 struct temp_slot *q;
1147 if (p->level == temp_slot_level)
1149 for (q = temp_slots; q; q = q->next)
1150 if (q != p && q->addr_taken && q->level == p->level)
1159 /* Otherwise, preserve all non-kept slots at this level. */
1160 for (p = temp_slots; p; p = p->next)
1161 if (p->in_use && p->level == temp_slot_level && ! p->keep)
1165 /* X is the result of an RTL_EXPR. If it is a temporary slot associated
1166 with that RTL_EXPR, promote it into a temporary slot at the present
1167 level so it will not be freed when we free slots made in the
1171 preserve_rtl_expr_result (x)
1174 struct temp_slot *p;
1176 /* If X is not in memory or is at a constant address, it cannot be in
1177 a temporary slot. */
1178 if (x == 0 || GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1181 /* If we can find a match, move it to our level unless it is already at
1183 p = find_temp_slot_from_address (XEXP (x, 0));
1186 p->level = MIN (p->level, temp_slot_level);
1193 /* Free all temporaries used so far. This is normally called at the end
1194 of generating code for a statement. Don't free any temporaries
1195 currently in use for an RTL_EXPR that hasn't yet been emitted.
1196 We could eventually do better than this since it can be reused while
1197 generating the same RTL_EXPR, but this is complex and probably not
1203 struct temp_slot *p;
1205 for (p = temp_slots; p; p = p->next)
1206 if (p->in_use && p->level == temp_slot_level && ! p->keep
1207 && p->rtl_expr == 0)
1210 combine_temp_slots ();
1213 /* Free all temporary slots used in T, an RTL_EXPR node. */
1216 free_temps_for_rtl_expr (t)
1219 struct temp_slot *p;
1221 for (p = temp_slots; p; p = p->next)
1222 if (p->rtl_expr == t)
1224 /* If this slot is below the current TEMP_SLOT_LEVEL, then it
1225 needs to be preserved. This can happen if a temporary in
1226 the RTL_EXPR was addressed; preserve_temp_slots will move
1227 the temporary into a higher level. */
1228 if (temp_slot_level <= p->level)
1231 p->rtl_expr = NULL_TREE;
1234 combine_temp_slots ();
1237 /* Mark all temporaries ever allocated in this function as not suitable
1238 for reuse until the current level is exited. */
1241 mark_all_temps_used ()
1243 struct temp_slot *p;
1245 for (p = temp_slots; p; p = p->next)
1247 p->in_use = p->keep = 1;
1248 p->level = MIN (p->level, temp_slot_level);
1252 /* Push deeper into the nesting level for stack temporaries. */
1260 /* Likewise, but save the new level as the place to allocate variables
1265 push_temp_slots_for_block ()
1269 var_temp_slot_level = temp_slot_level;
1272 /* Likewise, but save the new level as the place to allocate temporaries
1273 for TARGET_EXPRs. */
1276 push_temp_slots_for_target ()
1280 target_temp_slot_level = temp_slot_level;
1283 /* Set and get the value of target_temp_slot_level. The only
1284 permitted use of these functions is to save and restore this value. */
1287 get_target_temp_slot_level ()
1289 return target_temp_slot_level;
1293 set_target_temp_slot_level (level)
1296 target_temp_slot_level = level;
1300 /* Pop a temporary nesting level. All slots in use in the current level
1306 struct temp_slot *p;
1308 for (p = temp_slots; p; p = p->next)
1309 if (p->in_use && p->level == temp_slot_level && p->rtl_expr == 0)
1312 combine_temp_slots ();
1317 /* Initialize temporary slots. */
1322 /* We have not allocated any temporaries yet. */
1324 temp_slot_level = 0;
1325 var_temp_slot_level = 0;
1326 target_temp_slot_level = 0;
1329 /* Retroactively move an auto variable from a register to a stack slot.
1330 This is done when an address-reference to the variable is seen. */
1333 put_var_into_stack (decl)
1337 enum machine_mode promoted_mode, decl_mode;
1338 struct function *function = 0;
1340 int can_use_addressof;
1341 int volatilep = TREE_CODE (decl) != SAVE_EXPR && TREE_THIS_VOLATILE (decl);
1342 int usedp = (TREE_USED (decl)
1343 || (TREE_CODE (decl) != SAVE_EXPR && DECL_INITIAL (decl) != 0));
1345 context = decl_function_context (decl);
1347 /* Get the current rtl used for this object and its original mode. */
1348 reg = (TREE_CODE (decl) == SAVE_EXPR
1349 ? SAVE_EXPR_RTL (decl)
1350 : DECL_RTL_IF_SET (decl));
1352 /* No need to do anything if decl has no rtx yet
1353 since in that case caller is setting TREE_ADDRESSABLE
1354 and a stack slot will be assigned when the rtl is made. */
1358 /* Get the declared mode for this object. */
1359 decl_mode = (TREE_CODE (decl) == SAVE_EXPR ? TYPE_MODE (TREE_TYPE (decl))
1360 : DECL_MODE (decl));
1361 /* Get the mode it's actually stored in. */
1362 promoted_mode = GET_MODE (reg);
1364 /* If this variable comes from an outer function, find that
1365 function's saved context. Don't use find_function_data here,
1366 because it might not be in any active function.
1367 FIXME: Is that really supposed to happen?
1368 It does in ObjC at least. */
1369 if (context != current_function_decl && context != inline_function_decl)
1370 for (function = outer_function_chain; function; function = function->outer)
1371 if (function->decl == context)
1374 /* If this is a variable-size object with a pseudo to address it,
1375 put that pseudo into the stack, if the var is nonlocal. */
1376 if (TREE_CODE (decl) != SAVE_EXPR && DECL_NONLOCAL (decl)
1377 && GET_CODE (reg) == MEM
1378 && GET_CODE (XEXP (reg, 0)) == REG
1379 && REGNO (XEXP (reg, 0)) > LAST_VIRTUAL_REGISTER)
1381 reg = XEXP (reg, 0);
1382 decl_mode = promoted_mode = GET_MODE (reg);
1388 /* FIXME make it work for promoted modes too */
1389 && decl_mode == promoted_mode
1390 #ifdef NON_SAVING_SETJMP
1391 && ! (NON_SAVING_SETJMP && current_function_calls_setjmp)
1395 /* If we can't use ADDRESSOF, make sure we see through one we already
1397 if (! can_use_addressof && GET_CODE (reg) == MEM
1398 && GET_CODE (XEXP (reg, 0)) == ADDRESSOF)
1399 reg = XEXP (XEXP (reg, 0), 0);
1401 /* Now we should have a value that resides in one or more pseudo regs. */
1403 if (GET_CODE (reg) == REG)
1405 /* If this variable lives in the current function and we don't need
1406 to put things in the stack for the sake of setjmp, try to keep it
1407 in a register until we know we actually need the address. */
1408 if (can_use_addressof)
1409 gen_mem_addressof (reg, decl);
1411 put_reg_into_stack (function, reg, TREE_TYPE (decl), promoted_mode,
1412 decl_mode, volatilep, 0, usedp, 0);
1414 else if (GET_CODE (reg) == CONCAT)
1416 /* A CONCAT contains two pseudos; put them both in the stack.
1417 We do it so they end up consecutive.
1418 We fixup references to the parts only after we fixup references
1419 to the whole CONCAT, lest we do double fixups for the latter
1421 enum machine_mode part_mode = GET_MODE (XEXP (reg, 0));
1422 tree part_type = (*lang_hooks.types.type_for_mode) (part_mode, 0);
1423 rtx lopart = XEXP (reg, 0);
1424 rtx hipart = XEXP (reg, 1);
1425 #ifdef FRAME_GROWS_DOWNWARD
1426 /* Since part 0 should have a lower address, do it second. */
1427 put_reg_into_stack (function, hipart, part_type, part_mode,
1428 part_mode, volatilep, 0, 0, 0);
1429 put_reg_into_stack (function, lopart, part_type, part_mode,
1430 part_mode, volatilep, 0, 0, 0);
1432 put_reg_into_stack (function, lopart, part_type, part_mode,
1433 part_mode, volatilep, 0, 0, 0);
1434 put_reg_into_stack (function, hipart, part_type, part_mode,
1435 part_mode, volatilep, 0, 0, 0);
1438 /* Change the CONCAT into a combined MEM for both parts. */
1439 PUT_CODE (reg, MEM);
1440 MEM_ATTRS (reg) = 0;
1442 /* set_mem_attributes uses DECL_RTL to avoid re-generating of
1443 already computed alias sets. Here we want to re-generate. */
1445 SET_DECL_RTL (decl, NULL);
1446 set_mem_attributes (reg, decl, 1);
1448 SET_DECL_RTL (decl, reg);
1450 /* The two parts are in memory order already.
1451 Use the lower parts address as ours. */
1452 XEXP (reg, 0) = XEXP (XEXP (reg, 0), 0);
1453 /* Prevent sharing of rtl that might lose. */
1454 if (GET_CODE (XEXP (reg, 0)) == PLUS)
1455 XEXP (reg, 0) = copy_rtx (XEXP (reg, 0));
1458 schedule_fixup_var_refs (function, reg, TREE_TYPE (decl),
1460 schedule_fixup_var_refs (function, lopart, part_type, part_mode, 0);
1461 schedule_fixup_var_refs (function, hipart, part_type, part_mode, 0);
1468 /* Subroutine of put_var_into_stack. This puts a single pseudo reg REG
1469 into the stack frame of FUNCTION (0 means the current function).
1470 DECL_MODE is the machine mode of the user-level data type.
1471 PROMOTED_MODE is the machine mode of the register.
1472 VOLATILE_P is nonzero if this is for a "volatile" decl.
1473 USED_P is nonzero if this reg might have already been used in an insn. */
1476 put_reg_into_stack (function, reg, type, promoted_mode, decl_mode, volatile_p,
1477 original_regno, used_p, ht)
1478 struct function *function;
1481 enum machine_mode promoted_mode, decl_mode;
1483 unsigned int original_regno;
1487 struct function *func = function ? function : cfun;
1489 unsigned int regno = original_regno;
1492 regno = REGNO (reg);
1494 if (regno < func->x_max_parm_reg)
1495 new = func->x_parm_reg_stack_loc[regno];
1498 new = assign_stack_local_1 (decl_mode, GET_MODE_SIZE (decl_mode), 0, func);
1500 PUT_CODE (reg, MEM);
1501 PUT_MODE (reg, decl_mode);
1502 XEXP (reg, 0) = XEXP (new, 0);
1503 MEM_ATTRS (reg) = 0;
1504 /* `volatil' bit means one thing for MEMs, another entirely for REGs. */
1505 MEM_VOLATILE_P (reg) = volatile_p;
1507 /* If this is a memory ref that contains aggregate components,
1508 mark it as such for cse and loop optimize. If we are reusing a
1509 previously generated stack slot, then we need to copy the bit in
1510 case it was set for other reasons. For instance, it is set for
1511 __builtin_va_alist. */
1514 MEM_SET_IN_STRUCT_P (reg,
1515 AGGREGATE_TYPE_P (type) || MEM_IN_STRUCT_P (new));
1516 set_mem_alias_set (reg, get_alias_set (type));
1520 schedule_fixup_var_refs (function, reg, type, promoted_mode, ht);
1523 /* Make sure that all refs to the variable, previously made
1524 when it was a register, are fixed up to be valid again.
1525 See function above for meaning of arguments. */
1528 schedule_fixup_var_refs (function, reg, type, promoted_mode, ht)
1529 struct function *function;
1532 enum machine_mode promoted_mode;
1535 int unsigned_p = type ? TREE_UNSIGNED (type) : 0;
1539 struct var_refs_queue *temp;
1542 = (struct var_refs_queue *) ggc_alloc (sizeof (struct var_refs_queue));
1543 temp->modified = reg;
1544 temp->promoted_mode = promoted_mode;
1545 temp->unsignedp = unsigned_p;
1546 temp->next = function->fixup_var_refs_queue;
1547 function->fixup_var_refs_queue = temp;
1550 /* Variable is local; fix it up now. */
1551 fixup_var_refs (reg, promoted_mode, unsigned_p, reg, ht);
1555 fixup_var_refs (var, promoted_mode, unsignedp, may_share, ht)
1557 enum machine_mode promoted_mode;
1563 rtx first_insn = get_insns ();
1564 struct sequence_stack *stack = seq_stack;
1565 tree rtl_exps = rtl_expr_chain;
1567 /* If there's a hash table, it must record all uses of VAR. */
1572 fixup_var_refs_insns_with_hash (ht, var, promoted_mode, unsignedp,
1577 fixup_var_refs_insns (first_insn, var, promoted_mode, unsignedp,
1578 stack == 0, may_share);
1580 /* Scan all pending sequences too. */
1581 for (; stack; stack = stack->next)
1583 push_to_full_sequence (stack->first, stack->last);
1584 fixup_var_refs_insns (stack->first, var, promoted_mode, unsignedp,
1585 stack->next != 0, may_share);
1586 /* Update remembered end of sequence
1587 in case we added an insn at the end. */
1588 stack->last = get_last_insn ();
1592 /* Scan all waiting RTL_EXPRs too. */
1593 for (pending = rtl_exps; pending; pending = TREE_CHAIN (pending))
1595 rtx seq = RTL_EXPR_SEQUENCE (TREE_VALUE (pending));
1596 if (seq != const0_rtx && seq != 0)
1598 push_to_sequence (seq);
1599 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0,
1606 /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is
1607 some part of an insn. Return a struct fixup_replacement whose OLD
1608 value is equal to X. Allocate a new structure if no such entry exists. */
1610 static struct fixup_replacement *
1611 find_fixup_replacement (replacements, x)
1612 struct fixup_replacement **replacements;
1615 struct fixup_replacement *p;
1617 /* See if we have already replaced this. */
1618 for (p = *replacements; p != 0 && ! rtx_equal_p (p->old, x); p = p->next)
1623 p = (struct fixup_replacement *) xmalloc (sizeof (struct fixup_replacement));
1626 p->next = *replacements;
1633 /* Scan the insn-chain starting with INSN for refs to VAR and fix them
1634 up. TOPLEVEL is nonzero if this chain is the main chain of insns
1635 for the current function. MAY_SHARE is either a MEM that is not
1636 to be unshared or a list of them. */
1639 fixup_var_refs_insns (insn, var, promoted_mode, unsignedp, toplevel, may_share)
1642 enum machine_mode promoted_mode;
1649 /* fixup_var_refs_insn might modify insn, so save its next
1651 rtx next = NEXT_INSN (insn);
1653 /* CALL_PLACEHOLDERs are special; we have to switch into each of
1654 the three sequences they (potentially) contain, and process
1655 them recursively. The CALL_INSN itself is not interesting. */
1657 if (GET_CODE (insn) == CALL_INSN
1658 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1662 /* Look at the Normal call, sibling call and tail recursion
1663 sequences attached to the CALL_PLACEHOLDER. */
1664 for (i = 0; i < 3; i++)
1666 rtx seq = XEXP (PATTERN (insn), i);
1669 push_to_sequence (seq);
1670 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0,
1672 XEXP (PATTERN (insn), i) = get_insns ();
1678 else if (INSN_P (insn))
1679 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, toplevel,
1686 /* Look up the insns which reference VAR in HT and fix them up. Other
1687 arguments are the same as fixup_var_refs_insns.
1689 N.B. No need for special processing of CALL_PLACEHOLDERs here,
1690 because the hash table will point straight to the interesting insn
1691 (inside the CALL_PLACEHOLDER). */
1694 fixup_var_refs_insns_with_hash (ht, var, promoted_mode, unsignedp, may_share)
1697 enum machine_mode promoted_mode;
1701 struct insns_for_mem_entry tmp;
1702 struct insns_for_mem_entry *ime;
1706 ime = (struct insns_for_mem_entry *) htab_find (ht, &tmp);
1707 for (insn_list = ime->insns; insn_list != 0; insn_list = XEXP (insn_list, 1))
1708 if (INSN_P (XEXP (insn_list, 0)))
1709 fixup_var_refs_insn (XEXP (insn_list, 0), var, promoted_mode,
1710 unsignedp, 1, may_share);
1714 /* Per-insn processing by fixup_var_refs_insns(_with_hash). INSN is
1715 the insn under examination, VAR is the variable to fix up
1716 references to, PROMOTED_MODE and UNSIGNEDP describe VAR, and
1717 TOPLEVEL is nonzero if this is the main insn chain for this
1721 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, toplevel, no_share)
1724 enum machine_mode promoted_mode;
1730 rtx set, prev, prev_set;
1733 /* Remember the notes in case we delete the insn. */
1734 note = REG_NOTES (insn);
1736 /* If this is a CLOBBER of VAR, delete it.
1738 If it has a REG_LIBCALL note, delete the REG_LIBCALL
1739 and REG_RETVAL notes too. */
1740 if (GET_CODE (PATTERN (insn)) == CLOBBER
1741 && (XEXP (PATTERN (insn), 0) == var
1742 || (GET_CODE (XEXP (PATTERN (insn), 0)) == CONCAT
1743 && (XEXP (XEXP (PATTERN (insn), 0), 0) == var
1744 || XEXP (XEXP (PATTERN (insn), 0), 1) == var))))
1746 if ((note = find_reg_note (insn, REG_LIBCALL, NULL_RTX)) != 0)
1747 /* The REG_LIBCALL note will go away since we are going to
1748 turn INSN into a NOTE, so just delete the
1749 corresponding REG_RETVAL note. */
1750 remove_note (XEXP (note, 0),
1751 find_reg_note (XEXP (note, 0), REG_RETVAL,
1757 /* The insn to load VAR from a home in the arglist
1758 is now a no-op. When we see it, just delete it.
1759 Similarly if this is storing VAR from a register from which
1760 it was loaded in the previous insn. This will occur
1761 when an ADDRESSOF was made for an arglist slot. */
1763 && (set = single_set (insn)) != 0
1764 && SET_DEST (set) == var
1765 /* If this represents the result of an insn group,
1766 don't delete the insn. */
1767 && find_reg_note (insn, REG_RETVAL, NULL_RTX) == 0
1768 && (rtx_equal_p (SET_SRC (set), var)
1769 || (GET_CODE (SET_SRC (set)) == REG
1770 && (prev = prev_nonnote_insn (insn)) != 0
1771 && (prev_set = single_set (prev)) != 0
1772 && SET_DEST (prev_set) == SET_SRC (set)
1773 && rtx_equal_p (SET_SRC (prev_set), var))))
1779 struct fixup_replacement *replacements = 0;
1780 rtx next_insn = NEXT_INSN (insn);
1782 if (SMALL_REGISTER_CLASSES)
1784 /* If the insn that copies the results of a CALL_INSN
1785 into a pseudo now references VAR, we have to use an
1786 intermediate pseudo since we want the life of the
1787 return value register to be only a single insn.
1789 If we don't use an intermediate pseudo, such things as
1790 address computations to make the address of VAR valid
1791 if it is not can be placed between the CALL_INSN and INSN.
1793 To make sure this doesn't happen, we record the destination
1794 of the CALL_INSN and see if the next insn uses both that
1797 if (call_dest != 0 && GET_CODE (insn) == INSN
1798 && reg_mentioned_p (var, PATTERN (insn))
1799 && reg_mentioned_p (call_dest, PATTERN (insn)))
1801 rtx temp = gen_reg_rtx (GET_MODE (call_dest));
1803 emit_insn_before (gen_move_insn (temp, call_dest), insn);
1805 PATTERN (insn) = replace_rtx (PATTERN (insn),
1809 if (GET_CODE (insn) == CALL_INSN
1810 && GET_CODE (PATTERN (insn)) == SET)
1811 call_dest = SET_DEST (PATTERN (insn));
1812 else if (GET_CODE (insn) == CALL_INSN
1813 && GET_CODE (PATTERN (insn)) == PARALLEL
1814 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET)
1815 call_dest = SET_DEST (XVECEXP (PATTERN (insn), 0, 0));
1820 /* See if we have to do anything to INSN now that VAR is in
1821 memory. If it needs to be loaded into a pseudo, use a single
1822 pseudo for the entire insn in case there is a MATCH_DUP
1823 between two operands. We pass a pointer to the head of
1824 a list of struct fixup_replacements. If fixup_var_refs_1
1825 needs to allocate pseudos or replacement MEMs (for SUBREGs),
1826 it will record them in this list.
1828 If it allocated a pseudo for any replacement, we copy into
1831 fixup_var_refs_1 (var, promoted_mode, &PATTERN (insn), insn,
1832 &replacements, no_share);
1834 /* If this is last_parm_insn, and any instructions were output
1835 after it to fix it up, then we must set last_parm_insn to
1836 the last such instruction emitted. */
1837 if (insn == last_parm_insn)
1838 last_parm_insn = PREV_INSN (next_insn);
1840 while (replacements)
1842 struct fixup_replacement *next;
1844 if (GET_CODE (replacements->new) == REG)
1849 /* OLD might be a (subreg (mem)). */
1850 if (GET_CODE (replacements->old) == SUBREG)
1852 = fixup_memory_subreg (replacements->old, insn,
1856 = fixup_stack_1 (replacements->old, insn);
1858 insert_before = insn;
1860 /* If we are changing the mode, do a conversion.
1861 This might be wasteful, but combine.c will
1862 eliminate much of the waste. */
1864 if (GET_MODE (replacements->new)
1865 != GET_MODE (replacements->old))
1868 convert_move (replacements->new,
1869 replacements->old, unsignedp);
1870 seq = gen_sequence ();
1874 seq = gen_move_insn (replacements->new,
1877 emit_insn_before (seq, insert_before);
1880 next = replacements->next;
1881 free (replacements);
1882 replacements = next;
1886 /* Also fix up any invalid exprs in the REG_NOTES of this insn.
1887 But don't touch other insns referred to by reg-notes;
1888 we will get them elsewhere. */
1891 if (GET_CODE (note) != INSN_LIST)
1893 = walk_fixup_memory_subreg (XEXP (note, 0), insn,
1895 note = XEXP (note, 1);
1899 /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
1900 See if the rtx expression at *LOC in INSN needs to be changed.
1902 REPLACEMENTS is a pointer to a list head that starts out zero, but may
1903 contain a list of original rtx's and replacements. If we find that we need
1904 to modify this insn by replacing a memory reference with a pseudo or by
1905 making a new MEM to implement a SUBREG, we consult that list to see if
1906 we have already chosen a replacement. If none has already been allocated,
1907 we allocate it and update the list. fixup_var_refs_insn will copy VAR
1908 or the SUBREG, as appropriate, to the pseudo. */
1911 fixup_var_refs_1 (var, promoted_mode, loc, insn, replacements, no_share)
1913 enum machine_mode promoted_mode;
1916 struct fixup_replacement **replacements;
1921 RTX_CODE code = GET_CODE (x);
1924 struct fixup_replacement *replacement;
1929 if (XEXP (x, 0) == var)
1931 /* Prevent sharing of rtl that might lose. */
1932 rtx sub = copy_rtx (XEXP (var, 0));
1934 if (! validate_change (insn, loc, sub, 0))
1936 rtx y = gen_reg_rtx (GET_MODE (sub));
1939 /* We should be able to replace with a register or all is lost.
1940 Note that we can't use validate_change to verify this, since
1941 we're not caring for replacing all dups simultaneously. */
1942 if (! validate_replace_rtx (*loc, y, insn))
1945 /* Careful! First try to recognize a direct move of the
1946 value, mimicking how things are done in gen_reload wrt
1947 PLUS. Consider what happens when insn is a conditional
1948 move instruction and addsi3 clobbers flags. */
1951 new_insn = emit_insn (gen_rtx_SET (VOIDmode, y, sub));
1952 seq = gen_sequence ();
1955 if (recog_memoized (new_insn) < 0)
1957 /* That failed. Fall back on force_operand and hope. */
1960 sub = force_operand (sub, y);
1962 emit_insn (gen_move_insn (y, sub));
1963 seq = gen_sequence ();
1968 /* Don't separate setter from user. */
1969 if (PREV_INSN (insn) && sets_cc0_p (PREV_INSN (insn)))
1970 insn = PREV_INSN (insn);
1973 emit_insn_before (seq, insn);
1981 /* If we already have a replacement, use it. Otherwise,
1982 try to fix up this address in case it is invalid. */
1984 replacement = find_fixup_replacement (replacements, var);
1985 if (replacement->new)
1987 *loc = replacement->new;
1991 *loc = replacement->new = x = fixup_stack_1 (x, insn);
1993 /* Unless we are forcing memory to register or we changed the mode,
1994 we can leave things the way they are if the insn is valid. */
1996 INSN_CODE (insn) = -1;
1997 if (! flag_force_mem && GET_MODE (x) == promoted_mode
1998 && recog_memoized (insn) >= 0)
2001 *loc = replacement->new = gen_reg_rtx (promoted_mode);
2005 /* If X contains VAR, we need to unshare it here so that we update
2006 each occurrence separately. But all identical MEMs in one insn
2007 must be replaced with the same rtx because of the possibility of
2010 if (reg_mentioned_p (var, x))
2012 replacement = find_fixup_replacement (replacements, x);
2013 if (replacement->new == 0)
2014 replacement->new = copy_most_rtx (x, no_share);
2016 *loc = x = replacement->new;
2017 code = GET_CODE (x);
2034 /* Note that in some cases those types of expressions are altered
2035 by optimize_bit_field, and do not survive to get here. */
2036 if (XEXP (x, 0) == var
2037 || (GET_CODE (XEXP (x, 0)) == SUBREG
2038 && SUBREG_REG (XEXP (x, 0)) == var))
2040 /* Get TEM as a valid MEM in the mode presently in the insn.
2042 We don't worry about the possibility of MATCH_DUP here; it
2043 is highly unlikely and would be tricky to handle. */
2046 if (GET_CODE (tem) == SUBREG)
2048 if (GET_MODE_BITSIZE (GET_MODE (tem))
2049 > GET_MODE_BITSIZE (GET_MODE (var)))
2051 replacement = find_fixup_replacement (replacements, var);
2052 if (replacement->new == 0)
2053 replacement->new = gen_reg_rtx (GET_MODE (var));
2054 SUBREG_REG (tem) = replacement->new;
2056 /* The following code works only if we have a MEM, so we
2057 need to handle the subreg here. We directly substitute
2058 it assuming that a subreg must be OK here. We already
2059 scheduled a replacement to copy the mem into the
2065 tem = fixup_memory_subreg (tem, insn, promoted_mode, 0);
2068 tem = fixup_stack_1 (tem, insn);
2070 /* Unless we want to load from memory, get TEM into the proper mode
2071 for an extract from memory. This can only be done if the
2072 extract is at a constant position and length. */
2074 if (! flag_force_mem && GET_CODE (XEXP (x, 1)) == CONST_INT
2075 && GET_CODE (XEXP (x, 2)) == CONST_INT
2076 && ! mode_dependent_address_p (XEXP (tem, 0))
2077 && ! MEM_VOLATILE_P (tem))
2079 enum machine_mode wanted_mode = VOIDmode;
2080 enum machine_mode is_mode = GET_MODE (tem);
2081 HOST_WIDE_INT pos = INTVAL (XEXP (x, 2));
2083 if (GET_CODE (x) == ZERO_EXTRACT)
2085 enum machine_mode new_mode
2086 = mode_for_extraction (EP_extzv, 1);
2087 if (new_mode != MAX_MACHINE_MODE)
2088 wanted_mode = new_mode;
2090 else if (GET_CODE (x) == SIGN_EXTRACT)
2092 enum machine_mode new_mode
2093 = mode_for_extraction (EP_extv, 1);
2094 if (new_mode != MAX_MACHINE_MODE)
2095 wanted_mode = new_mode;
2098 /* If we have a narrower mode, we can do something. */
2099 if (wanted_mode != VOIDmode
2100 && GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2102 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2103 rtx old_pos = XEXP (x, 2);
2106 /* If the bytes and bits are counted differently, we
2107 must adjust the offset. */
2108 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2109 offset = (GET_MODE_SIZE (is_mode)
2110 - GET_MODE_SIZE (wanted_mode) - offset);
2112 pos %= GET_MODE_BITSIZE (wanted_mode);
2114 newmem = adjust_address_nv (tem, wanted_mode, offset);
2116 /* Make the change and see if the insn remains valid. */
2117 INSN_CODE (insn) = -1;
2118 XEXP (x, 0) = newmem;
2119 XEXP (x, 2) = GEN_INT (pos);
2121 if (recog_memoized (insn) >= 0)
2124 /* Otherwise, restore old position. XEXP (x, 0) will be
2126 XEXP (x, 2) = old_pos;
2130 /* If we get here, the bitfield extract insn can't accept a memory
2131 reference. Copy the input into a register. */
2133 tem1 = gen_reg_rtx (GET_MODE (tem));
2134 emit_insn_before (gen_move_insn (tem1, tem), insn);
2141 if (SUBREG_REG (x) == var)
2143 /* If this is a special SUBREG made because VAR was promoted
2144 from a wider mode, replace it with VAR and call ourself
2145 recursively, this time saying that the object previously
2146 had its current mode (by virtue of the SUBREG). */
2148 if (SUBREG_PROMOTED_VAR_P (x))
2151 fixup_var_refs_1 (var, GET_MODE (var), loc, insn, replacements,
2156 /* If this SUBREG makes VAR wider, it has become a paradoxical
2157 SUBREG with VAR in memory, but these aren't allowed at this
2158 stage of the compilation. So load VAR into a pseudo and take
2159 a SUBREG of that pseudo. */
2160 if (GET_MODE_SIZE (GET_MODE (x)) > GET_MODE_SIZE (GET_MODE (var)))
2162 replacement = find_fixup_replacement (replacements, var);
2163 if (replacement->new == 0)
2164 replacement->new = gen_reg_rtx (promoted_mode);
2165 SUBREG_REG (x) = replacement->new;
2169 /* See if we have already found a replacement for this SUBREG.
2170 If so, use it. Otherwise, make a MEM and see if the insn
2171 is recognized. If not, or if we should force MEM into a register,
2172 make a pseudo for this SUBREG. */
2173 replacement = find_fixup_replacement (replacements, x);
2174 if (replacement->new)
2176 *loc = replacement->new;
2180 replacement->new = *loc = fixup_memory_subreg (x, insn,
2183 INSN_CODE (insn) = -1;
2184 if (! flag_force_mem && recog_memoized (insn) >= 0)
2187 *loc = replacement->new = gen_reg_rtx (GET_MODE (x));
2193 /* First do special simplification of bit-field references. */
2194 if (GET_CODE (SET_DEST (x)) == SIGN_EXTRACT
2195 || GET_CODE (SET_DEST (x)) == ZERO_EXTRACT)
2196 optimize_bit_field (x, insn, 0);
2197 if (GET_CODE (SET_SRC (x)) == SIGN_EXTRACT
2198 || GET_CODE (SET_SRC (x)) == ZERO_EXTRACT)
2199 optimize_bit_field (x, insn, 0);
2201 /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object
2202 into a register and then store it back out. */
2203 if (GET_CODE (SET_DEST (x)) == ZERO_EXTRACT
2204 && GET_CODE (XEXP (SET_DEST (x), 0)) == SUBREG
2205 && SUBREG_REG (XEXP (SET_DEST (x), 0)) == var
2206 && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x), 0)))
2207 > GET_MODE_SIZE (GET_MODE (var))))
2209 replacement = find_fixup_replacement (replacements, var);
2210 if (replacement->new == 0)
2211 replacement->new = gen_reg_rtx (GET_MODE (var));
2213 SUBREG_REG (XEXP (SET_DEST (x), 0)) = replacement->new;
2214 emit_insn_after (gen_move_insn (var, replacement->new), insn);
2217 /* If SET_DEST is now a paradoxical SUBREG, put the result of this
2218 insn into a pseudo and store the low part of the pseudo into VAR. */
2219 if (GET_CODE (SET_DEST (x)) == SUBREG
2220 && SUBREG_REG (SET_DEST (x)) == var
2221 && (GET_MODE_SIZE (GET_MODE (SET_DEST (x)))
2222 > GET_MODE_SIZE (GET_MODE (var))))
2224 SET_DEST (x) = tem = gen_reg_rtx (GET_MODE (SET_DEST (x)));
2225 emit_insn_after (gen_move_insn (var, gen_lowpart (GET_MODE (var),
2232 rtx dest = SET_DEST (x);
2233 rtx src = SET_SRC (x);
2234 rtx outerdest = dest;
2236 while (GET_CODE (dest) == SUBREG || GET_CODE (dest) == STRICT_LOW_PART
2237 || GET_CODE (dest) == SIGN_EXTRACT
2238 || GET_CODE (dest) == ZERO_EXTRACT)
2239 dest = XEXP (dest, 0);
2241 if (GET_CODE (src) == SUBREG)
2242 src = SUBREG_REG (src);
2244 /* If VAR does not appear at the top level of the SET
2245 just scan the lower levels of the tree. */
2247 if (src != var && dest != var)
2250 /* We will need to rerecognize this insn. */
2251 INSN_CODE (insn) = -1;
2253 if (GET_CODE (outerdest) == ZERO_EXTRACT && dest == var
2254 && mode_for_extraction (EP_insv, -1) != MAX_MACHINE_MODE)
2256 /* Since this case will return, ensure we fixup all the
2258 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 1),
2259 insn, replacements, no_share);
2260 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 2),
2261 insn, replacements, no_share);
2262 fixup_var_refs_1 (var, promoted_mode, &SET_SRC (x),
2263 insn, replacements, no_share);
2265 tem = XEXP (outerdest, 0);
2267 /* Clean up (SUBREG:SI (MEM:mode ...) 0)
2268 that may appear inside a ZERO_EXTRACT.
2269 This was legitimate when the MEM was a REG. */
2270 if (GET_CODE (tem) == SUBREG
2271 && SUBREG_REG (tem) == var)
2272 tem = fixup_memory_subreg (tem, insn, promoted_mode, 0);
2274 tem = fixup_stack_1 (tem, insn);
2276 if (GET_CODE (XEXP (outerdest, 1)) == CONST_INT
2277 && GET_CODE (XEXP (outerdest, 2)) == CONST_INT
2278 && ! mode_dependent_address_p (XEXP (tem, 0))
2279 && ! MEM_VOLATILE_P (tem))
2281 enum machine_mode wanted_mode;
2282 enum machine_mode is_mode = GET_MODE (tem);
2283 HOST_WIDE_INT pos = INTVAL (XEXP (outerdest, 2));
2285 wanted_mode = mode_for_extraction (EP_insv, 0);
2287 /* If we have a narrower mode, we can do something. */
2288 if (GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2290 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2291 rtx old_pos = XEXP (outerdest, 2);
2294 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2295 offset = (GET_MODE_SIZE (is_mode)
2296 - GET_MODE_SIZE (wanted_mode) - offset);
2298 pos %= GET_MODE_BITSIZE (wanted_mode);
2300 newmem = adjust_address_nv (tem, wanted_mode, offset);
2302 /* Make the change and see if the insn remains valid. */
2303 INSN_CODE (insn) = -1;
2304 XEXP (outerdest, 0) = newmem;
2305 XEXP (outerdest, 2) = GEN_INT (pos);
2307 if (recog_memoized (insn) >= 0)
2310 /* Otherwise, restore old position. XEXP (x, 0) will be
2312 XEXP (outerdest, 2) = old_pos;
2316 /* If we get here, the bit-field store doesn't allow memory
2317 or isn't located at a constant position. Load the value into
2318 a register, do the store, and put it back into memory. */
2320 tem1 = gen_reg_rtx (GET_MODE (tem));
2321 emit_insn_before (gen_move_insn (tem1, tem), insn);
2322 emit_insn_after (gen_move_insn (tem, tem1), insn);
2323 XEXP (outerdest, 0) = tem1;
2327 /* STRICT_LOW_PART is a no-op on memory references
2328 and it can cause combinations to be unrecognizable,
2331 if (dest == var && GET_CODE (SET_DEST (x)) == STRICT_LOW_PART)
2332 SET_DEST (x) = XEXP (SET_DEST (x), 0);
2334 /* A valid insn to copy VAR into or out of a register
2335 must be left alone, to avoid an infinite loop here.
2336 If the reference to VAR is by a subreg, fix that up,
2337 since SUBREG is not valid for a memref.
2338 Also fix up the address of the stack slot.
2340 Note that we must not try to recognize the insn until
2341 after we know that we have valid addresses and no
2342 (subreg (mem ...) ...) constructs, since these interfere
2343 with determining the validity of the insn. */
2345 if ((SET_SRC (x) == var
2346 || (GET_CODE (SET_SRC (x)) == SUBREG
2347 && SUBREG_REG (SET_SRC (x)) == var))
2348 && (GET_CODE (SET_DEST (x)) == REG
2349 || (GET_CODE (SET_DEST (x)) == SUBREG
2350 && GET_CODE (SUBREG_REG (SET_DEST (x))) == REG))
2351 && GET_MODE (var) == promoted_mode
2352 && x == single_set (insn))
2356 if (GET_CODE (SET_SRC (x)) == SUBREG
2357 && (GET_MODE_SIZE (GET_MODE (SET_SRC (x)))
2358 > GET_MODE_SIZE (GET_MODE (var))))
2360 /* This (subreg VAR) is now a paradoxical subreg. We need
2361 to replace VAR instead of the subreg. */
2362 replacement = find_fixup_replacement (replacements, var);
2363 if (replacement->new == NULL_RTX)
2364 replacement->new = gen_reg_rtx (GET_MODE (var));
2365 SUBREG_REG (SET_SRC (x)) = replacement->new;
2369 replacement = find_fixup_replacement (replacements, SET_SRC (x));
2370 if (replacement->new)
2371 SET_SRC (x) = replacement->new;
2372 else if (GET_CODE (SET_SRC (x)) == SUBREG)
2373 SET_SRC (x) = replacement->new
2374 = fixup_memory_subreg (SET_SRC (x), insn, promoted_mode,
2377 SET_SRC (x) = replacement->new
2378 = fixup_stack_1 (SET_SRC (x), insn);
2381 if (recog_memoized (insn) >= 0)
2384 /* INSN is not valid, but we know that we want to
2385 copy SET_SRC (x) to SET_DEST (x) in some way. So
2386 we generate the move and see whether it requires more
2387 than one insn. If it does, we emit those insns and
2388 delete INSN. Otherwise, we an just replace the pattern
2389 of INSN; we have already verified above that INSN has
2390 no other function that to do X. */
2392 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2393 if (GET_CODE (pat) == SEQUENCE)
2395 last = emit_insn_before (pat, insn);
2397 /* INSN might have REG_RETVAL or other important notes, so
2398 we need to store the pattern of the last insn in the
2399 sequence into INSN similarly to the normal case. LAST
2400 should not have REG_NOTES, but we allow them if INSN has
2402 if (REG_NOTES (last) && REG_NOTES (insn))
2404 if (REG_NOTES (last))
2405 REG_NOTES (insn) = REG_NOTES (last);
2406 PATTERN (insn) = PATTERN (last);
2411 PATTERN (insn) = pat;
2416 if ((SET_DEST (x) == var
2417 || (GET_CODE (SET_DEST (x)) == SUBREG
2418 && SUBREG_REG (SET_DEST (x)) == var))
2419 && (GET_CODE (SET_SRC (x)) == REG
2420 || (GET_CODE (SET_SRC (x)) == SUBREG
2421 && GET_CODE (SUBREG_REG (SET_SRC (x))) == REG))
2422 && GET_MODE (var) == promoted_mode
2423 && x == single_set (insn))
2427 if (GET_CODE (SET_DEST (x)) == SUBREG)
2428 SET_DEST (x) = fixup_memory_subreg (SET_DEST (x), insn,
2431 SET_DEST (x) = fixup_stack_1 (SET_DEST (x), insn);
2433 if (recog_memoized (insn) >= 0)
2436 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2437 if (GET_CODE (pat) == SEQUENCE)
2439 last = emit_insn_before (pat, insn);
2441 /* INSN might have REG_RETVAL or other important notes, so
2442 we need to store the pattern of the last insn in the
2443 sequence into INSN similarly to the normal case. LAST
2444 should not have REG_NOTES, but we allow them if INSN has
2446 if (REG_NOTES (last) && REG_NOTES (insn))
2448 if (REG_NOTES (last))
2449 REG_NOTES (insn) = REG_NOTES (last);
2450 PATTERN (insn) = PATTERN (last);
2455 PATTERN (insn) = pat;
2460 /* Otherwise, storing into VAR must be handled specially
2461 by storing into a temporary and copying that into VAR
2462 with a new insn after this one. Note that this case
2463 will be used when storing into a promoted scalar since
2464 the insn will now have different modes on the input
2465 and output and hence will be invalid (except for the case
2466 of setting it to a constant, which does not need any
2467 change if it is valid). We generate extra code in that case,
2468 but combine.c will eliminate it. */
2473 rtx fixeddest = SET_DEST (x);
2474 enum machine_mode temp_mode;
2476 /* STRICT_LOW_PART can be discarded, around a MEM. */
2477 if (GET_CODE (fixeddest) == STRICT_LOW_PART)
2478 fixeddest = XEXP (fixeddest, 0);
2479 /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */
2480 if (GET_CODE (fixeddest) == SUBREG)
2482 fixeddest = fixup_memory_subreg (fixeddest, insn,
2484 temp_mode = GET_MODE (fixeddest);
2488 fixeddest = fixup_stack_1 (fixeddest, insn);
2489 temp_mode = promoted_mode;
2492 temp = gen_reg_rtx (temp_mode);
2494 emit_insn_after (gen_move_insn (fixeddest,
2495 gen_lowpart (GET_MODE (fixeddest),
2499 SET_DEST (x) = temp;
2507 /* Nothing special about this RTX; fix its operands. */
2509 fmt = GET_RTX_FORMAT (code);
2510 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2513 fixup_var_refs_1 (var, promoted_mode, &XEXP (x, i), insn, replacements,
2515 else if (fmt[i] == 'E')
2518 for (j = 0; j < XVECLEN (x, i); j++)
2519 fixup_var_refs_1 (var, promoted_mode, &XVECEXP (x, i, j),
2520 insn, replacements, no_share);
2525 /* Previously, X had the form (SUBREG:m1 (REG:PROMOTED_MODE ...)).
2526 The REG was placed on the stack, so X now has the form (SUBREG:m1
2529 Return an rtx (MEM:m1 newaddr) which is equivalent. If any insns
2530 must be emitted to compute NEWADDR, put them before INSN.
2532 UNCRITICAL nonzero means accept paradoxical subregs.
2533 This is used for subregs found inside REG_NOTES. */
2536 fixup_memory_subreg (x, insn, promoted_mode, uncritical)
2539 enum machine_mode promoted_mode;
2543 rtx mem = SUBREG_REG (x);
2544 rtx addr = XEXP (mem, 0);
2545 enum machine_mode mode = GET_MODE (x);
2548 /* Paradoxical SUBREGs are usually invalid during RTL generation. */
2549 if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (GET_MODE (mem)) && ! uncritical)
2552 offset = SUBREG_BYTE (x);
2553 if (BYTES_BIG_ENDIAN)
2554 /* If the PROMOTED_MODE is wider than the mode of the MEM, adjust
2555 the offset so that it points to the right location within the
2557 offset -= (GET_MODE_SIZE (promoted_mode) - GET_MODE_SIZE (GET_MODE (mem)));
2559 if (!flag_force_addr
2560 && memory_address_p (mode, plus_constant (addr, offset)))
2561 /* Shortcut if no insns need be emitted. */
2562 return adjust_address (mem, mode, offset);
2565 result = adjust_address (mem, mode, offset);
2566 emit_insn_before (gen_sequence (), insn);
2571 /* Do fixup_memory_subreg on all (SUBREG (MEM ...) ...) contained in X.
2572 Replace subexpressions of X in place.
2573 If X itself is a (SUBREG (MEM ...) ...), return the replacement expression.
2574 Otherwise return X, with its contents possibly altered.
2576 INSN, PROMOTED_MODE and UNCRITICAL are as for
2577 fixup_memory_subreg. */
2580 walk_fixup_memory_subreg (x, insn, promoted_mode, uncritical)
2583 enum machine_mode promoted_mode;
2593 code = GET_CODE (x);
2595 if (code == SUBREG && GET_CODE (SUBREG_REG (x)) == MEM)
2596 return fixup_memory_subreg (x, insn, promoted_mode, uncritical);
2598 /* Nothing special about this RTX; fix its operands. */
2600 fmt = GET_RTX_FORMAT (code);
2601 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2604 XEXP (x, i) = walk_fixup_memory_subreg (XEXP (x, i), insn,
2605 promoted_mode, uncritical);
2606 else if (fmt[i] == 'E')
2609 for (j = 0; j < XVECLEN (x, i); j++)
2611 = walk_fixup_memory_subreg (XVECEXP (x, i, j), insn,
2612 promoted_mode, uncritical);
2618 /* For each memory ref within X, if it refers to a stack slot
2619 with an out of range displacement, put the address in a temp register
2620 (emitting new insns before INSN to load these registers)
2621 and alter the memory ref to use that register.
2622 Replace each such MEM rtx with a copy, to avoid clobberage. */
2625 fixup_stack_1 (x, insn)
2630 RTX_CODE code = GET_CODE (x);
2635 rtx ad = XEXP (x, 0);
2636 /* If we have address of a stack slot but it's not valid
2637 (displacement is too large), compute the sum in a register. */
2638 if (GET_CODE (ad) == PLUS
2639 && GET_CODE (XEXP (ad, 0)) == REG
2640 && ((REGNO (XEXP (ad, 0)) >= FIRST_VIRTUAL_REGISTER
2641 && REGNO (XEXP (ad, 0)) <= LAST_VIRTUAL_REGISTER)
2642 || REGNO (XEXP (ad, 0)) == FRAME_POINTER_REGNUM
2643 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2644 || REGNO (XEXP (ad, 0)) == HARD_FRAME_POINTER_REGNUM
2646 || REGNO (XEXP (ad, 0)) == STACK_POINTER_REGNUM
2647 || REGNO (XEXP (ad, 0)) == ARG_POINTER_REGNUM
2648 || XEXP (ad, 0) == current_function_internal_arg_pointer)
2649 && GET_CODE (XEXP (ad, 1)) == CONST_INT)
2652 if (memory_address_p (GET_MODE (x), ad))
2656 temp = copy_to_reg (ad);
2657 seq = gen_sequence ();
2659 emit_insn_before (seq, insn);
2660 return replace_equiv_address (x, temp);
2665 fmt = GET_RTX_FORMAT (code);
2666 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2669 XEXP (x, i) = fixup_stack_1 (XEXP (x, i), insn);
2670 else if (fmt[i] == 'E')
2673 for (j = 0; j < XVECLEN (x, i); j++)
2674 XVECEXP (x, i, j) = fixup_stack_1 (XVECEXP (x, i, j), insn);
2680 /* Optimization: a bit-field instruction whose field
2681 happens to be a byte or halfword in memory
2682 can be changed to a move instruction.
2684 We call here when INSN is an insn to examine or store into a bit-field.
2685 BODY is the SET-rtx to be altered.
2687 EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0.
2688 (Currently this is called only from function.c, and EQUIV_MEM
2692 optimize_bit_field (body, insn, equiv_mem)
2700 enum machine_mode mode;
2702 if (GET_CODE (SET_DEST (body)) == SIGN_EXTRACT
2703 || GET_CODE (SET_DEST (body)) == ZERO_EXTRACT)
2704 bitfield = SET_DEST (body), destflag = 1;
2706 bitfield = SET_SRC (body), destflag = 0;
2708 /* First check that the field being stored has constant size and position
2709 and is in fact a byte or halfword suitably aligned. */
2711 if (GET_CODE (XEXP (bitfield, 1)) == CONST_INT
2712 && GET_CODE (XEXP (bitfield, 2)) == CONST_INT
2713 && ((mode = mode_for_size (INTVAL (XEXP (bitfield, 1)), MODE_INT, 1))
2715 && INTVAL (XEXP (bitfield, 2)) % INTVAL (XEXP (bitfield, 1)) == 0)
2719 /* Now check that the containing word is memory, not a register,
2720 and that it is safe to change the machine mode. */
2722 if (GET_CODE (XEXP (bitfield, 0)) == MEM)
2723 memref = XEXP (bitfield, 0);
2724 else if (GET_CODE (XEXP (bitfield, 0)) == REG
2726 memref = equiv_mem[REGNO (XEXP (bitfield, 0))];
2727 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2728 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == MEM)
2729 memref = SUBREG_REG (XEXP (bitfield, 0));
2730 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2732 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == REG)
2733 memref = equiv_mem[REGNO (SUBREG_REG (XEXP (bitfield, 0)))];
2736 && ! mode_dependent_address_p (XEXP (memref, 0))
2737 && ! MEM_VOLATILE_P (memref))
2739 /* Now adjust the address, first for any subreg'ing
2740 that we are now getting rid of,
2741 and then for which byte of the word is wanted. */
2743 HOST_WIDE_INT offset = INTVAL (XEXP (bitfield, 2));
2746 /* Adjust OFFSET to count bits from low-address byte. */
2747 if (BITS_BIG_ENDIAN != BYTES_BIG_ENDIAN)
2748 offset = (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield, 0)))
2749 - offset - INTVAL (XEXP (bitfield, 1)));
2751 /* Adjust OFFSET to count bytes from low-address byte. */
2752 offset /= BITS_PER_UNIT;
2753 if (GET_CODE (XEXP (bitfield, 0)) == SUBREG)
2755 offset += (SUBREG_BYTE (XEXP (bitfield, 0))
2756 / UNITS_PER_WORD) * UNITS_PER_WORD;
2757 if (BYTES_BIG_ENDIAN)
2758 offset -= (MIN (UNITS_PER_WORD,
2759 GET_MODE_SIZE (GET_MODE (XEXP (bitfield, 0))))
2760 - MIN (UNITS_PER_WORD,
2761 GET_MODE_SIZE (GET_MODE (memref))));
2765 memref = adjust_address (memref, mode, offset);
2766 insns = get_insns ();
2768 emit_insns_before (insns, insn);
2770 /* Store this memory reference where
2771 we found the bit field reference. */
2775 validate_change (insn, &SET_DEST (body), memref, 1);
2776 if (! CONSTANT_ADDRESS_P (SET_SRC (body)))
2778 rtx src = SET_SRC (body);
2779 while (GET_CODE (src) == SUBREG
2780 && SUBREG_BYTE (src) == 0)
2781 src = SUBREG_REG (src);
2782 if (GET_MODE (src) != GET_MODE (memref))
2783 src = gen_lowpart (GET_MODE (memref), SET_SRC (body));
2784 validate_change (insn, &SET_SRC (body), src, 1);
2786 else if (GET_MODE (SET_SRC (body)) != VOIDmode
2787 && GET_MODE (SET_SRC (body)) != GET_MODE (memref))
2788 /* This shouldn't happen because anything that didn't have
2789 one of these modes should have got converted explicitly
2790 and then referenced through a subreg.
2791 This is so because the original bit-field was
2792 handled by agg_mode and so its tree structure had
2793 the same mode that memref now has. */
2798 rtx dest = SET_DEST (body);
2800 while (GET_CODE (dest) == SUBREG
2801 && SUBREG_BYTE (dest) == 0
2802 && (GET_MODE_CLASS (GET_MODE (dest))
2803 == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest))))
2804 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2806 dest = SUBREG_REG (dest);
2808 validate_change (insn, &SET_DEST (body), dest, 1);
2810 if (GET_MODE (dest) == GET_MODE (memref))
2811 validate_change (insn, &SET_SRC (body), memref, 1);
2814 /* Convert the mem ref to the destination mode. */
2815 rtx newreg = gen_reg_rtx (GET_MODE (dest));
2818 convert_move (newreg, memref,
2819 GET_CODE (SET_SRC (body)) == ZERO_EXTRACT);
2823 validate_change (insn, &SET_SRC (body), newreg, 1);
2827 /* See if we can convert this extraction or insertion into
2828 a simple move insn. We might not be able to do so if this
2829 was, for example, part of a PARALLEL.
2831 If we succeed, write out any needed conversions. If we fail,
2832 it is hard to guess why we failed, so don't do anything
2833 special; just let the optimization be suppressed. */
2835 if (apply_change_group () && seq)
2836 emit_insns_before (seq, insn);
2841 /* These routines are responsible for converting virtual register references
2842 to the actual hard register references once RTL generation is complete.
2844 The following four variables are used for communication between the
2845 routines. They contain the offsets of the virtual registers from their
2846 respective hard registers. */
2848 static int in_arg_offset;
2849 static int var_offset;
2850 static int dynamic_offset;
2851 static int out_arg_offset;
2852 static int cfa_offset;
2854 /* In most machines, the stack pointer register is equivalent to the bottom
2857 #ifndef STACK_POINTER_OFFSET
2858 #define STACK_POINTER_OFFSET 0
2861 /* If not defined, pick an appropriate default for the offset of dynamically
2862 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
2863 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
2865 #ifndef STACK_DYNAMIC_OFFSET
2867 /* The bottom of the stack points to the actual arguments. If
2868 REG_PARM_STACK_SPACE is defined, this includes the space for the register
2869 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
2870 stack space for register parameters is not pushed by the caller, but
2871 rather part of the fixed stack areas and hence not included in
2872 `current_function_outgoing_args_size'. Nevertheless, we must allow
2873 for it when allocating stack dynamic objects. */
2875 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2876 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2877 ((ACCUMULATE_OUTGOING_ARGS \
2878 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
2879 + (STACK_POINTER_OFFSET)) \
2882 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2883 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
2884 + (STACK_POINTER_OFFSET))
2888 /* On most machines, the CFA coincides with the first incoming parm. */
2890 #ifndef ARG_POINTER_CFA_OFFSET
2891 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
2894 /* Build up a (MEM (ADDRESSOF (REG))) rtx for a register REG that just had its
2895 address taken. DECL is the decl or SAVE_EXPR for the object stored in the
2896 register, for later use if we do need to force REG into the stack. REG is
2897 overwritten by the MEM like in put_reg_into_stack. */
2900 gen_mem_addressof (reg, decl)
2904 rtx r = gen_rtx_ADDRESSOF (Pmode, gen_reg_rtx (GET_MODE (reg)),
2907 /* Calculate this before we start messing with decl's RTL. */
2908 HOST_WIDE_INT set = decl ? get_alias_set (decl) : 0;
2910 /* If the original REG was a user-variable, then so is the REG whose
2911 address is being taken. Likewise for unchanging. */
2912 REG_USERVAR_P (XEXP (r, 0)) = REG_USERVAR_P (reg);
2913 RTX_UNCHANGING_P (XEXP (r, 0)) = RTX_UNCHANGING_P (reg);
2915 PUT_CODE (reg, MEM);
2916 MEM_ATTRS (reg) = 0;
2921 tree type = TREE_TYPE (decl);
2922 enum machine_mode decl_mode
2923 = (DECL_P (decl) ? DECL_MODE (decl) : TYPE_MODE (TREE_TYPE (decl)));
2924 rtx decl_rtl = (TREE_CODE (decl) == SAVE_EXPR ? SAVE_EXPR_RTL (decl)
2925 : DECL_RTL_IF_SET (decl));
2927 PUT_MODE (reg, decl_mode);
2929 /* Clear DECL_RTL momentarily so functions below will work
2930 properly, then set it again. */
2931 if (DECL_P (decl) && decl_rtl == reg)
2932 SET_DECL_RTL (decl, 0);
2934 set_mem_attributes (reg, decl, 1);
2935 set_mem_alias_set (reg, set);
2937 if (DECL_P (decl) && decl_rtl == reg)
2938 SET_DECL_RTL (decl, reg);
2940 if (TREE_USED (decl) || (DECL_P (decl) && DECL_INITIAL (decl) != 0))
2941 fixup_var_refs (reg, GET_MODE (reg), TREE_UNSIGNED (type), reg, 0);
2944 fixup_var_refs (reg, GET_MODE (reg), 0, reg, 0);
2949 /* If DECL has an RTL that is an ADDRESSOF rtx, put it into the stack. */
2952 flush_addressof (decl)
2955 if ((TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == VAR_DECL)
2956 && DECL_RTL (decl) != 0
2957 && GET_CODE (DECL_RTL (decl)) == MEM
2958 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF
2959 && GET_CODE (XEXP (XEXP (DECL_RTL (decl), 0), 0)) == REG)
2960 put_addressof_into_stack (XEXP (DECL_RTL (decl), 0), 0);
2963 /* Force the register pointed to by R, an ADDRESSOF rtx, into the stack. */
2966 put_addressof_into_stack (r, ht)
2971 int volatile_p, used_p;
2973 rtx reg = XEXP (r, 0);
2975 if (GET_CODE (reg) != REG)
2978 decl = ADDRESSOF_DECL (r);
2981 type = TREE_TYPE (decl);
2982 volatile_p = (TREE_CODE (decl) != SAVE_EXPR
2983 && TREE_THIS_VOLATILE (decl));
2984 used_p = (TREE_USED (decl)
2985 || (DECL_P (decl) && DECL_INITIAL (decl) != 0));
2994 put_reg_into_stack (0, reg, type, GET_MODE (reg), GET_MODE (reg),
2995 volatile_p, ADDRESSOF_REGNO (r), used_p, ht);
2998 /* List of replacements made below in purge_addressof_1 when creating
2999 bitfield insertions. */
3000 static rtx purge_bitfield_addressof_replacements;
3002 /* List of replacements made below in purge_addressof_1 for patterns
3003 (MEM (ADDRESSOF (REG ...))). The key of the list entry is the
3004 corresponding (ADDRESSOF (REG ...)) and value is a substitution for
3005 the all pattern. List PURGE_BITFIELD_ADDRESSOF_REPLACEMENTS is not
3006 enough in complex cases, e.g. when some field values can be
3007 extracted by usage MEM with narrower mode. */
3008 static rtx purge_addressof_replacements;
3010 /* Helper function for purge_addressof. See if the rtx expression at *LOC
3011 in INSN needs to be changed. If FORCE, always put any ADDRESSOFs into
3012 the stack. If the function returns FALSE then the replacement could not
3016 purge_addressof_1 (loc, insn, force, store, ht)
3028 /* Re-start here to avoid recursion in common cases. */
3035 code = GET_CODE (x);
3037 /* If we don't return in any of the cases below, we will recurse inside
3038 the RTX, which will normally result in any ADDRESSOF being forced into
3042 result = purge_addressof_1 (&SET_DEST (x), insn, force, 1, ht);
3043 result &= purge_addressof_1 (&SET_SRC (x), insn, force, 0, ht);
3046 else if (code == ADDRESSOF)
3050 if (GET_CODE (XEXP (x, 0)) != MEM)
3052 put_addressof_into_stack (x, ht);
3056 /* We must create a copy of the rtx because it was created by
3057 overwriting a REG rtx which is always shared. */
3058 sub = copy_rtx (XEXP (XEXP (x, 0), 0));
3059 if (validate_change (insn, loc, sub, 0)
3060 || validate_replace_rtx (x, sub, insn))
3064 sub = force_operand (sub, NULL_RTX);
3065 if (! validate_change (insn, loc, sub, 0)
3066 && ! validate_replace_rtx (x, sub, insn))
3069 insns = gen_sequence ();
3071 emit_insn_before (insns, insn);
3075 else if (code == MEM && GET_CODE (XEXP (x, 0)) == ADDRESSOF && ! force)
3077 rtx sub = XEXP (XEXP (x, 0), 0);
3079 if (GET_CODE (sub) == MEM)
3080 sub = adjust_address_nv (sub, GET_MODE (x), 0);
3081 else if (GET_CODE (sub) == REG
3082 && (MEM_VOLATILE_P (x) || GET_MODE (x) == BLKmode))
3084 else if (GET_CODE (sub) == REG && GET_MODE (x) != GET_MODE (sub))
3086 int size_x, size_sub;
3090 /* When processing REG_NOTES look at the list of
3091 replacements done on the insn to find the register that X
3095 for (tem = purge_bitfield_addressof_replacements;
3097 tem = XEXP (XEXP (tem, 1), 1))
3098 if (rtx_equal_p (x, XEXP (tem, 0)))
3100 *loc = XEXP (XEXP (tem, 1), 0);
3104 /* See comment for purge_addressof_replacements. */
3105 for (tem = purge_addressof_replacements;
3107 tem = XEXP (XEXP (tem, 1), 1))
3108 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3110 rtx z = XEXP (XEXP (tem, 1), 0);
3112 if (GET_MODE (x) == GET_MODE (z)
3113 || (GET_CODE (XEXP (XEXP (tem, 1), 0)) != REG
3114 && GET_CODE (XEXP (XEXP (tem, 1), 0)) != SUBREG))
3117 /* It can happen that the note may speak of things
3118 in a wider (or just different) mode than the
3119 code did. This is especially true of
3122 if (GET_CODE (z) == SUBREG && SUBREG_BYTE (z) == 0)
3125 if (GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD
3126 && (GET_MODE_SIZE (GET_MODE (x))
3127 > GET_MODE_SIZE (GET_MODE (z))))
3129 /* This can occur as a result in invalid
3130 pointer casts, e.g. float f; ...
3131 *(long long int *)&f.
3132 ??? We could emit a warning here, but
3133 without a line number that wouldn't be
3135 z = gen_rtx_SUBREG (GET_MODE (x), z, 0);
3138 z = gen_lowpart (GET_MODE (x), z);
3144 /* Sometimes we may not be able to find the replacement. For
3145 example when the original insn was a MEM in a wider mode,
3146 and the note is part of a sign extension of a narrowed
3147 version of that MEM. Gcc testcase compile/990829-1.c can
3148 generate an example of this situation. Rather than complain
3149 we return false, which will prompt our caller to remove the
3154 size_x = GET_MODE_BITSIZE (GET_MODE (x));
3155 size_sub = GET_MODE_BITSIZE (GET_MODE (sub));
3157 /* Don't even consider working with paradoxical subregs,
3158 or the moral equivalent seen here. */
3159 if (size_x <= size_sub
3160 && int_mode_for_mode (GET_MODE (sub)) != BLKmode)
3162 /* Do a bitfield insertion to mirror what would happen
3169 rtx p = PREV_INSN (insn);
3172 val = gen_reg_rtx (GET_MODE (x));
3173 if (! validate_change (insn, loc, val, 0))
3175 /* Discard the current sequence and put the
3176 ADDRESSOF on stack. */
3180 seq = gen_sequence ();
3182 emit_insn_before (seq, insn);
3183 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3187 store_bit_field (sub, size_x, 0, GET_MODE (x),
3188 val, GET_MODE_SIZE (GET_MODE (sub)));
3190 /* Make sure to unshare any shared rtl that store_bit_field
3191 might have created. */
3192 unshare_all_rtl_again (get_insns ());
3194 seq = gen_sequence ();
3196 p = emit_insn_after (seq, insn);
3197 if (NEXT_INSN (insn))
3198 compute_insns_for_mem (NEXT_INSN (insn),
3199 p ? NEXT_INSN (p) : NULL_RTX,
3204 rtx p = PREV_INSN (insn);
3207 val = extract_bit_field (sub, size_x, 0, 1, NULL_RTX,
3208 GET_MODE (x), GET_MODE (x),
3209 GET_MODE_SIZE (GET_MODE (sub)));
3211 if (! validate_change (insn, loc, val, 0))
3213 /* Discard the current sequence and put the
3214 ADDRESSOF on stack. */
3219 seq = gen_sequence ();
3221 emit_insn_before (seq, insn);
3222 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3226 /* Remember the replacement so that the same one can be done
3227 on the REG_NOTES. */
3228 purge_bitfield_addressof_replacements
3229 = gen_rtx_EXPR_LIST (VOIDmode, x,
3232 purge_bitfield_addressof_replacements));
3234 /* We replaced with a reg -- all done. */
3239 else if (validate_change (insn, loc, sub, 0))
3241 /* Remember the replacement so that the same one can be done
3242 on the REG_NOTES. */
3243 if (GET_CODE (sub) == REG || GET_CODE (sub) == SUBREG)
3247 for (tem = purge_addressof_replacements;
3249 tem = XEXP (XEXP (tem, 1), 1))
3250 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3252 XEXP (XEXP (tem, 1), 0) = sub;
3255 purge_addressof_replacements
3256 = gen_rtx (EXPR_LIST, VOIDmode, XEXP (x, 0),
3257 gen_rtx_EXPR_LIST (VOIDmode, sub,
3258 purge_addressof_replacements));
3266 /* Scan all subexpressions. */
3267 fmt = GET_RTX_FORMAT (code);
3268 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
3271 result &= purge_addressof_1 (&XEXP (x, i), insn, force, 0, ht);
3272 else if (*fmt == 'E')
3273 for (j = 0; j < XVECLEN (x, i); j++)
3274 result &= purge_addressof_1 (&XVECEXP (x, i, j), insn, force, 0, ht);
3280 /* Return a hash value for K, a REG. */
3283 insns_for_mem_hash (k)
3286 /* Use the address of the key for the hash value. */
3287 struct insns_for_mem_entry *m = (struct insns_for_mem_entry *) k;
3288 return (hashval_t) m->key;
3291 /* Return non-zero if K1 and K2 (two REGs) are the same. */
3294 insns_for_mem_comp (k1, k2)
3298 struct insns_for_mem_entry *m1 = (struct insns_for_mem_entry *) k1;
3299 struct insns_for_mem_entry *m2 = (struct insns_for_mem_entry *) k2;
3300 return m1->key == m2->key;
3303 struct insns_for_mem_walk_info
3305 /* The hash table that we are using to record which INSNs use which
3309 /* The INSN we are currently processing. */
3312 /* Zero if we are walking to find ADDRESSOFs, one if we are walking
3313 to find the insns that use the REGs in the ADDRESSOFs. */
3317 /* Called from compute_insns_for_mem via for_each_rtx. If R is a REG
3318 that might be used in an ADDRESSOF expression, record this INSN in
3319 the hash table given by DATA (which is really a pointer to an
3320 insns_for_mem_walk_info structure). */
3323 insns_for_mem_walk (r, data)
3327 struct insns_for_mem_walk_info *ifmwi
3328 = (struct insns_for_mem_walk_info *) data;
3329 struct insns_for_mem_entry tmp;
3330 tmp.insns = NULL_RTX;
3332 if (ifmwi->pass == 0 && *r && GET_CODE (*r) == ADDRESSOF
3333 && GET_CODE (XEXP (*r, 0)) == REG)
3336 tmp.key = XEXP (*r, 0);
3337 e = htab_find_slot (ifmwi->ht, &tmp, INSERT);
3340 *e = ggc_alloc (sizeof (tmp));
3341 memcpy (*e, &tmp, sizeof (tmp));
3344 else if (ifmwi->pass == 1 && *r && GET_CODE (*r) == REG)
3346 struct insns_for_mem_entry *ifme;
3348 ifme = (struct insns_for_mem_entry *) htab_find (ifmwi->ht, &tmp);
3350 /* If we have not already recorded this INSN, do so now. Since
3351 we process the INSNs in order, we know that if we have
3352 recorded it it must be at the front of the list. */
3353 if (ifme && (!ifme->insns || XEXP (ifme->insns, 0) != ifmwi->insn))
3354 ifme->insns = gen_rtx_EXPR_LIST (VOIDmode, ifmwi->insn,
3361 /* Walk the INSNS, until we reach LAST_INSN, recording which INSNs use
3362 which REGs in HT. */
3365 compute_insns_for_mem (insns, last_insn, ht)
3371 struct insns_for_mem_walk_info ifmwi;
3374 for (ifmwi.pass = 0; ifmwi.pass < 2; ++ifmwi.pass)
3375 for (insn = insns; insn != last_insn; insn = NEXT_INSN (insn))
3379 for_each_rtx (&insn, insns_for_mem_walk, &ifmwi);
3383 /* Helper function for purge_addressof called through for_each_rtx.
3384 Returns true iff the rtl is an ADDRESSOF. */
3387 is_addressof (rtl, data)
3389 void *data ATTRIBUTE_UNUSED;
3391 return GET_CODE (*rtl) == ADDRESSOF;
3394 /* Eliminate all occurrences of ADDRESSOF from INSNS. Elide any remaining
3395 (MEM (ADDRESSOF)) patterns, and force any needed registers into the
3399 purge_addressof (insns)
3405 /* When we actually purge ADDRESSOFs, we turn REGs into MEMs. That
3406 requires a fixup pass over the instruction stream to correct
3407 INSNs that depended on the REG being a REG, and not a MEM. But,
3408 these fixup passes are slow. Furthermore, most MEMs are not
3409 mentioned in very many instructions. So, we speed up the process
3410 by pre-calculating which REGs occur in which INSNs; that allows
3411 us to perform the fixup passes much more quickly. */
3412 ht = htab_create_ggc (1000, insns_for_mem_hash, insns_for_mem_comp, NULL);
3413 compute_insns_for_mem (insns, NULL_RTX, ht);
3415 for (insn = insns; insn; insn = NEXT_INSN (insn))
3416 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
3417 || GET_CODE (insn) == CALL_INSN)
3419 if (! purge_addressof_1 (&PATTERN (insn), insn,
3420 asm_noperands (PATTERN (insn)) > 0, 0, ht))
3421 /* If we could not replace the ADDRESSOFs in the insn,
3422 something is wrong. */
3425 if (! purge_addressof_1 (®_NOTES (insn), NULL_RTX, 0, 0, ht))
3427 /* If we could not replace the ADDRESSOFs in the insn's notes,
3428 we can just remove the offending notes instead. */
3431 for (note = REG_NOTES (insn); note; note = XEXP (note, 1))
3433 /* If we find a REG_RETVAL note then the insn is a libcall.
3434 Such insns must have REG_EQUAL notes as well, in order
3435 for later passes of the compiler to work. So it is not
3436 safe to delete the notes here, and instead we abort. */
3437 if (REG_NOTE_KIND (note) == REG_RETVAL)
3439 if (for_each_rtx (¬e, is_addressof, NULL))
3440 remove_note (insn, note);
3446 purge_bitfield_addressof_replacements = 0;
3447 purge_addressof_replacements = 0;
3449 /* REGs are shared. purge_addressof will destructively replace a REG
3450 with a MEM, which creates shared MEMs.
3452 Unfortunately, the children of put_reg_into_stack assume that MEMs
3453 referring to the same stack slot are shared (fixup_var_refs and
3454 the associated hash table code).
3456 So, we have to do another unsharing pass after we have flushed any
3457 REGs that had their address taken into the stack.
3459 It may be worth tracking whether or not we converted any REGs into
3460 MEMs to avoid this overhead when it is not needed. */
3461 unshare_all_rtl_again (get_insns ());
3464 /* Convert a SET of a hard subreg to a set of the appropriate hard
3465 register. A subroutine of purge_hard_subreg_sets. */
3468 purge_single_hard_subreg_set (pattern)
3471 rtx reg = SET_DEST (pattern);
3472 enum machine_mode mode = GET_MODE (SET_DEST (pattern));
3475 if (GET_CODE (reg) == SUBREG && GET_CODE (SUBREG_REG (reg)) == REG
3476 && REGNO (SUBREG_REG (reg)) < FIRST_PSEUDO_REGISTER)
3478 offset = subreg_regno_offset (REGNO (SUBREG_REG (reg)),
3479 GET_MODE (SUBREG_REG (reg)),
3482 reg = SUBREG_REG (reg);
3486 if (GET_CODE (reg) == REG && REGNO (reg) < FIRST_PSEUDO_REGISTER)
3488 reg = gen_rtx_REG (mode, REGNO (reg) + offset);
3489 SET_DEST (pattern) = reg;
3493 /* Eliminate all occurrences of SETs of hard subregs from INSNS. The
3494 only such SETs that we expect to see are those left in because
3495 integrate can't handle sets of parts of a return value register.
3497 We don't use alter_subreg because we only want to eliminate subregs
3498 of hard registers. */
3501 purge_hard_subreg_sets (insn)
3504 for (; insn; insn = NEXT_INSN (insn))
3508 rtx pattern = PATTERN (insn);
3509 switch (GET_CODE (pattern))
3512 if (GET_CODE (SET_DEST (pattern)) == SUBREG)
3513 purge_single_hard_subreg_set (pattern);
3518 for (j = XVECLEN (pattern, 0) - 1; j >= 0; j--)
3520 rtx inner_pattern = XVECEXP (pattern, 0, j);
3521 if (GET_CODE (inner_pattern) == SET
3522 && GET_CODE (SET_DEST (inner_pattern)) == SUBREG)
3523 purge_single_hard_subreg_set (inner_pattern);
3534 /* Pass through the INSNS of function FNDECL and convert virtual register
3535 references to hard register references. */
3538 instantiate_virtual_regs (fndecl, insns)
3545 /* Compute the offsets to use for this function. */
3546 in_arg_offset = FIRST_PARM_OFFSET (fndecl);
3547 var_offset = STARTING_FRAME_OFFSET;
3548 dynamic_offset = STACK_DYNAMIC_OFFSET (fndecl);
3549 out_arg_offset = STACK_POINTER_OFFSET;
3550 cfa_offset = ARG_POINTER_CFA_OFFSET (fndecl);
3552 /* Scan all variables and parameters of this function. For each that is
3553 in memory, instantiate all virtual registers if the result is a valid
3554 address. If not, we do it later. That will handle most uses of virtual
3555 regs on many machines. */
3556 instantiate_decls (fndecl, 1);
3558 /* Initialize recognition, indicating that volatile is OK. */
3561 /* Scan through all the insns, instantiating every virtual register still
3563 for (insn = insns; insn; insn = NEXT_INSN (insn))
3564 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
3565 || GET_CODE (insn) == CALL_INSN)
3567 instantiate_virtual_regs_1 (&PATTERN (insn), insn, 1);
3568 instantiate_virtual_regs_1 (®_NOTES (insn), NULL_RTX, 0);
3569 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
3570 if (GET_CODE (insn) == CALL_INSN)
3571 instantiate_virtual_regs_1 (&CALL_INSN_FUNCTION_USAGE (insn),
3575 /* Instantiate the stack slots for the parm registers, for later use in
3576 addressof elimination. */
3577 for (i = 0; i < max_parm_reg; ++i)
3578 if (parm_reg_stack_loc[i])
3579 instantiate_virtual_regs_1 (&parm_reg_stack_loc[i], NULL_RTX, 0);
3581 /* Now instantiate the remaining register equivalences for debugging info.
3582 These will not be valid addresses. */
3583 instantiate_decls (fndecl, 0);
3585 /* Indicate that, from now on, assign_stack_local should use
3586 frame_pointer_rtx. */
3587 virtuals_instantiated = 1;
3590 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
3591 all virtual registers in their DECL_RTL's.
3593 If VALID_ONLY, do this only if the resulting address is still valid.
3594 Otherwise, always do it. */
3597 instantiate_decls (fndecl, valid_only)
3603 /* Process all parameters of the function. */
3604 for (decl = DECL_ARGUMENTS (fndecl); decl; decl = TREE_CHAIN (decl))
3606 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (decl));
3607 HOST_WIDE_INT size_rtl;
3609 instantiate_decl (DECL_RTL (decl), size, valid_only);
3611 /* If the parameter was promoted, then the incoming RTL mode may be
3612 larger than the declared type size. We must use the larger of
3614 size_rtl = GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl)));
3615 size = MAX (size_rtl, size);
3616 instantiate_decl (DECL_INCOMING_RTL (decl), size, valid_only);
3619 /* Now process all variables defined in the function or its subblocks. */
3620 instantiate_decls_1 (DECL_INITIAL (fndecl), valid_only);
3623 /* Subroutine of instantiate_decls: Process all decls in the given
3624 BLOCK node and all its subblocks. */
3627 instantiate_decls_1 (let, valid_only)
3633 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
3634 if (DECL_RTL_SET_P (t))
3635 instantiate_decl (DECL_RTL (t),
3636 int_size_in_bytes (TREE_TYPE (t)),
3639 /* Process all subblocks. */
3640 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
3641 instantiate_decls_1 (t, valid_only);
3644 /* Subroutine of the preceding procedures: Given RTL representing a
3645 decl and the size of the object, do any instantiation required.
3647 If VALID_ONLY is non-zero, it means that the RTL should only be
3648 changed if the new address is valid. */
3651 instantiate_decl (x, size, valid_only)
3656 enum machine_mode mode;
3659 /* If this is not a MEM, no need to do anything. Similarly if the
3660 address is a constant or a register that is not a virtual register. */
3662 if (x == 0 || GET_CODE (x) != MEM)
3666 if (CONSTANT_P (addr)
3667 || (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == REG)
3668 || (GET_CODE (addr) == REG
3669 && (REGNO (addr) < FIRST_VIRTUAL_REGISTER
3670 || REGNO (addr) > LAST_VIRTUAL_REGISTER)))
3673 /* If we should only do this if the address is valid, copy the address.
3674 We need to do this so we can undo any changes that might make the
3675 address invalid. This copy is unfortunate, but probably can't be
3679 addr = copy_rtx (addr);
3681 instantiate_virtual_regs_1 (&addr, NULL_RTX, 0);
3683 if (valid_only && size >= 0)
3685 unsigned HOST_WIDE_INT decl_size = size;
3687 /* Now verify that the resulting address is valid for every integer or
3688 floating-point mode up to and including SIZE bytes long. We do this
3689 since the object might be accessed in any mode and frame addresses
3692 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3693 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3694 mode = GET_MODE_WIDER_MODE (mode))
3695 if (! memory_address_p (mode, addr))
3698 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
3699 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3700 mode = GET_MODE_WIDER_MODE (mode))
3701 if (! memory_address_p (mode, addr))
3705 /* Put back the address now that we have updated it and we either know
3706 it is valid or we don't care whether it is valid. */
3711 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
3712 is a virtual register, return the equivalent hard register and set the
3713 offset indirectly through the pointer. Otherwise, return 0. */
3716 instantiate_new_reg (x, poffset)
3718 HOST_WIDE_INT *poffset;
3721 HOST_WIDE_INT offset;
3723 if (x == virtual_incoming_args_rtx)
3724 new = arg_pointer_rtx, offset = in_arg_offset;
3725 else if (x == virtual_stack_vars_rtx)
3726 new = frame_pointer_rtx, offset = var_offset;
3727 else if (x == virtual_stack_dynamic_rtx)
3728 new = stack_pointer_rtx, offset = dynamic_offset;
3729 else if (x == virtual_outgoing_args_rtx)
3730 new = stack_pointer_rtx, offset = out_arg_offset;
3731 else if (x == virtual_cfa_rtx)
3732 new = arg_pointer_rtx, offset = cfa_offset;
3740 /* Given a pointer to a piece of rtx and an optional pointer to the
3741 containing object, instantiate any virtual registers present in it.
3743 If EXTRA_INSNS, we always do the replacement and generate
3744 any extra insns before OBJECT. If it zero, we do nothing if replacement
3747 Return 1 if we either had nothing to do or if we were able to do the
3748 needed replacement. Return 0 otherwise; we only return zero if
3749 EXTRA_INSNS is zero.
3751 We first try some simple transformations to avoid the creation of extra
3755 instantiate_virtual_regs_1 (loc, object, extra_insns)
3763 HOST_WIDE_INT offset = 0;
3769 /* Re-start here to avoid recursion in common cases. */
3776 code = GET_CODE (x);
3778 /* Check for some special cases. */
3796 /* We are allowed to set the virtual registers. This means that
3797 the actual register should receive the source minus the
3798 appropriate offset. This is used, for example, in the handling
3799 of non-local gotos. */
3800 if ((new = instantiate_new_reg (SET_DEST (x), &offset)) != 0)
3802 rtx src = SET_SRC (x);
3804 /* We are setting the register, not using it, so the relevant
3805 offset is the negative of the offset to use were we using
3808 instantiate_virtual_regs_1 (&src, NULL_RTX, 0);
3810 /* The only valid sources here are PLUS or REG. Just do
3811 the simplest possible thing to handle them. */
3812 if (GET_CODE (src) != REG && GET_CODE (src) != PLUS)
3816 if (GET_CODE (src) != REG)
3817 temp = force_operand (src, NULL_RTX);
3820 temp = force_operand (plus_constant (temp, offset), NULL_RTX);
3824 emit_insns_before (seq, object);
3827 if (! validate_change (object, &SET_SRC (x), temp, 0)
3834 instantiate_virtual_regs_1 (&SET_DEST (x), object, extra_insns);
3839 /* Handle special case of virtual register plus constant. */
3840 if (CONSTANT_P (XEXP (x, 1)))
3842 rtx old, new_offset;
3844 /* Check for (plus (plus VIRT foo) (const_int)) first. */
3845 if (GET_CODE (XEXP (x, 0)) == PLUS)
3847 if ((new = instantiate_new_reg (XEXP (XEXP (x, 0), 0), &offset)))
3849 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 1), object,
3851 new = gen_rtx_PLUS (Pmode, new, XEXP (XEXP (x, 0), 1));
3860 #ifdef POINTERS_EXTEND_UNSIGNED
3861 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
3862 we can commute the PLUS and SUBREG because pointers into the
3863 frame are well-behaved. */
3864 else if (GET_CODE (XEXP (x, 0)) == SUBREG && GET_MODE (x) == ptr_mode
3865 && GET_CODE (XEXP (x, 1)) == CONST_INT
3867 = instantiate_new_reg (SUBREG_REG (XEXP (x, 0)),
3869 && validate_change (object, loc,
3870 plus_constant (gen_lowpart (ptr_mode,
3873 + INTVAL (XEXP (x, 1))),
3877 else if ((new = instantiate_new_reg (XEXP (x, 0), &offset)) == 0)
3879 /* We know the second operand is a constant. Unless the
3880 first operand is a REG (which has been already checked),
3881 it needs to be checked. */
3882 if (GET_CODE (XEXP (x, 0)) != REG)
3890 new_offset = plus_constant (XEXP (x, 1), offset);
3892 /* If the new constant is zero, try to replace the sum with just
3894 if (new_offset == const0_rtx
3895 && validate_change (object, loc, new, 0))
3898 /* Next try to replace the register and new offset.
3899 There are two changes to validate here and we can't assume that
3900 in the case of old offset equals new just changing the register
3901 will yield a valid insn. In the interests of a little efficiency,
3902 however, we only call validate change once (we don't queue up the
3903 changes and then call apply_change_group). */
3907 ? ! validate_change (object, &XEXP (x, 0), new, 0)
3908 : (XEXP (x, 0) = new,
3909 ! validate_change (object, &XEXP (x, 1), new_offset, 0)))
3917 /* Otherwise copy the new constant into a register and replace
3918 constant with that register. */
3919 temp = gen_reg_rtx (Pmode);
3921 if (validate_change (object, &XEXP (x, 1), temp, 0))
3922 emit_insn_before (gen_move_insn (temp, new_offset), object);
3925 /* If that didn't work, replace this expression with a
3926 register containing the sum. */
3929 new = gen_rtx_PLUS (Pmode, new, new_offset);
3932 temp = force_operand (new, NULL_RTX);
3936 emit_insns_before (seq, object);
3937 if (! validate_change (object, loc, temp, 0)
3938 && ! validate_replace_rtx (x, temp, object))
3946 /* Fall through to generic two-operand expression case. */
3952 case DIV: case UDIV:
3953 case MOD: case UMOD:
3954 case AND: case IOR: case XOR:
3955 case ROTATERT: case ROTATE:
3956 case ASHIFTRT: case LSHIFTRT: case ASHIFT:
3958 case GE: case GT: case GEU: case GTU:
3959 case LE: case LT: case LEU: case LTU:
3960 if (XEXP (x, 1) && ! CONSTANT_P (XEXP (x, 1)))
3961 instantiate_virtual_regs_1 (&XEXP (x, 1), object, extra_insns);
3966 /* Most cases of MEM that convert to valid addresses have already been
3967 handled by our scan of decls. The only special handling we
3968 need here is to make a copy of the rtx to ensure it isn't being
3969 shared if we have to change it to a pseudo.
3971 If the rtx is a simple reference to an address via a virtual register,
3972 it can potentially be shared. In such cases, first try to make it
3973 a valid address, which can also be shared. Otherwise, copy it and
3976 First check for common cases that need no processing. These are
3977 usually due to instantiation already being done on a previous instance
3981 if (CONSTANT_ADDRESS_P (temp)
3982 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3983 || temp == arg_pointer_rtx
3985 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3986 || temp == hard_frame_pointer_rtx
3988 || temp == frame_pointer_rtx)
3991 if (GET_CODE (temp) == PLUS
3992 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
3993 && (XEXP (temp, 0) == frame_pointer_rtx
3994 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3995 || XEXP (temp, 0) == hard_frame_pointer_rtx
3997 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3998 || XEXP (temp, 0) == arg_pointer_rtx
4003 if (temp == virtual_stack_vars_rtx
4004 || temp == virtual_incoming_args_rtx
4005 || (GET_CODE (temp) == PLUS
4006 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
4007 && (XEXP (temp, 0) == virtual_stack_vars_rtx
4008 || XEXP (temp, 0) == virtual_incoming_args_rtx)))
4010 /* This MEM may be shared. If the substitution can be done without
4011 the need to generate new pseudos, we want to do it in place
4012 so all copies of the shared rtx benefit. The call below will
4013 only make substitutions if the resulting address is still
4016 Note that we cannot pass X as the object in the recursive call
4017 since the insn being processed may not allow all valid
4018 addresses. However, if we were not passed on object, we can
4019 only modify X without copying it if X will have a valid
4022 ??? Also note that this can still lose if OBJECT is an insn that
4023 has less restrictions on an address that some other insn.
4024 In that case, we will modify the shared address. This case
4025 doesn't seem very likely, though. One case where this could
4026 happen is in the case of a USE or CLOBBER reference, but we
4027 take care of that below. */
4029 if (instantiate_virtual_regs_1 (&XEXP (x, 0),
4030 object ? object : x, 0))
4033 /* Otherwise make a copy and process that copy. We copy the entire
4034 RTL expression since it might be a PLUS which could also be
4036 *loc = x = copy_rtx (x);
4039 /* Fall through to generic unary operation case. */
4042 case STRICT_LOW_PART:
4044 case PRE_DEC: case PRE_INC: case POST_DEC: case POST_INC:
4045 case SIGN_EXTEND: case ZERO_EXTEND:
4046 case TRUNCATE: case FLOAT_EXTEND: case FLOAT_TRUNCATE:
4047 case FLOAT: case FIX:
4048 case UNSIGNED_FIX: case UNSIGNED_FLOAT:
4052 /* These case either have just one operand or we know that we need not
4053 check the rest of the operands. */
4059 /* If the operand is a MEM, see if the change is a valid MEM. If not,
4060 go ahead and make the invalid one, but do it to a copy. For a REG,
4061 just make the recursive call, since there's no chance of a problem. */
4063 if ((GET_CODE (XEXP (x, 0)) == MEM
4064 && instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), XEXP (x, 0),
4066 || (GET_CODE (XEXP (x, 0)) == REG
4067 && instantiate_virtual_regs_1 (&XEXP (x, 0), object, 0)))
4070 XEXP (x, 0) = copy_rtx (XEXP (x, 0));
4075 /* Try to replace with a PLUS. If that doesn't work, compute the sum
4076 in front of this insn and substitute the temporary. */
4077 if ((new = instantiate_new_reg (x, &offset)) != 0)
4079 temp = plus_constant (new, offset);
4080 if (!validate_change (object, loc, temp, 0))
4086 temp = force_operand (temp, NULL_RTX);
4090 emit_insns_before (seq, object);
4091 if (! validate_change (object, loc, temp, 0)
4092 && ! validate_replace_rtx (x, temp, object))
4100 if (GET_CODE (XEXP (x, 0)) == REG)
4103 else if (GET_CODE (XEXP (x, 0)) == MEM)
4105 /* If we have a (addressof (mem ..)), do any instantiation inside
4106 since we know we'll be making the inside valid when we finally
4107 remove the ADDRESSOF. */
4108 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), NULL_RTX, 0);
4117 /* Scan all subexpressions. */
4118 fmt = GET_RTX_FORMAT (code);
4119 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
4122 if (!instantiate_virtual_regs_1 (&XEXP (x, i), object, extra_insns))
4125 else if (*fmt == 'E')
4126 for (j = 0; j < XVECLEN (x, i); j++)
4127 if (! instantiate_virtual_regs_1 (&XVECEXP (x, i, j), object,
4134 /* Optimization: assuming this function does not receive nonlocal gotos,
4135 delete the handlers for such, as well as the insns to establish
4136 and disestablish them. */
4142 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4144 /* Delete the handler by turning off the flag that would
4145 prevent jump_optimize from deleting it.
4146 Also permit deletion of the nonlocal labels themselves
4147 if nothing local refers to them. */
4148 if (GET_CODE (insn) == CODE_LABEL)
4152 LABEL_PRESERVE_P (insn) = 0;
4154 /* Remove it from the nonlocal_label list, to avoid confusing
4156 for (t = nonlocal_labels, last_t = 0; t;
4157 last_t = t, t = TREE_CHAIN (t))
4158 if (DECL_RTL (TREE_VALUE (t)) == insn)
4163 nonlocal_labels = TREE_CHAIN (nonlocal_labels);
4165 TREE_CHAIN (last_t) = TREE_CHAIN (t);
4168 if (GET_CODE (insn) == INSN)
4172 for (t = nonlocal_goto_handler_slots; t != 0; t = XEXP (t, 1))
4173 if (reg_mentioned_p (t, PATTERN (insn)))
4179 || (nonlocal_goto_stack_level != 0
4180 && reg_mentioned_p (nonlocal_goto_stack_level,
4182 delete_related_insns (insn);
4190 return max_parm_reg;
4193 /* Return the first insn following those generated by `assign_parms'. */
4196 get_first_nonparm_insn ()
4199 return NEXT_INSN (last_parm_insn);
4200 return get_insns ();
4203 /* Return the first NOTE_INSN_BLOCK_BEG note in the function.
4204 Crash if there is none. */
4207 get_first_block_beg ()
4210 rtx insn = get_first_nonparm_insn ();
4212 for (searcher = insn; searcher; searcher = NEXT_INSN (searcher))
4213 if (GET_CODE (searcher) == NOTE
4214 && NOTE_LINE_NUMBER (searcher) == NOTE_INSN_BLOCK_BEG)
4217 abort (); /* Invalid call to this function. (See comments above.) */
4221 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
4222 This means a type for which function calls must pass an address to the
4223 function or get an address back from the function.
4224 EXP may be a type node or an expression (whose type is tested). */
4227 aggregate_value_p (exp)
4230 int i, regno, nregs;
4233 tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
4235 if (TREE_CODE (type) == VOID_TYPE)
4237 if (RETURN_IN_MEMORY (type))
4239 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
4240 and thus can't be returned in registers. */
4241 if (TREE_ADDRESSABLE (type))
4243 if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
4245 /* Make sure we have suitable call-clobbered regs to return
4246 the value in; if not, we must return it in memory. */
4247 reg = hard_function_value (type, 0, 0);
4249 /* If we have something other than a REG (e.g. a PARALLEL), then assume
4251 if (GET_CODE (reg) != REG)
4254 regno = REGNO (reg);
4255 nregs = HARD_REGNO_NREGS (regno, TYPE_MODE (type));
4256 for (i = 0; i < nregs; i++)
4257 if (! call_used_regs[regno + i])
4262 /* Assign RTL expressions to the function's parameters.
4263 This may involve copying them into registers and using
4264 those registers as the RTL for them. */
4267 assign_parms (fndecl)
4273 CUMULATIVE_ARGS args_so_far;
4274 enum machine_mode promoted_mode, passed_mode;
4275 enum machine_mode nominal_mode, promoted_nominal_mode;
4277 /* Total space needed so far for args on the stack,
4278 given as a constant and a tree-expression. */
4279 struct args_size stack_args_size;
4280 tree fntype = TREE_TYPE (fndecl);
4281 tree fnargs = DECL_ARGUMENTS (fndecl);
4282 /* This is used for the arg pointer when referring to stack args. */
4283 rtx internal_arg_pointer;
4284 /* This is a dummy PARM_DECL that we used for the function result if
4285 the function returns a structure. */
4286 tree function_result_decl = 0;
4287 #ifdef SETUP_INCOMING_VARARGS
4288 int varargs_setup = 0;
4290 rtx conversion_insns = 0;
4291 struct args_size alignment_pad;
4293 /* Nonzero if the last arg is named `__builtin_va_alist',
4294 which is used on some machines for old-fashioned non-ANSI varargs.h;
4295 this should be stuck onto the stack as if it had arrived there. */
4297 = (current_function_varargs
4299 && (parm = tree_last (fnargs)) != 0
4301 && (! strcmp (IDENTIFIER_POINTER (DECL_NAME (parm)),
4302 "__builtin_va_alist")));
4304 /* Nonzero if function takes extra anonymous args.
4305 This means the last named arg must be on the stack
4306 right before the anonymous ones. */
4308 = (TYPE_ARG_TYPES (fntype) != 0
4309 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
4310 != void_type_node));
4312 current_function_stdarg = stdarg;
4314 /* If the reg that the virtual arg pointer will be translated into is
4315 not a fixed reg or is the stack pointer, make a copy of the virtual
4316 arg pointer, and address parms via the copy. The frame pointer is
4317 considered fixed even though it is not marked as such.
4319 The second time through, simply use ap to avoid generating rtx. */
4321 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
4322 || ! (fixed_regs[ARG_POINTER_REGNUM]
4323 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
4324 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
4326 internal_arg_pointer = virtual_incoming_args_rtx;
4327 current_function_internal_arg_pointer = internal_arg_pointer;
4329 stack_args_size.constant = 0;
4330 stack_args_size.var = 0;
4332 /* If struct value address is treated as the first argument, make it so. */
4333 if (aggregate_value_p (DECL_RESULT (fndecl))
4334 && ! current_function_returns_pcc_struct
4335 && struct_value_incoming_rtx == 0)
4337 tree type = build_pointer_type (TREE_TYPE (fntype));
4339 function_result_decl = build_decl (PARM_DECL, NULL_TREE, type);
4341 DECL_ARG_TYPE (function_result_decl) = type;
4342 TREE_CHAIN (function_result_decl) = fnargs;
4343 fnargs = function_result_decl;
4346 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
4347 parm_reg_stack_loc = (rtx *) ggc_alloc_cleared (max_parm_reg * sizeof (rtx));
4349 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
4350 INIT_CUMULATIVE_INCOMING_ARGS (args_so_far, fntype, NULL_RTX);
4352 INIT_CUMULATIVE_ARGS (args_so_far, fntype, NULL_RTX, 0);
4355 /* We haven't yet found an argument that we must push and pretend the
4357 current_function_pretend_args_size = 0;
4359 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
4361 struct args_size stack_offset;
4362 struct args_size arg_size;
4363 int passed_pointer = 0;
4364 int did_conversion = 0;
4365 tree passed_type = DECL_ARG_TYPE (parm);
4366 tree nominal_type = TREE_TYPE (parm);
4368 int last_named = 0, named_arg;
4370 /* Set LAST_NAMED if this is last named arg before last
4372 if (stdarg || current_function_varargs)
4376 for (tem = TREE_CHAIN (parm); tem; tem = TREE_CHAIN (tem))
4377 if (DECL_NAME (tem))
4383 /* Set NAMED_ARG if this arg should be treated as a named arg. For
4384 most machines, if this is a varargs/stdarg function, then we treat
4385 the last named arg as if it were anonymous too. */
4386 named_arg = STRICT_ARGUMENT_NAMING ? 1 : ! last_named;
4388 if (TREE_TYPE (parm) == error_mark_node
4389 /* This can happen after weird syntax errors
4390 or if an enum type is defined among the parms. */
4391 || TREE_CODE (parm) != PARM_DECL
4392 || passed_type == NULL)
4394 SET_DECL_RTL (parm, gen_rtx_MEM (BLKmode, const0_rtx));
4395 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4396 TREE_USED (parm) = 1;
4400 /* For varargs.h function, save info about regs and stack space
4401 used by the individual args, not including the va_alist arg. */
4402 if (hide_last_arg && last_named)
4403 current_function_args_info = args_so_far;
4405 /* Find mode of arg as it is passed, and mode of arg
4406 as it should be during execution of this function. */
4407 passed_mode = TYPE_MODE (passed_type);
4408 nominal_mode = TYPE_MODE (nominal_type);
4410 /* If the parm's mode is VOID, its value doesn't matter,
4411 and avoid the usual things like emit_move_insn that could crash. */
4412 if (nominal_mode == VOIDmode)
4414 SET_DECL_RTL (parm, const0_rtx);
4415 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4419 /* If the parm is to be passed as a transparent union, use the
4420 type of the first field for the tests below. We have already
4421 verified that the modes are the same. */
4422 if (DECL_TRANSPARENT_UNION (parm)
4423 || (TREE_CODE (passed_type) == UNION_TYPE
4424 && TYPE_TRANSPARENT_UNION (passed_type)))
4425 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
4427 /* See if this arg was passed by invisible reference. It is if
4428 it is an object whose size depends on the contents of the
4429 object itself or if the machine requires these objects be passed
4432 if ((TREE_CODE (TYPE_SIZE (passed_type)) != INTEGER_CST
4433 && contains_placeholder_p (TYPE_SIZE (passed_type)))
4434 || TREE_ADDRESSABLE (passed_type)
4435 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
4436 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, passed_mode,
4437 passed_type, named_arg)
4441 passed_type = nominal_type = build_pointer_type (passed_type);
4443 passed_mode = nominal_mode = Pmode;
4446 promoted_mode = passed_mode;
4448 #ifdef PROMOTE_FUNCTION_ARGS
4449 /* Compute the mode in which the arg is actually extended to. */
4450 unsignedp = TREE_UNSIGNED (passed_type);
4451 promoted_mode = promote_mode (passed_type, promoted_mode, &unsignedp, 1);
4454 /* Let machine desc say which reg (if any) the parm arrives in.
4455 0 means it arrives on the stack. */
4456 #ifdef FUNCTION_INCOMING_ARG
4457 entry_parm = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4458 passed_type, named_arg);
4460 entry_parm = FUNCTION_ARG (args_so_far, promoted_mode,
4461 passed_type, named_arg);
4464 if (entry_parm == 0)
4465 promoted_mode = passed_mode;
4467 #ifdef SETUP_INCOMING_VARARGS
4468 /* If this is the last named parameter, do any required setup for
4469 varargs or stdargs. We need to know about the case of this being an
4470 addressable type, in which case we skip the registers it
4471 would have arrived in.
4473 For stdargs, LAST_NAMED will be set for two parameters, the one that
4474 is actually the last named, and the dummy parameter. We only
4475 want to do this action once.
4477 Also, indicate when RTL generation is to be suppressed. */
4478 if (last_named && !varargs_setup)
4480 SETUP_INCOMING_VARARGS (args_so_far, promoted_mode, passed_type,
4481 current_function_pretend_args_size, 0);
4486 /* Determine parm's home in the stack,
4487 in case it arrives in the stack or we should pretend it did.
4489 Compute the stack position and rtx where the argument arrives
4492 There is one complexity here: If this was a parameter that would
4493 have been passed in registers, but wasn't only because it is
4494 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
4495 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
4496 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
4497 0 as it was the previous time. */
4499 pretend_named = named_arg || PRETEND_OUTGOING_VARARGS_NAMED;
4500 locate_and_pad_parm (promoted_mode, passed_type,
4501 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4504 #ifdef FUNCTION_INCOMING_ARG
4505 FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4507 pretend_named) != 0,
4509 FUNCTION_ARG (args_so_far, promoted_mode,
4511 pretend_named) != 0,
4514 fndecl, &stack_args_size, &stack_offset, &arg_size,
4518 rtx offset_rtx = ARGS_SIZE_RTX (stack_offset);
4520 if (offset_rtx == const0_rtx)
4521 stack_parm = gen_rtx_MEM (promoted_mode, internal_arg_pointer);
4523 stack_parm = gen_rtx_MEM (promoted_mode,
4524 gen_rtx_PLUS (Pmode,
4525 internal_arg_pointer,
4528 set_mem_attributes (stack_parm, parm, 1);
4531 /* If this parameter was passed both in registers and in the stack,
4532 use the copy on the stack. */
4533 if (MUST_PASS_IN_STACK (promoted_mode, passed_type))
4536 #ifdef FUNCTION_ARG_PARTIAL_NREGS
4537 /* If this parm was passed part in regs and part in memory,
4538 pretend it arrived entirely in memory
4539 by pushing the register-part onto the stack.
4541 In the special case of a DImode or DFmode that is split,
4542 we could put it together in a pseudoreg directly,
4543 but for now that's not worth bothering with. */
4547 int nregs = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, promoted_mode,
4548 passed_type, named_arg);
4552 current_function_pretend_args_size
4553 = (((nregs * UNITS_PER_WORD) + (PARM_BOUNDARY / BITS_PER_UNIT) - 1)
4554 / (PARM_BOUNDARY / BITS_PER_UNIT)
4555 * (PARM_BOUNDARY / BITS_PER_UNIT));
4557 /* Handle calls that pass values in multiple non-contiguous
4558 locations. The Irix 6 ABI has examples of this. */
4559 if (GET_CODE (entry_parm) == PARALLEL)
4560 emit_group_store (validize_mem (stack_parm), entry_parm,
4561 int_size_in_bytes (TREE_TYPE (parm)));
4564 move_block_from_reg (REGNO (entry_parm),
4565 validize_mem (stack_parm), nregs,
4566 int_size_in_bytes (TREE_TYPE (parm)));
4568 entry_parm = stack_parm;
4573 /* If we didn't decide this parm came in a register,
4574 by default it came on the stack. */
4575 if (entry_parm == 0)
4576 entry_parm = stack_parm;
4578 /* Record permanently how this parm was passed. */
4579 DECL_INCOMING_RTL (parm) = entry_parm;
4581 /* If there is actually space on the stack for this parm,
4582 count it in stack_args_size; otherwise set stack_parm to 0
4583 to indicate there is no preallocated stack slot for the parm. */
4585 if (entry_parm == stack_parm
4586 || (GET_CODE (entry_parm) == PARALLEL
4587 && XEXP (XVECEXP (entry_parm, 0, 0), 0) == NULL_RTX)
4588 #if defined (REG_PARM_STACK_SPACE) && ! defined (MAYBE_REG_PARM_STACK_SPACE)
4589 /* On some machines, even if a parm value arrives in a register
4590 there is still an (uninitialized) stack slot allocated for it.
4592 ??? When MAYBE_REG_PARM_STACK_SPACE is defined, we can't tell
4593 whether this parameter already has a stack slot allocated,
4594 because an arg block exists only if current_function_args_size
4595 is larger than some threshold, and we haven't calculated that
4596 yet. So, for now, we just assume that stack slots never exist
4598 || REG_PARM_STACK_SPACE (fndecl) > 0
4602 stack_args_size.constant += arg_size.constant;
4604 ADD_PARM_SIZE (stack_args_size, arg_size.var);
4607 /* No stack slot was pushed for this parm. */
4610 /* Update info on where next arg arrives in registers. */
4612 FUNCTION_ARG_ADVANCE (args_so_far, promoted_mode,
4613 passed_type, named_arg);
4615 /* If we can't trust the parm stack slot to be aligned enough
4616 for its ultimate type, don't use that slot after entry.
4617 We'll make another stack slot, if we need one. */
4619 unsigned int thisparm_boundary
4620 = FUNCTION_ARG_BOUNDARY (promoted_mode, passed_type);
4622 if (GET_MODE_ALIGNMENT (nominal_mode) > thisparm_boundary)
4626 /* If parm was passed in memory, and we need to convert it on entry,
4627 don't store it back in that same slot. */
4629 && nominal_mode != BLKmode && nominal_mode != passed_mode)
4632 /* When an argument is passed in multiple locations, we can't
4633 make use of this information, but we can save some copying if
4634 the whole argument is passed in a single register. */
4635 if (GET_CODE (entry_parm) == PARALLEL
4636 && nominal_mode != BLKmode && passed_mode != BLKmode)
4638 int i, len = XVECLEN (entry_parm, 0);
4640 for (i = 0; i < len; i++)
4641 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
4642 && GET_CODE (XEXP (XVECEXP (entry_parm, 0, i), 0)) == REG
4643 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
4645 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
4647 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
4648 DECL_INCOMING_RTL (parm) = entry_parm;
4653 /* ENTRY_PARM is an RTX for the parameter as it arrives,
4654 in the mode in which it arrives.
4655 STACK_PARM is an RTX for a stack slot where the parameter can live
4656 during the function (in case we want to put it there).
4657 STACK_PARM is 0 if no stack slot was pushed for it.
4659 Now output code if necessary to convert ENTRY_PARM to
4660 the type in which this function declares it,
4661 and store that result in an appropriate place,
4662 which may be a pseudo reg, may be STACK_PARM,
4663 or may be a local stack slot if STACK_PARM is 0.
4665 Set DECL_RTL to that place. */
4667 if (nominal_mode == BLKmode || GET_CODE (entry_parm) == PARALLEL)
4669 /* If a BLKmode arrives in registers, copy it to a stack slot.
4670 Handle calls that pass values in multiple non-contiguous
4671 locations. The Irix 6 ABI has examples of this. */
4672 if (GET_CODE (entry_parm) == REG
4673 || GET_CODE (entry_parm) == PARALLEL)
4676 = CEIL_ROUND (int_size_in_bytes (TREE_TYPE (parm)),
4679 /* Note that we will be storing an integral number of words.
4680 So we have to be careful to ensure that we allocate an
4681 integral number of words. We do this below in the
4682 assign_stack_local if space was not allocated in the argument
4683 list. If it was, this will not work if PARM_BOUNDARY is not
4684 a multiple of BITS_PER_WORD. It isn't clear how to fix this
4685 if it becomes a problem. */
4687 if (stack_parm == 0)
4690 = assign_stack_local (GET_MODE (entry_parm),
4692 set_mem_attributes (stack_parm, parm, 1);
4695 else if (PARM_BOUNDARY % BITS_PER_WORD != 0)
4698 /* Handle calls that pass values in multiple non-contiguous
4699 locations. The Irix 6 ABI has examples of this. */
4700 if (GET_CODE (entry_parm) == PARALLEL)
4701 emit_group_store (validize_mem (stack_parm), entry_parm,
4702 int_size_in_bytes (TREE_TYPE (parm)));
4704 move_block_from_reg (REGNO (entry_parm),
4705 validize_mem (stack_parm),
4706 size_stored / UNITS_PER_WORD,
4707 int_size_in_bytes (TREE_TYPE (parm)));
4709 SET_DECL_RTL (parm, stack_parm);
4711 else if (! ((! optimize
4712 && ! DECL_REGISTER (parm))
4713 || TREE_SIDE_EFFECTS (parm)
4714 /* If -ffloat-store specified, don't put explicit
4715 float variables into registers. */
4716 || (flag_float_store
4717 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))
4718 /* Always assign pseudo to structure return or item passed
4719 by invisible reference. */
4720 || passed_pointer || parm == function_result_decl)
4722 /* Store the parm in a pseudoregister during the function, but we
4723 may need to do it in a wider mode. */
4726 unsigned int regno, regnoi = 0, regnor = 0;
4728 unsignedp = TREE_UNSIGNED (TREE_TYPE (parm));
4730 promoted_nominal_mode
4731 = promote_mode (TREE_TYPE (parm), nominal_mode, &unsignedp, 0);
4733 parmreg = gen_reg_rtx (promoted_nominal_mode);
4734 mark_user_reg (parmreg);
4736 /* If this was an item that we received a pointer to, set DECL_RTL
4740 rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type)),
4742 set_mem_attributes (x, parm, 1);
4743 SET_DECL_RTL (parm, x);
4747 SET_DECL_RTL (parm, parmreg);
4748 maybe_set_unchanging (DECL_RTL (parm), parm);
4751 /* Copy the value into the register. */
4752 if (nominal_mode != passed_mode
4753 || promoted_nominal_mode != promoted_mode)
4756 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
4757 mode, by the caller. We now have to convert it to
4758 NOMINAL_MODE, if different. However, PARMREG may be in
4759 a different mode than NOMINAL_MODE if it is being stored
4762 If ENTRY_PARM is a hard register, it might be in a register
4763 not valid for operating in its mode (e.g., an odd-numbered
4764 register for a DFmode). In that case, moves are the only
4765 thing valid, so we can't do a convert from there. This
4766 occurs when the calling sequence allow such misaligned
4769 In addition, the conversion may involve a call, which could
4770 clobber parameters which haven't been copied to pseudo
4771 registers yet. Therefore, we must first copy the parm to
4772 a pseudo reg here, and save the conversion until after all
4773 parameters have been moved. */
4775 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
4777 emit_move_insn (tempreg, validize_mem (entry_parm));
4779 push_to_sequence (conversion_insns);
4780 tempreg = convert_to_mode (nominal_mode, tempreg, unsignedp);
4782 if (GET_CODE (tempreg) == SUBREG
4783 && GET_MODE (tempreg) == nominal_mode
4784 && GET_CODE (SUBREG_REG (tempreg)) == REG
4785 && nominal_mode == passed_mode
4786 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (entry_parm)
4787 && GET_MODE_SIZE (GET_MODE (tempreg))
4788 < GET_MODE_SIZE (GET_MODE (entry_parm)))
4790 /* The argument is already sign/zero extended, so note it
4792 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
4793 SUBREG_PROMOTED_UNSIGNED_SET (tempreg, unsignedp);
4796 /* TREE_USED gets set erroneously during expand_assignment. */
4797 save_tree_used = TREE_USED (parm);
4798 expand_assignment (parm,
4799 make_tree (nominal_type, tempreg), 0, 0);
4800 TREE_USED (parm) = save_tree_used;
4801 conversion_insns = get_insns ();
4806 emit_move_insn (parmreg, validize_mem (entry_parm));
4808 /* If we were passed a pointer but the actual value
4809 can safely live in a register, put it in one. */
4810 if (passed_pointer && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
4811 /* If by-reference argument was promoted, demote it. */
4812 && (TYPE_MODE (TREE_TYPE (parm)) != GET_MODE (DECL_RTL (parm))
4814 && ! DECL_REGISTER (parm))
4815 || TREE_SIDE_EFFECTS (parm)
4816 /* If -ffloat-store specified, don't put explicit
4817 float variables into registers. */
4818 || (flag_float_store
4819 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))))
4821 /* We can't use nominal_mode, because it will have been set to
4822 Pmode above. We must use the actual mode of the parm. */
4823 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
4824 mark_user_reg (parmreg);
4825 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
4827 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
4828 int unsigned_p = TREE_UNSIGNED (TREE_TYPE (parm));
4829 push_to_sequence (conversion_insns);
4830 emit_move_insn (tempreg, DECL_RTL (parm));
4832 convert_to_mode (GET_MODE (parmreg),
4835 emit_move_insn (parmreg, DECL_RTL (parm));
4836 conversion_insns = get_insns();
4841 emit_move_insn (parmreg, DECL_RTL (parm));
4842 SET_DECL_RTL (parm, parmreg);
4843 /* STACK_PARM is the pointer, not the parm, and PARMREG is
4847 #ifdef FUNCTION_ARG_CALLEE_COPIES
4848 /* If we are passed an arg by reference and it is our responsibility
4849 to make a copy, do it now.
4850 PASSED_TYPE and PASSED mode now refer to the pointer, not the
4851 original argument, so we must recreate them in the call to
4852 FUNCTION_ARG_CALLEE_COPIES. */
4853 /* ??? Later add code to handle the case that if the argument isn't
4854 modified, don't do the copy. */
4856 else if (passed_pointer
4857 && FUNCTION_ARG_CALLEE_COPIES (args_so_far,
4858 TYPE_MODE (DECL_ARG_TYPE (parm)),
4859 DECL_ARG_TYPE (parm),
4861 && ! TREE_ADDRESSABLE (DECL_ARG_TYPE (parm)))
4864 tree type = DECL_ARG_TYPE (parm);
4866 /* This sequence may involve a library call perhaps clobbering
4867 registers that haven't been copied to pseudos yet. */
4869 push_to_sequence (conversion_insns);
4871 if (!COMPLETE_TYPE_P (type)
4872 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4873 /* This is a variable sized object. */
4874 copy = gen_rtx_MEM (BLKmode,
4875 allocate_dynamic_stack_space
4876 (expr_size (parm), NULL_RTX,
4877 TYPE_ALIGN (type)));
4879 copy = assign_stack_temp (TYPE_MODE (type),
4880 int_size_in_bytes (type), 1);
4881 set_mem_attributes (copy, parm, 1);
4883 store_expr (parm, copy, 0);
4884 emit_move_insn (parmreg, XEXP (copy, 0));
4885 conversion_insns = get_insns ();
4889 #endif /* FUNCTION_ARG_CALLEE_COPIES */
4891 /* In any case, record the parm's desired stack location
4892 in case we later discover it must live in the stack.
4894 If it is a COMPLEX value, store the stack location for both
4897 if (GET_CODE (parmreg) == CONCAT)
4898 regno = MAX (REGNO (XEXP (parmreg, 0)), REGNO (XEXP (parmreg, 1)));
4900 regno = REGNO (parmreg);
4902 if (regno >= max_parm_reg)
4905 int old_max_parm_reg = max_parm_reg;
4907 /* It's slow to expand this one register at a time,
4908 but it's also rare and we need max_parm_reg to be
4909 precisely correct. */
4910 max_parm_reg = regno + 1;
4911 new = (rtx *) ggc_realloc (parm_reg_stack_loc,
4912 max_parm_reg * sizeof (rtx));
4913 memset ((char *) (new + old_max_parm_reg), 0,
4914 (max_parm_reg - old_max_parm_reg) * sizeof (rtx));
4915 parm_reg_stack_loc = new;
4918 if (GET_CODE (parmreg) == CONCAT)
4920 enum machine_mode submode = GET_MODE (XEXP (parmreg, 0));
4922 regnor = REGNO (gen_realpart (submode, parmreg));
4923 regnoi = REGNO (gen_imagpart (submode, parmreg));
4925 if (stack_parm != 0)
4927 parm_reg_stack_loc[regnor]
4928 = gen_realpart (submode, stack_parm);
4929 parm_reg_stack_loc[regnoi]
4930 = gen_imagpart (submode, stack_parm);
4934 parm_reg_stack_loc[regnor] = 0;
4935 parm_reg_stack_loc[regnoi] = 0;
4939 parm_reg_stack_loc[REGNO (parmreg)] = stack_parm;
4941 /* Mark the register as eliminable if we did no conversion
4942 and it was copied from memory at a fixed offset,
4943 and the arg pointer was not copied to a pseudo-reg.
4944 If the arg pointer is a pseudo reg or the offset formed
4945 an invalid address, such memory-equivalences
4946 as we make here would screw up life analysis for it. */
4947 if (nominal_mode == passed_mode
4950 && GET_CODE (stack_parm) == MEM
4951 && stack_offset.var == 0
4952 && reg_mentioned_p (virtual_incoming_args_rtx,
4953 XEXP (stack_parm, 0)))
4955 rtx linsn = get_last_insn ();
4958 /* Mark complex types separately. */
4959 if (GET_CODE (parmreg) == CONCAT)
4960 /* Scan backwards for the set of the real and
4962 for (sinsn = linsn; sinsn != 0;
4963 sinsn = prev_nonnote_insn (sinsn))
4965 set = single_set (sinsn);
4967 && SET_DEST (set) == regno_reg_rtx [regnoi])
4969 = gen_rtx_EXPR_LIST (REG_EQUIV,
4970 parm_reg_stack_loc[regnoi],
4973 && SET_DEST (set) == regno_reg_rtx [regnor])
4975 = gen_rtx_EXPR_LIST (REG_EQUIV,
4976 parm_reg_stack_loc[regnor],
4979 else if ((set = single_set (linsn)) != 0
4980 && SET_DEST (set) == parmreg)
4982 = gen_rtx_EXPR_LIST (REG_EQUIV,
4983 stack_parm, REG_NOTES (linsn));
4986 /* For pointer data type, suggest pointer register. */
4987 if (POINTER_TYPE_P (TREE_TYPE (parm)))
4988 mark_reg_pointer (parmreg,
4989 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
4991 /* If something wants our address, try to use ADDRESSOF. */
4992 if (TREE_ADDRESSABLE (parm))
4994 /* If we end up putting something into the stack,
4995 fixup_var_refs_insns will need to make a pass over
4996 all the instructions. It looks through the pending
4997 sequences -- but it can't see the ones in the
4998 CONVERSION_INSNS, if they're not on the sequence
4999 stack. So, we go back to that sequence, just so that
5000 the fixups will happen. */
5001 push_to_sequence (conversion_insns);
5002 put_var_into_stack (parm);
5003 conversion_insns = get_insns ();
5009 /* Value must be stored in the stack slot STACK_PARM
5010 during function execution. */
5012 if (promoted_mode != nominal_mode)
5014 /* Conversion is required. */
5015 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
5017 emit_move_insn (tempreg, validize_mem (entry_parm));
5019 push_to_sequence (conversion_insns);
5020 entry_parm = convert_to_mode (nominal_mode, tempreg,
5021 TREE_UNSIGNED (TREE_TYPE (parm)));
5023 /* ??? This may need a big-endian conversion on sparc64. */
5024 stack_parm = adjust_address (stack_parm, nominal_mode, 0);
5026 conversion_insns = get_insns ();
5031 if (entry_parm != stack_parm)
5033 if (stack_parm == 0)
5036 = assign_stack_local (GET_MODE (entry_parm),
5037 GET_MODE_SIZE (GET_MODE (entry_parm)), 0);
5038 set_mem_attributes (stack_parm, parm, 1);
5041 if (promoted_mode != nominal_mode)
5043 push_to_sequence (conversion_insns);
5044 emit_move_insn (validize_mem (stack_parm),
5045 validize_mem (entry_parm));
5046 conversion_insns = get_insns ();
5050 emit_move_insn (validize_mem (stack_parm),
5051 validize_mem (entry_parm));
5054 SET_DECL_RTL (parm, stack_parm);
5057 /* If this "parameter" was the place where we are receiving the
5058 function's incoming structure pointer, set up the result. */
5059 if (parm == function_result_decl)
5061 tree result = DECL_RESULT (fndecl);
5062 rtx addr = DECL_RTL (parm);
5065 #ifdef POINTERS_EXTEND_UNSIGNED
5066 if (GET_MODE (addr) != Pmode)
5067 addr = convert_memory_address (Pmode, addr);
5070 x = gen_rtx_MEM (DECL_MODE (result), addr);
5071 set_mem_attributes (x, result, 1);
5072 SET_DECL_RTL (result, x);
5075 if (GET_CODE (DECL_RTL (parm)) == REG)
5076 REGNO_DECL (REGNO (DECL_RTL (parm))) = parm;
5077 else if (GET_CODE (DECL_RTL (parm)) == CONCAT)
5079 REGNO_DECL (REGNO (XEXP (DECL_RTL (parm), 0))) = parm;
5080 REGNO_DECL (REGNO (XEXP (DECL_RTL (parm), 1))) = parm;
5085 /* Output all parameter conversion instructions (possibly including calls)
5086 now that all parameters have been copied out of hard registers. */
5087 emit_insns (conversion_insns);
5089 last_parm_insn = get_last_insn ();
5091 current_function_args_size = stack_args_size.constant;
5093 /* Adjust function incoming argument size for alignment and
5096 #ifdef REG_PARM_STACK_SPACE
5097 #ifndef MAYBE_REG_PARM_STACK_SPACE
5098 current_function_args_size = MAX (current_function_args_size,
5099 REG_PARM_STACK_SPACE (fndecl));
5103 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
5105 current_function_args_size
5106 = ((current_function_args_size + STACK_BYTES - 1)
5107 / STACK_BYTES) * STACK_BYTES;
5109 #ifdef ARGS_GROW_DOWNWARD
5110 current_function_arg_offset_rtx
5111 = (stack_args_size.var == 0 ? GEN_INT (-stack_args_size.constant)
5112 : expand_expr (size_diffop (stack_args_size.var,
5113 size_int (-stack_args_size.constant)),
5114 NULL_RTX, VOIDmode, 0));
5116 current_function_arg_offset_rtx = ARGS_SIZE_RTX (stack_args_size);
5119 /* See how many bytes, if any, of its args a function should try to pop
5122 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
5123 current_function_args_size);
5125 /* For stdarg.h function, save info about
5126 regs and stack space used by the named args. */
5129 current_function_args_info = args_so_far;
5131 /* Set the rtx used for the function return value. Put this in its
5132 own variable so any optimizers that need this information don't have
5133 to include tree.h. Do this here so it gets done when an inlined
5134 function gets output. */
5136 current_function_return_rtx
5137 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
5138 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
5140 /* If scalar return value was computed in a pseudo-reg, or was a named
5141 return value that got dumped to the stack, copy that to the hard
5143 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
5145 tree decl_result = DECL_RESULT (fndecl);
5146 rtx decl_rtl = DECL_RTL (decl_result);
5148 if (REG_P (decl_rtl)
5149 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
5150 : DECL_REGISTER (decl_result))
5154 #ifdef FUNCTION_OUTGOING_VALUE
5155 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
5158 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
5161 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
5162 /* The delay slot scheduler assumes that current_function_return_rtx
5163 holds the hard register containing the return value, not a
5164 temporary pseudo. */
5165 current_function_return_rtx = real_decl_rtl;
5170 /* Indicate whether REGNO is an incoming argument to the current function
5171 that was promoted to a wider mode. If so, return the RTX for the
5172 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
5173 that REGNO is promoted from and whether the promotion was signed or
5176 #ifdef PROMOTE_FUNCTION_ARGS
5179 promoted_input_arg (regno, pmode, punsignedp)
5181 enum machine_mode *pmode;
5186 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
5187 arg = TREE_CHAIN (arg))
5188 if (GET_CODE (DECL_INCOMING_RTL (arg)) == REG
5189 && REGNO (DECL_INCOMING_RTL (arg)) == regno
5190 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
5192 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
5193 int unsignedp = TREE_UNSIGNED (TREE_TYPE (arg));
5195 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
5196 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
5197 && mode != DECL_MODE (arg))
5199 *pmode = DECL_MODE (arg);
5200 *punsignedp = unsignedp;
5201 return DECL_INCOMING_RTL (arg);
5210 /* Compute the size and offset from the start of the stacked arguments for a
5211 parm passed in mode PASSED_MODE and with type TYPE.
5213 INITIAL_OFFSET_PTR points to the current offset into the stacked
5216 The starting offset and size for this parm are returned in *OFFSET_PTR
5217 and *ARG_SIZE_PTR, respectively.
5219 IN_REGS is non-zero if the argument will be passed in registers. It will
5220 never be set if REG_PARM_STACK_SPACE is not defined.
5222 FNDECL is the function in which the argument was defined.
5224 There are two types of rounding that are done. The first, controlled by
5225 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
5226 list to be aligned to the specific boundary (in bits). This rounding
5227 affects the initial and starting offsets, but not the argument size.
5229 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
5230 optionally rounds the size of the parm to PARM_BOUNDARY. The
5231 initial offset is not affected by this rounding, while the size always
5232 is and the starting offset may be. */
5234 /* offset_ptr will be negative for ARGS_GROW_DOWNWARD case;
5235 initial_offset_ptr is positive because locate_and_pad_parm's
5236 callers pass in the total size of args so far as
5237 initial_offset_ptr. arg_size_ptr is always positive. */
5240 locate_and_pad_parm (passed_mode, type, in_regs, fndecl,
5241 initial_offset_ptr, offset_ptr, arg_size_ptr,
5243 enum machine_mode passed_mode;
5245 int in_regs ATTRIBUTE_UNUSED;
5246 tree fndecl ATTRIBUTE_UNUSED;
5247 struct args_size *initial_offset_ptr;
5248 struct args_size *offset_ptr;
5249 struct args_size *arg_size_ptr;
5250 struct args_size *alignment_pad;
5254 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
5255 enum direction where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
5256 int boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
5258 #ifdef REG_PARM_STACK_SPACE
5259 /* If we have found a stack parm before we reach the end of the
5260 area reserved for registers, skip that area. */
5263 int reg_parm_stack_space = 0;
5265 #ifdef MAYBE_REG_PARM_STACK_SPACE
5266 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
5268 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
5270 if (reg_parm_stack_space > 0)
5272 if (initial_offset_ptr->var)
5274 initial_offset_ptr->var
5275 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
5276 ssize_int (reg_parm_stack_space));
5277 initial_offset_ptr->constant = 0;
5279 else if (initial_offset_ptr->constant < reg_parm_stack_space)
5280 initial_offset_ptr->constant = reg_parm_stack_space;
5283 #endif /* REG_PARM_STACK_SPACE */
5285 arg_size_ptr->var = 0;
5286 arg_size_ptr->constant = 0;
5287 alignment_pad->var = 0;
5288 alignment_pad->constant = 0;
5290 #ifdef ARGS_GROW_DOWNWARD
5291 if (initial_offset_ptr->var)
5293 offset_ptr->constant = 0;
5294 offset_ptr->var = size_binop (MINUS_EXPR, ssize_int (0),
5295 initial_offset_ptr->var);
5299 offset_ptr->constant = -initial_offset_ptr->constant;
5300 offset_ptr->var = 0;
5302 if (where_pad != none
5303 && (!host_integerp (sizetree, 1)
5304 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5305 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5306 SUB_PARM_SIZE (*offset_ptr, sizetree);
5307 if (where_pad != downward)
5308 pad_to_arg_alignment (offset_ptr, boundary, alignment_pad);
5309 if (initial_offset_ptr->var)
5310 arg_size_ptr->var = size_binop (MINUS_EXPR,
5311 size_binop (MINUS_EXPR,
5313 initial_offset_ptr->var),
5317 arg_size_ptr->constant = (-initial_offset_ptr->constant
5318 - offset_ptr->constant);
5320 #else /* !ARGS_GROW_DOWNWARD */
5322 #ifdef REG_PARM_STACK_SPACE
5323 || REG_PARM_STACK_SPACE (fndecl) > 0
5326 pad_to_arg_alignment (initial_offset_ptr, boundary, alignment_pad);
5327 *offset_ptr = *initial_offset_ptr;
5329 #ifdef PUSH_ROUNDING
5330 if (passed_mode != BLKmode)
5331 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
5334 /* Pad_below needs the pre-rounded size to know how much to pad below
5335 so this must be done before rounding up. */
5336 if (where_pad == downward
5337 /* However, BLKmode args passed in regs have their padding done elsewhere.
5338 The stack slot must be able to hold the entire register. */
5339 && !(in_regs && passed_mode == BLKmode))
5340 pad_below (offset_ptr, passed_mode, sizetree);
5342 if (where_pad != none
5343 && (!host_integerp (sizetree, 1)
5344 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5345 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5347 ADD_PARM_SIZE (*arg_size_ptr, sizetree);
5348 #endif /* ARGS_GROW_DOWNWARD */
5351 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
5352 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
5355 pad_to_arg_alignment (offset_ptr, boundary, alignment_pad)
5356 struct args_size *offset_ptr;
5358 struct args_size *alignment_pad;
5360 tree save_var = NULL_TREE;
5361 HOST_WIDE_INT save_constant = 0;
5363 int boundary_in_bytes = boundary / BITS_PER_UNIT;
5365 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5367 save_var = offset_ptr->var;
5368 save_constant = offset_ptr->constant;
5371 alignment_pad->var = NULL_TREE;
5372 alignment_pad->constant = 0;
5374 if (boundary > BITS_PER_UNIT)
5376 if (offset_ptr->var)
5379 #ifdef ARGS_GROW_DOWNWARD
5384 (ARGS_SIZE_TREE (*offset_ptr),
5385 boundary / BITS_PER_UNIT);
5386 offset_ptr->constant = 0; /*?*/
5387 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5388 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
5393 offset_ptr->constant =
5394 #ifdef ARGS_GROW_DOWNWARD
5395 FLOOR_ROUND (offset_ptr->constant, boundary_in_bytes);
5397 CEIL_ROUND (offset_ptr->constant, boundary_in_bytes);
5399 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5400 alignment_pad->constant = offset_ptr->constant - save_constant;
5405 #ifndef ARGS_GROW_DOWNWARD
5407 pad_below (offset_ptr, passed_mode, sizetree)
5408 struct args_size *offset_ptr;
5409 enum machine_mode passed_mode;
5412 if (passed_mode != BLKmode)
5414 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
5415 offset_ptr->constant
5416 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
5417 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
5418 - GET_MODE_SIZE (passed_mode));
5422 if (TREE_CODE (sizetree) != INTEGER_CST
5423 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
5425 /* Round the size up to multiple of PARM_BOUNDARY bits. */
5426 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5428 ADD_PARM_SIZE (*offset_ptr, s2);
5429 SUB_PARM_SIZE (*offset_ptr, sizetree);
5435 /* Walk the tree of blocks describing the binding levels within a function
5436 and warn about uninitialized variables.
5437 This is done after calling flow_analysis and before global_alloc
5438 clobbers the pseudo-regs to hard regs. */
5441 uninitialized_vars_warning (block)
5445 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5447 if (warn_uninitialized
5448 && TREE_CODE (decl) == VAR_DECL
5449 /* These warnings are unreliable for and aggregates
5450 because assigning the fields one by one can fail to convince
5451 flow.c that the entire aggregate was initialized.
5452 Unions are troublesome because members may be shorter. */
5453 && ! AGGREGATE_TYPE_P (TREE_TYPE (decl))
5454 && DECL_RTL (decl) != 0
5455 && GET_CODE (DECL_RTL (decl)) == REG
5456 /* Global optimizations can make it difficult to determine if a
5457 particular variable has been initialized. However, a VAR_DECL
5458 with a nonzero DECL_INITIAL had an initializer, so do not
5459 claim it is potentially uninitialized.
5461 We do not care about the actual value in DECL_INITIAL, so we do
5462 not worry that it may be a dangling pointer. */
5463 && DECL_INITIAL (decl) == NULL_TREE
5464 && regno_uninitialized (REGNO (DECL_RTL (decl))))
5465 warning_with_decl (decl,
5466 "`%s' might be used uninitialized in this function");
5468 && TREE_CODE (decl) == VAR_DECL
5469 && DECL_RTL (decl) != 0
5470 && GET_CODE (DECL_RTL (decl)) == REG
5471 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5472 warning_with_decl (decl,
5473 "variable `%s' might be clobbered by `longjmp' or `vfork'");
5475 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5476 uninitialized_vars_warning (sub);
5479 /* Do the appropriate part of uninitialized_vars_warning
5480 but for arguments instead of local variables. */
5483 setjmp_args_warning ()
5486 for (decl = DECL_ARGUMENTS (current_function_decl);
5487 decl; decl = TREE_CHAIN (decl))
5488 if (DECL_RTL (decl) != 0
5489 && GET_CODE (DECL_RTL (decl)) == REG
5490 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5491 warning_with_decl (decl,
5492 "argument `%s' might be clobbered by `longjmp' or `vfork'");
5495 /* If this function call setjmp, put all vars into the stack
5496 unless they were declared `register'. */
5499 setjmp_protect (block)
5503 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5504 if ((TREE_CODE (decl) == VAR_DECL
5505 || TREE_CODE (decl) == PARM_DECL)
5506 && DECL_RTL (decl) != 0
5507 && (GET_CODE (DECL_RTL (decl)) == REG
5508 || (GET_CODE (DECL_RTL (decl)) == MEM
5509 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5510 /* If this variable came from an inline function, it must be
5511 that its life doesn't overlap the setjmp. If there was a
5512 setjmp in the function, it would already be in memory. We
5513 must exclude such variable because their DECL_RTL might be
5514 set to strange things such as virtual_stack_vars_rtx. */
5515 && ! DECL_FROM_INLINE (decl)
5517 #ifdef NON_SAVING_SETJMP
5518 /* If longjmp doesn't restore the registers,
5519 don't put anything in them. */
5523 ! DECL_REGISTER (decl)))
5524 put_var_into_stack (decl);
5525 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5526 setjmp_protect (sub);
5529 /* Like the previous function, but for args instead of local variables. */
5532 setjmp_protect_args ()
5535 for (decl = DECL_ARGUMENTS (current_function_decl);
5536 decl; decl = TREE_CHAIN (decl))
5537 if ((TREE_CODE (decl) == VAR_DECL
5538 || TREE_CODE (decl) == PARM_DECL)
5539 && DECL_RTL (decl) != 0
5540 && (GET_CODE (DECL_RTL (decl)) == REG
5541 || (GET_CODE (DECL_RTL (decl)) == MEM
5542 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5544 /* If longjmp doesn't restore the registers,
5545 don't put anything in them. */
5546 #ifdef NON_SAVING_SETJMP
5550 ! DECL_REGISTER (decl)))
5551 put_var_into_stack (decl);
5554 /* Return the context-pointer register corresponding to DECL,
5555 or 0 if it does not need one. */
5558 lookup_static_chain (decl)
5561 tree context = decl_function_context (decl);
5565 || (TREE_CODE (decl) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (decl)))
5568 /* We treat inline_function_decl as an alias for the current function
5569 because that is the inline function whose vars, types, etc.
5570 are being merged into the current function.
5571 See expand_inline_function. */
5572 if (context == current_function_decl || context == inline_function_decl)
5573 return virtual_stack_vars_rtx;
5575 for (link = context_display; link; link = TREE_CHAIN (link))
5576 if (TREE_PURPOSE (link) == context)
5577 return RTL_EXPR_RTL (TREE_VALUE (link));
5582 /* Convert a stack slot address ADDR for variable VAR
5583 (from a containing function)
5584 into an address valid in this function (using a static chain). */
5587 fix_lexical_addr (addr, var)
5592 HOST_WIDE_INT displacement;
5593 tree context = decl_function_context (var);
5594 struct function *fp;
5597 /* If this is the present function, we need not do anything. */
5598 if (context == current_function_decl || context == inline_function_decl)
5601 fp = find_function_data (context);
5603 if (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == MEM)
5604 addr = XEXP (XEXP (addr, 0), 0);
5606 /* Decode given address as base reg plus displacement. */
5607 if (GET_CODE (addr) == REG)
5608 basereg = addr, displacement = 0;
5609 else if (GET_CODE (addr) == PLUS && GET_CODE (XEXP (addr, 1)) == CONST_INT)
5610 basereg = XEXP (addr, 0), displacement = INTVAL (XEXP (addr, 1));
5614 /* We accept vars reached via the containing function's
5615 incoming arg pointer and via its stack variables pointer. */
5616 if (basereg == fp->internal_arg_pointer)
5618 /* If reached via arg pointer, get the arg pointer value
5619 out of that function's stack frame.
5621 There are two cases: If a separate ap is needed, allocate a
5622 slot in the outer function for it and dereference it that way.
5623 This is correct even if the real ap is actually a pseudo.
5624 Otherwise, just adjust the offset from the frame pointer to
5627 #ifdef NEED_SEPARATE_AP
5630 addr = get_arg_pointer_save_area (fp);
5631 addr = fix_lexical_addr (XEXP (addr, 0), var);
5632 addr = memory_address (Pmode, addr);
5634 base = gen_rtx_MEM (Pmode, addr);
5635 set_mem_alias_set (base, get_frame_alias_set ());
5636 base = copy_to_reg (base);
5638 displacement += (FIRST_PARM_OFFSET (context) - STARTING_FRAME_OFFSET);
5639 base = lookup_static_chain (var);
5643 else if (basereg == virtual_stack_vars_rtx)
5645 /* This is the same code as lookup_static_chain, duplicated here to
5646 avoid an extra call to decl_function_context. */
5649 for (link = context_display; link; link = TREE_CHAIN (link))
5650 if (TREE_PURPOSE (link) == context)
5652 base = RTL_EXPR_RTL (TREE_VALUE (link));
5660 /* Use same offset, relative to appropriate static chain or argument
5662 return plus_constant (base, displacement);
5665 /* Return the address of the trampoline for entering nested fn FUNCTION.
5666 If necessary, allocate a trampoline (in the stack frame)
5667 and emit rtl to initialize its contents (at entry to this function). */
5670 trampoline_address (function)
5676 struct function *fp;
5679 /* Find an existing trampoline and return it. */
5680 for (link = trampoline_list; link; link = TREE_CHAIN (link))
5681 if (TREE_PURPOSE (link) == function)
5683 adjust_trampoline_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0));
5685 for (fp = outer_function_chain; fp; fp = fp->outer)
5686 for (link = fp->x_trampoline_list; link; link = TREE_CHAIN (link))
5687 if (TREE_PURPOSE (link) == function)
5689 tramp = fix_lexical_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0),
5691 return adjust_trampoline_addr (tramp);
5694 /* None exists; we must make one. */
5696 /* Find the `struct function' for the function containing FUNCTION. */
5698 fn_context = decl_function_context (function);
5699 if (fn_context != current_function_decl
5700 && fn_context != inline_function_decl)
5701 fp = find_function_data (fn_context);
5703 /* Allocate run-time space for this trampoline
5704 (usually in the defining function's stack frame). */
5705 #ifdef ALLOCATE_TRAMPOLINE
5706 tramp = ALLOCATE_TRAMPOLINE (fp);
5708 /* If rounding needed, allocate extra space
5709 to ensure we have TRAMPOLINE_SIZE bytes left after rounding up. */
5710 #ifdef TRAMPOLINE_ALIGNMENT
5711 #define TRAMPOLINE_REAL_SIZE \
5712 (TRAMPOLINE_SIZE + (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT) - 1)
5714 #define TRAMPOLINE_REAL_SIZE (TRAMPOLINE_SIZE)
5716 tramp = assign_stack_local_1 (BLKmode, TRAMPOLINE_REAL_SIZE, 0,
5720 /* Record the trampoline for reuse and note it for later initialization
5721 by expand_function_end. */
5724 rtlexp = make_node (RTL_EXPR);
5725 RTL_EXPR_RTL (rtlexp) = tramp;
5726 fp->x_trampoline_list = tree_cons (function, rtlexp,
5727 fp->x_trampoline_list);
5731 /* Make the RTL_EXPR node temporary, not momentary, so that the
5732 trampoline_list doesn't become garbage. */
5733 rtlexp = make_node (RTL_EXPR);
5735 RTL_EXPR_RTL (rtlexp) = tramp;
5736 trampoline_list = tree_cons (function, rtlexp, trampoline_list);
5739 tramp = fix_lexical_addr (XEXP (tramp, 0), function);
5740 return adjust_trampoline_addr (tramp);
5743 /* Given a trampoline address,
5744 round it to multiple of TRAMPOLINE_ALIGNMENT. */
5747 round_trampoline_addr (tramp)
5750 #ifdef TRAMPOLINE_ALIGNMENT
5751 /* Round address up to desired boundary. */
5752 rtx temp = gen_reg_rtx (Pmode);
5753 rtx addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
5754 rtx mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
5756 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
5757 temp, 0, OPTAB_LIB_WIDEN);
5758 tramp = expand_simple_binop (Pmode, AND, temp, mask,
5759 temp, 0, OPTAB_LIB_WIDEN);
5764 /* Given a trampoline address, round it then apply any
5765 platform-specific adjustments so that the result can be used for a
5769 adjust_trampoline_addr (tramp)
5772 tramp = round_trampoline_addr (tramp);
5773 #ifdef TRAMPOLINE_ADJUST_ADDRESS
5774 TRAMPOLINE_ADJUST_ADDRESS (tramp);
5779 /* Put all this function's BLOCK nodes including those that are chained
5780 onto the first block into a vector, and return it.
5781 Also store in each NOTE for the beginning or end of a block
5782 the index of that block in the vector.
5783 The arguments are BLOCK, the chain of top-level blocks of the function,
5784 and INSNS, the insn chain of the function. */
5790 tree *block_vector, *last_block_vector;
5792 tree block = DECL_INITIAL (current_function_decl);
5797 /* Fill the BLOCK_VECTOR with all of the BLOCKs in this function, in
5798 depth-first order. */
5799 block_vector = get_block_vector (block, &n_blocks);
5800 block_stack = (tree *) xmalloc (n_blocks * sizeof (tree));
5802 last_block_vector = identify_blocks_1 (get_insns (),
5804 block_vector + n_blocks,
5807 /* If we didn't use all of the subblocks, we've misplaced block notes. */
5808 /* ??? This appears to happen all the time. Latent bugs elsewhere? */
5809 if (0 && last_block_vector != block_vector + n_blocks)
5812 free (block_vector);
5816 /* Subroutine of identify_blocks. Do the block substitution on the
5817 insn chain beginning with INSNS. Recurse for CALL_PLACEHOLDER chains.
5819 BLOCK_STACK is pushed and popped for each BLOCK_BEGIN/BLOCK_END pair.
5820 BLOCK_VECTOR is incremented for each block seen. */
5823 identify_blocks_1 (insns, block_vector, end_block_vector, orig_block_stack)
5826 tree *end_block_vector;
5827 tree *orig_block_stack;
5830 tree *block_stack = orig_block_stack;
5832 for (insn = insns; insn; insn = NEXT_INSN (insn))
5834 if (GET_CODE (insn) == NOTE)
5836 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
5840 /* If there are more block notes than BLOCKs, something
5842 if (block_vector == end_block_vector)
5845 b = *block_vector++;
5846 NOTE_BLOCK (insn) = b;
5849 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
5851 /* If there are more NOTE_INSN_BLOCK_ENDs than
5852 NOTE_INSN_BLOCK_BEGs, something is badly wrong. */
5853 if (block_stack == orig_block_stack)
5856 NOTE_BLOCK (insn) = *--block_stack;
5859 else if (GET_CODE (insn) == CALL_INSN
5860 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
5862 rtx cp = PATTERN (insn);
5864 block_vector = identify_blocks_1 (XEXP (cp, 0), block_vector,
5865 end_block_vector, block_stack);
5867 block_vector = identify_blocks_1 (XEXP (cp, 1), block_vector,
5868 end_block_vector, block_stack);
5870 block_vector = identify_blocks_1 (XEXP (cp, 2), block_vector,
5871 end_block_vector, block_stack);
5875 /* If there are more NOTE_INSN_BLOCK_BEGINs than NOTE_INSN_BLOCK_ENDs,
5876 something is badly wrong. */
5877 if (block_stack != orig_block_stack)
5880 return block_vector;
5883 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
5884 and create duplicate blocks. */
5885 /* ??? Need an option to either create block fragments or to create
5886 abstract origin duplicates of a source block. It really depends
5887 on what optimization has been performed. */
5892 tree block = DECL_INITIAL (current_function_decl);
5893 varray_type block_stack;
5895 if (block == NULL_TREE)
5898 VARRAY_TREE_INIT (block_stack, 10, "block_stack");
5900 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
5901 reorder_blocks_0 (block);
5903 /* Prune the old trees away, so that they don't get in the way. */
5904 BLOCK_SUBBLOCKS (block) = NULL_TREE;
5905 BLOCK_CHAIN (block) = NULL_TREE;
5907 /* Recreate the block tree from the note nesting. */
5908 reorder_blocks_1 (get_insns (), block, &block_stack);
5909 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
5911 /* Remove deleted blocks from the block fragment chains. */
5912 reorder_fix_fragments (block);
5915 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
5918 reorder_blocks_0 (block)
5923 TREE_ASM_WRITTEN (block) = 0;
5924 reorder_blocks_0 (BLOCK_SUBBLOCKS (block));
5925 block = BLOCK_CHAIN (block);
5930 reorder_blocks_1 (insns, current_block, p_block_stack)
5933 varray_type *p_block_stack;
5937 for (insn = insns; insn; insn = NEXT_INSN (insn))
5939 if (GET_CODE (insn) == NOTE)
5941 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
5943 tree block = NOTE_BLOCK (insn);
5945 /* If we have seen this block before, that means it now
5946 spans multiple address regions. Create a new fragment. */
5947 if (TREE_ASM_WRITTEN (block))
5949 tree new_block = copy_node (block);
5952 origin = (BLOCK_FRAGMENT_ORIGIN (block)
5953 ? BLOCK_FRAGMENT_ORIGIN (block)
5955 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
5956 BLOCK_FRAGMENT_CHAIN (new_block)
5957 = BLOCK_FRAGMENT_CHAIN (origin);
5958 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
5960 NOTE_BLOCK (insn) = new_block;
5964 BLOCK_SUBBLOCKS (block) = 0;
5965 TREE_ASM_WRITTEN (block) = 1;
5966 BLOCK_SUPERCONTEXT (block) = current_block;
5967 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
5968 BLOCK_SUBBLOCKS (current_block) = block;
5969 current_block = block;
5970 VARRAY_PUSH_TREE (*p_block_stack, block);
5972 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
5974 NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack);
5975 VARRAY_POP (*p_block_stack);
5976 BLOCK_SUBBLOCKS (current_block)
5977 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
5978 current_block = BLOCK_SUPERCONTEXT (current_block);
5981 else if (GET_CODE (insn) == CALL_INSN
5982 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
5984 rtx cp = PATTERN (insn);
5985 reorder_blocks_1 (XEXP (cp, 0), current_block, p_block_stack);
5987 reorder_blocks_1 (XEXP (cp, 1), current_block, p_block_stack);
5989 reorder_blocks_1 (XEXP (cp, 2), current_block, p_block_stack);
5994 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
5995 appears in the block tree, select one of the fragments to become
5996 the new origin block. */
5999 reorder_fix_fragments (block)
6004 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
6005 tree new_origin = NULL_TREE;
6009 if (! TREE_ASM_WRITTEN (dup_origin))
6011 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
6013 /* Find the first of the remaining fragments. There must
6014 be at least one -- the current block. */
6015 while (! TREE_ASM_WRITTEN (new_origin))
6016 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
6017 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
6020 else if (! dup_origin)
6023 /* Re-root the rest of the fragments to the new origin. In the
6024 case that DUP_ORIGIN was null, that means BLOCK was the origin
6025 of a chain of fragments and we want to remove those fragments
6026 that didn't make it to the output. */
6029 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
6034 if (TREE_ASM_WRITTEN (chain))
6036 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
6038 pp = &BLOCK_FRAGMENT_CHAIN (chain);
6040 chain = BLOCK_FRAGMENT_CHAIN (chain);
6045 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
6046 block = BLOCK_CHAIN (block);
6050 /* Reverse the order of elements in the chain T of blocks,
6051 and return the new head of the chain (old last element). */
6057 tree prev = 0, decl, next;
6058 for (decl = t; decl; decl = next)
6060 next = BLOCK_CHAIN (decl);
6061 BLOCK_CHAIN (decl) = prev;
6067 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
6068 non-NULL, list them all into VECTOR, in a depth-first preorder
6069 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
6073 all_blocks (block, vector)
6081 TREE_ASM_WRITTEN (block) = 0;
6083 /* Record this block. */
6085 vector[n_blocks] = block;
6089 /* Record the subblocks, and their subblocks... */
6090 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
6091 vector ? vector + n_blocks : 0);
6092 block = BLOCK_CHAIN (block);
6098 /* Return a vector containing all the blocks rooted at BLOCK. The
6099 number of elements in the vector is stored in N_BLOCKS_P. The
6100 vector is dynamically allocated; it is the caller's responsibility
6101 to call `free' on the pointer returned. */
6104 get_block_vector (block, n_blocks_p)
6110 *n_blocks_p = all_blocks (block, NULL);
6111 block_vector = (tree *) xmalloc (*n_blocks_p * sizeof (tree));
6112 all_blocks (block, block_vector);
6114 return block_vector;
6117 static int next_block_index = 2;
6119 /* Set BLOCK_NUMBER for all the blocks in FN. */
6129 /* For SDB and XCOFF debugging output, we start numbering the blocks
6130 from 1 within each function, rather than keeping a running
6132 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
6133 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
6134 next_block_index = 1;
6137 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
6139 /* The top-level BLOCK isn't numbered at all. */
6140 for (i = 1; i < n_blocks; ++i)
6141 /* We number the blocks from two. */
6142 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
6144 free (block_vector);
6149 /* If VAR is present in a subblock of BLOCK, return the subblock. */
6152 debug_find_var_in_block_tree (var, block)
6158 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
6162 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
6164 tree ret = debug_find_var_in_block_tree (var, t);
6172 /* Allocate a function structure and reset its contents to the defaults. */
6175 prepare_function_start ()
6177 cfun = (struct function *) ggc_alloc_cleared (sizeof (struct function));
6179 init_stmt_for_function ();
6180 init_eh_for_function ();
6182 cse_not_expected = ! optimize;
6184 /* Caller save not needed yet. */
6185 caller_save_needed = 0;
6187 /* No stack slots have been made yet. */
6188 stack_slot_list = 0;
6190 current_function_has_nonlocal_label = 0;
6191 current_function_has_nonlocal_goto = 0;
6193 /* There is no stack slot for handling nonlocal gotos. */
6194 nonlocal_goto_handler_slots = 0;
6195 nonlocal_goto_stack_level = 0;
6197 /* No labels have been declared for nonlocal use. */
6198 nonlocal_labels = 0;
6199 nonlocal_goto_handler_labels = 0;
6201 /* No function calls so far in this function. */
6202 function_call_count = 0;
6204 /* No parm regs have been allocated.
6205 (This is important for output_inline_function.) */
6206 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
6208 /* Initialize the RTL mechanism. */
6211 /* Initialize the queue of pending postincrement and postdecrements,
6212 and some other info in expr.c. */
6215 /* We haven't done register allocation yet. */
6218 init_varasm_status (cfun);
6220 /* Clear out data used for inlining. */
6221 cfun->inlinable = 0;
6222 cfun->original_decl_initial = 0;
6223 cfun->original_arg_vector = 0;
6225 cfun->stack_alignment_needed = STACK_BOUNDARY;
6226 cfun->preferred_stack_boundary = STACK_BOUNDARY;
6228 /* Set if a call to setjmp is seen. */
6229 current_function_calls_setjmp = 0;
6231 /* Set if a call to longjmp is seen. */
6232 current_function_calls_longjmp = 0;
6234 current_function_calls_alloca = 0;
6235 current_function_contains_functions = 0;
6236 current_function_is_leaf = 0;
6237 current_function_nothrow = 0;
6238 current_function_sp_is_unchanging = 0;
6239 current_function_uses_only_leaf_regs = 0;
6240 current_function_has_computed_jump = 0;
6241 current_function_is_thunk = 0;
6243 current_function_returns_pcc_struct = 0;
6244 current_function_returns_struct = 0;
6245 current_function_epilogue_delay_list = 0;
6246 current_function_uses_const_pool = 0;
6247 current_function_uses_pic_offset_table = 0;
6248 current_function_cannot_inline = 0;
6250 /* We have not yet needed to make a label to jump to for tail-recursion. */
6251 tail_recursion_label = 0;
6253 /* We haven't had a need to make a save area for ap yet. */
6254 arg_pointer_save_area = 0;
6256 /* No stack slots allocated yet. */
6259 /* No SAVE_EXPRs in this function yet. */
6262 /* No RTL_EXPRs in this function yet. */
6265 /* Set up to allocate temporaries. */
6268 /* Indicate that we need to distinguish between the return value of the
6269 present function and the return value of a function being called. */
6270 rtx_equal_function_value_matters = 1;
6272 /* Indicate that we have not instantiated virtual registers yet. */
6273 virtuals_instantiated = 0;
6275 /* Indicate that we want CONCATs now. */
6276 generating_concat_p = 1;
6278 /* Indicate we have no need of a frame pointer yet. */
6279 frame_pointer_needed = 0;
6281 /* By default assume not varargs or stdarg. */
6282 current_function_varargs = 0;
6283 current_function_stdarg = 0;
6285 /* We haven't made any trampolines for this function yet. */
6286 trampoline_list = 0;
6288 init_pending_stack_adjust ();
6289 inhibit_defer_pop = 0;
6291 current_function_outgoing_args_size = 0;
6293 cfun->arc_profile = profile_arc_flag || flag_test_coverage;
6295 cfun->arc_profile = profile_arc_flag || flag_test_coverage;
6297 cfun->function_frequency = FUNCTION_FREQUENCY_NORMAL;
6299 (*lang_hooks.function.init) (cfun);
6300 if (init_machine_status)
6301 cfun->machine = (*init_machine_status) ();
6304 /* Initialize the rtl expansion mechanism so that we can do simple things
6305 like generate sequences. This is used to provide a context during global
6306 initialization of some passes. */
6308 init_dummy_function_start ()
6310 prepare_function_start ();
6313 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
6314 and initialize static variables for generating RTL for the statements
6318 init_function_start (subr, filename, line)
6320 const char *filename;
6323 prepare_function_start ();
6325 current_function_name = (*lang_hooks.decl_printable_name) (subr, 2);
6328 /* Nonzero if this is a nested function that uses a static chain. */
6330 current_function_needs_context
6331 = (decl_function_context (current_function_decl) != 0
6332 && ! DECL_NO_STATIC_CHAIN (current_function_decl));
6334 /* Within function body, compute a type's size as soon it is laid out. */
6335 immediate_size_expand++;
6337 /* Prevent ever trying to delete the first instruction of a function.
6338 Also tell final how to output a linenum before the function prologue.
6339 Note linenums could be missing, e.g. when compiling a Java .class file. */
6341 emit_line_note (filename, line);
6343 /* Make sure first insn is a note even if we don't want linenums.
6344 This makes sure the first insn will never be deleted.
6345 Also, final expects a note to appear there. */
6346 emit_note (NULL, NOTE_INSN_DELETED);
6348 /* Set flags used by final.c. */
6349 if (aggregate_value_p (DECL_RESULT (subr)))
6351 #ifdef PCC_STATIC_STRUCT_RETURN
6352 current_function_returns_pcc_struct = 1;
6354 current_function_returns_struct = 1;
6357 /* Warn if this value is an aggregate type,
6358 regardless of which calling convention we are using for it. */
6359 if (warn_aggregate_return
6360 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
6361 warning ("function returns an aggregate");
6363 current_function_returns_pointer
6364 = POINTER_TYPE_P (TREE_TYPE (DECL_RESULT (subr)));
6367 /* Make sure all values used by the optimization passes have sane
6370 init_function_for_compilation ()
6374 /* No prologue/epilogue insns yet. */
6375 VARRAY_GROW (prologue, 0);
6376 VARRAY_GROW (epilogue, 0);
6377 VARRAY_GROW (sibcall_epilogue, 0);
6380 /* Indicate that the current function uses extra args
6381 not explicitly mentioned in the argument list in any fashion. */
6386 current_function_varargs = 1;
6389 /* Expand a call to __main at the beginning of a possible main function. */
6391 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
6392 #undef HAS_INIT_SECTION
6393 #define HAS_INIT_SECTION
6397 expand_main_function ()
6399 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
6400 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
6402 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
6406 /* Forcibly align the stack. */
6407 #ifdef STACK_GROWS_DOWNWARD
6408 tmp = expand_simple_binop (Pmode, AND, stack_pointer_rtx, GEN_INT(-align),
6409 stack_pointer_rtx, 1, OPTAB_WIDEN);
6411 tmp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
6412 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
6413 tmp = expand_simple_binop (Pmode, AND, tmp, GEN_INT (-align),
6414 stack_pointer_rtx, 1, OPTAB_WIDEN);
6416 if (tmp != stack_pointer_rtx)
6417 emit_move_insn (stack_pointer_rtx, tmp);
6419 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
6420 tmp = force_reg (Pmode, const0_rtx);
6421 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
6422 seq = gen_sequence ();
6425 for (tmp = get_last_insn (); tmp; tmp = PREV_INSN (tmp))
6426 if (NOTE_P (tmp) && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_FUNCTION_BEG)
6429 emit_insn_before (seq, tmp);
6435 #ifndef HAS_INIT_SECTION
6436 emit_library_call (gen_rtx_SYMBOL_REF (Pmode, NAME__MAIN), LCT_NORMAL,
6441 extern struct obstack permanent_obstack;
6443 /* The PENDING_SIZES represent the sizes of variable-sized types.
6444 Create RTL for the various sizes now (using temporary variables),
6445 so that we can refer to the sizes from the RTL we are generating
6446 for the current function. The PENDING_SIZES are a TREE_LIST. The
6447 TREE_VALUE of each node is a SAVE_EXPR. */
6450 expand_pending_sizes (pending_sizes)
6455 /* Evaluate now the sizes of any types declared among the arguments. */
6456 for (tem = pending_sizes; tem; tem = TREE_CHAIN (tem))
6458 expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode, 0);
6459 /* Flush the queue in case this parameter declaration has
6465 /* Start the RTL for a new function, and set variables used for
6467 SUBR is the FUNCTION_DECL node.
6468 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
6469 the function's parameters, which must be run at any return statement. */
6472 expand_function_start (subr, parms_have_cleanups)
6474 int parms_have_cleanups;
6477 rtx last_ptr = NULL_RTX;
6479 /* Make sure volatile mem refs aren't considered
6480 valid operands of arithmetic insns. */
6481 init_recog_no_volatile ();
6483 current_function_instrument_entry_exit
6484 = (flag_instrument_function_entry_exit
6485 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
6487 current_function_profile
6489 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
6491 current_function_limit_stack
6492 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
6494 /* If function gets a static chain arg, store it in the stack frame.
6495 Do this first, so it gets the first stack slot offset. */
6496 if (current_function_needs_context)
6498 last_ptr = assign_stack_local (Pmode, GET_MODE_SIZE (Pmode), 0);
6500 /* Delay copying static chain if it is not a register to avoid
6501 conflicts with regs used for parameters. */
6502 if (! SMALL_REGISTER_CLASSES
6503 || GET_CODE (static_chain_incoming_rtx) == REG)
6504 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6507 /* If the parameters of this function need cleaning up, get a label
6508 for the beginning of the code which executes those cleanups. This must
6509 be done before doing anything with return_label. */
6510 if (parms_have_cleanups)
6511 cleanup_label = gen_label_rtx ();
6515 /* Make the label for return statements to jump to. Do not special
6516 case machines with special return instructions -- they will be
6517 handled later during jump, ifcvt, or epilogue creation. */
6518 return_label = gen_label_rtx ();
6520 /* Initialize rtx used to return the value. */
6521 /* Do this before assign_parms so that we copy the struct value address
6522 before any library calls that assign parms might generate. */
6524 /* Decide whether to return the value in memory or in a register. */
6525 if (aggregate_value_p (DECL_RESULT (subr)))
6527 /* Returning something that won't go in a register. */
6528 rtx value_address = 0;
6530 #ifdef PCC_STATIC_STRUCT_RETURN
6531 if (current_function_returns_pcc_struct)
6533 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
6534 value_address = assemble_static_space (size);
6539 /* Expect to be passed the address of a place to store the value.
6540 If it is passed as an argument, assign_parms will take care of
6542 if (struct_value_incoming_rtx)
6544 value_address = gen_reg_rtx (Pmode);
6545 emit_move_insn (value_address, struct_value_incoming_rtx);
6550 rtx x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), value_address);
6551 set_mem_attributes (x, DECL_RESULT (subr), 1);
6552 SET_DECL_RTL (DECL_RESULT (subr), x);
6555 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
6556 /* If return mode is void, this decl rtl should not be used. */
6557 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
6560 /* Compute the return values into a pseudo reg, which we will copy
6561 into the true return register after the cleanups are done. */
6563 /* In order to figure out what mode to use for the pseudo, we
6564 figure out what the mode of the eventual return register will
6565 actually be, and use that. */
6567 = hard_function_value (TREE_TYPE (DECL_RESULT (subr)),
6570 /* Structures that are returned in registers are not aggregate_value_p,
6571 so we may see a PARALLEL. Don't play pseudo games with this. */
6572 if (! REG_P (hard_reg))
6573 SET_DECL_RTL (DECL_RESULT (subr), hard_reg);
6576 /* Create the pseudo. */
6577 SET_DECL_RTL (DECL_RESULT (subr), gen_reg_rtx (GET_MODE (hard_reg)));
6579 /* Needed because we may need to move this to memory
6580 in case it's a named return value whose address is taken. */
6581 DECL_REGISTER (DECL_RESULT (subr)) = 1;
6585 /* Initialize rtx for parameters and local variables.
6586 In some cases this requires emitting insns. */
6588 assign_parms (subr);
6590 /* Copy the static chain now if it wasn't a register. The delay is to
6591 avoid conflicts with the parameter passing registers. */
6593 if (SMALL_REGISTER_CLASSES && current_function_needs_context)
6594 if (GET_CODE (static_chain_incoming_rtx) != REG)
6595 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6597 /* The following was moved from init_function_start.
6598 The move is supposed to make sdb output more accurate. */
6599 /* Indicate the beginning of the function body,
6600 as opposed to parm setup. */
6601 emit_note (NULL, NOTE_INSN_FUNCTION_BEG);
6603 if (GET_CODE (get_last_insn ()) != NOTE)
6604 emit_note (NULL, NOTE_INSN_DELETED);
6605 parm_birth_insn = get_last_insn ();
6607 context_display = 0;
6608 if (current_function_needs_context)
6610 /* Fetch static chain values for containing functions. */
6611 tem = decl_function_context (current_function_decl);
6612 /* Copy the static chain pointer into a pseudo. If we have
6613 small register classes, copy the value from memory if
6614 static_chain_incoming_rtx is a REG. */
6617 /* If the static chain originally came in a register, put it back
6618 there, then move it out in the next insn. The reason for
6619 this peculiar code is to satisfy function integration. */
6620 if (SMALL_REGISTER_CLASSES
6621 && GET_CODE (static_chain_incoming_rtx) == REG)
6622 emit_move_insn (static_chain_incoming_rtx, last_ptr);
6623 last_ptr = copy_to_reg (static_chain_incoming_rtx);
6628 tree rtlexp = make_node (RTL_EXPR);
6630 RTL_EXPR_RTL (rtlexp) = last_ptr;
6631 context_display = tree_cons (tem, rtlexp, context_display);
6632 tem = decl_function_context (tem);
6635 /* Chain thru stack frames, assuming pointer to next lexical frame
6636 is found at the place we always store it. */
6637 #ifdef FRAME_GROWS_DOWNWARD
6638 last_ptr = plus_constant (last_ptr,
6639 -(HOST_WIDE_INT) GET_MODE_SIZE (Pmode));
6641 last_ptr = gen_rtx_MEM (Pmode, memory_address (Pmode, last_ptr));
6642 set_mem_alias_set (last_ptr, get_frame_alias_set ());
6643 last_ptr = copy_to_reg (last_ptr);
6645 /* If we are not optimizing, ensure that we know that this
6646 piece of context is live over the entire function. */
6648 save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, last_ptr,
6653 if (current_function_instrument_entry_exit)
6655 rtx fun = DECL_RTL (current_function_decl);
6656 if (GET_CODE (fun) == MEM)
6657 fun = XEXP (fun, 0);
6660 emit_library_call (profile_function_entry_libfunc, LCT_NORMAL, VOIDmode,
6662 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
6664 hard_frame_pointer_rtx),
6668 if (current_function_profile)
6670 current_function_profile_label_no = profile_label_no++;
6672 PROFILE_HOOK (current_function_profile_label_no);
6676 /* After the display initializations is where the tail-recursion label
6677 should go, if we end up needing one. Ensure we have a NOTE here
6678 since some things (like trampolines) get placed before this. */
6679 tail_recursion_reentry = emit_note (NULL, NOTE_INSN_DELETED);
6681 /* Evaluate now the sizes of any types declared among the arguments. */
6682 expand_pending_sizes (nreverse (get_pending_sizes ()));
6684 /* Make sure there is a line number after the function entry setup code. */
6685 force_next_line_note ();
6688 /* Undo the effects of init_dummy_function_start. */
6690 expand_dummy_function_end ()
6692 /* End any sequences that failed to be closed due to syntax errors. */
6693 while (in_sequence_p ())
6696 /* Outside function body, can't compute type's actual size
6697 until next function's body starts. */
6699 free_after_parsing (cfun);
6700 free_after_compilation (cfun);
6704 /* Call DOIT for each hard register used as a return value from
6705 the current function. */
6708 diddle_return_value (doit, arg)
6709 void (*doit) PARAMS ((rtx, void *));
6712 rtx outgoing = current_function_return_rtx;
6717 if (GET_CODE (outgoing) == REG)
6718 (*doit) (outgoing, arg);
6719 else if (GET_CODE (outgoing) == PARALLEL)
6723 for (i = 0; i < XVECLEN (outgoing, 0); i++)
6725 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
6727 if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
6734 do_clobber_return_reg (reg, arg)
6736 void *arg ATTRIBUTE_UNUSED;
6738 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
6742 clobber_return_register ()
6744 diddle_return_value (do_clobber_return_reg, NULL);
6746 /* In case we do use pseudo to return value, clobber it too. */
6747 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6749 tree decl_result = DECL_RESULT (current_function_decl);
6750 rtx decl_rtl = DECL_RTL (decl_result);
6751 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
6753 do_clobber_return_reg (decl_rtl, NULL);
6759 do_use_return_reg (reg, arg)
6761 void *arg ATTRIBUTE_UNUSED;
6763 emit_insn (gen_rtx_USE (VOIDmode, reg));
6767 use_return_register ()
6769 diddle_return_value (do_use_return_reg, NULL);
6772 static GTY(()) rtx initial_trampoline;
6774 /* Generate RTL for the end of the current function.
6775 FILENAME and LINE are the current position in the source file.
6777 It is up to language-specific callers to do cleanups for parameters--
6778 or else, supply 1 for END_BINDINGS and we will call expand_end_bindings. */
6781 expand_function_end (filename, line, end_bindings)
6782 const char *filename;
6789 finish_expr_for_function ();
6791 /* If arg_pointer_save_area was referenced only from a nested
6792 function, we will not have initialized it yet. Do that now. */
6793 if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
6794 get_arg_pointer_save_area (cfun);
6796 #ifdef NON_SAVING_SETJMP
6797 /* Don't put any variables in registers if we call setjmp
6798 on a machine that fails to restore the registers. */
6799 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
6801 if (DECL_INITIAL (current_function_decl) != error_mark_node)
6802 setjmp_protect (DECL_INITIAL (current_function_decl));
6804 setjmp_protect_args ();
6808 /* Initialize any trampolines required by this function. */
6809 for (link = trampoline_list; link; link = TREE_CHAIN (link))
6811 tree function = TREE_PURPOSE (link);
6812 rtx context ATTRIBUTE_UNUSED = lookup_static_chain (function);
6813 rtx tramp = RTL_EXPR_RTL (TREE_VALUE (link));
6814 #ifdef TRAMPOLINE_TEMPLATE
6819 #ifdef TRAMPOLINE_TEMPLATE
6820 /* First make sure this compilation has a template for
6821 initializing trampolines. */
6822 if (initial_trampoline == 0)
6825 = gen_rtx_MEM (BLKmode, assemble_trampoline_template ());
6826 set_mem_align (initial_trampoline, TRAMPOLINE_ALIGNMENT);
6830 /* Generate insns to initialize the trampoline. */
6832 tramp = round_trampoline_addr (XEXP (tramp, 0));
6833 #ifdef TRAMPOLINE_TEMPLATE
6834 blktramp = replace_equiv_address (initial_trampoline, tramp);
6835 emit_block_move (blktramp, initial_trampoline,
6836 GEN_INT (TRAMPOLINE_SIZE));
6838 INITIALIZE_TRAMPOLINE (tramp, XEXP (DECL_RTL (function), 0), context);
6842 /* Put those insns at entry to the containing function (this one). */
6843 emit_insns_before (seq, tail_recursion_reentry);
6846 /* If we are doing stack checking and this function makes calls,
6847 do a stack probe at the start of the function to ensure we have enough
6848 space for another stack frame. */
6849 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
6853 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
6854 if (GET_CODE (insn) == CALL_INSN)
6857 probe_stack_range (STACK_CHECK_PROTECT,
6858 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
6861 emit_insns_before (seq, tail_recursion_reentry);
6866 /* Warn about unused parms if extra warnings were specified. */
6867 /* Either ``-W -Wunused'' or ``-Wunused-parameter'' enables this
6868 warning. WARN_UNUSED_PARAMETER is negative when set by
6870 if (warn_unused_parameter > 0
6871 || (warn_unused_parameter < 0 && extra_warnings))
6875 for (decl = DECL_ARGUMENTS (current_function_decl);
6876 decl; decl = TREE_CHAIN (decl))
6877 if (! TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
6878 && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl))
6879 warning_with_decl (decl, "unused parameter `%s'");
6882 /* Delete handlers for nonlocal gotos if nothing uses them. */
6883 if (nonlocal_goto_handler_slots != 0
6884 && ! current_function_has_nonlocal_label)
6887 /* End any sequences that failed to be closed due to syntax errors. */
6888 while (in_sequence_p ())
6891 /* Outside function body, can't compute type's actual size
6892 until next function's body starts. */
6893 immediate_size_expand--;
6895 clear_pending_stack_adjust ();
6896 do_pending_stack_adjust ();
6898 /* Mark the end of the function body.
6899 If control reaches this insn, the function can drop through
6900 without returning a value. */
6901 emit_note (NULL, NOTE_INSN_FUNCTION_END);
6903 /* Must mark the last line number note in the function, so that the test
6904 coverage code can avoid counting the last line twice. This just tells
6905 the code to ignore the immediately following line note, since there
6906 already exists a copy of this note somewhere above. This line number
6907 note is still needed for debugging though, so we can't delete it. */
6908 if (flag_test_coverage)
6909 emit_note (NULL, NOTE_INSN_REPEATED_LINE_NUMBER);
6911 /* Output a linenumber for the end of the function.
6912 SDB depends on this. */
6913 emit_line_note_force (filename, line);
6915 /* Before the return label (if any), clobber the return
6916 registers so that they are not propagated live to the rest of
6917 the function. This can only happen with functions that drop
6918 through; if there had been a return statement, there would
6919 have either been a return rtx, or a jump to the return label.
6921 We delay actual code generation after the current_function_value_rtx
6923 clobber_after = get_last_insn ();
6925 /* Output the label for the actual return from the function,
6926 if one is expected. This happens either because a function epilogue
6927 is used instead of a return instruction, or because a return was done
6928 with a goto in order to run local cleanups, or because of pcc-style
6929 structure returning. */
6931 emit_label (return_label);
6933 /* C++ uses this. */
6935 expand_end_bindings (0, 0, 0);
6937 if (current_function_instrument_entry_exit)
6939 rtx fun = DECL_RTL (current_function_decl);
6940 if (GET_CODE (fun) == MEM)
6941 fun = XEXP (fun, 0);
6944 emit_library_call (profile_function_exit_libfunc, LCT_NORMAL, VOIDmode,
6946 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
6948 hard_frame_pointer_rtx),
6952 /* Let except.c know where it should emit the call to unregister
6953 the function context for sjlj exceptions. */
6954 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
6955 sjlj_emit_function_exit_after (get_last_insn ());
6957 /* If we had calls to alloca, and this machine needs
6958 an accurate stack pointer to exit the function,
6959 insert some code to save and restore the stack pointer. */
6960 #ifdef EXIT_IGNORE_STACK
6961 if (! EXIT_IGNORE_STACK)
6963 if (current_function_calls_alloca)
6967 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
6968 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
6971 /* If scalar return value was computed in a pseudo-reg, or was a named
6972 return value that got dumped to the stack, copy that to the hard
6974 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6976 tree decl_result = DECL_RESULT (current_function_decl);
6977 rtx decl_rtl = DECL_RTL (decl_result);
6979 if (REG_P (decl_rtl)
6980 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
6981 : DECL_REGISTER (decl_result))
6983 rtx real_decl_rtl = current_function_return_rtx;
6985 /* This should be set in assign_parms. */
6986 if (! REG_FUNCTION_VALUE_P (real_decl_rtl))
6989 /* If this is a BLKmode structure being returned in registers,
6990 then use the mode computed in expand_return. Note that if
6991 decl_rtl is memory, then its mode may have been changed,
6992 but that current_function_return_rtx has not. */
6993 if (GET_MODE (real_decl_rtl) == BLKmode)
6994 PUT_MODE (real_decl_rtl, GET_MODE (decl_rtl));
6996 /* If a named return value dumped decl_return to memory, then
6997 we may need to re-do the PROMOTE_MODE signed/unsigned
6999 if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
7001 int unsignedp = TREE_UNSIGNED (TREE_TYPE (decl_result));
7003 #ifdef PROMOTE_FUNCTION_RETURN
7004 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
7008 convert_move (real_decl_rtl, decl_rtl, unsignedp);
7010 else if (GET_CODE (real_decl_rtl) == PARALLEL)
7011 emit_group_load (real_decl_rtl, decl_rtl,
7012 int_size_in_bytes (TREE_TYPE (decl_result)));
7014 emit_move_insn (real_decl_rtl, decl_rtl);
7018 /* If returning a structure, arrange to return the address of the value
7019 in a place where debuggers expect to find it.
7021 If returning a structure PCC style,
7022 the caller also depends on this value.
7023 And current_function_returns_pcc_struct is not necessarily set. */
7024 if (current_function_returns_struct
7025 || current_function_returns_pcc_struct)
7028 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
7029 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
7030 #ifdef FUNCTION_OUTGOING_VALUE
7032 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
7033 current_function_decl);
7036 = FUNCTION_VALUE (build_pointer_type (type), current_function_decl);
7039 /* Mark this as a function return value so integrate will delete the
7040 assignment and USE below when inlining this function. */
7041 REG_FUNCTION_VALUE_P (outgoing) = 1;
7043 #ifdef POINTERS_EXTEND_UNSIGNED
7044 /* The address may be ptr_mode and OUTGOING may be Pmode. */
7045 if (GET_MODE (outgoing) != GET_MODE (value_address))
7046 value_address = convert_memory_address (GET_MODE (outgoing),
7050 emit_move_insn (outgoing, value_address);
7052 /* Show return register used to hold result (in this case the address
7054 current_function_return_rtx = outgoing;
7057 /* If this is an implementation of throw, do what's necessary to
7058 communicate between __builtin_eh_return and the epilogue. */
7059 expand_eh_return ();
7061 /* Emit the actual code to clobber return register. */
7066 clobber_return_register ();
7067 seq = gen_sequence ();
7070 after = emit_insn_after (seq, clobber_after);
7072 if (clobber_after != after)
7073 cfun->x_clobber_return_insn = after;
7076 /* ??? This should no longer be necessary since stupid is no longer with
7077 us, but there are some parts of the compiler (eg reload_combine, and
7078 sh mach_dep_reorg) that still try and compute their own lifetime info
7079 instead of using the general framework. */
7080 use_return_register ();
7082 /* Fix up any gotos that jumped out to the outermost
7083 binding level of the function.
7084 Must follow emitting RETURN_LABEL. */
7086 /* If you have any cleanups to do at this point,
7087 and they need to create temporary variables,
7088 then you will lose. */
7089 expand_fixups (get_insns ());
7093 get_arg_pointer_save_area (f)
7096 rtx ret = f->x_arg_pointer_save_area;
7100 ret = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, f);
7101 f->x_arg_pointer_save_area = ret;
7104 if (f == cfun && ! f->arg_pointer_save_area_init)
7108 /* Save the arg pointer at the beginning of the function. The
7109 generated stack slot may not be a valid memory address, so we
7110 have to check it and fix it if necessary. */
7112 emit_move_insn (validize_mem (ret), virtual_incoming_args_rtx);
7113 seq = gen_sequence ();
7116 push_topmost_sequence ();
7117 emit_insn_after (seq, get_insns ());
7118 pop_topmost_sequence ();
7124 /* Extend a vector that records the INSN_UIDs of INSNS (either a
7125 sequence or a single insn). */
7128 record_insns (insns, vecp)
7132 if (GET_CODE (insns) == SEQUENCE)
7134 int len = XVECLEN (insns, 0);
7135 int i = VARRAY_SIZE (*vecp);
7137 VARRAY_GROW (*vecp, i + len);
7140 VARRAY_INT (*vecp, i) = INSN_UID (XVECEXP (insns, 0, len));
7146 int i = VARRAY_SIZE (*vecp);
7147 VARRAY_GROW (*vecp, i + 1);
7148 VARRAY_INT (*vecp, i) = INSN_UID (insns);
7152 /* Determine how many INSN_UIDs in VEC are part of INSN. */
7155 contains (insn, vec)
7161 if (GET_CODE (insn) == INSN
7162 && GET_CODE (PATTERN (insn)) == SEQUENCE)
7165 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
7166 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7167 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j))
7173 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7174 if (INSN_UID (insn) == VARRAY_INT (vec, j))
7181 prologue_epilogue_contains (insn)
7184 if (contains (insn, prologue))
7186 if (contains (insn, epilogue))
7192 sibcall_epilogue_contains (insn)
7195 if (sibcall_epilogue)
7196 return contains (insn, sibcall_epilogue);
7201 /* Insert gen_return at the end of block BB. This also means updating
7202 block_for_insn appropriately. */
7205 emit_return_into_block (bb, line_note)
7211 p = NEXT_INSN (bb->end);
7212 end = emit_jump_insn_after (gen_return (), bb->end);
7214 emit_line_note_after (NOTE_SOURCE_FILE (line_note),
7215 NOTE_LINE_NUMBER (line_note), PREV_INSN (bb->end));
7217 #endif /* HAVE_return */
7219 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
7221 /* These functions convert the epilogue into a variant that does not modify the
7222 stack pointer. This is used in cases where a function returns an object
7223 whose size is not known until it is computed. The called function leaves the
7224 object on the stack, leaves the stack depressed, and returns a pointer to
7227 What we need to do is track all modifications and references to the stack
7228 pointer, deleting the modifications and changing the references to point to
7229 the location the stack pointer would have pointed to had the modifications
7232 These functions need to be portable so we need to make as few assumptions
7233 about the epilogue as we can. However, the epilogue basically contains
7234 three things: instructions to reset the stack pointer, instructions to
7235 reload registers, possibly including the frame pointer, and an
7236 instruction to return to the caller.
7238 If we can't be sure of what a relevant epilogue insn is doing, we abort.
7239 We also make no attempt to validate the insns we make since if they are
7240 invalid, we probably can't do anything valid. The intent is that these
7241 routines get "smarter" as more and more machines start to use them and
7242 they try operating on different epilogues.
7244 We use the following structure to track what the part of the epilogue that
7245 we've already processed has done. We keep two copies of the SP equivalence,
7246 one for use during the insn we are processing and one for use in the next
7247 insn. The difference is because one part of a PARALLEL may adjust SP
7248 and the other may use it. */
7252 rtx sp_equiv_reg; /* REG that SP is set from, perhaps SP. */
7253 HOST_WIDE_INT sp_offset; /* Offset from SP_EQUIV_REG of present SP. */
7254 rtx new_sp_equiv_reg; /* REG to be used at end of insn. */
7255 HOST_WIDE_INT new_sp_offset; /* Offset to be used at end of insn. */
7256 rtx equiv_reg_src; /* If nonzero, the value that SP_EQUIV_REG
7257 should be set to once we no longer need
7261 static void handle_epilogue_set PARAMS ((rtx, struct epi_info *));
7262 static void emit_equiv_load PARAMS ((struct epi_info *));
7264 /* Modify SEQ, a SEQUENCE that is part of the epilogue, to no modifications
7265 to the stack pointer. Return the new sequence. */
7268 keep_stack_depressed (seq)
7272 struct epi_info info;
7274 /* If the epilogue is just a single instruction, it ust be OK as is. */
7276 if (GET_CODE (seq) != SEQUENCE)
7279 /* Otherwise, start a sequence, initialize the information we have, and
7280 process all the insns we were given. */
7283 info.sp_equiv_reg = stack_pointer_rtx;
7285 info.equiv_reg_src = 0;
7287 for (i = 0; i < XVECLEN (seq, 0); i++)
7289 rtx insn = XVECEXP (seq, 0, i);
7297 /* If this insn references the register that SP is equivalent to and
7298 we have a pending load to that register, we must force out the load
7299 first and then indicate we no longer know what SP's equivalent is. */
7300 if (info.equiv_reg_src != 0
7301 && reg_referenced_p (info.sp_equiv_reg, PATTERN (insn)))
7303 emit_equiv_load (&info);
7304 info.sp_equiv_reg = 0;
7307 info.new_sp_equiv_reg = info.sp_equiv_reg;
7308 info.new_sp_offset = info.sp_offset;
7310 /* If this is a (RETURN) and the return address is on the stack,
7311 update the address and change to an indirect jump. */
7312 if (GET_CODE (PATTERN (insn)) == RETURN
7313 || (GET_CODE (PATTERN (insn)) == PARALLEL
7314 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
7316 rtx retaddr = INCOMING_RETURN_ADDR_RTX;
7318 HOST_WIDE_INT offset = 0;
7319 rtx jump_insn, jump_set;
7321 /* If the return address is in a register, we can emit the insn
7322 unchanged. Otherwise, it must be a MEM and we see what the
7323 base register and offset are. In any case, we have to emit any
7324 pending load to the equivalent reg of SP, if any. */
7325 if (GET_CODE (retaddr) == REG)
7327 emit_equiv_load (&info);
7331 else if (GET_CODE (retaddr) == MEM
7332 && GET_CODE (XEXP (retaddr, 0)) == REG)
7333 base = gen_rtx_REG (Pmode, REGNO (XEXP (retaddr, 0))), offset = 0;
7334 else if (GET_CODE (retaddr) == MEM
7335 && GET_CODE (XEXP (retaddr, 0)) == PLUS
7336 && GET_CODE (XEXP (XEXP (retaddr, 0), 0)) == REG
7337 && GET_CODE (XEXP (XEXP (retaddr, 0), 1)) == CONST_INT)
7339 base = gen_rtx_REG (Pmode, REGNO (XEXP (XEXP (retaddr, 0), 0)));
7340 offset = INTVAL (XEXP (XEXP (retaddr, 0), 1));
7345 /* If the base of the location containing the return pointer
7346 is SP, we must update it with the replacement address. Otherwise,
7347 just build the necessary MEM. */
7348 retaddr = plus_constant (base, offset);
7349 if (base == stack_pointer_rtx)
7350 retaddr = simplify_replace_rtx (retaddr, stack_pointer_rtx,
7351 plus_constant (info.sp_equiv_reg,
7354 retaddr = gen_rtx_MEM (Pmode, retaddr);
7356 /* If there is a pending load to the equivalent register for SP
7357 and we reference that register, we must load our address into
7358 a scratch register and then do that load. */
7359 if (info.equiv_reg_src
7360 && reg_overlap_mentioned_p (info.equiv_reg_src, retaddr))
7365 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
7366 if (HARD_REGNO_MODE_OK (regno, Pmode)
7367 && !fixed_regs[regno]
7368 && TEST_HARD_REG_BIT (regs_invalidated_by_call, regno)
7369 && !REGNO_REG_SET_P (EXIT_BLOCK_PTR->global_live_at_start,
7371 && !refers_to_regno_p (regno,
7372 regno + HARD_REGNO_NREGS (regno,
7374 info.equiv_reg_src, NULL))
7377 if (regno == FIRST_PSEUDO_REGISTER)
7380 reg = gen_rtx_REG (Pmode, regno);
7381 emit_move_insn (reg, retaddr);
7385 emit_equiv_load (&info);
7386 jump_insn = emit_jump_insn (gen_indirect_jump (retaddr));
7388 /* Show the SET in the above insn is a RETURN. */
7389 jump_set = single_set (jump_insn);
7393 SET_IS_RETURN_P (jump_set) = 1;
7396 /* If SP is not mentioned in the pattern and its equivalent register, if
7397 any, is not modified, just emit it. Otherwise, if neither is set,
7398 replace the reference to SP and emit the insn. If none of those are
7399 true, handle each SET individually. */
7400 else if (!reg_mentioned_p (stack_pointer_rtx, PATTERN (insn))
7401 && (info.sp_equiv_reg == stack_pointer_rtx
7402 || !reg_set_p (info.sp_equiv_reg, insn)))
7404 else if (! reg_set_p (stack_pointer_rtx, insn)
7405 && (info.sp_equiv_reg == stack_pointer_rtx
7406 || !reg_set_p (info.sp_equiv_reg, insn)))
7408 if (! validate_replace_rtx (stack_pointer_rtx,
7409 plus_constant (info.sp_equiv_reg,
7416 else if (GET_CODE (PATTERN (insn)) == SET)
7417 handle_epilogue_set (PATTERN (insn), &info);
7418 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
7420 for (j = 0; j < XVECLEN (PATTERN (insn), 0); j++)
7421 if (GET_CODE (XVECEXP (PATTERN (insn), 0, j)) == SET)
7422 handle_epilogue_set (XVECEXP (PATTERN (insn), 0, j), &info);
7427 info.sp_equiv_reg = info.new_sp_equiv_reg;
7428 info.sp_offset = info.new_sp_offset;
7431 seq = gen_sequence ();
7436 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
7437 structure that contains information about what we've seen so far. We
7438 process this SET by either updating that data or by emitting one or
7442 handle_epilogue_set (set, p)
7446 /* First handle the case where we are setting SP. Record what it is being
7447 set from. If unknown, abort. */
7448 if (reg_set_p (stack_pointer_rtx, set))
7450 if (SET_DEST (set) != stack_pointer_rtx)
7453 if (GET_CODE (SET_SRC (set)) == PLUS
7454 && GET_CODE (XEXP (SET_SRC (set), 1)) == CONST_INT)
7456 p->new_sp_equiv_reg = XEXP (SET_SRC (set), 0);
7457 p->new_sp_offset = INTVAL (XEXP (SET_SRC (set), 1));
7460 p->new_sp_equiv_reg = SET_SRC (set), p->new_sp_offset = 0;
7462 /* If we are adjusting SP, we adjust from the old data. */
7463 if (p->new_sp_equiv_reg == stack_pointer_rtx)
7465 p->new_sp_equiv_reg = p->sp_equiv_reg;
7466 p->new_sp_offset += p->sp_offset;
7469 if (p->new_sp_equiv_reg == 0 || GET_CODE (p->new_sp_equiv_reg) != REG)
7475 /* Next handle the case where we are setting SP's equivalent register.
7476 If we already have a value to set it to, abort. We could update, but
7477 there seems little point in handling that case. Note that we have
7478 to allow for the case where we are setting the register set in
7479 the previous part of a PARALLEL inside a single insn. But use the
7480 old offset for any updates within this insn. */
7481 else if (p->new_sp_equiv_reg != 0 && reg_set_p (p->new_sp_equiv_reg, set))
7483 if (!rtx_equal_p (p->new_sp_equiv_reg, SET_DEST (set))
7484 || p->equiv_reg_src != 0)
7488 = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
7489 plus_constant (p->sp_equiv_reg,
7493 /* Otherwise, replace any references to SP in the insn to its new value
7494 and emit the insn. */
7497 SET_SRC (set) = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
7498 plus_constant (p->sp_equiv_reg,
7500 SET_DEST (set) = simplify_replace_rtx (SET_DEST (set), stack_pointer_rtx,
7501 plus_constant (p->sp_equiv_reg,
7507 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
7513 if (p->equiv_reg_src != 0)
7514 emit_move_insn (p->sp_equiv_reg, p->equiv_reg_src);
7516 p->equiv_reg_src = 0;
7520 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
7521 this into place with notes indicating where the prologue ends and where
7522 the epilogue begins. Update the basic block information when possible. */
7525 thread_prologue_and_epilogue_insns (f)
7526 rtx f ATTRIBUTE_UNUSED;
7530 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
7533 #ifdef HAVE_prologue
7534 rtx prologue_end = NULL_RTX;
7536 #if defined (HAVE_epilogue) || defined(HAVE_return)
7537 rtx epilogue_end = NULL_RTX;
7540 #ifdef HAVE_prologue
7544 seq = gen_prologue ();
7547 /* Retain a map of the prologue insns. */
7548 if (GET_CODE (seq) != SEQUENCE)
7550 record_insns (seq, &prologue);
7551 prologue_end = emit_note (NULL, NOTE_INSN_PROLOGUE_END);
7553 seq = gen_sequence ();
7556 /* Can't deal with multiple successors of the entry block
7557 at the moment. Function should always have at least one
7559 if (!ENTRY_BLOCK_PTR->succ || ENTRY_BLOCK_PTR->succ->succ_next)
7562 insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ);
7567 /* If the exit block has no non-fake predecessors, we don't need
7569 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7570 if ((e->flags & EDGE_FAKE) == 0)
7576 if (optimize && HAVE_return)
7578 /* If we're allowed to generate a simple return instruction,
7579 then by definition we don't need a full epilogue. Examine
7580 the block that falls through to EXIT. If it does not
7581 contain any code, examine its predecessors and try to
7582 emit (conditional) return instructions. */
7588 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7589 if (e->flags & EDGE_FALLTHRU)
7595 /* Verify that there are no active instructions in the last block. */
7597 while (label && GET_CODE (label) != CODE_LABEL)
7599 if (active_insn_p (label))
7601 label = PREV_INSN (label);
7604 if (last->head == label && GET_CODE (label) == CODE_LABEL)
7606 rtx epilogue_line_note = NULL_RTX;
7608 /* Locate the line number associated with the closing brace,
7609 if we can find one. */
7610 for (seq = get_last_insn ();
7611 seq && ! active_insn_p (seq);
7612 seq = PREV_INSN (seq))
7613 if (GET_CODE (seq) == NOTE && NOTE_LINE_NUMBER (seq) > 0)
7615 epilogue_line_note = seq;
7619 for (e = last->pred; e; e = e_next)
7621 basic_block bb = e->src;
7624 e_next = e->pred_next;
7625 if (bb == ENTRY_BLOCK_PTR)
7629 if ((GET_CODE (jump) != JUMP_INSN) || JUMP_LABEL (jump) != label)
7632 /* If we have an unconditional jump, we can replace that
7633 with a simple return instruction. */
7634 if (simplejump_p (jump))
7636 emit_return_into_block (bb, epilogue_line_note);
7640 /* If we have a conditional jump, we can try to replace
7641 that with a conditional return instruction. */
7642 else if (condjump_p (jump))
7646 ret = SET_SRC (PATTERN (jump));
7647 if (GET_CODE (XEXP (ret, 1)) == LABEL_REF)
7648 loc = &XEXP (ret, 1);
7650 loc = &XEXP (ret, 2);
7651 ret = gen_rtx_RETURN (VOIDmode);
7653 if (! validate_change (jump, loc, ret, 0))
7655 if (JUMP_LABEL (jump))
7656 LABEL_NUSES (JUMP_LABEL (jump))--;
7658 /* If this block has only one successor, it both jumps
7659 and falls through to the fallthru block, so we can't
7661 if (bb->succ->succ_next == NULL)
7667 /* Fix up the CFG for the successful change we just made. */
7668 redirect_edge_succ (e, EXIT_BLOCK_PTR);
7671 /* Emit a return insn for the exit fallthru block. Whether
7672 this is still reachable will be determined later. */
7674 emit_barrier_after (last->end);
7675 emit_return_into_block (last, epilogue_line_note);
7676 epilogue_end = last->end;
7677 last->succ->flags &= ~EDGE_FALLTHRU;
7682 #ifdef HAVE_epilogue
7685 /* Find the edge that falls through to EXIT. Other edges may exist
7686 due to RETURN instructions, but those don't need epilogues.
7687 There really shouldn't be a mixture -- either all should have
7688 been converted or none, however... */
7690 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7691 if (e->flags & EDGE_FALLTHRU)
7697 epilogue_end = emit_note (NULL, NOTE_INSN_EPILOGUE_BEG);
7699 seq = gen_epilogue ();
7701 #ifdef INCOMING_RETURN_ADDR_RTX
7702 /* If this function returns with the stack depressed and we can support
7703 it, massage the epilogue to actually do that. */
7704 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
7705 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
7706 seq = keep_stack_depressed (seq);
7709 emit_jump_insn (seq);
7711 /* Retain a map of the epilogue insns. */
7712 if (GET_CODE (seq) != SEQUENCE)
7714 record_insns (seq, &epilogue);
7716 seq = gen_sequence ();
7719 insert_insn_on_edge (seq, e);
7726 commit_edge_insertions ();
7728 #ifdef HAVE_sibcall_epilogue
7729 /* Emit sibling epilogues before any sibling call sites. */
7730 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7732 basic_block bb = e->src;
7737 if (GET_CODE (insn) != CALL_INSN
7738 || ! SIBLING_CALL_P (insn))
7742 seq = gen_sibcall_epilogue ();
7745 i = PREV_INSN (insn);
7746 newinsn = emit_insn_before (seq, insn);
7748 /* Retain a map of the epilogue insns. Used in life analysis to
7749 avoid getting rid of sibcall epilogue insns. */
7750 record_insns (GET_CODE (seq) == SEQUENCE
7751 ? seq : newinsn, &sibcall_epilogue);
7755 #ifdef HAVE_prologue
7760 /* GDB handles `break f' by setting a breakpoint on the first
7761 line note after the prologue. Which means (1) that if
7762 there are line number notes before where we inserted the
7763 prologue we should move them, and (2) we should generate a
7764 note before the end of the first basic block, if there isn't
7767 ??? This behaviour is completely broken when dealing with
7768 multiple entry functions. We simply place the note always
7769 into first basic block and let alternate entry points
7773 for (insn = prologue_end; insn; insn = prev)
7775 prev = PREV_INSN (insn);
7776 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7778 /* Note that we cannot reorder the first insn in the
7779 chain, since rest_of_compilation relies on that
7780 remaining constant. */
7783 reorder_insns (insn, insn, prologue_end);
7787 /* Find the last line number note in the first block. */
7788 for (insn = ENTRY_BLOCK_PTR->next_bb->end;
7789 insn != prologue_end && insn;
7790 insn = PREV_INSN (insn))
7791 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7794 /* If we didn't find one, make a copy of the first line number
7798 for (insn = next_active_insn (prologue_end);
7800 insn = PREV_INSN (insn))
7801 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7803 emit_line_note_after (NOTE_SOURCE_FILE (insn),
7804 NOTE_LINE_NUMBER (insn),
7811 #ifdef HAVE_epilogue
7816 /* Similarly, move any line notes that appear after the epilogue.
7817 There is no need, however, to be quite so anal about the existence
7819 for (insn = epilogue_end; insn; insn = next)
7821 next = NEXT_INSN (insn);
7822 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7823 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
7829 /* Reposition the prologue-end and epilogue-begin notes after instruction
7830 scheduling and delayed branch scheduling. */
7833 reposition_prologue_and_epilogue_notes (f)
7834 rtx f ATTRIBUTE_UNUSED;
7836 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
7837 rtx insn, last, note;
7840 if ((len = VARRAY_SIZE (prologue)) > 0)
7844 /* Scan from the beginning until we reach the last prologue insn.
7845 We apparently can't depend on basic_block_{head,end} after
7847 for (insn = f; insn; insn = NEXT_INSN (insn))
7849 if (GET_CODE (insn) == NOTE)
7851 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
7854 else if (contains (insn, prologue))
7866 /* Find the prologue-end note if we haven't already, and
7867 move it to just after the last prologue insn. */
7870 for (note = last; (note = NEXT_INSN (note));)
7871 if (GET_CODE (note) == NOTE
7872 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
7876 next = NEXT_INSN (note);
7878 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
7879 if (GET_CODE (last) == CODE_LABEL)
7880 last = NEXT_INSN (last);
7881 reorder_insns (note, note, last);
7885 if ((len = VARRAY_SIZE (epilogue)) > 0)
7889 /* Scan from the end until we reach the first epilogue insn.
7890 We apparently can't depend on basic_block_{head,end} after
7892 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
7894 if (GET_CODE (insn) == NOTE)
7896 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
7899 else if (contains (insn, epilogue))
7909 /* Find the epilogue-begin note if we haven't already, and
7910 move it to just before the first epilogue insn. */
7913 for (note = insn; (note = PREV_INSN (note));)
7914 if (GET_CODE (note) == NOTE
7915 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
7919 if (PREV_INSN (last) != note)
7920 reorder_insns (note, note, PREV_INSN (last));
7923 #endif /* HAVE_prologue or HAVE_epilogue */
7926 /* Called once, at initialization, to initialize function.c. */
7929 init_function_once ()
7931 VARRAY_INT_INIT (prologue, 0, "prologue");
7932 VARRAY_INT_INIT (epilogue, 0, "epilogue");
7933 VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue");
7936 #include "gt-function.h"