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. */
38 #include "coretypes.h"
49 #include "hard-reg-set.h"
50 #include "insn-config.h"
53 #include "basic-block.h"
58 #include "integrate.h"
59 #include "langhooks.h"
61 #include "cfglayout.h"
63 #ifndef LOCAL_ALIGNMENT
64 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
67 #ifndef STACK_ALIGNMENT_NEEDED
68 #define STACK_ALIGNMENT_NEEDED 1
71 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
73 /* Some systems use __main in a way incompatible with its use in gcc, in these
74 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
75 give the same symbol without quotes for an alternative entry point. You
76 must define both, or neither. */
78 #define NAME__MAIN "__main"
81 /* Round a value to the lowest integer less than it that is a multiple of
82 the required alignment. Avoid using division in case the value is
83 negative. Assume the alignment is a power of two. */
84 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
86 /* Similar, but round to the next highest integer that meets the
88 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
90 /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
91 during rtl generation. If they are different register numbers, this is
92 always true. It may also be true if
93 FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
94 generation. See fix_lexical_addr for details. */
96 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
97 #define NEED_SEPARATE_AP
100 /* Nonzero if function being compiled doesn't contain any calls
101 (ignoring the prologue and epilogue). This is set prior to
102 local register allocation and is valid for the remaining
104 int current_function_is_leaf;
106 /* Nonzero if function being compiled doesn't modify the stack pointer
107 (ignoring the prologue and epilogue). This is only valid after
108 life_analysis has run. */
109 int current_function_sp_is_unchanging;
111 /* Nonzero if the function being compiled is a leaf function which only
112 uses leaf registers. This is valid after reload (specifically after
113 sched2) and is useful only if the port defines LEAF_REGISTERS. */
114 int current_function_uses_only_leaf_regs;
116 /* Nonzero once virtual register instantiation has been done.
117 assign_stack_local uses frame_pointer_rtx when this is nonzero.
118 calls.c:emit_library_call_value_1 uses it to set up
119 post-instantiation libcalls. */
120 int virtuals_instantiated;
122 /* Assign unique numbers to labels generated for profiling, debugging, etc. */
123 static GTY(()) int funcdef_no;
125 /* These variables hold pointers to functions to create and destroy
126 target specific, per-function data structures. */
127 struct machine_function * (*init_machine_status) (void);
129 /* The currently compiled function. */
130 struct function *cfun = 0;
132 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
133 static GTY(()) varray_type prologue;
134 static GTY(()) varray_type epilogue;
136 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
138 static GTY(()) varray_type sibcall_epilogue;
140 /* In order to evaluate some expressions, such as function calls returning
141 structures in memory, we need to temporarily allocate stack locations.
142 We record each allocated temporary in the following structure.
144 Associated with each temporary slot is a nesting level. When we pop up
145 one level, all temporaries associated with the previous level are freed.
146 Normally, all temporaries are freed after the execution of the statement
147 in which they were created. However, if we are inside a ({...}) grouping,
148 the result may be in a temporary and hence must be preserved. If the
149 result could be in a temporary, we preserve it if we can determine which
150 one it is in. If we cannot determine which temporary may contain the
151 result, all temporaries are preserved. A temporary is preserved by
152 pretending it was allocated at the previous nesting level.
154 Automatic variables are also assigned temporary slots, at the nesting
155 level where they are defined. They are marked a "kept" so that
156 free_temp_slots will not free them. */
158 struct temp_slot GTY(())
160 /* Points to next temporary slot. */
161 struct temp_slot *next;
162 /* Points to previous temporary slot. */
163 struct temp_slot *prev;
165 /* The rtx to used to reference the slot. */
167 /* The rtx used to represent the address if not the address of the
168 slot above. May be an EXPR_LIST if multiple addresses exist. */
170 /* The alignment (in bits) of the slot. */
172 /* The size, in units, of the slot. */
174 /* The type of the object in the slot, or zero if it doesn't correspond
175 to a type. We use this to determine whether a slot can be reused.
176 It can be reused if objects of the type of the new slot will always
177 conflict with objects of the type of the old slot. */
179 /* Nonzero if this temporary is currently in use. */
181 /* Nonzero if this temporary has its address taken. */
183 /* Nesting level at which this slot is being used. */
185 /* Nonzero if this should survive a call to free_temp_slots. */
187 /* The offset of the slot from the frame_pointer, including extra space
188 for alignment. This info is for combine_temp_slots. */
189 HOST_WIDE_INT base_offset;
190 /* The size of the slot, including extra space for alignment. This
191 info is for combine_temp_slots. */
192 HOST_WIDE_INT full_size;
195 /* Forward declarations. */
197 static rtx assign_stack_local_1 (enum machine_mode, HOST_WIDE_INT, int,
199 static struct temp_slot *find_temp_slot_from_address (rtx);
200 static void instantiate_decls (tree, int);
201 static void instantiate_decls_1 (tree, int);
202 static void instantiate_decl (rtx, HOST_WIDE_INT, int);
203 static rtx instantiate_new_reg (rtx, HOST_WIDE_INT *);
204 static int instantiate_virtual_regs_1 (rtx *, rtx, int);
205 static void pad_to_arg_alignment (struct args_size *, int, struct args_size *);
206 static void pad_below (struct args_size *, enum machine_mode, tree);
207 static void reorder_blocks_1 (rtx, tree, varray_type *);
208 static void reorder_fix_fragments (tree);
209 static int all_blocks (tree, tree *);
210 static tree *get_block_vector (tree, int *);
211 extern tree debug_find_var_in_block_tree (tree, tree);
212 /* We always define `record_insns' even if it's not used so that we
213 can always export `prologue_epilogue_contains'. */
214 static void record_insns (rtx, varray_type *) ATTRIBUTE_UNUSED;
215 static int contains (rtx, varray_type);
217 static void emit_return_into_block (basic_block, rtx);
219 static void purge_single_hard_subreg_set (rtx);
220 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
221 static rtx keep_stack_depressed (rtx);
223 static void prepare_function_start (tree);
224 static void do_clobber_return_reg (rtx, void *);
225 static void do_use_return_reg (rtx, void *);
226 static void instantiate_virtual_regs_lossage (rtx);
227 static void set_insn_locators (rtx, int) ATTRIBUTE_UNUSED;
229 /* Pointer to chain of `struct function' for containing functions. */
230 struct function *outer_function_chain;
232 /* Given a function decl for a containing function,
233 return the `struct function' for it. */
236 find_function_data (tree decl)
240 for (p = outer_function_chain; p; p = p->outer)
247 /* Save the current context for compilation of a nested function.
248 This is called from language-specific code. The caller should use
249 the enter_nested langhook to save any language-specific state,
250 since this function knows only about language-independent
254 push_function_context_to (tree context)
260 if (context == current_function_decl)
261 cfun->contains_functions = 1;
264 struct function *containing = find_function_data (context);
265 containing->contains_functions = 1;
270 init_dummy_function_start ();
273 p->outer = outer_function_chain;
274 outer_function_chain = p;
276 lang_hooks.function.enter_nested (p);
282 push_function_context (void)
284 push_function_context_to (current_function_decl);
287 /* Restore the last saved context, at the end of a nested function.
288 This function is called from language-specific code. */
291 pop_function_context_from (tree context ATTRIBUTE_UNUSED)
293 struct function *p = outer_function_chain;
296 outer_function_chain = p->outer;
298 current_function_decl = p->decl;
301 restore_emit_status (p);
303 lang_hooks.function.leave_nested (p);
305 /* Reset variables that have known state during rtx generation. */
306 rtx_equal_function_value_matters = 1;
307 virtuals_instantiated = 0;
308 generating_concat_p = 1;
312 pop_function_context (void)
314 pop_function_context_from (current_function_decl);
317 /* Clear out all parts of the state in F that can safely be discarded
318 after the function has been parsed, but not compiled, to let
319 garbage collection reclaim the memory. */
322 free_after_parsing (struct function *f)
324 /* f->expr->forced_labels is used by code generation. */
325 /* f->emit->regno_reg_rtx is used by code generation. */
326 /* f->varasm is used by code generation. */
327 /* f->eh->eh_return_stub_label is used by code generation. */
329 lang_hooks.function.final (f);
333 /* Clear out all parts of the state in F that can safely be discarded
334 after the function has been compiled, to let garbage collection
335 reclaim the memory. */
338 free_after_compilation (struct function *f)
346 f->x_avail_temp_slots = NULL;
347 f->x_used_temp_slots = NULL;
348 f->arg_offset_rtx = NULL;
349 f->return_rtx = NULL;
350 f->internal_arg_pointer = NULL;
351 f->x_nonlocal_goto_handler_labels = NULL;
352 f->x_return_label = NULL;
353 f->x_naked_return_label = NULL;
354 f->x_stack_slot_list = NULL;
355 f->x_tail_recursion_reentry = NULL;
356 f->x_arg_pointer_save_area = NULL;
357 f->x_parm_birth_insn = NULL;
358 f->original_arg_vector = NULL;
359 f->original_decl_initial = NULL;
360 f->epilogue_delay_list = NULL;
363 /* Allocate fixed slots in the stack frame of the current function. */
365 /* Return size needed for stack frame based on slots so far allocated in
367 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
368 the caller may have to do that. */
371 get_func_frame_size (struct function *f)
373 #ifdef FRAME_GROWS_DOWNWARD
374 return -f->x_frame_offset;
376 return f->x_frame_offset;
380 /* Return size needed for stack frame based on slots so far allocated.
381 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
382 the caller may have to do that. */
384 get_frame_size (void)
386 return get_func_frame_size (cfun);
389 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
390 with machine mode MODE.
392 ALIGN controls the amount of alignment for the address of the slot:
393 0 means according to MODE,
394 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
395 -2 means use BITS_PER_UNIT,
396 positive specifies alignment boundary in bits.
398 We do not round to stack_boundary here.
400 FUNCTION specifies the function to allocate in. */
403 assign_stack_local_1 (enum machine_mode mode, HOST_WIDE_INT size, int align,
404 struct function *function)
407 int bigend_correction = 0;
409 int frame_off, frame_alignment, frame_phase;
416 alignment = BIGGEST_ALIGNMENT;
418 alignment = GET_MODE_ALIGNMENT (mode);
420 /* Allow the target to (possibly) increase the alignment of this
422 type = lang_hooks.types.type_for_mode (mode, 0);
424 alignment = LOCAL_ALIGNMENT (type, alignment);
426 alignment /= BITS_PER_UNIT;
428 else if (align == -1)
430 alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
431 size = CEIL_ROUND (size, alignment);
433 else if (align == -2)
434 alignment = 1; /* BITS_PER_UNIT / BITS_PER_UNIT */
436 alignment = align / BITS_PER_UNIT;
438 #ifdef FRAME_GROWS_DOWNWARD
439 function->x_frame_offset -= size;
442 /* Ignore alignment we can't do with expected alignment of the boundary. */
443 if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY)
444 alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
446 if (function->stack_alignment_needed < alignment * BITS_PER_UNIT)
447 function->stack_alignment_needed = alignment * BITS_PER_UNIT;
449 /* Calculate how many bytes the start of local variables is off from
451 frame_alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
452 frame_off = STARTING_FRAME_OFFSET % frame_alignment;
453 frame_phase = frame_off ? frame_alignment - frame_off : 0;
455 /* Round the frame offset to the specified alignment. The default is
456 to always honor requests to align the stack but a port may choose to
457 do its own stack alignment by defining STACK_ALIGNMENT_NEEDED. */
458 if (STACK_ALIGNMENT_NEEDED
462 /* We must be careful here, since FRAME_OFFSET might be negative and
463 division with a negative dividend isn't as well defined as we might
464 like. So we instead assume that ALIGNMENT is a power of two and
465 use logical operations which are unambiguous. */
466 #ifdef FRAME_GROWS_DOWNWARD
467 function->x_frame_offset
468 = (FLOOR_ROUND (function->x_frame_offset - frame_phase, alignment)
471 function->x_frame_offset
472 = (CEIL_ROUND (function->x_frame_offset - frame_phase, alignment)
477 /* On a big-endian machine, if we are allocating more space than we will use,
478 use the least significant bytes of those that are allocated. */
479 if (BYTES_BIG_ENDIAN && mode != BLKmode)
480 bigend_correction = size - GET_MODE_SIZE (mode);
482 /* If we have already instantiated virtual registers, return the actual
483 address relative to the frame pointer. */
484 if (function == cfun && virtuals_instantiated)
485 addr = plus_constant (frame_pointer_rtx,
487 (frame_offset + bigend_correction
488 + STARTING_FRAME_OFFSET, Pmode));
490 addr = plus_constant (virtual_stack_vars_rtx,
492 (function->x_frame_offset + bigend_correction,
495 #ifndef FRAME_GROWS_DOWNWARD
496 function->x_frame_offset += size;
499 x = gen_rtx_MEM (mode, addr);
501 function->x_stack_slot_list
502 = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list);
507 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
511 assign_stack_local (enum machine_mode mode, HOST_WIDE_INT size, int align)
513 return assign_stack_local_1 (mode, size, align, cfun);
517 /* Removes temporary slot TEMP from LIST. */
520 cut_slot_from_list (struct temp_slot *temp, struct temp_slot **list)
523 temp->next->prev = temp->prev;
525 temp->prev->next = temp->next;
529 temp->prev = temp->next = NULL;
532 /* Inserts temporary slot TEMP to LIST. */
535 insert_slot_to_list (struct temp_slot *temp, struct temp_slot **list)
539 (*list)->prev = temp;
544 /* Returns the list of used temp slots at LEVEL. */
546 static struct temp_slot **
547 temp_slots_at_level (int level)
551 if (!used_temp_slots)
552 VARRAY_GENERIC_PTR_INIT (used_temp_slots, 3, "used_temp_slots");
554 while (level >= (int) VARRAY_ACTIVE_SIZE (used_temp_slots))
555 VARRAY_PUSH_GENERIC_PTR (used_temp_slots, NULL);
557 return (struct temp_slot **) &VARRAY_GENERIC_PTR (used_temp_slots, level);
560 /* Returns the maximal temporary slot level. */
563 max_slot_level (void)
565 if (!used_temp_slots)
568 return VARRAY_ACTIVE_SIZE (used_temp_slots) - 1;
571 /* Moves temporary slot TEMP to LEVEL. */
574 move_slot_to_level (struct temp_slot *temp, int level)
576 cut_slot_from_list (temp, temp_slots_at_level (temp->level));
577 insert_slot_to_list (temp, temp_slots_at_level (level));
581 /* Make temporary slot TEMP available. */
584 make_slot_available (struct temp_slot *temp)
586 cut_slot_from_list (temp, temp_slots_at_level (temp->level));
587 insert_slot_to_list (temp, &avail_temp_slots);
592 /* Allocate a temporary stack slot and record it for possible later
595 MODE is the machine mode to be given to the returned rtx.
597 SIZE is the size in units of the space required. We do no rounding here
598 since assign_stack_local will do any required rounding.
600 KEEP is 1 if this slot is to be retained after a call to
601 free_temp_slots. Automatic variables for a block are allocated
602 with this flag. KEEP is 2 if we allocate a longer term temporary,
603 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
604 if we are to allocate something at an inner level to be treated as
605 a variable in the block (e.g., a SAVE_EXPR).
607 TYPE is the type that will be used for the stack slot. */
610 assign_stack_temp_for_type (enum machine_mode mode, HOST_WIDE_INT size, int keep,
614 struct temp_slot *p, *best_p = 0, *selected = NULL, **pp;
617 /* If SIZE is -1 it means that somebody tried to allocate a temporary
618 of a variable size. */
623 align = BIGGEST_ALIGNMENT;
625 align = GET_MODE_ALIGNMENT (mode);
628 type = lang_hooks.types.type_for_mode (mode, 0);
631 align = LOCAL_ALIGNMENT (type, align);
633 /* Try to find an available, already-allocated temporary of the proper
634 mode which meets the size and alignment requirements. Choose the
635 smallest one with the closest alignment. */
636 for (p = avail_temp_slots; p; p = p->next)
638 if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode
639 && objects_must_conflict_p (p->type, type)
640 && (best_p == 0 || best_p->size > p->size
641 || (best_p->size == p->size && best_p->align > p->align)))
643 if (p->align == align && p->size == size)
646 cut_slot_from_list (selected, &avail_temp_slots);
654 /* Make our best, if any, the one to use. */
658 cut_slot_from_list (selected, &avail_temp_slots);
660 /* If there are enough aligned bytes left over, make them into a new
661 temp_slot so that the extra bytes don't get wasted. Do this only
662 for BLKmode slots, so that we can be sure of the alignment. */
663 if (GET_MODE (best_p->slot) == BLKmode)
665 int alignment = best_p->align / BITS_PER_UNIT;
666 HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment);
668 if (best_p->size - rounded_size >= alignment)
670 p = ggc_alloc (sizeof (struct temp_slot));
671 p->in_use = p->addr_taken = 0;
672 p->size = best_p->size - rounded_size;
673 p->base_offset = best_p->base_offset + rounded_size;
674 p->full_size = best_p->full_size - rounded_size;
675 p->slot = gen_rtx_MEM (BLKmode,
676 plus_constant (XEXP (best_p->slot, 0),
678 p->align = best_p->align;
680 p->type = best_p->type;
681 insert_slot_to_list (p, &avail_temp_slots);
683 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot,
686 best_p->size = rounded_size;
687 best_p->full_size = rounded_size;
692 /* If we still didn't find one, make a new temporary. */
695 HOST_WIDE_INT frame_offset_old = frame_offset;
697 p = ggc_alloc (sizeof (struct temp_slot));
699 /* We are passing an explicit alignment request to assign_stack_local.
700 One side effect of that is assign_stack_local will not round SIZE
701 to ensure the frame offset remains suitably aligned.
703 So for requests which depended on the rounding of SIZE, we go ahead
704 and round it now. We also make sure ALIGNMENT is at least
705 BIGGEST_ALIGNMENT. */
706 if (mode == BLKmode && align < BIGGEST_ALIGNMENT)
708 p->slot = assign_stack_local (mode,
710 ? CEIL_ROUND (size, (int) align / BITS_PER_UNIT)
716 /* The following slot size computation is necessary because we don't
717 know the actual size of the temporary slot until assign_stack_local
718 has performed all the frame alignment and size rounding for the
719 requested temporary. Note that extra space added for alignment
720 can be either above or below this stack slot depending on which
721 way the frame grows. We include the extra space if and only if it
722 is above this slot. */
723 #ifdef FRAME_GROWS_DOWNWARD
724 p->size = frame_offset_old - frame_offset;
729 /* Now define the fields used by combine_temp_slots. */
730 #ifdef FRAME_GROWS_DOWNWARD
731 p->base_offset = frame_offset;
732 p->full_size = frame_offset_old - frame_offset;
734 p->base_offset = frame_offset_old;
735 p->full_size = frame_offset - frame_offset_old;
749 p->level = target_temp_slot_level;
754 p->level = var_temp_slot_level;
759 p->level = temp_slot_level;
763 pp = temp_slots_at_level (p->level);
764 insert_slot_to_list (p, pp);
766 /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
767 slot = gen_rtx_MEM (mode, XEXP (p->slot, 0));
768 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, slot, stack_slot_list);
770 /* If we know the alias set for the memory that will be used, use
771 it. If there's no TYPE, then we don't know anything about the
772 alias set for the memory. */
773 set_mem_alias_set (slot, type ? get_alias_set (type) : 0);
774 set_mem_align (slot, align);
776 /* If a type is specified, set the relevant flags. */
779 RTX_UNCHANGING_P (slot) = (lang_hooks.honor_readonly
780 && TYPE_READONLY (type));
781 MEM_VOLATILE_P (slot) = TYPE_VOLATILE (type);
782 MEM_SET_IN_STRUCT_P (slot, AGGREGATE_TYPE_P (type));
788 /* Allocate a temporary stack slot and record it for possible later
789 reuse. First three arguments are same as in preceding function. */
792 assign_stack_temp (enum machine_mode mode, HOST_WIDE_INT size, int keep)
794 return assign_stack_temp_for_type (mode, size, keep, NULL_TREE);
797 /* Assign a temporary.
798 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
799 and so that should be used in error messages. In either case, we
800 allocate of the given type.
801 KEEP is as for assign_stack_temp.
802 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
803 it is 0 if a register is OK.
804 DONT_PROMOTE is 1 if we should not promote values in register
808 assign_temp (tree type_or_decl, int keep, int memory_required,
809 int dont_promote ATTRIBUTE_UNUSED)
812 enum machine_mode mode;
817 if (DECL_P (type_or_decl))
818 decl = type_or_decl, type = TREE_TYPE (decl);
820 decl = NULL, type = type_or_decl;
822 mode = TYPE_MODE (type);
824 unsignedp = TYPE_UNSIGNED (type);
827 if (mode == BLKmode || memory_required)
829 HOST_WIDE_INT size = int_size_in_bytes (type);
833 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
834 problems with allocating the stack space. */
838 /* Unfortunately, we don't yet know how to allocate variable-sized
839 temporaries. However, sometimes we have a fixed upper limit on
840 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
841 instead. This is the case for Chill variable-sized strings. */
842 if (size == -1 && TREE_CODE (type) == ARRAY_TYPE
843 && TYPE_ARRAY_MAX_SIZE (type) != NULL_TREE
844 && host_integerp (TYPE_ARRAY_MAX_SIZE (type), 1))
845 size = tree_low_cst (TYPE_ARRAY_MAX_SIZE (type), 1);
847 /* If we still haven't been able to get a size, see if the language
848 can compute a maximum size. */
850 && (size_tree = lang_hooks.types.max_size (type)) != 0
851 && host_integerp (size_tree, 1))
852 size = tree_low_cst (size_tree, 1);
854 /* The size of the temporary may be too large to fit into an integer. */
855 /* ??? Not sure this should happen except for user silliness, so limit
856 this to things that aren't compiler-generated temporaries. The
857 rest of the time we'll abort in assign_stack_temp_for_type. */
858 if (decl && size == -1
859 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST)
861 error ("%Jsize of variable '%D' is too large", decl, decl);
865 tmp = assign_stack_temp_for_type (mode, size, keep, type);
871 mode = promote_mode (type, mode, &unsignedp, 0);
874 return gen_reg_rtx (mode);
877 /* Combine temporary stack slots which are adjacent on the stack.
879 This allows for better use of already allocated stack space. This is only
880 done for BLKmode slots because we can be sure that we won't have alignment
881 problems in this case. */
884 combine_temp_slots (void)
886 struct temp_slot *p, *q, *next, *next_q;
889 /* We can't combine slots, because the information about which slot
890 is in which alias set will be lost. */
891 if (flag_strict_aliasing)
894 /* If there are a lot of temp slots, don't do anything unless
895 high levels of optimization. */
896 if (! flag_expensive_optimizations)
897 for (p = avail_temp_slots, num_slots = 0; p; p = p->next, num_slots++)
898 if (num_slots > 100 || (num_slots > 10 && optimize == 0))
901 for (p = avail_temp_slots; p; p = next)
907 if (GET_MODE (p->slot) != BLKmode)
910 for (q = p->next; q; q = next_q)
916 if (GET_MODE (q->slot) != BLKmode)
919 if (p->base_offset + p->full_size == q->base_offset)
921 /* Q comes after P; combine Q into P. */
923 p->full_size += q->full_size;
926 else if (q->base_offset + q->full_size == p->base_offset)
928 /* P comes after Q; combine P into Q. */
930 q->full_size += p->full_size;
935 cut_slot_from_list (q, &avail_temp_slots);
938 /* Either delete P or advance past it. */
940 cut_slot_from_list (p, &avail_temp_slots);
944 /* Find the temp slot corresponding to the object at address X. */
946 static struct temp_slot *
947 find_temp_slot_from_address (rtx x)
953 for (i = max_slot_level (); i >= 0; i--)
954 for (p = *temp_slots_at_level (i); p; p = p->next)
956 if (XEXP (p->slot, 0) == x
958 || (GET_CODE (x) == PLUS
959 && XEXP (x, 0) == virtual_stack_vars_rtx
960 && GET_CODE (XEXP (x, 1)) == CONST_INT
961 && INTVAL (XEXP (x, 1)) >= p->base_offset
962 && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size))
965 else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST)
966 for (next = p->address; next; next = XEXP (next, 1))
967 if (XEXP (next, 0) == x)
971 /* If we have a sum involving a register, see if it points to a temp
973 if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 0))
974 && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
976 else if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 1))
977 && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
983 /* Indicate that NEW is an alternate way of referring to the temp slot
984 that previously was known by OLD. */
987 update_temp_slot_address (rtx old, rtx new)
991 if (rtx_equal_p (old, new))
994 p = find_temp_slot_from_address (old);
996 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
997 is a register, see if one operand of the PLUS is a temporary
998 location. If so, NEW points into it. Otherwise, if both OLD and
999 NEW are a PLUS and if there is a register in common between them.
1000 If so, try a recursive call on those values. */
1003 if (GET_CODE (old) != PLUS)
1008 update_temp_slot_address (XEXP (old, 0), new);
1009 update_temp_slot_address (XEXP (old, 1), new);
1012 else if (GET_CODE (new) != PLUS)
1015 if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0)))
1016 update_temp_slot_address (XEXP (old, 1), XEXP (new, 1));
1017 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0)))
1018 update_temp_slot_address (XEXP (old, 0), XEXP (new, 1));
1019 else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1)))
1020 update_temp_slot_address (XEXP (old, 1), XEXP (new, 0));
1021 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1)))
1022 update_temp_slot_address (XEXP (old, 0), XEXP (new, 0));
1027 /* Otherwise add an alias for the temp's address. */
1028 else if (p->address == 0)
1032 if (GET_CODE (p->address) != EXPR_LIST)
1033 p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX);
1035 p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address);
1039 /* If X could be a reference to a temporary slot, mark the fact that its
1040 address was taken. */
1043 mark_temp_addr_taken (rtx x)
1045 struct temp_slot *p;
1050 /* If X is not in memory or is at a constant address, it cannot be in
1051 a temporary slot. */
1052 if (!MEM_P (x) || CONSTANT_P (XEXP (x, 0)))
1055 p = find_temp_slot_from_address (XEXP (x, 0));
1060 /* If X could be a reference to a temporary slot, mark that slot as
1061 belonging to the to one level higher than the current level. If X
1062 matched one of our slots, just mark that one. Otherwise, we can't
1063 easily predict which it is, so upgrade all of them. Kept slots
1064 need not be touched.
1066 This is called when an ({...}) construct occurs and a statement
1067 returns a value in memory. */
1070 preserve_temp_slots (rtx x)
1072 struct temp_slot *p = 0, *next;
1074 /* If there is no result, we still might have some objects whose address
1075 were taken, so we need to make sure they stay around. */
1078 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1083 move_slot_to_level (p, temp_slot_level - 1);
1089 /* If X is a register that is being used as a pointer, see if we have
1090 a temporary slot we know it points to. To be consistent with
1091 the code below, we really should preserve all non-kept slots
1092 if we can't find a match, but that seems to be much too costly. */
1093 if (REG_P (x) && REG_POINTER (x))
1094 p = find_temp_slot_from_address (x);
1096 /* If X is not in memory or is at a constant address, it cannot be in
1097 a temporary slot, but it can contain something whose address was
1099 if (p == 0 && (!MEM_P (x) || CONSTANT_P (XEXP (x, 0))))
1101 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1106 move_slot_to_level (p, temp_slot_level - 1);
1112 /* First see if we can find a match. */
1114 p = find_temp_slot_from_address (XEXP (x, 0));
1118 /* Move everything at our level whose address was taken to our new
1119 level in case we used its address. */
1120 struct temp_slot *q;
1122 if (p->level == temp_slot_level)
1124 for (q = *temp_slots_at_level (temp_slot_level); q; q = next)
1128 if (p != q && q->addr_taken)
1129 move_slot_to_level (q, temp_slot_level - 1);
1132 move_slot_to_level (p, temp_slot_level - 1);
1138 /* Otherwise, preserve all non-kept slots at this level. */
1139 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1144 move_slot_to_level (p, temp_slot_level - 1);
1148 /* Free all temporaries used so far. This is normally called at the
1149 end of generating code for a statement. */
1152 free_temp_slots (void)
1154 struct temp_slot *p, *next;
1156 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1161 make_slot_available (p);
1164 combine_temp_slots ();
1167 /* Push deeper into the nesting level for stack temporaries. */
1170 push_temp_slots (void)
1175 /* Pop a temporary nesting level. All slots in use in the current level
1179 pop_temp_slots (void)
1181 struct temp_slot *p, *next;
1183 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1186 make_slot_available (p);
1189 combine_temp_slots ();
1194 /* Initialize temporary slots. */
1197 init_temp_slots (void)
1199 /* We have not allocated any temporaries yet. */
1200 avail_temp_slots = 0;
1201 used_temp_slots = 0;
1202 temp_slot_level = 0;
1203 var_temp_slot_level = 0;
1204 target_temp_slot_level = 0;
1207 /* These routines are responsible for converting virtual register references
1208 to the actual hard register references once RTL generation is complete.
1210 The following four variables are used for communication between the
1211 routines. They contain the offsets of the virtual registers from their
1212 respective hard registers. */
1214 static int in_arg_offset;
1215 static int var_offset;
1216 static int dynamic_offset;
1217 static int out_arg_offset;
1218 static int cfa_offset;
1220 /* In most machines, the stack pointer register is equivalent to the bottom
1223 #ifndef STACK_POINTER_OFFSET
1224 #define STACK_POINTER_OFFSET 0
1227 /* If not defined, pick an appropriate default for the offset of dynamically
1228 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
1229 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
1231 #ifndef STACK_DYNAMIC_OFFSET
1233 /* The bottom of the stack points to the actual arguments. If
1234 REG_PARM_STACK_SPACE is defined, this includes the space for the register
1235 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
1236 stack space for register parameters is not pushed by the caller, but
1237 rather part of the fixed stack areas and hence not included in
1238 `current_function_outgoing_args_size'. Nevertheless, we must allow
1239 for it when allocating stack dynamic objects. */
1241 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1242 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1243 ((ACCUMULATE_OUTGOING_ARGS \
1244 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
1245 + (STACK_POINTER_OFFSET)) \
1248 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1249 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
1250 + (STACK_POINTER_OFFSET))
1254 /* On most machines, the CFA coincides with the first incoming parm. */
1256 #ifndef ARG_POINTER_CFA_OFFSET
1257 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
1261 /* Convert a SET of a hard subreg to a set of the appropriate hard
1262 register. A subroutine of purge_hard_subreg_sets. */
1265 purge_single_hard_subreg_set (rtx pattern)
1267 rtx reg = SET_DEST (pattern);
1268 enum machine_mode mode = GET_MODE (SET_DEST (pattern));
1271 if (GET_CODE (reg) == SUBREG && REG_P (SUBREG_REG (reg))
1272 && REGNO (SUBREG_REG (reg)) < FIRST_PSEUDO_REGISTER)
1274 offset = subreg_regno_offset (REGNO (SUBREG_REG (reg)),
1275 GET_MODE (SUBREG_REG (reg)),
1278 reg = SUBREG_REG (reg);
1282 if (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER)
1284 reg = gen_rtx_REG (mode, REGNO (reg) + offset);
1285 SET_DEST (pattern) = reg;
1289 /* Eliminate all occurrences of SETs of hard subregs from INSNS. The
1290 only such SETs that we expect to see are those left in because
1291 integrate can't handle sets of parts of a return value register.
1293 We don't use alter_subreg because we only want to eliminate subregs
1294 of hard registers. */
1297 purge_hard_subreg_sets (rtx insn)
1299 for (; insn; insn = NEXT_INSN (insn))
1303 rtx pattern = PATTERN (insn);
1304 switch (GET_CODE (pattern))
1307 if (GET_CODE (SET_DEST (pattern)) == SUBREG)
1308 purge_single_hard_subreg_set (pattern);
1313 for (j = XVECLEN (pattern, 0) - 1; j >= 0; j--)
1315 rtx inner_pattern = XVECEXP (pattern, 0, j);
1316 if (GET_CODE (inner_pattern) == SET
1317 && GET_CODE (SET_DEST (inner_pattern)) == SUBREG)
1318 purge_single_hard_subreg_set (inner_pattern);
1329 /* Pass through the INSNS of function FNDECL and convert virtual register
1330 references to hard register references. */
1333 instantiate_virtual_regs (void)
1337 /* Compute the offsets to use for this function. */
1338 in_arg_offset = FIRST_PARM_OFFSET (current_function_decl);
1339 var_offset = STARTING_FRAME_OFFSET;
1340 dynamic_offset = STACK_DYNAMIC_OFFSET (current_function_decl);
1341 out_arg_offset = STACK_POINTER_OFFSET;
1342 cfa_offset = ARG_POINTER_CFA_OFFSET (current_function_decl);
1344 /* Scan all variables and parameters of this function. For each that is
1345 in memory, instantiate all virtual registers if the result is a valid
1346 address. If not, we do it later. That will handle most uses of virtual
1347 regs on many machines. */
1348 instantiate_decls (current_function_decl, 1);
1350 /* Initialize recognition, indicating that volatile is OK. */
1353 /* Scan through all the insns, instantiating every virtual register still
1355 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
1356 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
1357 || GET_CODE (insn) == CALL_INSN)
1359 instantiate_virtual_regs_1 (&PATTERN (insn), insn, 1);
1360 if (INSN_DELETED_P (insn))
1362 instantiate_virtual_regs_1 (®_NOTES (insn), NULL_RTX, 0);
1363 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
1364 if (GET_CODE (insn) == CALL_INSN)
1365 instantiate_virtual_regs_1 (&CALL_INSN_FUNCTION_USAGE (insn),
1368 /* Past this point all ASM statements should match. Verify that
1369 to avoid failures later in the compilation process. */
1370 if (asm_noperands (PATTERN (insn)) >= 0
1371 && ! check_asm_operands (PATTERN (insn)))
1372 instantiate_virtual_regs_lossage (insn);
1375 /* Now instantiate the remaining register equivalences for debugging info.
1376 These will not be valid addresses. */
1377 instantiate_decls (current_function_decl, 0);
1379 /* Indicate that, from now on, assign_stack_local should use
1380 frame_pointer_rtx. */
1381 virtuals_instantiated = 1;
1384 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
1385 all virtual registers in their DECL_RTL's.
1387 If VALID_ONLY, do this only if the resulting address is still valid.
1388 Otherwise, always do it. */
1391 instantiate_decls (tree fndecl, int valid_only)
1395 /* Process all parameters of the function. */
1396 for (decl = DECL_ARGUMENTS (fndecl); decl; decl = TREE_CHAIN (decl))
1398 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (decl));
1399 HOST_WIDE_INT size_rtl;
1401 instantiate_decl (DECL_RTL (decl), size, valid_only);
1403 /* If the parameter was promoted, then the incoming RTL mode may be
1404 larger than the declared type size. We must use the larger of
1406 size_rtl = GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl)));
1407 size = MAX (size_rtl, size);
1408 instantiate_decl (DECL_INCOMING_RTL (decl), size, valid_only);
1411 /* Now process all variables defined in the function or its subblocks. */
1412 instantiate_decls_1 (DECL_INITIAL (fndecl), valid_only);
1415 /* Subroutine of instantiate_decls: Process all decls in the given
1416 BLOCK node and all its subblocks. */
1419 instantiate_decls_1 (tree let, int valid_only)
1423 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
1424 if (DECL_RTL_SET_P (t))
1425 instantiate_decl (DECL_RTL (t),
1426 int_size_in_bytes (TREE_TYPE (t)),
1429 /* Process all subblocks. */
1430 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
1431 instantiate_decls_1 (t, valid_only);
1434 /* Subroutine of the preceding procedures: Given RTL representing a
1435 decl and the size of the object, do any instantiation required.
1437 If VALID_ONLY is nonzero, it means that the RTL should only be
1438 changed if the new address is valid. */
1441 instantiate_decl (rtx x, HOST_WIDE_INT size, int valid_only)
1443 enum machine_mode mode;
1446 /* If this is not a MEM, no need to do anything. Similarly if the
1447 address is a constant or a register that is not a virtual register. */
1449 if (x == 0 || !MEM_P (x))
1453 if (CONSTANT_P (addr)
1455 && (REGNO (addr) < FIRST_VIRTUAL_REGISTER
1456 || REGNO (addr) > LAST_VIRTUAL_REGISTER)))
1459 /* If we should only do this if the address is valid, copy the address.
1460 We need to do this so we can undo any changes that might make the
1461 address invalid. This copy is unfortunate, but probably can't be
1465 addr = copy_rtx (addr);
1467 instantiate_virtual_regs_1 (&addr, NULL_RTX, 0);
1469 if (valid_only && size >= 0)
1471 unsigned HOST_WIDE_INT decl_size = size;
1473 /* Now verify that the resulting address is valid for every integer or
1474 floating-point mode up to and including SIZE bytes long. We do this
1475 since the object might be accessed in any mode and frame addresses
1478 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1479 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
1480 mode = GET_MODE_WIDER_MODE (mode))
1481 if (! memory_address_p (mode, addr))
1484 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
1485 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
1486 mode = GET_MODE_WIDER_MODE (mode))
1487 if (! memory_address_p (mode, addr))
1491 /* Put back the address now that we have updated it and we either know
1492 it is valid or we don't care whether it is valid. */
1497 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
1498 is a virtual register, return the equivalent hard register and set the
1499 offset indirectly through the pointer. Otherwise, return 0. */
1502 instantiate_new_reg (rtx x, HOST_WIDE_INT *poffset)
1505 HOST_WIDE_INT offset;
1507 if (x == virtual_incoming_args_rtx)
1508 new = arg_pointer_rtx, offset = in_arg_offset;
1509 else if (x == virtual_stack_vars_rtx)
1510 new = frame_pointer_rtx, offset = var_offset;
1511 else if (x == virtual_stack_dynamic_rtx)
1512 new = stack_pointer_rtx, offset = dynamic_offset;
1513 else if (x == virtual_outgoing_args_rtx)
1514 new = stack_pointer_rtx, offset = out_arg_offset;
1515 else if (x == virtual_cfa_rtx)
1516 new = arg_pointer_rtx, offset = cfa_offset;
1525 /* Called when instantiate_virtual_regs has failed to update the instruction.
1526 Usually this means that non-matching instruction has been emit, however for
1527 asm statements it may be the problem in the constraints. */
1529 instantiate_virtual_regs_lossage (rtx insn)
1531 if (asm_noperands (PATTERN (insn)) >= 0)
1533 error_for_asm (insn, "impossible constraint in `asm'");
1539 /* Given a pointer to a piece of rtx and an optional pointer to the
1540 containing object, instantiate any virtual registers present in it.
1542 If EXTRA_INSNS, we always do the replacement and generate
1543 any extra insns before OBJECT. If it zero, we do nothing if replacement
1546 Return 1 if we either had nothing to do or if we were able to do the
1547 needed replacement. Return 0 otherwise; we only return zero if
1548 EXTRA_INSNS is zero.
1550 We first try some simple transformations to avoid the creation of extra
1554 instantiate_virtual_regs_1 (rtx *loc, rtx object, int extra_insns)
1559 HOST_WIDE_INT offset = 0;
1565 /* Re-start here to avoid recursion in common cases. */
1572 /* We may have detected and deleted invalid asm statements. */
1573 if (object && INSN_P (object) && INSN_DELETED_P (object))
1576 code = GET_CODE (x);
1578 /* Check for some special cases. */
1596 /* We are allowed to set the virtual registers. This means that
1597 the actual register should receive the source minus the
1598 appropriate offset. This is used, for example, in the handling
1599 of non-local gotos. */
1600 if ((new = instantiate_new_reg (SET_DEST (x), &offset)) != 0)
1602 rtx src = SET_SRC (x);
1604 /* We are setting the register, not using it, so the relevant
1605 offset is the negative of the offset to use were we using
1608 instantiate_virtual_regs_1 (&src, NULL_RTX, 0);
1610 /* The only valid sources here are PLUS or REG. Just do
1611 the simplest possible thing to handle them. */
1612 if (!REG_P (src) && GET_CODE (src) != PLUS)
1614 instantiate_virtual_regs_lossage (object);
1620 temp = force_operand (src, NULL_RTX);
1623 temp = force_operand (plus_constant (temp, offset), NULL_RTX);
1627 emit_insn_before (seq, object);
1630 if (! validate_change (object, &SET_SRC (x), temp, 0)
1632 instantiate_virtual_regs_lossage (object);
1637 instantiate_virtual_regs_1 (&SET_DEST (x), object, extra_insns);
1642 /* Handle special case of virtual register plus constant. */
1643 if (CONSTANT_P (XEXP (x, 1)))
1645 rtx old, new_offset;
1647 /* Check for (plus (plus VIRT foo) (const_int)) first. */
1648 if (GET_CODE (XEXP (x, 0)) == PLUS)
1650 if ((new = instantiate_new_reg (XEXP (XEXP (x, 0), 0), &offset)))
1652 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 1), object,
1654 new = gen_rtx_PLUS (Pmode, new, XEXP (XEXP (x, 0), 1));
1663 #ifdef POINTERS_EXTEND_UNSIGNED
1664 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
1665 we can commute the PLUS and SUBREG because pointers into the
1666 frame are well-behaved. */
1667 else if (GET_CODE (XEXP (x, 0)) == SUBREG && GET_MODE (x) == ptr_mode
1668 && GET_CODE (XEXP (x, 1)) == CONST_INT
1670 = instantiate_new_reg (SUBREG_REG (XEXP (x, 0)),
1672 && validate_change (object, loc,
1673 plus_constant (gen_lowpart (ptr_mode,
1676 + INTVAL (XEXP (x, 1))),
1680 else if ((new = instantiate_new_reg (XEXP (x, 0), &offset)) == 0)
1682 /* We know the second operand is a constant. Unless the
1683 first operand is a REG (which has been already checked),
1684 it needs to be checked. */
1685 if (!REG_P (XEXP (x, 0)))
1693 new_offset = plus_constant (XEXP (x, 1), offset);
1695 /* If the new constant is zero, try to replace the sum with just
1697 if (new_offset == const0_rtx
1698 && validate_change (object, loc, new, 0))
1701 /* Next try to replace the register and new offset.
1702 There are two changes to validate here and we can't assume that
1703 in the case of old offset equals new just changing the register
1704 will yield a valid insn. In the interests of a little efficiency,
1705 however, we only call validate change once (we don't queue up the
1706 changes and then call apply_change_group). */
1710 ? ! validate_change (object, &XEXP (x, 0), new, 0)
1711 : (XEXP (x, 0) = new,
1712 ! validate_change (object, &XEXP (x, 1), new_offset, 0)))
1720 /* Otherwise copy the new constant into a register and replace
1721 constant with that register. */
1722 temp = gen_reg_rtx (Pmode);
1724 if (validate_change (object, &XEXP (x, 1), temp, 0))
1725 emit_insn_before (gen_move_insn (temp, new_offset), object);
1728 /* If that didn't work, replace this expression with a
1729 register containing the sum. */
1732 new = gen_rtx_PLUS (Pmode, new, new_offset);
1735 temp = force_operand (new, NULL_RTX);
1739 emit_insn_before (seq, object);
1740 if (! validate_change (object, loc, temp, 0)
1741 && ! validate_replace_rtx (x, temp, object))
1743 instantiate_virtual_regs_lossage (object);
1752 /* Fall through to generic two-operand expression case. */
1758 case DIV: case UDIV:
1759 case MOD: case UMOD:
1760 case AND: case IOR: case XOR:
1761 case ROTATERT: case ROTATE:
1762 case ASHIFTRT: case LSHIFTRT: case ASHIFT:
1764 case GE: case GT: case GEU: case GTU:
1765 case LE: case LT: case LEU: case LTU:
1766 if (XEXP (x, 1) && ! CONSTANT_P (XEXP (x, 1)))
1767 instantiate_virtual_regs_1 (&XEXP (x, 1), object, extra_insns);
1772 /* Most cases of MEM that convert to valid addresses have already been
1773 handled by our scan of decls. The only special handling we
1774 need here is to make a copy of the rtx to ensure it isn't being
1775 shared if we have to change it to a pseudo.
1777 If the rtx is a simple reference to an address via a virtual register,
1778 it can potentially be shared. In such cases, first try to make it
1779 a valid address, which can also be shared. Otherwise, copy it and
1782 First check for common cases that need no processing. These are
1783 usually due to instantiation already being done on a previous instance
1787 if (CONSTANT_ADDRESS_P (temp)
1788 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
1789 || temp == arg_pointer_rtx
1791 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
1792 || temp == hard_frame_pointer_rtx
1794 || temp == frame_pointer_rtx)
1797 if (GET_CODE (temp) == PLUS
1798 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
1799 && (XEXP (temp, 0) == frame_pointer_rtx
1800 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
1801 || XEXP (temp, 0) == hard_frame_pointer_rtx
1803 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
1804 || XEXP (temp, 0) == arg_pointer_rtx
1809 if (temp == virtual_stack_vars_rtx
1810 || temp == virtual_incoming_args_rtx
1811 || (GET_CODE (temp) == PLUS
1812 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
1813 && (XEXP (temp, 0) == virtual_stack_vars_rtx
1814 || XEXP (temp, 0) == virtual_incoming_args_rtx)))
1816 /* This MEM may be shared. If the substitution can be done without
1817 the need to generate new pseudos, we want to do it in place
1818 so all copies of the shared rtx benefit. The call below will
1819 only make substitutions if the resulting address is still
1822 Note that we cannot pass X as the object in the recursive call
1823 since the insn being processed may not allow all valid
1824 addresses. However, if we were not passed on object, we can
1825 only modify X without copying it if X will have a valid
1828 ??? Also note that this can still lose if OBJECT is an insn that
1829 has less restrictions on an address that some other insn.
1830 In that case, we will modify the shared address. This case
1831 doesn't seem very likely, though. One case where this could
1832 happen is in the case of a USE or CLOBBER reference, but we
1833 take care of that below. */
1835 if (instantiate_virtual_regs_1 (&XEXP (x, 0),
1836 object ? object : x, 0))
1839 /* Otherwise make a copy and process that copy. We copy the entire
1840 RTL expression since it might be a PLUS which could also be
1842 *loc = x = copy_rtx (x);
1845 /* Fall through to generic unary operation case. */
1848 case STRICT_LOW_PART:
1850 case PRE_DEC: case PRE_INC: case POST_DEC: case POST_INC:
1851 case SIGN_EXTEND: case ZERO_EXTEND:
1852 case TRUNCATE: case FLOAT_EXTEND: case FLOAT_TRUNCATE:
1853 case FLOAT: case FIX:
1854 case UNSIGNED_FIX: case UNSIGNED_FLOAT:
1859 case POPCOUNT: case PARITY:
1860 /* These case either have just one operand or we know that we need not
1861 check the rest of the operands. */
1867 /* If the operand is a MEM, see if the change is a valid MEM. If not,
1868 go ahead and make the invalid one, but do it to a copy. For a REG,
1869 just make the recursive call, since there's no chance of a problem. */
1871 if ((MEM_P (XEXP (x, 0))
1872 && instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), XEXP (x, 0),
1874 || (REG_P (XEXP (x, 0))
1875 && instantiate_virtual_regs_1 (&XEXP (x, 0), object, 0)))
1878 XEXP (x, 0) = copy_rtx (XEXP (x, 0));
1883 /* Try to replace with a PLUS. If that doesn't work, compute the sum
1884 in front of this insn and substitute the temporary. */
1885 if ((new = instantiate_new_reg (x, &offset)) != 0)
1887 temp = plus_constant (new, offset);
1888 if (!validate_change (object, loc, temp, 0))
1894 temp = force_operand (temp, NULL_RTX);
1898 emit_insn_before (seq, object);
1899 if (! validate_change (object, loc, temp, 0)
1900 && ! validate_replace_rtx (x, temp, object))
1901 instantiate_virtual_regs_lossage (object);
1911 /* Scan all subexpressions. */
1912 fmt = GET_RTX_FORMAT (code);
1913 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
1916 if (!instantiate_virtual_regs_1 (&XEXP (x, i), object, extra_insns))
1919 else if (*fmt == 'E')
1920 for (j = 0; j < XVECLEN (x, i); j++)
1921 if (! instantiate_virtual_regs_1 (&XVECEXP (x, i, j), object,
1928 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
1929 This means a type for which function calls must pass an address to the
1930 function or get an address back from the function.
1931 EXP may be a type node or an expression (whose type is tested). */
1934 aggregate_value_p (tree exp, tree fntype)
1936 int i, regno, nregs;
1939 tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
1942 switch (TREE_CODE (fntype))
1945 fntype = get_callee_fndecl (fntype);
1946 fntype = fntype ? TREE_TYPE (fntype) : 0;
1949 fntype = TREE_TYPE (fntype);
1954 case IDENTIFIER_NODE:
1958 /* We don't expect other rtl types here. */
1962 if (TREE_CODE (type) == VOID_TYPE)
1964 if (targetm.calls.return_in_memory (type, fntype))
1966 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
1967 and thus can't be returned in registers. */
1968 if (TREE_ADDRESSABLE (type))
1970 if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
1972 /* Make sure we have suitable call-clobbered regs to return
1973 the value in; if not, we must return it in memory. */
1974 reg = hard_function_value (type, 0, 0);
1976 /* If we have something other than a REG (e.g. a PARALLEL), then assume
1981 regno = REGNO (reg);
1982 nregs = hard_regno_nregs[regno][TYPE_MODE (type)];
1983 for (i = 0; i < nregs; i++)
1984 if (! call_used_regs[regno + i])
1989 /* Return true if we should assign DECL a pseudo register; false if it
1990 should live on the local stack. */
1993 use_register_for_decl (tree decl)
1995 /* Honor volatile. */
1996 if (TREE_SIDE_EFFECTS (decl))
1999 /* Honor addressability. */
2000 if (TREE_ADDRESSABLE (decl))
2003 /* Only register-like things go in registers. */
2004 if (DECL_MODE (decl) == BLKmode)
2007 /* If -ffloat-store specified, don't put explicit float variables
2009 /* ??? This should be checked after DECL_ARTIFICIAL, but tree-ssa
2010 propagates values across these stores, and it probably shouldn't. */
2011 if (flag_float_store && FLOAT_TYPE_P (TREE_TYPE (decl)))
2014 /* Compiler-generated temporaries can always go in registers. */
2015 if (DECL_ARTIFICIAL (decl))
2018 #ifdef NON_SAVING_SETJMP
2019 /* Protect variables not declared "register" from setjmp. */
2020 if (NON_SAVING_SETJMP
2021 && current_function_calls_setjmp
2022 && !DECL_REGISTER (decl))
2026 return (optimize || DECL_REGISTER (decl));
2029 /* Return true if TYPE should be passed by invisible reference. */
2032 pass_by_reference (CUMULATIVE_ARGS *ca, enum machine_mode mode,
2033 tree type, bool named_arg)
2037 /* If this type contains non-trivial constructors, then it is
2038 forbidden for the middle-end to create any new copies. */
2039 if (TREE_ADDRESSABLE (type))
2042 /* GCC post 3.4 passes *all* variable sized types by reference. */
2043 if (!TYPE_SIZE (type) || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
2047 return targetm.calls.pass_by_reference (ca, mode, type, named_arg);
2050 /* Structures to communicate between the subroutines of assign_parms.
2051 The first holds data persistent across all parameters, the second
2052 is cleared out for each parameter. */
2054 struct assign_parm_data_all
2056 CUMULATIVE_ARGS args_so_far;
2057 struct args_size stack_args_size;
2058 tree function_result_decl;
2060 rtx conversion_insns;
2061 HOST_WIDE_INT pretend_args_size;
2062 HOST_WIDE_INT extra_pretend_bytes;
2063 int reg_parm_stack_space;
2066 struct assign_parm_data_one
2072 enum machine_mode nominal_mode;
2073 enum machine_mode passed_mode;
2074 enum machine_mode promoted_mode;
2075 struct locate_and_pad_arg_data locate;
2077 BOOL_BITFIELD named_arg : 1;
2078 BOOL_BITFIELD last_named : 1;
2079 BOOL_BITFIELD passed_pointer : 1;
2080 BOOL_BITFIELD on_stack : 1;
2081 BOOL_BITFIELD loaded_in_reg : 1;
2084 /* A subroutine of assign_parms. Initialize ALL. */
2087 assign_parms_initialize_all (struct assign_parm_data_all *all)
2091 memset (all, 0, sizeof (*all));
2093 fntype = TREE_TYPE (current_function_decl);
2095 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
2096 INIT_CUMULATIVE_INCOMING_ARGS (all->args_so_far, fntype, NULL_RTX);
2098 INIT_CUMULATIVE_ARGS (all->args_so_far, fntype, NULL_RTX,
2099 current_function_decl, -1);
2102 #ifdef REG_PARM_STACK_SPACE
2103 all->reg_parm_stack_space = REG_PARM_STACK_SPACE (current_function_decl);
2107 /* If ARGS contains entries with complex types, split the entry into two
2108 entries of the component type. Return a new list of substitutions are
2109 needed, else the old list. */
2112 split_complex_args (tree args)
2116 /* Before allocating memory, check for the common case of no complex. */
2117 for (p = args; p; p = TREE_CHAIN (p))
2119 tree type = TREE_TYPE (p);
2120 if (TREE_CODE (type) == COMPLEX_TYPE
2121 && targetm.calls.split_complex_arg (type))
2127 args = copy_list (args);
2129 for (p = args; p; p = TREE_CHAIN (p))
2131 tree type = TREE_TYPE (p);
2132 if (TREE_CODE (type) == COMPLEX_TYPE
2133 && targetm.calls.split_complex_arg (type))
2136 tree subtype = TREE_TYPE (type);
2138 /* Rewrite the PARM_DECL's type with its component. */
2139 TREE_TYPE (p) = subtype;
2140 DECL_ARG_TYPE (p) = TREE_TYPE (DECL_ARG_TYPE (p));
2141 DECL_MODE (p) = VOIDmode;
2142 DECL_SIZE (p) = NULL;
2143 DECL_SIZE_UNIT (p) = NULL;
2146 /* Build a second synthetic decl. */
2147 decl = build_decl (PARM_DECL, NULL_TREE, subtype);
2148 DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (p);
2149 layout_decl (decl, 0);
2151 /* Splice it in; skip the new decl. */
2152 TREE_CHAIN (decl) = TREE_CHAIN (p);
2153 TREE_CHAIN (p) = decl;
2161 /* A subroutine of assign_parms. Adjust the parameter list to incorporate
2162 the hidden struct return argument, and (abi willing) complex args.
2163 Return the new parameter list. */
2166 assign_parms_augmented_arg_list (struct assign_parm_data_all *all)
2168 tree fndecl = current_function_decl;
2169 tree fntype = TREE_TYPE (fndecl);
2170 tree fnargs = DECL_ARGUMENTS (fndecl);
2172 /* If struct value address is treated as the first argument, make it so. */
2173 if (aggregate_value_p (DECL_RESULT (fndecl), fndecl)
2174 && ! current_function_returns_pcc_struct
2175 && targetm.calls.struct_value_rtx (TREE_TYPE (fndecl), 1) == 0)
2177 tree type = build_pointer_type (TREE_TYPE (fntype));
2180 decl = build_decl (PARM_DECL, NULL_TREE, type);
2181 DECL_ARG_TYPE (decl) = type;
2182 DECL_ARTIFICIAL (decl) = 1;
2184 TREE_CHAIN (decl) = fnargs;
2186 all->function_result_decl = decl;
2189 all->orig_fnargs = fnargs;
2191 /* If the target wants to split complex arguments into scalars, do so. */
2192 if (targetm.calls.split_complex_arg)
2193 fnargs = split_complex_args (fnargs);
2198 /* A subroutine of assign_parms. Examine PARM and pull out type and mode
2199 data for the parameter. Incorporate ABI specifics such as pass-by-
2200 reference and type promotion. */
2203 assign_parm_find_data_types (struct assign_parm_data_all *all, tree parm,
2204 struct assign_parm_data_one *data)
2206 tree nominal_type, passed_type;
2207 enum machine_mode nominal_mode, passed_mode, promoted_mode;
2209 memset (data, 0, sizeof (*data));
2211 /* Set LAST_NAMED if this is last named arg before last anonymous args. */
2212 if (current_function_stdarg)
2215 for (tem = TREE_CHAIN (parm); tem; tem = TREE_CHAIN (tem))
2216 if (DECL_NAME (tem))
2219 data->last_named = true;
2222 /* Set NAMED_ARG if this arg should be treated as a named arg. For
2223 most machines, if this is a varargs/stdarg function, then we treat
2224 the last named arg as if it were anonymous too. */
2225 if (targetm.calls.strict_argument_naming (&all->args_so_far))
2226 data->named_arg = 1;
2228 data->named_arg = !data->last_named;
2230 nominal_type = TREE_TYPE (parm);
2231 passed_type = DECL_ARG_TYPE (parm);
2233 /* Look out for errors propagating this far. Also, if the parameter's
2234 type is void then its value doesn't matter. */
2235 if (TREE_TYPE (parm) == error_mark_node
2236 /* This can happen after weird syntax errors
2237 or if an enum type is defined among the parms. */
2238 || TREE_CODE (parm) != PARM_DECL
2239 || passed_type == NULL
2240 || VOID_TYPE_P (nominal_type))
2242 nominal_type = passed_type = void_type_node;
2243 nominal_mode = passed_mode = promoted_mode = VOIDmode;
2247 /* Find mode of arg as it is passed, and mode of arg as it should be
2248 during execution of this function. */
2249 passed_mode = TYPE_MODE (passed_type);
2250 nominal_mode = TYPE_MODE (nominal_type);
2252 /* If the parm is to be passed as a transparent union, use the type of
2253 the first field for the tests below. We have already verified that
2254 the modes are the same. */
2255 if (DECL_TRANSPARENT_UNION (parm)
2256 || (TREE_CODE (passed_type) == UNION_TYPE
2257 && TYPE_TRANSPARENT_UNION (passed_type)))
2258 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
2260 /* See if this arg was passed by invisible reference. */
2261 if (pass_by_reference (&all->args_so_far, passed_mode,
2262 passed_type, data->named_arg))
2264 passed_type = nominal_type = build_pointer_type (passed_type);
2265 data->passed_pointer = true;
2266 passed_mode = nominal_mode = Pmode;
2268 /* See if the frontend wants to pass this by invisible reference. */
2269 else if (passed_type != nominal_type
2270 && POINTER_TYPE_P (passed_type)
2271 && TREE_TYPE (passed_type) == nominal_type)
2273 nominal_type = passed_type;
2274 data->passed_pointer = 1;
2275 passed_mode = nominal_mode = Pmode;
2278 /* Find mode as it is passed by the ABI. */
2279 promoted_mode = passed_mode;
2280 if (targetm.calls.promote_function_args (TREE_TYPE (current_function_decl)))
2282 int unsignedp = TYPE_UNSIGNED (passed_type);
2283 promoted_mode = promote_mode (passed_type, promoted_mode,
2288 data->nominal_type = nominal_type;
2289 data->passed_type = passed_type;
2290 data->nominal_mode = nominal_mode;
2291 data->passed_mode = passed_mode;
2292 data->promoted_mode = promoted_mode;
2295 /* A subroutine of assign_parms. Invoke setup_incoming_varargs. */
2298 assign_parms_setup_varargs (struct assign_parm_data_all *all,
2299 struct assign_parm_data_one *data, bool no_rtl)
2301 int varargs_pretend_bytes = 0;
2303 targetm.calls.setup_incoming_varargs (&all->args_so_far,
2304 data->promoted_mode,
2306 &varargs_pretend_bytes, no_rtl);
2308 /* If the back-end has requested extra stack space, record how much is
2309 needed. Do not change pretend_args_size otherwise since it may be
2310 nonzero from an earlier partial argument. */
2311 if (varargs_pretend_bytes > 0)
2312 all->pretend_args_size = varargs_pretend_bytes;
2315 /* A subroutine of assign_parms. Set DATA->ENTRY_PARM corresponding to
2316 the incoming location of the current parameter. */
2319 assign_parm_find_entry_rtl (struct assign_parm_data_all *all,
2320 struct assign_parm_data_one *data)
2322 HOST_WIDE_INT pretend_bytes = 0;
2326 if (data->promoted_mode == VOIDmode)
2328 data->entry_parm = data->stack_parm = const0_rtx;
2332 #ifdef FUNCTION_INCOMING_ARG
2333 entry_parm = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
2334 data->passed_type, data->named_arg);
2336 entry_parm = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
2337 data->passed_type, data->named_arg);
2340 if (entry_parm == 0)
2341 data->promoted_mode = data->passed_mode;
2343 /* Determine parm's home in the stack, in case it arrives in the stack
2344 or we should pretend it did. Compute the stack position and rtx where
2345 the argument arrives and its size.
2347 There is one complexity here: If this was a parameter that would
2348 have been passed in registers, but wasn't only because it is
2349 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
2350 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
2351 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of 0
2352 as it was the previous time. */
2353 in_regs = entry_parm != 0;
2354 #ifdef STACK_PARMS_IN_REG_PARM_AREA
2357 if (!in_regs && !data->named_arg)
2359 if (targetm.calls.pretend_outgoing_varargs_named (&all->args_so_far))
2362 #ifdef FUNCTION_INCOMING_ARG
2363 tem = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
2364 data->passed_type, true);
2366 tem = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
2367 data->passed_type, true);
2369 in_regs = tem != NULL;
2373 /* If this parameter was passed both in registers and in the stack, use
2374 the copy on the stack. */
2375 if (targetm.calls.must_pass_in_stack (data->promoted_mode,
2383 partial = FUNCTION_ARG_PARTIAL_NREGS (all->args_so_far,
2384 data->promoted_mode,
2387 data->partial = partial;
2389 /* The caller might already have allocated stack space for the
2390 register parameters. */
2391 if (partial != 0 && all->reg_parm_stack_space == 0)
2393 /* Part of this argument is passed in registers and part
2394 is passed on the stack. Ask the prologue code to extend
2395 the stack part so that we can recreate the full value.
2397 PRETEND_BYTES is the size of the registers we need to store.
2398 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
2399 stack space that the prologue should allocate.
2401 Internally, gcc assumes that the argument pointer is aligned
2402 to STACK_BOUNDARY bits. This is used both for alignment
2403 optimizations (see init_emit) and to locate arguments that are
2404 aligned to more than PARM_BOUNDARY bits. We must preserve this
2405 invariant by rounding CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to
2406 a stack boundary. */
2408 /* We assume at most one partial arg, and it must be the first
2409 argument on the stack. */
2410 if (all->extra_pretend_bytes || all->pretend_args_size)
2413 pretend_bytes = partial * UNITS_PER_WORD;
2414 all->pretend_args_size = CEIL_ROUND (pretend_bytes, STACK_BYTES);
2416 /* We want to align relative to the actual stack pointer, so
2417 don't include this in the stack size until later. */
2418 all->extra_pretend_bytes = all->pretend_args_size;
2422 locate_and_pad_parm (data->promoted_mode, data->passed_type, in_regs,
2423 entry_parm ? data->partial : 0, current_function_decl,
2424 &all->stack_args_size, &data->locate);
2426 /* Adjust offsets to include the pretend args. */
2427 pretend_bytes = all->extra_pretend_bytes - pretend_bytes;
2428 data->locate.slot_offset.constant += pretend_bytes;
2429 data->locate.offset.constant += pretend_bytes;
2431 data->entry_parm = entry_parm;
2434 /* A subroutine of assign_parms. If there is actually space on the stack
2435 for this parm, count it in stack_args_size and return true. */
2438 assign_parm_is_stack_parm (struct assign_parm_data_all *all,
2439 struct assign_parm_data_one *data)
2441 /* Trivially true if we've no incomming register. */
2442 if (data->entry_parm == NULL)
2444 /* Also true if we're partially in registers and partially not,
2445 since we've arranged to drop the entire argument on the stack. */
2446 else if (data->partial != 0)
2448 /* Also true if the target says that it's passed in both registers
2449 and on the stack. */
2450 else if (GET_CODE (data->entry_parm) == PARALLEL
2451 && XEXP (XVECEXP (data->entry_parm, 0, 0), 0) == NULL_RTX)
2453 /* Also true if the target says that there's stack allocated for
2454 all register parameters. */
2455 else if (all->reg_parm_stack_space > 0)
2457 /* Otherwise, no, this parameter has no ABI defined stack slot. */
2461 all->stack_args_size.constant += data->locate.size.constant;
2462 if (data->locate.size.var)
2463 ADD_PARM_SIZE (all->stack_args_size, data->locate.size.var);
2468 /* A subroutine of assign_parms. Given that this parameter is allocated
2469 stack space by the ABI, find it. */
2472 assign_parm_find_stack_rtl (tree parm, struct assign_parm_data_one *data)
2474 rtx offset_rtx, stack_parm;
2475 unsigned int align, boundary;
2477 /* If we're passing this arg using a reg, make its stack home the
2478 aligned stack slot. */
2479 if (data->entry_parm)
2480 offset_rtx = ARGS_SIZE_RTX (data->locate.slot_offset);
2482 offset_rtx = ARGS_SIZE_RTX (data->locate.offset);
2484 stack_parm = current_function_internal_arg_pointer;
2485 if (offset_rtx != const0_rtx)
2486 stack_parm = gen_rtx_PLUS (Pmode, stack_parm, offset_rtx);
2487 stack_parm = gen_rtx_MEM (data->promoted_mode, stack_parm);
2489 set_mem_attributes (stack_parm, parm, 1);
2491 boundary = FUNCTION_ARG_BOUNDARY (data->promoted_mode, data->passed_type);
2494 /* If we're padding upward, we know that the alignment of the slot
2495 is FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
2496 intentionally forcing upward padding. Otherwise we have to come
2497 up with a guess at the alignment based on OFFSET_RTX. */
2498 if (data->locate.where_pad == upward || data->entry_parm)
2500 else if (GET_CODE (offset_rtx) == CONST_INT)
2502 align = INTVAL (offset_rtx) * BITS_PER_UNIT | boundary;
2503 align = align & -align;
2506 set_mem_align (stack_parm, align);
2508 if (data->entry_parm)
2509 set_reg_attrs_for_parm (data->entry_parm, stack_parm);
2511 data->stack_parm = stack_parm;
2514 /* A subroutine of assign_parms. Adjust DATA->ENTRY_RTL such that it's
2515 always valid and contiguous. */
2518 assign_parm_adjust_entry_rtl (struct assign_parm_data_one *data)
2520 rtx entry_parm = data->entry_parm;
2521 rtx stack_parm = data->stack_parm;
2523 /* If this parm was passed part in regs and part in memory, pretend it
2524 arrived entirely in memory by pushing the register-part onto the stack.
2525 In the special case of a DImode or DFmode that is split, we could put
2526 it together in a pseudoreg directly, but for now that's not worth
2528 if (data->partial != 0)
2530 /* Handle calls that pass values in multiple non-contiguous
2531 locations. The Irix 6 ABI has examples of this. */
2532 if (GET_CODE (entry_parm) == PARALLEL)
2533 emit_group_store (validize_mem (stack_parm), entry_parm,
2535 int_size_in_bytes (data->passed_type));
2537 move_block_from_reg (REGNO (entry_parm), validize_mem (stack_parm),
2540 entry_parm = stack_parm;
2543 /* If we didn't decide this parm came in a register, by default it came
2545 else if (entry_parm == NULL)
2546 entry_parm = stack_parm;
2548 /* When an argument is passed in multiple locations, we can't make use
2549 of this information, but we can save some copying if the whole argument
2550 is passed in a single register. */
2551 else if (GET_CODE (entry_parm) == PARALLEL
2552 && data->nominal_mode != BLKmode
2553 && data->passed_mode != BLKmode)
2555 size_t i, len = XVECLEN (entry_parm, 0);
2557 for (i = 0; i < len; i++)
2558 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
2559 && REG_P (XEXP (XVECEXP (entry_parm, 0, i), 0))
2560 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
2561 == data->passed_mode)
2562 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
2564 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
2569 data->entry_parm = entry_parm;
2572 /* A subroutine of assign_parms. Adjust DATA->STACK_RTL such that it's
2573 always valid and properly aligned. */
2577 assign_parm_adjust_stack_rtl (struct assign_parm_data_one *data)
2579 rtx stack_parm = data->stack_parm;
2581 /* If we can't trust the parm stack slot to be aligned enough for its
2582 ultimate type, don't use that slot after entry. We'll make another
2583 stack slot, if we need one. */
2584 if (STRICT_ALIGNMENT && stack_parm
2585 && GET_MODE_ALIGNMENT (data->nominal_mode) > MEM_ALIGN (stack_parm))
2588 /* If parm was passed in memory, and we need to convert it on entry,
2589 don't store it back in that same slot. */
2590 else if (data->entry_parm == stack_parm
2591 && data->nominal_mode != BLKmode
2592 && data->nominal_mode != data->passed_mode)
2595 data->stack_parm = stack_parm;
2598 /* A subroutine of assign_parms. Return true if the current parameter
2599 should be stored as a BLKmode in the current frame. */
2602 assign_parm_setup_block_p (struct assign_parm_data_one *data)
2604 if (data->nominal_mode == BLKmode)
2606 if (GET_CODE (data->entry_parm) == PARALLEL)
2609 #ifdef BLOCK_REG_PADDING
2610 if (data->locate.where_pad == (BYTES_BIG_ENDIAN ? upward : downward)
2611 && GET_MODE_SIZE (data->promoted_mode) < UNITS_PER_WORD)
2618 /* A subroutine of assign_parms. Arrange for the parameter to be
2619 present and valid in DATA->STACK_RTL. */
2622 assign_parm_setup_block (tree parm, struct assign_parm_data_one *data)
2624 rtx entry_parm = data->entry_parm;
2625 rtx stack_parm = data->stack_parm;
2627 /* If we've a non-block object that's nevertheless passed in parts,
2628 reconstitute it in register operations rather than on the stack. */
2629 if (GET_CODE (entry_parm) == PARALLEL
2630 && data->nominal_mode != BLKmode
2631 && XVECLEN (entry_parm, 0) > 1
2634 rtx parmreg = gen_reg_rtx (data->nominal_mode);
2636 emit_group_store (parmreg, entry_parm, data->nominal_type,
2637 int_size_in_bytes (data->nominal_type));
2638 SET_DECL_RTL (parm, parmreg);
2642 /* If a BLKmode arrives in registers, copy it to a stack slot. Handle
2643 calls that pass values in multiple non-contiguous locations. */
2644 if (REG_P (entry_parm) || GET_CODE (entry_parm) == PARALLEL)
2646 HOST_WIDE_INT size = int_size_in_bytes (data->passed_type);
2647 HOST_WIDE_INT size_stored = CEIL_ROUND (size, UNITS_PER_WORD);
2650 /* Note that we will be storing an integral number of words.
2651 So we have to be careful to ensure that we allocate an
2652 integral number of words. We do this below in the
2653 assign_stack_local if space was not allocated in the argument
2654 list. If it was, this will not work if PARM_BOUNDARY is not
2655 a multiple of BITS_PER_WORD. It isn't clear how to fix this
2656 if it becomes a problem. Exception is when BLKmode arrives
2657 with arguments not conforming to word_mode. */
2659 if (stack_parm == 0)
2661 stack_parm = assign_stack_local (BLKmode, size_stored, 0);
2662 data->stack_parm = stack_parm;
2663 PUT_MODE (stack_parm, GET_MODE (entry_parm));
2664 set_mem_attributes (stack_parm, parm, 1);
2666 else if (GET_CODE (entry_parm) == PARALLEL)
2668 else if (size != 0 && PARM_BOUNDARY % BITS_PER_WORD != 0)
2671 mem = validize_mem (stack_parm);
2673 /* Handle values in multiple non-contiguous locations. */
2674 if (GET_CODE (entry_parm) == PARALLEL)
2675 emit_group_store (mem, entry_parm, data->passed_type, size);
2680 /* If SIZE is that of a mode no bigger than a word, just use
2681 that mode's store operation. */
2682 else if (size <= UNITS_PER_WORD)
2684 enum machine_mode mode
2685 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
2688 #ifdef BLOCK_REG_PADDING
2689 && (size == UNITS_PER_WORD
2690 || (BLOCK_REG_PADDING (mode, data->passed_type, 1)
2691 != (BYTES_BIG_ENDIAN ? upward : downward)))
2695 rtx reg = gen_rtx_REG (mode, REGNO (entry_parm));
2696 emit_move_insn (change_address (mem, mode, 0), reg);
2699 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
2700 machine must be aligned to the left before storing
2701 to memory. Note that the previous test doesn't
2702 handle all cases (e.g. SIZE == 3). */
2703 else if (size != UNITS_PER_WORD
2704 #ifdef BLOCK_REG_PADDING
2705 && (BLOCK_REG_PADDING (mode, data->passed_type, 1)
2713 int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
2714 rtx reg = gen_rtx_REG (word_mode, REGNO (data->entry_parm));
2716 x = expand_shift (LSHIFT_EXPR, word_mode, reg,
2717 build_int_2 (by, 0), NULL_RTX, 1);
2718 tem = change_address (mem, word_mode, 0);
2719 emit_move_insn (tem, x);
2722 move_block_from_reg (REGNO (data->entry_parm), mem,
2723 size_stored / UNITS_PER_WORD);
2726 move_block_from_reg (REGNO (data->entry_parm), mem,
2727 size_stored / UNITS_PER_WORD);
2730 SET_DECL_RTL (parm, stack_parm);
2733 /* A subroutine of assign_parms. Allocate a pseudo to hold the current
2734 parameter. Get it there. Perform all ABI specified conversions. */
2737 assign_parm_setup_reg (struct assign_parm_data_all *all, tree parm,
2738 struct assign_parm_data_one *data)
2741 enum machine_mode promoted_nominal_mode;
2742 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (parm));
2743 bool did_conversion = false;
2745 /* Store the parm in a pseudoregister during the function, but we may
2746 need to do it in a wider mode. */
2748 promoted_nominal_mode
2749 = promote_mode (data->nominal_type, data->nominal_mode, &unsignedp, 0);
2751 parmreg = gen_reg_rtx (promoted_nominal_mode);
2753 if (!DECL_ARTIFICIAL (parm))
2754 mark_user_reg (parmreg);
2756 /* If this was an item that we received a pointer to,
2757 set DECL_RTL appropriately. */
2758 if (data->passed_pointer)
2760 rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data->passed_type)), parmreg);
2761 set_mem_attributes (x, parm, 1);
2762 SET_DECL_RTL (parm, x);
2766 SET_DECL_RTL (parm, parmreg);
2767 maybe_set_unchanging (DECL_RTL (parm), parm);
2770 /* Copy the value into the register. */
2771 if (data->nominal_mode != data->passed_mode
2772 || promoted_nominal_mode != data->promoted_mode)
2776 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
2777 mode, by the caller. We now have to convert it to
2778 NOMINAL_MODE, if different. However, PARMREG may be in
2779 a different mode than NOMINAL_MODE if it is being stored
2782 If ENTRY_PARM is a hard register, it might be in a register
2783 not valid for operating in its mode (e.g., an odd-numbered
2784 register for a DFmode). In that case, moves are the only
2785 thing valid, so we can't do a convert from there. This
2786 occurs when the calling sequence allow such misaligned
2789 In addition, the conversion may involve a call, which could
2790 clobber parameters which haven't been copied to pseudo
2791 registers yet. Therefore, we must first copy the parm to
2792 a pseudo reg here, and save the conversion until after all
2793 parameters have been moved. */
2795 rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
2797 emit_move_insn (tempreg, validize_mem (data->entry_parm));
2799 push_to_sequence (all->conversion_insns);
2800 tempreg = convert_to_mode (data->nominal_mode, tempreg, unsignedp);
2802 if (GET_CODE (tempreg) == SUBREG
2803 && GET_MODE (tempreg) == data->nominal_mode
2804 && REG_P (SUBREG_REG (tempreg))
2805 && data->nominal_mode == data->passed_mode
2806 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (data->entry_parm)
2807 && GET_MODE_SIZE (GET_MODE (tempreg))
2808 < GET_MODE_SIZE (GET_MODE (data->entry_parm)))
2810 /* The argument is already sign/zero extended, so note it
2812 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
2813 SUBREG_PROMOTED_UNSIGNED_SET (tempreg, unsignedp);
2816 /* TREE_USED gets set erroneously during expand_assignment. */
2817 save_tree_used = TREE_USED (parm);
2818 expand_assignment (parm, make_tree (data->nominal_type, tempreg), 0);
2819 TREE_USED (parm) = save_tree_used;
2820 all->conversion_insns = get_insns ();
2823 did_conversion = true;
2826 emit_move_insn (parmreg, validize_mem (data->entry_parm));
2828 /* If we were passed a pointer but the actual value can safely live
2829 in a register, put it in one. */
2830 if (data->passed_pointer
2831 && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
2832 /* If by-reference argument was promoted, demote it. */
2833 && (TYPE_MODE (TREE_TYPE (parm)) != GET_MODE (DECL_RTL (parm))
2834 || use_register_for_decl (parm)))
2836 /* We can't use nominal_mode, because it will have been set to
2837 Pmode above. We must use the actual mode of the parm. */
2838 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
2839 mark_user_reg (parmreg);
2841 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
2843 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
2844 int unsigned_p = TYPE_UNSIGNED (TREE_TYPE (parm));
2846 push_to_sequence (all->conversion_insns);
2847 emit_move_insn (tempreg, DECL_RTL (parm));
2848 tempreg = convert_to_mode (GET_MODE (parmreg), tempreg, unsigned_p);
2849 emit_move_insn (parmreg, tempreg);
2850 all->conversion_insns = get_insns();
2853 did_conversion = true;
2856 emit_move_insn (parmreg, DECL_RTL (parm));
2858 SET_DECL_RTL (parm, parmreg);
2860 /* STACK_PARM is the pointer, not the parm, and PARMREG is
2862 data->stack_parm = NULL;
2865 /* If we are passed an arg by reference and it is our responsibility
2866 to make a copy, do it now.
2867 PASSED_TYPE and PASSED mode now refer to the pointer, not the
2868 original argument, so we must recreate them in the call to
2869 FUNCTION_ARG_CALLEE_COPIES. */
2870 /* ??? Later add code to handle the case that if the argument isn't
2871 modified, don't do the copy. */
2873 else if (data->passed_pointer)
2875 tree type = TREE_TYPE (data->passed_type);
2877 if (FUNCTION_ARG_CALLEE_COPIES (all->args_so_far, TYPE_MODE (type),
2878 type, data->named_arg)
2879 && !TREE_ADDRESSABLE (type))
2883 /* This sequence may involve a library call perhaps clobbering
2884 registers that haven't been copied to pseudos yet. */
2886 push_to_sequence (all->conversion_insns);
2888 if (!COMPLETE_TYPE_P (type)
2889 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
2891 /* This is a variable sized object. */
2892 copy = allocate_dynamic_stack_space (expr_size (parm), NULL_RTX,
2894 copy = gen_rtx_MEM (BLKmode, copy);
2897 copy = assign_stack_temp (TYPE_MODE (type),
2898 int_size_in_bytes (type), 1);
2899 set_mem_attributes (copy, parm, 1);
2901 store_expr (parm, copy, 0);
2902 emit_move_insn (parmreg, XEXP (copy, 0));
2903 all->conversion_insns = get_insns ();
2906 did_conversion = true;
2910 /* Mark the register as eliminable if we did no conversion and it was
2911 copied from memory at a fixed offset, and the arg pointer was not
2912 copied to a pseudo-reg. If the arg pointer is a pseudo reg or the
2913 offset formed an invalid address, such memory-equivalences as we
2914 make here would screw up life analysis for it. */
2915 if (data->nominal_mode == data->passed_mode
2917 && data->stack_parm != 0
2918 && MEM_P (data->stack_parm)
2919 && data->locate.offset.var == 0
2920 && reg_mentioned_p (virtual_incoming_args_rtx,
2921 XEXP (data->stack_parm, 0)))
2923 rtx linsn = get_last_insn ();
2926 /* Mark complex types separately. */
2927 if (GET_CODE (parmreg) == CONCAT)
2929 enum machine_mode submode
2930 = GET_MODE_INNER (GET_MODE (parmreg));
2931 int regnor = REGNO (gen_realpart (submode, parmreg));
2932 int regnoi = REGNO (gen_imagpart (submode, parmreg));
2933 rtx stackr = gen_realpart (submode, data->stack_parm);
2934 rtx stacki = gen_imagpart (submode, data->stack_parm);
2936 /* Scan backwards for the set of the real and
2938 for (sinsn = linsn; sinsn != 0;
2939 sinsn = prev_nonnote_insn (sinsn))
2941 set = single_set (sinsn);
2945 if (SET_DEST (set) == regno_reg_rtx [regnoi])
2947 = gen_rtx_EXPR_LIST (REG_EQUIV, stacki,
2949 else if (SET_DEST (set) == regno_reg_rtx [regnor])
2951 = gen_rtx_EXPR_LIST (REG_EQUIV, stackr,
2955 else if ((set = single_set (linsn)) != 0
2956 && SET_DEST (set) == parmreg)
2958 = gen_rtx_EXPR_LIST (REG_EQUIV,
2959 data->stack_parm, REG_NOTES (linsn));
2962 /* For pointer data type, suggest pointer register. */
2963 if (POINTER_TYPE_P (TREE_TYPE (parm)))
2964 mark_reg_pointer (parmreg,
2965 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
2968 /* A subroutine of assign_parms. Allocate stack space to hold the current
2969 parameter. Get it there. Perform all ABI specified conversions. */
2972 assign_parm_setup_stack (struct assign_parm_data_all *all, tree parm,
2973 struct assign_parm_data_one *data)
2975 /* Value must be stored in the stack slot STACK_PARM during function
2978 if (data->promoted_mode != data->nominal_mode)
2980 /* Conversion is required. */
2981 rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
2983 emit_move_insn (tempreg, validize_mem (data->entry_parm));
2985 push_to_sequence (all->conversion_insns);
2986 data->entry_parm = convert_to_mode (data->nominal_mode, tempreg,
2987 TYPE_UNSIGNED (TREE_TYPE (parm)));
2989 if (data->stack_parm)
2990 /* ??? This may need a big-endian conversion on sparc64. */
2992 = adjust_address (data->stack_parm, data->nominal_mode, 0);
2994 all->conversion_insns = get_insns ();
2998 if (data->entry_parm != data->stack_parm)
3000 if (data->stack_parm == 0)
3003 = assign_stack_local (GET_MODE (data->entry_parm),
3004 GET_MODE_SIZE (GET_MODE (data->entry_parm)),
3006 set_mem_attributes (data->stack_parm, parm, 1);
3009 if (data->promoted_mode != data->nominal_mode)
3011 push_to_sequence (all->conversion_insns);
3012 emit_move_insn (validize_mem (data->stack_parm),
3013 validize_mem (data->entry_parm));
3014 all->conversion_insns = get_insns ();
3018 emit_move_insn (validize_mem (data->stack_parm),
3019 validize_mem (data->entry_parm));
3022 SET_DECL_RTL (parm, data->stack_parm);
3025 /* A subroutine of assign_parms. If the ABI splits complex arguments, then
3026 undo the frobbing that we did in assign_parms_augmented_arg_list. */
3029 assign_parms_unsplit_complex (tree orig_fnargs, tree fnargs)
3033 for (parm = orig_fnargs; parm; parm = TREE_CHAIN (parm))
3035 if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
3036 && targetm.calls.split_complex_arg (TREE_TYPE (parm)))
3038 rtx tmp, real, imag;
3039 enum machine_mode inner = GET_MODE_INNER (DECL_MODE (parm));
3041 real = DECL_RTL (fnargs);
3042 imag = DECL_RTL (TREE_CHAIN (fnargs));
3043 if (inner != GET_MODE (real))
3045 real = gen_lowpart_SUBREG (inner, real);
3046 imag = gen_lowpart_SUBREG (inner, imag);
3048 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
3049 SET_DECL_RTL (parm, tmp);
3051 real = DECL_INCOMING_RTL (fnargs);
3052 imag = DECL_INCOMING_RTL (TREE_CHAIN (fnargs));
3053 if (inner != GET_MODE (real))
3055 real = gen_lowpart_SUBREG (inner, real);
3056 imag = gen_lowpart_SUBREG (inner, imag);
3058 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
3059 set_decl_incoming_rtl (parm, tmp);
3060 fnargs = TREE_CHAIN (fnargs);
3064 SET_DECL_RTL (parm, DECL_RTL (fnargs));
3065 set_decl_incoming_rtl (parm, DECL_INCOMING_RTL (fnargs));
3067 /* Set MEM_EXPR to the original decl, i.e. to PARM,
3068 instead of the copy of decl, i.e. FNARGS. */
3069 if (DECL_INCOMING_RTL (parm) && MEM_P (DECL_INCOMING_RTL (parm)))
3070 set_mem_expr (DECL_INCOMING_RTL (parm), parm);
3073 fnargs = TREE_CHAIN (fnargs);
3077 /* Assign RTL expressions to the function's parameters. This may involve
3078 copying them into registers and using those registers as the DECL_RTL. */
3081 assign_parms (tree fndecl)
3083 struct assign_parm_data_all all;
3085 rtx internal_arg_pointer;
3086 int varargs_setup = 0;
3088 /* If the reg that the virtual arg pointer will be translated into is
3089 not a fixed reg or is the stack pointer, make a copy of the virtual
3090 arg pointer, and address parms via the copy. The frame pointer is
3091 considered fixed even though it is not marked as such.
3093 The second time through, simply use ap to avoid generating rtx. */
3095 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
3096 || ! (fixed_regs[ARG_POINTER_REGNUM]
3097 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
3098 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
3100 internal_arg_pointer = virtual_incoming_args_rtx;
3101 current_function_internal_arg_pointer = internal_arg_pointer;
3103 assign_parms_initialize_all (&all);
3104 fnargs = assign_parms_augmented_arg_list (&all);
3106 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
3108 struct assign_parm_data_one data;
3110 /* Extract the type of PARM; adjust it according to ABI. */
3111 assign_parm_find_data_types (&all, parm, &data);
3113 /* Early out for errors and void parameters. */
3114 if (data.passed_mode == VOIDmode)
3116 SET_DECL_RTL (parm, const0_rtx);
3117 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
3121 /* Handle stdargs. LAST_NAMED is a slight mis-nomer; it's also true
3122 for the unnamed dummy argument following the last named argument.
3123 See ABI silliness wrt strict_argument_naming and NAMED_ARG. So
3124 we only want to do this when we get to the actual last named
3125 argument, which will be the first time LAST_NAMED gets set. */
3126 if (data.last_named && !varargs_setup)
3128 varargs_setup = true;
3129 assign_parms_setup_varargs (&all, &data, false);
3132 /* Find out where the parameter arrives in this function. */
3133 assign_parm_find_entry_rtl (&all, &data);
3135 /* Find out where stack space for this parameter might be. */
3136 if (assign_parm_is_stack_parm (&all, &data))
3138 assign_parm_find_stack_rtl (parm, &data);
3139 assign_parm_adjust_entry_rtl (&data);
3142 /* Record permanently how this parm was passed. */
3143 set_decl_incoming_rtl (parm, data.entry_parm);
3145 /* Update info on where next arg arrives in registers. */
3146 FUNCTION_ARG_ADVANCE (all.args_so_far, data.promoted_mode,
3147 data.passed_type, data.named_arg);
3149 assign_parm_adjust_stack_rtl (&data);
3151 if (assign_parm_setup_block_p (&data))
3152 assign_parm_setup_block (parm, &data);
3153 else if (data.passed_pointer || use_register_for_decl (parm))
3154 assign_parm_setup_reg (&all, parm, &data);
3156 assign_parm_setup_stack (&all, parm, &data);
3159 if (targetm.calls.split_complex_arg && fnargs != all.orig_fnargs)
3160 assign_parms_unsplit_complex (all.orig_fnargs, fnargs);
3162 /* Output all parameter conversion instructions (possibly including calls)
3163 now that all parameters have been copied out of hard registers. */
3164 emit_insn (all.conversion_insns);
3166 /* If we are receiving a struct value address as the first argument, set up
3167 the RTL for the function result. As this might require code to convert
3168 the transmitted address to Pmode, we do this here to ensure that possible
3169 preliminary conversions of the address have been emitted already. */
3170 if (all.function_result_decl)
3172 tree result = DECL_RESULT (current_function_decl);
3173 rtx addr = DECL_RTL (all.function_result_decl);
3176 addr = convert_memory_address (Pmode, addr);
3177 x = gen_rtx_MEM (DECL_MODE (result), addr);
3178 set_mem_attributes (x, result, 1);
3179 SET_DECL_RTL (result, x);
3182 /* We have aligned all the args, so add space for the pretend args. */
3183 current_function_pretend_args_size = all.pretend_args_size;
3184 all.stack_args_size.constant += all.extra_pretend_bytes;
3185 current_function_args_size = all.stack_args_size.constant;
3187 /* Adjust function incoming argument size for alignment and
3190 #ifdef REG_PARM_STACK_SPACE
3191 current_function_args_size = MAX (current_function_args_size,
3192 REG_PARM_STACK_SPACE (fndecl));
3195 current_function_args_size
3196 = ((current_function_args_size + STACK_BYTES - 1)
3197 / STACK_BYTES) * STACK_BYTES;
3199 #ifdef ARGS_GROW_DOWNWARD
3200 current_function_arg_offset_rtx
3201 = (all.stack_args_size.var == 0 ? GEN_INT (-all.stack_args_size.constant)
3202 : expand_expr (size_diffop (all.stack_args_size.var,
3203 size_int (-all.stack_args_size.constant)),
3204 NULL_RTX, VOIDmode, 0));
3206 current_function_arg_offset_rtx = ARGS_SIZE_RTX (all.stack_args_size);
3209 /* See how many bytes, if any, of its args a function should try to pop
3212 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
3213 current_function_args_size);
3215 /* For stdarg.h function, save info about
3216 regs and stack space used by the named args. */
3218 current_function_args_info = all.args_so_far;
3220 /* Set the rtx used for the function return value. Put this in its
3221 own variable so any optimizers that need this information don't have
3222 to include tree.h. Do this here so it gets done when an inlined
3223 function gets output. */
3225 current_function_return_rtx
3226 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
3227 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
3229 /* If scalar return value was computed in a pseudo-reg, or was a named
3230 return value that got dumped to the stack, copy that to the hard
3232 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
3234 tree decl_result = DECL_RESULT (fndecl);
3235 rtx decl_rtl = DECL_RTL (decl_result);
3237 if (REG_P (decl_rtl)
3238 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
3239 : DECL_REGISTER (decl_result))
3243 #ifdef FUNCTION_OUTGOING_VALUE
3244 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
3247 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
3250 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
3251 /* The delay slot scheduler assumes that current_function_return_rtx
3252 holds the hard register containing the return value, not a
3253 temporary pseudo. */
3254 current_function_return_rtx = real_decl_rtl;
3259 /* Indicate whether REGNO is an incoming argument to the current function
3260 that was promoted to a wider mode. If so, return the RTX for the
3261 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
3262 that REGNO is promoted from and whether the promotion was signed or
3266 promoted_input_arg (unsigned int regno, enum machine_mode *pmode, int *punsignedp)
3270 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
3271 arg = TREE_CHAIN (arg))
3272 if (REG_P (DECL_INCOMING_RTL (arg))
3273 && REGNO (DECL_INCOMING_RTL (arg)) == regno
3274 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
3276 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
3277 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (arg));
3279 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
3280 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
3281 && mode != DECL_MODE (arg))
3283 *pmode = DECL_MODE (arg);
3284 *punsignedp = unsignedp;
3285 return DECL_INCOMING_RTL (arg);
3293 /* Compute the size and offset from the start of the stacked arguments for a
3294 parm passed in mode PASSED_MODE and with type TYPE.
3296 INITIAL_OFFSET_PTR points to the current offset into the stacked
3299 The starting offset and size for this parm are returned in
3300 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
3301 nonzero, the offset is that of stack slot, which is returned in
3302 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
3303 padding required from the initial offset ptr to the stack slot.
3305 IN_REGS is nonzero if the argument will be passed in registers. It will
3306 never be set if REG_PARM_STACK_SPACE is not defined.
3308 FNDECL is the function in which the argument was defined.
3310 There are two types of rounding that are done. The first, controlled by
3311 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
3312 list to be aligned to the specific boundary (in bits). This rounding
3313 affects the initial and starting offsets, but not the argument size.
3315 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
3316 optionally rounds the size of the parm to PARM_BOUNDARY. The
3317 initial offset is not affected by this rounding, while the size always
3318 is and the starting offset may be. */
3320 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
3321 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
3322 callers pass in the total size of args so far as
3323 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
3326 locate_and_pad_parm (enum machine_mode passed_mode, tree type, int in_regs,
3327 int partial, tree fndecl ATTRIBUTE_UNUSED,
3328 struct args_size *initial_offset_ptr,
3329 struct locate_and_pad_arg_data *locate)
3332 enum direction where_pad;
3334 int reg_parm_stack_space = 0;
3335 int part_size_in_regs;
3337 #ifdef REG_PARM_STACK_SPACE
3338 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
3340 /* If we have found a stack parm before we reach the end of the
3341 area reserved for registers, skip that area. */
3344 if (reg_parm_stack_space > 0)
3346 if (initial_offset_ptr->var)
3348 initial_offset_ptr->var
3349 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
3350 ssize_int (reg_parm_stack_space));
3351 initial_offset_ptr->constant = 0;
3353 else if (initial_offset_ptr->constant < reg_parm_stack_space)
3354 initial_offset_ptr->constant = reg_parm_stack_space;
3357 #endif /* REG_PARM_STACK_SPACE */
3359 part_size_in_regs = 0;
3360 if (reg_parm_stack_space == 0)
3361 part_size_in_regs = ((partial * UNITS_PER_WORD)
3362 / (PARM_BOUNDARY / BITS_PER_UNIT)
3363 * (PARM_BOUNDARY / BITS_PER_UNIT));
3366 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
3367 where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
3368 boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
3369 locate->where_pad = where_pad;
3371 #ifdef ARGS_GROW_DOWNWARD
3372 locate->slot_offset.constant = -initial_offset_ptr->constant;
3373 if (initial_offset_ptr->var)
3374 locate->slot_offset.var = size_binop (MINUS_EXPR, ssize_int (0),
3375 initial_offset_ptr->var);
3379 if (where_pad != none
3380 && (!host_integerp (sizetree, 1)
3381 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
3382 s2 = round_up (s2, PARM_BOUNDARY / BITS_PER_UNIT);
3383 SUB_PARM_SIZE (locate->slot_offset, s2);
3386 locate->slot_offset.constant += part_size_in_regs;
3389 #ifdef REG_PARM_STACK_SPACE
3390 || REG_PARM_STACK_SPACE (fndecl) > 0
3393 pad_to_arg_alignment (&locate->slot_offset, boundary,
3394 &locate->alignment_pad);
3396 locate->size.constant = (-initial_offset_ptr->constant
3397 - locate->slot_offset.constant);
3398 if (initial_offset_ptr->var)
3399 locate->size.var = size_binop (MINUS_EXPR,
3400 size_binop (MINUS_EXPR,
3402 initial_offset_ptr->var),
3403 locate->slot_offset.var);
3405 /* Pad_below needs the pre-rounded size to know how much to pad
3407 locate->offset = locate->slot_offset;
3408 if (where_pad == downward)
3409 pad_below (&locate->offset, passed_mode, sizetree);
3411 #else /* !ARGS_GROW_DOWNWARD */
3413 #ifdef REG_PARM_STACK_SPACE
3414 || REG_PARM_STACK_SPACE (fndecl) > 0
3417 pad_to_arg_alignment (initial_offset_ptr, boundary,
3418 &locate->alignment_pad);
3419 locate->slot_offset = *initial_offset_ptr;
3421 #ifdef PUSH_ROUNDING
3422 if (passed_mode != BLKmode)
3423 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
3426 /* Pad_below needs the pre-rounded size to know how much to pad below
3427 so this must be done before rounding up. */
3428 locate->offset = locate->slot_offset;
3429 if (where_pad == downward)
3430 pad_below (&locate->offset, passed_mode, sizetree);
3432 if (where_pad != none
3433 && (!host_integerp (sizetree, 1)
3434 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
3435 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
3437 ADD_PARM_SIZE (locate->size, sizetree);
3439 locate->size.constant -= part_size_in_regs;
3440 #endif /* ARGS_GROW_DOWNWARD */
3443 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
3444 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
3447 pad_to_arg_alignment (struct args_size *offset_ptr, int boundary,
3448 struct args_size *alignment_pad)
3450 tree save_var = NULL_TREE;
3451 HOST_WIDE_INT save_constant = 0;
3452 int boundary_in_bytes = boundary / BITS_PER_UNIT;
3453 HOST_WIDE_INT sp_offset = STACK_POINTER_OFFSET;
3455 #ifdef SPARC_STACK_BOUNDARY_HACK
3456 /* The sparc port has a bug. It sometimes claims a STACK_BOUNDARY
3457 higher than the real alignment of %sp. However, when it does this,
3458 the alignment of %sp+STACK_POINTER_OFFSET will be STACK_BOUNDARY.
3459 This is a temporary hack while the sparc port is fixed. */
3460 if (SPARC_STACK_BOUNDARY_HACK)
3464 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3466 save_var = offset_ptr->var;
3467 save_constant = offset_ptr->constant;
3470 alignment_pad->var = NULL_TREE;
3471 alignment_pad->constant = 0;
3473 if (boundary > BITS_PER_UNIT)
3475 if (offset_ptr->var)
3477 tree sp_offset_tree = ssize_int (sp_offset);
3478 tree offset = size_binop (PLUS_EXPR,
3479 ARGS_SIZE_TREE (*offset_ptr),
3481 #ifdef ARGS_GROW_DOWNWARD
3482 tree rounded = round_down (offset, boundary / BITS_PER_UNIT);
3484 tree rounded = round_up (offset, boundary / BITS_PER_UNIT);
3487 offset_ptr->var = size_binop (MINUS_EXPR, rounded, sp_offset_tree);
3488 /* ARGS_SIZE_TREE includes constant term. */
3489 offset_ptr->constant = 0;
3490 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3491 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
3496 offset_ptr->constant = -sp_offset +
3497 #ifdef ARGS_GROW_DOWNWARD
3498 FLOOR_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
3500 CEIL_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
3502 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3503 alignment_pad->constant = offset_ptr->constant - save_constant;
3509 pad_below (struct args_size *offset_ptr, enum machine_mode passed_mode, tree sizetree)
3511 if (passed_mode != BLKmode)
3513 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
3514 offset_ptr->constant
3515 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
3516 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
3517 - GET_MODE_SIZE (passed_mode));
3521 if (TREE_CODE (sizetree) != INTEGER_CST
3522 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
3524 /* Round the size up to multiple of PARM_BOUNDARY bits. */
3525 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
3527 ADD_PARM_SIZE (*offset_ptr, s2);
3528 SUB_PARM_SIZE (*offset_ptr, sizetree);
3533 /* Walk the tree of blocks describing the binding levels within a function
3534 and warn about variables the might be killed by setjmp or vfork.
3535 This is done after calling flow_analysis and before global_alloc
3536 clobbers the pseudo-regs to hard regs. */
3539 setjmp_vars_warning (tree block)
3543 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
3545 if (TREE_CODE (decl) == VAR_DECL
3546 && DECL_RTL_SET_P (decl)
3547 && REG_P (DECL_RTL (decl))
3548 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
3549 warning ("%Jvariable '%D' might be clobbered by `longjmp' or `vfork'",
3553 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
3554 setjmp_vars_warning (sub);
3557 /* Do the appropriate part of setjmp_vars_warning
3558 but for arguments instead of local variables. */
3561 setjmp_args_warning (void)
3564 for (decl = DECL_ARGUMENTS (current_function_decl);
3565 decl; decl = TREE_CHAIN (decl))
3566 if (DECL_RTL (decl) != 0
3567 && REG_P (DECL_RTL (decl))
3568 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
3569 warning ("%Jargument '%D' might be clobbered by `longjmp' or `vfork'",
3574 /* Convert a stack slot address ADDR for variable VAR
3575 (from a containing function)
3576 into an address valid in this function (using a static chain). */
3579 fix_lexical_addr (rtx addr, tree var)
3582 HOST_WIDE_INT displacement;
3583 tree context = decl_function_context (var);
3584 struct function *fp;
3587 /* If this is the present function, we need not do anything. */
3588 if (context == current_function_decl)
3591 fp = find_function_data (context);
3593 /* Decode given address as base reg plus displacement. */
3595 basereg = addr, displacement = 0;
3596 else if (GET_CODE (addr) == PLUS && GET_CODE (XEXP (addr, 1)) == CONST_INT)
3597 basereg = XEXP (addr, 0), displacement = INTVAL (XEXP (addr, 1));
3604 /* Use same offset, relative to appropriate static chain or argument
3606 return plus_constant (base, displacement);
3609 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
3610 and create duplicate blocks. */
3611 /* ??? Need an option to either create block fragments or to create
3612 abstract origin duplicates of a source block. It really depends
3613 on what optimization has been performed. */
3616 reorder_blocks (void)
3618 tree block = DECL_INITIAL (current_function_decl);
3619 varray_type block_stack;
3621 if (block == NULL_TREE)
3624 VARRAY_TREE_INIT (block_stack, 10, "block_stack");
3626 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
3627 clear_block_marks (block);
3629 /* Prune the old trees away, so that they don't get in the way. */
3630 BLOCK_SUBBLOCKS (block) = NULL_TREE;
3631 BLOCK_CHAIN (block) = NULL_TREE;
3633 /* Recreate the block tree from the note nesting. */
3634 reorder_blocks_1 (get_insns (), block, &block_stack);
3635 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
3637 /* Remove deleted blocks from the block fragment chains. */
3638 reorder_fix_fragments (block);
3641 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
3644 clear_block_marks (tree block)
3648 TREE_ASM_WRITTEN (block) = 0;
3649 clear_block_marks (BLOCK_SUBBLOCKS (block));
3650 block = BLOCK_CHAIN (block);
3655 reorder_blocks_1 (rtx insns, tree current_block, varray_type *p_block_stack)
3659 for (insn = insns; insn; insn = NEXT_INSN (insn))
3663 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
3665 tree block = NOTE_BLOCK (insn);
3667 /* If we have seen this block before, that means it now
3668 spans multiple address regions. Create a new fragment. */
3669 if (TREE_ASM_WRITTEN (block))
3671 tree new_block = copy_node (block);
3674 origin = (BLOCK_FRAGMENT_ORIGIN (block)
3675 ? BLOCK_FRAGMENT_ORIGIN (block)
3677 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
3678 BLOCK_FRAGMENT_CHAIN (new_block)
3679 = BLOCK_FRAGMENT_CHAIN (origin);
3680 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
3682 NOTE_BLOCK (insn) = new_block;
3686 BLOCK_SUBBLOCKS (block) = 0;
3687 TREE_ASM_WRITTEN (block) = 1;
3688 /* When there's only one block for the entire function,
3689 current_block == block and we mustn't do this, it
3690 will cause infinite recursion. */
3691 if (block != current_block)
3693 BLOCK_SUPERCONTEXT (block) = current_block;
3694 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
3695 BLOCK_SUBBLOCKS (current_block) = block;
3696 current_block = block;
3698 VARRAY_PUSH_TREE (*p_block_stack, block);
3700 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
3702 NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack);
3703 VARRAY_POP (*p_block_stack);
3704 BLOCK_SUBBLOCKS (current_block)
3705 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
3706 current_block = BLOCK_SUPERCONTEXT (current_block);
3712 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
3713 appears in the block tree, select one of the fragments to become
3714 the new origin block. */
3717 reorder_fix_fragments (tree block)
3721 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
3722 tree new_origin = NULL_TREE;
3726 if (! TREE_ASM_WRITTEN (dup_origin))
3728 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
3730 /* Find the first of the remaining fragments. There must
3731 be at least one -- the current block. */
3732 while (! TREE_ASM_WRITTEN (new_origin))
3733 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
3734 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
3737 else if (! dup_origin)
3740 /* Re-root the rest of the fragments to the new origin. In the
3741 case that DUP_ORIGIN was null, that means BLOCK was the origin
3742 of a chain of fragments and we want to remove those fragments
3743 that didn't make it to the output. */
3746 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
3751 if (TREE_ASM_WRITTEN (chain))
3753 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
3755 pp = &BLOCK_FRAGMENT_CHAIN (chain);
3757 chain = BLOCK_FRAGMENT_CHAIN (chain);
3762 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
3763 block = BLOCK_CHAIN (block);
3767 /* Reverse the order of elements in the chain T of blocks,
3768 and return the new head of the chain (old last element). */
3771 blocks_nreverse (tree t)
3773 tree prev = 0, decl, next;
3774 for (decl = t; decl; decl = next)
3776 next = BLOCK_CHAIN (decl);
3777 BLOCK_CHAIN (decl) = prev;
3783 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
3784 non-NULL, list them all into VECTOR, in a depth-first preorder
3785 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
3789 all_blocks (tree block, tree *vector)
3795 TREE_ASM_WRITTEN (block) = 0;
3797 /* Record this block. */
3799 vector[n_blocks] = block;
3803 /* Record the subblocks, and their subblocks... */
3804 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
3805 vector ? vector + n_blocks : 0);
3806 block = BLOCK_CHAIN (block);
3812 /* Return a vector containing all the blocks rooted at BLOCK. The
3813 number of elements in the vector is stored in N_BLOCKS_P. The
3814 vector is dynamically allocated; it is the caller's responsibility
3815 to call `free' on the pointer returned. */
3818 get_block_vector (tree block, int *n_blocks_p)
3822 *n_blocks_p = all_blocks (block, NULL);
3823 block_vector = xmalloc (*n_blocks_p * sizeof (tree));
3824 all_blocks (block, block_vector);
3826 return block_vector;
3829 static GTY(()) int next_block_index = 2;
3831 /* Set BLOCK_NUMBER for all the blocks in FN. */
3834 number_blocks (tree fn)
3840 /* For SDB and XCOFF debugging output, we start numbering the blocks
3841 from 1 within each function, rather than keeping a running
3843 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
3844 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
3845 next_block_index = 1;
3848 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
3850 /* The top-level BLOCK isn't numbered at all. */
3851 for (i = 1; i < n_blocks; ++i)
3852 /* We number the blocks from two. */
3853 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
3855 free (block_vector);
3860 /* If VAR is present in a subblock of BLOCK, return the subblock. */
3863 debug_find_var_in_block_tree (tree var, tree block)
3867 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
3871 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
3873 tree ret = debug_find_var_in_block_tree (var, t);
3881 /* Allocate a function structure for FNDECL and set its contents
3885 allocate_struct_function (tree fndecl)
3888 tree fntype = fndecl ? TREE_TYPE (fndecl) : NULL_TREE;
3890 cfun = ggc_alloc_cleared (sizeof (struct function));
3892 cfun->stack_alignment_needed = STACK_BOUNDARY;
3893 cfun->preferred_stack_boundary = STACK_BOUNDARY;
3895 current_function_funcdef_no = funcdef_no++;
3897 cfun->function_frequency = FUNCTION_FREQUENCY_NORMAL;
3899 init_stmt_for_function ();
3900 init_eh_for_function ();
3902 lang_hooks.function.init (cfun);
3903 if (init_machine_status)
3904 cfun->machine = (*init_machine_status) ();
3909 DECL_STRUCT_FUNCTION (fndecl) = cfun;
3910 cfun->decl = fndecl;
3912 result = DECL_RESULT (fndecl);
3913 if (aggregate_value_p (result, fndecl))
3915 #ifdef PCC_STATIC_STRUCT_RETURN
3916 current_function_returns_pcc_struct = 1;
3918 current_function_returns_struct = 1;
3921 current_function_returns_pointer = POINTER_TYPE_P (TREE_TYPE (result));
3923 current_function_stdarg
3925 && TYPE_ARG_TYPES (fntype) != 0
3926 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
3927 != void_type_node));
3930 /* Reset cfun, and other non-struct-function variables to defaults as
3931 appropriate for emitting rtl at the start of a function. */
3934 prepare_function_start (tree fndecl)
3936 if (fndecl && DECL_STRUCT_FUNCTION (fndecl))
3937 cfun = DECL_STRUCT_FUNCTION (fndecl);
3939 allocate_struct_function (fndecl);
3941 init_varasm_status (cfun);
3944 cse_not_expected = ! optimize;
3946 /* Caller save not needed yet. */
3947 caller_save_needed = 0;
3949 /* We haven't done register allocation yet. */
3952 /* Indicate that we need to distinguish between the return value of the
3953 present function and the return value of a function being called. */
3954 rtx_equal_function_value_matters = 1;
3956 /* Indicate that we have not instantiated virtual registers yet. */
3957 virtuals_instantiated = 0;
3959 /* Indicate that we want CONCATs now. */
3960 generating_concat_p = 1;
3962 /* Indicate we have no need of a frame pointer yet. */
3963 frame_pointer_needed = 0;
3966 /* Initialize the rtl expansion mechanism so that we can do simple things
3967 like generate sequences. This is used to provide a context during global
3968 initialization of some passes. */
3970 init_dummy_function_start (void)
3972 prepare_function_start (NULL);
3975 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
3976 and initialize static variables for generating RTL for the statements
3980 init_function_start (tree subr)
3982 prepare_function_start (subr);
3984 /* Prevent ever trying to delete the first instruction of a
3985 function. Also tell final how to output a linenum before the
3986 function prologue. Note linenums could be missing, e.g. when
3987 compiling a Java .class file. */
3988 if (! DECL_IS_BUILTIN (subr))
3989 emit_line_note (DECL_SOURCE_LOCATION (subr));
3991 /* Make sure first insn is a note even if we don't want linenums.
3992 This makes sure the first insn will never be deleted.
3993 Also, final expects a note to appear there. */
3994 emit_note (NOTE_INSN_DELETED);
3996 /* Warn if this value is an aggregate type,
3997 regardless of which calling convention we are using for it. */
3998 if (warn_aggregate_return
3999 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
4000 warning ("function returns an aggregate");
4003 /* Make sure all values used by the optimization passes have sane
4006 init_function_for_compilation (void)
4010 /* No prologue/epilogue insns yet. */
4011 VARRAY_GROW (prologue, 0);
4012 VARRAY_GROW (epilogue, 0);
4013 VARRAY_GROW (sibcall_epilogue, 0);
4016 /* Expand a call to __main at the beginning of a possible main function. */
4018 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
4019 #undef HAS_INIT_SECTION
4020 #define HAS_INIT_SECTION
4024 expand_main_function (void)
4026 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
4027 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
4029 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
4033 /* Forcibly align the stack. */
4034 #ifdef STACK_GROWS_DOWNWARD
4035 tmp = expand_simple_binop (Pmode, AND, stack_pointer_rtx, GEN_INT(-align),
4036 stack_pointer_rtx, 1, OPTAB_WIDEN);
4038 tmp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
4039 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
4040 tmp = expand_simple_binop (Pmode, AND, tmp, GEN_INT (-align),
4041 stack_pointer_rtx, 1, OPTAB_WIDEN);
4043 if (tmp != stack_pointer_rtx)
4044 emit_move_insn (stack_pointer_rtx, tmp);
4046 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
4047 tmp = force_reg (Pmode, const0_rtx);
4048 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
4052 for (tmp = get_last_insn (); tmp; tmp = PREV_INSN (tmp))
4053 if (NOTE_P (tmp) && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_FUNCTION_BEG)
4056 emit_insn_before (seq, tmp);
4062 #ifndef HAS_INIT_SECTION
4063 emit_library_call (init_one_libfunc (NAME__MAIN), LCT_NORMAL, VOIDmode, 0);
4067 /* The PENDING_SIZES represent the sizes of variable-sized types.
4068 Create RTL for the various sizes now (using temporary variables),
4069 so that we can refer to the sizes from the RTL we are generating
4070 for the current function. The PENDING_SIZES are a TREE_LIST. The
4071 TREE_VALUE of each node is a SAVE_EXPR. */
4074 expand_pending_sizes (tree pending_sizes)
4078 /* Evaluate now the sizes of any types declared among the arguments. */
4079 for (tem = pending_sizes; tem; tem = TREE_CHAIN (tem))
4080 expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode, 0);
4083 /* Start the RTL for a new function, and set variables used for
4085 SUBR is the FUNCTION_DECL node.
4086 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
4087 the function's parameters, which must be run at any return statement. */
4090 expand_function_start (tree subr)
4092 /* Make sure volatile mem refs aren't considered
4093 valid operands of arithmetic insns. */
4094 init_recog_no_volatile ();
4096 current_function_profile
4098 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
4100 current_function_limit_stack
4101 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
4103 /* Make the label for return statements to jump to. Do not special
4104 case machines with special return instructions -- they will be
4105 handled later during jump, ifcvt, or epilogue creation. */
4106 return_label = gen_label_rtx ();
4108 /* Initialize rtx used to return the value. */
4109 /* Do this before assign_parms so that we copy the struct value address
4110 before any library calls that assign parms might generate. */
4112 /* Decide whether to return the value in memory or in a register. */
4113 if (aggregate_value_p (DECL_RESULT (subr), subr))
4115 /* Returning something that won't go in a register. */
4116 rtx value_address = 0;
4118 #ifdef PCC_STATIC_STRUCT_RETURN
4119 if (current_function_returns_pcc_struct)
4121 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
4122 value_address = assemble_static_space (size);
4127 rtx sv = targetm.calls.struct_value_rtx (TREE_TYPE (subr), 1);
4128 /* Expect to be passed the address of a place to store the value.
4129 If it is passed as an argument, assign_parms will take care of
4133 value_address = gen_reg_rtx (Pmode);
4134 emit_move_insn (value_address, sv);
4139 rtx x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), value_address);
4140 set_mem_attributes (x, DECL_RESULT (subr), 1);
4141 SET_DECL_RTL (DECL_RESULT (subr), x);
4144 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
4145 /* If return mode is void, this decl rtl should not be used. */
4146 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
4149 /* Compute the return values into a pseudo reg, which we will copy
4150 into the true return register after the cleanups are done. */
4152 /* In order to figure out what mode to use for the pseudo, we
4153 figure out what the mode of the eventual return register will
4154 actually be, and use that. */
4156 = hard_function_value (TREE_TYPE (DECL_RESULT (subr)),
4159 /* Structures that are returned in registers are not aggregate_value_p,
4160 so we may see a PARALLEL or a REG. */
4161 if (REG_P (hard_reg))
4162 SET_DECL_RTL (DECL_RESULT (subr), gen_reg_rtx (GET_MODE (hard_reg)));
4163 else if (GET_CODE (hard_reg) == PARALLEL)
4164 SET_DECL_RTL (DECL_RESULT (subr), gen_group_rtx (hard_reg));
4168 /* Set DECL_REGISTER flag so that expand_function_end will copy the
4169 result to the real return register(s). */
4170 DECL_REGISTER (DECL_RESULT (subr)) = 1;
4173 /* Initialize rtx for parameters and local variables.
4174 In some cases this requires emitting insns. */
4175 assign_parms (subr);
4177 /* If function gets a static chain arg, store it. */
4178 if (cfun->static_chain_decl)
4180 tree parm = cfun->static_chain_decl;
4181 rtx local = gen_reg_rtx (Pmode);
4183 set_decl_incoming_rtl (parm, static_chain_incoming_rtx);
4184 SET_DECL_RTL (parm, local);
4185 maybe_set_unchanging (local, parm);
4186 mark_reg_pointer (local, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
4188 emit_move_insn (local, static_chain_incoming_rtx);
4191 /* If the function receives a non-local goto, then store the
4192 bits we need to restore the frame pointer. */
4193 if (cfun->nonlocal_goto_save_area)
4198 /* ??? We need to do this save early. Unfortunately here is
4199 before the frame variable gets declared. Help out... */
4200 expand_var (TREE_OPERAND (cfun->nonlocal_goto_save_area, 0));
4202 t_save = build (ARRAY_REF, ptr_type_node, cfun->nonlocal_goto_save_area,
4203 integer_zero_node, NULL_TREE, NULL_TREE);
4204 r_save = expand_expr (t_save, NULL_RTX, VOIDmode, EXPAND_WRITE);
4205 r_save = convert_memory_address (Pmode, r_save);
4207 emit_move_insn (r_save, virtual_stack_vars_rtx);
4208 update_nonlocal_goto_save_area ();
4211 /* The following was moved from init_function_start.
4212 The move is supposed to make sdb output more accurate. */
4213 /* Indicate the beginning of the function body,
4214 as opposed to parm setup. */
4215 emit_note (NOTE_INSN_FUNCTION_BEG);
4217 if (!NOTE_P (get_last_insn ()))
4218 emit_note (NOTE_INSN_DELETED);
4219 parm_birth_insn = get_last_insn ();
4221 if (current_function_profile)
4224 PROFILE_HOOK (current_function_funcdef_no);
4228 /* After the display initializations is where the tail-recursion label
4229 should go, if we end up needing one. Ensure we have a NOTE here
4230 since some things (like trampolines) get placed before this. */
4231 tail_recursion_reentry = emit_note (NOTE_INSN_DELETED);
4233 /* Evaluate now the sizes of any types declared among the arguments. */
4234 expand_pending_sizes (nreverse (get_pending_sizes ()));
4236 /* Make sure there is a line number after the function entry setup code. */
4237 force_next_line_note ();
4240 /* Undo the effects of init_dummy_function_start. */
4242 expand_dummy_function_end (void)
4244 /* End any sequences that failed to be closed due to syntax errors. */
4245 while (in_sequence_p ())
4248 /* Outside function body, can't compute type's actual size
4249 until next function's body starts. */
4251 free_after_parsing (cfun);
4252 free_after_compilation (cfun);
4256 /* Call DOIT for each hard register used as a return value from
4257 the current function. */
4260 diddle_return_value (void (*doit) (rtx, void *), void *arg)
4262 rtx outgoing = current_function_return_rtx;
4267 if (REG_P (outgoing))
4268 (*doit) (outgoing, arg);
4269 else if (GET_CODE (outgoing) == PARALLEL)
4273 for (i = 0; i < XVECLEN (outgoing, 0); i++)
4275 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
4277 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
4284 do_clobber_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
4286 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
4290 clobber_return_register (void)
4292 diddle_return_value (do_clobber_return_reg, NULL);
4294 /* In case we do use pseudo to return value, clobber it too. */
4295 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
4297 tree decl_result = DECL_RESULT (current_function_decl);
4298 rtx decl_rtl = DECL_RTL (decl_result);
4299 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
4301 do_clobber_return_reg (decl_rtl, NULL);
4307 do_use_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
4309 emit_insn (gen_rtx_USE (VOIDmode, reg));
4313 use_return_register (void)
4315 diddle_return_value (do_use_return_reg, NULL);
4318 /* Possibly warn about unused parameters. */
4320 do_warn_unused_parameter (tree fn)
4324 for (decl = DECL_ARGUMENTS (fn);
4325 decl; decl = TREE_CHAIN (decl))
4326 if (!TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
4327 && DECL_NAME (decl) && !DECL_ARTIFICIAL (decl))
4328 warning ("%Junused parameter '%D'", decl, decl);
4331 static GTY(()) rtx initial_trampoline;
4333 /* Generate RTL for the end of the current function. */
4336 expand_function_end (void)
4340 /* If arg_pointer_save_area was referenced only from a nested
4341 function, we will not have initialized it yet. Do that now. */
4342 if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
4343 get_arg_pointer_save_area (cfun);
4345 /* If we are doing stack checking and this function makes calls,
4346 do a stack probe at the start of the function to ensure we have enough
4347 space for another stack frame. */
4348 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
4352 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4356 probe_stack_range (STACK_CHECK_PROTECT,
4357 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
4360 emit_insn_before (seq, tail_recursion_reentry);
4365 /* Possibly warn about unused parameters.
4366 When frontend does unit-at-a-time, the warning is already
4367 issued at finalization time. */
4368 if (warn_unused_parameter
4369 && !lang_hooks.callgraph.expand_function)
4370 do_warn_unused_parameter (current_function_decl);
4372 /* End any sequences that failed to be closed due to syntax errors. */
4373 while (in_sequence_p ())
4376 clear_pending_stack_adjust ();
4377 do_pending_stack_adjust ();
4379 /* @@@ This is a kludge. We want to ensure that instructions that
4380 may trap are not moved into the epilogue by scheduling, because
4381 we don't always emit unwind information for the epilogue.
4382 However, not all machine descriptions define a blockage insn, so
4383 emit an ASM_INPUT to act as one. */
4384 if (flag_non_call_exceptions)
4385 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, ""));
4387 /* Mark the end of the function body.
4388 If control reaches this insn, the function can drop through
4389 without returning a value. */
4390 emit_note (NOTE_INSN_FUNCTION_END);
4392 /* Must mark the last line number note in the function, so that the test
4393 coverage code can avoid counting the last line twice. This just tells
4394 the code to ignore the immediately following line note, since there
4395 already exists a copy of this note somewhere above. This line number
4396 note is still needed for debugging though, so we can't delete it. */
4397 if (flag_test_coverage)
4398 emit_note (NOTE_INSN_REPEATED_LINE_NUMBER);
4400 /* Output a linenumber for the end of the function.
4401 SDB depends on this. */
4402 force_next_line_note ();
4403 emit_line_note (input_location);
4405 /* Before the return label (if any), clobber the return
4406 registers so that they are not propagated live to the rest of
4407 the function. This can only happen with functions that drop
4408 through; if there had been a return statement, there would
4409 have either been a return rtx, or a jump to the return label.
4411 We delay actual code generation after the current_function_value_rtx
4413 clobber_after = get_last_insn ();
4415 /* Output the label for the actual return from the function,
4416 if one is expected. This happens either because a function epilogue
4417 is used instead of a return instruction, or because a return was done
4418 with a goto in order to run local cleanups, or because of pcc-style
4419 structure returning. */
4421 emit_label (return_label);
4423 /* Let except.c know where it should emit the call to unregister
4424 the function context for sjlj exceptions. */
4425 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
4426 sjlj_emit_function_exit_after (get_last_insn ());
4428 /* If we had calls to alloca, and this machine needs
4429 an accurate stack pointer to exit the function,
4430 insert some code to save and restore the stack pointer. */
4431 if (! EXIT_IGNORE_STACK
4432 && current_function_calls_alloca)
4436 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
4437 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
4440 /* If scalar return value was computed in a pseudo-reg, or was a named
4441 return value that got dumped to the stack, copy that to the hard
4443 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
4445 tree decl_result = DECL_RESULT (current_function_decl);
4446 rtx decl_rtl = DECL_RTL (decl_result);
4448 if (REG_P (decl_rtl)
4449 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
4450 : DECL_REGISTER (decl_result))
4452 rtx real_decl_rtl = current_function_return_rtx;
4454 /* This should be set in assign_parms. */
4455 if (! REG_FUNCTION_VALUE_P (real_decl_rtl))
4458 /* If this is a BLKmode structure being returned in registers,
4459 then use the mode computed in expand_return. Note that if
4460 decl_rtl is memory, then its mode may have been changed,
4461 but that current_function_return_rtx has not. */
4462 if (GET_MODE (real_decl_rtl) == BLKmode)
4463 PUT_MODE (real_decl_rtl, GET_MODE (decl_rtl));
4465 /* If a named return value dumped decl_return to memory, then
4466 we may need to re-do the PROMOTE_MODE signed/unsigned
4468 if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
4470 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (decl_result));
4472 if (targetm.calls.promote_function_return (TREE_TYPE (current_function_decl)))
4473 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
4476 convert_move (real_decl_rtl, decl_rtl, unsignedp);
4478 else if (GET_CODE (real_decl_rtl) == PARALLEL)
4480 /* If expand_function_start has created a PARALLEL for decl_rtl,
4481 move the result to the real return registers. Otherwise, do
4482 a group load from decl_rtl for a named return. */
4483 if (GET_CODE (decl_rtl) == PARALLEL)
4484 emit_group_move (real_decl_rtl, decl_rtl);
4486 emit_group_load (real_decl_rtl, decl_rtl,
4487 TREE_TYPE (decl_result),
4488 int_size_in_bytes (TREE_TYPE (decl_result)));
4491 emit_move_insn (real_decl_rtl, decl_rtl);
4495 /* If returning a structure, arrange to return the address of the value
4496 in a place where debuggers expect to find it.
4498 If returning a structure PCC style,
4499 the caller also depends on this value.
4500 And current_function_returns_pcc_struct is not necessarily set. */
4501 if (current_function_returns_struct
4502 || current_function_returns_pcc_struct)
4505 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
4506 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
4507 #ifdef FUNCTION_OUTGOING_VALUE
4509 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
4510 current_function_decl);
4513 = FUNCTION_VALUE (build_pointer_type (type), current_function_decl);
4516 /* Mark this as a function return value so integrate will delete the
4517 assignment and USE below when inlining this function. */
4518 REG_FUNCTION_VALUE_P (outgoing) = 1;
4520 /* The address may be ptr_mode and OUTGOING may be Pmode. */
4521 value_address = convert_memory_address (GET_MODE (outgoing),
4524 emit_move_insn (outgoing, value_address);
4526 /* Show return register used to hold result (in this case the address
4528 current_function_return_rtx = outgoing;
4531 /* If this is an implementation of throw, do what's necessary to
4532 communicate between __builtin_eh_return and the epilogue. */
4533 expand_eh_return ();
4535 /* Emit the actual code to clobber return register. */
4540 clobber_return_register ();
4544 after = emit_insn_after (seq, clobber_after);
4547 /* Output the label for the naked return from the function, if one is
4548 expected. This is currently used only by __builtin_return. */
4549 if (naked_return_label)
4550 emit_label (naked_return_label);
4552 /* ??? This should no longer be necessary since stupid is no longer with
4553 us, but there are some parts of the compiler (eg reload_combine, and
4554 sh mach_dep_reorg) that still try and compute their own lifetime info
4555 instead of using the general framework. */
4556 use_return_register ();
4560 get_arg_pointer_save_area (struct function *f)
4562 rtx ret = f->x_arg_pointer_save_area;
4566 ret = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, f);
4567 f->x_arg_pointer_save_area = ret;
4570 if (f == cfun && ! f->arg_pointer_save_area_init)
4574 /* Save the arg pointer at the beginning of the function. The
4575 generated stack slot may not be a valid memory address, so we
4576 have to check it and fix it if necessary. */
4578 emit_move_insn (validize_mem (ret), virtual_incoming_args_rtx);
4582 push_topmost_sequence ();
4583 emit_insn_after (seq, get_insns ());
4584 pop_topmost_sequence ();
4590 /* Extend a vector that records the INSN_UIDs of INSNS
4591 (a list of one or more insns). */
4594 record_insns (rtx insns, varray_type *vecp)
4601 while (tmp != NULL_RTX)
4604 tmp = NEXT_INSN (tmp);
4607 i = VARRAY_SIZE (*vecp);
4608 VARRAY_GROW (*vecp, i + len);
4610 while (tmp != NULL_RTX)
4612 VARRAY_INT (*vecp, i) = INSN_UID (tmp);
4614 tmp = NEXT_INSN (tmp);
4618 /* Set the locator of the insn chain starting at INSN to LOC. */
4620 set_insn_locators (rtx insn, int loc)
4622 while (insn != NULL_RTX)
4625 INSN_LOCATOR (insn) = loc;
4626 insn = NEXT_INSN (insn);
4630 /* Determine how many INSN_UIDs in VEC are part of INSN. Because we can
4631 be running after reorg, SEQUENCE rtl is possible. */
4634 contains (rtx insn, varray_type vec)
4638 if (NONJUMP_INSN_P (insn)
4639 && GET_CODE (PATTERN (insn)) == SEQUENCE)
4642 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
4643 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
4644 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j))
4650 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
4651 if (INSN_UID (insn) == VARRAY_INT (vec, j))
4658 prologue_epilogue_contains (rtx insn)
4660 if (contains (insn, prologue))
4662 if (contains (insn, epilogue))
4668 sibcall_epilogue_contains (rtx insn)
4670 if (sibcall_epilogue)
4671 return contains (insn, sibcall_epilogue);
4676 /* Insert gen_return at the end of block BB. This also means updating
4677 block_for_insn appropriately. */
4680 emit_return_into_block (basic_block bb, rtx line_note)
4682 emit_jump_insn_after (gen_return (), BB_END (bb));
4684 emit_note_copy_after (line_note, PREV_INSN (BB_END (bb)));
4686 #endif /* HAVE_return */
4688 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
4690 /* These functions convert the epilogue into a variant that does not modify the
4691 stack pointer. This is used in cases where a function returns an object
4692 whose size is not known until it is computed. The called function leaves the
4693 object on the stack, leaves the stack depressed, and returns a pointer to
4696 What we need to do is track all modifications and references to the stack
4697 pointer, deleting the modifications and changing the references to point to
4698 the location the stack pointer would have pointed to had the modifications
4701 These functions need to be portable so we need to make as few assumptions
4702 about the epilogue as we can. However, the epilogue basically contains
4703 three things: instructions to reset the stack pointer, instructions to
4704 reload registers, possibly including the frame pointer, and an
4705 instruction to return to the caller.
4707 If we can't be sure of what a relevant epilogue insn is doing, we abort.
4708 We also make no attempt to validate the insns we make since if they are
4709 invalid, we probably can't do anything valid. The intent is that these
4710 routines get "smarter" as more and more machines start to use them and
4711 they try operating on different epilogues.
4713 We use the following structure to track what the part of the epilogue that
4714 we've already processed has done. We keep two copies of the SP equivalence,
4715 one for use during the insn we are processing and one for use in the next
4716 insn. The difference is because one part of a PARALLEL may adjust SP
4717 and the other may use it. */
4721 rtx sp_equiv_reg; /* REG that SP is set from, perhaps SP. */
4722 HOST_WIDE_INT sp_offset; /* Offset from SP_EQUIV_REG of present SP. */
4723 rtx new_sp_equiv_reg; /* REG to be used at end of insn. */
4724 HOST_WIDE_INT new_sp_offset; /* Offset to be used at end of insn. */
4725 rtx equiv_reg_src; /* If nonzero, the value that SP_EQUIV_REG
4726 should be set to once we no longer need
4728 rtx const_equiv[FIRST_PSEUDO_REGISTER]; /* Any known constant equivalences
4732 static void handle_epilogue_set (rtx, struct epi_info *);
4733 static void update_epilogue_consts (rtx, rtx, void *);
4734 static void emit_equiv_load (struct epi_info *);
4736 /* Modify INSN, a list of one or more insns that is part of the epilogue, to
4737 no modifications to the stack pointer. Return the new list of insns. */
4740 keep_stack_depressed (rtx insns)
4743 struct epi_info info;
4746 /* If the epilogue is just a single instruction, it must be OK as is. */
4747 if (NEXT_INSN (insns) == NULL_RTX)
4750 /* Otherwise, start a sequence, initialize the information we have, and
4751 process all the insns we were given. */
4754 info.sp_equiv_reg = stack_pointer_rtx;
4756 info.equiv_reg_src = 0;
4758 for (j = 0; j < FIRST_PSEUDO_REGISTER; j++)
4759 info.const_equiv[j] = 0;
4763 while (insn != NULL_RTX)
4765 next = NEXT_INSN (insn);
4774 /* If this insn references the register that SP is equivalent to and
4775 we have a pending load to that register, we must force out the load
4776 first and then indicate we no longer know what SP's equivalent is. */
4777 if (info.equiv_reg_src != 0
4778 && reg_referenced_p (info.sp_equiv_reg, PATTERN (insn)))
4780 emit_equiv_load (&info);
4781 info.sp_equiv_reg = 0;
4784 info.new_sp_equiv_reg = info.sp_equiv_reg;
4785 info.new_sp_offset = info.sp_offset;
4787 /* If this is a (RETURN) and the return address is on the stack,
4788 update the address and change to an indirect jump. */
4789 if (GET_CODE (PATTERN (insn)) == RETURN
4790 || (GET_CODE (PATTERN (insn)) == PARALLEL
4791 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
4793 rtx retaddr = INCOMING_RETURN_ADDR_RTX;
4795 HOST_WIDE_INT offset = 0;
4796 rtx jump_insn, jump_set;
4798 /* If the return address is in a register, we can emit the insn
4799 unchanged. Otherwise, it must be a MEM and we see what the
4800 base register and offset are. In any case, we have to emit any
4801 pending load to the equivalent reg of SP, if any. */
4802 if (REG_P (retaddr))
4804 emit_equiv_load (&info);
4809 else if (MEM_P (retaddr)
4810 && REG_P (XEXP (retaddr, 0)))
4811 base = gen_rtx_REG (Pmode, REGNO (XEXP (retaddr, 0))), offset = 0;
4812 else if (MEM_P (retaddr)
4813 && GET_CODE (XEXP (retaddr, 0)) == PLUS
4814 && REG_P (XEXP (XEXP (retaddr, 0), 0))
4815 && GET_CODE (XEXP (XEXP (retaddr, 0), 1)) == CONST_INT)
4817 base = gen_rtx_REG (Pmode, REGNO (XEXP (XEXP (retaddr, 0), 0)));
4818 offset = INTVAL (XEXP (XEXP (retaddr, 0), 1));
4823 /* If the base of the location containing the return pointer
4824 is SP, we must update it with the replacement address. Otherwise,
4825 just build the necessary MEM. */
4826 retaddr = plus_constant (base, offset);
4827 if (base == stack_pointer_rtx)
4828 retaddr = simplify_replace_rtx (retaddr, stack_pointer_rtx,
4829 plus_constant (info.sp_equiv_reg,
4832 retaddr = gen_rtx_MEM (Pmode, retaddr);
4834 /* If there is a pending load to the equivalent register for SP
4835 and we reference that register, we must load our address into
4836 a scratch register and then do that load. */
4837 if (info.equiv_reg_src
4838 && reg_overlap_mentioned_p (info.equiv_reg_src, retaddr))
4843 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
4844 if (HARD_REGNO_MODE_OK (regno, Pmode)
4845 && !fixed_regs[regno]
4846 && TEST_HARD_REG_BIT (regs_invalidated_by_call, regno)
4847 && !REGNO_REG_SET_P (EXIT_BLOCK_PTR->global_live_at_start,
4849 && !refers_to_regno_p (regno,
4850 regno + hard_regno_nregs[regno]
4852 info.equiv_reg_src, NULL)
4853 && info.const_equiv[regno] == 0)
4856 if (regno == FIRST_PSEUDO_REGISTER)
4859 reg = gen_rtx_REG (Pmode, regno);
4860 emit_move_insn (reg, retaddr);
4864 emit_equiv_load (&info);
4865 jump_insn = emit_jump_insn (gen_indirect_jump (retaddr));
4867 /* Show the SET in the above insn is a RETURN. */
4868 jump_set = single_set (jump_insn);
4872 SET_IS_RETURN_P (jump_set) = 1;
4875 /* If SP is not mentioned in the pattern and its equivalent register, if
4876 any, is not modified, just emit it. Otherwise, if neither is set,
4877 replace the reference to SP and emit the insn. If none of those are
4878 true, handle each SET individually. */
4879 else if (!reg_mentioned_p (stack_pointer_rtx, PATTERN (insn))
4880 && (info.sp_equiv_reg == stack_pointer_rtx
4881 || !reg_set_p (info.sp_equiv_reg, insn)))
4883 else if (! reg_set_p (stack_pointer_rtx, insn)
4884 && (info.sp_equiv_reg == stack_pointer_rtx
4885 || !reg_set_p (info.sp_equiv_reg, insn)))
4887 if (! validate_replace_rtx (stack_pointer_rtx,
4888 plus_constant (info.sp_equiv_reg,
4895 else if (GET_CODE (PATTERN (insn)) == SET)
4896 handle_epilogue_set (PATTERN (insn), &info);
4897 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
4899 for (j = 0; j < XVECLEN (PATTERN (insn), 0); j++)
4900 if (GET_CODE (XVECEXP (PATTERN (insn), 0, j)) == SET)
4901 handle_epilogue_set (XVECEXP (PATTERN (insn), 0, j), &info);
4906 info.sp_equiv_reg = info.new_sp_equiv_reg;
4907 info.sp_offset = info.new_sp_offset;
4909 /* Now update any constants this insn sets. */
4910 note_stores (PATTERN (insn), update_epilogue_consts, &info);
4914 insns = get_insns ();
4919 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
4920 structure that contains information about what we've seen so far. We
4921 process this SET by either updating that data or by emitting one or
4925 handle_epilogue_set (rtx set, struct epi_info *p)
4927 /* First handle the case where we are setting SP. Record what it is being
4928 set from. If unknown, abort. */
4929 if (reg_set_p (stack_pointer_rtx, set))
4931 if (SET_DEST (set) != stack_pointer_rtx)
4934 if (GET_CODE (SET_SRC (set)) == PLUS)
4936 p->new_sp_equiv_reg = XEXP (SET_SRC (set), 0);
4937 if (GET_CODE (XEXP (SET_SRC (set), 1)) == CONST_INT)
4938 p->new_sp_offset = INTVAL (XEXP (SET_SRC (set), 1));
4939 else if (REG_P (XEXP (SET_SRC (set), 1))
4940 && REGNO (XEXP (SET_SRC (set), 1)) < FIRST_PSEUDO_REGISTER
4941 && p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))] != 0)
4943 = INTVAL (p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
4948 p->new_sp_equiv_reg = SET_SRC (set), p->new_sp_offset = 0;
4950 /* If we are adjusting SP, we adjust from the old data. */
4951 if (p->new_sp_equiv_reg == stack_pointer_rtx)
4953 p->new_sp_equiv_reg = p->sp_equiv_reg;
4954 p->new_sp_offset += p->sp_offset;
4957 if (p->new_sp_equiv_reg == 0 || !REG_P (p->new_sp_equiv_reg))
4963 /* Next handle the case where we are setting SP's equivalent register.
4964 If we already have a value to set it to, abort. We could update, but
4965 there seems little point in handling that case. Note that we have
4966 to allow for the case where we are setting the register set in
4967 the previous part of a PARALLEL inside a single insn. But use the
4968 old offset for any updates within this insn. We must allow for the case
4969 where the register is being set in a different (usually wider) mode than
4971 else if (p->new_sp_equiv_reg != 0 && reg_set_p (p->new_sp_equiv_reg, set))
4973 if (p->equiv_reg_src != 0
4974 || !REG_P (p->new_sp_equiv_reg)
4975 || !REG_P (SET_DEST (set))
4976 || GET_MODE_BITSIZE (GET_MODE (SET_DEST (set))) > BITS_PER_WORD
4977 || REGNO (p->new_sp_equiv_reg) != REGNO (SET_DEST (set)))
4981 = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
4982 plus_constant (p->sp_equiv_reg,
4986 /* Otherwise, replace any references to SP in the insn to its new value
4987 and emit the insn. */
4990 SET_SRC (set) = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
4991 plus_constant (p->sp_equiv_reg,
4993 SET_DEST (set) = simplify_replace_rtx (SET_DEST (set), stack_pointer_rtx,
4994 plus_constant (p->sp_equiv_reg,
5000 /* Update the tracking information for registers set to constants. */
5003 update_epilogue_consts (rtx dest, rtx x, void *data)
5005 struct epi_info *p = (struct epi_info *) data;
5008 if (!REG_P (dest) || REGNO (dest) >= FIRST_PSEUDO_REGISTER)
5011 /* If we are either clobbering a register or doing a partial set,
5012 show we don't know the value. */
5013 else if (GET_CODE (x) == CLOBBER || ! rtx_equal_p (dest, SET_DEST (x)))
5014 p->const_equiv[REGNO (dest)] = 0;
5016 /* If we are setting it to a constant, record that constant. */
5017 else if (GET_CODE (SET_SRC (x)) == CONST_INT)
5018 p->const_equiv[REGNO (dest)] = SET_SRC (x);
5020 /* If this is a binary operation between a register we have been tracking
5021 and a constant, see if we can compute a new constant value. */
5022 else if (ARITHMETIC_P (SET_SRC (x))
5023 && REG_P (XEXP (SET_SRC (x), 0))
5024 && REGNO (XEXP (SET_SRC (x), 0)) < FIRST_PSEUDO_REGISTER
5025 && p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))] != 0
5026 && GET_CODE (XEXP (SET_SRC (x), 1)) == CONST_INT
5027 && 0 != (new = simplify_binary_operation
5028 (GET_CODE (SET_SRC (x)), GET_MODE (dest),
5029 p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))],
5030 XEXP (SET_SRC (x), 1)))
5031 && GET_CODE (new) == CONST_INT)
5032 p->const_equiv[REGNO (dest)] = new;
5034 /* Otherwise, we can't do anything with this value. */
5036 p->const_equiv[REGNO (dest)] = 0;
5039 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
5042 emit_equiv_load (struct epi_info *p)
5044 if (p->equiv_reg_src != 0)
5046 rtx dest = p->sp_equiv_reg;
5048 if (GET_MODE (p->equiv_reg_src) != GET_MODE (dest))
5049 dest = gen_rtx_REG (GET_MODE (p->equiv_reg_src),
5050 REGNO (p->sp_equiv_reg));
5052 emit_move_insn (dest, p->equiv_reg_src);
5053 p->equiv_reg_src = 0;
5058 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
5059 this into place with notes indicating where the prologue ends and where
5060 the epilogue begins. Update the basic block information when possible. */
5063 thread_prologue_and_epilogue_insns (rtx f ATTRIBUTE_UNUSED)
5067 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
5070 #ifdef HAVE_prologue
5071 rtx prologue_end = NULL_RTX;
5073 #if defined (HAVE_epilogue) || defined(HAVE_return)
5074 rtx epilogue_end = NULL_RTX;
5077 #ifdef HAVE_prologue
5081 seq = gen_prologue ();
5084 /* Retain a map of the prologue insns. */
5085 record_insns (seq, &prologue);
5086 prologue_end = emit_note (NOTE_INSN_PROLOGUE_END);
5090 set_insn_locators (seq, prologue_locator);
5092 /* Can't deal with multiple successors of the entry block
5093 at the moment. Function should always have at least one
5095 if (!ENTRY_BLOCK_PTR->succ || ENTRY_BLOCK_PTR->succ->succ_next)
5098 insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ);
5103 /* If the exit block has no non-fake predecessors, we don't need
5105 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5106 if ((e->flags & EDGE_FAKE) == 0)
5112 if (optimize && HAVE_return)
5114 /* If we're allowed to generate a simple return instruction,
5115 then by definition we don't need a full epilogue. Examine
5116 the block that falls through to EXIT. If it does not
5117 contain any code, examine its predecessors and try to
5118 emit (conditional) return instructions. */
5124 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5125 if (e->flags & EDGE_FALLTHRU)
5131 /* Verify that there are no active instructions in the last block. */
5132 label = BB_END (last);
5133 while (label && !LABEL_P (label))
5135 if (active_insn_p (label))
5137 label = PREV_INSN (label);
5140 if (BB_HEAD (last) == label && LABEL_P (label))
5142 rtx epilogue_line_note = NULL_RTX;
5144 /* Locate the line number associated with the closing brace,
5145 if we can find one. */
5146 for (seq = get_last_insn ();
5147 seq && ! active_insn_p (seq);
5148 seq = PREV_INSN (seq))
5149 if (NOTE_P (seq) && NOTE_LINE_NUMBER (seq) > 0)
5151 epilogue_line_note = seq;
5155 for (e = last->pred; e; e = e_next)
5157 basic_block bb = e->src;
5160 e_next = e->pred_next;
5161 if (bb == ENTRY_BLOCK_PTR)
5165 if (!JUMP_P (jump) || JUMP_LABEL (jump) != label)
5168 /* If we have an unconditional jump, we can replace that
5169 with a simple return instruction. */
5170 if (simplejump_p (jump))
5172 emit_return_into_block (bb, epilogue_line_note);
5176 /* If we have a conditional jump, we can try to replace
5177 that with a conditional return instruction. */
5178 else if (condjump_p (jump))
5180 if (! redirect_jump (jump, 0, 0))
5183 /* If this block has only one successor, it both jumps
5184 and falls through to the fallthru block, so we can't
5186 if (bb->succ->succ_next == NULL)
5192 /* Fix up the CFG for the successful change we just made. */
5193 redirect_edge_succ (e, EXIT_BLOCK_PTR);
5196 /* Emit a return insn for the exit fallthru block. Whether
5197 this is still reachable will be determined later. */
5199 emit_barrier_after (BB_END (last));
5200 emit_return_into_block (last, epilogue_line_note);
5201 epilogue_end = BB_END (last);
5202 last->succ->flags &= ~EDGE_FALLTHRU;
5207 /* Find the edge that falls through to EXIT. Other edges may exist
5208 due to RETURN instructions, but those don't need epilogues.
5209 There really shouldn't be a mixture -- either all should have
5210 been converted or none, however... */
5212 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5213 if (e->flags & EDGE_FALLTHRU)
5218 #ifdef HAVE_epilogue
5222 epilogue_end = emit_note (NOTE_INSN_EPILOGUE_BEG);
5224 seq = gen_epilogue ();
5226 #ifdef INCOMING_RETURN_ADDR_RTX
5227 /* If this function returns with the stack depressed and we can support
5228 it, massage the epilogue to actually do that. */
5229 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
5230 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
5231 seq = keep_stack_depressed (seq);
5234 emit_jump_insn (seq);
5236 /* Retain a map of the epilogue insns. */
5237 record_insns (seq, &epilogue);
5238 set_insn_locators (seq, epilogue_locator);
5243 insert_insn_on_edge (seq, e);
5251 if (! next_active_insn (BB_END (e->src)))
5253 /* We have a fall-through edge to the exit block, the source is not
5254 at the end of the function, and there will be an assembler epilogue
5255 at the end of the function.
5256 We can't use force_nonfallthru here, because that would try to
5257 use return. Inserting a jump 'by hand' is extremely messy, so
5258 we take advantage of cfg_layout_finalize using
5259 fixup_fallthru_exit_predecessor. */
5260 cfg_layout_initialize ();
5261 FOR_EACH_BB (cur_bb)
5262 if (cur_bb->index >= 0 && cur_bb->next_bb->index >= 0)
5263 cur_bb->rbi->next = cur_bb->next_bb;
5264 cfg_layout_finalize ();
5269 commit_edge_insertions ();
5271 #ifdef HAVE_sibcall_epilogue
5272 /* Emit sibling epilogues before any sibling call sites. */
5273 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5275 basic_block bb = e->src;
5276 rtx insn = BB_END (bb);
5281 || ! SIBLING_CALL_P (insn))
5285 emit_insn (gen_sibcall_epilogue ());
5289 /* Retain a map of the epilogue insns. Used in life analysis to
5290 avoid getting rid of sibcall epilogue insns. Do this before we
5291 actually emit the sequence. */
5292 record_insns (seq, &sibcall_epilogue);
5293 set_insn_locators (seq, epilogue_locator);
5295 i = PREV_INSN (insn);
5296 newinsn = emit_insn_before (seq, insn);
5300 #ifdef HAVE_prologue
5301 /* This is probably all useless now that we use locators. */
5306 /* GDB handles `break f' by setting a breakpoint on the first
5307 line note after the prologue. Which means (1) that if
5308 there are line number notes before where we inserted the
5309 prologue we should move them, and (2) we should generate a
5310 note before the end of the first basic block, if there isn't
5313 ??? This behavior is completely broken when dealing with
5314 multiple entry functions. We simply place the note always
5315 into first basic block and let alternate entry points
5319 for (insn = prologue_end; insn; insn = prev)
5321 prev = PREV_INSN (insn);
5322 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5324 /* Note that we cannot reorder the first insn in the
5325 chain, since rest_of_compilation relies on that
5326 remaining constant. */
5329 reorder_insns (insn, insn, prologue_end);
5333 /* Find the last line number note in the first block. */
5334 for (insn = BB_END (ENTRY_BLOCK_PTR->next_bb);
5335 insn != prologue_end && insn;
5336 insn = PREV_INSN (insn))
5337 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5340 /* If we didn't find one, make a copy of the first line number
5344 for (insn = next_active_insn (prologue_end);
5346 insn = PREV_INSN (insn))
5347 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5349 emit_note_copy_after (insn, prologue_end);
5355 #ifdef HAVE_epilogue
5360 /* Similarly, move any line notes that appear after the epilogue.
5361 There is no need, however, to be quite so anal about the existence
5362 of such a note. Also move the NOTE_INSN_FUNCTION_END and (possibly)
5363 NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
5365 for (insn = epilogue_end; insn; insn = next)
5367 next = NEXT_INSN (insn);
5369 && (NOTE_LINE_NUMBER (insn) > 0
5370 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG
5371 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_END))
5372 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
5378 /* Reposition the prologue-end and epilogue-begin notes after instruction
5379 scheduling and delayed branch scheduling. */
5382 reposition_prologue_and_epilogue_notes (rtx f ATTRIBUTE_UNUSED)
5384 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
5385 rtx insn, last, note;
5388 if ((len = VARRAY_SIZE (prologue)) > 0)
5392 /* Scan from the beginning until we reach the last prologue insn.
5393 We apparently can't depend on basic_block_{head,end} after
5395 for (insn = f; insn; insn = NEXT_INSN (insn))
5399 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
5402 else if (contains (insn, prologue))
5412 /* Find the prologue-end note if we haven't already, and
5413 move it to just after the last prologue insn. */
5416 for (note = last; (note = NEXT_INSN (note));)
5418 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
5422 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
5424 last = NEXT_INSN (last);
5425 reorder_insns (note, note, last);
5429 if ((len = VARRAY_SIZE (epilogue)) > 0)
5433 /* Scan from the end until we reach the first epilogue insn.
5434 We apparently can't depend on basic_block_{head,end} after
5436 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
5440 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
5443 else if (contains (insn, epilogue))
5453 /* Find the epilogue-begin note if we haven't already, and
5454 move it to just before the first epilogue insn. */
5457 for (note = insn; (note = PREV_INSN (note));)
5459 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
5463 if (PREV_INSN (last) != note)
5464 reorder_insns (note, note, PREV_INSN (last));
5467 #endif /* HAVE_prologue or HAVE_epilogue */
5470 /* Called once, at initialization, to initialize function.c. */
5473 init_function_once (void)
5475 VARRAY_INT_INIT (prologue, 0, "prologue");
5476 VARRAY_INT_INIT (epilogue, 0, "epilogue");
5477 VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue");
5480 /* Resets insn_block_boundaries array. */
5483 reset_block_changes (void)
5485 VARRAY_TREE_INIT (cfun->ib_boundaries_block, 100, "ib_boundaries_block");
5486 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, NULL_TREE);
5489 /* Record the boundary for BLOCK. */
5491 record_block_change (tree block)
5499 last_block = VARRAY_TOP_TREE (cfun->ib_boundaries_block);
5500 VARRAY_POP (cfun->ib_boundaries_block);
5502 for (i = VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block); i < n; i++)
5503 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, last_block);
5505 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, block);
5508 /* Finishes record of boundaries. */
5509 void finalize_block_changes (void)
5511 record_block_change (DECL_INITIAL (current_function_decl));
5514 /* For INSN return the BLOCK it belongs to. */
5516 check_block_change (rtx insn, tree *block)
5518 unsigned uid = INSN_UID (insn);
5520 if (uid >= VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block))
5523 *block = VARRAY_TREE (cfun->ib_boundaries_block, uid);
5526 /* Releases the ib_boundaries_block records. */
5528 free_block_changes (void)
5530 cfun->ib_boundaries_block = NULL;
5533 /* Returns the name of the current function. */
5535 current_function_name (void)
5537 return lang_hooks.decl_printable_name (cfun->decl, 2);
5540 #include "gt-function.h"