1 /* Expands front end tree to back end RTL for GCC.
2 Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004 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. */
43 #include "coretypes.h"
54 #include "hard-reg-set.h"
55 #include "insn-config.h"
58 #include "basic-block.h"
63 #include "integrate.h"
64 #include "langhooks.h"
66 #include "cfglayout.h"
68 #ifndef LOCAL_ALIGNMENT
69 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
72 #ifndef STACK_ALIGNMENT_NEEDED
73 #define STACK_ALIGNMENT_NEEDED 1
76 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
78 /* Some systems use __main in a way incompatible with its use in gcc, in these
79 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
80 give the same symbol without quotes for an alternative entry point. You
81 must define both, or neither. */
83 #define NAME__MAIN "__main"
86 /* Round a value to the lowest integer less than it that is a multiple of
87 the required alignment. Avoid using division in case the value is
88 negative. Assume the alignment is a power of two. */
89 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
91 /* Similar, but round to the next highest integer that meets the
93 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
95 /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
96 during rtl generation. If they are different register numbers, this is
97 always true. It may also be true if
98 FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
99 generation. See fix_lexical_addr for details. */
101 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
102 #define NEED_SEPARATE_AP
105 /* Nonzero if function being compiled doesn't contain any calls
106 (ignoring the prologue and epilogue). This is set prior to
107 local register allocation and is valid for the remaining
109 int current_function_is_leaf;
111 /* Nonzero if function being compiled doesn't contain any instructions
112 that can throw an exception. This is set prior to final. */
114 int current_function_nothrow;
116 /* Nonzero if function being compiled doesn't modify the stack pointer
117 (ignoring the prologue and epilogue). This is only valid after
118 life_analysis has run. */
119 int current_function_sp_is_unchanging;
121 /* Nonzero if the function being compiled is a leaf function which only
122 uses leaf registers. This is valid after reload (specifically after
123 sched2) and is useful only if the port defines LEAF_REGISTERS. */
124 int current_function_uses_only_leaf_regs;
126 /* Nonzero once virtual register instantiation has been done.
127 assign_stack_local uses frame_pointer_rtx when this is nonzero.
128 calls.c:emit_library_call_value_1 uses it to set up
129 post-instantiation libcalls. */
130 int virtuals_instantiated;
132 /* Assign unique numbers to labels generated for profiling, debugging, etc. */
133 static GTY(()) int funcdef_no;
135 /* These variables hold pointers to functions to create and destroy
136 target specific, per-function data structures. */
137 struct machine_function * (*init_machine_status) (void);
139 /* The currently compiled function. */
140 struct function *cfun = 0;
142 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
143 static GTY(()) varray_type prologue;
144 static GTY(()) varray_type epilogue;
146 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
148 static GTY(()) varray_type sibcall_epilogue;
150 /* In order to evaluate some expressions, such as function calls returning
151 structures in memory, we need to temporarily allocate stack locations.
152 We record each allocated temporary in the following structure.
154 Associated with each temporary slot is a nesting level. When we pop up
155 one level, all temporaries associated with the previous level are freed.
156 Normally, all temporaries are freed after the execution of the statement
157 in which they were created. However, if we are inside a ({...}) grouping,
158 the result may be in a temporary and hence must be preserved. If the
159 result could be in a temporary, we preserve it if we can determine which
160 one it is in. If we cannot determine which temporary may contain the
161 result, all temporaries are preserved. A temporary is preserved by
162 pretending it was allocated at the previous nesting level.
164 Automatic variables are also assigned temporary slots, at the nesting
165 level where they are defined. They are marked a "kept" so that
166 free_temp_slots will not free them. */
168 struct temp_slot GTY(())
170 /* Points to next temporary slot. */
171 struct temp_slot *next;
172 /* Points to previous temporary slot. */
173 struct temp_slot *prev;
175 /* The rtx to used to reference the slot. */
177 /* The rtx used to represent the address if not the address of the
178 slot above. May be an EXPR_LIST if multiple addresses exist. */
180 /* The alignment (in bits) of the slot. */
182 /* The size, in units, of the slot. */
184 /* The type of the object in the slot, or zero if it doesn't correspond
185 to a type. We use this to determine whether a slot can be reused.
186 It can be reused if objects of the type of the new slot will always
187 conflict with objects of the type of the old slot. */
189 /* The value of `sequence_rtl_expr' when this temporary is allocated. */
191 /* Nonzero if this temporary is currently in use. */
193 /* Nonzero if this temporary has its address taken. */
195 /* Nesting level at which this slot is being used. */
197 /* Nonzero if this should survive a call to free_temp_slots. */
199 /* The offset of the slot from the frame_pointer, including extra space
200 for alignment. This info is for combine_temp_slots. */
201 HOST_WIDE_INT base_offset;
202 /* The size of the slot, including extra space for alignment. This
203 info is for combine_temp_slots. */
204 HOST_WIDE_INT full_size;
207 /* This structure is used to record MEMs or pseudos used to replace VAR, any
208 SUBREGs of VAR, and any MEMs containing VAR as an address. We need to
209 maintain this list in case two operands of an insn were required to match;
210 in that case we must ensure we use the same replacement. */
212 struct fixup_replacement GTY(())
216 struct fixup_replacement *next;
219 struct insns_for_mem_entry
223 /* These are the INSNs which reference the MEM. */
227 /* Forward declarations. */
229 static rtx assign_stack_local_1 (enum machine_mode, HOST_WIDE_INT, int,
231 static struct temp_slot *find_temp_slot_from_address (rtx);
232 static void put_reg_into_stack (struct function *, rtx, tree, enum machine_mode,
233 unsigned int, bool, bool, bool, htab_t);
234 static void schedule_fixup_var_refs (struct function *, rtx, tree, enum machine_mode,
236 static void fixup_var_refs (rtx, enum machine_mode, int, rtx, htab_t);
237 static struct fixup_replacement
238 *find_fixup_replacement (struct fixup_replacement **, rtx);
239 static void fixup_var_refs_insns (rtx, rtx, enum machine_mode, int, int, rtx);
240 static void fixup_var_refs_insns_with_hash (htab_t, rtx, enum machine_mode, int, rtx);
241 static void fixup_var_refs_insn (rtx, rtx, enum machine_mode, int, int, rtx);
242 static void fixup_var_refs_1 (rtx, enum machine_mode, rtx *, rtx,
243 struct fixup_replacement **, rtx);
244 static rtx fixup_memory_subreg (rtx, rtx, enum machine_mode, int);
245 static rtx walk_fixup_memory_subreg (rtx, rtx, rtx, enum machine_mode, int);
246 static rtx fixup_stack_1 (rtx, rtx);
247 static void optimize_bit_field (rtx, rtx, rtx *);
248 static void instantiate_decls (tree, int);
249 static void instantiate_decls_1 (tree, int);
250 static void instantiate_decl (rtx, HOST_WIDE_INT, int);
251 static rtx instantiate_new_reg (rtx, HOST_WIDE_INT *);
252 static int instantiate_virtual_regs_1 (rtx *, rtx, int);
253 static void pad_to_arg_alignment (struct args_size *, int, struct args_size *);
254 static void pad_below (struct args_size *, enum machine_mode, tree);
255 static void reorder_blocks_1 (rtx, tree, varray_type *);
256 static void reorder_fix_fragments (tree);
257 static int all_blocks (tree, tree *);
258 static tree *get_block_vector (tree, int *);
259 extern tree debug_find_var_in_block_tree (tree, tree);
260 /* We always define `record_insns' even if it's not used so that we
261 can always export `prologue_epilogue_contains'. */
262 static void record_insns (rtx, varray_type *) ATTRIBUTE_UNUSED;
263 static int contains (rtx, varray_type);
265 static void emit_return_into_block (basic_block, rtx);
267 static void put_addressof_into_stack (rtx, htab_t);
268 static bool purge_addressof_1 (rtx *, rtx, int, int, int, htab_t);
269 static void purge_single_hard_subreg_set (rtx);
270 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
271 static rtx keep_stack_depressed (rtx);
273 static int is_addressof (rtx *, void *);
274 static hashval_t insns_for_mem_hash (const void *);
275 static int insns_for_mem_comp (const void *, const void *);
276 static int insns_for_mem_walk (rtx *, void *);
277 static void compute_insns_for_mem (rtx, rtx, htab_t);
278 static void prepare_function_start (tree);
279 static void do_clobber_return_reg (rtx, void *);
280 static void do_use_return_reg (rtx, void *);
281 static void instantiate_virtual_regs_lossage (rtx);
282 static tree split_complex_args (tree);
283 static void set_insn_locators (rtx, int) ATTRIBUTE_UNUSED;
285 /* Pointer to chain of `struct function' for containing functions. */
286 struct function *outer_function_chain;
288 /* List of insns that were postponed by purge_addressof_1. */
289 static rtx postponed_insns;
291 /* Given a function decl for a containing function,
292 return the `struct function' for it. */
295 find_function_data (tree decl)
299 for (p = outer_function_chain; p; p = p->outer)
306 /* Save the current context for compilation of a nested function.
307 This is called from language-specific code. The caller should use
308 the enter_nested langhook to save any language-specific state,
309 since this function knows only about language-independent
313 push_function_context_to (tree context)
319 if (context == current_function_decl)
320 cfun->contains_functions = 1;
323 struct function *containing = find_function_data (context);
324 containing->contains_functions = 1;
329 init_dummy_function_start ();
332 p->outer = outer_function_chain;
333 outer_function_chain = p;
334 p->fixup_var_refs_queue = 0;
336 lang_hooks.function.enter_nested (p);
342 push_function_context (void)
344 push_function_context_to (current_function_decl);
347 /* Restore the last saved context, at the end of a nested function.
348 This function is called from language-specific code. */
351 pop_function_context_from (tree context ATTRIBUTE_UNUSED)
353 struct function *p = outer_function_chain;
354 struct var_refs_queue *queue;
357 outer_function_chain = p->outer;
359 current_function_decl = p->decl;
362 restore_emit_status (p);
364 lang_hooks.function.leave_nested (p);
366 /* Finish doing put_var_into_stack for any of our variables which became
367 addressable during the nested function. If only one entry has to be
368 fixed up, just do that one. Otherwise, first make a list of MEMs that
369 are not to be unshared. */
370 if (p->fixup_var_refs_queue == 0)
372 else if (p->fixup_var_refs_queue->next == 0)
373 fixup_var_refs (p->fixup_var_refs_queue->modified,
374 p->fixup_var_refs_queue->promoted_mode,
375 p->fixup_var_refs_queue->unsignedp,
376 p->fixup_var_refs_queue->modified, 0);
381 for (queue = p->fixup_var_refs_queue; queue; queue = queue->next)
382 list = gen_rtx_EXPR_LIST (VOIDmode, queue->modified, list);
384 for (queue = p->fixup_var_refs_queue; queue; queue = queue->next)
385 fixup_var_refs (queue->modified, queue->promoted_mode,
386 queue->unsignedp, list, 0);
390 p->fixup_var_refs_queue = 0;
392 /* Reset variables that have known state during rtx generation. */
393 rtx_equal_function_value_matters = 1;
394 virtuals_instantiated = 0;
395 generating_concat_p = 1;
399 pop_function_context (void)
401 pop_function_context_from (current_function_decl);
404 /* Clear out all parts of the state in F that can safely be discarded
405 after the function has been parsed, but not compiled, to let
406 garbage collection reclaim the memory. */
409 free_after_parsing (struct function *f)
411 /* f->expr->forced_labels is used by code generation. */
412 /* f->emit->regno_reg_rtx is used by code generation. */
413 /* f->varasm is used by code generation. */
414 /* f->eh->eh_return_stub_label is used by code generation. */
416 lang_hooks.function.final (f);
420 /* Clear out all parts of the state in F that can safely be discarded
421 after the function has been compiled, to let garbage collection
422 reclaim the memory. */
425 free_after_compilation (struct function *f)
433 f->x_avail_temp_slots = NULL;
434 f->x_used_temp_slots = NULL;
435 f->arg_offset_rtx = NULL;
436 f->return_rtx = NULL;
437 f->internal_arg_pointer = NULL;
438 f->x_nonlocal_goto_handler_labels = NULL;
439 f->x_return_label = NULL;
440 f->x_naked_return_label = NULL;
441 f->x_save_expr_regs = NULL;
442 f->x_stack_slot_list = NULL;
443 f->x_rtl_expr_chain = NULL;
444 f->x_tail_recursion_reentry = NULL;
445 f->x_arg_pointer_save_area = NULL;
446 f->x_parm_birth_insn = NULL;
447 f->x_parm_reg_stack_loc = NULL;
448 f->fixup_var_refs_queue = NULL;
449 f->original_arg_vector = NULL;
450 f->original_decl_initial = NULL;
451 f->epilogue_delay_list = NULL;
454 /* Allocate fixed slots in the stack frame of the current function. */
456 /* Return size needed for stack frame based on slots so far allocated in
458 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
459 the caller may have to do that. */
462 get_func_frame_size (struct function *f)
464 #ifdef FRAME_GROWS_DOWNWARD
465 return -f->x_frame_offset;
467 return f->x_frame_offset;
471 /* Return size needed for stack frame based on slots so far allocated.
472 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
473 the caller may have to do that. */
475 get_frame_size (void)
477 return get_func_frame_size (cfun);
480 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
481 with machine mode MODE.
483 ALIGN controls the amount of alignment for the address of the slot:
484 0 means according to MODE,
485 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
486 -2 means use BITS_PER_UNIT,
487 positive specifies alignment boundary in bits.
489 We do not round to stack_boundary here.
491 FUNCTION specifies the function to allocate in. */
494 assign_stack_local_1 (enum machine_mode mode, HOST_WIDE_INT size, int align,
495 struct function *function)
498 int bigend_correction = 0;
500 int frame_off, frame_alignment, frame_phase;
507 alignment = BIGGEST_ALIGNMENT;
509 alignment = GET_MODE_ALIGNMENT (mode);
511 /* Allow the target to (possibly) increase the alignment of this
513 type = lang_hooks.types.type_for_mode (mode, 0);
515 alignment = LOCAL_ALIGNMENT (type, alignment);
517 alignment /= BITS_PER_UNIT;
519 else if (align == -1)
521 alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
522 size = CEIL_ROUND (size, alignment);
524 else if (align == -2)
525 alignment = 1; /* BITS_PER_UNIT / BITS_PER_UNIT */
527 alignment = align / BITS_PER_UNIT;
529 #ifdef FRAME_GROWS_DOWNWARD
530 function->x_frame_offset -= size;
533 /* Ignore alignment we can't do with expected alignment of the boundary. */
534 if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY)
535 alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
537 if (function->stack_alignment_needed < alignment * BITS_PER_UNIT)
538 function->stack_alignment_needed = alignment * BITS_PER_UNIT;
540 /* Calculate how many bytes the start of local variables is off from
542 frame_alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
543 frame_off = STARTING_FRAME_OFFSET % frame_alignment;
544 frame_phase = frame_off ? frame_alignment - frame_off : 0;
546 /* Round the frame offset to the specified alignment. The default is
547 to always honor requests to align the stack but a port may choose to
548 do its own stack alignment by defining STACK_ALIGNMENT_NEEDED. */
549 if (STACK_ALIGNMENT_NEEDED
553 /* We must be careful here, since FRAME_OFFSET might be negative and
554 division with a negative dividend isn't as well defined as we might
555 like. So we instead assume that ALIGNMENT is a power of two and
556 use logical operations which are unambiguous. */
557 #ifdef FRAME_GROWS_DOWNWARD
558 function->x_frame_offset
559 = (FLOOR_ROUND (function->x_frame_offset - frame_phase, alignment)
562 function->x_frame_offset
563 = (CEIL_ROUND (function->x_frame_offset - frame_phase, alignment)
568 /* On a big-endian machine, if we are allocating more space than we will use,
569 use the least significant bytes of those that are allocated. */
570 if (BYTES_BIG_ENDIAN && mode != BLKmode)
571 bigend_correction = size - GET_MODE_SIZE (mode);
573 /* If we have already instantiated virtual registers, return the actual
574 address relative to the frame pointer. */
575 if (function == cfun && virtuals_instantiated)
576 addr = plus_constant (frame_pointer_rtx,
578 (frame_offset + bigend_correction
579 + STARTING_FRAME_OFFSET, Pmode));
581 addr = plus_constant (virtual_stack_vars_rtx,
583 (function->x_frame_offset + bigend_correction,
586 #ifndef FRAME_GROWS_DOWNWARD
587 function->x_frame_offset += size;
590 x = gen_rtx_MEM (mode, addr);
592 function->x_stack_slot_list
593 = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list);
598 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
602 assign_stack_local (enum machine_mode mode, HOST_WIDE_INT size, int align)
604 return assign_stack_local_1 (mode, size, align, cfun);
608 /* Removes temporary slot TEMP from LIST. */
611 cut_slot_from_list (struct temp_slot *temp, struct temp_slot **list)
614 temp->next->prev = temp->prev;
616 temp->prev->next = temp->next;
620 temp->prev = temp->next = NULL;
623 /* Inserts temporary slot TEMP to LIST. */
626 insert_slot_to_list (struct temp_slot *temp, struct temp_slot **list)
630 (*list)->prev = temp;
635 /* Returns the list of used temp slots at LEVEL. */
637 static struct temp_slot **
638 temp_slots_at_level (int level)
642 if (!used_temp_slots)
643 VARRAY_GENERIC_PTR_INIT (used_temp_slots, 3, "used_temp_slots");
645 while (level >= (int) VARRAY_ACTIVE_SIZE (used_temp_slots))
646 VARRAY_PUSH_GENERIC_PTR (used_temp_slots, NULL);
648 return (struct temp_slot **) &VARRAY_GENERIC_PTR (used_temp_slots, level);
651 /* Returns the maximal temporary slot level. */
654 max_slot_level (void)
656 if (!used_temp_slots)
659 return VARRAY_ACTIVE_SIZE (used_temp_slots) - 1;
662 /* Moves temporary slot TEMP to LEVEL. */
665 move_slot_to_level (struct temp_slot *temp, int level)
667 cut_slot_from_list (temp, temp_slots_at_level (temp->level));
668 insert_slot_to_list (temp, temp_slots_at_level (level));
672 /* Make temporary slot TEMP available. */
675 make_slot_available (struct temp_slot *temp)
677 cut_slot_from_list (temp, temp_slots_at_level (temp->level));
678 insert_slot_to_list (temp, &avail_temp_slots);
683 /* Allocate a temporary stack slot and record it for possible later
686 MODE is the machine mode to be given to the returned rtx.
688 SIZE is the size in units of the space required. We do no rounding here
689 since assign_stack_local will do any required rounding.
691 KEEP is 1 if this slot is to be retained after a call to
692 free_temp_slots. Automatic variables for a block are allocated
693 with this flag. KEEP is 2 if we allocate a longer term temporary,
694 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
695 if we are to allocate something at an inner level to be treated as
696 a variable in the block (e.g., a SAVE_EXPR).
698 TYPE is the type that will be used for the stack slot. */
701 assign_stack_temp_for_type (enum machine_mode mode, HOST_WIDE_INT size, int keep,
705 struct temp_slot *p, *best_p = 0, *selected = NULL, **pp;
708 /* If SIZE is -1 it means that somebody tried to allocate a temporary
709 of a variable size. */
714 align = BIGGEST_ALIGNMENT;
716 align = GET_MODE_ALIGNMENT (mode);
719 type = lang_hooks.types.type_for_mode (mode, 0);
722 align = LOCAL_ALIGNMENT (type, align);
724 /* Try to find an available, already-allocated temporary of the proper
725 mode which meets the size and alignment requirements. Choose the
726 smallest one with the closest alignment. */
727 for (p = avail_temp_slots; p; p = p->next)
729 if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode
730 && objects_must_conflict_p (p->type, type)
731 && (best_p == 0 || best_p->size > p->size
732 || (best_p->size == p->size && best_p->align > p->align)))
734 if (p->align == align && p->size == size)
737 cut_slot_from_list (selected, &avail_temp_slots);
745 /* Make our best, if any, the one to use. */
749 cut_slot_from_list (selected, &avail_temp_slots);
751 /* If there are enough aligned bytes left over, make them into a new
752 temp_slot so that the extra bytes don't get wasted. Do this only
753 for BLKmode slots, so that we can be sure of the alignment. */
754 if (GET_MODE (best_p->slot) == BLKmode)
756 int alignment = best_p->align / BITS_PER_UNIT;
757 HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment);
759 if (best_p->size - rounded_size >= alignment)
761 p = ggc_alloc (sizeof (struct temp_slot));
762 p->in_use = p->addr_taken = 0;
763 p->size = best_p->size - rounded_size;
764 p->base_offset = best_p->base_offset + rounded_size;
765 p->full_size = best_p->full_size - rounded_size;
766 p->slot = gen_rtx_MEM (BLKmode,
767 plus_constant (XEXP (best_p->slot, 0),
769 p->align = best_p->align;
772 p->type = best_p->type;
773 insert_slot_to_list (p, &avail_temp_slots);
775 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot,
778 best_p->size = rounded_size;
779 best_p->full_size = rounded_size;
784 /* If we still didn't find one, make a new temporary. */
787 HOST_WIDE_INT frame_offset_old = frame_offset;
789 p = ggc_alloc (sizeof (struct temp_slot));
791 /* We are passing an explicit alignment request to assign_stack_local.
792 One side effect of that is assign_stack_local will not round SIZE
793 to ensure the frame offset remains suitably aligned.
795 So for requests which depended on the rounding of SIZE, we go ahead
796 and round it now. We also make sure ALIGNMENT is at least
797 BIGGEST_ALIGNMENT. */
798 if (mode == BLKmode && align < BIGGEST_ALIGNMENT)
800 p->slot = assign_stack_local (mode,
802 ? CEIL_ROUND (size, (int) align / BITS_PER_UNIT)
808 /* The following slot size computation is necessary because we don't
809 know the actual size of the temporary slot until assign_stack_local
810 has performed all the frame alignment and size rounding for the
811 requested temporary. Note that extra space added for alignment
812 can be either above or below this stack slot depending on which
813 way the frame grows. We include the extra space if and only if it
814 is above this slot. */
815 #ifdef FRAME_GROWS_DOWNWARD
816 p->size = frame_offset_old - frame_offset;
821 /* Now define the fields used by combine_temp_slots. */
822 #ifdef FRAME_GROWS_DOWNWARD
823 p->base_offset = frame_offset;
824 p->full_size = frame_offset_old - frame_offset;
826 p->base_offset = frame_offset_old;
827 p->full_size = frame_offset - frame_offset_old;
837 p->rtl_expr = seq_rtl_expr;
842 p->level = target_temp_slot_level;
847 p->level = var_temp_slot_level;
852 p->level = temp_slot_level;
856 pp = temp_slots_at_level (p->level);
857 insert_slot_to_list (p, pp);
859 /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
860 slot = gen_rtx_MEM (mode, XEXP (p->slot, 0));
861 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, slot, stack_slot_list);
863 /* If we know the alias set for the memory that will be used, use
864 it. If there's no TYPE, then we don't know anything about the
865 alias set for the memory. */
866 set_mem_alias_set (slot, type ? get_alias_set (type) : 0);
867 set_mem_align (slot, align);
869 /* If a type is specified, set the relevant flags. */
872 RTX_UNCHANGING_P (slot) = (lang_hooks.honor_readonly
873 && TYPE_READONLY (type));
874 MEM_VOLATILE_P (slot) = TYPE_VOLATILE (type);
875 MEM_SET_IN_STRUCT_P (slot, AGGREGATE_TYPE_P (type));
881 /* Allocate a temporary stack slot and record it for possible later
882 reuse. First three arguments are same as in preceding function. */
885 assign_stack_temp (enum machine_mode mode, HOST_WIDE_INT size, int keep)
887 return assign_stack_temp_for_type (mode, size, keep, NULL_TREE);
890 /* Assign a temporary.
891 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
892 and so that should be used in error messages. In either case, we
893 allocate of the given type.
894 KEEP is as for assign_stack_temp.
895 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
896 it is 0 if a register is OK.
897 DONT_PROMOTE is 1 if we should not promote values in register
901 assign_temp (tree type_or_decl, int keep, int memory_required,
902 int dont_promote ATTRIBUTE_UNUSED)
905 enum machine_mode mode;
910 if (DECL_P (type_or_decl))
911 decl = type_or_decl, type = TREE_TYPE (decl);
913 decl = NULL, type = type_or_decl;
915 mode = TYPE_MODE (type);
917 unsignedp = TYPE_UNSIGNED (type);
920 if (mode == BLKmode || memory_required)
922 HOST_WIDE_INT size = int_size_in_bytes (type);
925 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
926 problems with allocating the stack space. */
930 /* Unfortunately, we don't yet know how to allocate variable-sized
931 temporaries. However, sometimes we have a fixed upper limit on
932 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
933 instead. This is the case for Chill variable-sized strings. */
934 if (size == -1 && TREE_CODE (type) == ARRAY_TYPE
935 && TYPE_ARRAY_MAX_SIZE (type) != NULL_TREE
936 && host_integerp (TYPE_ARRAY_MAX_SIZE (type), 1))
937 size = tree_low_cst (TYPE_ARRAY_MAX_SIZE (type), 1);
939 /* The size of the temporary may be too large to fit into an integer. */
940 /* ??? Not sure this should happen except for user silliness, so limit
941 this to things that aren't compiler-generated temporaries. The
942 rest of the time we'll abort in assign_stack_temp_for_type. */
943 if (decl && size == -1
944 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST)
946 error ("%Jsize of variable '%D' is too large", decl, decl);
950 tmp = assign_stack_temp_for_type (mode, size, keep, type);
956 mode = promote_mode (type, mode, &unsignedp, 0);
959 return gen_reg_rtx (mode);
962 /* Combine temporary stack slots which are adjacent on the stack.
964 This allows for better use of already allocated stack space. This is only
965 done for BLKmode slots because we can be sure that we won't have alignment
966 problems in this case. */
969 combine_temp_slots (void)
971 struct temp_slot *p, *q, *next, *next_q;
974 /* We can't combine slots, because the information about which slot
975 is in which alias set will be lost. */
976 if (flag_strict_aliasing)
979 /* If there are a lot of temp slots, don't do anything unless
980 high levels of optimization. */
981 if (! flag_expensive_optimizations)
982 for (p = avail_temp_slots, num_slots = 0; p; p = p->next, num_slots++)
983 if (num_slots > 100 || (num_slots > 10 && optimize == 0))
986 for (p = avail_temp_slots; p; p = next)
992 if (GET_MODE (p->slot) != BLKmode)
995 for (q = p->next; q; q = next_q)
1001 if (GET_MODE (q->slot) != BLKmode)
1004 if (p->base_offset + p->full_size == q->base_offset)
1006 /* Q comes after P; combine Q into P. */
1008 p->full_size += q->full_size;
1011 else if (q->base_offset + q->full_size == p->base_offset)
1013 /* P comes after Q; combine P into Q. */
1015 q->full_size += p->full_size;
1020 cut_slot_from_list (q, &avail_temp_slots);
1023 /* Either delete P or advance past it. */
1025 cut_slot_from_list (p, &avail_temp_slots);
1029 /* Find the temp slot corresponding to the object at address X. */
1031 static struct temp_slot *
1032 find_temp_slot_from_address (rtx x)
1034 struct temp_slot *p;
1038 for (i = max_slot_level (); i >= 0; i--)
1039 for (p = *temp_slots_at_level (i); p; p = p->next)
1041 if (XEXP (p->slot, 0) == x
1043 || (GET_CODE (x) == PLUS
1044 && XEXP (x, 0) == virtual_stack_vars_rtx
1045 && GET_CODE (XEXP (x, 1)) == CONST_INT
1046 && INTVAL (XEXP (x, 1)) >= p->base_offset
1047 && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size))
1050 else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST)
1051 for (next = p->address; next; next = XEXP (next, 1))
1052 if (XEXP (next, 0) == x)
1056 /* If we have a sum involving a register, see if it points to a temp
1058 if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 0))
1059 && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
1061 else if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 1))
1062 && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
1068 /* Indicate that NEW is an alternate way of referring to the temp slot
1069 that previously was known by OLD. */
1072 update_temp_slot_address (rtx old, rtx new)
1074 struct temp_slot *p;
1076 if (rtx_equal_p (old, new))
1079 p = find_temp_slot_from_address (old);
1081 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
1082 is a register, see if one operand of the PLUS is a temporary
1083 location. If so, NEW points into it. Otherwise, if both OLD and
1084 NEW are a PLUS and if there is a register in common between them.
1085 If so, try a recursive call on those values. */
1088 if (GET_CODE (old) != PLUS)
1093 update_temp_slot_address (XEXP (old, 0), new);
1094 update_temp_slot_address (XEXP (old, 1), new);
1097 else if (GET_CODE (new) != PLUS)
1100 if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0)))
1101 update_temp_slot_address (XEXP (old, 1), XEXP (new, 1));
1102 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0)))
1103 update_temp_slot_address (XEXP (old, 0), XEXP (new, 1));
1104 else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1)))
1105 update_temp_slot_address (XEXP (old, 1), XEXP (new, 0));
1106 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1)))
1107 update_temp_slot_address (XEXP (old, 0), XEXP (new, 0));
1112 /* Otherwise add an alias for the temp's address. */
1113 else if (p->address == 0)
1117 if (GET_CODE (p->address) != EXPR_LIST)
1118 p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX);
1120 p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address);
1124 /* If X could be a reference to a temporary slot, mark the fact that its
1125 address was taken. */
1128 mark_temp_addr_taken (rtx x)
1130 struct temp_slot *p;
1135 /* If X is not in memory or is at a constant address, it cannot be in
1136 a temporary slot. */
1137 if (!MEM_P (x) || CONSTANT_P (XEXP (x, 0)))
1140 p = find_temp_slot_from_address (XEXP (x, 0));
1145 /* If X could be a reference to a temporary slot, mark that slot as
1146 belonging to the to one level higher than the current level. If X
1147 matched one of our slots, just mark that one. Otherwise, we can't
1148 easily predict which it is, so upgrade all of them. Kept slots
1149 need not be touched.
1151 This is called when an ({...}) construct occurs and a statement
1152 returns a value in memory. */
1155 preserve_temp_slots (rtx x)
1157 struct temp_slot *p = 0, *next;
1159 /* If there is no result, we still might have some objects whose address
1160 were taken, so we need to make sure they stay around. */
1163 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1168 move_slot_to_level (p, temp_slot_level - 1);
1174 /* If X is a register that is being used as a pointer, see if we have
1175 a temporary slot we know it points to. To be consistent with
1176 the code below, we really should preserve all non-kept slots
1177 if we can't find a match, but that seems to be much too costly. */
1178 if (REG_P (x) && REG_POINTER (x))
1179 p = find_temp_slot_from_address (x);
1181 /* If X is not in memory or is at a constant address, it cannot be in
1182 a temporary slot, but it can contain something whose address was
1184 if (p == 0 && (!MEM_P (x) || CONSTANT_P (XEXP (x, 0))))
1186 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1191 move_slot_to_level (p, temp_slot_level - 1);
1197 /* First see if we can find a match. */
1199 p = find_temp_slot_from_address (XEXP (x, 0));
1203 /* Move everything at our level whose address was taken to our new
1204 level in case we used its address. */
1205 struct temp_slot *q;
1207 if (p->level == temp_slot_level)
1209 for (q = *temp_slots_at_level (temp_slot_level); q; q = next)
1213 if (p != q && q->addr_taken)
1214 move_slot_to_level (q, temp_slot_level - 1);
1217 move_slot_to_level (p, temp_slot_level - 1);
1223 /* Otherwise, preserve all non-kept slots at this level. */
1224 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1229 move_slot_to_level (p, temp_slot_level - 1);
1233 /* X is the result of an RTL_EXPR. If it is a temporary slot associated
1234 with that RTL_EXPR, promote it into a temporary slot at the present
1235 level so it will not be freed when we free slots made in the
1239 preserve_rtl_expr_result (rtx x)
1241 struct temp_slot *p;
1243 /* If X is not in memory or is at a constant address, it cannot be in
1244 a temporary slot. */
1245 if (x == 0 || !MEM_P (x) || CONSTANT_P (XEXP (x, 0)))
1248 /* If we can find a match, move it to our level unless it is already at
1250 p = find_temp_slot_from_address (XEXP (x, 0));
1253 move_slot_to_level (p, MIN (p->level, temp_slot_level));
1260 /* Free all temporaries used so far. This is normally called at the end
1261 of generating code for a statement. Don't free any temporaries
1262 currently in use for an RTL_EXPR that hasn't yet been emitted.
1263 We could eventually do better than this since it can be reused while
1264 generating the same RTL_EXPR, but this is complex and probably not
1268 free_temp_slots (void)
1270 struct temp_slot *p, *next;
1272 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1276 if (!p->keep && p->rtl_expr == 0)
1277 make_slot_available (p);
1280 combine_temp_slots ();
1283 /* Free all temporary slots used in T, an RTL_EXPR node. */
1286 free_temps_for_rtl_expr (tree t)
1288 struct temp_slot *p, *next;
1290 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1294 if (p->rtl_expr == t)
1296 /* If this slot is below the current TEMP_SLOT_LEVEL, then it
1297 needs to be preserved. This can happen if a temporary in
1298 the RTL_EXPR was addressed; preserve_temp_slots will move
1299 the temporary into a higher level. */
1300 if (temp_slot_level <= p->level)
1301 make_slot_available (p);
1303 p->rtl_expr = NULL_TREE;
1307 combine_temp_slots ();
1310 /* Push deeper into the nesting level for stack temporaries. */
1313 push_temp_slots (void)
1318 /* Pop a temporary nesting level. All slots in use in the current level
1322 pop_temp_slots (void)
1324 struct temp_slot *p, *next;
1326 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1330 if (p->rtl_expr == 0)
1331 make_slot_available (p);
1334 combine_temp_slots ();
1339 /* Initialize temporary slots. */
1342 init_temp_slots (void)
1344 /* We have not allocated any temporaries yet. */
1345 avail_temp_slots = 0;
1346 used_temp_slots = 0;
1347 temp_slot_level = 0;
1348 var_temp_slot_level = 0;
1349 target_temp_slot_level = 0;
1352 /* Retroactively move an auto variable from a register to a stack
1353 slot. This is done when an address-reference to the variable is
1354 seen. If RESCAN is true, all previously emitted instructions are
1355 examined and modified to handle the fact that DECL is now
1359 put_var_into_stack (tree decl, int rescan)
1362 enum machine_mode promoted_mode, decl_mode;
1363 struct function *function = 0;
1365 bool can_use_addressof_p;
1366 bool volatile_p = TREE_CODE (decl) != SAVE_EXPR && TREE_THIS_VOLATILE (decl);
1367 bool used_p = (TREE_USED (decl)
1368 || (TREE_CODE (decl) != SAVE_EXPR && DECL_INITIAL (decl) != 0));
1370 context = decl_function_context (decl);
1372 /* Get the current rtl used for this object and its original mode. */
1373 orig_reg = reg = (TREE_CODE (decl) == SAVE_EXPR
1374 ? SAVE_EXPR_RTL (decl)
1375 : DECL_RTL_IF_SET (decl));
1377 /* No need to do anything if decl has no rtx yet
1378 since in that case caller is setting TREE_ADDRESSABLE
1379 and a stack slot will be assigned when the rtl is made. */
1383 /* Get the declared mode for this object. */
1384 decl_mode = (TREE_CODE (decl) == SAVE_EXPR ? TYPE_MODE (TREE_TYPE (decl))
1385 : DECL_MODE (decl));
1386 /* Get the mode it's actually stored in. */
1387 promoted_mode = GET_MODE (reg);
1389 /* If this variable comes from an outer function, find that
1390 function's saved context. Don't use find_function_data here,
1391 because it might not be in any active function.
1392 FIXME: Is that really supposed to happen?
1393 It does in ObjC at least. */
1394 if (context != current_function_decl)
1395 for (function = outer_function_chain; function; function = function->outer)
1396 if (function->decl == context)
1399 /* If this is a variable-sized object or a structure passed by invisible
1400 reference, with a pseudo to address it, put that pseudo into the stack
1401 if the var is non-local. */
1402 if (TREE_CODE (decl) != SAVE_EXPR && DECL_NONLOCAL (decl)
1404 && REG_P (XEXP (reg, 0))
1405 && REGNO (XEXP (reg, 0)) > LAST_VIRTUAL_REGISTER)
1407 orig_reg = reg = XEXP (reg, 0);
1408 decl_mode = promoted_mode = GET_MODE (reg);
1411 /* If this variable lives in the current function and we don't need to put it
1412 in the stack for the sake of setjmp or the non-locality, try to keep it in
1413 a register until we know we actually need the address. */
1416 && ! (TREE_CODE (decl) != SAVE_EXPR && DECL_NONLOCAL (decl))
1418 /* FIXME make it work for promoted modes too */
1419 && decl_mode == promoted_mode
1420 #ifdef NON_SAVING_SETJMP
1421 && ! (NON_SAVING_SETJMP && current_function_calls_setjmp)
1425 /* If we can't use ADDRESSOF, make sure we see through one we already
1427 if (! can_use_addressof_p
1429 && GET_CODE (XEXP (reg, 0)) == ADDRESSOF)
1430 reg = XEXP (XEXP (reg, 0), 0);
1432 /* Now we should have a value that resides in one or more pseudo regs. */
1436 if (can_use_addressof_p)
1437 gen_mem_addressof (reg, decl, rescan);
1439 put_reg_into_stack (function, reg, TREE_TYPE (decl), decl_mode,
1440 0, volatile_p, used_p, false, 0);
1442 /* If this was previously a MEM but we've removed the ADDRESSOF,
1443 set this address into that MEM so we always use the same
1444 rtx for this variable. */
1445 if (orig_reg != reg && MEM_P (orig_reg))
1446 XEXP (orig_reg, 0) = XEXP (reg, 0);
1448 else if (GET_CODE (reg) == CONCAT)
1450 /* A CONCAT contains two pseudos; put them both in the stack.
1451 We do it so they end up consecutive.
1452 We fixup references to the parts only after we fixup references
1453 to the whole CONCAT, lest we do double fixups for the latter
1455 enum machine_mode part_mode = GET_MODE (XEXP (reg, 0));
1456 tree part_type = lang_hooks.types.type_for_mode (part_mode, 0);
1457 rtx lopart = XEXP (reg, 0);
1458 rtx hipart = XEXP (reg, 1);
1459 #ifdef FRAME_GROWS_DOWNWARD
1460 /* Since part 0 should have a lower address, do it second. */
1461 put_reg_into_stack (function, hipart, part_type, part_mode,
1462 0, volatile_p, false, false, 0);
1463 put_reg_into_stack (function, lopart, part_type, part_mode,
1464 0, volatile_p, false, true, 0);
1466 put_reg_into_stack (function, lopart, part_type, part_mode,
1467 0, volatile_p, false, false, 0);
1468 put_reg_into_stack (function, hipart, part_type, part_mode,
1469 0, volatile_p, false, true, 0);
1472 /* Change the CONCAT into a combined MEM for both parts. */
1473 PUT_CODE (reg, MEM);
1474 MEM_ATTRS (reg) = 0;
1476 /* set_mem_attributes uses DECL_RTL to avoid re-generating of
1477 already computed alias sets. Here we want to re-generate. */
1479 SET_DECL_RTL (decl, NULL);
1480 set_mem_attributes (reg, decl, 1);
1482 SET_DECL_RTL (decl, reg);
1484 /* The two parts are in memory order already.
1485 Use the lower parts address as ours. */
1486 XEXP (reg, 0) = XEXP (XEXP (reg, 0), 0);
1487 /* Prevent sharing of rtl that might lose. */
1488 if (GET_CODE (XEXP (reg, 0)) == PLUS)
1489 XEXP (reg, 0) = copy_rtx (XEXP (reg, 0));
1490 if (used_p && rescan)
1492 schedule_fixup_var_refs (function, reg, TREE_TYPE (decl),
1494 schedule_fixup_var_refs (function, lopart, part_type, part_mode, 0);
1495 schedule_fixup_var_refs (function, hipart, part_type, part_mode, 0);
1502 /* Subroutine of put_var_into_stack. This puts a single pseudo reg REG
1503 into the stack frame of FUNCTION (0 means the current function).
1504 TYPE is the user-level data type of the value hold in the register.
1505 DECL_MODE is the machine mode of the user-level data type.
1506 ORIGINAL_REGNO must be set if the real regno is not visible in REG.
1507 VOLATILE_P is true if this is for a "volatile" decl.
1508 USED_P is true if this reg might have already been used in an insn.
1509 CONSECUTIVE_P is true if the stack slot assigned to reg must be
1510 consecutive with the previous stack slot. */
1513 put_reg_into_stack (struct function *function, rtx reg, tree type,
1514 enum machine_mode decl_mode, unsigned int original_regno,
1515 bool volatile_p, bool used_p, bool consecutive_p,
1518 struct function *func = function ? function : cfun;
1519 enum machine_mode mode = GET_MODE (reg);
1520 unsigned int regno = original_regno;
1524 regno = REGNO (reg);
1526 if (regno < func->x_max_parm_reg)
1528 if (!func->x_parm_reg_stack_loc)
1530 new = func->x_parm_reg_stack_loc[regno];
1534 new = assign_stack_local_1 (decl_mode, GET_MODE_SIZE (decl_mode),
1535 consecutive_p ? -2 : 0, func);
1537 PUT_CODE (reg, MEM);
1538 PUT_MODE (reg, decl_mode);
1539 XEXP (reg, 0) = XEXP (new, 0);
1540 MEM_ATTRS (reg) = 0;
1541 /* `volatil' bit means one thing for MEMs, another entirely for REGs. */
1542 MEM_VOLATILE_P (reg) = volatile_p;
1544 /* If this is a memory ref that contains aggregate components,
1545 mark it as such for cse and loop optimize. If we are reusing a
1546 previously generated stack slot, then we need to copy the bit in
1547 case it was set for other reasons. For instance, it is set for
1548 __builtin_va_alist. */
1551 MEM_SET_IN_STRUCT_P (reg,
1552 AGGREGATE_TYPE_P (type) || MEM_IN_STRUCT_P (new));
1553 set_mem_alias_set (reg, get_alias_set (type));
1557 schedule_fixup_var_refs (function, reg, type, mode, ht);
1560 /* Make sure that all refs to the variable, previously made
1561 when it was a register, are fixed up to be valid again.
1562 See function above for meaning of arguments. */
1565 schedule_fixup_var_refs (struct function *function, rtx reg, tree type,
1566 enum machine_mode promoted_mode, htab_t ht)
1568 int unsigned_p = type ? TYPE_UNSIGNED (type) : 0;
1572 struct var_refs_queue *temp;
1574 temp = ggc_alloc (sizeof (struct var_refs_queue));
1575 temp->modified = reg;
1576 temp->promoted_mode = promoted_mode;
1577 temp->unsignedp = unsigned_p;
1578 temp->next = function->fixup_var_refs_queue;
1579 function->fixup_var_refs_queue = temp;
1582 /* Variable is local; fix it up now. */
1583 fixup_var_refs (reg, promoted_mode, unsigned_p, reg, ht);
1587 fixup_var_refs (rtx var, enum machine_mode promoted_mode, int unsignedp,
1588 rtx may_share, htab_t ht)
1591 rtx first_insn = get_insns ();
1592 struct sequence_stack *stack = seq_stack;
1593 tree rtl_exps = rtl_expr_chain;
1594 int save_volatile_ok = volatile_ok;
1596 /* If there's a hash table, it must record all uses of VAR. */
1601 fixup_var_refs_insns_with_hash (ht, var, promoted_mode, unsignedp,
1606 /* Volatile is valid in MEMs because all we're doing in changing the
1609 fixup_var_refs_insns (first_insn, var, promoted_mode, unsignedp,
1610 stack == 0, may_share);
1612 /* Scan all pending sequences too. */
1613 for (; stack; stack = stack->next)
1615 push_to_full_sequence (stack->first, stack->last);
1616 fixup_var_refs_insns (stack->first, var, promoted_mode, unsignedp,
1617 stack->next != 0, may_share);
1618 /* Update bounds of sequence in case we added insns. */
1619 stack->first = get_insns ();
1620 stack->last = get_last_insn ();
1624 /* Scan all waiting RTL_EXPRs too. */
1625 for (pending = rtl_exps; pending; pending = TREE_CHAIN (pending))
1627 rtx seq = RTL_EXPR_SEQUENCE (TREE_VALUE (pending));
1628 if (seq != const0_rtx && seq != 0)
1630 push_to_sequence (seq);
1631 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0,
1637 volatile_ok = save_volatile_ok;
1640 /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is
1641 some part of an insn. Return a struct fixup_replacement whose OLD
1642 value is equal to X. Allocate a new structure if no such entry exists. */
1644 static struct fixup_replacement *
1645 find_fixup_replacement (struct fixup_replacement **replacements, rtx x)
1647 struct fixup_replacement *p;
1649 /* See if we have already replaced this. */
1650 for (p = *replacements; p != 0 && ! rtx_equal_p (p->old, x); p = p->next)
1655 p = xmalloc (sizeof (struct fixup_replacement));
1658 p->next = *replacements;
1665 /* Scan the insn-chain starting with INSN for refs to VAR and fix them
1666 up. TOPLEVEL is nonzero if this chain is the main chain of insns
1667 for the current function. MAY_SHARE is either a MEM that is not
1668 to be unshared or a list of them. */
1671 fixup_var_refs_insns (rtx insn, rtx var, enum machine_mode promoted_mode,
1672 int unsignedp, int toplevel, rtx may_share)
1676 /* fixup_var_refs_insn might modify insn, so save its next
1678 rtx next = NEXT_INSN (insn);
1681 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, toplevel,
1688 /* Look up the insns which reference VAR in HT and fix them up. Other
1689 arguments are the same as fixup_var_refs_insns. */
1692 fixup_var_refs_insns_with_hash (htab_t ht, rtx var, enum machine_mode promoted_mode,
1693 int unsignedp, rtx may_share)
1695 struct insns_for_mem_entry tmp;
1696 struct insns_for_mem_entry *ime;
1700 ime = htab_find (ht, &tmp);
1701 for (insn_list = ime->insns; insn_list != 0; insn_list = XEXP (insn_list, 1))
1702 if (INSN_P (XEXP (insn_list, 0)))
1703 fixup_var_refs_insn (XEXP (insn_list, 0), var, promoted_mode,
1704 unsignedp, 1, may_share);
1708 /* Per-insn processing by fixup_var_refs_insns(_with_hash). INSN is
1709 the insn under examination, VAR is the variable to fix up
1710 references to, PROMOTED_MODE and UNSIGNEDP describe VAR, and
1711 TOPLEVEL is nonzero if this is the main insn chain for this
1715 fixup_var_refs_insn (rtx insn, rtx var, enum machine_mode promoted_mode,
1716 int unsignedp, int toplevel, rtx no_share)
1719 rtx set, prev, prev_set;
1722 /* Remember the notes in case we delete the insn. */
1723 note = REG_NOTES (insn);
1725 /* If this is a CLOBBER of VAR, delete it.
1727 If it has a REG_LIBCALL note, delete the REG_LIBCALL
1728 and REG_RETVAL notes too. */
1729 if (GET_CODE (PATTERN (insn)) == CLOBBER
1730 && (XEXP (PATTERN (insn), 0) == var
1731 || (GET_CODE (XEXP (PATTERN (insn), 0)) == CONCAT
1732 && (XEXP (XEXP (PATTERN (insn), 0), 0) == var
1733 || XEXP (XEXP (PATTERN (insn), 0), 1) == var))))
1735 if ((note = find_reg_note (insn, REG_LIBCALL, NULL_RTX)) != 0)
1736 /* The REG_LIBCALL note will go away since we are going to
1737 turn INSN into a NOTE, so just delete the
1738 corresponding REG_RETVAL note. */
1739 remove_note (XEXP (note, 0),
1740 find_reg_note (XEXP (note, 0), REG_RETVAL,
1746 /* The insn to load VAR from a home in the arglist
1747 is now a no-op. When we see it, just delete it.
1748 Similarly if this is storing VAR from a register from which
1749 it was loaded in the previous insn. This will occur
1750 when an ADDRESSOF was made for an arglist slot. */
1752 && (set = single_set (insn)) != 0
1753 && SET_DEST (set) == var
1754 /* If this represents the result of an insn group,
1755 don't delete the insn. */
1756 && find_reg_note (insn, REG_RETVAL, NULL_RTX) == 0
1757 && (rtx_equal_p (SET_SRC (set), var)
1758 || (REG_P (SET_SRC (set))
1759 && (prev = prev_nonnote_insn (insn)) != 0
1760 && (prev_set = single_set (prev)) != 0
1761 && SET_DEST (prev_set) == SET_SRC (set)
1762 && rtx_equal_p (SET_SRC (prev_set), var))))
1768 struct fixup_replacement *replacements = 0;
1770 if (SMALL_REGISTER_CLASSES)
1772 /* If the insn that copies the results of a CALL_INSN
1773 into a pseudo now references VAR, we have to use an
1774 intermediate pseudo since we want the life of the
1775 return value register to be only a single insn.
1777 If we don't use an intermediate pseudo, such things as
1778 address computations to make the address of VAR valid
1779 if it is not can be placed between the CALL_INSN and INSN.
1781 To make sure this doesn't happen, we record the destination
1782 of the CALL_INSN and see if the next insn uses both that
1785 if (call_dest != 0 && GET_CODE (insn) == INSN
1786 && reg_mentioned_p (var, PATTERN (insn))
1787 && reg_mentioned_p (call_dest, PATTERN (insn)))
1789 rtx temp = gen_reg_rtx (GET_MODE (call_dest));
1791 emit_insn_before (gen_move_insn (temp, call_dest), insn);
1793 PATTERN (insn) = replace_rtx (PATTERN (insn),
1797 if (GET_CODE (insn) == CALL_INSN
1798 && GET_CODE (PATTERN (insn)) == SET)
1799 call_dest = SET_DEST (PATTERN (insn));
1800 else if (GET_CODE (insn) == CALL_INSN
1801 && GET_CODE (PATTERN (insn)) == PARALLEL
1802 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET)
1803 call_dest = SET_DEST (XVECEXP (PATTERN (insn), 0, 0));
1808 /* See if we have to do anything to INSN now that VAR is in
1809 memory. If it needs to be loaded into a pseudo, use a single
1810 pseudo for the entire insn in case there is a MATCH_DUP
1811 between two operands. We pass a pointer to the head of
1812 a list of struct fixup_replacements. If fixup_var_refs_1
1813 needs to allocate pseudos or replacement MEMs (for SUBREGs),
1814 it will record them in this list.
1816 If it allocated a pseudo for any replacement, we copy into
1819 fixup_var_refs_1 (var, promoted_mode, &PATTERN (insn), insn,
1820 &replacements, no_share);
1822 while (replacements)
1824 struct fixup_replacement *next;
1826 if (REG_P (replacements->new))
1831 /* OLD might be a (subreg (mem)). */
1832 if (GET_CODE (replacements->old) == SUBREG)
1834 = fixup_memory_subreg (replacements->old, insn,
1838 = fixup_stack_1 (replacements->old, insn);
1840 insert_before = insn;
1842 /* If we are changing the mode, do a conversion.
1843 This might be wasteful, but combine.c will
1844 eliminate much of the waste. */
1846 if (GET_MODE (replacements->new)
1847 != GET_MODE (replacements->old))
1850 convert_move (replacements->new,
1851 replacements->old, unsignedp);
1856 seq = gen_move_insn (replacements->new,
1859 emit_insn_before (seq, insert_before);
1862 next = replacements->next;
1863 free (replacements);
1864 replacements = next;
1868 /* Also fix up any invalid exprs in the REG_NOTES of this insn.
1869 But don't touch other insns referred to by reg-notes;
1870 we will get them elsewhere. */
1873 if (GET_CODE (note) != INSN_LIST)
1875 = walk_fixup_memory_subreg (XEXP (note, 0), insn, var,
1877 note = XEXP (note, 1);
1881 /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
1882 See if the rtx expression at *LOC in INSN needs to be changed.
1884 REPLACEMENTS is a pointer to a list head that starts out zero, but may
1885 contain a list of original rtx's and replacements. If we find that we need
1886 to modify this insn by replacing a memory reference with a pseudo or by
1887 making a new MEM to implement a SUBREG, we consult that list to see if
1888 we have already chosen a replacement. If none has already been allocated,
1889 we allocate it and update the list. fixup_var_refs_insn will copy VAR
1890 or the SUBREG, as appropriate, to the pseudo. */
1893 fixup_var_refs_1 (rtx var, enum machine_mode promoted_mode, rtx *loc, rtx insn,
1894 struct fixup_replacement **replacements, rtx no_share)
1898 RTX_CODE code = GET_CODE (x);
1901 struct fixup_replacement *replacement;
1906 if (XEXP (x, 0) == var)
1908 /* Prevent sharing of rtl that might lose. */
1909 rtx sub = copy_rtx (XEXP (var, 0));
1911 if (! validate_change (insn, loc, sub, 0))
1913 rtx y = gen_reg_rtx (GET_MODE (sub));
1916 /* We should be able to replace with a register or all is lost.
1917 Note that we can't use validate_change to verify this, since
1918 we're not caring for replacing all dups simultaneously. */
1919 if (! validate_replace_rtx (*loc, y, insn))
1922 /* Careful! First try to recognize a direct move of the
1923 value, mimicking how things are done in gen_reload wrt
1924 PLUS. Consider what happens when insn is a conditional
1925 move instruction and addsi3 clobbers flags. */
1928 new_insn = emit_insn (gen_rtx_SET (VOIDmode, y, sub));
1932 if (recog_memoized (new_insn) < 0)
1934 /* That failed. Fall back on force_operand and hope. */
1937 sub = force_operand (sub, y);
1939 emit_insn (gen_move_insn (y, sub));
1945 /* Don't separate setter from user. */
1946 if (PREV_INSN (insn) && sets_cc0_p (PREV_INSN (insn)))
1947 insn = PREV_INSN (insn);
1950 emit_insn_before (seq, insn);
1958 /* If we already have a replacement, use it. Otherwise,
1959 try to fix up this address in case it is invalid. */
1961 replacement = find_fixup_replacement (replacements, var);
1962 if (replacement->new)
1964 *loc = replacement->new;
1968 *loc = replacement->new = x = fixup_stack_1 (x, insn);
1970 /* Unless we are forcing memory to register or we changed the mode,
1971 we can leave things the way they are if the insn is valid. */
1973 INSN_CODE (insn) = -1;
1974 if (! flag_force_mem && GET_MODE (x) == promoted_mode
1975 && recog_memoized (insn) >= 0)
1978 *loc = replacement->new = gen_reg_rtx (promoted_mode);
1982 /* If X contains VAR, we need to unshare it here so that we update
1983 each occurrence separately. But all identical MEMs in one insn
1984 must be replaced with the same rtx because of the possibility of
1987 if (reg_mentioned_p (var, x))
1989 replacement = find_fixup_replacement (replacements, x);
1990 if (replacement->new == 0)
1991 replacement->new = copy_most_rtx (x, no_share);
1993 *loc = x = replacement->new;
1994 code = GET_CODE (x);
2011 /* Note that in some cases those types of expressions are altered
2012 by optimize_bit_field, and do not survive to get here. */
2013 if (XEXP (x, 0) == var
2014 || (GET_CODE (XEXP (x, 0)) == SUBREG
2015 && SUBREG_REG (XEXP (x, 0)) == var))
2017 /* Get TEM as a valid MEM in the mode presently in the insn.
2019 We don't worry about the possibility of MATCH_DUP here; it
2020 is highly unlikely and would be tricky to handle. */
2023 if (GET_CODE (tem) == SUBREG)
2025 if (GET_MODE_BITSIZE (GET_MODE (tem))
2026 > GET_MODE_BITSIZE (GET_MODE (var)))
2028 replacement = find_fixup_replacement (replacements, var);
2029 if (replacement->new == 0)
2030 replacement->new = gen_reg_rtx (GET_MODE (var));
2031 SUBREG_REG (tem) = replacement->new;
2033 /* The following code works only if we have a MEM, so we
2034 need to handle the subreg here. We directly substitute
2035 it assuming that a subreg must be OK here. We already
2036 scheduled a replacement to copy the mem into the
2042 tem = fixup_memory_subreg (tem, insn, promoted_mode, 0);
2045 tem = fixup_stack_1 (tem, insn);
2047 /* Unless we want to load from memory, get TEM into the proper mode
2048 for an extract from memory. This can only be done if the
2049 extract is at a constant position and length. */
2051 if (! flag_force_mem && GET_CODE (XEXP (x, 1)) == CONST_INT
2052 && GET_CODE (XEXP (x, 2)) == CONST_INT
2053 && ! mode_dependent_address_p (XEXP (tem, 0))
2054 && ! MEM_VOLATILE_P (tem))
2056 enum machine_mode wanted_mode = VOIDmode;
2057 enum machine_mode is_mode = GET_MODE (tem);
2058 HOST_WIDE_INT pos = INTVAL (XEXP (x, 2));
2060 if (GET_CODE (x) == ZERO_EXTRACT)
2062 enum machine_mode new_mode
2063 = mode_for_extraction (EP_extzv, 1);
2064 if (new_mode != MAX_MACHINE_MODE)
2065 wanted_mode = new_mode;
2067 else if (GET_CODE (x) == SIGN_EXTRACT)
2069 enum machine_mode new_mode
2070 = mode_for_extraction (EP_extv, 1);
2071 if (new_mode != MAX_MACHINE_MODE)
2072 wanted_mode = new_mode;
2075 /* If we have a narrower mode, we can do something. */
2076 if (wanted_mode != VOIDmode
2077 && GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2079 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2080 rtx old_pos = XEXP (x, 2);
2083 /* If the bytes and bits are counted differently, we
2084 must adjust the offset. */
2085 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2086 offset = (GET_MODE_SIZE (is_mode)
2087 - GET_MODE_SIZE (wanted_mode) - offset);
2089 pos %= GET_MODE_BITSIZE (wanted_mode);
2091 newmem = adjust_address_nv (tem, wanted_mode, offset);
2093 /* Make the change and see if the insn remains valid. */
2094 INSN_CODE (insn) = -1;
2095 XEXP (x, 0) = newmem;
2096 XEXP (x, 2) = GEN_INT (pos);
2098 if (recog_memoized (insn) >= 0)
2101 /* Otherwise, restore old position. XEXP (x, 0) will be
2103 XEXP (x, 2) = old_pos;
2107 /* If we get here, the bitfield extract insn can't accept a memory
2108 reference. Copy the input into a register. */
2110 tem1 = gen_reg_rtx (GET_MODE (tem));
2111 emit_insn_before (gen_move_insn (tem1, tem), insn);
2118 if (SUBREG_REG (x) == var)
2120 /* If this is a special SUBREG made because VAR was promoted
2121 from a wider mode, replace it with VAR and call ourself
2122 recursively, this time saying that the object previously
2123 had its current mode (by virtue of the SUBREG). */
2125 if (SUBREG_PROMOTED_VAR_P (x))
2128 fixup_var_refs_1 (var, GET_MODE (var), loc, insn, replacements,
2133 /* If this SUBREG makes VAR wider, it has become a paradoxical
2134 SUBREG with VAR in memory, but these aren't allowed at this
2135 stage of the compilation. So load VAR into a pseudo and take
2136 a SUBREG of that pseudo. */
2137 if (GET_MODE_SIZE (GET_MODE (x)) > GET_MODE_SIZE (GET_MODE (var)))
2139 replacement = find_fixup_replacement (replacements, var);
2140 if (replacement->new == 0)
2141 replacement->new = gen_reg_rtx (promoted_mode);
2142 SUBREG_REG (x) = replacement->new;
2146 /* See if we have already found a replacement for this SUBREG.
2147 If so, use it. Otherwise, make a MEM and see if the insn
2148 is recognized. If not, or if we should force MEM into a register,
2149 make a pseudo for this SUBREG. */
2150 replacement = find_fixup_replacement (replacements, x);
2151 if (replacement->new)
2153 enum machine_mode mode = GET_MODE (x);
2154 *loc = replacement->new;
2156 /* Careful! We may have just replaced a SUBREG by a MEM, which
2157 means that the insn may have become invalid again. We can't
2158 in this case make a new replacement since we already have one
2159 and we must deal with MATCH_DUPs. */
2160 if (MEM_P (replacement->new))
2162 INSN_CODE (insn) = -1;
2163 if (recog_memoized (insn) >= 0)
2166 fixup_var_refs_1 (replacement->new, mode, &PATTERN (insn),
2167 insn, replacements, no_share);
2173 replacement->new = *loc = fixup_memory_subreg (x, insn,
2176 INSN_CODE (insn) = -1;
2177 if (! flag_force_mem && recog_memoized (insn) >= 0)
2180 *loc = replacement->new = gen_reg_rtx (GET_MODE (x));
2186 /* First do special simplification of bit-field references. */
2187 if (GET_CODE (SET_DEST (x)) == SIGN_EXTRACT
2188 || GET_CODE (SET_DEST (x)) == ZERO_EXTRACT)
2189 optimize_bit_field (x, insn, 0);
2190 if (GET_CODE (SET_SRC (x)) == SIGN_EXTRACT
2191 || GET_CODE (SET_SRC (x)) == ZERO_EXTRACT)
2192 optimize_bit_field (x, insn, 0);
2194 /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object
2195 into a register and then store it back out. */
2196 if (GET_CODE (SET_DEST (x)) == ZERO_EXTRACT
2197 && GET_CODE (XEXP (SET_DEST (x), 0)) == SUBREG
2198 && SUBREG_REG (XEXP (SET_DEST (x), 0)) == var
2199 && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x), 0)))
2200 > GET_MODE_SIZE (GET_MODE (var))))
2202 replacement = find_fixup_replacement (replacements, var);
2203 if (replacement->new == 0)
2204 replacement->new = gen_reg_rtx (GET_MODE (var));
2206 SUBREG_REG (XEXP (SET_DEST (x), 0)) = replacement->new;
2207 emit_insn_after (gen_move_insn (var, replacement->new), insn);
2210 /* If SET_DEST is now a paradoxical SUBREG, put the result of this
2211 insn into a pseudo and store the low part of the pseudo into VAR. */
2212 if (GET_CODE (SET_DEST (x)) == SUBREG
2213 && SUBREG_REG (SET_DEST (x)) == var
2214 && (GET_MODE_SIZE (GET_MODE (SET_DEST (x)))
2215 > GET_MODE_SIZE (GET_MODE (var))))
2217 SET_DEST (x) = tem = gen_reg_rtx (GET_MODE (SET_DEST (x)));
2218 emit_insn_after (gen_move_insn (var, gen_lowpart (GET_MODE (var),
2225 rtx dest = SET_DEST (x);
2226 rtx src = SET_SRC (x);
2227 rtx outerdest = dest;
2229 while (GET_CODE (dest) == SUBREG || GET_CODE (dest) == STRICT_LOW_PART
2230 || GET_CODE (dest) == SIGN_EXTRACT
2231 || GET_CODE (dest) == ZERO_EXTRACT)
2232 dest = XEXP (dest, 0);
2234 if (GET_CODE (src) == SUBREG)
2235 src = SUBREG_REG (src);
2237 /* If VAR does not appear at the top level of the SET
2238 just scan the lower levels of the tree. */
2240 if (src != var && dest != var)
2243 /* We will need to rerecognize this insn. */
2244 INSN_CODE (insn) = -1;
2246 if (GET_CODE (outerdest) == ZERO_EXTRACT && dest == var
2247 && mode_for_extraction (EP_insv, -1) != MAX_MACHINE_MODE)
2249 /* Since this case will return, ensure we fixup all the
2251 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 1),
2252 insn, replacements, no_share);
2253 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 2),
2254 insn, replacements, no_share);
2255 fixup_var_refs_1 (var, promoted_mode, &SET_SRC (x),
2256 insn, replacements, no_share);
2258 tem = XEXP (outerdest, 0);
2260 /* Clean up (SUBREG:SI (MEM:mode ...) 0)
2261 that may appear inside a ZERO_EXTRACT.
2262 This was legitimate when the MEM was a REG. */
2263 if (GET_CODE (tem) == SUBREG
2264 && SUBREG_REG (tem) == var)
2265 tem = fixup_memory_subreg (tem, insn, promoted_mode, 0);
2267 tem = fixup_stack_1 (tem, insn);
2269 if (GET_CODE (XEXP (outerdest, 1)) == CONST_INT
2270 && GET_CODE (XEXP (outerdest, 2)) == CONST_INT
2271 && ! mode_dependent_address_p (XEXP (tem, 0))
2272 && ! MEM_VOLATILE_P (tem))
2274 enum machine_mode wanted_mode;
2275 enum machine_mode is_mode = GET_MODE (tem);
2276 HOST_WIDE_INT pos = INTVAL (XEXP (outerdest, 2));
2278 wanted_mode = mode_for_extraction (EP_insv, 0);
2280 /* If we have a narrower mode, we can do something. */
2281 if (GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2283 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2284 rtx old_pos = XEXP (outerdest, 2);
2287 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2288 offset = (GET_MODE_SIZE (is_mode)
2289 - GET_MODE_SIZE (wanted_mode) - offset);
2291 pos %= GET_MODE_BITSIZE (wanted_mode);
2293 newmem = adjust_address_nv (tem, wanted_mode, offset);
2295 /* Make the change and see if the insn remains valid. */
2296 INSN_CODE (insn) = -1;
2297 XEXP (outerdest, 0) = newmem;
2298 XEXP (outerdest, 2) = GEN_INT (pos);
2300 if (recog_memoized (insn) >= 0)
2303 /* Otherwise, restore old position. XEXP (x, 0) will be
2305 XEXP (outerdest, 2) = old_pos;
2309 /* If we get here, the bit-field store doesn't allow memory
2310 or isn't located at a constant position. Load the value into
2311 a register, do the store, and put it back into memory. */
2313 tem1 = gen_reg_rtx (GET_MODE (tem));
2314 emit_insn_before (gen_move_insn (tem1, tem), insn);
2315 emit_insn_after (gen_move_insn (tem, tem1), insn);
2316 XEXP (outerdest, 0) = tem1;
2320 /* STRICT_LOW_PART is a no-op on memory references
2321 and it can cause combinations to be unrecognizable,
2324 if (dest == var && GET_CODE (SET_DEST (x)) == STRICT_LOW_PART)
2325 SET_DEST (x) = XEXP (SET_DEST (x), 0);
2327 /* A valid insn to copy VAR into or out of a register
2328 must be left alone, to avoid an infinite loop here.
2329 If the reference to VAR is by a subreg, fix that up,
2330 since SUBREG is not valid for a memref.
2331 Also fix up the address of the stack slot.
2333 Note that we must not try to recognize the insn until
2334 after we know that we have valid addresses and no
2335 (subreg (mem ...) ...) constructs, since these interfere
2336 with determining the validity of the insn. */
2338 if ((SET_SRC (x) == var
2339 || (GET_CODE (SET_SRC (x)) == SUBREG
2340 && SUBREG_REG (SET_SRC (x)) == var))
2341 && (REG_P (SET_DEST (x))
2342 || (GET_CODE (SET_DEST (x)) == SUBREG
2343 && REG_P (SUBREG_REG (SET_DEST (x)))))
2344 && GET_MODE (var) == promoted_mode
2345 && x == single_set (insn))
2349 if (GET_CODE (SET_SRC (x)) == SUBREG
2350 && (GET_MODE_SIZE (GET_MODE (SET_SRC (x)))
2351 > GET_MODE_SIZE (GET_MODE (var))))
2353 /* This (subreg VAR) is now a paradoxical subreg. We need
2354 to replace VAR instead of the subreg. */
2355 replacement = find_fixup_replacement (replacements, var);
2356 if (replacement->new == NULL_RTX)
2357 replacement->new = gen_reg_rtx (GET_MODE (var));
2358 SUBREG_REG (SET_SRC (x)) = replacement->new;
2362 replacement = find_fixup_replacement (replacements, SET_SRC (x));
2363 if (replacement->new)
2364 SET_SRC (x) = replacement->new;
2365 else if (GET_CODE (SET_SRC (x)) == SUBREG)
2366 SET_SRC (x) = replacement->new
2367 = fixup_memory_subreg (SET_SRC (x), insn, promoted_mode,
2370 SET_SRC (x) = replacement->new
2371 = fixup_stack_1 (SET_SRC (x), insn);
2374 if (recog_memoized (insn) >= 0)
2377 /* INSN is not valid, but we know that we want to
2378 copy SET_SRC (x) to SET_DEST (x) in some way. So
2379 we generate the move and see whether it requires more
2380 than one insn. If it does, we emit those insns and
2381 delete INSN. Otherwise, we can just replace the pattern
2382 of INSN; we have already verified above that INSN has
2383 no other function that to do X. */
2385 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2386 if (NEXT_INSN (pat) != NULL_RTX)
2388 last = emit_insn_before (pat, insn);
2390 /* INSN might have REG_RETVAL or other important notes, so
2391 we need to store the pattern of the last insn in the
2392 sequence into INSN similarly to the normal case. LAST
2393 should not have REG_NOTES, but we allow them if INSN has
2395 if (REG_NOTES (last) && REG_NOTES (insn))
2397 if (REG_NOTES (last))
2398 REG_NOTES (insn) = REG_NOTES (last);
2399 PATTERN (insn) = PATTERN (last);
2404 PATTERN (insn) = PATTERN (pat);
2409 if ((SET_DEST (x) == var
2410 || (GET_CODE (SET_DEST (x)) == SUBREG
2411 && SUBREG_REG (SET_DEST (x)) == var))
2412 && (REG_P (SET_SRC (x))
2413 || (GET_CODE (SET_SRC (x)) == SUBREG
2414 && REG_P (SUBREG_REG (SET_SRC (x)))))
2415 && GET_MODE (var) == promoted_mode
2416 && x == single_set (insn))
2420 if (GET_CODE (SET_DEST (x)) == SUBREG)
2421 SET_DEST (x) = fixup_memory_subreg (SET_DEST (x), insn,
2424 SET_DEST (x) = fixup_stack_1 (SET_DEST (x), insn);
2426 if (recog_memoized (insn) >= 0)
2429 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2430 if (NEXT_INSN (pat) != NULL_RTX)
2432 last = emit_insn_before (pat, insn);
2434 /* INSN might have REG_RETVAL or other important notes, so
2435 we need to store the pattern of the last insn in the
2436 sequence into INSN similarly to the normal case. LAST
2437 should not have REG_NOTES, but we allow them if INSN has
2439 if (REG_NOTES (last) && REG_NOTES (insn))
2441 if (REG_NOTES (last))
2442 REG_NOTES (insn) = REG_NOTES (last);
2443 PATTERN (insn) = PATTERN (last);
2448 PATTERN (insn) = PATTERN (pat);
2453 /* Otherwise, storing into VAR must be handled specially
2454 by storing into a temporary and copying that into VAR
2455 with a new insn after this one. Note that this case
2456 will be used when storing into a promoted scalar since
2457 the insn will now have different modes on the input
2458 and output and hence will be invalid (except for the case
2459 of setting it to a constant, which does not need any
2460 change if it is valid). We generate extra code in that case,
2461 but combine.c will eliminate it. */
2466 rtx fixeddest = SET_DEST (x);
2467 enum machine_mode temp_mode;
2469 /* STRICT_LOW_PART can be discarded, around a MEM. */
2470 if (GET_CODE (fixeddest) == STRICT_LOW_PART)
2471 fixeddest = XEXP (fixeddest, 0);
2472 /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */
2473 if (GET_CODE (fixeddest) == SUBREG)
2475 fixeddest = fixup_memory_subreg (fixeddest, insn,
2477 temp_mode = GET_MODE (fixeddest);
2481 fixeddest = fixup_stack_1 (fixeddest, insn);
2482 temp_mode = promoted_mode;
2485 temp = gen_reg_rtx (temp_mode);
2487 emit_insn_after (gen_move_insn (fixeddest,
2488 gen_lowpart (GET_MODE (fixeddest),
2492 SET_DEST (x) = temp;
2500 /* Nothing special about this RTX; fix its operands. */
2502 fmt = GET_RTX_FORMAT (code);
2503 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2506 fixup_var_refs_1 (var, promoted_mode, &XEXP (x, i), insn, replacements,
2508 else if (fmt[i] == 'E')
2511 for (j = 0; j < XVECLEN (x, i); j++)
2512 fixup_var_refs_1 (var, promoted_mode, &XVECEXP (x, i, j),
2513 insn, replacements, no_share);
2518 /* Previously, X had the form (SUBREG:m1 (REG:PROMOTED_MODE ...)).
2519 The REG was placed on the stack, so X now has the form (SUBREG:m1
2522 Return an rtx (MEM:m1 newaddr) which is equivalent. If any insns
2523 must be emitted to compute NEWADDR, put them before INSN.
2525 UNCRITICAL nonzero means accept paradoxical subregs.
2526 This is used for subregs found inside REG_NOTES. */
2529 fixup_memory_subreg (rtx x, rtx insn, enum machine_mode promoted_mode, int uncritical)
2532 rtx mem = SUBREG_REG (x);
2533 rtx addr = XEXP (mem, 0);
2534 enum machine_mode mode = GET_MODE (x);
2537 /* Paradoxical SUBREGs are usually invalid during RTL generation. */
2538 if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (GET_MODE (mem)) && ! uncritical)
2541 offset = SUBREG_BYTE (x);
2542 if (BYTES_BIG_ENDIAN)
2543 /* If the PROMOTED_MODE is wider than the mode of the MEM, adjust
2544 the offset so that it points to the right location within the
2546 offset -= (GET_MODE_SIZE (promoted_mode) - GET_MODE_SIZE (GET_MODE (mem)));
2548 if (!flag_force_addr
2549 && memory_address_p (mode, plus_constant (addr, offset)))
2550 /* Shortcut if no insns need be emitted. */
2551 return adjust_address (mem, mode, offset);
2554 result = adjust_address (mem, mode, offset);
2558 emit_insn_before (seq, insn);
2562 /* Do fixup_memory_subreg on all (SUBREG (VAR) ...) contained in X.
2563 VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
2564 Replace subexpressions of X in place.
2565 If X itself is a (SUBREG (VAR) ...), return the replacement expression.
2566 Otherwise return X, with its contents possibly altered.
2568 INSN and UNCRITICAL are as for fixup_memory_subreg. */
2571 walk_fixup_memory_subreg (rtx x, rtx insn, rtx var,
2572 enum machine_mode promoted_mode, int uncritical)
2581 code = GET_CODE (x);
2583 if (code == SUBREG && SUBREG_REG (x) == var)
2584 return fixup_memory_subreg (x, insn, promoted_mode, uncritical);
2586 /* Nothing special about this RTX; fix its operands. */
2588 fmt = GET_RTX_FORMAT (code);
2589 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2592 XEXP (x, i) = walk_fixup_memory_subreg (XEXP (x, i), insn, var,
2593 promoted_mode, uncritical);
2594 else if (fmt[i] == 'E')
2597 for (j = 0; j < XVECLEN (x, i); j++)
2599 = walk_fixup_memory_subreg (XVECEXP (x, i, j), insn, var,
2600 promoted_mode, uncritical);
2606 /* For each memory ref within X, if it refers to a stack slot
2607 with an out of range displacement, put the address in a temp register
2608 (emitting new insns before INSN to load these registers)
2609 and alter the memory ref to use that register.
2610 Replace each such MEM rtx with a copy, to avoid clobberage. */
2613 fixup_stack_1 (rtx x, rtx insn)
2616 RTX_CODE code = GET_CODE (x);
2621 rtx ad = XEXP (x, 0);
2622 /* If we have address of a stack slot but it's not valid
2623 (displacement is too large), compute the sum in a register. */
2624 if (GET_CODE (ad) == PLUS
2625 && REG_P (XEXP (ad, 0))
2626 && ((REGNO (XEXP (ad, 0)) >= FIRST_VIRTUAL_REGISTER
2627 && REGNO (XEXP (ad, 0)) <= LAST_VIRTUAL_REGISTER)
2628 || REGNO (XEXP (ad, 0)) == FRAME_POINTER_REGNUM
2629 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2630 || REGNO (XEXP (ad, 0)) == HARD_FRAME_POINTER_REGNUM
2632 || REGNO (XEXP (ad, 0)) == STACK_POINTER_REGNUM
2633 || REGNO (XEXP (ad, 0)) == ARG_POINTER_REGNUM
2634 || XEXP (ad, 0) == current_function_internal_arg_pointer)
2635 && GET_CODE (XEXP (ad, 1)) == CONST_INT)
2638 if (memory_address_p (GET_MODE (x), ad))
2642 temp = copy_to_reg (ad);
2645 emit_insn_before (seq, insn);
2646 return replace_equiv_address (x, temp);
2651 fmt = GET_RTX_FORMAT (code);
2652 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2655 XEXP (x, i) = fixup_stack_1 (XEXP (x, i), insn);
2656 else if (fmt[i] == 'E')
2659 for (j = 0; j < XVECLEN (x, i); j++)
2660 XVECEXP (x, i, j) = fixup_stack_1 (XVECEXP (x, i, j), insn);
2666 /* Optimization: a bit-field instruction whose field
2667 happens to be a byte or halfword in memory
2668 can be changed to a move instruction.
2670 We call here when INSN is an insn to examine or store into a bit-field.
2671 BODY is the SET-rtx to be altered.
2673 EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0.
2674 (Currently this is called only from function.c, and EQUIV_MEM
2678 optimize_bit_field (rtx body, rtx insn, rtx *equiv_mem)
2683 enum machine_mode mode;
2685 if (GET_CODE (SET_DEST (body)) == SIGN_EXTRACT
2686 || GET_CODE (SET_DEST (body)) == ZERO_EXTRACT)
2687 bitfield = SET_DEST (body), destflag = 1;
2689 bitfield = SET_SRC (body), destflag = 0;
2691 /* First check that the field being stored has constant size and position
2692 and is in fact a byte or halfword suitably aligned. */
2694 if (GET_CODE (XEXP (bitfield, 1)) == CONST_INT
2695 && GET_CODE (XEXP (bitfield, 2)) == CONST_INT
2696 && ((mode = mode_for_size (INTVAL (XEXP (bitfield, 1)), MODE_INT, 1))
2698 && INTVAL (XEXP (bitfield, 2)) % INTVAL (XEXP (bitfield, 1)) == 0)
2702 /* Now check that the containing word is memory, not a register,
2703 and that it is safe to change the machine mode. */
2705 if (MEM_P (XEXP (bitfield, 0)))
2706 memref = XEXP (bitfield, 0);
2707 else if (REG_P (XEXP (bitfield, 0))
2709 memref = equiv_mem[REGNO (XEXP (bitfield, 0))];
2710 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2711 && MEM_P (SUBREG_REG (XEXP (bitfield, 0))))
2712 memref = SUBREG_REG (XEXP (bitfield, 0));
2713 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2715 && REG_P (SUBREG_REG (XEXP (bitfield, 0))))
2716 memref = equiv_mem[REGNO (SUBREG_REG (XEXP (bitfield, 0)))];
2719 && ! mode_dependent_address_p (XEXP (memref, 0))
2720 && ! MEM_VOLATILE_P (memref))
2722 /* Now adjust the address, first for any subreg'ing
2723 that we are now getting rid of,
2724 and then for which byte of the word is wanted. */
2726 HOST_WIDE_INT offset = INTVAL (XEXP (bitfield, 2));
2729 /* Adjust OFFSET to count bits from low-address byte. */
2730 if (BITS_BIG_ENDIAN != BYTES_BIG_ENDIAN)
2731 offset = (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield, 0)))
2732 - offset - INTVAL (XEXP (bitfield, 1)));
2734 /* Adjust OFFSET to count bytes from low-address byte. */
2735 offset /= BITS_PER_UNIT;
2736 if (GET_CODE (XEXP (bitfield, 0)) == SUBREG)
2738 offset += (SUBREG_BYTE (XEXP (bitfield, 0))
2739 / UNITS_PER_WORD) * UNITS_PER_WORD;
2740 if (BYTES_BIG_ENDIAN)
2741 offset -= (MIN (UNITS_PER_WORD,
2742 GET_MODE_SIZE (GET_MODE (XEXP (bitfield, 0))))
2743 - MIN (UNITS_PER_WORD,
2744 GET_MODE_SIZE (GET_MODE (memref))));
2748 memref = adjust_address (memref, mode, offset);
2749 insns = get_insns ();
2751 emit_insn_before (insns, insn);
2753 /* Store this memory reference where
2754 we found the bit field reference. */
2758 validate_change (insn, &SET_DEST (body), memref, 1);
2759 if (! CONSTANT_ADDRESS_P (SET_SRC (body)))
2761 rtx src = SET_SRC (body);
2762 while (GET_CODE (src) == SUBREG
2763 && SUBREG_BYTE (src) == 0)
2764 src = SUBREG_REG (src);
2765 if (GET_MODE (src) != GET_MODE (memref))
2766 src = gen_lowpart (GET_MODE (memref), SET_SRC (body));
2767 validate_change (insn, &SET_SRC (body), src, 1);
2769 else if (GET_MODE (SET_SRC (body)) != VOIDmode
2770 && GET_MODE (SET_SRC (body)) != GET_MODE (memref))
2771 /* This shouldn't happen because anything that didn't have
2772 one of these modes should have got converted explicitly
2773 and then referenced through a subreg.
2774 This is so because the original bit-field was
2775 handled by agg_mode and so its tree structure had
2776 the same mode that memref now has. */
2781 rtx dest = SET_DEST (body);
2783 while (GET_CODE (dest) == SUBREG
2784 && SUBREG_BYTE (dest) == 0
2785 && (GET_MODE_CLASS (GET_MODE (dest))
2786 == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest))))
2787 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2789 dest = SUBREG_REG (dest);
2791 validate_change (insn, &SET_DEST (body), dest, 1);
2793 if (GET_MODE (dest) == GET_MODE (memref))
2794 validate_change (insn, &SET_SRC (body), memref, 1);
2797 /* Convert the mem ref to the destination mode. */
2798 rtx newreg = gen_reg_rtx (GET_MODE (dest));
2801 convert_move (newreg, memref,
2802 GET_CODE (SET_SRC (body)) == ZERO_EXTRACT);
2806 validate_change (insn, &SET_SRC (body), newreg, 1);
2810 /* See if we can convert this extraction or insertion into
2811 a simple move insn. We might not be able to do so if this
2812 was, for example, part of a PARALLEL.
2814 If we succeed, write out any needed conversions. If we fail,
2815 it is hard to guess why we failed, so don't do anything
2816 special; just let the optimization be suppressed. */
2818 if (apply_change_group () && seq)
2819 emit_insn_before (seq, insn);
2824 /* These routines are responsible for converting virtual register references
2825 to the actual hard register references once RTL generation is complete.
2827 The following four variables are used for communication between the
2828 routines. They contain the offsets of the virtual registers from their
2829 respective hard registers. */
2831 static int in_arg_offset;
2832 static int var_offset;
2833 static int dynamic_offset;
2834 static int out_arg_offset;
2835 static int cfa_offset;
2837 /* In most machines, the stack pointer register is equivalent to the bottom
2840 #ifndef STACK_POINTER_OFFSET
2841 #define STACK_POINTER_OFFSET 0
2844 /* If not defined, pick an appropriate default for the offset of dynamically
2845 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
2846 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
2848 #ifndef STACK_DYNAMIC_OFFSET
2850 /* The bottom of the stack points to the actual arguments. If
2851 REG_PARM_STACK_SPACE is defined, this includes the space for the register
2852 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
2853 stack space for register parameters is not pushed by the caller, but
2854 rather part of the fixed stack areas and hence not included in
2855 `current_function_outgoing_args_size'. Nevertheless, we must allow
2856 for it when allocating stack dynamic objects. */
2858 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2859 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2860 ((ACCUMULATE_OUTGOING_ARGS \
2861 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
2862 + (STACK_POINTER_OFFSET)) \
2865 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2866 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
2867 + (STACK_POINTER_OFFSET))
2871 /* On most machines, the CFA coincides with the first incoming parm. */
2873 #ifndef ARG_POINTER_CFA_OFFSET
2874 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
2877 /* Build up a (MEM (ADDRESSOF (REG))) rtx for a register REG that just
2878 had its address taken. DECL is the decl or SAVE_EXPR for the
2879 object stored in the register, for later use if we do need to force
2880 REG into the stack. REG is overwritten by the MEM like in
2881 put_reg_into_stack. RESCAN is true if previously emitted
2882 instructions must be rescanned and modified now that the REG has
2883 been transformed. */
2886 gen_mem_addressof (rtx reg, tree decl, int rescan)
2888 rtx r = gen_rtx_ADDRESSOF (Pmode, gen_reg_rtx (GET_MODE (reg)),
2891 /* Calculate this before we start messing with decl's RTL. */
2892 HOST_WIDE_INT set = decl ? get_alias_set (decl) : 0;
2894 /* If the original REG was a user-variable, then so is the REG whose
2895 address is being taken. Likewise for unchanging. */
2896 REG_USERVAR_P (XEXP (r, 0)) = REG_USERVAR_P (reg);
2897 RTX_UNCHANGING_P (XEXP (r, 0)) = RTX_UNCHANGING_P (reg);
2899 PUT_CODE (reg, MEM);
2900 MEM_VOLATILE_P (reg) = 0;
2901 MEM_ATTRS (reg) = 0;
2906 tree type = TREE_TYPE (decl);
2907 enum machine_mode decl_mode
2908 = (DECL_P (decl) ? DECL_MODE (decl) : TYPE_MODE (TREE_TYPE (decl)));
2909 rtx decl_rtl = (TREE_CODE (decl) == SAVE_EXPR ? SAVE_EXPR_RTL (decl)
2910 : DECL_RTL_IF_SET (decl));
2912 PUT_MODE (reg, decl_mode);
2914 /* Clear DECL_RTL momentarily so functions below will work
2915 properly, then set it again. */
2916 if (DECL_P (decl) && decl_rtl == reg)
2917 SET_DECL_RTL (decl, 0);
2919 set_mem_attributes (reg, decl, 1);
2920 set_mem_alias_set (reg, set);
2922 if (DECL_P (decl) && decl_rtl == reg)
2923 SET_DECL_RTL (decl, reg);
2926 && (TREE_USED (decl) || (DECL_P (decl) && DECL_INITIAL (decl) != 0)))
2927 fixup_var_refs (reg, GET_MODE (reg), TYPE_UNSIGNED (type), reg, 0);
2931 /* This can only happen during reload. Clear the same flag bits as
2933 RTX_UNCHANGING_P (reg) = 0;
2934 MEM_IN_STRUCT_P (reg) = 0;
2935 MEM_SCALAR_P (reg) = 0;
2937 fixup_var_refs (reg, GET_MODE (reg), 0, reg, 0);
2943 /* If DECL has an RTL that is an ADDRESSOF rtx, put it into the stack. */
2946 flush_addressof (tree decl)
2948 if ((TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == VAR_DECL)
2949 && DECL_RTL (decl) != 0
2950 && MEM_P (DECL_RTL (decl))
2951 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF
2952 && REG_P (XEXP (XEXP (DECL_RTL (decl), 0), 0)))
2953 put_addressof_into_stack (XEXP (DECL_RTL (decl), 0), 0);
2956 /* Force the register pointed to by R, an ADDRESSOF rtx, into the stack. */
2959 put_addressof_into_stack (rtx r, htab_t ht)
2962 bool volatile_p, used_p;
2964 rtx reg = XEXP (r, 0);
2969 decl = ADDRESSOF_DECL (r);
2972 type = TREE_TYPE (decl);
2973 volatile_p = (TREE_CODE (decl) != SAVE_EXPR
2974 && TREE_THIS_VOLATILE (decl));
2975 used_p = (TREE_USED (decl)
2976 || (DECL_P (decl) && DECL_INITIAL (decl) != 0));
2985 put_reg_into_stack (0, reg, type, GET_MODE (reg), ADDRESSOF_REGNO (r),
2986 volatile_p, used_p, false, ht);
2989 /* List of replacements made below in purge_addressof_1 when creating
2990 bitfield insertions. */
2991 static rtx purge_bitfield_addressof_replacements;
2993 /* List of replacements made below in purge_addressof_1 for patterns
2994 (MEM (ADDRESSOF (REG ...))). The key of the list entry is the
2995 corresponding (ADDRESSOF (REG ...)) and value is a substitution for
2996 the all pattern. List PURGE_BITFIELD_ADDRESSOF_REPLACEMENTS is not
2997 enough in complex cases, e.g. when some field values can be
2998 extracted by usage MEM with narrower mode. */
2999 static rtx purge_addressof_replacements;
3001 /* Helper function for purge_addressof. See if the rtx expression at *LOC
3002 in INSN needs to be changed. If FORCE, always put any ADDRESSOFs into
3003 the stack. If the function returns FALSE then the replacement could not
3004 be made. If MAY_POSTPONE is true and we would not put the addressof
3005 to stack, postpone processing of the insn. */
3008 purge_addressof_1 (rtx *loc, rtx insn, int force, int store, int may_postpone,
3016 bool libcall = false;
3018 /* Re-start here to avoid recursion in common cases. */
3025 /* Is this a libcall? */
3027 libcall = REG_NOTE_KIND (*loc) == REG_RETVAL;
3029 code = GET_CODE (x);
3031 /* If we don't return in any of the cases below, we will recurse inside
3032 the RTX, which will normally result in any ADDRESSOF being forced into
3036 result = purge_addressof_1 (&SET_DEST (x), insn, force, 1,
3038 result &= purge_addressof_1 (&SET_SRC (x), insn, force, 0,
3042 else if (code == ADDRESSOF)
3046 if (!MEM_P (XEXP (x, 0)))
3047 put_addressof_into_stack (x, ht);
3049 /* We must create a copy of the rtx because it was created by
3050 overwriting a REG rtx which is always shared. */
3051 sub = copy_rtx (XEXP (XEXP (x, 0), 0));
3052 if (validate_change (insn, loc, sub, 0)
3053 || validate_replace_rtx (x, sub, insn))
3058 /* If SUB is a hard or virtual register, try it as a pseudo-register.
3059 Otherwise, perhaps SUB is an expression, so generate code to compute
3061 if (REG_P (sub) && REGNO (sub) <= LAST_VIRTUAL_REGISTER)
3062 sub = copy_to_reg (sub);
3064 sub = force_operand (sub, NULL_RTX);
3066 if (! validate_change (insn, loc, sub, 0)
3067 && ! validate_replace_rtx (x, sub, insn))
3070 insns = get_insns ();
3072 emit_insn_before (insns, insn);
3076 else if (code == MEM && GET_CODE (XEXP (x, 0)) == ADDRESSOF && ! force)
3078 rtx sub = XEXP (XEXP (x, 0), 0);
3081 sub = adjust_address_nv (sub, GET_MODE (x), 0);
3082 else if (REG_P (sub)
3083 && (MEM_VOLATILE_P (x) || GET_MODE (x) == BLKmode))
3085 else if (REG_P (sub) && GET_MODE (x) != GET_MODE (sub))
3087 int size_x, size_sub;
3091 /* Postpone for now, so that we do not emit bitfield arithmetics
3092 unless there is some benefit from it. */
3093 if (!postponed_insns || XEXP (postponed_insns, 0) != insn)
3094 postponed_insns = alloc_INSN_LIST (insn, postponed_insns);
3100 /* When processing REG_NOTES look at the list of
3101 replacements done on the insn to find the register that X
3105 for (tem = purge_bitfield_addressof_replacements;
3107 tem = XEXP (XEXP (tem, 1), 1))
3108 if (rtx_equal_p (x, XEXP (tem, 0)))
3110 *loc = XEXP (XEXP (tem, 1), 0);
3114 /* See comment for purge_addressof_replacements. */
3115 for (tem = purge_addressof_replacements;
3117 tem = XEXP (XEXP (tem, 1), 1))
3118 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3120 rtx z = XEXP (XEXP (tem, 1), 0);
3122 if (GET_MODE (x) == GET_MODE (z)
3123 || (!REG_P (XEXP (XEXP (tem, 1), 0))
3124 && GET_CODE (XEXP (XEXP (tem, 1), 0)) != SUBREG))
3127 /* It can happen that the note may speak of things
3128 in a wider (or just different) mode than the
3129 code did. This is especially true of
3132 if (GET_CODE (z) == SUBREG && SUBREG_BYTE (z) == 0)
3135 if (GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD
3136 && (GET_MODE_SIZE (GET_MODE (x))
3137 > GET_MODE_SIZE (GET_MODE (z))))
3139 /* This can occur as a result in invalid
3140 pointer casts, e.g. float f; ...
3141 *(long long int *)&f.
3142 ??? We could emit a warning here, but
3143 without a line number that wouldn't be
3145 z = gen_rtx_SUBREG (GET_MODE (x), z, 0);
3148 z = gen_lowpart (GET_MODE (x), z);
3154 /* When we are processing the REG_NOTES of the last instruction
3155 of a libcall, there will be typically no replacements
3156 for that insn; the replacements happened before, piecemeal
3157 fashion. OTOH we are not interested in the details of
3158 this for the REG_EQUAL note, we want to know the big picture,
3159 which can be succinctly described with a simple SUBREG.
3160 Note that removing the REG_EQUAL note is not an option
3161 on the last insn of a libcall, so we must do a replacement. */
3163 /* In compile/990107-1.c:7 compiled at -O1 -m1 for sh-elf,
3165 (mem:DI (addressof:SI (reg/v:DF 160) 159 0x401c8510)
3166 [0 S8 A32]), which can be expressed with a simple
3168 if ((GET_MODE_SIZE (GET_MODE (x))
3169 <= GET_MODE_SIZE (GET_MODE (sub)))
3170 /* Again, invalid pointer casts (as in
3171 compile/990203-1.c) can require paradoxical
3173 || (GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD
3174 && (GET_MODE_SIZE (GET_MODE (x))
3175 > GET_MODE_SIZE (GET_MODE (sub)))
3178 *loc = gen_rtx_SUBREG (GET_MODE (x), sub, 0);
3181 /* ??? Are there other cases we should handle? */
3183 /* Sometimes we may not be able to find the replacement. For
3184 example when the original insn was a MEM in a wider mode,
3185 and the note is part of a sign extension of a narrowed
3186 version of that MEM. Gcc testcase compile/990829-1.c can
3187 generate an example of this situation. Rather than complain
3188 we return false, which will prompt our caller to remove the
3193 size_x = GET_MODE_BITSIZE (GET_MODE (x));
3194 size_sub = GET_MODE_BITSIZE (GET_MODE (sub));
3196 /* Do not frob unchanging MEMs. If a later reference forces the
3197 pseudo to the stack, we can wind up with multiple writes to
3198 an unchanging memory, which is invalid. */
3199 if (RTX_UNCHANGING_P (x) && size_x != size_sub)
3202 /* Don't even consider working with paradoxical subregs,
3203 or the moral equivalent seen here. */
3204 else if (size_x <= size_sub
3205 && int_mode_for_mode (GET_MODE (sub)) != BLKmode)
3207 /* Do a bitfield insertion to mirror what would happen
3214 rtx p = PREV_INSN (insn);
3217 val = gen_reg_rtx (GET_MODE (x));
3218 if (! validate_change (insn, loc, val, 0))
3220 /* Discard the current sequence and put the
3221 ADDRESSOF on stack. */
3227 emit_insn_before (seq, insn);
3228 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3232 store_bit_field (sub, size_x, 0, GET_MODE (x),
3233 val, GET_MODE_SIZE (GET_MODE (sub)));
3235 /* Make sure to unshare any shared rtl that store_bit_field
3236 might have created. */
3237 unshare_all_rtl_again (get_insns ());
3241 p = emit_insn_after (seq, insn);
3242 if (NEXT_INSN (insn))
3243 compute_insns_for_mem (NEXT_INSN (insn),
3244 p ? NEXT_INSN (p) : NULL_RTX,
3249 rtx p = PREV_INSN (insn);
3252 val = extract_bit_field (sub, size_x, 0, 1, NULL_RTX,
3253 GET_MODE (x), GET_MODE (x),
3254 GET_MODE_SIZE (GET_MODE (sub)));
3256 if (! validate_change (insn, loc, val, 0))
3258 /* Discard the current sequence and put the
3259 ADDRESSOF on stack. */
3266 emit_insn_before (seq, insn);
3267 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3271 /* Remember the replacement so that the same one can be done
3272 on the REG_NOTES. */
3273 purge_bitfield_addressof_replacements
3274 = gen_rtx_EXPR_LIST (VOIDmode, x,
3277 purge_bitfield_addressof_replacements));
3279 /* We replaced with a reg -- all done. */
3284 else if (validate_change (insn, loc, sub, 0))
3286 /* Remember the replacement so that the same one can be done
3287 on the REG_NOTES. */
3288 if (REG_P (sub) || GET_CODE (sub) == SUBREG)
3292 for (tem = purge_addressof_replacements;
3294 tem = XEXP (XEXP (tem, 1), 1))
3295 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3297 XEXP (XEXP (tem, 1), 0) = sub;
3300 purge_addressof_replacements
3301 = gen_rtx_EXPR_LIST (VOIDmode, XEXP (x, 0),
3302 gen_rtx_EXPR_LIST (VOIDmode, sub,
3303 purge_addressof_replacements));
3311 /* Scan all subexpressions. */
3312 fmt = GET_RTX_FORMAT (code);
3313 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
3316 result &= purge_addressof_1 (&XEXP (x, i), insn, force, 0,
3318 else if (*fmt == 'E')
3319 for (j = 0; j < XVECLEN (x, i); j++)
3320 result &= purge_addressof_1 (&XVECEXP (x, i, j), insn, force, 0,
3327 /* Return a hash value for K, a REG. */
3330 insns_for_mem_hash (const void *k)
3332 /* Use the address of the key for the hash value. */
3333 struct insns_for_mem_entry *m = (struct insns_for_mem_entry *) k;
3334 return htab_hash_pointer (m->key);
3337 /* Return nonzero if K1 and K2 (two REGs) are the same. */
3340 insns_for_mem_comp (const void *k1, const void *k2)
3342 struct insns_for_mem_entry *m1 = (struct insns_for_mem_entry *) k1;
3343 struct insns_for_mem_entry *m2 = (struct insns_for_mem_entry *) k2;
3344 return m1->key == m2->key;
3347 struct insns_for_mem_walk_info
3349 /* The hash table that we are using to record which INSNs use which
3353 /* The INSN we are currently processing. */
3356 /* Zero if we are walking to find ADDRESSOFs, one if we are walking
3357 to find the insns that use the REGs in the ADDRESSOFs. */
3361 /* Called from compute_insns_for_mem via for_each_rtx. If R is a REG
3362 that might be used in an ADDRESSOF expression, record this INSN in
3363 the hash table given by DATA (which is really a pointer to an
3364 insns_for_mem_walk_info structure). */
3367 insns_for_mem_walk (rtx *r, void *data)
3369 struct insns_for_mem_walk_info *ifmwi
3370 = (struct insns_for_mem_walk_info *) data;
3371 struct insns_for_mem_entry tmp;
3372 tmp.insns = NULL_RTX;
3374 if (ifmwi->pass == 0 && *r && GET_CODE (*r) == ADDRESSOF
3375 && REG_P (XEXP (*r, 0)))
3378 tmp.key = XEXP (*r, 0);
3379 e = htab_find_slot (ifmwi->ht, &tmp, INSERT);
3382 *e = ggc_alloc (sizeof (tmp));
3383 memcpy (*e, &tmp, sizeof (tmp));
3386 else if (ifmwi->pass == 1 && *r && REG_P (*r))
3388 struct insns_for_mem_entry *ifme;
3390 ifme = htab_find (ifmwi->ht, &tmp);
3392 /* If we have not already recorded this INSN, do so now. Since
3393 we process the INSNs in order, we know that if we have
3394 recorded it it must be at the front of the list. */
3395 if (ifme && (!ifme->insns || XEXP (ifme->insns, 0) != ifmwi->insn))
3396 ifme->insns = gen_rtx_EXPR_LIST (VOIDmode, ifmwi->insn,
3403 /* Walk the INSNS, until we reach LAST_INSN, recording which INSNs use
3404 which REGs in HT. */
3407 compute_insns_for_mem (rtx insns, rtx last_insn, htab_t ht)
3410 struct insns_for_mem_walk_info ifmwi;
3413 for (ifmwi.pass = 0; ifmwi.pass < 2; ++ifmwi.pass)
3414 for (insn = insns; insn != last_insn; insn = NEXT_INSN (insn))
3418 for_each_rtx (&insn, insns_for_mem_walk, &ifmwi);
3422 /* Helper function for purge_addressof called through for_each_rtx.
3423 Returns true iff the rtl is an ADDRESSOF. */
3426 is_addressof (rtx *rtl, void *data ATTRIBUTE_UNUSED)
3428 return GET_CODE (*rtl) == ADDRESSOF;
3431 /* Eliminate all occurrences of ADDRESSOF from INSNS. Elide any remaining
3432 (MEM (ADDRESSOF)) patterns, and force any needed registers into the
3436 purge_addressof (rtx insns)
3441 /* When we actually purge ADDRESSOFs, we turn REGs into MEMs. That
3442 requires a fixup pass over the instruction stream to correct
3443 INSNs that depended on the REG being a REG, and not a MEM. But,
3444 these fixup passes are slow. Furthermore, most MEMs are not
3445 mentioned in very many instructions. So, we speed up the process
3446 by pre-calculating which REGs occur in which INSNs; that allows
3447 us to perform the fixup passes much more quickly. */
3448 ht = htab_create_ggc (1000, insns_for_mem_hash, insns_for_mem_comp, NULL);
3449 compute_insns_for_mem (insns, NULL_RTX, ht);
3451 postponed_insns = NULL;
3453 for (insn = insns; insn; insn = NEXT_INSN (insn))
3456 if (! purge_addressof_1 (&PATTERN (insn), insn,
3457 asm_noperands (PATTERN (insn)) > 0, 0, 1, ht))
3458 /* If we could not replace the ADDRESSOFs in the insn,
3459 something is wrong. */
3462 if (! purge_addressof_1 (®_NOTES (insn), NULL_RTX, 0, 0, 0, ht))
3464 /* If we could not replace the ADDRESSOFs in the insn's notes,
3465 we can just remove the offending notes instead. */
3468 for (note = REG_NOTES (insn); note; note = XEXP (note, 1))
3470 /* If we find a REG_RETVAL note then the insn is a libcall.
3471 Such insns must have REG_EQUAL notes as well, in order
3472 for later passes of the compiler to work. So it is not
3473 safe to delete the notes here, and instead we abort. */
3474 if (REG_NOTE_KIND (note) == REG_RETVAL)
3476 if (for_each_rtx (¬e, is_addressof, NULL))
3477 remove_note (insn, note);
3482 /* Process the postponed insns. */
3483 while (postponed_insns)
3485 insn = XEXP (postponed_insns, 0);
3486 tmp = postponed_insns;
3487 postponed_insns = XEXP (postponed_insns, 1);
3488 free_INSN_LIST_node (tmp);
3490 if (! purge_addressof_1 (&PATTERN (insn), insn,
3491 asm_noperands (PATTERN (insn)) > 0, 0, 0, ht))
3496 purge_bitfield_addressof_replacements = 0;
3497 purge_addressof_replacements = 0;
3499 /* REGs are shared. purge_addressof will destructively replace a REG
3500 with a MEM, which creates shared MEMs.
3502 Unfortunately, the children of put_reg_into_stack assume that MEMs
3503 referring to the same stack slot are shared (fixup_var_refs and
3504 the associated hash table code).
3506 So, we have to do another unsharing pass after we have flushed any
3507 REGs that had their address taken into the stack.
3509 It may be worth tracking whether or not we converted any REGs into
3510 MEMs to avoid this overhead when it is not needed. */
3511 unshare_all_rtl_again (get_insns ());
3514 /* Convert a SET of a hard subreg to a set of the appropriate hard
3515 register. A subroutine of purge_hard_subreg_sets. */
3518 purge_single_hard_subreg_set (rtx pattern)
3520 rtx reg = SET_DEST (pattern);
3521 enum machine_mode mode = GET_MODE (SET_DEST (pattern));
3524 if (GET_CODE (reg) == SUBREG && REG_P (SUBREG_REG (reg))
3525 && REGNO (SUBREG_REG (reg)) < FIRST_PSEUDO_REGISTER)
3527 offset = subreg_regno_offset (REGNO (SUBREG_REG (reg)),
3528 GET_MODE (SUBREG_REG (reg)),
3531 reg = SUBREG_REG (reg);
3535 if (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER)
3537 reg = gen_rtx_REG (mode, REGNO (reg) + offset);
3538 SET_DEST (pattern) = reg;
3542 /* Eliminate all occurrences of SETs of hard subregs from INSNS. The
3543 only such SETs that we expect to see are those left in because
3544 integrate can't handle sets of parts of a return value register.
3546 We don't use alter_subreg because we only want to eliminate subregs
3547 of hard registers. */
3550 purge_hard_subreg_sets (rtx insn)
3552 for (; insn; insn = NEXT_INSN (insn))
3556 rtx pattern = PATTERN (insn);
3557 switch (GET_CODE (pattern))
3560 if (GET_CODE (SET_DEST (pattern)) == SUBREG)
3561 purge_single_hard_subreg_set (pattern);
3566 for (j = XVECLEN (pattern, 0) - 1; j >= 0; j--)
3568 rtx inner_pattern = XVECEXP (pattern, 0, j);
3569 if (GET_CODE (inner_pattern) == SET
3570 && GET_CODE (SET_DEST (inner_pattern)) == SUBREG)
3571 purge_single_hard_subreg_set (inner_pattern);
3582 /* Pass through the INSNS of function FNDECL and convert virtual register
3583 references to hard register references. */
3586 instantiate_virtual_regs (void)
3591 /* Compute the offsets to use for this function. */
3592 in_arg_offset = FIRST_PARM_OFFSET (current_function_decl);
3593 var_offset = STARTING_FRAME_OFFSET;
3594 dynamic_offset = STACK_DYNAMIC_OFFSET (current_function_decl);
3595 out_arg_offset = STACK_POINTER_OFFSET;
3596 cfa_offset = ARG_POINTER_CFA_OFFSET (current_function_decl);
3598 /* Scan all variables and parameters of this function. For each that is
3599 in memory, instantiate all virtual registers if the result is a valid
3600 address. If not, we do it later. That will handle most uses of virtual
3601 regs on many machines. */
3602 instantiate_decls (current_function_decl, 1);
3604 /* Initialize recognition, indicating that volatile is OK. */
3607 /* Scan through all the insns, instantiating every virtual register still
3609 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3610 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
3611 || GET_CODE (insn) == CALL_INSN)
3613 instantiate_virtual_regs_1 (&PATTERN (insn), insn, 1);
3614 if (INSN_DELETED_P (insn))
3616 instantiate_virtual_regs_1 (®_NOTES (insn), NULL_RTX, 0);
3617 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
3618 if (GET_CODE (insn) == CALL_INSN)
3619 instantiate_virtual_regs_1 (&CALL_INSN_FUNCTION_USAGE (insn),
3622 /* Past this point all ASM statements should match. Verify that
3623 to avoid failures later in the compilation process. */
3624 if (asm_noperands (PATTERN (insn)) >= 0
3625 && ! check_asm_operands (PATTERN (insn)))
3626 instantiate_virtual_regs_lossage (insn);
3629 /* Instantiate the stack slots for the parm registers, for later use in
3630 addressof elimination. */
3631 for (i = 0; i < max_parm_reg; ++i)
3632 if (parm_reg_stack_loc[i])
3633 instantiate_virtual_regs_1 (&parm_reg_stack_loc[i], NULL_RTX, 0);
3635 /* Now instantiate the remaining register equivalences for debugging info.
3636 These will not be valid addresses. */
3637 instantiate_decls (current_function_decl, 0);
3639 /* Indicate that, from now on, assign_stack_local should use
3640 frame_pointer_rtx. */
3641 virtuals_instantiated = 1;
3644 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
3645 all virtual registers in their DECL_RTL's.
3647 If VALID_ONLY, do this only if the resulting address is still valid.
3648 Otherwise, always do it. */
3651 instantiate_decls (tree fndecl, int valid_only)
3655 /* Process all parameters of the function. */
3656 for (decl = DECL_ARGUMENTS (fndecl); decl; decl = TREE_CHAIN (decl))
3658 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (decl));
3659 HOST_WIDE_INT size_rtl;
3661 instantiate_decl (DECL_RTL (decl), size, valid_only);
3663 /* If the parameter was promoted, then the incoming RTL mode may be
3664 larger than the declared type size. We must use the larger of
3666 size_rtl = GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl)));
3667 size = MAX (size_rtl, size);
3668 instantiate_decl (DECL_INCOMING_RTL (decl), size, valid_only);
3671 /* Now process all variables defined in the function or its subblocks. */
3672 instantiate_decls_1 (DECL_INITIAL (fndecl), valid_only);
3675 /* Subroutine of instantiate_decls: Process all decls in the given
3676 BLOCK node and all its subblocks. */
3679 instantiate_decls_1 (tree let, int valid_only)
3683 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
3684 if (DECL_RTL_SET_P (t))
3685 instantiate_decl (DECL_RTL (t),
3686 int_size_in_bytes (TREE_TYPE (t)),
3689 /* Process all subblocks. */
3690 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
3691 instantiate_decls_1 (t, valid_only);
3694 /* Subroutine of the preceding procedures: Given RTL representing a
3695 decl and the size of the object, do any instantiation required.
3697 If VALID_ONLY is nonzero, it means that the RTL should only be
3698 changed if the new address is valid. */
3701 instantiate_decl (rtx x, HOST_WIDE_INT size, int valid_only)
3703 enum machine_mode mode;
3706 /* If this is not a MEM, no need to do anything. Similarly if the
3707 address is a constant or a register that is not a virtual register. */
3709 if (x == 0 || !MEM_P (x))
3713 if (CONSTANT_P (addr)
3714 || (GET_CODE (addr) == ADDRESSOF && REG_P (XEXP (addr, 0)))
3716 && (REGNO (addr) < FIRST_VIRTUAL_REGISTER
3717 || REGNO (addr) > LAST_VIRTUAL_REGISTER)))
3720 /* If we should only do this if the address is valid, copy the address.
3721 We need to do this so we can undo any changes that might make the
3722 address invalid. This copy is unfortunate, but probably can't be
3726 addr = copy_rtx (addr);
3728 instantiate_virtual_regs_1 (&addr, NULL_RTX, 0);
3730 if (valid_only && size >= 0)
3732 unsigned HOST_WIDE_INT decl_size = size;
3734 /* Now verify that the resulting address is valid for every integer or
3735 floating-point mode up to and including SIZE bytes long. We do this
3736 since the object might be accessed in any mode and frame addresses
3739 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3740 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3741 mode = GET_MODE_WIDER_MODE (mode))
3742 if (! memory_address_p (mode, addr))
3745 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
3746 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3747 mode = GET_MODE_WIDER_MODE (mode))
3748 if (! memory_address_p (mode, addr))
3752 /* Put back the address now that we have updated it and we either know
3753 it is valid or we don't care whether it is valid. */
3758 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
3759 is a virtual register, return the equivalent hard register and set the
3760 offset indirectly through the pointer. Otherwise, return 0. */
3763 instantiate_new_reg (rtx x, HOST_WIDE_INT *poffset)
3766 HOST_WIDE_INT offset;
3768 if (x == virtual_incoming_args_rtx)
3769 new = arg_pointer_rtx, offset = in_arg_offset;
3770 else if (x == virtual_stack_vars_rtx)
3771 new = frame_pointer_rtx, offset = var_offset;
3772 else if (x == virtual_stack_dynamic_rtx)
3773 new = stack_pointer_rtx, offset = dynamic_offset;
3774 else if (x == virtual_outgoing_args_rtx)
3775 new = stack_pointer_rtx, offset = out_arg_offset;
3776 else if (x == virtual_cfa_rtx)
3777 new = arg_pointer_rtx, offset = cfa_offset;
3786 /* Called when instantiate_virtual_regs has failed to update the instruction.
3787 Usually this means that non-matching instruction has been emit, however for
3788 asm statements it may be the problem in the constraints. */
3790 instantiate_virtual_regs_lossage (rtx insn)
3792 if (asm_noperands (PATTERN (insn)) >= 0)
3794 error_for_asm (insn, "impossible constraint in `asm'");
3800 /* Given a pointer to a piece of rtx and an optional pointer to the
3801 containing object, instantiate any virtual registers present in it.
3803 If EXTRA_INSNS, we always do the replacement and generate
3804 any extra insns before OBJECT. If it zero, we do nothing if replacement
3807 Return 1 if we either had nothing to do or if we were able to do the
3808 needed replacement. Return 0 otherwise; we only return zero if
3809 EXTRA_INSNS is zero.
3811 We first try some simple transformations to avoid the creation of extra
3815 instantiate_virtual_regs_1 (rtx *loc, rtx object, int extra_insns)
3820 HOST_WIDE_INT offset = 0;
3826 /* Re-start here to avoid recursion in common cases. */
3833 /* We may have detected and deleted invalid asm statements. */
3834 if (object && INSN_P (object) && INSN_DELETED_P (object))
3837 code = GET_CODE (x);
3839 /* Check for some special cases. */
3857 /* We are allowed to set the virtual registers. This means that
3858 the actual register should receive the source minus the
3859 appropriate offset. This is used, for example, in the handling
3860 of non-local gotos. */
3861 if ((new = instantiate_new_reg (SET_DEST (x), &offset)) != 0)
3863 rtx src = SET_SRC (x);
3865 /* We are setting the register, not using it, so the relevant
3866 offset is the negative of the offset to use were we using
3869 instantiate_virtual_regs_1 (&src, NULL_RTX, 0);
3871 /* The only valid sources here are PLUS or REG. Just do
3872 the simplest possible thing to handle them. */
3873 if (!REG_P (src) && GET_CODE (src) != PLUS)
3875 instantiate_virtual_regs_lossage (object);
3881 temp = force_operand (src, NULL_RTX);
3884 temp = force_operand (plus_constant (temp, offset), NULL_RTX);
3888 emit_insn_before (seq, object);
3891 if (! validate_change (object, &SET_SRC (x), temp, 0)
3893 instantiate_virtual_regs_lossage (object);
3898 instantiate_virtual_regs_1 (&SET_DEST (x), object, extra_insns);
3903 /* Handle special case of virtual register plus constant. */
3904 if (CONSTANT_P (XEXP (x, 1)))
3906 rtx old, new_offset;
3908 /* Check for (plus (plus VIRT foo) (const_int)) first. */
3909 if (GET_CODE (XEXP (x, 0)) == PLUS)
3911 if ((new = instantiate_new_reg (XEXP (XEXP (x, 0), 0), &offset)))
3913 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 1), object,
3915 new = gen_rtx_PLUS (Pmode, new, XEXP (XEXP (x, 0), 1));
3924 #ifdef POINTERS_EXTEND_UNSIGNED
3925 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
3926 we can commute the PLUS and SUBREG because pointers into the
3927 frame are well-behaved. */
3928 else if (GET_CODE (XEXP (x, 0)) == SUBREG && GET_MODE (x) == ptr_mode
3929 && GET_CODE (XEXP (x, 1)) == CONST_INT
3931 = instantiate_new_reg (SUBREG_REG (XEXP (x, 0)),
3933 && validate_change (object, loc,
3934 plus_constant (gen_lowpart (ptr_mode,
3937 + INTVAL (XEXP (x, 1))),
3941 else if ((new = instantiate_new_reg (XEXP (x, 0), &offset)) == 0)
3943 /* We know the second operand is a constant. Unless the
3944 first operand is a REG (which has been already checked),
3945 it needs to be checked. */
3946 if (!REG_P (XEXP (x, 0)))
3954 new_offset = plus_constant (XEXP (x, 1), offset);
3956 /* If the new constant is zero, try to replace the sum with just
3958 if (new_offset == const0_rtx
3959 && validate_change (object, loc, new, 0))
3962 /* Next try to replace the register and new offset.
3963 There are two changes to validate here and we can't assume that
3964 in the case of old offset equals new just changing the register
3965 will yield a valid insn. In the interests of a little efficiency,
3966 however, we only call validate change once (we don't queue up the
3967 changes and then call apply_change_group). */
3971 ? ! validate_change (object, &XEXP (x, 0), new, 0)
3972 : (XEXP (x, 0) = new,
3973 ! validate_change (object, &XEXP (x, 1), new_offset, 0)))
3981 /* Otherwise copy the new constant into a register and replace
3982 constant with that register. */
3983 temp = gen_reg_rtx (Pmode);
3985 if (validate_change (object, &XEXP (x, 1), temp, 0))
3986 emit_insn_before (gen_move_insn (temp, new_offset), object);
3989 /* If that didn't work, replace this expression with a
3990 register containing the sum. */
3993 new = gen_rtx_PLUS (Pmode, new, new_offset);
3996 temp = force_operand (new, NULL_RTX);
4000 emit_insn_before (seq, object);
4001 if (! validate_change (object, loc, temp, 0)
4002 && ! validate_replace_rtx (x, temp, object))
4004 instantiate_virtual_regs_lossage (object);
4013 /* Fall through to generic two-operand expression case. */
4019 case DIV: case UDIV:
4020 case MOD: case UMOD:
4021 case AND: case IOR: case XOR:
4022 case ROTATERT: case ROTATE:
4023 case ASHIFTRT: case LSHIFTRT: case ASHIFT:
4025 case GE: case GT: case GEU: case GTU:
4026 case LE: case LT: case LEU: case LTU:
4027 if (XEXP (x, 1) && ! CONSTANT_P (XEXP (x, 1)))
4028 instantiate_virtual_regs_1 (&XEXP (x, 1), object, extra_insns);
4033 /* Most cases of MEM that convert to valid addresses have already been
4034 handled by our scan of decls. The only special handling we
4035 need here is to make a copy of the rtx to ensure it isn't being
4036 shared if we have to change it to a pseudo.
4038 If the rtx is a simple reference to an address via a virtual register,
4039 it can potentially be shared. In such cases, first try to make it
4040 a valid address, which can also be shared. Otherwise, copy it and
4043 First check for common cases that need no processing. These are
4044 usually due to instantiation already being done on a previous instance
4048 if (CONSTANT_ADDRESS_P (temp)
4049 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
4050 || temp == arg_pointer_rtx
4052 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
4053 || temp == hard_frame_pointer_rtx
4055 || temp == frame_pointer_rtx)
4058 if (GET_CODE (temp) == PLUS
4059 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
4060 && (XEXP (temp, 0) == frame_pointer_rtx
4061 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
4062 || XEXP (temp, 0) == hard_frame_pointer_rtx
4064 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
4065 || XEXP (temp, 0) == arg_pointer_rtx
4070 if (temp == virtual_stack_vars_rtx
4071 || temp == virtual_incoming_args_rtx
4072 || (GET_CODE (temp) == PLUS
4073 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
4074 && (XEXP (temp, 0) == virtual_stack_vars_rtx
4075 || XEXP (temp, 0) == virtual_incoming_args_rtx)))
4077 /* This MEM may be shared. If the substitution can be done without
4078 the need to generate new pseudos, we want to do it in place
4079 so all copies of the shared rtx benefit. The call below will
4080 only make substitutions if the resulting address is still
4083 Note that we cannot pass X as the object in the recursive call
4084 since the insn being processed may not allow all valid
4085 addresses. However, if we were not passed on object, we can
4086 only modify X without copying it if X will have a valid
4089 ??? Also note that this can still lose if OBJECT is an insn that
4090 has less restrictions on an address that some other insn.
4091 In that case, we will modify the shared address. This case
4092 doesn't seem very likely, though. One case where this could
4093 happen is in the case of a USE or CLOBBER reference, but we
4094 take care of that below. */
4096 if (instantiate_virtual_regs_1 (&XEXP (x, 0),
4097 object ? object : x, 0))
4100 /* Otherwise make a copy and process that copy. We copy the entire
4101 RTL expression since it might be a PLUS which could also be
4103 *loc = x = copy_rtx (x);
4106 /* Fall through to generic unary operation case. */
4109 case STRICT_LOW_PART:
4111 case PRE_DEC: case PRE_INC: case POST_DEC: case POST_INC:
4112 case SIGN_EXTEND: case ZERO_EXTEND:
4113 case TRUNCATE: case FLOAT_EXTEND: case FLOAT_TRUNCATE:
4114 case FLOAT: case FIX:
4115 case UNSIGNED_FIX: case UNSIGNED_FLOAT:
4120 case POPCOUNT: case PARITY:
4121 /* These case either have just one operand or we know that we need not
4122 check the rest of the operands. */
4128 /* If the operand is a MEM, see if the change is a valid MEM. If not,
4129 go ahead and make the invalid one, but do it to a copy. For a REG,
4130 just make the recursive call, since there's no chance of a problem. */
4132 if ((MEM_P (XEXP (x, 0))
4133 && instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), XEXP (x, 0),
4135 || (REG_P (XEXP (x, 0))
4136 && instantiate_virtual_regs_1 (&XEXP (x, 0), object, 0)))
4139 XEXP (x, 0) = copy_rtx (XEXP (x, 0));
4144 /* Try to replace with a PLUS. If that doesn't work, compute the sum
4145 in front of this insn and substitute the temporary. */
4146 if ((new = instantiate_new_reg (x, &offset)) != 0)
4148 temp = plus_constant (new, offset);
4149 if (!validate_change (object, loc, temp, 0))
4155 temp = force_operand (temp, NULL_RTX);
4159 emit_insn_before (seq, object);
4160 if (! validate_change (object, loc, temp, 0)
4161 && ! validate_replace_rtx (x, temp, object))
4162 instantiate_virtual_regs_lossage (object);
4169 if (REG_P (XEXP (x, 0)))
4172 else if (MEM_P (XEXP (x, 0)))
4174 /* If we have a (addressof (mem ..)), do any instantiation inside
4175 since we know we'll be making the inside valid when we finally
4176 remove the ADDRESSOF. */
4177 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), NULL_RTX, 0);
4186 /* Scan all subexpressions. */
4187 fmt = GET_RTX_FORMAT (code);
4188 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
4191 if (!instantiate_virtual_regs_1 (&XEXP (x, i), object, extra_insns))
4194 else if (*fmt == 'E')
4195 for (j = 0; j < XVECLEN (x, i); j++)
4196 if (! instantiate_virtual_regs_1 (&XVECEXP (x, i, j), object,
4203 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
4204 This means a type for which function calls must pass an address to the
4205 function or get an address back from the function.
4206 EXP may be a type node or an expression (whose type is tested). */
4209 aggregate_value_p (tree exp, tree fntype)
4211 int i, regno, nregs;
4214 tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
4217 switch (TREE_CODE (fntype))
4220 fntype = get_callee_fndecl (fntype);
4221 fntype = fntype ? TREE_TYPE (fntype) : 0;
4224 fntype = TREE_TYPE (fntype);
4229 case IDENTIFIER_NODE:
4233 /* We don't expect other rtl types here. */
4237 if (TREE_CODE (type) == VOID_TYPE)
4239 if (targetm.calls.return_in_memory (type, fntype))
4241 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
4242 and thus can't be returned in registers. */
4243 if (TREE_ADDRESSABLE (type))
4245 if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
4247 /* Make sure we have suitable call-clobbered regs to return
4248 the value in; if not, we must return it in memory. */
4249 reg = hard_function_value (type, 0, 0);
4251 /* If we have something other than a REG (e.g. a PARALLEL), then assume
4256 regno = REGNO (reg);
4257 nregs = hard_regno_nregs[regno][TYPE_MODE (type)];
4258 for (i = 0; i < nregs; i++)
4259 if (! call_used_regs[regno + i])
4264 /* Assign RTL expressions to the function's parameters.
4265 This may involve copying them into registers and using
4266 those registers as the RTL for them. */
4269 assign_parms (tree fndecl)
4272 CUMULATIVE_ARGS args_so_far;
4273 /* Total space needed so far for args on the stack,
4274 given as a constant and a tree-expression. */
4275 struct args_size stack_args_size;
4276 HOST_WIDE_INT extra_pretend_bytes = 0;
4277 tree fntype = TREE_TYPE (fndecl);
4278 tree fnargs = DECL_ARGUMENTS (fndecl), orig_fnargs;
4279 /* This is used for the arg pointer when referring to stack args. */
4280 rtx internal_arg_pointer;
4281 /* This is a dummy PARM_DECL that we used for the function result if
4282 the function returns a structure. */
4283 tree function_result_decl = 0;
4284 int varargs_setup = 0;
4285 int reg_parm_stack_space ATTRIBUTE_UNUSED = 0;
4286 rtx conversion_insns = 0;
4288 /* Nonzero if function takes extra anonymous args.
4289 This means the last named arg must be on the stack
4290 right before the anonymous ones. */
4291 int stdarg = current_function_stdarg;
4293 /* If the reg that the virtual arg pointer will be translated into is
4294 not a fixed reg or is the stack pointer, make a copy of the virtual
4295 arg pointer, and address parms via the copy. The frame pointer is
4296 considered fixed even though it is not marked as such.
4298 The second time through, simply use ap to avoid generating rtx. */
4300 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
4301 || ! (fixed_regs[ARG_POINTER_REGNUM]
4302 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
4303 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
4305 internal_arg_pointer = virtual_incoming_args_rtx;
4306 current_function_internal_arg_pointer = internal_arg_pointer;
4308 stack_args_size.constant = 0;
4309 stack_args_size.var = 0;
4311 /* If struct value address is treated as the first argument, make it so. */
4312 if (aggregate_value_p (DECL_RESULT (fndecl), fndecl)
4313 && ! current_function_returns_pcc_struct
4314 && targetm.calls.struct_value_rtx (TREE_TYPE (fndecl), 1) == 0)
4316 tree type = build_pointer_type (TREE_TYPE (fntype));
4318 function_result_decl = build_decl (PARM_DECL, NULL_TREE, type);
4320 DECL_ARG_TYPE (function_result_decl) = type;
4321 TREE_CHAIN (function_result_decl) = fnargs;
4322 fnargs = function_result_decl;
4325 orig_fnargs = fnargs;
4327 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
4328 parm_reg_stack_loc = ggc_alloc_cleared (max_parm_reg * sizeof (rtx));
4330 /* If the target wants to split complex arguments into scalars, do so. */
4331 if (targetm.calls.split_complex_arg)
4332 fnargs = split_complex_args (fnargs);
4334 #ifdef REG_PARM_STACK_SPACE
4335 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
4338 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
4339 INIT_CUMULATIVE_INCOMING_ARGS (args_so_far, fntype, NULL_RTX);
4341 INIT_CUMULATIVE_ARGS (args_so_far, fntype, NULL_RTX, fndecl, -1);
4344 /* We haven't yet found an argument that we must push and pretend the
4346 current_function_pretend_args_size = 0;
4348 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
4352 enum machine_mode promoted_mode, passed_mode;
4353 enum machine_mode nominal_mode, promoted_nominal_mode;
4355 struct locate_and_pad_arg_data locate;
4356 int passed_pointer = 0;
4357 int did_conversion = 0;
4358 tree passed_type = DECL_ARG_TYPE (parm);
4359 tree nominal_type = TREE_TYPE (parm);
4360 int last_named = 0, named_arg;
4363 int pretend_bytes = 0;
4364 int loaded_in_reg = 0;
4366 /* Set LAST_NAMED if this is last named arg before last
4372 for (tem = TREE_CHAIN (parm); tem; tem = TREE_CHAIN (tem))
4373 if (DECL_NAME (tem))
4379 /* Set NAMED_ARG if this arg should be treated as a named arg. For
4380 most machines, if this is a varargs/stdarg function, then we treat
4381 the last named arg as if it were anonymous too. */
4382 named_arg = (targetm.calls.strict_argument_naming (&args_so_far)
4385 if (TREE_TYPE (parm) == error_mark_node
4386 /* This can happen after weird syntax errors
4387 or if an enum type is defined among the parms. */
4388 || TREE_CODE (parm) != PARM_DECL
4389 || passed_type == NULL)
4391 SET_DECL_RTL (parm, gen_rtx_MEM (BLKmode, const0_rtx));
4392 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4393 TREE_USED (parm) = 1;
4397 /* Find mode of arg as it is passed, and mode of arg
4398 as it should be during execution of this function. */
4399 passed_mode = TYPE_MODE (passed_type);
4400 nominal_mode = TYPE_MODE (nominal_type);
4402 /* If the parm's mode is VOID, its value doesn't matter,
4403 and avoid the usual things like emit_move_insn that could crash. */
4404 if (nominal_mode == VOIDmode)
4406 SET_DECL_RTL (parm, const0_rtx);
4407 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4411 /* If the parm is to be passed as a transparent union, use the
4412 type of the first field for the tests below. We have already
4413 verified that the modes are the same. */
4414 if (DECL_TRANSPARENT_UNION (parm)
4415 || (TREE_CODE (passed_type) == UNION_TYPE
4416 && TYPE_TRANSPARENT_UNION (passed_type)))
4417 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
4419 /* See if this arg was passed by invisible reference. It is if
4420 it is an object whose size depends on the contents of the
4421 object itself or if the machine requires these objects be passed
4424 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (passed_type))
4425 || TREE_ADDRESSABLE (passed_type)
4426 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
4427 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, passed_mode,
4428 passed_type, named_arg)
4432 passed_type = nominal_type = build_pointer_type (passed_type);
4434 passed_mode = nominal_mode = Pmode;
4436 /* See if the frontend wants to pass this by invisible reference. */
4437 else if (passed_type != nominal_type
4438 && POINTER_TYPE_P (passed_type)
4439 && TREE_TYPE (passed_type) == nominal_type)
4441 nominal_type = passed_type;
4443 passed_mode = nominal_mode = Pmode;
4446 promoted_mode = passed_mode;
4448 if (targetm.calls.promote_function_args (TREE_TYPE (fndecl)))
4450 /* Compute the mode in which the arg is actually extended to. */
4451 unsignedp = TYPE_UNSIGNED (passed_type);
4452 promoted_mode = promote_mode (passed_type, promoted_mode,
4456 /* Let machine desc say which reg (if any) the parm arrives in.
4457 0 means it arrives on the stack. */
4458 #ifdef FUNCTION_INCOMING_ARG
4459 entry_parm = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4460 passed_type, named_arg);
4462 entry_parm = FUNCTION_ARG (args_so_far, promoted_mode,
4463 passed_type, named_arg);
4466 if (entry_parm == 0)
4467 promoted_mode = passed_mode;
4469 /* If this is the last named parameter, do any required setup for
4470 varargs or stdargs. We need to know about the case of this being an
4471 addressable type, in which case we skip the registers it
4472 would have arrived in.
4474 For stdargs, LAST_NAMED will be set for two parameters, the one that
4475 is actually the last named, and the dummy parameter. We only
4476 want to do this action once.
4478 Also, indicate when RTL generation is to be suppressed. */
4479 if (last_named && !varargs_setup)
4481 int varargs_pretend_bytes = 0;
4482 targetm.calls.setup_incoming_varargs (&args_so_far, promoted_mode,
4484 &varargs_pretend_bytes, 0);
4487 /* If the back-end has requested extra stack space, record how
4488 much is needed. Do not change pretend_args_size otherwise
4489 since it may be nonzero from an earlier partial argument. */
4490 if (varargs_pretend_bytes > 0)
4491 current_function_pretend_args_size = varargs_pretend_bytes;
4494 /* Determine parm's home in the stack,
4495 in case it arrives in the stack or we should pretend it did.
4497 Compute the stack position and rtx where the argument arrives
4500 There is one complexity here: If this was a parameter that would
4501 have been passed in registers, but wasn't only because it is
4502 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
4503 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
4504 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
4505 0 as it was the previous time. */
4506 in_regs = entry_parm != 0;
4507 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4510 if (!in_regs && !named_arg)
4513 targetm.calls.pretend_outgoing_varargs_named (&args_so_far);
4516 #ifdef FUNCTION_INCOMING_ARG
4517 in_regs = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4519 pretend_named) != 0;
4521 in_regs = FUNCTION_ARG (args_so_far, promoted_mode,
4523 pretend_named) != 0;
4528 /* If this parameter was passed both in registers and in the stack,
4529 use the copy on the stack. */
4530 if (MUST_PASS_IN_STACK (promoted_mode, passed_type))
4533 #ifdef FUNCTION_ARG_PARTIAL_NREGS
4536 partial = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, promoted_mode,
4537 passed_type, named_arg);
4539 /* The caller might already have allocated stack space
4540 for the register parameters. */
4541 && reg_parm_stack_space == 0)
4543 /* Part of this argument is passed in registers and part
4544 is passed on the stack. Ask the prologue code to extend
4545 the stack part so that we can recreate the full value.
4547 PRETEND_BYTES is the size of the registers we need to store.
4548 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
4549 stack space that the prologue should allocate.
4551 Internally, gcc assumes that the argument pointer is
4552 aligned to STACK_BOUNDARY bits. This is used both for
4553 alignment optimizations (see init_emit) and to locate
4554 arguments that are aligned to more than PARM_BOUNDARY
4555 bits. We must preserve this invariant by rounding
4556 CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to a stack
4559 /* We assume at most one partial arg, and it must be the first
4560 argument on the stack. */
4561 if (extra_pretend_bytes || current_function_pretend_args_size)
4564 pretend_bytes = partial * UNITS_PER_WORD;
4565 current_function_pretend_args_size
4566 = CEIL_ROUND (pretend_bytes, STACK_BYTES);
4568 /* We want to align relative to the actual stack pointer, so
4569 don't include this in the stack size until later. */
4570 extra_pretend_bytes = current_function_pretend_args_size;
4575 memset (&locate, 0, sizeof (locate));
4576 locate_and_pad_parm (promoted_mode, passed_type, in_regs,
4577 entry_parm ? partial : 0, fndecl,
4578 &stack_args_size, &locate);
4579 /* Adjust offsets to include the pretend args. */
4580 locate.slot_offset.constant += extra_pretend_bytes - pretend_bytes;
4581 locate.offset.constant += extra_pretend_bytes - pretend_bytes;
4585 unsigned int align, boundary;
4587 /* If we're passing this arg using a reg, make its stack home
4588 the aligned stack slot. */
4590 offset_rtx = ARGS_SIZE_RTX (locate.slot_offset);
4592 offset_rtx = ARGS_SIZE_RTX (locate.offset);
4594 if (offset_rtx == const0_rtx)
4595 stack_parm = gen_rtx_MEM (promoted_mode, internal_arg_pointer);
4597 stack_parm = gen_rtx_MEM (promoted_mode,
4598 gen_rtx_PLUS (Pmode,
4599 internal_arg_pointer,
4602 set_mem_attributes (stack_parm, parm, 1);
4604 boundary = FUNCTION_ARG_BOUNDARY (promoted_mode, passed_type);
4607 /* If we're padding upward, we know that the alignment of the slot
4608 is FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
4609 intentionally forcing upward padding. Otherwise we have to come
4610 up with a guess at the alignment based on OFFSET_RTX. */
4611 if (locate.where_pad == upward || entry_parm)
4613 else if (GET_CODE (offset_rtx) == CONST_INT)
4615 align = INTVAL (offset_rtx) * BITS_PER_UNIT | boundary;
4616 align = align & -align;
4619 set_mem_align (stack_parm, align);
4622 set_reg_attrs_for_parm (entry_parm, stack_parm);
4625 /* If this parm was passed part in regs and part in memory,
4626 pretend it arrived entirely in memory
4627 by pushing the register-part onto the stack.
4629 In the special case of a DImode or DFmode that is split,
4630 we could put it together in a pseudoreg directly,
4631 but for now that's not worth bothering with. */
4635 /* Handle calls that pass values in multiple non-contiguous
4636 locations. The Irix 6 ABI has examples of this. */
4637 if (GET_CODE (entry_parm) == PARALLEL)
4638 emit_group_store (validize_mem (stack_parm), entry_parm,
4640 int_size_in_bytes (TREE_TYPE (parm)));
4643 move_block_from_reg (REGNO (entry_parm), validize_mem (stack_parm),
4646 entry_parm = stack_parm;
4649 /* If we didn't decide this parm came in a register,
4650 by default it came on the stack. */
4651 if (entry_parm == 0)
4652 entry_parm = stack_parm;
4654 /* Record permanently how this parm was passed. */
4655 set_decl_incoming_rtl (parm, entry_parm);
4657 /* If there is actually space on the stack for this parm,
4658 count it in stack_args_size; otherwise set stack_parm to 0
4659 to indicate there is no preallocated stack slot for the parm. */
4661 if (entry_parm == stack_parm
4662 || (GET_CODE (entry_parm) == PARALLEL
4663 && XEXP (XVECEXP (entry_parm, 0, 0), 0) == NULL_RTX)
4664 #if defined (REG_PARM_STACK_SPACE)
4665 /* On some machines, even if a parm value arrives in a register
4666 there is still an (uninitialized) stack slot allocated
4668 || REG_PARM_STACK_SPACE (fndecl) > 0
4672 stack_args_size.constant += locate.size.constant;
4673 if (locate.size.var)
4674 ADD_PARM_SIZE (stack_args_size, locate.size.var);
4677 /* No stack slot was pushed for this parm. */
4680 /* Update info on where next arg arrives in registers. */
4682 FUNCTION_ARG_ADVANCE (args_so_far, promoted_mode,
4683 passed_type, named_arg);
4685 /* If we can't trust the parm stack slot to be aligned enough
4686 for its ultimate type, don't use that slot after entry.
4687 We'll make another stack slot, if we need one. */
4688 if (STRICT_ALIGNMENT && stack_parm
4689 && GET_MODE_ALIGNMENT (nominal_mode) > MEM_ALIGN (stack_parm))
4692 /* If parm was passed in memory, and we need to convert it on entry,
4693 don't store it back in that same slot. */
4694 if (entry_parm == stack_parm
4695 && nominal_mode != BLKmode && nominal_mode != passed_mode)
4698 /* When an argument is passed in multiple locations, we can't
4699 make use of this information, but we can save some copying if
4700 the whole argument is passed in a single register. */
4701 if (GET_CODE (entry_parm) == PARALLEL
4702 && nominal_mode != BLKmode && passed_mode != BLKmode)
4704 int i, len = XVECLEN (entry_parm, 0);
4706 for (i = 0; i < len; i++)
4707 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
4708 && REG_P (XEXP (XVECEXP (entry_parm, 0, i), 0))
4709 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
4711 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
4713 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
4714 set_decl_incoming_rtl (parm, entry_parm);
4719 /* ENTRY_PARM is an RTX for the parameter as it arrives,
4720 in the mode in which it arrives.
4721 STACK_PARM is an RTX for a stack slot where the parameter can live
4722 during the function (in case we want to put it there).
4723 STACK_PARM is 0 if no stack slot was pushed for it.
4725 Now output code if necessary to convert ENTRY_PARM to
4726 the type in which this function declares it,
4727 and store that result in an appropriate place,
4728 which may be a pseudo reg, may be STACK_PARM,
4729 or may be a local stack slot if STACK_PARM is 0.
4731 Set DECL_RTL to that place. */
4733 if (GET_CODE (entry_parm) == PARALLEL && nominal_mode != BLKmode
4734 && XVECLEN (entry_parm, 0) > 1)
4736 /* Reconstitute objects the size of a register or larger using
4737 register operations instead of the stack. */
4738 rtx parmreg = gen_reg_rtx (nominal_mode);
4740 if (REG_P (parmreg))
4742 unsigned int regno = REGNO (parmreg);
4744 emit_group_store (parmreg, entry_parm, TREE_TYPE (parm),
4745 int_size_in_bytes (TREE_TYPE (parm)));
4746 SET_DECL_RTL (parm, parmreg);
4749 if (regno >= max_parm_reg)
4752 int old_max_parm_reg = max_parm_reg;
4754 /* It's slow to expand this one register at a time,
4755 but it's also rare and we need max_parm_reg to be
4756 precisely correct. */
4757 max_parm_reg = regno + 1;
4758 new = ggc_realloc (parm_reg_stack_loc,
4759 max_parm_reg * sizeof (rtx));
4760 memset (new + old_max_parm_reg, 0,
4761 (max_parm_reg - old_max_parm_reg) * sizeof (rtx));
4762 parm_reg_stack_loc = new;
4763 parm_reg_stack_loc[regno] = stack_parm;
4768 if (nominal_mode == BLKmode
4769 #ifdef BLOCK_REG_PADDING
4770 || (locate.where_pad == (BYTES_BIG_ENDIAN ? upward : downward)
4771 && GET_MODE_SIZE (promoted_mode) < UNITS_PER_WORD)
4773 || GET_CODE (entry_parm) == PARALLEL)
4775 /* If a BLKmode arrives in registers, copy it to a stack slot.
4776 Handle calls that pass values in multiple non-contiguous
4777 locations. The Irix 6 ABI has examples of this. */
4778 if (REG_P (entry_parm)
4779 || (GET_CODE (entry_parm) == PARALLEL
4780 && (!loaded_in_reg || !optimize)))
4782 int size = int_size_in_bytes (TREE_TYPE (parm));
4783 int size_stored = CEIL_ROUND (size, UNITS_PER_WORD);
4786 /* Note that we will be storing an integral number of words.
4787 So we have to be careful to ensure that we allocate an
4788 integral number of words. We do this below in the
4789 assign_stack_local if space was not allocated in the argument
4790 list. If it was, this will not work if PARM_BOUNDARY is not
4791 a multiple of BITS_PER_WORD. It isn't clear how to fix this
4792 if it becomes a problem. Exception is when BLKmode arrives
4793 with arguments not conforming to word_mode. */
4795 if (stack_parm == 0)
4797 stack_parm = assign_stack_local (BLKmode, size_stored, 0);
4798 PUT_MODE (stack_parm, GET_MODE (entry_parm));
4799 set_mem_attributes (stack_parm, parm, 1);
4801 else if (GET_CODE (entry_parm) == PARALLEL)
4803 else if (size != 0 && PARM_BOUNDARY % BITS_PER_WORD != 0)
4806 mem = validize_mem (stack_parm);
4808 /* Handle calls that pass values in multiple non-contiguous
4809 locations. The Irix 6 ABI has examples of this. */
4810 if (GET_CODE (entry_parm) == PARALLEL)
4811 emit_group_store (mem, entry_parm, TREE_TYPE (parm), size);
4816 /* If SIZE is that of a mode no bigger than a word, just use
4817 that mode's store operation. */
4818 else if (size <= UNITS_PER_WORD)
4820 enum machine_mode mode
4821 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
4824 #ifdef BLOCK_REG_PADDING
4825 && (size == UNITS_PER_WORD
4826 || (BLOCK_REG_PADDING (mode, TREE_TYPE (parm), 1)
4827 != (BYTES_BIG_ENDIAN ? upward : downward)))
4831 rtx reg = gen_rtx_REG (mode, REGNO (entry_parm));
4832 emit_move_insn (change_address (mem, mode, 0), reg);
4835 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
4836 machine must be aligned to the left before storing
4837 to memory. Note that the previous test doesn't
4838 handle all cases (e.g. SIZE == 3). */
4839 else if (size != UNITS_PER_WORD
4840 #ifdef BLOCK_REG_PADDING
4841 && (BLOCK_REG_PADDING (mode, TREE_TYPE (parm), 1)
4849 int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
4850 rtx reg = gen_rtx_REG (word_mode, REGNO (entry_parm));
4852 x = expand_binop (word_mode, ashl_optab, reg,
4853 GEN_INT (by), 0, 1, OPTAB_WIDEN);
4854 tem = change_address (mem, word_mode, 0);
4855 emit_move_insn (tem, x);
4858 move_block_from_reg (REGNO (entry_parm), mem,
4859 size_stored / UNITS_PER_WORD);
4862 move_block_from_reg (REGNO (entry_parm), mem,
4863 size_stored / UNITS_PER_WORD);
4865 /* If parm is already bound to register pair, don't change
4867 if (! DECL_RTL_SET_P (parm))
4868 SET_DECL_RTL (parm, stack_parm);
4870 else if (! ((! optimize
4871 && ! DECL_REGISTER (parm))
4872 || TREE_SIDE_EFFECTS (parm)
4873 /* If -ffloat-store specified, don't put explicit
4874 float variables into registers. */
4875 || (flag_float_store
4876 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))
4877 /* Always assign pseudo to structure return or item passed
4878 by invisible reference. */
4879 || passed_pointer || parm == function_result_decl)
4881 /* Store the parm in a pseudoregister during the function, but we
4882 may need to do it in a wider mode. */
4885 unsigned int regno, regnoi = 0, regnor = 0;
4887 unsignedp = TYPE_UNSIGNED (TREE_TYPE (parm));
4889 promoted_nominal_mode
4890 = promote_mode (TREE_TYPE (parm), nominal_mode, &unsignedp, 0);
4892 parmreg = gen_reg_rtx (promoted_nominal_mode);
4893 mark_user_reg (parmreg);
4895 /* If this was an item that we received a pointer to, set DECL_RTL
4899 rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type)),
4901 set_mem_attributes (x, parm, 1);
4902 SET_DECL_RTL (parm, x);
4906 SET_DECL_RTL (parm, parmreg);
4907 maybe_set_unchanging (DECL_RTL (parm), parm);
4910 /* Copy the value into the register. */
4911 if (nominal_mode != passed_mode
4912 || promoted_nominal_mode != promoted_mode)
4915 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
4916 mode, by the caller. We now have to convert it to
4917 NOMINAL_MODE, if different. However, PARMREG may be in
4918 a different mode than NOMINAL_MODE if it is being stored
4921 If ENTRY_PARM is a hard register, it might be in a register
4922 not valid for operating in its mode (e.g., an odd-numbered
4923 register for a DFmode). In that case, moves are the only
4924 thing valid, so we can't do a convert from there. This
4925 occurs when the calling sequence allow such misaligned
4928 In addition, the conversion may involve a call, which could
4929 clobber parameters which haven't been copied to pseudo
4930 registers yet. Therefore, we must first copy the parm to
4931 a pseudo reg here, and save the conversion until after all
4932 parameters have been moved. */
4934 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
4936 emit_move_insn (tempreg, validize_mem (entry_parm));
4938 push_to_sequence (conversion_insns);
4939 tempreg = convert_to_mode (nominal_mode, tempreg, unsignedp);
4941 if (GET_CODE (tempreg) == SUBREG
4942 && GET_MODE (tempreg) == nominal_mode
4943 && REG_P (SUBREG_REG (tempreg))
4944 && nominal_mode == passed_mode
4945 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (entry_parm)
4946 && GET_MODE_SIZE (GET_MODE (tempreg))
4947 < GET_MODE_SIZE (GET_MODE (entry_parm)))
4949 /* The argument is already sign/zero extended, so note it
4951 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
4952 SUBREG_PROMOTED_UNSIGNED_SET (tempreg, unsignedp);
4955 /* TREE_USED gets set erroneously during expand_assignment. */
4956 save_tree_used = TREE_USED (parm);
4957 expand_assignment (parm,
4958 make_tree (nominal_type, tempreg), 0);
4959 TREE_USED (parm) = save_tree_used;
4960 conversion_insns = get_insns ();
4965 emit_move_insn (parmreg, validize_mem (entry_parm));
4967 /* If we were passed a pointer but the actual value
4968 can safely live in a register, put it in one. */
4969 if (passed_pointer && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
4970 /* If by-reference argument was promoted, demote it. */
4971 && (TYPE_MODE (TREE_TYPE (parm)) != GET_MODE (DECL_RTL (parm))
4973 && ! DECL_REGISTER (parm))
4974 || TREE_SIDE_EFFECTS (parm)
4975 /* If -ffloat-store specified, don't put explicit
4976 float variables into registers. */
4977 || (flag_float_store
4978 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))))
4980 /* We can't use nominal_mode, because it will have been set to
4981 Pmode above. We must use the actual mode of the parm. */
4982 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
4983 mark_user_reg (parmreg);
4984 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
4986 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
4987 int unsigned_p = TYPE_UNSIGNED (TREE_TYPE (parm));
4988 push_to_sequence (conversion_insns);
4989 emit_move_insn (tempreg, DECL_RTL (parm));
4991 convert_to_mode (GET_MODE (parmreg),
4994 emit_move_insn (parmreg, DECL_RTL (parm));
4995 conversion_insns = get_insns();
5000 emit_move_insn (parmreg, DECL_RTL (parm));
5001 SET_DECL_RTL (parm, parmreg);
5002 /* STACK_PARM is the pointer, not the parm, and PARMREG is
5006 #ifdef FUNCTION_ARG_CALLEE_COPIES
5007 /* If we are passed an arg by reference and it is our responsibility
5008 to make a copy, do it now.
5009 PASSED_TYPE and PASSED mode now refer to the pointer, not the
5010 original argument, so we must recreate them in the call to
5011 FUNCTION_ARG_CALLEE_COPIES. */
5012 /* ??? Later add code to handle the case that if the argument isn't
5013 modified, don't do the copy. */
5015 else if (passed_pointer
5016 && FUNCTION_ARG_CALLEE_COPIES (args_so_far,
5017 TYPE_MODE (TREE_TYPE (passed_type)),
5018 TREE_TYPE (passed_type),
5020 && ! TREE_ADDRESSABLE (TREE_TYPE (passed_type)))
5023 tree type = TREE_TYPE (passed_type);
5025 /* This sequence may involve a library call perhaps clobbering
5026 registers that haven't been copied to pseudos yet. */
5028 push_to_sequence (conversion_insns);
5030 if (!COMPLETE_TYPE_P (type)
5031 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
5032 /* This is a variable sized object. */
5033 copy = gen_rtx_MEM (BLKmode,
5034 allocate_dynamic_stack_space
5035 (expr_size (parm), NULL_RTX,
5036 TYPE_ALIGN (type)));
5038 copy = assign_stack_temp (TYPE_MODE (type),
5039 int_size_in_bytes (type), 1);
5040 set_mem_attributes (copy, parm, 1);
5042 store_expr (parm, copy, 0);
5043 emit_move_insn (parmreg, XEXP (copy, 0));
5044 conversion_insns = get_insns ();
5048 #endif /* FUNCTION_ARG_CALLEE_COPIES */
5050 /* In any case, record the parm's desired stack location
5051 in case we later discover it must live in the stack.
5053 If it is a COMPLEX value, store the stack location for both
5056 if (GET_CODE (parmreg) == CONCAT)
5057 regno = MAX (REGNO (XEXP (parmreg, 0)), REGNO (XEXP (parmreg, 1)));
5059 regno = REGNO (parmreg);
5061 if (regno >= max_parm_reg)
5064 int old_max_parm_reg = max_parm_reg;
5066 /* It's slow to expand this one register at a time,
5067 but it's also rare and we need max_parm_reg to be
5068 precisely correct. */
5069 max_parm_reg = regno + 1;
5070 new = ggc_realloc (parm_reg_stack_loc,
5071 max_parm_reg * sizeof (rtx));
5072 memset (new + old_max_parm_reg, 0,
5073 (max_parm_reg - old_max_parm_reg) * sizeof (rtx));
5074 parm_reg_stack_loc = new;
5077 if (GET_CODE (parmreg) == CONCAT)
5079 enum machine_mode submode = GET_MODE (XEXP (parmreg, 0));
5081 regnor = REGNO (gen_realpart (submode, parmreg));
5082 regnoi = REGNO (gen_imagpart (submode, parmreg));
5084 if (stack_parm != 0)
5086 parm_reg_stack_loc[regnor]
5087 = gen_realpart (submode, stack_parm);
5088 parm_reg_stack_loc[regnoi]
5089 = gen_imagpart (submode, stack_parm);
5093 parm_reg_stack_loc[regnor] = 0;
5094 parm_reg_stack_loc[regnoi] = 0;
5098 parm_reg_stack_loc[REGNO (parmreg)] = stack_parm;
5100 /* Mark the register as eliminable if we did no conversion
5101 and it was copied from memory at a fixed offset,
5102 and the arg pointer was not copied to a pseudo-reg.
5103 If the arg pointer is a pseudo reg or the offset formed
5104 an invalid address, such memory-equivalences
5105 as we make here would screw up life analysis for it. */
5106 if (nominal_mode == passed_mode
5109 && MEM_P (stack_parm)
5110 && locate.offset.var == 0
5111 && reg_mentioned_p (virtual_incoming_args_rtx,
5112 XEXP (stack_parm, 0)))
5114 rtx linsn = get_last_insn ();
5117 /* Mark complex types separately. */
5118 if (GET_CODE (parmreg) == CONCAT)
5119 /* Scan backwards for the set of the real and
5121 for (sinsn = linsn; sinsn != 0;
5122 sinsn = prev_nonnote_insn (sinsn))
5124 set = single_set (sinsn);
5126 && SET_DEST (set) == regno_reg_rtx [regnoi])
5128 = gen_rtx_EXPR_LIST (REG_EQUIV,
5129 parm_reg_stack_loc[regnoi],
5132 && SET_DEST (set) == regno_reg_rtx [regnor])
5134 = gen_rtx_EXPR_LIST (REG_EQUIV,
5135 parm_reg_stack_loc[regnor],
5138 else if ((set = single_set (linsn)) != 0
5139 && SET_DEST (set) == parmreg)
5141 = gen_rtx_EXPR_LIST (REG_EQUIV,
5142 stack_parm, REG_NOTES (linsn));
5145 /* For pointer data type, suggest pointer register. */
5146 if (POINTER_TYPE_P (TREE_TYPE (parm)))
5147 mark_reg_pointer (parmreg,
5148 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
5150 /* If something wants our address, try to use ADDRESSOF. */
5151 if (TREE_ADDRESSABLE (parm))
5153 /* If we end up putting something into the stack,
5154 fixup_var_refs_insns will need to make a pass over
5155 all the instructions. It looks through the pending
5156 sequences -- but it can't see the ones in the
5157 CONVERSION_INSNS, if they're not on the sequence
5158 stack. So, we go back to that sequence, just so that
5159 the fixups will happen. */
5160 push_to_sequence (conversion_insns);
5161 put_var_into_stack (parm, /*rescan=*/true);
5162 conversion_insns = get_insns ();
5168 /* Value must be stored in the stack slot STACK_PARM
5169 during function execution. */
5171 if (promoted_mode != nominal_mode)
5173 /* Conversion is required. */
5174 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
5176 emit_move_insn (tempreg, validize_mem (entry_parm));
5178 push_to_sequence (conversion_insns);
5179 entry_parm = convert_to_mode (nominal_mode, tempreg,
5180 TYPE_UNSIGNED (TREE_TYPE (parm)));
5182 /* ??? This may need a big-endian conversion on sparc64. */
5183 stack_parm = adjust_address (stack_parm, nominal_mode, 0);
5185 conversion_insns = get_insns ();
5190 if (entry_parm != stack_parm)
5192 if (stack_parm == 0)
5195 = assign_stack_local (GET_MODE (entry_parm),
5196 GET_MODE_SIZE (GET_MODE (entry_parm)),
5198 set_mem_attributes (stack_parm, parm, 1);
5201 if (promoted_mode != nominal_mode)
5203 push_to_sequence (conversion_insns);
5204 emit_move_insn (validize_mem (stack_parm),
5205 validize_mem (entry_parm));
5206 conversion_insns = get_insns ();
5210 emit_move_insn (validize_mem (stack_parm),
5211 validize_mem (entry_parm));
5214 SET_DECL_RTL (parm, stack_parm);
5218 if (targetm.calls.split_complex_arg && fnargs != orig_fnargs)
5220 for (parm = orig_fnargs; parm; parm = TREE_CHAIN (parm))
5222 if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
5223 && targetm.calls.split_complex_arg (TREE_TYPE (parm)))
5225 rtx tmp, real, imag;
5226 enum machine_mode inner = GET_MODE_INNER (DECL_MODE (parm));
5228 real = DECL_RTL (fnargs);
5229 imag = DECL_RTL (TREE_CHAIN (fnargs));
5230 if (inner != GET_MODE (real))
5232 real = gen_lowpart_SUBREG (inner, real);
5233 imag = gen_lowpart_SUBREG (inner, imag);
5235 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
5236 SET_DECL_RTL (parm, tmp);
5238 real = DECL_INCOMING_RTL (fnargs);
5239 imag = DECL_INCOMING_RTL (TREE_CHAIN (fnargs));
5240 if (inner != GET_MODE (real))
5242 real = gen_lowpart_SUBREG (inner, real);
5243 imag = gen_lowpart_SUBREG (inner, imag);
5245 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
5246 set_decl_incoming_rtl (parm, tmp);
5247 fnargs = TREE_CHAIN (fnargs);
5251 SET_DECL_RTL (parm, DECL_RTL (fnargs));
5252 set_decl_incoming_rtl (parm, DECL_INCOMING_RTL (fnargs));
5254 /* Set MEM_EXPR to the original decl, i.e. to PARM,
5255 instead of the copy of decl, i.e. FNARGS. */
5256 if (DECL_INCOMING_RTL (parm)
5257 && MEM_P (DECL_INCOMING_RTL (parm)))
5258 set_mem_expr (DECL_INCOMING_RTL (parm), parm);
5260 fnargs = TREE_CHAIN (fnargs);
5264 /* Output all parameter conversion instructions (possibly including calls)
5265 now that all parameters have been copied out of hard registers. */
5266 emit_insn (conversion_insns);
5268 /* If we are receiving a struct value address as the first argument, set up
5269 the RTL for the function result. As this might require code to convert
5270 the transmitted address to Pmode, we do this here to ensure that possible
5271 preliminary conversions of the address have been emitted already. */
5272 if (function_result_decl)
5274 tree result = DECL_RESULT (fndecl);
5275 rtx addr = DECL_RTL (function_result_decl);
5278 addr = convert_memory_address (Pmode, addr);
5279 x = gen_rtx_MEM (DECL_MODE (result), addr);
5280 set_mem_attributes (x, result, 1);
5281 SET_DECL_RTL (result, x);
5284 /* We have aligned all the args, so add space for the pretend args. */
5285 stack_args_size.constant += extra_pretend_bytes;
5286 current_function_args_size = stack_args_size.constant;
5288 /* Adjust function incoming argument size for alignment and
5291 #ifdef REG_PARM_STACK_SPACE
5292 current_function_args_size = MAX (current_function_args_size,
5293 REG_PARM_STACK_SPACE (fndecl));
5296 current_function_args_size
5297 = ((current_function_args_size + STACK_BYTES - 1)
5298 / STACK_BYTES) * STACK_BYTES;
5300 #ifdef ARGS_GROW_DOWNWARD
5301 current_function_arg_offset_rtx
5302 = (stack_args_size.var == 0 ? GEN_INT (-stack_args_size.constant)
5303 : expand_expr (size_diffop (stack_args_size.var,
5304 size_int (-stack_args_size.constant)),
5305 NULL_RTX, VOIDmode, 0));
5307 current_function_arg_offset_rtx = ARGS_SIZE_RTX (stack_args_size);
5310 /* See how many bytes, if any, of its args a function should try to pop
5313 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
5314 current_function_args_size);
5316 /* For stdarg.h function, save info about
5317 regs and stack space used by the named args. */
5319 current_function_args_info = args_so_far;
5321 /* Set the rtx used for the function return value. Put this in its
5322 own variable so any optimizers that need this information don't have
5323 to include tree.h. Do this here so it gets done when an inlined
5324 function gets output. */
5326 current_function_return_rtx
5327 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
5328 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
5330 /* If scalar return value was computed in a pseudo-reg, or was a named
5331 return value that got dumped to the stack, copy that to the hard
5333 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
5335 tree decl_result = DECL_RESULT (fndecl);
5336 rtx decl_rtl = DECL_RTL (decl_result);
5338 if (REG_P (decl_rtl)
5339 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
5340 : DECL_REGISTER (decl_result))
5344 #ifdef FUNCTION_OUTGOING_VALUE
5345 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
5348 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
5351 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
5352 /* The delay slot scheduler assumes that current_function_return_rtx
5353 holds the hard register containing the return value, not a
5354 temporary pseudo. */
5355 current_function_return_rtx = real_decl_rtl;
5360 /* If ARGS contains entries with complex types, split the entry into two
5361 entries of the component type. Return a new list of substitutions are
5362 needed, else the old list. */
5365 split_complex_args (tree args)
5369 /* Before allocating memory, check for the common case of no complex. */
5370 for (p = args; p; p = TREE_CHAIN (p))
5372 tree type = TREE_TYPE (p);
5373 if (TREE_CODE (type) == COMPLEX_TYPE
5374 && targetm.calls.split_complex_arg (type))
5380 args = copy_list (args);
5382 for (p = args; p; p = TREE_CHAIN (p))
5384 tree type = TREE_TYPE (p);
5385 if (TREE_CODE (type) == COMPLEX_TYPE
5386 && targetm.calls.split_complex_arg (type))
5389 tree subtype = TREE_TYPE (type);
5391 /* Rewrite the PARM_DECL's type with its component. */
5392 TREE_TYPE (p) = subtype;
5393 DECL_ARG_TYPE (p) = TREE_TYPE (DECL_ARG_TYPE (p));
5394 DECL_MODE (p) = VOIDmode;
5395 DECL_SIZE (p) = NULL;
5396 DECL_SIZE_UNIT (p) = NULL;
5399 /* Build a second synthetic decl. */
5400 decl = build_decl (PARM_DECL, NULL_TREE, subtype);
5401 DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (p);
5402 layout_decl (decl, 0);
5404 /* Splice it in; skip the new decl. */
5405 TREE_CHAIN (decl) = TREE_CHAIN (p);
5406 TREE_CHAIN (p) = decl;
5414 /* Indicate whether REGNO is an incoming argument to the current function
5415 that was promoted to a wider mode. If so, return the RTX for the
5416 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
5417 that REGNO is promoted from and whether the promotion was signed or
5421 promoted_input_arg (unsigned int regno, enum machine_mode *pmode, int *punsignedp)
5425 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
5426 arg = TREE_CHAIN (arg))
5427 if (REG_P (DECL_INCOMING_RTL (arg))
5428 && REGNO (DECL_INCOMING_RTL (arg)) == regno
5429 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
5431 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
5432 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (arg));
5434 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
5435 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
5436 && mode != DECL_MODE (arg))
5438 *pmode = DECL_MODE (arg);
5439 *punsignedp = unsignedp;
5440 return DECL_INCOMING_RTL (arg);
5448 /* Compute the size and offset from the start of the stacked arguments for a
5449 parm passed in mode PASSED_MODE and with type TYPE.
5451 INITIAL_OFFSET_PTR points to the current offset into the stacked
5454 The starting offset and size for this parm are returned in
5455 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
5456 nonzero, the offset is that of stack slot, which is returned in
5457 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
5458 padding required from the initial offset ptr to the stack slot.
5460 IN_REGS is nonzero if the argument will be passed in registers. It will
5461 never be set if REG_PARM_STACK_SPACE is not defined.
5463 FNDECL is the function in which the argument was defined.
5465 There are two types of rounding that are done. The first, controlled by
5466 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
5467 list to be aligned to the specific boundary (in bits). This rounding
5468 affects the initial and starting offsets, but not the argument size.
5470 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
5471 optionally rounds the size of the parm to PARM_BOUNDARY. The
5472 initial offset is not affected by this rounding, while the size always
5473 is and the starting offset may be. */
5475 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
5476 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
5477 callers pass in the total size of args so far as
5478 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
5481 locate_and_pad_parm (enum machine_mode passed_mode, tree type, int in_regs,
5482 int partial, tree fndecl ATTRIBUTE_UNUSED,
5483 struct args_size *initial_offset_ptr,
5484 struct locate_and_pad_arg_data *locate)
5487 enum direction where_pad;
5489 int reg_parm_stack_space = 0;
5490 int part_size_in_regs;
5492 #ifdef REG_PARM_STACK_SPACE
5493 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
5495 /* If we have found a stack parm before we reach the end of the
5496 area reserved for registers, skip that area. */
5499 if (reg_parm_stack_space > 0)
5501 if (initial_offset_ptr->var)
5503 initial_offset_ptr->var
5504 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
5505 ssize_int (reg_parm_stack_space));
5506 initial_offset_ptr->constant = 0;
5508 else if (initial_offset_ptr->constant < reg_parm_stack_space)
5509 initial_offset_ptr->constant = reg_parm_stack_space;
5512 #endif /* REG_PARM_STACK_SPACE */
5514 part_size_in_regs = 0;
5515 if (reg_parm_stack_space == 0)
5516 part_size_in_regs = ((partial * UNITS_PER_WORD)
5517 / (PARM_BOUNDARY / BITS_PER_UNIT)
5518 * (PARM_BOUNDARY / BITS_PER_UNIT));
5521 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
5522 where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
5523 boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
5524 locate->where_pad = where_pad;
5526 #ifdef ARGS_GROW_DOWNWARD
5527 locate->slot_offset.constant = -initial_offset_ptr->constant;
5528 if (initial_offset_ptr->var)
5529 locate->slot_offset.var = size_binop (MINUS_EXPR, ssize_int (0),
5530 initial_offset_ptr->var);
5534 if (where_pad != none
5535 && (!host_integerp (sizetree, 1)
5536 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5537 s2 = round_up (s2, PARM_BOUNDARY / BITS_PER_UNIT);
5538 SUB_PARM_SIZE (locate->slot_offset, s2);
5541 locate->slot_offset.constant += part_size_in_regs;
5544 #ifdef REG_PARM_STACK_SPACE
5545 || REG_PARM_STACK_SPACE (fndecl) > 0
5548 pad_to_arg_alignment (&locate->slot_offset, boundary,
5549 &locate->alignment_pad);
5551 locate->size.constant = (-initial_offset_ptr->constant
5552 - locate->slot_offset.constant);
5553 if (initial_offset_ptr->var)
5554 locate->size.var = size_binop (MINUS_EXPR,
5555 size_binop (MINUS_EXPR,
5557 initial_offset_ptr->var),
5558 locate->slot_offset.var);
5560 /* Pad_below needs the pre-rounded size to know how much to pad
5562 locate->offset = locate->slot_offset;
5563 if (where_pad == downward)
5564 pad_below (&locate->offset, passed_mode, sizetree);
5566 #else /* !ARGS_GROW_DOWNWARD */
5568 #ifdef REG_PARM_STACK_SPACE
5569 || REG_PARM_STACK_SPACE (fndecl) > 0
5572 pad_to_arg_alignment (initial_offset_ptr, boundary,
5573 &locate->alignment_pad);
5574 locate->slot_offset = *initial_offset_ptr;
5576 #ifdef PUSH_ROUNDING
5577 if (passed_mode != BLKmode)
5578 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
5581 /* Pad_below needs the pre-rounded size to know how much to pad below
5582 so this must be done before rounding up. */
5583 locate->offset = locate->slot_offset;
5584 if (where_pad == downward)
5585 pad_below (&locate->offset, passed_mode, sizetree);
5587 if (where_pad != none
5588 && (!host_integerp (sizetree, 1)
5589 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5590 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5592 ADD_PARM_SIZE (locate->size, sizetree);
5594 locate->size.constant -= part_size_in_regs;
5595 #endif /* ARGS_GROW_DOWNWARD */
5598 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
5599 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
5602 pad_to_arg_alignment (struct args_size *offset_ptr, int boundary,
5603 struct args_size *alignment_pad)
5605 tree save_var = NULL_TREE;
5606 HOST_WIDE_INT save_constant = 0;
5607 int boundary_in_bytes = boundary / BITS_PER_UNIT;
5608 HOST_WIDE_INT sp_offset = STACK_POINTER_OFFSET;
5610 #ifdef SPARC_STACK_BOUNDARY_HACK
5611 /* The sparc port has a bug. It sometimes claims a STACK_BOUNDARY
5612 higher than the real alignment of %sp. However, when it does this,
5613 the alignment of %sp+STACK_POINTER_OFFSET will be STACK_BOUNDARY.
5614 This is a temporary hack while the sparc port is fixed. */
5615 if (SPARC_STACK_BOUNDARY_HACK)
5619 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5621 save_var = offset_ptr->var;
5622 save_constant = offset_ptr->constant;
5625 alignment_pad->var = NULL_TREE;
5626 alignment_pad->constant = 0;
5628 if (boundary > BITS_PER_UNIT)
5630 if (offset_ptr->var)
5632 tree sp_offset_tree = ssize_int (sp_offset);
5633 tree offset = size_binop (PLUS_EXPR,
5634 ARGS_SIZE_TREE (*offset_ptr),
5636 #ifdef ARGS_GROW_DOWNWARD
5637 tree rounded = round_down (offset, boundary / BITS_PER_UNIT);
5639 tree rounded = round_up (offset, boundary / BITS_PER_UNIT);
5642 offset_ptr->var = size_binop (MINUS_EXPR, rounded, sp_offset_tree);
5643 /* ARGS_SIZE_TREE includes constant term. */
5644 offset_ptr->constant = 0;
5645 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5646 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
5651 offset_ptr->constant = -sp_offset +
5652 #ifdef ARGS_GROW_DOWNWARD
5653 FLOOR_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
5655 CEIL_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
5657 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5658 alignment_pad->constant = offset_ptr->constant - save_constant;
5664 pad_below (struct args_size *offset_ptr, enum machine_mode passed_mode, tree sizetree)
5666 if (passed_mode != BLKmode)
5668 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
5669 offset_ptr->constant
5670 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
5671 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
5672 - GET_MODE_SIZE (passed_mode));
5676 if (TREE_CODE (sizetree) != INTEGER_CST
5677 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
5679 /* Round the size up to multiple of PARM_BOUNDARY bits. */
5680 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5682 ADD_PARM_SIZE (*offset_ptr, s2);
5683 SUB_PARM_SIZE (*offset_ptr, sizetree);
5688 /* Walk the tree of blocks describing the binding levels within a function
5689 and warn about variables the might be killed by setjmp or vfork.
5690 This is done after calling flow_analysis and before global_alloc
5691 clobbers the pseudo-regs to hard regs. */
5694 setjmp_vars_warning (tree block)
5698 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5700 if (TREE_CODE (decl) == VAR_DECL
5701 && DECL_RTL_SET_P (decl)
5702 && REG_P (DECL_RTL (decl))
5703 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5704 warning ("%Jvariable '%D' might be clobbered by `longjmp' or `vfork'",
5708 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5709 setjmp_vars_warning (sub);
5712 /* Do the appropriate part of setjmp_vars_warning
5713 but for arguments instead of local variables. */
5716 setjmp_args_warning (void)
5719 for (decl = DECL_ARGUMENTS (current_function_decl);
5720 decl; decl = TREE_CHAIN (decl))
5721 if (DECL_RTL (decl) != 0
5722 && REG_P (DECL_RTL (decl))
5723 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5724 warning ("%Jargument '%D' might be clobbered by `longjmp' or `vfork'",
5728 /* If this function call setjmp, put all vars into the stack
5729 unless they were declared `register'. */
5732 setjmp_protect (tree block)
5735 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5736 if ((TREE_CODE (decl) == VAR_DECL
5737 || TREE_CODE (decl) == PARM_DECL)
5738 && DECL_RTL (decl) != 0
5739 && (REG_P (DECL_RTL (decl))
5740 || (MEM_P (DECL_RTL (decl))
5741 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5742 /* If this variable came from an inline function, it must be
5743 that its life doesn't overlap the setjmp. If there was a
5744 setjmp in the function, it would already be in memory. We
5745 must exclude such variable because their DECL_RTL might be
5746 set to strange things such as virtual_stack_vars_rtx. */
5747 && ! DECL_FROM_INLINE (decl)
5749 #ifdef NON_SAVING_SETJMP
5750 /* If longjmp doesn't restore the registers,
5751 don't put anything in them. */
5755 ! DECL_REGISTER (decl)))
5756 put_var_into_stack (decl, /*rescan=*/true);
5757 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5758 setjmp_protect (sub);
5761 /* Like the previous function, but for args instead of local variables. */
5764 setjmp_protect_args (void)
5767 for (decl = DECL_ARGUMENTS (current_function_decl);
5768 decl; decl = TREE_CHAIN (decl))
5769 if ((TREE_CODE (decl) == VAR_DECL
5770 || TREE_CODE (decl) == PARM_DECL)
5771 && DECL_RTL (decl) != 0
5772 && (REG_P (DECL_RTL (decl))
5773 || (MEM_P (DECL_RTL (decl))
5774 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5776 /* If longjmp doesn't restore the registers,
5777 don't put anything in them. */
5778 #ifdef NON_SAVING_SETJMP
5782 ! DECL_REGISTER (decl)))
5783 put_var_into_stack (decl, /*rescan=*/true);
5786 /* Convert a stack slot address ADDR for variable VAR
5787 (from a containing function)
5788 into an address valid in this function (using a static chain). */
5791 fix_lexical_addr (rtx addr, tree var)
5794 HOST_WIDE_INT displacement;
5795 tree context = decl_function_context (var);
5796 struct function *fp;
5799 /* If this is the present function, we need not do anything. */
5800 if (context == current_function_decl)
5803 fp = find_function_data (context);
5805 if (GET_CODE (addr) == ADDRESSOF && MEM_P (XEXP (addr, 0)))
5806 addr = XEXP (XEXP (addr, 0), 0);
5808 /* Decode given address as base reg plus displacement. */
5810 basereg = addr, displacement = 0;
5811 else if (GET_CODE (addr) == PLUS && GET_CODE (XEXP (addr, 1)) == CONST_INT)
5812 basereg = XEXP (addr, 0), displacement = INTVAL (XEXP (addr, 1));
5819 /* Use same offset, relative to appropriate static chain or argument
5821 return plus_constant (base, displacement);
5824 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
5825 and create duplicate blocks. */
5826 /* ??? Need an option to either create block fragments or to create
5827 abstract origin duplicates of a source block. It really depends
5828 on what optimization has been performed. */
5831 reorder_blocks (void)
5833 tree block = DECL_INITIAL (current_function_decl);
5834 varray_type block_stack;
5836 if (block == NULL_TREE)
5839 VARRAY_TREE_INIT (block_stack, 10, "block_stack");
5841 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
5842 clear_block_marks (block);
5844 /* Prune the old trees away, so that they don't get in the way. */
5845 BLOCK_SUBBLOCKS (block) = NULL_TREE;
5846 BLOCK_CHAIN (block) = NULL_TREE;
5848 /* Recreate the block tree from the note nesting. */
5849 reorder_blocks_1 (get_insns (), block, &block_stack);
5850 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
5852 /* Remove deleted blocks from the block fragment chains. */
5853 reorder_fix_fragments (block);
5856 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
5859 clear_block_marks (tree block)
5863 TREE_ASM_WRITTEN (block) = 0;
5864 clear_block_marks (BLOCK_SUBBLOCKS (block));
5865 block = BLOCK_CHAIN (block);
5870 reorder_blocks_1 (rtx insns, tree current_block, varray_type *p_block_stack)
5874 for (insn = insns; insn; insn = NEXT_INSN (insn))
5876 if (GET_CODE (insn) == NOTE)
5878 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
5880 tree block = NOTE_BLOCK (insn);
5882 /* If we have seen this block before, that means it now
5883 spans multiple address regions. Create a new fragment. */
5884 if (TREE_ASM_WRITTEN (block))
5886 tree new_block = copy_node (block);
5889 origin = (BLOCK_FRAGMENT_ORIGIN (block)
5890 ? BLOCK_FRAGMENT_ORIGIN (block)
5892 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
5893 BLOCK_FRAGMENT_CHAIN (new_block)
5894 = BLOCK_FRAGMENT_CHAIN (origin);
5895 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
5897 NOTE_BLOCK (insn) = new_block;
5901 BLOCK_SUBBLOCKS (block) = 0;
5902 TREE_ASM_WRITTEN (block) = 1;
5903 /* When there's only one block for the entire function,
5904 current_block == block and we mustn't do this, it
5905 will cause infinite recursion. */
5906 if (block != current_block)
5908 BLOCK_SUPERCONTEXT (block) = current_block;
5909 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
5910 BLOCK_SUBBLOCKS (current_block) = block;
5911 current_block = block;
5913 VARRAY_PUSH_TREE (*p_block_stack, block);
5915 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
5917 NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack);
5918 VARRAY_POP (*p_block_stack);
5919 BLOCK_SUBBLOCKS (current_block)
5920 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
5921 current_block = BLOCK_SUPERCONTEXT (current_block);
5927 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
5928 appears in the block tree, select one of the fragments to become
5929 the new origin block. */
5932 reorder_fix_fragments (tree block)
5936 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
5937 tree new_origin = NULL_TREE;
5941 if (! TREE_ASM_WRITTEN (dup_origin))
5943 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
5945 /* Find the first of the remaining fragments. There must
5946 be at least one -- the current block. */
5947 while (! TREE_ASM_WRITTEN (new_origin))
5948 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
5949 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
5952 else if (! dup_origin)
5955 /* Re-root the rest of the fragments to the new origin. In the
5956 case that DUP_ORIGIN was null, that means BLOCK was the origin
5957 of a chain of fragments and we want to remove those fragments
5958 that didn't make it to the output. */
5961 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
5966 if (TREE_ASM_WRITTEN (chain))
5968 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
5970 pp = &BLOCK_FRAGMENT_CHAIN (chain);
5972 chain = BLOCK_FRAGMENT_CHAIN (chain);
5977 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
5978 block = BLOCK_CHAIN (block);
5982 /* Reverse the order of elements in the chain T of blocks,
5983 and return the new head of the chain (old last element). */
5986 blocks_nreverse (tree t)
5988 tree prev = 0, decl, next;
5989 for (decl = t; decl; decl = next)
5991 next = BLOCK_CHAIN (decl);
5992 BLOCK_CHAIN (decl) = prev;
5998 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
5999 non-NULL, list them all into VECTOR, in a depth-first preorder
6000 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
6004 all_blocks (tree block, tree *vector)
6010 TREE_ASM_WRITTEN (block) = 0;
6012 /* Record this block. */
6014 vector[n_blocks] = block;
6018 /* Record the subblocks, and their subblocks... */
6019 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
6020 vector ? vector + n_blocks : 0);
6021 block = BLOCK_CHAIN (block);
6027 /* Return a vector containing all the blocks rooted at BLOCK. The
6028 number of elements in the vector is stored in N_BLOCKS_P. The
6029 vector is dynamically allocated; it is the caller's responsibility
6030 to call `free' on the pointer returned. */
6033 get_block_vector (tree block, int *n_blocks_p)
6037 *n_blocks_p = all_blocks (block, NULL);
6038 block_vector = xmalloc (*n_blocks_p * sizeof (tree));
6039 all_blocks (block, block_vector);
6041 return block_vector;
6044 static GTY(()) int next_block_index = 2;
6046 /* Set BLOCK_NUMBER for all the blocks in FN. */
6049 number_blocks (tree fn)
6055 /* For SDB and XCOFF debugging output, we start numbering the blocks
6056 from 1 within each function, rather than keeping a running
6058 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
6059 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
6060 next_block_index = 1;
6063 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
6065 /* The top-level BLOCK isn't numbered at all. */
6066 for (i = 1; i < n_blocks; ++i)
6067 /* We number the blocks from two. */
6068 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
6070 free (block_vector);
6075 /* If VAR is present in a subblock of BLOCK, return the subblock. */
6078 debug_find_var_in_block_tree (tree var, tree block)
6082 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
6086 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
6088 tree ret = debug_find_var_in_block_tree (var, t);
6096 /* Allocate a function structure for FNDECL and set its contents
6100 allocate_struct_function (tree fndecl)
6103 tree fntype = fndecl ? TREE_TYPE (fndecl) : NULL_TREE;
6105 cfun = ggc_alloc_cleared (sizeof (struct function));
6107 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
6109 cfun->stack_alignment_needed = STACK_BOUNDARY;
6110 cfun->preferred_stack_boundary = STACK_BOUNDARY;
6112 current_function_funcdef_no = funcdef_no++;
6114 cfun->function_frequency = FUNCTION_FREQUENCY_NORMAL;
6116 init_stmt_for_function ();
6117 init_eh_for_function ();
6119 lang_hooks.function.init (cfun);
6120 if (init_machine_status)
6121 cfun->machine = (*init_machine_status) ();
6126 DECL_STRUCT_FUNCTION (fndecl) = cfun;
6127 cfun->decl = fndecl;
6129 result = DECL_RESULT (fndecl);
6130 if (aggregate_value_p (result, fndecl))
6132 #ifdef PCC_STATIC_STRUCT_RETURN
6133 current_function_returns_pcc_struct = 1;
6135 current_function_returns_struct = 1;
6138 current_function_returns_pointer = POINTER_TYPE_P (TREE_TYPE (result));
6140 current_function_stdarg
6142 && TYPE_ARG_TYPES (fntype) != 0
6143 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
6144 != void_type_node));
6147 /* Reset cfun, and other non-struct-function variables to defaults as
6148 appropriate for emitting rtl at the start of a function. */
6151 prepare_function_start (tree fndecl)
6153 if (fndecl && DECL_STRUCT_FUNCTION (fndecl))
6154 cfun = DECL_STRUCT_FUNCTION (fndecl);
6156 allocate_struct_function (fndecl);
6158 init_varasm_status (cfun);
6161 cse_not_expected = ! optimize;
6163 /* Caller save not needed yet. */
6164 caller_save_needed = 0;
6166 /* We haven't done register allocation yet. */
6169 /* Indicate that we need to distinguish between the return value of the
6170 present function and the return value of a function being called. */
6171 rtx_equal_function_value_matters = 1;
6173 /* Indicate that we have not instantiated virtual registers yet. */
6174 virtuals_instantiated = 0;
6176 /* Indicate that we want CONCATs now. */
6177 generating_concat_p = 1;
6179 /* Indicate we have no need of a frame pointer yet. */
6180 frame_pointer_needed = 0;
6183 /* Initialize the rtl expansion mechanism so that we can do simple things
6184 like generate sequences. This is used to provide a context during global
6185 initialization of some passes. */
6187 init_dummy_function_start (void)
6189 prepare_function_start (NULL);
6192 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
6193 and initialize static variables for generating RTL for the statements
6197 init_function_start (tree subr)
6199 prepare_function_start (subr);
6201 /* Prevent ever trying to delete the first instruction of a
6202 function. Also tell final how to output a linenum before the
6203 function prologue. Note linenums could be missing, e.g. when
6204 compiling a Java .class file. */
6205 if (! DECL_IS_BUILTIN (subr))
6206 emit_line_note (DECL_SOURCE_LOCATION (subr));
6208 /* Make sure first insn is a note even if we don't want linenums.
6209 This makes sure the first insn will never be deleted.
6210 Also, final expects a note to appear there. */
6211 emit_note (NOTE_INSN_DELETED);
6213 /* Warn if this value is an aggregate type,
6214 regardless of which calling convention we are using for it. */
6215 if (warn_aggregate_return
6216 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
6217 warning ("function returns an aggregate");
6220 /* Make sure all values used by the optimization passes have sane
6223 init_function_for_compilation (void)
6227 /* No prologue/epilogue insns yet. */
6228 VARRAY_GROW (prologue, 0);
6229 VARRAY_GROW (epilogue, 0);
6230 VARRAY_GROW (sibcall_epilogue, 0);
6233 /* Expand a call to __main at the beginning of a possible main function. */
6235 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
6236 #undef HAS_INIT_SECTION
6237 #define HAS_INIT_SECTION
6241 expand_main_function (void)
6243 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
6244 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
6246 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
6250 /* Forcibly align the stack. */
6251 #ifdef STACK_GROWS_DOWNWARD
6252 tmp = expand_simple_binop (Pmode, AND, stack_pointer_rtx, GEN_INT(-align),
6253 stack_pointer_rtx, 1, OPTAB_WIDEN);
6255 tmp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
6256 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
6257 tmp = expand_simple_binop (Pmode, AND, tmp, GEN_INT (-align),
6258 stack_pointer_rtx, 1, OPTAB_WIDEN);
6260 if (tmp != stack_pointer_rtx)
6261 emit_move_insn (stack_pointer_rtx, tmp);
6263 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
6264 tmp = force_reg (Pmode, const0_rtx);
6265 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
6269 for (tmp = get_last_insn (); tmp; tmp = PREV_INSN (tmp))
6270 if (NOTE_P (tmp) && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_FUNCTION_BEG)
6273 emit_insn_before (seq, tmp);
6279 #ifndef HAS_INIT_SECTION
6280 emit_library_call (init_one_libfunc (NAME__MAIN), LCT_NORMAL, VOIDmode, 0);
6284 /* The PENDING_SIZES represent the sizes of variable-sized types.
6285 Create RTL for the various sizes now (using temporary variables),
6286 so that we can refer to the sizes from the RTL we are generating
6287 for the current function. The PENDING_SIZES are a TREE_LIST. The
6288 TREE_VALUE of each node is a SAVE_EXPR. */
6291 expand_pending_sizes (tree pending_sizes)
6295 /* Evaluate now the sizes of any types declared among the arguments. */
6296 for (tem = pending_sizes; tem; tem = TREE_CHAIN (tem))
6298 expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode, 0);
6299 /* Flush the queue in case this parameter declaration has
6305 /* Start the RTL for a new function, and set variables used for
6307 SUBR is the FUNCTION_DECL node.
6308 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
6309 the function's parameters, which must be run at any return statement. */
6312 expand_function_start (tree subr)
6314 /* Make sure volatile mem refs aren't considered
6315 valid operands of arithmetic insns. */
6316 init_recog_no_volatile ();
6318 current_function_profile
6320 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
6322 current_function_limit_stack
6323 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
6325 /* Make the label for return statements to jump to. Do not special
6326 case machines with special return instructions -- they will be
6327 handled later during jump, ifcvt, or epilogue creation. */
6328 return_label = gen_label_rtx ();
6330 /* Initialize rtx used to return the value. */
6331 /* Do this before assign_parms so that we copy the struct value address
6332 before any library calls that assign parms might generate. */
6334 /* Decide whether to return the value in memory or in a register. */
6335 if (aggregate_value_p (DECL_RESULT (subr), subr))
6337 /* Returning something that won't go in a register. */
6338 rtx value_address = 0;
6340 #ifdef PCC_STATIC_STRUCT_RETURN
6341 if (current_function_returns_pcc_struct)
6343 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
6344 value_address = assemble_static_space (size);
6349 rtx sv = targetm.calls.struct_value_rtx (TREE_TYPE (subr), 1);
6350 /* Expect to be passed the address of a place to store the value.
6351 If it is passed as an argument, assign_parms will take care of
6355 value_address = gen_reg_rtx (Pmode);
6356 emit_move_insn (value_address, sv);
6361 rtx x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), value_address);
6362 set_mem_attributes (x, DECL_RESULT (subr), 1);
6363 SET_DECL_RTL (DECL_RESULT (subr), x);
6366 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
6367 /* If return mode is void, this decl rtl should not be used. */
6368 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
6371 /* Compute the return values into a pseudo reg, which we will copy
6372 into the true return register after the cleanups are done. */
6374 /* In order to figure out what mode to use for the pseudo, we
6375 figure out what the mode of the eventual return register will
6376 actually be, and use that. */
6378 = hard_function_value (TREE_TYPE (DECL_RESULT (subr)),
6381 /* Structures that are returned in registers are not aggregate_value_p,
6382 so we may see a PARALLEL or a REG. */
6383 if (REG_P (hard_reg))
6384 SET_DECL_RTL (DECL_RESULT (subr), gen_reg_rtx (GET_MODE (hard_reg)));
6385 else if (GET_CODE (hard_reg) == PARALLEL)
6386 SET_DECL_RTL (DECL_RESULT (subr), gen_group_rtx (hard_reg));
6390 /* Set DECL_REGISTER flag so that expand_function_end will copy the
6391 result to the real return register(s). */
6392 DECL_REGISTER (DECL_RESULT (subr)) = 1;
6395 /* Initialize rtx for parameters and local variables.
6396 In some cases this requires emitting insns. */
6397 assign_parms (subr);
6399 /* If function gets a static chain arg, store it. */
6400 if (cfun->static_chain_decl)
6402 tree parm = cfun->static_chain_decl;
6403 rtx local = gen_reg_rtx (Pmode);
6405 set_decl_incoming_rtl (parm, static_chain_incoming_rtx);
6406 SET_DECL_RTL (parm, local);
6407 maybe_set_unchanging (local, parm);
6408 mark_reg_pointer (local, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
6410 emit_move_insn (local, static_chain_incoming_rtx);
6413 /* If the function receives a non-local goto, then store the
6414 bits we need to restore the frame pointer. */
6415 if (cfun->nonlocal_goto_save_area)
6420 /* ??? We need to do this save early. Unfortunately here is
6421 before the frame variable gets declared. Help out... */
6422 expand_var (TREE_OPERAND (cfun->nonlocal_goto_save_area, 0));
6424 t_save = build (ARRAY_REF, ptr_type_node, cfun->nonlocal_goto_save_area,
6425 integer_zero_node, NULL_TREE, NULL_TREE);
6426 r_save = expand_expr (t_save, NULL_RTX, VOIDmode, EXPAND_WRITE);
6428 emit_move_insn (r_save, virtual_stack_vars_rtx);
6429 update_nonlocal_goto_save_area ();
6432 /* The following was moved from init_function_start.
6433 The move is supposed to make sdb output more accurate. */
6434 /* Indicate the beginning of the function body,
6435 as opposed to parm setup. */
6436 emit_note (NOTE_INSN_FUNCTION_BEG);
6438 if (GET_CODE (get_last_insn ()) != NOTE)
6439 emit_note (NOTE_INSN_DELETED);
6440 parm_birth_insn = get_last_insn ();
6442 if (current_function_profile)
6445 PROFILE_HOOK (current_function_funcdef_no);
6449 /* After the display initializations is where the tail-recursion label
6450 should go, if we end up needing one. Ensure we have a NOTE here
6451 since some things (like trampolines) get placed before this. */
6452 tail_recursion_reentry = emit_note (NOTE_INSN_DELETED);
6454 /* Evaluate now the sizes of any types declared among the arguments. */
6455 expand_pending_sizes (nreverse (get_pending_sizes ()));
6457 /* Make sure there is a line number after the function entry setup code. */
6458 force_next_line_note ();
6461 /* Undo the effects of init_dummy_function_start. */
6463 expand_dummy_function_end (void)
6465 /* End any sequences that failed to be closed due to syntax errors. */
6466 while (in_sequence_p ())
6469 /* Outside function body, can't compute type's actual size
6470 until next function's body starts. */
6472 free_after_parsing (cfun);
6473 free_after_compilation (cfun);
6477 /* Call DOIT for each hard register used as a return value from
6478 the current function. */
6481 diddle_return_value (void (*doit) (rtx, void *), void *arg)
6483 rtx outgoing = current_function_return_rtx;
6488 if (REG_P (outgoing))
6489 (*doit) (outgoing, arg);
6490 else if (GET_CODE (outgoing) == PARALLEL)
6494 for (i = 0; i < XVECLEN (outgoing, 0); i++)
6496 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
6498 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6505 do_clobber_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
6507 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
6511 clobber_return_register (void)
6513 diddle_return_value (do_clobber_return_reg, NULL);
6515 /* In case we do use pseudo to return value, clobber it too. */
6516 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6518 tree decl_result = DECL_RESULT (current_function_decl);
6519 rtx decl_rtl = DECL_RTL (decl_result);
6520 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
6522 do_clobber_return_reg (decl_rtl, NULL);
6528 do_use_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
6530 emit_insn (gen_rtx_USE (VOIDmode, reg));
6534 use_return_register (void)
6536 diddle_return_value (do_use_return_reg, NULL);
6539 /* Possibly warn about unused parameters. */
6541 do_warn_unused_parameter (tree fn)
6545 for (decl = DECL_ARGUMENTS (fn);
6546 decl; decl = TREE_CHAIN (decl))
6547 if (!TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
6548 && DECL_NAME (decl) && !DECL_ARTIFICIAL (decl))
6549 warning ("%Junused parameter '%D'", decl, decl);
6552 static GTY(()) rtx initial_trampoline;
6554 /* Generate RTL for the end of the current function. */
6557 expand_function_end (void)
6561 finish_expr_for_function ();
6563 /* If arg_pointer_save_area was referenced only from a nested
6564 function, we will not have initialized it yet. Do that now. */
6565 if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
6566 get_arg_pointer_save_area (cfun);
6568 #ifdef NON_SAVING_SETJMP
6569 /* Don't put any variables in registers if we call setjmp
6570 on a machine that fails to restore the registers. */
6571 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
6573 if (DECL_INITIAL (current_function_decl) != error_mark_node)
6574 setjmp_protect (DECL_INITIAL (current_function_decl));
6576 setjmp_protect_args ();
6580 /* If we are doing stack checking and this function makes calls,
6581 do a stack probe at the start of the function to ensure we have enough
6582 space for another stack frame. */
6583 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
6587 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
6588 if (GET_CODE (insn) == CALL_INSN)
6591 probe_stack_range (STACK_CHECK_PROTECT,
6592 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
6595 emit_insn_before (seq, tail_recursion_reentry);
6600 /* Possibly warn about unused parameters.
6601 When frontend does unit-at-a-time, the warning is already
6602 issued at finalization time. */
6603 if (warn_unused_parameter
6604 && !lang_hooks.callgraph.expand_function)
6605 do_warn_unused_parameter (current_function_decl);
6607 /* End any sequences that failed to be closed due to syntax errors. */
6608 while (in_sequence_p ())
6611 clear_pending_stack_adjust ();
6612 do_pending_stack_adjust ();
6614 /* @@@ This is a kludge. We want to ensure that instructions that
6615 may trap are not moved into the epilogue by scheduling, because
6616 we don't always emit unwind information for the epilogue.
6617 However, not all machine descriptions define a blockage insn, so
6618 emit an ASM_INPUT to act as one. */
6619 if (flag_non_call_exceptions)
6620 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, ""));
6622 /* Mark the end of the function body.
6623 If control reaches this insn, the function can drop through
6624 without returning a value. */
6625 emit_note (NOTE_INSN_FUNCTION_END);
6627 /* Must mark the last line number note in the function, so that the test
6628 coverage code can avoid counting the last line twice. This just tells
6629 the code to ignore the immediately following line note, since there
6630 already exists a copy of this note somewhere above. This line number
6631 note is still needed for debugging though, so we can't delete it. */
6632 if (flag_test_coverage)
6633 emit_note (NOTE_INSN_REPEATED_LINE_NUMBER);
6635 /* Output a linenumber for the end of the function.
6636 SDB depends on this. */
6637 force_next_line_note ();
6638 emit_line_note (input_location);
6640 /* Before the return label (if any), clobber the return
6641 registers so that they are not propagated live to the rest of
6642 the function. This can only happen with functions that drop
6643 through; if there had been a return statement, there would
6644 have either been a return rtx, or a jump to the return label.
6646 We delay actual code generation after the current_function_value_rtx
6648 clobber_after = get_last_insn ();
6650 /* Output the label for the actual return from the function,
6651 if one is expected. This happens either because a function epilogue
6652 is used instead of a return instruction, or because a return was done
6653 with a goto in order to run local cleanups, or because of pcc-style
6654 structure returning. */
6656 emit_label (return_label);
6658 /* Let except.c know where it should emit the call to unregister
6659 the function context for sjlj exceptions. */
6660 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
6661 sjlj_emit_function_exit_after (get_last_insn ());
6663 /* If we had calls to alloca, and this machine needs
6664 an accurate stack pointer to exit the function,
6665 insert some code to save and restore the stack pointer. */
6666 if (! EXIT_IGNORE_STACK
6667 && current_function_calls_alloca)
6671 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
6672 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
6675 /* If scalar return value was computed in a pseudo-reg, or was a named
6676 return value that got dumped to the stack, copy that to the hard
6678 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6680 tree decl_result = DECL_RESULT (current_function_decl);
6681 rtx decl_rtl = DECL_RTL (decl_result);
6683 if (REG_P (decl_rtl)
6684 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
6685 : DECL_REGISTER (decl_result))
6687 rtx real_decl_rtl = current_function_return_rtx;
6689 /* This should be set in assign_parms. */
6690 if (! REG_FUNCTION_VALUE_P (real_decl_rtl))
6693 /* If this is a BLKmode structure being returned in registers,
6694 then use the mode computed in expand_return. Note that if
6695 decl_rtl is memory, then its mode may have been changed,
6696 but that current_function_return_rtx has not. */
6697 if (GET_MODE (real_decl_rtl) == BLKmode)
6698 PUT_MODE (real_decl_rtl, GET_MODE (decl_rtl));
6700 /* If a named return value dumped decl_return to memory, then
6701 we may need to re-do the PROMOTE_MODE signed/unsigned
6703 if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
6705 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (decl_result));
6707 if (targetm.calls.promote_function_return (TREE_TYPE (current_function_decl)))
6708 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
6711 convert_move (real_decl_rtl, decl_rtl, unsignedp);
6713 else if (GET_CODE (real_decl_rtl) == PARALLEL)
6715 /* If expand_function_start has created a PARALLEL for decl_rtl,
6716 move the result to the real return registers. Otherwise, do
6717 a group load from decl_rtl for a named return. */
6718 if (GET_CODE (decl_rtl) == PARALLEL)
6719 emit_group_move (real_decl_rtl, decl_rtl);
6721 emit_group_load (real_decl_rtl, decl_rtl,
6722 TREE_TYPE (decl_result),
6723 int_size_in_bytes (TREE_TYPE (decl_result)));
6726 emit_move_insn (real_decl_rtl, decl_rtl);
6730 /* If returning a structure, arrange to return the address of the value
6731 in a place where debuggers expect to find it.
6733 If returning a structure PCC style,
6734 the caller also depends on this value.
6735 And current_function_returns_pcc_struct is not necessarily set. */
6736 if (current_function_returns_struct
6737 || current_function_returns_pcc_struct)
6740 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
6741 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
6742 #ifdef FUNCTION_OUTGOING_VALUE
6744 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
6745 current_function_decl);
6748 = FUNCTION_VALUE (build_pointer_type (type), current_function_decl);
6751 /* Mark this as a function return value so integrate will delete the
6752 assignment and USE below when inlining this function. */
6753 REG_FUNCTION_VALUE_P (outgoing) = 1;
6755 /* The address may be ptr_mode and OUTGOING may be Pmode. */
6756 value_address = convert_memory_address (GET_MODE (outgoing),
6759 emit_move_insn (outgoing, value_address);
6761 /* Show return register used to hold result (in this case the address
6763 current_function_return_rtx = outgoing;
6766 /* If this is an implementation of throw, do what's necessary to
6767 communicate between __builtin_eh_return and the epilogue. */
6768 expand_eh_return ();
6770 /* Emit the actual code to clobber return register. */
6775 clobber_return_register ();
6779 after = emit_insn_after (seq, clobber_after);
6782 /* Output the label for the naked return from the function, if one is
6783 expected. This is currently used only by __builtin_return. */
6784 if (naked_return_label)
6785 emit_label (naked_return_label);
6787 /* ??? This should no longer be necessary since stupid is no longer with
6788 us, but there are some parts of the compiler (eg reload_combine, and
6789 sh mach_dep_reorg) that still try and compute their own lifetime info
6790 instead of using the general framework. */
6791 use_return_register ();
6793 /* Fix up any gotos that jumped out to the outermost
6794 binding level of the function.
6795 Must follow emitting RETURN_LABEL. */
6797 /* If you have any cleanups to do at this point,
6798 and they need to create temporary variables,
6799 then you will lose. */
6800 expand_fixups (get_insns ());
6804 get_arg_pointer_save_area (struct function *f)
6806 rtx ret = f->x_arg_pointer_save_area;
6810 ret = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, f);
6811 f->x_arg_pointer_save_area = ret;
6814 if (f == cfun && ! f->arg_pointer_save_area_init)
6818 /* Save the arg pointer at the beginning of the function. The
6819 generated stack slot may not be a valid memory address, so we
6820 have to check it and fix it if necessary. */
6822 emit_move_insn (validize_mem (ret), virtual_incoming_args_rtx);
6826 push_topmost_sequence ();
6827 emit_insn_after (seq, get_insns ());
6828 pop_topmost_sequence ();
6834 /* Extend a vector that records the INSN_UIDs of INSNS
6835 (a list of one or more insns). */
6838 record_insns (rtx insns, varray_type *vecp)
6845 while (tmp != NULL_RTX)
6848 tmp = NEXT_INSN (tmp);
6851 i = VARRAY_SIZE (*vecp);
6852 VARRAY_GROW (*vecp, i + len);
6854 while (tmp != NULL_RTX)
6856 VARRAY_INT (*vecp, i) = INSN_UID (tmp);
6858 tmp = NEXT_INSN (tmp);
6862 /* Set the locator of the insn chain starting at INSN to LOC. */
6864 set_insn_locators (rtx insn, int loc)
6866 while (insn != NULL_RTX)
6869 INSN_LOCATOR (insn) = loc;
6870 insn = NEXT_INSN (insn);
6874 /* Determine how many INSN_UIDs in VEC are part of INSN. Because we can
6875 be running after reorg, SEQUENCE rtl is possible. */
6878 contains (rtx insn, varray_type vec)
6882 if (GET_CODE (insn) == INSN
6883 && GET_CODE (PATTERN (insn)) == SEQUENCE)
6886 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
6887 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
6888 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j))
6894 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
6895 if (INSN_UID (insn) == VARRAY_INT (vec, j))
6902 prologue_epilogue_contains (rtx insn)
6904 if (contains (insn, prologue))
6906 if (contains (insn, epilogue))
6912 sibcall_epilogue_contains (rtx insn)
6914 if (sibcall_epilogue)
6915 return contains (insn, sibcall_epilogue);
6920 /* Insert gen_return at the end of block BB. This also means updating
6921 block_for_insn appropriately. */
6924 emit_return_into_block (basic_block bb, rtx line_note)
6926 emit_jump_insn_after (gen_return (), BB_END (bb));
6928 emit_note_copy_after (line_note, PREV_INSN (BB_END (bb)));
6930 #endif /* HAVE_return */
6932 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
6934 /* These functions convert the epilogue into a variant that does not modify the
6935 stack pointer. This is used in cases where a function returns an object
6936 whose size is not known until it is computed. The called function leaves the
6937 object on the stack, leaves the stack depressed, and returns a pointer to
6940 What we need to do is track all modifications and references to the stack
6941 pointer, deleting the modifications and changing the references to point to
6942 the location the stack pointer would have pointed to had the modifications
6945 These functions need to be portable so we need to make as few assumptions
6946 about the epilogue as we can. However, the epilogue basically contains
6947 three things: instructions to reset the stack pointer, instructions to
6948 reload registers, possibly including the frame pointer, and an
6949 instruction to return to the caller.
6951 If we can't be sure of what a relevant epilogue insn is doing, we abort.
6952 We also make no attempt to validate the insns we make since if they are
6953 invalid, we probably can't do anything valid. The intent is that these
6954 routines get "smarter" as more and more machines start to use them and
6955 they try operating on different epilogues.
6957 We use the following structure to track what the part of the epilogue that
6958 we've already processed has done. We keep two copies of the SP equivalence,
6959 one for use during the insn we are processing and one for use in the next
6960 insn. The difference is because one part of a PARALLEL may adjust SP
6961 and the other may use it. */
6965 rtx sp_equiv_reg; /* REG that SP is set from, perhaps SP. */
6966 HOST_WIDE_INT sp_offset; /* Offset from SP_EQUIV_REG of present SP. */
6967 rtx new_sp_equiv_reg; /* REG to be used at end of insn. */
6968 HOST_WIDE_INT new_sp_offset; /* Offset to be used at end of insn. */
6969 rtx equiv_reg_src; /* If nonzero, the value that SP_EQUIV_REG
6970 should be set to once we no longer need
6972 rtx const_equiv[FIRST_PSEUDO_REGISTER]; /* Any known constant equivalences
6976 static void handle_epilogue_set (rtx, struct epi_info *);
6977 static void update_epilogue_consts (rtx, rtx, void *);
6978 static void emit_equiv_load (struct epi_info *);
6980 /* Modify INSN, a list of one or more insns that is part of the epilogue, to
6981 no modifications to the stack pointer. Return the new list of insns. */
6984 keep_stack_depressed (rtx insns)
6987 struct epi_info info;
6990 /* If the epilogue is just a single instruction, it must be OK as is. */
6991 if (NEXT_INSN (insns) == NULL_RTX)
6994 /* Otherwise, start a sequence, initialize the information we have, and
6995 process all the insns we were given. */
6998 info.sp_equiv_reg = stack_pointer_rtx;
7000 info.equiv_reg_src = 0;
7002 for (j = 0; j < FIRST_PSEUDO_REGISTER; j++)
7003 info.const_equiv[j] = 0;
7007 while (insn != NULL_RTX)
7009 next = NEXT_INSN (insn);
7018 /* If this insn references the register that SP is equivalent to and
7019 we have a pending load to that register, we must force out the load
7020 first and then indicate we no longer know what SP's equivalent is. */
7021 if (info.equiv_reg_src != 0
7022 && reg_referenced_p (info.sp_equiv_reg, PATTERN (insn)))
7024 emit_equiv_load (&info);
7025 info.sp_equiv_reg = 0;
7028 info.new_sp_equiv_reg = info.sp_equiv_reg;
7029 info.new_sp_offset = info.sp_offset;
7031 /* If this is a (RETURN) and the return address is on the stack,
7032 update the address and change to an indirect jump. */
7033 if (GET_CODE (PATTERN (insn)) == RETURN
7034 || (GET_CODE (PATTERN (insn)) == PARALLEL
7035 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
7037 rtx retaddr = INCOMING_RETURN_ADDR_RTX;
7039 HOST_WIDE_INT offset = 0;
7040 rtx jump_insn, jump_set;
7042 /* If the return address is in a register, we can emit the insn
7043 unchanged. Otherwise, it must be a MEM and we see what the
7044 base register and offset are. In any case, we have to emit any
7045 pending load to the equivalent reg of SP, if any. */
7046 if (REG_P (retaddr))
7048 emit_equiv_load (&info);
7053 else if (MEM_P (retaddr)
7054 && REG_P (XEXP (retaddr, 0)))
7055 base = gen_rtx_REG (Pmode, REGNO (XEXP (retaddr, 0))), offset = 0;
7056 else if (MEM_P (retaddr)
7057 && GET_CODE (XEXP (retaddr, 0)) == PLUS
7058 && REG_P (XEXP (XEXP (retaddr, 0), 0))
7059 && GET_CODE (XEXP (XEXP (retaddr, 0), 1)) == CONST_INT)
7061 base = gen_rtx_REG (Pmode, REGNO (XEXP (XEXP (retaddr, 0), 0)));
7062 offset = INTVAL (XEXP (XEXP (retaddr, 0), 1));
7067 /* If the base of the location containing the return pointer
7068 is SP, we must update it with the replacement address. Otherwise,
7069 just build the necessary MEM. */
7070 retaddr = plus_constant (base, offset);
7071 if (base == stack_pointer_rtx)
7072 retaddr = simplify_replace_rtx (retaddr, stack_pointer_rtx,
7073 plus_constant (info.sp_equiv_reg,
7076 retaddr = gen_rtx_MEM (Pmode, retaddr);
7078 /* If there is a pending load to the equivalent register for SP
7079 and we reference that register, we must load our address into
7080 a scratch register and then do that load. */
7081 if (info.equiv_reg_src
7082 && reg_overlap_mentioned_p (info.equiv_reg_src, retaddr))
7087 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
7088 if (HARD_REGNO_MODE_OK (regno, Pmode)
7089 && !fixed_regs[regno]
7090 && TEST_HARD_REG_BIT (regs_invalidated_by_call, regno)
7091 && !REGNO_REG_SET_P (EXIT_BLOCK_PTR->global_live_at_start,
7093 && !refers_to_regno_p (regno,
7094 regno + hard_regno_nregs[regno]
7096 info.equiv_reg_src, NULL)
7097 && info.const_equiv[regno] == 0)
7100 if (regno == FIRST_PSEUDO_REGISTER)
7103 reg = gen_rtx_REG (Pmode, regno);
7104 emit_move_insn (reg, retaddr);
7108 emit_equiv_load (&info);
7109 jump_insn = emit_jump_insn (gen_indirect_jump (retaddr));
7111 /* Show the SET in the above insn is a RETURN. */
7112 jump_set = single_set (jump_insn);
7116 SET_IS_RETURN_P (jump_set) = 1;
7119 /* If SP is not mentioned in the pattern and its equivalent register, if
7120 any, is not modified, just emit it. Otherwise, if neither is set,
7121 replace the reference to SP and emit the insn. If none of those are
7122 true, handle each SET individually. */
7123 else if (!reg_mentioned_p (stack_pointer_rtx, PATTERN (insn))
7124 && (info.sp_equiv_reg == stack_pointer_rtx
7125 || !reg_set_p (info.sp_equiv_reg, insn)))
7127 else if (! reg_set_p (stack_pointer_rtx, insn)
7128 && (info.sp_equiv_reg == stack_pointer_rtx
7129 || !reg_set_p (info.sp_equiv_reg, insn)))
7131 if (! validate_replace_rtx (stack_pointer_rtx,
7132 plus_constant (info.sp_equiv_reg,
7139 else if (GET_CODE (PATTERN (insn)) == SET)
7140 handle_epilogue_set (PATTERN (insn), &info);
7141 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
7143 for (j = 0; j < XVECLEN (PATTERN (insn), 0); j++)
7144 if (GET_CODE (XVECEXP (PATTERN (insn), 0, j)) == SET)
7145 handle_epilogue_set (XVECEXP (PATTERN (insn), 0, j), &info);
7150 info.sp_equiv_reg = info.new_sp_equiv_reg;
7151 info.sp_offset = info.new_sp_offset;
7153 /* Now update any constants this insn sets. */
7154 note_stores (PATTERN (insn), update_epilogue_consts, &info);
7158 insns = get_insns ();
7163 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
7164 structure that contains information about what we've seen so far. We
7165 process this SET by either updating that data or by emitting one or
7169 handle_epilogue_set (rtx set, struct epi_info *p)
7171 /* First handle the case where we are setting SP. Record what it is being
7172 set from. If unknown, abort. */
7173 if (reg_set_p (stack_pointer_rtx, set))
7175 if (SET_DEST (set) != stack_pointer_rtx)
7178 if (GET_CODE (SET_SRC (set)) == PLUS)
7180 p->new_sp_equiv_reg = XEXP (SET_SRC (set), 0);
7181 if (GET_CODE (XEXP (SET_SRC (set), 1)) == CONST_INT)
7182 p->new_sp_offset = INTVAL (XEXP (SET_SRC (set), 1));
7183 else if (REG_P (XEXP (SET_SRC (set), 1))
7184 && REGNO (XEXP (SET_SRC (set), 1)) < FIRST_PSEUDO_REGISTER
7185 && p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))] != 0)
7187 = INTVAL (p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
7192 p->new_sp_equiv_reg = SET_SRC (set), p->new_sp_offset = 0;
7194 /* If we are adjusting SP, we adjust from the old data. */
7195 if (p->new_sp_equiv_reg == stack_pointer_rtx)
7197 p->new_sp_equiv_reg = p->sp_equiv_reg;
7198 p->new_sp_offset += p->sp_offset;
7201 if (p->new_sp_equiv_reg == 0 || !REG_P (p->new_sp_equiv_reg))
7207 /* Next handle the case where we are setting SP's equivalent register.
7208 If we already have a value to set it to, abort. We could update, but
7209 there seems little point in handling that case. Note that we have
7210 to allow for the case where we are setting the register set in
7211 the previous part of a PARALLEL inside a single insn. But use the
7212 old offset for any updates within this insn. We must allow for the case
7213 where the register is being set in a different (usually wider) mode than
7215 else if (p->new_sp_equiv_reg != 0 && reg_set_p (p->new_sp_equiv_reg, set))
7217 if (p->equiv_reg_src != 0
7218 || !REG_P (p->new_sp_equiv_reg)
7219 || !REG_P (SET_DEST (set))
7220 || GET_MODE_BITSIZE (GET_MODE (SET_DEST (set))) > BITS_PER_WORD
7221 || REGNO (p->new_sp_equiv_reg) != REGNO (SET_DEST (set)))
7225 = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
7226 plus_constant (p->sp_equiv_reg,
7230 /* Otherwise, replace any references to SP in the insn to its new value
7231 and emit the insn. */
7234 SET_SRC (set) = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
7235 plus_constant (p->sp_equiv_reg,
7237 SET_DEST (set) = simplify_replace_rtx (SET_DEST (set), stack_pointer_rtx,
7238 plus_constant (p->sp_equiv_reg,
7244 /* Update the tracking information for registers set to constants. */
7247 update_epilogue_consts (rtx dest, rtx x, void *data)
7249 struct epi_info *p = (struct epi_info *) data;
7252 if (!REG_P (dest) || REGNO (dest) >= FIRST_PSEUDO_REGISTER)
7255 /* If we are either clobbering a register or doing a partial set,
7256 show we don't know the value. */
7257 else if (GET_CODE (x) == CLOBBER || ! rtx_equal_p (dest, SET_DEST (x)))
7258 p->const_equiv[REGNO (dest)] = 0;
7260 /* If we are setting it to a constant, record that constant. */
7261 else if (GET_CODE (SET_SRC (x)) == CONST_INT)
7262 p->const_equiv[REGNO (dest)] = SET_SRC (x);
7264 /* If this is a binary operation between a register we have been tracking
7265 and a constant, see if we can compute a new constant value. */
7266 else if (ARITHMETIC_P (SET_SRC (x))
7267 && REG_P (XEXP (SET_SRC (x), 0))
7268 && REGNO (XEXP (SET_SRC (x), 0)) < FIRST_PSEUDO_REGISTER
7269 && p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))] != 0
7270 && GET_CODE (XEXP (SET_SRC (x), 1)) == CONST_INT
7271 && 0 != (new = simplify_binary_operation
7272 (GET_CODE (SET_SRC (x)), GET_MODE (dest),
7273 p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))],
7274 XEXP (SET_SRC (x), 1)))
7275 && GET_CODE (new) == CONST_INT)
7276 p->const_equiv[REGNO (dest)] = new;
7278 /* Otherwise, we can't do anything with this value. */
7280 p->const_equiv[REGNO (dest)] = 0;
7283 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
7286 emit_equiv_load (struct epi_info *p)
7288 if (p->equiv_reg_src != 0)
7290 rtx dest = p->sp_equiv_reg;
7292 if (GET_MODE (p->equiv_reg_src) != GET_MODE (dest))
7293 dest = gen_rtx_REG (GET_MODE (p->equiv_reg_src),
7294 REGNO (p->sp_equiv_reg));
7296 emit_move_insn (dest, p->equiv_reg_src);
7297 p->equiv_reg_src = 0;
7302 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
7303 this into place with notes indicating where the prologue ends and where
7304 the epilogue begins. Update the basic block information when possible. */
7307 thread_prologue_and_epilogue_insns (rtx f ATTRIBUTE_UNUSED)
7311 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
7314 #ifdef HAVE_prologue
7315 rtx prologue_end = NULL_RTX;
7317 #if defined (HAVE_epilogue) || defined(HAVE_return)
7318 rtx epilogue_end = NULL_RTX;
7321 #ifdef HAVE_prologue
7325 seq = gen_prologue ();
7328 /* Retain a map of the prologue insns. */
7329 record_insns (seq, &prologue);
7330 prologue_end = emit_note (NOTE_INSN_PROLOGUE_END);
7334 set_insn_locators (seq, prologue_locator);
7336 /* Can't deal with multiple successors of the entry block
7337 at the moment. Function should always have at least one
7339 if (!ENTRY_BLOCK_PTR->succ || ENTRY_BLOCK_PTR->succ->succ_next)
7342 insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ);
7347 /* If the exit block has no non-fake predecessors, we don't need
7349 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7350 if ((e->flags & EDGE_FAKE) == 0)
7356 if (optimize && HAVE_return)
7358 /* If we're allowed to generate a simple return instruction,
7359 then by definition we don't need a full epilogue. Examine
7360 the block that falls through to EXIT. If it does not
7361 contain any code, examine its predecessors and try to
7362 emit (conditional) return instructions. */
7368 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7369 if (e->flags & EDGE_FALLTHRU)
7375 /* Verify that there are no active instructions in the last block. */
7376 label = BB_END (last);
7377 while (label && GET_CODE (label) != CODE_LABEL)
7379 if (active_insn_p (label))
7381 label = PREV_INSN (label);
7384 if (BB_HEAD (last) == label && GET_CODE (label) == CODE_LABEL)
7386 rtx epilogue_line_note = NULL_RTX;
7388 /* Locate the line number associated with the closing brace,
7389 if we can find one. */
7390 for (seq = get_last_insn ();
7391 seq && ! active_insn_p (seq);
7392 seq = PREV_INSN (seq))
7393 if (GET_CODE (seq) == NOTE && NOTE_LINE_NUMBER (seq) > 0)
7395 epilogue_line_note = seq;
7399 for (e = last->pred; e; e = e_next)
7401 basic_block bb = e->src;
7404 e_next = e->pred_next;
7405 if (bb == ENTRY_BLOCK_PTR)
7409 if ((GET_CODE (jump) != JUMP_INSN) || JUMP_LABEL (jump) != label)
7412 /* If we have an unconditional jump, we can replace that
7413 with a simple return instruction. */
7414 if (simplejump_p (jump))
7416 emit_return_into_block (bb, epilogue_line_note);
7420 /* If we have a conditional jump, we can try to replace
7421 that with a conditional return instruction. */
7422 else if (condjump_p (jump))
7424 if (! redirect_jump (jump, 0, 0))
7427 /* If this block has only one successor, it both jumps
7428 and falls through to the fallthru block, so we can't
7430 if (bb->succ->succ_next == NULL)
7436 /* Fix up the CFG for the successful change we just made. */
7437 redirect_edge_succ (e, EXIT_BLOCK_PTR);
7440 /* Emit a return insn for the exit fallthru block. Whether
7441 this is still reachable will be determined later. */
7443 emit_barrier_after (BB_END (last));
7444 emit_return_into_block (last, epilogue_line_note);
7445 epilogue_end = BB_END (last);
7446 last->succ->flags &= ~EDGE_FALLTHRU;
7451 /* Find the edge that falls through to EXIT. Other edges may exist
7452 due to RETURN instructions, but those don't need epilogues.
7453 There really shouldn't be a mixture -- either all should have
7454 been converted or none, however... */
7456 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7457 if (e->flags & EDGE_FALLTHRU)
7462 #ifdef HAVE_epilogue
7466 epilogue_end = emit_note (NOTE_INSN_EPILOGUE_BEG);
7468 seq = gen_epilogue ();
7470 #ifdef INCOMING_RETURN_ADDR_RTX
7471 /* If this function returns with the stack depressed and we can support
7472 it, massage the epilogue to actually do that. */
7473 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
7474 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
7475 seq = keep_stack_depressed (seq);
7478 emit_jump_insn (seq);
7480 /* Retain a map of the epilogue insns. */
7481 record_insns (seq, &epilogue);
7482 set_insn_locators (seq, epilogue_locator);
7487 insert_insn_on_edge (seq, e);
7495 if (! next_active_insn (BB_END (e->src)))
7497 /* We have a fall-through edge to the exit block, the source is not
7498 at the end of the function, and there will be an assembler epilogue
7499 at the end of the function.
7500 We can't use force_nonfallthru here, because that would try to
7501 use return. Inserting a jump 'by hand' is extremely messy, so
7502 we take advantage of cfg_layout_finalize using
7503 fixup_fallthru_exit_predecessor. */
7504 cfg_layout_initialize ();
7505 FOR_EACH_BB (cur_bb)
7506 if (cur_bb->index >= 0 && cur_bb->next_bb->index >= 0)
7507 cur_bb->rbi->next = cur_bb->next_bb;
7508 cfg_layout_finalize ();
7513 commit_edge_insertions ();
7515 #ifdef HAVE_sibcall_epilogue
7516 /* Emit sibling epilogues before any sibling call sites. */
7517 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7519 basic_block bb = e->src;
7520 rtx insn = BB_END (bb);
7524 if (GET_CODE (insn) != CALL_INSN
7525 || ! SIBLING_CALL_P (insn))
7529 emit_insn (gen_sibcall_epilogue ());
7533 /* Retain a map of the epilogue insns. Used in life analysis to
7534 avoid getting rid of sibcall epilogue insns. Do this before we
7535 actually emit the sequence. */
7536 record_insns (seq, &sibcall_epilogue);
7537 set_insn_locators (seq, epilogue_locator);
7539 i = PREV_INSN (insn);
7540 newinsn = emit_insn_before (seq, insn);
7544 #ifdef HAVE_prologue
7545 /* This is probably all useless now that we use locators. */
7550 /* GDB handles `break f' by setting a breakpoint on the first
7551 line note after the prologue. Which means (1) that if
7552 there are line number notes before where we inserted the
7553 prologue we should move them, and (2) we should generate a
7554 note before the end of the first basic block, if there isn't
7557 ??? This behavior is completely broken when dealing with
7558 multiple entry functions. We simply place the note always
7559 into first basic block and let alternate entry points
7563 for (insn = prologue_end; insn; insn = prev)
7565 prev = PREV_INSN (insn);
7566 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7568 /* Note that we cannot reorder the first insn in the
7569 chain, since rest_of_compilation relies on that
7570 remaining constant. */
7573 reorder_insns (insn, insn, prologue_end);
7577 /* Find the last line number note in the first block. */
7578 for (insn = BB_END (ENTRY_BLOCK_PTR->next_bb);
7579 insn != prologue_end && insn;
7580 insn = PREV_INSN (insn))
7581 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7584 /* If we didn't find one, make a copy of the first line number
7588 for (insn = next_active_insn (prologue_end);
7590 insn = PREV_INSN (insn))
7591 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7593 emit_note_copy_after (insn, prologue_end);
7599 #ifdef HAVE_epilogue
7604 /* Similarly, move any line notes that appear after the epilogue.
7605 There is no need, however, to be quite so anal about the existence
7606 of such a note. Also move the NOTE_INSN_FUNCTION_END and (possibly)
7607 NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
7609 for (insn = epilogue_end; insn; insn = next)
7611 next = NEXT_INSN (insn);
7612 if (GET_CODE (insn) == NOTE
7613 && (NOTE_LINE_NUMBER (insn) > 0
7614 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG
7615 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_END))
7616 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
7622 /* Reposition the prologue-end and epilogue-begin notes after instruction
7623 scheduling and delayed branch scheduling. */
7626 reposition_prologue_and_epilogue_notes (rtx f ATTRIBUTE_UNUSED)
7628 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
7629 rtx insn, last, note;
7632 if ((len = VARRAY_SIZE (prologue)) > 0)
7636 /* Scan from the beginning until we reach the last prologue insn.
7637 We apparently can't depend on basic_block_{head,end} after
7639 for (insn = f; insn; insn = NEXT_INSN (insn))
7641 if (GET_CODE (insn) == NOTE)
7643 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
7646 else if (contains (insn, prologue))
7656 /* Find the prologue-end note if we haven't already, and
7657 move it to just after the last prologue insn. */
7660 for (note = last; (note = NEXT_INSN (note));)
7661 if (GET_CODE (note) == NOTE
7662 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
7666 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
7667 if (GET_CODE (last) == CODE_LABEL)
7668 last = NEXT_INSN (last);
7669 reorder_insns (note, note, last);
7673 if ((len = VARRAY_SIZE (epilogue)) > 0)
7677 /* Scan from the end until we reach the first epilogue insn.
7678 We apparently can't depend on basic_block_{head,end} after
7680 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
7682 if (GET_CODE (insn) == NOTE)
7684 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
7687 else if (contains (insn, epilogue))
7697 /* Find the epilogue-begin note if we haven't already, and
7698 move it to just before the first epilogue insn. */
7701 for (note = insn; (note = PREV_INSN (note));)
7702 if (GET_CODE (note) == NOTE
7703 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
7707 if (PREV_INSN (last) != note)
7708 reorder_insns (note, note, PREV_INSN (last));
7711 #endif /* HAVE_prologue or HAVE_epilogue */
7714 /* Called once, at initialization, to initialize function.c. */
7717 init_function_once (void)
7719 VARRAY_INT_INIT (prologue, 0, "prologue");
7720 VARRAY_INT_INIT (epilogue, 0, "epilogue");
7721 VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue");
7724 /* Resets insn_block_boundaries array. */
7727 reset_block_changes (void)
7729 VARRAY_TREE_INIT (cfun->ib_boundaries_block, 100, "ib_boundaries_block");
7730 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, NULL_TREE);
7733 /* Record the boundary for BLOCK. */
7735 record_block_change (tree block)
7743 last_block = VARRAY_TOP_TREE (cfun->ib_boundaries_block);
7744 VARRAY_POP (cfun->ib_boundaries_block);
7746 for (i = VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block); i < n; i++)
7747 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, last_block);
7749 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, block);
7752 /* Finishes record of boundaries. */
7753 void finalize_block_changes (void)
7755 record_block_change (DECL_INITIAL (current_function_decl));
7758 /* For INSN return the BLOCK it belongs to. */
7760 check_block_change (rtx insn, tree *block)
7762 unsigned uid = INSN_UID (insn);
7764 if (uid >= VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block))
7767 *block = VARRAY_TREE (cfun->ib_boundaries_block, uid);
7770 /* Releases the ib_boundaries_block records. */
7772 free_block_changes (void)
7774 cfun->ib_boundaries_block = NULL;
7777 /* Returns the name of the current function. */
7779 current_function_name (void)
7781 return lang_hooks.decl_printable_name (cfun->decl, 2);
7784 #include "gt-function.h"