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 ATTRIBUTE_UNUSED,
2033 enum machine_mode mode ATTRIBUTE_UNUSED,
2034 tree type, bool named_arg ATTRIBUTE_UNUSED)
2038 /* If this type contains non-trivial constructors, then it is
2039 forbidden for the middle-end to create any new copies. */
2040 if (TREE_ADDRESSABLE (type))
2043 /* If an object's size is dependent on itself, there's no way
2044 to *not* pass by reference. */
2045 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type)))
2049 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
2050 return FUNCTION_ARG_PASS_BY_REFERENCE (*ca, mode, type, named_arg);
2056 /* Structures to communicate between the subroutines of assign_parms.
2057 The first holds data persistent across all parameters, the second
2058 is cleared out for each parameter. */
2060 struct assign_parm_data_all
2062 CUMULATIVE_ARGS args_so_far;
2063 struct args_size stack_args_size;
2064 tree function_result_decl;
2066 rtx conversion_insns;
2067 HOST_WIDE_INT pretend_args_size;
2068 HOST_WIDE_INT extra_pretend_bytes;
2069 int reg_parm_stack_space;
2072 struct assign_parm_data_one
2078 enum machine_mode nominal_mode;
2079 enum machine_mode passed_mode;
2080 enum machine_mode promoted_mode;
2081 struct locate_and_pad_arg_data locate;
2083 BOOL_BITFIELD named_arg : 1;
2084 BOOL_BITFIELD last_named : 1;
2085 BOOL_BITFIELD passed_pointer : 1;
2086 BOOL_BITFIELD on_stack : 1;
2087 BOOL_BITFIELD loaded_in_reg : 1;
2090 /* A subroutine of assign_parms. Initialize ALL. */
2093 assign_parms_initialize_all (struct assign_parm_data_all *all)
2097 memset (all, 0, sizeof (*all));
2099 fntype = TREE_TYPE (current_function_decl);
2101 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
2102 INIT_CUMULATIVE_INCOMING_ARGS (all->args_so_far, fntype, NULL_RTX);
2104 INIT_CUMULATIVE_ARGS (all->args_so_far, fntype, NULL_RTX,
2105 current_function_decl, -1);
2108 #ifdef REG_PARM_STACK_SPACE
2109 all->reg_parm_stack_space = REG_PARM_STACK_SPACE (current_function_decl);
2113 /* If ARGS contains entries with complex types, split the entry into two
2114 entries of the component type. Return a new list of substitutions are
2115 needed, else the old list. */
2118 split_complex_args (tree args)
2122 /* Before allocating memory, check for the common case of no complex. */
2123 for (p = args; p; p = TREE_CHAIN (p))
2125 tree type = TREE_TYPE (p);
2126 if (TREE_CODE (type) == COMPLEX_TYPE
2127 && targetm.calls.split_complex_arg (type))
2133 args = copy_list (args);
2135 for (p = args; p; p = TREE_CHAIN (p))
2137 tree type = TREE_TYPE (p);
2138 if (TREE_CODE (type) == COMPLEX_TYPE
2139 && targetm.calls.split_complex_arg (type))
2142 tree subtype = TREE_TYPE (type);
2144 /* Rewrite the PARM_DECL's type with its component. */
2145 TREE_TYPE (p) = subtype;
2146 DECL_ARG_TYPE (p) = TREE_TYPE (DECL_ARG_TYPE (p));
2147 DECL_MODE (p) = VOIDmode;
2148 DECL_SIZE (p) = NULL;
2149 DECL_SIZE_UNIT (p) = NULL;
2152 /* Build a second synthetic decl. */
2153 decl = build_decl (PARM_DECL, NULL_TREE, subtype);
2154 DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (p);
2155 layout_decl (decl, 0);
2157 /* Splice it in; skip the new decl. */
2158 TREE_CHAIN (decl) = TREE_CHAIN (p);
2159 TREE_CHAIN (p) = decl;
2167 /* A subroutine of assign_parms. Adjust the parameter list to incorporate
2168 the hidden struct return argument, and (abi willing) complex args.
2169 Return the new parameter list. */
2172 assign_parms_augmented_arg_list (struct assign_parm_data_all *all)
2174 tree fndecl = current_function_decl;
2175 tree fntype = TREE_TYPE (fndecl);
2176 tree fnargs = DECL_ARGUMENTS (fndecl);
2178 /* If struct value address is treated as the first argument, make it so. */
2179 if (aggregate_value_p (DECL_RESULT (fndecl), fndecl)
2180 && ! current_function_returns_pcc_struct
2181 && targetm.calls.struct_value_rtx (TREE_TYPE (fndecl), 1) == 0)
2183 tree type = build_pointer_type (TREE_TYPE (fntype));
2186 decl = build_decl (PARM_DECL, NULL_TREE, type);
2187 DECL_ARG_TYPE (decl) = type;
2188 DECL_ARTIFICIAL (decl) = 1;
2190 TREE_CHAIN (decl) = fnargs;
2192 all->function_result_decl = decl;
2195 all->orig_fnargs = fnargs;
2197 /* If the target wants to split complex arguments into scalars, do so. */
2198 if (targetm.calls.split_complex_arg)
2199 fnargs = split_complex_args (fnargs);
2204 /* A subroutine of assign_parms. Examine PARM and pull out type and mode
2205 data for the parameter. Incorporate ABI specifics such as pass-by-
2206 reference and type promotion. */
2209 assign_parm_find_data_types (struct assign_parm_data_all *all, tree parm,
2210 struct assign_parm_data_one *data)
2212 tree nominal_type, passed_type;
2213 enum machine_mode nominal_mode, passed_mode, promoted_mode;
2215 memset (data, 0, sizeof (*data));
2217 /* Set LAST_NAMED if this is last named arg before last anonymous args. */
2218 if (current_function_stdarg)
2221 for (tem = TREE_CHAIN (parm); tem; tem = TREE_CHAIN (tem))
2222 if (DECL_NAME (tem))
2225 data->last_named = true;
2228 /* Set NAMED_ARG if this arg should be treated as a named arg. For
2229 most machines, if this is a varargs/stdarg function, then we treat
2230 the last named arg as if it were anonymous too. */
2231 if (targetm.calls.strict_argument_naming (&all->args_so_far))
2232 data->named_arg = 1;
2234 data->named_arg = !data->last_named;
2236 nominal_type = TREE_TYPE (parm);
2237 passed_type = DECL_ARG_TYPE (parm);
2239 /* Look out for errors propagating this far. Also, if the parameter's
2240 type is void then its value doesn't matter. */
2241 if (TREE_TYPE (parm) == error_mark_node
2242 /* This can happen after weird syntax errors
2243 or if an enum type is defined among the parms. */
2244 || TREE_CODE (parm) != PARM_DECL
2245 || passed_type == NULL
2246 || VOID_TYPE_P (nominal_type))
2248 nominal_type = passed_type = void_type_node;
2249 nominal_mode = passed_mode = promoted_mode = VOIDmode;
2253 /* Find mode of arg as it is passed, and mode of arg as it should be
2254 during execution of this function. */
2255 passed_mode = TYPE_MODE (passed_type);
2256 nominal_mode = TYPE_MODE (nominal_type);
2258 /* If the parm is to be passed as a transparent union, use the type of
2259 the first field for the tests below. We have already verified that
2260 the modes are the same. */
2261 if (DECL_TRANSPARENT_UNION (parm)
2262 || (TREE_CODE (passed_type) == UNION_TYPE
2263 && TYPE_TRANSPARENT_UNION (passed_type)))
2264 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
2266 /* See if this arg was passed by invisible reference. */
2267 if (pass_by_reference (&all->args_so_far, passed_mode,
2268 passed_type, data->named_arg))
2270 passed_type = nominal_type = build_pointer_type (passed_type);
2271 data->passed_pointer = true;
2272 passed_mode = nominal_mode = Pmode;
2274 /* See if the frontend wants to pass this by invisible reference. */
2275 else if (passed_type != nominal_type
2276 && POINTER_TYPE_P (passed_type)
2277 && TREE_TYPE (passed_type) == nominal_type)
2279 nominal_type = passed_type;
2280 data->passed_pointer = 1;
2281 passed_mode = nominal_mode = Pmode;
2284 /* Find mode as it is passed by the ABI. */
2285 promoted_mode = passed_mode;
2286 if (targetm.calls.promote_function_args (TREE_TYPE (current_function_decl)))
2288 int unsignedp = TYPE_UNSIGNED (passed_type);
2289 promoted_mode = promote_mode (passed_type, promoted_mode,
2294 data->nominal_type = nominal_type;
2295 data->passed_type = passed_type;
2296 data->nominal_mode = nominal_mode;
2297 data->passed_mode = passed_mode;
2298 data->promoted_mode = promoted_mode;
2301 /* A subroutine of assign_parms. Invoke setup_incoming_varargs. */
2304 assign_parms_setup_varargs (struct assign_parm_data_all *all,
2305 struct assign_parm_data_one *data, bool no_rtl)
2307 int varargs_pretend_bytes = 0;
2309 targetm.calls.setup_incoming_varargs (&all->args_so_far,
2310 data->promoted_mode,
2312 &varargs_pretend_bytes, no_rtl);
2314 /* If the back-end has requested extra stack space, record how much is
2315 needed. Do not change pretend_args_size otherwise since it may be
2316 nonzero from an earlier partial argument. */
2317 if (varargs_pretend_bytes > 0)
2318 all->pretend_args_size = varargs_pretend_bytes;
2321 /* A subroutine of assign_parms. Set DATA->ENTRY_PARM corresponding to
2322 the incoming location of the current parameter. */
2325 assign_parm_find_entry_rtl (struct assign_parm_data_all *all,
2326 struct assign_parm_data_one *data)
2328 HOST_WIDE_INT pretend_bytes = 0;
2332 if (data->promoted_mode == VOIDmode)
2334 data->entry_parm = data->stack_parm = const0_rtx;
2338 #ifdef FUNCTION_INCOMING_ARG
2339 entry_parm = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
2340 data->passed_type, data->named_arg);
2342 entry_parm = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
2343 data->passed_type, data->named_arg);
2346 if (entry_parm == 0)
2347 data->promoted_mode = data->passed_mode;
2349 /* Determine parm's home in the stack, in case it arrives in the stack
2350 or we should pretend it did. Compute the stack position and rtx where
2351 the argument arrives and its size.
2353 There is one complexity here: If this was a parameter that would
2354 have been passed in registers, but wasn't only because it is
2355 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
2356 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
2357 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of 0
2358 as it was the previous time. */
2359 in_regs = entry_parm != 0;
2360 #ifdef STACK_PARMS_IN_REG_PARM_AREA
2363 if (!in_regs && !data->named_arg)
2365 if (targetm.calls.pretend_outgoing_varargs_named (&all->args_so_far))
2368 #ifdef FUNCTION_INCOMING_ARG
2369 tem = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
2370 data->passed_type, true);
2372 tem = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
2373 data->passed_type, true);
2375 in_regs = tem != NULL;
2379 /* If this parameter was passed both in registers and in the stack, use
2380 the copy on the stack. */
2381 if (targetm.calls.must_pass_in_stack (data->promoted_mode,
2389 partial = FUNCTION_ARG_PARTIAL_NREGS (all->args_so_far,
2390 data->promoted_mode,
2393 data->partial = partial;
2395 /* The caller might already have allocated stack space for the
2396 register parameters. */
2397 if (partial != 0 && all->reg_parm_stack_space == 0)
2399 /* Part of this argument is passed in registers and part
2400 is passed on the stack. Ask the prologue code to extend
2401 the stack part so that we can recreate the full value.
2403 PRETEND_BYTES is the size of the registers we need to store.
2404 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
2405 stack space that the prologue should allocate.
2407 Internally, gcc assumes that the argument pointer is aligned
2408 to STACK_BOUNDARY bits. This is used both for alignment
2409 optimizations (see init_emit) and to locate arguments that are
2410 aligned to more than PARM_BOUNDARY bits. We must preserve this
2411 invariant by rounding CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to
2412 a stack boundary. */
2414 /* We assume at most one partial arg, and it must be the first
2415 argument on the stack. */
2416 if (all->extra_pretend_bytes || all->pretend_args_size)
2419 pretend_bytes = partial * UNITS_PER_WORD;
2420 all->pretend_args_size = CEIL_ROUND (pretend_bytes, STACK_BYTES);
2422 /* We want to align relative to the actual stack pointer, so
2423 don't include this in the stack size until later. */
2424 all->extra_pretend_bytes = all->pretend_args_size;
2428 locate_and_pad_parm (data->promoted_mode, data->passed_type, in_regs,
2429 entry_parm ? data->partial : 0, current_function_decl,
2430 &all->stack_args_size, &data->locate);
2432 /* Adjust offsets to include the pretend args. */
2433 pretend_bytes = all->extra_pretend_bytes - pretend_bytes;
2434 data->locate.slot_offset.constant += pretend_bytes;
2435 data->locate.offset.constant += pretend_bytes;
2437 data->entry_parm = entry_parm;
2440 /* A subroutine of assign_parms. If there is actually space on the stack
2441 for this parm, count it in stack_args_size and return true. */
2444 assign_parm_is_stack_parm (struct assign_parm_data_all *all,
2445 struct assign_parm_data_one *data)
2447 /* Trivially true if we've no incomming register. */
2448 if (data->entry_parm == NULL)
2450 /* Also true if we're partially in registers and partially not,
2451 since we've arranged to drop the entire argument on the stack. */
2452 else if (data->partial != 0)
2454 /* Also true if the target says that it's passed in both registers
2455 and on the stack. */
2456 else if (GET_CODE (data->entry_parm) == PARALLEL
2457 && XEXP (XVECEXP (data->entry_parm, 0, 0), 0) == NULL_RTX)
2459 /* Also true if the target says that there's stack allocated for
2460 all register parameters. */
2461 else if (all->reg_parm_stack_space > 0)
2463 /* Otherwise, no, this parameter has no ABI defined stack slot. */
2467 all->stack_args_size.constant += data->locate.size.constant;
2468 if (data->locate.size.var)
2469 ADD_PARM_SIZE (all->stack_args_size, data->locate.size.var);
2474 /* A subroutine of assign_parms. Given that this parameter is allocated
2475 stack space by the ABI, find it. */
2478 assign_parm_find_stack_rtl (tree parm, struct assign_parm_data_one *data)
2480 rtx offset_rtx, stack_parm;
2481 unsigned int align, boundary;
2483 /* If we're passing this arg using a reg, make its stack home the
2484 aligned stack slot. */
2485 if (data->entry_parm)
2486 offset_rtx = ARGS_SIZE_RTX (data->locate.slot_offset);
2488 offset_rtx = ARGS_SIZE_RTX (data->locate.offset);
2490 stack_parm = current_function_internal_arg_pointer;
2491 if (offset_rtx != const0_rtx)
2492 stack_parm = gen_rtx_PLUS (Pmode, stack_parm, offset_rtx);
2493 stack_parm = gen_rtx_MEM (data->promoted_mode, stack_parm);
2495 set_mem_attributes (stack_parm, parm, 1);
2497 boundary = FUNCTION_ARG_BOUNDARY (data->promoted_mode, data->passed_type);
2500 /* If we're padding upward, we know that the alignment of the slot
2501 is FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
2502 intentionally forcing upward padding. Otherwise we have to come
2503 up with a guess at the alignment based on OFFSET_RTX. */
2504 if (data->locate.where_pad == upward || data->entry_parm)
2506 else if (GET_CODE (offset_rtx) == CONST_INT)
2508 align = INTVAL (offset_rtx) * BITS_PER_UNIT | boundary;
2509 align = align & -align;
2512 set_mem_align (stack_parm, align);
2514 if (data->entry_parm)
2515 set_reg_attrs_for_parm (data->entry_parm, stack_parm);
2517 data->stack_parm = stack_parm;
2520 /* A subroutine of assign_parms. Adjust DATA->ENTRY_RTL such that it's
2521 always valid and contiguous. */
2524 assign_parm_adjust_entry_rtl (struct assign_parm_data_one *data)
2526 rtx entry_parm = data->entry_parm;
2527 rtx stack_parm = data->stack_parm;
2529 /* If this parm was passed part in regs and part in memory, pretend it
2530 arrived entirely in memory by pushing the register-part onto the stack.
2531 In the special case of a DImode or DFmode that is split, we could put
2532 it together in a pseudoreg directly, but for now that's not worth
2534 if (data->partial != 0)
2536 /* Handle calls that pass values in multiple non-contiguous
2537 locations. The Irix 6 ABI has examples of this. */
2538 if (GET_CODE (entry_parm) == PARALLEL)
2539 emit_group_store (validize_mem (stack_parm), entry_parm,
2541 int_size_in_bytes (data->passed_type));
2543 move_block_from_reg (REGNO (entry_parm), validize_mem (stack_parm),
2546 entry_parm = stack_parm;
2549 /* If we didn't decide this parm came in a register, by default it came
2551 else if (entry_parm == NULL)
2552 entry_parm = stack_parm;
2554 /* When an argument is passed in multiple locations, we can't make use
2555 of this information, but we can save some copying if the whole argument
2556 is passed in a single register. */
2557 else if (GET_CODE (entry_parm) == PARALLEL
2558 && data->nominal_mode != BLKmode
2559 && data->passed_mode != BLKmode)
2561 size_t i, len = XVECLEN (entry_parm, 0);
2563 for (i = 0; i < len; i++)
2564 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
2565 && REG_P (XEXP (XVECEXP (entry_parm, 0, i), 0))
2566 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
2567 == data->passed_mode)
2568 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
2570 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
2575 data->entry_parm = entry_parm;
2578 /* A subroutine of assign_parms. Adjust DATA->STACK_RTL such that it's
2579 always valid and properly aligned. */
2583 assign_parm_adjust_stack_rtl (struct assign_parm_data_one *data)
2585 rtx stack_parm = data->stack_parm;
2587 /* If we can't trust the parm stack slot to be aligned enough for its
2588 ultimate type, don't use that slot after entry. We'll make another
2589 stack slot, if we need one. */
2590 if (STRICT_ALIGNMENT && stack_parm
2591 && GET_MODE_ALIGNMENT (data->nominal_mode) > MEM_ALIGN (stack_parm))
2594 /* If parm was passed in memory, and we need to convert it on entry,
2595 don't store it back in that same slot. */
2596 else if (data->entry_parm == stack_parm
2597 && data->nominal_mode != BLKmode
2598 && data->nominal_mode != data->passed_mode)
2601 data->stack_parm = stack_parm;
2604 /* A subroutine of assign_parms. Return true if the current parameter
2605 should be stored as a BLKmode in the current frame. */
2608 assign_parm_setup_block_p (struct assign_parm_data_one *data)
2610 if (data->nominal_mode == BLKmode)
2612 if (GET_CODE (data->entry_parm) == PARALLEL)
2615 #ifdef BLOCK_REG_PADDING
2616 if (data->locate.where_pad == (BYTES_BIG_ENDIAN ? upward : downward)
2617 && GET_MODE_SIZE (data->promoted_mode) < UNITS_PER_WORD)
2624 /* A subroutine of assign_parms. Arrange for the parameter to be
2625 present and valid in DATA->STACK_RTL. */
2628 assign_parm_setup_block (tree parm, struct assign_parm_data_one *data)
2630 rtx entry_parm = data->entry_parm;
2631 rtx stack_parm = data->stack_parm;
2633 /* If we've a non-block object that's nevertheless passed in parts,
2634 reconstitute it in register operations rather than on the stack. */
2635 if (GET_CODE (entry_parm) == PARALLEL
2636 && data->nominal_mode != BLKmode
2637 && XVECLEN (entry_parm, 0) > 1
2640 rtx parmreg = gen_reg_rtx (data->nominal_mode);
2642 emit_group_store (parmreg, entry_parm, data->nominal_type,
2643 int_size_in_bytes (data->nominal_type));
2644 SET_DECL_RTL (parm, parmreg);
2648 /* If a BLKmode arrives in registers, copy it to a stack slot. Handle
2649 calls that pass values in multiple non-contiguous locations. */
2650 if (REG_P (entry_parm) || GET_CODE (entry_parm) == PARALLEL)
2652 HOST_WIDE_INT size = int_size_in_bytes (data->passed_type);
2653 HOST_WIDE_INT size_stored = CEIL_ROUND (size, UNITS_PER_WORD);
2656 /* Note that we will be storing an integral number of words.
2657 So we have to be careful to ensure that we allocate an
2658 integral number of words. We do this below in the
2659 assign_stack_local if space was not allocated in the argument
2660 list. If it was, this will not work if PARM_BOUNDARY is not
2661 a multiple of BITS_PER_WORD. It isn't clear how to fix this
2662 if it becomes a problem. Exception is when BLKmode arrives
2663 with arguments not conforming to word_mode. */
2665 if (stack_parm == 0)
2667 stack_parm = assign_stack_local (BLKmode, size_stored, 0);
2668 data->stack_parm = stack_parm;
2669 PUT_MODE (stack_parm, GET_MODE (entry_parm));
2670 set_mem_attributes (stack_parm, parm, 1);
2672 else if (GET_CODE (entry_parm) == PARALLEL)
2674 else if (size != 0 && PARM_BOUNDARY % BITS_PER_WORD != 0)
2677 mem = validize_mem (stack_parm);
2679 /* Handle values in multiple non-contiguous locations. */
2680 if (GET_CODE (entry_parm) == PARALLEL)
2681 emit_group_store (mem, entry_parm, data->passed_type, size);
2686 /* If SIZE is that of a mode no bigger than a word, just use
2687 that mode's store operation. */
2688 else if (size <= UNITS_PER_WORD)
2690 enum machine_mode mode
2691 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
2694 #ifdef BLOCK_REG_PADDING
2695 && (size == UNITS_PER_WORD
2696 || (BLOCK_REG_PADDING (mode, data->passed_type, 1)
2697 != (BYTES_BIG_ENDIAN ? upward : downward)))
2701 rtx reg = gen_rtx_REG (mode, REGNO (entry_parm));
2702 emit_move_insn (change_address (mem, mode, 0), reg);
2705 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
2706 machine must be aligned to the left before storing
2707 to memory. Note that the previous test doesn't
2708 handle all cases (e.g. SIZE == 3). */
2709 else if (size != UNITS_PER_WORD
2710 #ifdef BLOCK_REG_PADDING
2711 && (BLOCK_REG_PADDING (mode, data->passed_type, 1)
2719 int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
2720 rtx reg = gen_rtx_REG (word_mode, REGNO (data->entry_parm));
2722 x = expand_shift (LSHIFT_EXPR, word_mode, reg,
2723 build_int_2 (by, 0), NULL_RTX, 1);
2724 tem = change_address (mem, word_mode, 0);
2725 emit_move_insn (tem, x);
2728 move_block_from_reg (REGNO (data->entry_parm), mem,
2729 size_stored / UNITS_PER_WORD);
2732 move_block_from_reg (REGNO (data->entry_parm), mem,
2733 size_stored / UNITS_PER_WORD);
2736 SET_DECL_RTL (parm, stack_parm);
2739 /* A subroutine of assign_parms. Allocate a pseudo to hold the current
2740 parameter. Get it there. Perform all ABI specified conversions. */
2743 assign_parm_setup_reg (struct assign_parm_data_all *all, tree parm,
2744 struct assign_parm_data_one *data)
2747 enum machine_mode promoted_nominal_mode;
2748 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (parm));
2749 bool did_conversion = false;
2751 /* Store the parm in a pseudoregister during the function, but we may
2752 need to do it in a wider mode. */
2754 promoted_nominal_mode
2755 = promote_mode (data->nominal_type, data->nominal_mode, &unsignedp, 0);
2757 parmreg = gen_reg_rtx (promoted_nominal_mode);
2759 if (!DECL_ARTIFICIAL (parm))
2760 mark_user_reg (parmreg);
2762 /* If this was an item that we received a pointer to,
2763 set DECL_RTL appropriately. */
2764 if (data->passed_pointer)
2766 rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data->passed_type)), parmreg);
2767 set_mem_attributes (x, parm, 1);
2768 SET_DECL_RTL (parm, x);
2772 SET_DECL_RTL (parm, parmreg);
2773 maybe_set_unchanging (DECL_RTL (parm), parm);
2776 /* Copy the value into the register. */
2777 if (data->nominal_mode != data->passed_mode
2778 || promoted_nominal_mode != data->promoted_mode)
2782 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
2783 mode, by the caller. We now have to convert it to
2784 NOMINAL_MODE, if different. However, PARMREG may be in
2785 a different mode than NOMINAL_MODE if it is being stored
2788 If ENTRY_PARM is a hard register, it might be in a register
2789 not valid for operating in its mode (e.g., an odd-numbered
2790 register for a DFmode). In that case, moves are the only
2791 thing valid, so we can't do a convert from there. This
2792 occurs when the calling sequence allow such misaligned
2795 In addition, the conversion may involve a call, which could
2796 clobber parameters which haven't been copied to pseudo
2797 registers yet. Therefore, we must first copy the parm to
2798 a pseudo reg here, and save the conversion until after all
2799 parameters have been moved. */
2801 rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
2803 emit_move_insn (tempreg, validize_mem (data->entry_parm));
2805 push_to_sequence (all->conversion_insns);
2806 tempreg = convert_to_mode (data->nominal_mode, tempreg, unsignedp);
2808 if (GET_CODE (tempreg) == SUBREG
2809 && GET_MODE (tempreg) == data->nominal_mode
2810 && REG_P (SUBREG_REG (tempreg))
2811 && data->nominal_mode == data->passed_mode
2812 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (data->entry_parm)
2813 && GET_MODE_SIZE (GET_MODE (tempreg))
2814 < GET_MODE_SIZE (GET_MODE (data->entry_parm)))
2816 /* The argument is already sign/zero extended, so note it
2818 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
2819 SUBREG_PROMOTED_UNSIGNED_SET (tempreg, unsignedp);
2822 /* TREE_USED gets set erroneously during expand_assignment. */
2823 save_tree_used = TREE_USED (parm);
2824 expand_assignment (parm, make_tree (data->nominal_type, tempreg), 0);
2825 TREE_USED (parm) = save_tree_used;
2826 all->conversion_insns = get_insns ();
2829 did_conversion = true;
2832 emit_move_insn (parmreg, validize_mem (data->entry_parm));
2834 /* If we were passed a pointer but the actual value can safely live
2835 in a register, put it in one. */
2836 if (data->passed_pointer
2837 && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
2838 /* If by-reference argument was promoted, demote it. */
2839 && (TYPE_MODE (TREE_TYPE (parm)) != GET_MODE (DECL_RTL (parm))
2840 || use_register_for_decl (parm)))
2842 /* We can't use nominal_mode, because it will have been set to
2843 Pmode above. We must use the actual mode of the parm. */
2844 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
2845 mark_user_reg (parmreg);
2847 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
2849 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
2850 int unsigned_p = TYPE_UNSIGNED (TREE_TYPE (parm));
2852 push_to_sequence (all->conversion_insns);
2853 emit_move_insn (tempreg, DECL_RTL (parm));
2854 tempreg = convert_to_mode (GET_MODE (parmreg), tempreg, unsigned_p);
2855 emit_move_insn (parmreg, tempreg);
2856 all->conversion_insns = get_insns();
2859 did_conversion = true;
2862 emit_move_insn (parmreg, DECL_RTL (parm));
2864 SET_DECL_RTL (parm, parmreg);
2866 /* STACK_PARM is the pointer, not the parm, and PARMREG is
2868 data->stack_parm = NULL;
2871 /* If we are passed an arg by reference and it is our responsibility
2872 to make a copy, do it now.
2873 PASSED_TYPE and PASSED mode now refer to the pointer, not the
2874 original argument, so we must recreate them in the call to
2875 FUNCTION_ARG_CALLEE_COPIES. */
2876 /* ??? Later add code to handle the case that if the argument isn't
2877 modified, don't do the copy. */
2879 else if (data->passed_pointer)
2881 tree type = TREE_TYPE (data->passed_type);
2883 if (FUNCTION_ARG_CALLEE_COPIES (all->args_so_far, TYPE_MODE (type),
2884 type, data->named_arg)
2885 && !TREE_ADDRESSABLE (type))
2889 /* This sequence may involve a library call perhaps clobbering
2890 registers that haven't been copied to pseudos yet. */
2892 push_to_sequence (all->conversion_insns);
2894 if (!COMPLETE_TYPE_P (type)
2895 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
2897 /* This is a variable sized object. */
2898 copy = allocate_dynamic_stack_space (expr_size (parm), NULL_RTX,
2900 copy = gen_rtx_MEM (BLKmode, copy);
2903 copy = assign_stack_temp (TYPE_MODE (type),
2904 int_size_in_bytes (type), 1);
2905 set_mem_attributes (copy, parm, 1);
2907 store_expr (parm, copy, 0);
2908 emit_move_insn (parmreg, XEXP (copy, 0));
2909 all->conversion_insns = get_insns ();
2912 did_conversion = true;
2916 /* Mark the register as eliminable if we did no conversion and it was
2917 copied from memory at a fixed offset, and the arg pointer was not
2918 copied to a pseudo-reg. If the arg pointer is a pseudo reg or the
2919 offset formed an invalid address, such memory-equivalences as we
2920 make here would screw up life analysis for it. */
2921 if (data->nominal_mode == data->passed_mode
2923 && data->stack_parm != 0
2924 && MEM_P (data->stack_parm)
2925 && data->locate.offset.var == 0
2926 && reg_mentioned_p (virtual_incoming_args_rtx,
2927 XEXP (data->stack_parm, 0)))
2929 rtx linsn = get_last_insn ();
2932 /* Mark complex types separately. */
2933 if (GET_CODE (parmreg) == CONCAT)
2935 enum machine_mode submode
2936 = GET_MODE_INNER (GET_MODE (parmreg));
2937 int regnor = REGNO (gen_realpart (submode, parmreg));
2938 int regnoi = REGNO (gen_imagpart (submode, parmreg));
2939 rtx stackr = gen_realpart (submode, data->stack_parm);
2940 rtx stacki = gen_imagpart (submode, data->stack_parm);
2942 /* Scan backwards for the set of the real and
2944 for (sinsn = linsn; sinsn != 0;
2945 sinsn = prev_nonnote_insn (sinsn))
2947 set = single_set (sinsn);
2951 if (SET_DEST (set) == regno_reg_rtx [regnoi])
2953 = gen_rtx_EXPR_LIST (REG_EQUIV, stacki,
2955 else if (SET_DEST (set) == regno_reg_rtx [regnor])
2957 = gen_rtx_EXPR_LIST (REG_EQUIV, stackr,
2961 else if ((set = single_set (linsn)) != 0
2962 && SET_DEST (set) == parmreg)
2964 = gen_rtx_EXPR_LIST (REG_EQUIV,
2965 data->stack_parm, REG_NOTES (linsn));
2968 /* For pointer data type, suggest pointer register. */
2969 if (POINTER_TYPE_P (TREE_TYPE (parm)))
2970 mark_reg_pointer (parmreg,
2971 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
2974 /* A subroutine of assign_parms. Allocate stack space to hold the current
2975 parameter. Get it there. Perform all ABI specified conversions. */
2978 assign_parm_setup_stack (struct assign_parm_data_all *all, tree parm,
2979 struct assign_parm_data_one *data)
2981 /* Value must be stored in the stack slot STACK_PARM during function
2984 if (data->promoted_mode != data->nominal_mode)
2986 /* Conversion is required. */
2987 rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
2989 emit_move_insn (tempreg, validize_mem (data->entry_parm));
2991 push_to_sequence (all->conversion_insns);
2992 data->entry_parm = convert_to_mode (data->nominal_mode, tempreg,
2993 TYPE_UNSIGNED (TREE_TYPE (parm)));
2995 if (data->stack_parm)
2996 /* ??? This may need a big-endian conversion on sparc64. */
2998 = adjust_address (data->stack_parm, data->nominal_mode, 0);
3000 all->conversion_insns = get_insns ();
3004 if (data->entry_parm != data->stack_parm)
3006 if (data->stack_parm == 0)
3009 = assign_stack_local (GET_MODE (data->entry_parm),
3010 GET_MODE_SIZE (GET_MODE (data->entry_parm)),
3012 set_mem_attributes (data->stack_parm, parm, 1);
3015 if (data->promoted_mode != data->nominal_mode)
3017 push_to_sequence (all->conversion_insns);
3018 emit_move_insn (validize_mem (data->stack_parm),
3019 validize_mem (data->entry_parm));
3020 all->conversion_insns = get_insns ();
3024 emit_move_insn (validize_mem (data->stack_parm),
3025 validize_mem (data->entry_parm));
3028 SET_DECL_RTL (parm, data->stack_parm);
3031 /* A subroutine of assign_parms. If the ABI splits complex arguments, then
3032 undo the frobbing that we did in assign_parms_augmented_arg_list. */
3035 assign_parms_unsplit_complex (tree orig_fnargs, tree fnargs)
3039 for (parm = orig_fnargs; parm; parm = TREE_CHAIN (parm))
3041 if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
3042 && targetm.calls.split_complex_arg (TREE_TYPE (parm)))
3044 rtx tmp, real, imag;
3045 enum machine_mode inner = GET_MODE_INNER (DECL_MODE (parm));
3047 real = DECL_RTL (fnargs);
3048 imag = DECL_RTL (TREE_CHAIN (fnargs));
3049 if (inner != GET_MODE (real))
3051 real = gen_lowpart_SUBREG (inner, real);
3052 imag = gen_lowpart_SUBREG (inner, imag);
3054 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
3055 SET_DECL_RTL (parm, tmp);
3057 real = DECL_INCOMING_RTL (fnargs);
3058 imag = DECL_INCOMING_RTL (TREE_CHAIN (fnargs));
3059 if (inner != GET_MODE (real))
3061 real = gen_lowpart_SUBREG (inner, real);
3062 imag = gen_lowpart_SUBREG (inner, imag);
3064 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
3065 set_decl_incoming_rtl (parm, tmp);
3066 fnargs = TREE_CHAIN (fnargs);
3070 SET_DECL_RTL (parm, DECL_RTL (fnargs));
3071 set_decl_incoming_rtl (parm, DECL_INCOMING_RTL (fnargs));
3073 /* Set MEM_EXPR to the original decl, i.e. to PARM,
3074 instead of the copy of decl, i.e. FNARGS. */
3075 if (DECL_INCOMING_RTL (parm) && MEM_P (DECL_INCOMING_RTL (parm)))
3076 set_mem_expr (DECL_INCOMING_RTL (parm), parm);
3079 fnargs = TREE_CHAIN (fnargs);
3083 /* Assign RTL expressions to the function's parameters. This may involve
3084 copying them into registers and using those registers as the DECL_RTL. */
3087 assign_parms (tree fndecl)
3089 struct assign_parm_data_all all;
3091 rtx internal_arg_pointer;
3092 int varargs_setup = 0;
3094 /* If the reg that the virtual arg pointer will be translated into is
3095 not a fixed reg or is the stack pointer, make a copy of the virtual
3096 arg pointer, and address parms via the copy. The frame pointer is
3097 considered fixed even though it is not marked as such.
3099 The second time through, simply use ap to avoid generating rtx. */
3101 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
3102 || ! (fixed_regs[ARG_POINTER_REGNUM]
3103 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
3104 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
3106 internal_arg_pointer = virtual_incoming_args_rtx;
3107 current_function_internal_arg_pointer = internal_arg_pointer;
3109 assign_parms_initialize_all (&all);
3110 fnargs = assign_parms_augmented_arg_list (&all);
3112 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
3114 struct assign_parm_data_one data;
3116 /* Extract the type of PARM; adjust it according to ABI. */
3117 assign_parm_find_data_types (&all, parm, &data);
3119 /* Early out for errors and void parameters. */
3120 if (data.passed_mode == VOIDmode)
3122 SET_DECL_RTL (parm, const0_rtx);
3123 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
3127 /* Handle stdargs. LAST_NAMED is a slight mis-nomer; it's also true
3128 for the unnamed dummy argument following the last named argument.
3129 See ABI silliness wrt strict_argument_naming and NAMED_ARG. So
3130 we only want to do this when we get to the actual last named
3131 argument, which will be the first time LAST_NAMED gets set. */
3132 if (data.last_named && !varargs_setup)
3134 varargs_setup = true;
3135 assign_parms_setup_varargs (&all, &data, false);
3138 /* Find out where the parameter arrives in this function. */
3139 assign_parm_find_entry_rtl (&all, &data);
3141 /* Find out where stack space for this parameter might be. */
3142 if (assign_parm_is_stack_parm (&all, &data))
3144 assign_parm_find_stack_rtl (parm, &data);
3145 assign_parm_adjust_entry_rtl (&data);
3148 /* Record permanently how this parm was passed. */
3149 set_decl_incoming_rtl (parm, data.entry_parm);
3151 /* Update info on where next arg arrives in registers. */
3152 FUNCTION_ARG_ADVANCE (all.args_so_far, data.promoted_mode,
3153 data.passed_type, data.named_arg);
3155 assign_parm_adjust_stack_rtl (&data);
3157 if (assign_parm_setup_block_p (&data))
3158 assign_parm_setup_block (parm, &data);
3159 else if (data.passed_pointer || use_register_for_decl (parm))
3160 assign_parm_setup_reg (&all, parm, &data);
3162 assign_parm_setup_stack (&all, parm, &data);
3165 if (targetm.calls.split_complex_arg && fnargs != all.orig_fnargs)
3166 assign_parms_unsplit_complex (all.orig_fnargs, fnargs);
3168 /* Output all parameter conversion instructions (possibly including calls)
3169 now that all parameters have been copied out of hard registers. */
3170 emit_insn (all.conversion_insns);
3172 /* If we are receiving a struct value address as the first argument, set up
3173 the RTL for the function result. As this might require code to convert
3174 the transmitted address to Pmode, we do this here to ensure that possible
3175 preliminary conversions of the address have been emitted already. */
3176 if (all.function_result_decl)
3178 tree result = DECL_RESULT (current_function_decl);
3179 rtx addr = DECL_RTL (all.function_result_decl);
3182 addr = convert_memory_address (Pmode, addr);
3183 x = gen_rtx_MEM (DECL_MODE (result), addr);
3184 set_mem_attributes (x, result, 1);
3185 SET_DECL_RTL (result, x);
3188 /* We have aligned all the args, so add space for the pretend args. */
3189 current_function_pretend_args_size = all.pretend_args_size;
3190 all.stack_args_size.constant += all.extra_pretend_bytes;
3191 current_function_args_size = all.stack_args_size.constant;
3193 /* Adjust function incoming argument size for alignment and
3196 #ifdef REG_PARM_STACK_SPACE
3197 current_function_args_size = MAX (current_function_args_size,
3198 REG_PARM_STACK_SPACE (fndecl));
3201 current_function_args_size
3202 = ((current_function_args_size + STACK_BYTES - 1)
3203 / STACK_BYTES) * STACK_BYTES;
3205 #ifdef ARGS_GROW_DOWNWARD
3206 current_function_arg_offset_rtx
3207 = (all.stack_args_size.var == 0 ? GEN_INT (-all.stack_args_size.constant)
3208 : expand_expr (size_diffop (all.stack_args_size.var,
3209 size_int (-all.stack_args_size.constant)),
3210 NULL_RTX, VOIDmode, 0));
3212 current_function_arg_offset_rtx = ARGS_SIZE_RTX (all.stack_args_size);
3215 /* See how many bytes, if any, of its args a function should try to pop
3218 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
3219 current_function_args_size);
3221 /* For stdarg.h function, save info about
3222 regs and stack space used by the named args. */
3224 current_function_args_info = all.args_so_far;
3226 /* Set the rtx used for the function return value. Put this in its
3227 own variable so any optimizers that need this information don't have
3228 to include tree.h. Do this here so it gets done when an inlined
3229 function gets output. */
3231 current_function_return_rtx
3232 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
3233 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
3235 /* If scalar return value was computed in a pseudo-reg, or was a named
3236 return value that got dumped to the stack, copy that to the hard
3238 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
3240 tree decl_result = DECL_RESULT (fndecl);
3241 rtx decl_rtl = DECL_RTL (decl_result);
3243 if (REG_P (decl_rtl)
3244 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
3245 : DECL_REGISTER (decl_result))
3249 #ifdef FUNCTION_OUTGOING_VALUE
3250 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
3253 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
3256 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
3257 /* The delay slot scheduler assumes that current_function_return_rtx
3258 holds the hard register containing the return value, not a
3259 temporary pseudo. */
3260 current_function_return_rtx = real_decl_rtl;
3265 /* Indicate whether REGNO is an incoming argument to the current function
3266 that was promoted to a wider mode. If so, return the RTX for the
3267 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
3268 that REGNO is promoted from and whether the promotion was signed or
3272 promoted_input_arg (unsigned int regno, enum machine_mode *pmode, int *punsignedp)
3276 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
3277 arg = TREE_CHAIN (arg))
3278 if (REG_P (DECL_INCOMING_RTL (arg))
3279 && REGNO (DECL_INCOMING_RTL (arg)) == regno
3280 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
3282 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
3283 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (arg));
3285 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
3286 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
3287 && mode != DECL_MODE (arg))
3289 *pmode = DECL_MODE (arg);
3290 *punsignedp = unsignedp;
3291 return DECL_INCOMING_RTL (arg);
3299 /* Compute the size and offset from the start of the stacked arguments for a
3300 parm passed in mode PASSED_MODE and with type TYPE.
3302 INITIAL_OFFSET_PTR points to the current offset into the stacked
3305 The starting offset and size for this parm are returned in
3306 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
3307 nonzero, the offset is that of stack slot, which is returned in
3308 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
3309 padding required from the initial offset ptr to the stack slot.
3311 IN_REGS is nonzero if the argument will be passed in registers. It will
3312 never be set if REG_PARM_STACK_SPACE is not defined.
3314 FNDECL is the function in which the argument was defined.
3316 There are two types of rounding that are done. The first, controlled by
3317 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
3318 list to be aligned to the specific boundary (in bits). This rounding
3319 affects the initial and starting offsets, but not the argument size.
3321 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
3322 optionally rounds the size of the parm to PARM_BOUNDARY. The
3323 initial offset is not affected by this rounding, while the size always
3324 is and the starting offset may be. */
3326 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
3327 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
3328 callers pass in the total size of args so far as
3329 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
3332 locate_and_pad_parm (enum machine_mode passed_mode, tree type, int in_regs,
3333 int partial, tree fndecl ATTRIBUTE_UNUSED,
3334 struct args_size *initial_offset_ptr,
3335 struct locate_and_pad_arg_data *locate)
3338 enum direction where_pad;
3340 int reg_parm_stack_space = 0;
3341 int part_size_in_regs;
3343 #ifdef REG_PARM_STACK_SPACE
3344 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
3346 /* If we have found a stack parm before we reach the end of the
3347 area reserved for registers, skip that area. */
3350 if (reg_parm_stack_space > 0)
3352 if (initial_offset_ptr->var)
3354 initial_offset_ptr->var
3355 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
3356 ssize_int (reg_parm_stack_space));
3357 initial_offset_ptr->constant = 0;
3359 else if (initial_offset_ptr->constant < reg_parm_stack_space)
3360 initial_offset_ptr->constant = reg_parm_stack_space;
3363 #endif /* REG_PARM_STACK_SPACE */
3365 part_size_in_regs = 0;
3366 if (reg_parm_stack_space == 0)
3367 part_size_in_regs = ((partial * UNITS_PER_WORD)
3368 / (PARM_BOUNDARY / BITS_PER_UNIT)
3369 * (PARM_BOUNDARY / BITS_PER_UNIT));
3372 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
3373 where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
3374 boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
3375 locate->where_pad = where_pad;
3377 #ifdef ARGS_GROW_DOWNWARD
3378 locate->slot_offset.constant = -initial_offset_ptr->constant;
3379 if (initial_offset_ptr->var)
3380 locate->slot_offset.var = size_binop (MINUS_EXPR, ssize_int (0),
3381 initial_offset_ptr->var);
3385 if (where_pad != none
3386 && (!host_integerp (sizetree, 1)
3387 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
3388 s2 = round_up (s2, PARM_BOUNDARY / BITS_PER_UNIT);
3389 SUB_PARM_SIZE (locate->slot_offset, s2);
3392 locate->slot_offset.constant += part_size_in_regs;
3395 #ifdef REG_PARM_STACK_SPACE
3396 || REG_PARM_STACK_SPACE (fndecl) > 0
3399 pad_to_arg_alignment (&locate->slot_offset, boundary,
3400 &locate->alignment_pad);
3402 locate->size.constant = (-initial_offset_ptr->constant
3403 - locate->slot_offset.constant);
3404 if (initial_offset_ptr->var)
3405 locate->size.var = size_binop (MINUS_EXPR,
3406 size_binop (MINUS_EXPR,
3408 initial_offset_ptr->var),
3409 locate->slot_offset.var);
3411 /* Pad_below needs the pre-rounded size to know how much to pad
3413 locate->offset = locate->slot_offset;
3414 if (where_pad == downward)
3415 pad_below (&locate->offset, passed_mode, sizetree);
3417 #else /* !ARGS_GROW_DOWNWARD */
3419 #ifdef REG_PARM_STACK_SPACE
3420 || REG_PARM_STACK_SPACE (fndecl) > 0
3423 pad_to_arg_alignment (initial_offset_ptr, boundary,
3424 &locate->alignment_pad);
3425 locate->slot_offset = *initial_offset_ptr;
3427 #ifdef PUSH_ROUNDING
3428 if (passed_mode != BLKmode)
3429 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
3432 /* Pad_below needs the pre-rounded size to know how much to pad below
3433 so this must be done before rounding up. */
3434 locate->offset = locate->slot_offset;
3435 if (where_pad == downward)
3436 pad_below (&locate->offset, passed_mode, sizetree);
3438 if (where_pad != none
3439 && (!host_integerp (sizetree, 1)
3440 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
3441 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
3443 ADD_PARM_SIZE (locate->size, sizetree);
3445 locate->size.constant -= part_size_in_regs;
3446 #endif /* ARGS_GROW_DOWNWARD */
3449 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
3450 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
3453 pad_to_arg_alignment (struct args_size *offset_ptr, int boundary,
3454 struct args_size *alignment_pad)
3456 tree save_var = NULL_TREE;
3457 HOST_WIDE_INT save_constant = 0;
3458 int boundary_in_bytes = boundary / BITS_PER_UNIT;
3459 HOST_WIDE_INT sp_offset = STACK_POINTER_OFFSET;
3461 #ifdef SPARC_STACK_BOUNDARY_HACK
3462 /* The sparc port has a bug. It sometimes claims a STACK_BOUNDARY
3463 higher than the real alignment of %sp. However, when it does this,
3464 the alignment of %sp+STACK_POINTER_OFFSET will be STACK_BOUNDARY.
3465 This is a temporary hack while the sparc port is fixed. */
3466 if (SPARC_STACK_BOUNDARY_HACK)
3470 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3472 save_var = offset_ptr->var;
3473 save_constant = offset_ptr->constant;
3476 alignment_pad->var = NULL_TREE;
3477 alignment_pad->constant = 0;
3479 if (boundary > BITS_PER_UNIT)
3481 if (offset_ptr->var)
3483 tree sp_offset_tree = ssize_int (sp_offset);
3484 tree offset = size_binop (PLUS_EXPR,
3485 ARGS_SIZE_TREE (*offset_ptr),
3487 #ifdef ARGS_GROW_DOWNWARD
3488 tree rounded = round_down (offset, boundary / BITS_PER_UNIT);
3490 tree rounded = round_up (offset, boundary / BITS_PER_UNIT);
3493 offset_ptr->var = size_binop (MINUS_EXPR, rounded, sp_offset_tree);
3494 /* ARGS_SIZE_TREE includes constant term. */
3495 offset_ptr->constant = 0;
3496 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3497 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
3502 offset_ptr->constant = -sp_offset +
3503 #ifdef ARGS_GROW_DOWNWARD
3504 FLOOR_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
3506 CEIL_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
3508 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3509 alignment_pad->constant = offset_ptr->constant - save_constant;
3515 pad_below (struct args_size *offset_ptr, enum machine_mode passed_mode, tree sizetree)
3517 if (passed_mode != BLKmode)
3519 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
3520 offset_ptr->constant
3521 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
3522 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
3523 - GET_MODE_SIZE (passed_mode));
3527 if (TREE_CODE (sizetree) != INTEGER_CST
3528 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
3530 /* Round the size up to multiple of PARM_BOUNDARY bits. */
3531 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
3533 ADD_PARM_SIZE (*offset_ptr, s2);
3534 SUB_PARM_SIZE (*offset_ptr, sizetree);
3539 /* Walk the tree of blocks describing the binding levels within a function
3540 and warn about variables the might be killed by setjmp or vfork.
3541 This is done after calling flow_analysis and before global_alloc
3542 clobbers the pseudo-regs to hard regs. */
3545 setjmp_vars_warning (tree block)
3549 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
3551 if (TREE_CODE (decl) == VAR_DECL
3552 && DECL_RTL_SET_P (decl)
3553 && REG_P (DECL_RTL (decl))
3554 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
3555 warning ("%Jvariable '%D' might be clobbered by `longjmp' or `vfork'",
3559 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
3560 setjmp_vars_warning (sub);
3563 /* Do the appropriate part of setjmp_vars_warning
3564 but for arguments instead of local variables. */
3567 setjmp_args_warning (void)
3570 for (decl = DECL_ARGUMENTS (current_function_decl);
3571 decl; decl = TREE_CHAIN (decl))
3572 if (DECL_RTL (decl) != 0
3573 && REG_P (DECL_RTL (decl))
3574 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
3575 warning ("%Jargument '%D' might be clobbered by `longjmp' or `vfork'",
3580 /* Convert a stack slot address ADDR for variable VAR
3581 (from a containing function)
3582 into an address valid in this function (using a static chain). */
3585 fix_lexical_addr (rtx addr, tree var)
3588 HOST_WIDE_INT displacement;
3589 tree context = decl_function_context (var);
3590 struct function *fp;
3593 /* If this is the present function, we need not do anything. */
3594 if (context == current_function_decl)
3597 fp = find_function_data (context);
3599 /* Decode given address as base reg plus displacement. */
3601 basereg = addr, displacement = 0;
3602 else if (GET_CODE (addr) == PLUS && GET_CODE (XEXP (addr, 1)) == CONST_INT)
3603 basereg = XEXP (addr, 0), displacement = INTVAL (XEXP (addr, 1));
3610 /* Use same offset, relative to appropriate static chain or argument
3612 return plus_constant (base, displacement);
3615 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
3616 and create duplicate blocks. */
3617 /* ??? Need an option to either create block fragments or to create
3618 abstract origin duplicates of a source block. It really depends
3619 on what optimization has been performed. */
3622 reorder_blocks (void)
3624 tree block = DECL_INITIAL (current_function_decl);
3625 varray_type block_stack;
3627 if (block == NULL_TREE)
3630 VARRAY_TREE_INIT (block_stack, 10, "block_stack");
3632 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
3633 clear_block_marks (block);
3635 /* Prune the old trees away, so that they don't get in the way. */
3636 BLOCK_SUBBLOCKS (block) = NULL_TREE;
3637 BLOCK_CHAIN (block) = NULL_TREE;
3639 /* Recreate the block tree from the note nesting. */
3640 reorder_blocks_1 (get_insns (), block, &block_stack);
3641 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
3643 /* Remove deleted blocks from the block fragment chains. */
3644 reorder_fix_fragments (block);
3647 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
3650 clear_block_marks (tree block)
3654 TREE_ASM_WRITTEN (block) = 0;
3655 clear_block_marks (BLOCK_SUBBLOCKS (block));
3656 block = BLOCK_CHAIN (block);
3661 reorder_blocks_1 (rtx insns, tree current_block, varray_type *p_block_stack)
3665 for (insn = insns; insn; insn = NEXT_INSN (insn))
3669 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
3671 tree block = NOTE_BLOCK (insn);
3673 /* If we have seen this block before, that means it now
3674 spans multiple address regions. Create a new fragment. */
3675 if (TREE_ASM_WRITTEN (block))
3677 tree new_block = copy_node (block);
3680 origin = (BLOCK_FRAGMENT_ORIGIN (block)
3681 ? BLOCK_FRAGMENT_ORIGIN (block)
3683 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
3684 BLOCK_FRAGMENT_CHAIN (new_block)
3685 = BLOCK_FRAGMENT_CHAIN (origin);
3686 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
3688 NOTE_BLOCK (insn) = new_block;
3692 BLOCK_SUBBLOCKS (block) = 0;
3693 TREE_ASM_WRITTEN (block) = 1;
3694 /* When there's only one block for the entire function,
3695 current_block == block and we mustn't do this, it
3696 will cause infinite recursion. */
3697 if (block != current_block)
3699 BLOCK_SUPERCONTEXT (block) = current_block;
3700 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
3701 BLOCK_SUBBLOCKS (current_block) = block;
3702 current_block = block;
3704 VARRAY_PUSH_TREE (*p_block_stack, block);
3706 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
3708 NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack);
3709 VARRAY_POP (*p_block_stack);
3710 BLOCK_SUBBLOCKS (current_block)
3711 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
3712 current_block = BLOCK_SUPERCONTEXT (current_block);
3718 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
3719 appears in the block tree, select one of the fragments to become
3720 the new origin block. */
3723 reorder_fix_fragments (tree block)
3727 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
3728 tree new_origin = NULL_TREE;
3732 if (! TREE_ASM_WRITTEN (dup_origin))
3734 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
3736 /* Find the first of the remaining fragments. There must
3737 be at least one -- the current block. */
3738 while (! TREE_ASM_WRITTEN (new_origin))
3739 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
3740 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
3743 else if (! dup_origin)
3746 /* Re-root the rest of the fragments to the new origin. In the
3747 case that DUP_ORIGIN was null, that means BLOCK was the origin
3748 of a chain of fragments and we want to remove those fragments
3749 that didn't make it to the output. */
3752 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
3757 if (TREE_ASM_WRITTEN (chain))
3759 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
3761 pp = &BLOCK_FRAGMENT_CHAIN (chain);
3763 chain = BLOCK_FRAGMENT_CHAIN (chain);
3768 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
3769 block = BLOCK_CHAIN (block);
3773 /* Reverse the order of elements in the chain T of blocks,
3774 and return the new head of the chain (old last element). */
3777 blocks_nreverse (tree t)
3779 tree prev = 0, decl, next;
3780 for (decl = t; decl; decl = next)
3782 next = BLOCK_CHAIN (decl);
3783 BLOCK_CHAIN (decl) = prev;
3789 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
3790 non-NULL, list them all into VECTOR, in a depth-first preorder
3791 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
3795 all_blocks (tree block, tree *vector)
3801 TREE_ASM_WRITTEN (block) = 0;
3803 /* Record this block. */
3805 vector[n_blocks] = block;
3809 /* Record the subblocks, and their subblocks... */
3810 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
3811 vector ? vector + n_blocks : 0);
3812 block = BLOCK_CHAIN (block);
3818 /* Return a vector containing all the blocks rooted at BLOCK. The
3819 number of elements in the vector is stored in N_BLOCKS_P. The
3820 vector is dynamically allocated; it is the caller's responsibility
3821 to call `free' on the pointer returned. */
3824 get_block_vector (tree block, int *n_blocks_p)
3828 *n_blocks_p = all_blocks (block, NULL);
3829 block_vector = xmalloc (*n_blocks_p * sizeof (tree));
3830 all_blocks (block, block_vector);
3832 return block_vector;
3835 static GTY(()) int next_block_index = 2;
3837 /* Set BLOCK_NUMBER for all the blocks in FN. */
3840 number_blocks (tree fn)
3846 /* For SDB and XCOFF debugging output, we start numbering the blocks
3847 from 1 within each function, rather than keeping a running
3849 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
3850 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
3851 next_block_index = 1;
3854 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
3856 /* The top-level BLOCK isn't numbered at all. */
3857 for (i = 1; i < n_blocks; ++i)
3858 /* We number the blocks from two. */
3859 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
3861 free (block_vector);
3866 /* If VAR is present in a subblock of BLOCK, return the subblock. */
3869 debug_find_var_in_block_tree (tree var, tree block)
3873 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
3877 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
3879 tree ret = debug_find_var_in_block_tree (var, t);
3887 /* Allocate a function structure for FNDECL and set its contents
3891 allocate_struct_function (tree fndecl)
3894 tree fntype = fndecl ? TREE_TYPE (fndecl) : NULL_TREE;
3896 cfun = ggc_alloc_cleared (sizeof (struct function));
3898 cfun->stack_alignment_needed = STACK_BOUNDARY;
3899 cfun->preferred_stack_boundary = STACK_BOUNDARY;
3901 current_function_funcdef_no = funcdef_no++;
3903 cfun->function_frequency = FUNCTION_FREQUENCY_NORMAL;
3905 init_stmt_for_function ();
3906 init_eh_for_function ();
3908 lang_hooks.function.init (cfun);
3909 if (init_machine_status)
3910 cfun->machine = (*init_machine_status) ();
3915 DECL_STRUCT_FUNCTION (fndecl) = cfun;
3916 cfun->decl = fndecl;
3918 result = DECL_RESULT (fndecl);
3919 if (aggregate_value_p (result, fndecl))
3921 #ifdef PCC_STATIC_STRUCT_RETURN
3922 current_function_returns_pcc_struct = 1;
3924 current_function_returns_struct = 1;
3927 current_function_returns_pointer = POINTER_TYPE_P (TREE_TYPE (result));
3929 current_function_stdarg
3931 && TYPE_ARG_TYPES (fntype) != 0
3932 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
3933 != void_type_node));
3936 /* Reset cfun, and other non-struct-function variables to defaults as
3937 appropriate for emitting rtl at the start of a function. */
3940 prepare_function_start (tree fndecl)
3942 if (fndecl && DECL_STRUCT_FUNCTION (fndecl))
3943 cfun = DECL_STRUCT_FUNCTION (fndecl);
3945 allocate_struct_function (fndecl);
3947 init_varasm_status (cfun);
3950 cse_not_expected = ! optimize;
3952 /* Caller save not needed yet. */
3953 caller_save_needed = 0;
3955 /* We haven't done register allocation yet. */
3958 /* Indicate that we need to distinguish between the return value of the
3959 present function and the return value of a function being called. */
3960 rtx_equal_function_value_matters = 1;
3962 /* Indicate that we have not instantiated virtual registers yet. */
3963 virtuals_instantiated = 0;
3965 /* Indicate that we want CONCATs now. */
3966 generating_concat_p = 1;
3968 /* Indicate we have no need of a frame pointer yet. */
3969 frame_pointer_needed = 0;
3972 /* Initialize the rtl expansion mechanism so that we can do simple things
3973 like generate sequences. This is used to provide a context during global
3974 initialization of some passes. */
3976 init_dummy_function_start (void)
3978 prepare_function_start (NULL);
3981 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
3982 and initialize static variables for generating RTL for the statements
3986 init_function_start (tree subr)
3988 prepare_function_start (subr);
3990 /* Prevent ever trying to delete the first instruction of a
3991 function. Also tell final how to output a linenum before the
3992 function prologue. Note linenums could be missing, e.g. when
3993 compiling a Java .class file. */
3994 if (! DECL_IS_BUILTIN (subr))
3995 emit_line_note (DECL_SOURCE_LOCATION (subr));
3997 /* Make sure first insn is a note even if we don't want linenums.
3998 This makes sure the first insn will never be deleted.
3999 Also, final expects a note to appear there. */
4000 emit_note (NOTE_INSN_DELETED);
4002 /* Warn if this value is an aggregate type,
4003 regardless of which calling convention we are using for it. */
4004 if (warn_aggregate_return
4005 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
4006 warning ("function returns an aggregate");
4009 /* Make sure all values used by the optimization passes have sane
4012 init_function_for_compilation (void)
4016 /* No prologue/epilogue insns yet. */
4017 VARRAY_GROW (prologue, 0);
4018 VARRAY_GROW (epilogue, 0);
4019 VARRAY_GROW (sibcall_epilogue, 0);
4022 /* Expand a call to __main at the beginning of a possible main function. */
4024 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
4025 #undef HAS_INIT_SECTION
4026 #define HAS_INIT_SECTION
4030 expand_main_function (void)
4032 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
4033 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
4035 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
4039 /* Forcibly align the stack. */
4040 #ifdef STACK_GROWS_DOWNWARD
4041 tmp = expand_simple_binop (Pmode, AND, stack_pointer_rtx, GEN_INT(-align),
4042 stack_pointer_rtx, 1, OPTAB_WIDEN);
4044 tmp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
4045 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
4046 tmp = expand_simple_binop (Pmode, AND, tmp, GEN_INT (-align),
4047 stack_pointer_rtx, 1, OPTAB_WIDEN);
4049 if (tmp != stack_pointer_rtx)
4050 emit_move_insn (stack_pointer_rtx, tmp);
4052 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
4053 tmp = force_reg (Pmode, const0_rtx);
4054 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
4058 for (tmp = get_last_insn (); tmp; tmp = PREV_INSN (tmp))
4059 if (NOTE_P (tmp) && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_FUNCTION_BEG)
4062 emit_insn_before (seq, tmp);
4068 #ifndef HAS_INIT_SECTION
4069 emit_library_call (init_one_libfunc (NAME__MAIN), LCT_NORMAL, VOIDmode, 0);
4073 /* The PENDING_SIZES represent the sizes of variable-sized types.
4074 Create RTL for the various sizes now (using temporary variables),
4075 so that we can refer to the sizes from the RTL we are generating
4076 for the current function. The PENDING_SIZES are a TREE_LIST. The
4077 TREE_VALUE of each node is a SAVE_EXPR. */
4080 expand_pending_sizes (tree pending_sizes)
4084 /* Evaluate now the sizes of any types declared among the arguments. */
4085 for (tem = pending_sizes; tem; tem = TREE_CHAIN (tem))
4087 expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode, 0);
4088 /* Flush the queue in case this parameter declaration has
4094 /* Start the RTL for a new function, and set variables used for
4096 SUBR is the FUNCTION_DECL node.
4097 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
4098 the function's parameters, which must be run at any return statement. */
4101 expand_function_start (tree subr)
4103 /* Make sure volatile mem refs aren't considered
4104 valid operands of arithmetic insns. */
4105 init_recog_no_volatile ();
4107 current_function_profile
4109 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
4111 current_function_limit_stack
4112 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
4114 /* Make the label for return statements to jump to. Do not special
4115 case machines with special return instructions -- they will be
4116 handled later during jump, ifcvt, or epilogue creation. */
4117 return_label = gen_label_rtx ();
4119 /* Initialize rtx used to return the value. */
4120 /* Do this before assign_parms so that we copy the struct value address
4121 before any library calls that assign parms might generate. */
4123 /* Decide whether to return the value in memory or in a register. */
4124 if (aggregate_value_p (DECL_RESULT (subr), subr))
4126 /* Returning something that won't go in a register. */
4127 rtx value_address = 0;
4129 #ifdef PCC_STATIC_STRUCT_RETURN
4130 if (current_function_returns_pcc_struct)
4132 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
4133 value_address = assemble_static_space (size);
4138 rtx sv = targetm.calls.struct_value_rtx (TREE_TYPE (subr), 1);
4139 /* Expect to be passed the address of a place to store the value.
4140 If it is passed as an argument, assign_parms will take care of
4144 value_address = gen_reg_rtx (Pmode);
4145 emit_move_insn (value_address, sv);
4150 rtx x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), value_address);
4151 set_mem_attributes (x, DECL_RESULT (subr), 1);
4152 SET_DECL_RTL (DECL_RESULT (subr), x);
4155 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
4156 /* If return mode is void, this decl rtl should not be used. */
4157 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
4160 /* Compute the return values into a pseudo reg, which we will copy
4161 into the true return register after the cleanups are done. */
4163 /* In order to figure out what mode to use for the pseudo, we
4164 figure out what the mode of the eventual return register will
4165 actually be, and use that. */
4167 = hard_function_value (TREE_TYPE (DECL_RESULT (subr)),
4170 /* Structures that are returned in registers are not aggregate_value_p,
4171 so we may see a PARALLEL or a REG. */
4172 if (REG_P (hard_reg))
4173 SET_DECL_RTL (DECL_RESULT (subr), gen_reg_rtx (GET_MODE (hard_reg)));
4174 else if (GET_CODE (hard_reg) == PARALLEL)
4175 SET_DECL_RTL (DECL_RESULT (subr), gen_group_rtx (hard_reg));
4179 /* Set DECL_REGISTER flag so that expand_function_end will copy the
4180 result to the real return register(s). */
4181 DECL_REGISTER (DECL_RESULT (subr)) = 1;
4184 /* Initialize rtx for parameters and local variables.
4185 In some cases this requires emitting insns. */
4186 assign_parms (subr);
4188 /* If function gets a static chain arg, store it. */
4189 if (cfun->static_chain_decl)
4191 tree parm = cfun->static_chain_decl;
4192 rtx local = gen_reg_rtx (Pmode);
4194 set_decl_incoming_rtl (parm, static_chain_incoming_rtx);
4195 SET_DECL_RTL (parm, local);
4196 maybe_set_unchanging (local, parm);
4197 mark_reg_pointer (local, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
4199 emit_move_insn (local, static_chain_incoming_rtx);
4202 /* If the function receives a non-local goto, then store the
4203 bits we need to restore the frame pointer. */
4204 if (cfun->nonlocal_goto_save_area)
4209 /* ??? We need to do this save early. Unfortunately here is
4210 before the frame variable gets declared. Help out... */
4211 expand_var (TREE_OPERAND (cfun->nonlocal_goto_save_area, 0));
4213 t_save = build (ARRAY_REF, ptr_type_node, cfun->nonlocal_goto_save_area,
4214 integer_zero_node, NULL_TREE, NULL_TREE);
4215 r_save = expand_expr (t_save, NULL_RTX, VOIDmode, EXPAND_WRITE);
4216 r_save = convert_memory_address (Pmode, r_save);
4218 emit_move_insn (r_save, virtual_stack_vars_rtx);
4219 update_nonlocal_goto_save_area ();
4222 /* The following was moved from init_function_start.
4223 The move is supposed to make sdb output more accurate. */
4224 /* Indicate the beginning of the function body,
4225 as opposed to parm setup. */
4226 emit_note (NOTE_INSN_FUNCTION_BEG);
4228 if (!NOTE_P (get_last_insn ()))
4229 emit_note (NOTE_INSN_DELETED);
4230 parm_birth_insn = get_last_insn ();
4232 if (current_function_profile)
4235 PROFILE_HOOK (current_function_funcdef_no);
4239 /* After the display initializations is where the tail-recursion label
4240 should go, if we end up needing one. Ensure we have a NOTE here
4241 since some things (like trampolines) get placed before this. */
4242 tail_recursion_reentry = emit_note (NOTE_INSN_DELETED);
4244 /* Evaluate now the sizes of any types declared among the arguments. */
4245 expand_pending_sizes (nreverse (get_pending_sizes ()));
4247 /* Make sure there is a line number after the function entry setup code. */
4248 force_next_line_note ();
4251 /* Undo the effects of init_dummy_function_start. */
4253 expand_dummy_function_end (void)
4255 /* End any sequences that failed to be closed due to syntax errors. */
4256 while (in_sequence_p ())
4259 /* Outside function body, can't compute type's actual size
4260 until next function's body starts. */
4262 free_after_parsing (cfun);
4263 free_after_compilation (cfun);
4267 /* Call DOIT for each hard register used as a return value from
4268 the current function. */
4271 diddle_return_value (void (*doit) (rtx, void *), void *arg)
4273 rtx outgoing = current_function_return_rtx;
4278 if (REG_P (outgoing))
4279 (*doit) (outgoing, arg);
4280 else if (GET_CODE (outgoing) == PARALLEL)
4284 for (i = 0; i < XVECLEN (outgoing, 0); i++)
4286 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
4288 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
4295 do_clobber_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
4297 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
4301 clobber_return_register (void)
4303 diddle_return_value (do_clobber_return_reg, NULL);
4305 /* In case we do use pseudo to return value, clobber it too. */
4306 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
4308 tree decl_result = DECL_RESULT (current_function_decl);
4309 rtx decl_rtl = DECL_RTL (decl_result);
4310 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
4312 do_clobber_return_reg (decl_rtl, NULL);
4318 do_use_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
4320 emit_insn (gen_rtx_USE (VOIDmode, reg));
4324 use_return_register (void)
4326 diddle_return_value (do_use_return_reg, NULL);
4329 /* Possibly warn about unused parameters. */
4331 do_warn_unused_parameter (tree fn)
4335 for (decl = DECL_ARGUMENTS (fn);
4336 decl; decl = TREE_CHAIN (decl))
4337 if (!TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
4338 && DECL_NAME (decl) && !DECL_ARTIFICIAL (decl))
4339 warning ("%Junused parameter '%D'", decl, decl);
4342 static GTY(()) rtx initial_trampoline;
4344 /* Generate RTL for the end of the current function. */
4347 expand_function_end (void)
4351 finish_expr_for_function ();
4353 /* If arg_pointer_save_area was referenced only from a nested
4354 function, we will not have initialized it yet. Do that now. */
4355 if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
4356 get_arg_pointer_save_area (cfun);
4358 /* If we are doing stack checking and this function makes calls,
4359 do a stack probe at the start of the function to ensure we have enough
4360 space for another stack frame. */
4361 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
4365 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4369 probe_stack_range (STACK_CHECK_PROTECT,
4370 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
4373 emit_insn_before (seq, tail_recursion_reentry);
4378 /* Possibly warn about unused parameters.
4379 When frontend does unit-at-a-time, the warning is already
4380 issued at finalization time. */
4381 if (warn_unused_parameter
4382 && !lang_hooks.callgraph.expand_function)
4383 do_warn_unused_parameter (current_function_decl);
4385 /* End any sequences that failed to be closed due to syntax errors. */
4386 while (in_sequence_p ())
4389 clear_pending_stack_adjust ();
4390 do_pending_stack_adjust ();
4392 /* @@@ This is a kludge. We want to ensure that instructions that
4393 may trap are not moved into the epilogue by scheduling, because
4394 we don't always emit unwind information for the epilogue.
4395 However, not all machine descriptions define a blockage insn, so
4396 emit an ASM_INPUT to act as one. */
4397 if (flag_non_call_exceptions)
4398 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, ""));
4400 /* Mark the end of the function body.
4401 If control reaches this insn, the function can drop through
4402 without returning a value. */
4403 emit_note (NOTE_INSN_FUNCTION_END);
4405 /* Must mark the last line number note in the function, so that the test
4406 coverage code can avoid counting the last line twice. This just tells
4407 the code to ignore the immediately following line note, since there
4408 already exists a copy of this note somewhere above. This line number
4409 note is still needed for debugging though, so we can't delete it. */
4410 if (flag_test_coverage)
4411 emit_note (NOTE_INSN_REPEATED_LINE_NUMBER);
4413 /* Output a linenumber for the end of the function.
4414 SDB depends on this. */
4415 force_next_line_note ();
4416 emit_line_note (input_location);
4418 /* Before the return label (if any), clobber the return
4419 registers so that they are not propagated live to the rest of
4420 the function. This can only happen with functions that drop
4421 through; if there had been a return statement, there would
4422 have either been a return rtx, or a jump to the return label.
4424 We delay actual code generation after the current_function_value_rtx
4426 clobber_after = get_last_insn ();
4428 /* Output the label for the actual return from the function,
4429 if one is expected. This happens either because a function epilogue
4430 is used instead of a return instruction, or because a return was done
4431 with a goto in order to run local cleanups, or because of pcc-style
4432 structure returning. */
4434 emit_label (return_label);
4436 /* Let except.c know where it should emit the call to unregister
4437 the function context for sjlj exceptions. */
4438 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
4439 sjlj_emit_function_exit_after (get_last_insn ());
4441 /* If we had calls to alloca, and this machine needs
4442 an accurate stack pointer to exit the function,
4443 insert some code to save and restore the stack pointer. */
4444 if (! EXIT_IGNORE_STACK
4445 && current_function_calls_alloca)
4449 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
4450 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
4453 /* If scalar return value was computed in a pseudo-reg, or was a named
4454 return value that got dumped to the stack, copy that to the hard
4456 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
4458 tree decl_result = DECL_RESULT (current_function_decl);
4459 rtx decl_rtl = DECL_RTL (decl_result);
4461 if (REG_P (decl_rtl)
4462 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
4463 : DECL_REGISTER (decl_result))
4465 rtx real_decl_rtl = current_function_return_rtx;
4467 /* This should be set in assign_parms. */
4468 if (! REG_FUNCTION_VALUE_P (real_decl_rtl))
4471 /* If this is a BLKmode structure being returned in registers,
4472 then use the mode computed in expand_return. Note that if
4473 decl_rtl is memory, then its mode may have been changed,
4474 but that current_function_return_rtx has not. */
4475 if (GET_MODE (real_decl_rtl) == BLKmode)
4476 PUT_MODE (real_decl_rtl, GET_MODE (decl_rtl));
4478 /* If a named return value dumped decl_return to memory, then
4479 we may need to re-do the PROMOTE_MODE signed/unsigned
4481 if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
4483 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (decl_result));
4485 if (targetm.calls.promote_function_return (TREE_TYPE (current_function_decl)))
4486 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
4489 convert_move (real_decl_rtl, decl_rtl, unsignedp);
4491 else if (GET_CODE (real_decl_rtl) == PARALLEL)
4493 /* If expand_function_start has created a PARALLEL for decl_rtl,
4494 move the result to the real return registers. Otherwise, do
4495 a group load from decl_rtl for a named return. */
4496 if (GET_CODE (decl_rtl) == PARALLEL)
4497 emit_group_move (real_decl_rtl, decl_rtl);
4499 emit_group_load (real_decl_rtl, decl_rtl,
4500 TREE_TYPE (decl_result),
4501 int_size_in_bytes (TREE_TYPE (decl_result)));
4504 emit_move_insn (real_decl_rtl, decl_rtl);
4508 /* If returning a structure, arrange to return the address of the value
4509 in a place where debuggers expect to find it.
4511 If returning a structure PCC style,
4512 the caller also depends on this value.
4513 And current_function_returns_pcc_struct is not necessarily set. */
4514 if (current_function_returns_struct
4515 || current_function_returns_pcc_struct)
4518 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
4519 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
4520 #ifdef FUNCTION_OUTGOING_VALUE
4522 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
4523 current_function_decl);
4526 = FUNCTION_VALUE (build_pointer_type (type), current_function_decl);
4529 /* Mark this as a function return value so integrate will delete the
4530 assignment and USE below when inlining this function. */
4531 REG_FUNCTION_VALUE_P (outgoing) = 1;
4533 /* The address may be ptr_mode and OUTGOING may be Pmode. */
4534 value_address = convert_memory_address (GET_MODE (outgoing),
4537 emit_move_insn (outgoing, value_address);
4539 /* Show return register used to hold result (in this case the address
4541 current_function_return_rtx = outgoing;
4544 /* If this is an implementation of throw, do what's necessary to
4545 communicate between __builtin_eh_return and the epilogue. */
4546 expand_eh_return ();
4548 /* Emit the actual code to clobber return register. */
4553 clobber_return_register ();
4557 after = emit_insn_after (seq, clobber_after);
4560 /* Output the label for the naked return from the function, if one is
4561 expected. This is currently used only by __builtin_return. */
4562 if (naked_return_label)
4563 emit_label (naked_return_label);
4565 /* ??? This should no longer be necessary since stupid is no longer with
4566 us, but there are some parts of the compiler (eg reload_combine, and
4567 sh mach_dep_reorg) that still try and compute their own lifetime info
4568 instead of using the general framework. */
4569 use_return_register ();
4573 get_arg_pointer_save_area (struct function *f)
4575 rtx ret = f->x_arg_pointer_save_area;
4579 ret = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, f);
4580 f->x_arg_pointer_save_area = ret;
4583 if (f == cfun && ! f->arg_pointer_save_area_init)
4587 /* Save the arg pointer at the beginning of the function. The
4588 generated stack slot may not be a valid memory address, so we
4589 have to check it and fix it if necessary. */
4591 emit_move_insn (validize_mem (ret), virtual_incoming_args_rtx);
4595 push_topmost_sequence ();
4596 emit_insn_after (seq, get_insns ());
4597 pop_topmost_sequence ();
4603 /* Extend a vector that records the INSN_UIDs of INSNS
4604 (a list of one or more insns). */
4607 record_insns (rtx insns, varray_type *vecp)
4614 while (tmp != NULL_RTX)
4617 tmp = NEXT_INSN (tmp);
4620 i = VARRAY_SIZE (*vecp);
4621 VARRAY_GROW (*vecp, i + len);
4623 while (tmp != NULL_RTX)
4625 VARRAY_INT (*vecp, i) = INSN_UID (tmp);
4627 tmp = NEXT_INSN (tmp);
4631 /* Set the locator of the insn chain starting at INSN to LOC. */
4633 set_insn_locators (rtx insn, int loc)
4635 while (insn != NULL_RTX)
4638 INSN_LOCATOR (insn) = loc;
4639 insn = NEXT_INSN (insn);
4643 /* Determine how many INSN_UIDs in VEC are part of INSN. Because we can
4644 be running after reorg, SEQUENCE rtl is possible. */
4647 contains (rtx insn, varray_type vec)
4651 if (NONJUMP_INSN_P (insn)
4652 && GET_CODE (PATTERN (insn)) == SEQUENCE)
4655 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
4656 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
4657 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j))
4663 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
4664 if (INSN_UID (insn) == VARRAY_INT (vec, j))
4671 prologue_epilogue_contains (rtx insn)
4673 if (contains (insn, prologue))
4675 if (contains (insn, epilogue))
4681 sibcall_epilogue_contains (rtx insn)
4683 if (sibcall_epilogue)
4684 return contains (insn, sibcall_epilogue);
4689 /* Insert gen_return at the end of block BB. This also means updating
4690 block_for_insn appropriately. */
4693 emit_return_into_block (basic_block bb, rtx line_note)
4695 emit_jump_insn_after (gen_return (), BB_END (bb));
4697 emit_note_copy_after (line_note, PREV_INSN (BB_END (bb)));
4699 #endif /* HAVE_return */
4701 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
4703 /* These functions convert the epilogue into a variant that does not modify the
4704 stack pointer. This is used in cases where a function returns an object
4705 whose size is not known until it is computed. The called function leaves the
4706 object on the stack, leaves the stack depressed, and returns a pointer to
4709 What we need to do is track all modifications and references to the stack
4710 pointer, deleting the modifications and changing the references to point to
4711 the location the stack pointer would have pointed to had the modifications
4714 These functions need to be portable so we need to make as few assumptions
4715 about the epilogue as we can. However, the epilogue basically contains
4716 three things: instructions to reset the stack pointer, instructions to
4717 reload registers, possibly including the frame pointer, and an
4718 instruction to return to the caller.
4720 If we can't be sure of what a relevant epilogue insn is doing, we abort.
4721 We also make no attempt to validate the insns we make since if they are
4722 invalid, we probably can't do anything valid. The intent is that these
4723 routines get "smarter" as more and more machines start to use them and
4724 they try operating on different epilogues.
4726 We use the following structure to track what the part of the epilogue that
4727 we've already processed has done. We keep two copies of the SP equivalence,
4728 one for use during the insn we are processing and one for use in the next
4729 insn. The difference is because one part of a PARALLEL may adjust SP
4730 and the other may use it. */
4734 rtx sp_equiv_reg; /* REG that SP is set from, perhaps SP. */
4735 HOST_WIDE_INT sp_offset; /* Offset from SP_EQUIV_REG of present SP. */
4736 rtx new_sp_equiv_reg; /* REG to be used at end of insn. */
4737 HOST_WIDE_INT new_sp_offset; /* Offset to be used at end of insn. */
4738 rtx equiv_reg_src; /* If nonzero, the value that SP_EQUIV_REG
4739 should be set to once we no longer need
4741 rtx const_equiv[FIRST_PSEUDO_REGISTER]; /* Any known constant equivalences
4745 static void handle_epilogue_set (rtx, struct epi_info *);
4746 static void update_epilogue_consts (rtx, rtx, void *);
4747 static void emit_equiv_load (struct epi_info *);
4749 /* Modify INSN, a list of one or more insns that is part of the epilogue, to
4750 no modifications to the stack pointer. Return the new list of insns. */
4753 keep_stack_depressed (rtx insns)
4756 struct epi_info info;
4759 /* If the epilogue is just a single instruction, it must be OK as is. */
4760 if (NEXT_INSN (insns) == NULL_RTX)
4763 /* Otherwise, start a sequence, initialize the information we have, and
4764 process all the insns we were given. */
4767 info.sp_equiv_reg = stack_pointer_rtx;
4769 info.equiv_reg_src = 0;
4771 for (j = 0; j < FIRST_PSEUDO_REGISTER; j++)
4772 info.const_equiv[j] = 0;
4776 while (insn != NULL_RTX)
4778 next = NEXT_INSN (insn);
4787 /* If this insn references the register that SP is equivalent to and
4788 we have a pending load to that register, we must force out the load
4789 first and then indicate we no longer know what SP's equivalent is. */
4790 if (info.equiv_reg_src != 0
4791 && reg_referenced_p (info.sp_equiv_reg, PATTERN (insn)))
4793 emit_equiv_load (&info);
4794 info.sp_equiv_reg = 0;
4797 info.new_sp_equiv_reg = info.sp_equiv_reg;
4798 info.new_sp_offset = info.sp_offset;
4800 /* If this is a (RETURN) and the return address is on the stack,
4801 update the address and change to an indirect jump. */
4802 if (GET_CODE (PATTERN (insn)) == RETURN
4803 || (GET_CODE (PATTERN (insn)) == PARALLEL
4804 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
4806 rtx retaddr = INCOMING_RETURN_ADDR_RTX;
4808 HOST_WIDE_INT offset = 0;
4809 rtx jump_insn, jump_set;
4811 /* If the return address is in a register, we can emit the insn
4812 unchanged. Otherwise, it must be a MEM and we see what the
4813 base register and offset are. In any case, we have to emit any
4814 pending load to the equivalent reg of SP, if any. */
4815 if (REG_P (retaddr))
4817 emit_equiv_load (&info);
4822 else if (MEM_P (retaddr)
4823 && REG_P (XEXP (retaddr, 0)))
4824 base = gen_rtx_REG (Pmode, REGNO (XEXP (retaddr, 0))), offset = 0;
4825 else if (MEM_P (retaddr)
4826 && GET_CODE (XEXP (retaddr, 0)) == PLUS
4827 && REG_P (XEXP (XEXP (retaddr, 0), 0))
4828 && GET_CODE (XEXP (XEXP (retaddr, 0), 1)) == CONST_INT)
4830 base = gen_rtx_REG (Pmode, REGNO (XEXP (XEXP (retaddr, 0), 0)));
4831 offset = INTVAL (XEXP (XEXP (retaddr, 0), 1));
4836 /* If the base of the location containing the return pointer
4837 is SP, we must update it with the replacement address. Otherwise,
4838 just build the necessary MEM. */
4839 retaddr = plus_constant (base, offset);
4840 if (base == stack_pointer_rtx)
4841 retaddr = simplify_replace_rtx (retaddr, stack_pointer_rtx,
4842 plus_constant (info.sp_equiv_reg,
4845 retaddr = gen_rtx_MEM (Pmode, retaddr);
4847 /* If there is a pending load to the equivalent register for SP
4848 and we reference that register, we must load our address into
4849 a scratch register and then do that load. */
4850 if (info.equiv_reg_src
4851 && reg_overlap_mentioned_p (info.equiv_reg_src, retaddr))
4856 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
4857 if (HARD_REGNO_MODE_OK (regno, Pmode)
4858 && !fixed_regs[regno]
4859 && TEST_HARD_REG_BIT (regs_invalidated_by_call, regno)
4860 && !REGNO_REG_SET_P (EXIT_BLOCK_PTR->global_live_at_start,
4862 && !refers_to_regno_p (regno,
4863 regno + hard_regno_nregs[regno]
4865 info.equiv_reg_src, NULL)
4866 && info.const_equiv[regno] == 0)
4869 if (regno == FIRST_PSEUDO_REGISTER)
4872 reg = gen_rtx_REG (Pmode, regno);
4873 emit_move_insn (reg, retaddr);
4877 emit_equiv_load (&info);
4878 jump_insn = emit_jump_insn (gen_indirect_jump (retaddr));
4880 /* Show the SET in the above insn is a RETURN. */
4881 jump_set = single_set (jump_insn);
4885 SET_IS_RETURN_P (jump_set) = 1;
4888 /* If SP is not mentioned in the pattern and its equivalent register, if
4889 any, is not modified, just emit it. Otherwise, if neither is set,
4890 replace the reference to SP and emit the insn. If none of those are
4891 true, handle each SET individually. */
4892 else if (!reg_mentioned_p (stack_pointer_rtx, PATTERN (insn))
4893 && (info.sp_equiv_reg == stack_pointer_rtx
4894 || !reg_set_p (info.sp_equiv_reg, insn)))
4896 else if (! reg_set_p (stack_pointer_rtx, insn)
4897 && (info.sp_equiv_reg == stack_pointer_rtx
4898 || !reg_set_p (info.sp_equiv_reg, insn)))
4900 if (! validate_replace_rtx (stack_pointer_rtx,
4901 plus_constant (info.sp_equiv_reg,
4908 else if (GET_CODE (PATTERN (insn)) == SET)
4909 handle_epilogue_set (PATTERN (insn), &info);
4910 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
4912 for (j = 0; j < XVECLEN (PATTERN (insn), 0); j++)
4913 if (GET_CODE (XVECEXP (PATTERN (insn), 0, j)) == SET)
4914 handle_epilogue_set (XVECEXP (PATTERN (insn), 0, j), &info);
4919 info.sp_equiv_reg = info.new_sp_equiv_reg;
4920 info.sp_offset = info.new_sp_offset;
4922 /* Now update any constants this insn sets. */
4923 note_stores (PATTERN (insn), update_epilogue_consts, &info);
4927 insns = get_insns ();
4932 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
4933 structure that contains information about what we've seen so far. We
4934 process this SET by either updating that data or by emitting one or
4938 handle_epilogue_set (rtx set, struct epi_info *p)
4940 /* First handle the case where we are setting SP. Record what it is being
4941 set from. If unknown, abort. */
4942 if (reg_set_p (stack_pointer_rtx, set))
4944 if (SET_DEST (set) != stack_pointer_rtx)
4947 if (GET_CODE (SET_SRC (set)) == PLUS)
4949 p->new_sp_equiv_reg = XEXP (SET_SRC (set), 0);
4950 if (GET_CODE (XEXP (SET_SRC (set), 1)) == CONST_INT)
4951 p->new_sp_offset = INTVAL (XEXP (SET_SRC (set), 1));
4952 else if (REG_P (XEXP (SET_SRC (set), 1))
4953 && REGNO (XEXP (SET_SRC (set), 1)) < FIRST_PSEUDO_REGISTER
4954 && p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))] != 0)
4956 = INTVAL (p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
4961 p->new_sp_equiv_reg = SET_SRC (set), p->new_sp_offset = 0;
4963 /* If we are adjusting SP, we adjust from the old data. */
4964 if (p->new_sp_equiv_reg == stack_pointer_rtx)
4966 p->new_sp_equiv_reg = p->sp_equiv_reg;
4967 p->new_sp_offset += p->sp_offset;
4970 if (p->new_sp_equiv_reg == 0 || !REG_P (p->new_sp_equiv_reg))
4976 /* Next handle the case where we are setting SP's equivalent register.
4977 If we already have a value to set it to, abort. We could update, but
4978 there seems little point in handling that case. Note that we have
4979 to allow for the case where we are setting the register set in
4980 the previous part of a PARALLEL inside a single insn. But use the
4981 old offset for any updates within this insn. We must allow for the case
4982 where the register is being set in a different (usually wider) mode than
4984 else if (p->new_sp_equiv_reg != 0 && reg_set_p (p->new_sp_equiv_reg, set))
4986 if (p->equiv_reg_src != 0
4987 || !REG_P (p->new_sp_equiv_reg)
4988 || !REG_P (SET_DEST (set))
4989 || GET_MODE_BITSIZE (GET_MODE (SET_DEST (set))) > BITS_PER_WORD
4990 || REGNO (p->new_sp_equiv_reg) != REGNO (SET_DEST (set)))
4994 = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
4995 plus_constant (p->sp_equiv_reg,
4999 /* Otherwise, replace any references to SP in the insn to its new value
5000 and emit the insn. */
5003 SET_SRC (set) = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
5004 plus_constant (p->sp_equiv_reg,
5006 SET_DEST (set) = simplify_replace_rtx (SET_DEST (set), stack_pointer_rtx,
5007 plus_constant (p->sp_equiv_reg,
5013 /* Update the tracking information for registers set to constants. */
5016 update_epilogue_consts (rtx dest, rtx x, void *data)
5018 struct epi_info *p = (struct epi_info *) data;
5021 if (!REG_P (dest) || REGNO (dest) >= FIRST_PSEUDO_REGISTER)
5024 /* If we are either clobbering a register or doing a partial set,
5025 show we don't know the value. */
5026 else if (GET_CODE (x) == CLOBBER || ! rtx_equal_p (dest, SET_DEST (x)))
5027 p->const_equiv[REGNO (dest)] = 0;
5029 /* If we are setting it to a constant, record that constant. */
5030 else if (GET_CODE (SET_SRC (x)) == CONST_INT)
5031 p->const_equiv[REGNO (dest)] = SET_SRC (x);
5033 /* If this is a binary operation between a register we have been tracking
5034 and a constant, see if we can compute a new constant value. */
5035 else if (ARITHMETIC_P (SET_SRC (x))
5036 && REG_P (XEXP (SET_SRC (x), 0))
5037 && REGNO (XEXP (SET_SRC (x), 0)) < FIRST_PSEUDO_REGISTER
5038 && p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))] != 0
5039 && GET_CODE (XEXP (SET_SRC (x), 1)) == CONST_INT
5040 && 0 != (new = simplify_binary_operation
5041 (GET_CODE (SET_SRC (x)), GET_MODE (dest),
5042 p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))],
5043 XEXP (SET_SRC (x), 1)))
5044 && GET_CODE (new) == CONST_INT)
5045 p->const_equiv[REGNO (dest)] = new;
5047 /* Otherwise, we can't do anything with this value. */
5049 p->const_equiv[REGNO (dest)] = 0;
5052 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
5055 emit_equiv_load (struct epi_info *p)
5057 if (p->equiv_reg_src != 0)
5059 rtx dest = p->sp_equiv_reg;
5061 if (GET_MODE (p->equiv_reg_src) != GET_MODE (dest))
5062 dest = gen_rtx_REG (GET_MODE (p->equiv_reg_src),
5063 REGNO (p->sp_equiv_reg));
5065 emit_move_insn (dest, p->equiv_reg_src);
5066 p->equiv_reg_src = 0;
5071 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
5072 this into place with notes indicating where the prologue ends and where
5073 the epilogue begins. Update the basic block information when possible. */
5076 thread_prologue_and_epilogue_insns (rtx f ATTRIBUTE_UNUSED)
5080 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
5083 #ifdef HAVE_prologue
5084 rtx prologue_end = NULL_RTX;
5086 #if defined (HAVE_epilogue) || defined(HAVE_return)
5087 rtx epilogue_end = NULL_RTX;
5090 #ifdef HAVE_prologue
5094 seq = gen_prologue ();
5097 /* Retain a map of the prologue insns. */
5098 record_insns (seq, &prologue);
5099 prologue_end = emit_note (NOTE_INSN_PROLOGUE_END);
5103 set_insn_locators (seq, prologue_locator);
5105 /* Can't deal with multiple successors of the entry block
5106 at the moment. Function should always have at least one
5108 if (!ENTRY_BLOCK_PTR->succ || ENTRY_BLOCK_PTR->succ->succ_next)
5111 insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ);
5116 /* If the exit block has no non-fake predecessors, we don't need
5118 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5119 if ((e->flags & EDGE_FAKE) == 0)
5125 if (optimize && HAVE_return)
5127 /* If we're allowed to generate a simple return instruction,
5128 then by definition we don't need a full epilogue. Examine
5129 the block that falls through to EXIT. If it does not
5130 contain any code, examine its predecessors and try to
5131 emit (conditional) return instructions. */
5137 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5138 if (e->flags & EDGE_FALLTHRU)
5144 /* Verify that there are no active instructions in the last block. */
5145 label = BB_END (last);
5146 while (label && !LABEL_P (label))
5148 if (active_insn_p (label))
5150 label = PREV_INSN (label);
5153 if (BB_HEAD (last) == label && LABEL_P (label))
5155 rtx epilogue_line_note = NULL_RTX;
5157 /* Locate the line number associated with the closing brace,
5158 if we can find one. */
5159 for (seq = get_last_insn ();
5160 seq && ! active_insn_p (seq);
5161 seq = PREV_INSN (seq))
5162 if (NOTE_P (seq) && NOTE_LINE_NUMBER (seq) > 0)
5164 epilogue_line_note = seq;
5168 for (e = last->pred; e; e = e_next)
5170 basic_block bb = e->src;
5173 e_next = e->pred_next;
5174 if (bb == ENTRY_BLOCK_PTR)
5178 if (!JUMP_P (jump) || JUMP_LABEL (jump) != label)
5181 /* If we have an unconditional jump, we can replace that
5182 with a simple return instruction. */
5183 if (simplejump_p (jump))
5185 emit_return_into_block (bb, epilogue_line_note);
5189 /* If we have a conditional jump, we can try to replace
5190 that with a conditional return instruction. */
5191 else if (condjump_p (jump))
5193 if (! redirect_jump (jump, 0, 0))
5196 /* If this block has only one successor, it both jumps
5197 and falls through to the fallthru block, so we can't
5199 if (bb->succ->succ_next == NULL)
5205 /* Fix up the CFG for the successful change we just made. */
5206 redirect_edge_succ (e, EXIT_BLOCK_PTR);
5209 /* Emit a return insn for the exit fallthru block. Whether
5210 this is still reachable will be determined later. */
5212 emit_barrier_after (BB_END (last));
5213 emit_return_into_block (last, epilogue_line_note);
5214 epilogue_end = BB_END (last);
5215 last->succ->flags &= ~EDGE_FALLTHRU;
5220 /* Find the edge that falls through to EXIT. Other edges may exist
5221 due to RETURN instructions, but those don't need epilogues.
5222 There really shouldn't be a mixture -- either all should have
5223 been converted or none, however... */
5225 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5226 if (e->flags & EDGE_FALLTHRU)
5231 #ifdef HAVE_epilogue
5235 epilogue_end = emit_note (NOTE_INSN_EPILOGUE_BEG);
5237 seq = gen_epilogue ();
5239 #ifdef INCOMING_RETURN_ADDR_RTX
5240 /* If this function returns with the stack depressed and we can support
5241 it, massage the epilogue to actually do that. */
5242 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
5243 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
5244 seq = keep_stack_depressed (seq);
5247 emit_jump_insn (seq);
5249 /* Retain a map of the epilogue insns. */
5250 record_insns (seq, &epilogue);
5251 set_insn_locators (seq, epilogue_locator);
5256 insert_insn_on_edge (seq, e);
5264 if (! next_active_insn (BB_END (e->src)))
5266 /* We have a fall-through edge to the exit block, the source is not
5267 at the end of the function, and there will be an assembler epilogue
5268 at the end of the function.
5269 We can't use force_nonfallthru here, because that would try to
5270 use return. Inserting a jump 'by hand' is extremely messy, so
5271 we take advantage of cfg_layout_finalize using
5272 fixup_fallthru_exit_predecessor. */
5273 cfg_layout_initialize ();
5274 FOR_EACH_BB (cur_bb)
5275 if (cur_bb->index >= 0 && cur_bb->next_bb->index >= 0)
5276 cur_bb->rbi->next = cur_bb->next_bb;
5277 cfg_layout_finalize ();
5282 commit_edge_insertions ();
5284 #ifdef HAVE_sibcall_epilogue
5285 /* Emit sibling epilogues before any sibling call sites. */
5286 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5288 basic_block bb = e->src;
5289 rtx insn = BB_END (bb);
5294 || ! SIBLING_CALL_P (insn))
5298 emit_insn (gen_sibcall_epilogue ());
5302 /* Retain a map of the epilogue insns. Used in life analysis to
5303 avoid getting rid of sibcall epilogue insns. Do this before we
5304 actually emit the sequence. */
5305 record_insns (seq, &sibcall_epilogue);
5306 set_insn_locators (seq, epilogue_locator);
5308 i = PREV_INSN (insn);
5309 newinsn = emit_insn_before (seq, insn);
5313 #ifdef HAVE_prologue
5314 /* This is probably all useless now that we use locators. */
5319 /* GDB handles `break f' by setting a breakpoint on the first
5320 line note after the prologue. Which means (1) that if
5321 there are line number notes before where we inserted the
5322 prologue we should move them, and (2) we should generate a
5323 note before the end of the first basic block, if there isn't
5326 ??? This behavior is completely broken when dealing with
5327 multiple entry functions. We simply place the note always
5328 into first basic block and let alternate entry points
5332 for (insn = prologue_end; insn; insn = prev)
5334 prev = PREV_INSN (insn);
5335 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5337 /* Note that we cannot reorder the first insn in the
5338 chain, since rest_of_compilation relies on that
5339 remaining constant. */
5342 reorder_insns (insn, insn, prologue_end);
5346 /* Find the last line number note in the first block. */
5347 for (insn = BB_END (ENTRY_BLOCK_PTR->next_bb);
5348 insn != prologue_end && insn;
5349 insn = PREV_INSN (insn))
5350 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5353 /* If we didn't find one, make a copy of the first line number
5357 for (insn = next_active_insn (prologue_end);
5359 insn = PREV_INSN (insn))
5360 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5362 emit_note_copy_after (insn, prologue_end);
5368 #ifdef HAVE_epilogue
5373 /* Similarly, move any line notes that appear after the epilogue.
5374 There is no need, however, to be quite so anal about the existence
5375 of such a note. Also move the NOTE_INSN_FUNCTION_END and (possibly)
5376 NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
5378 for (insn = epilogue_end; insn; insn = next)
5380 next = NEXT_INSN (insn);
5382 && (NOTE_LINE_NUMBER (insn) > 0
5383 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG
5384 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_END))
5385 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
5391 /* Reposition the prologue-end and epilogue-begin notes after instruction
5392 scheduling and delayed branch scheduling. */
5395 reposition_prologue_and_epilogue_notes (rtx f ATTRIBUTE_UNUSED)
5397 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
5398 rtx insn, last, note;
5401 if ((len = VARRAY_SIZE (prologue)) > 0)
5405 /* Scan from the beginning until we reach the last prologue insn.
5406 We apparently can't depend on basic_block_{head,end} after
5408 for (insn = f; insn; insn = NEXT_INSN (insn))
5412 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
5415 else if (contains (insn, prologue))
5425 /* Find the prologue-end note if we haven't already, and
5426 move it to just after the last prologue insn. */
5429 for (note = last; (note = NEXT_INSN (note));)
5431 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
5435 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
5437 last = NEXT_INSN (last);
5438 reorder_insns (note, note, last);
5442 if ((len = VARRAY_SIZE (epilogue)) > 0)
5446 /* Scan from the end until we reach the first epilogue insn.
5447 We apparently can't depend on basic_block_{head,end} after
5449 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
5453 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
5456 else if (contains (insn, epilogue))
5466 /* Find the epilogue-begin note if we haven't already, and
5467 move it to just before the first epilogue insn. */
5470 for (note = insn; (note = PREV_INSN (note));)
5472 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
5476 if (PREV_INSN (last) != note)
5477 reorder_insns (note, note, PREV_INSN (last));
5480 #endif /* HAVE_prologue or HAVE_epilogue */
5483 /* Called once, at initialization, to initialize function.c. */
5486 init_function_once (void)
5488 VARRAY_INT_INIT (prologue, 0, "prologue");
5489 VARRAY_INT_INIT (epilogue, 0, "epilogue");
5490 VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue");
5493 /* Resets insn_block_boundaries array. */
5496 reset_block_changes (void)
5498 VARRAY_TREE_INIT (cfun->ib_boundaries_block, 100, "ib_boundaries_block");
5499 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, NULL_TREE);
5502 /* Record the boundary for BLOCK. */
5504 record_block_change (tree block)
5512 last_block = VARRAY_TOP_TREE (cfun->ib_boundaries_block);
5513 VARRAY_POP (cfun->ib_boundaries_block);
5515 for (i = VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block); i < n; i++)
5516 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, last_block);
5518 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, block);
5521 /* Finishes record of boundaries. */
5522 void finalize_block_changes (void)
5524 record_block_change (DECL_INITIAL (current_function_decl));
5527 /* For INSN return the BLOCK it belongs to. */
5529 check_block_change (rtx insn, tree *block)
5531 unsigned uid = INSN_UID (insn);
5533 if (uid >= VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block))
5536 *block = VARRAY_TREE (cfun->ib_boundaries_block, uid);
5539 /* Releases the ib_boundaries_block records. */
5541 free_block_changes (void)
5543 cfun->ib_boundaries_block = NULL;
5546 /* Returns the name of the current function. */
5548 current_function_name (void)
5550 return lang_hooks.decl_printable_name (cfun->decl, 2);
5553 #include "gt-function.h"