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 /* Nonzero if function being compiled doesn't contain any calls
91 (ignoring the prologue and epilogue). This is set prior to
92 local register allocation and is valid for the remaining
94 int current_function_is_leaf;
96 /* Nonzero if function being compiled doesn't modify the stack pointer
97 (ignoring the prologue and epilogue). This is only valid after
98 life_analysis has run. */
99 int current_function_sp_is_unchanging;
101 /* Nonzero if the function being compiled is a leaf function which only
102 uses leaf registers. This is valid after reload (specifically after
103 sched2) and is useful only if the port defines LEAF_REGISTERS. */
104 int current_function_uses_only_leaf_regs;
106 /* Nonzero once virtual register instantiation has been done.
107 assign_stack_local uses frame_pointer_rtx when this is nonzero.
108 calls.c:emit_library_call_value_1 uses it to set up
109 post-instantiation libcalls. */
110 int virtuals_instantiated;
112 /* Assign unique numbers to labels generated for profiling, debugging, etc. */
113 static GTY(()) int funcdef_no;
115 /* These variables hold pointers to functions to create and destroy
116 target specific, per-function data structures. */
117 struct machine_function * (*init_machine_status) (void);
119 /* The currently compiled function. */
120 struct function *cfun = 0;
122 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
123 static GTY(()) varray_type prologue;
124 static GTY(()) varray_type epilogue;
126 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
128 static GTY(()) varray_type sibcall_epilogue;
130 /* In order to evaluate some expressions, such as function calls returning
131 structures in memory, we need to temporarily allocate stack locations.
132 We record each allocated temporary in the following structure.
134 Associated with each temporary slot is a nesting level. When we pop up
135 one level, all temporaries associated with the previous level are freed.
136 Normally, all temporaries are freed after the execution of the statement
137 in which they were created. However, if we are inside a ({...}) grouping,
138 the result may be in a temporary and hence must be preserved. If the
139 result could be in a temporary, we preserve it if we can determine which
140 one it is in. If we cannot determine which temporary may contain the
141 result, all temporaries are preserved. A temporary is preserved by
142 pretending it was allocated at the previous nesting level.
144 Automatic variables are also assigned temporary slots, at the nesting
145 level where they are defined. They are marked a "kept" so that
146 free_temp_slots will not free them. */
148 struct temp_slot GTY(())
150 /* Points to next temporary slot. */
151 struct temp_slot *next;
152 /* Points to previous temporary slot. */
153 struct temp_slot *prev;
155 /* The rtx to used to reference the slot. */
157 /* The rtx used to represent the address if not the address of the
158 slot above. May be an EXPR_LIST if multiple addresses exist. */
160 /* The alignment (in bits) of the slot. */
162 /* The size, in units, of the slot. */
164 /* The type of the object in the slot, or zero if it doesn't correspond
165 to a type. We use this to determine whether a slot can be reused.
166 It can be reused if objects of the type of the new slot will always
167 conflict with objects of the type of the old slot. */
169 /* Nonzero if this temporary is currently in use. */
171 /* Nonzero if this temporary has its address taken. */
173 /* Nesting level at which this slot is being used. */
175 /* Nonzero if this should survive a call to free_temp_slots. */
177 /* The offset of the slot from the frame_pointer, including extra space
178 for alignment. This info is for combine_temp_slots. */
179 HOST_WIDE_INT base_offset;
180 /* The size of the slot, including extra space for alignment. This
181 info is for combine_temp_slots. */
182 HOST_WIDE_INT full_size;
185 /* Forward declarations. */
187 static rtx assign_stack_local_1 (enum machine_mode, HOST_WIDE_INT, int,
189 static struct temp_slot *find_temp_slot_from_address (rtx);
190 static void instantiate_decls (tree, int);
191 static void instantiate_decls_1 (tree, int);
192 static void instantiate_decl (rtx, HOST_WIDE_INT, int);
193 static rtx instantiate_new_reg (rtx, HOST_WIDE_INT *);
194 static int instantiate_virtual_regs_1 (rtx *, rtx, int);
195 static void pad_to_arg_alignment (struct args_size *, int, struct args_size *);
196 static void pad_below (struct args_size *, enum machine_mode, tree);
197 static void reorder_blocks_1 (rtx, tree, varray_type *);
198 static void reorder_fix_fragments (tree);
199 static int all_blocks (tree, tree *);
200 static tree *get_block_vector (tree, int *);
201 extern tree debug_find_var_in_block_tree (tree, tree);
202 /* We always define `record_insns' even if it's not used so that we
203 can always export `prologue_epilogue_contains'. */
204 static void record_insns (rtx, varray_type *) ATTRIBUTE_UNUSED;
205 static int contains (rtx, varray_type);
207 static void emit_return_into_block (basic_block, rtx);
209 static void purge_single_hard_subreg_set (rtx);
210 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
211 static rtx keep_stack_depressed (rtx);
213 static void prepare_function_start (tree);
214 static void do_clobber_return_reg (rtx, void *);
215 static void do_use_return_reg (rtx, void *);
216 static void instantiate_virtual_regs_lossage (rtx);
217 static void set_insn_locators (rtx, int) ATTRIBUTE_UNUSED;
219 /* Pointer to chain of `struct function' for containing functions. */
220 struct function *outer_function_chain;
222 /* Given a function decl for a containing function,
223 return the `struct function' for it. */
226 find_function_data (tree decl)
230 for (p = outer_function_chain; p; p = p->outer)
237 /* Save the current context for compilation of a nested function.
238 This is called from language-specific code. The caller should use
239 the enter_nested langhook to save any language-specific state,
240 since this function knows only about language-independent
244 push_function_context_to (tree context)
250 if (context == current_function_decl)
251 cfun->contains_functions = 1;
254 struct function *containing = find_function_data (context);
255 containing->contains_functions = 1;
260 init_dummy_function_start ();
263 p->outer = outer_function_chain;
264 outer_function_chain = p;
266 lang_hooks.function.enter_nested (p);
272 push_function_context (void)
274 push_function_context_to (current_function_decl);
277 /* Restore the last saved context, at the end of a nested function.
278 This function is called from language-specific code. */
281 pop_function_context_from (tree context ATTRIBUTE_UNUSED)
283 struct function *p = outer_function_chain;
286 outer_function_chain = p->outer;
288 current_function_decl = p->decl;
291 restore_emit_status (p);
293 lang_hooks.function.leave_nested (p);
295 /* Reset variables that have known state during rtx generation. */
296 rtx_equal_function_value_matters = 1;
297 virtuals_instantiated = 0;
298 generating_concat_p = 1;
302 pop_function_context (void)
304 pop_function_context_from (current_function_decl);
307 /* Clear out all parts of the state in F that can safely be discarded
308 after the function has been parsed, but not compiled, to let
309 garbage collection reclaim the memory. */
312 free_after_parsing (struct function *f)
314 /* f->expr->forced_labels is used by code generation. */
315 /* f->emit->regno_reg_rtx is used by code generation. */
316 /* f->varasm is used by code generation. */
317 /* f->eh->eh_return_stub_label is used by code generation. */
319 lang_hooks.function.final (f);
323 /* Clear out all parts of the state in F that can safely be discarded
324 after the function has been compiled, to let garbage collection
325 reclaim the memory. */
328 free_after_compilation (struct function *f)
336 f->x_avail_temp_slots = NULL;
337 f->x_used_temp_slots = NULL;
338 f->arg_offset_rtx = NULL;
339 f->return_rtx = NULL;
340 f->internal_arg_pointer = NULL;
341 f->x_nonlocal_goto_handler_labels = NULL;
342 f->x_return_label = NULL;
343 f->x_naked_return_label = NULL;
344 f->x_stack_slot_list = NULL;
345 f->x_tail_recursion_reentry = NULL;
346 f->x_arg_pointer_save_area = NULL;
347 f->x_parm_birth_insn = NULL;
348 f->original_arg_vector = NULL;
349 f->original_decl_initial = NULL;
350 f->epilogue_delay_list = NULL;
353 /* Allocate fixed slots in the stack frame of the current function. */
355 /* Return size needed for stack frame based on slots so far allocated in
357 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
358 the caller may have to do that. */
361 get_func_frame_size (struct function *f)
363 #ifdef FRAME_GROWS_DOWNWARD
364 return -f->x_frame_offset;
366 return f->x_frame_offset;
370 /* Return size needed for stack frame based on slots so far allocated.
371 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
372 the caller may have to do that. */
374 get_frame_size (void)
376 return get_func_frame_size (cfun);
379 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
380 with machine mode MODE.
382 ALIGN controls the amount of alignment for the address of the slot:
383 0 means according to MODE,
384 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
385 -2 means use BITS_PER_UNIT,
386 positive specifies alignment boundary in bits.
388 We do not round to stack_boundary here.
390 FUNCTION specifies the function to allocate in. */
393 assign_stack_local_1 (enum machine_mode mode, HOST_WIDE_INT size, int align,
394 struct function *function)
397 int bigend_correction = 0;
399 int frame_off, frame_alignment, frame_phase;
406 alignment = BIGGEST_ALIGNMENT;
408 alignment = GET_MODE_ALIGNMENT (mode);
410 /* Allow the target to (possibly) increase the alignment of this
412 type = lang_hooks.types.type_for_mode (mode, 0);
414 alignment = LOCAL_ALIGNMENT (type, alignment);
416 alignment /= BITS_PER_UNIT;
418 else if (align == -1)
420 alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
421 size = CEIL_ROUND (size, alignment);
423 else if (align == -2)
424 alignment = 1; /* BITS_PER_UNIT / BITS_PER_UNIT */
426 alignment = align / BITS_PER_UNIT;
428 #ifdef FRAME_GROWS_DOWNWARD
429 function->x_frame_offset -= size;
432 /* Ignore alignment we can't do with expected alignment of the boundary. */
433 if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY)
434 alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
436 if (function->stack_alignment_needed < alignment * BITS_PER_UNIT)
437 function->stack_alignment_needed = alignment * BITS_PER_UNIT;
439 /* Calculate how many bytes the start of local variables is off from
441 frame_alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
442 frame_off = STARTING_FRAME_OFFSET % frame_alignment;
443 frame_phase = frame_off ? frame_alignment - frame_off : 0;
445 /* Round the frame offset to the specified alignment. The default is
446 to always honor requests to align the stack but a port may choose to
447 do its own stack alignment by defining STACK_ALIGNMENT_NEEDED. */
448 if (STACK_ALIGNMENT_NEEDED
452 /* We must be careful here, since FRAME_OFFSET might be negative and
453 division with a negative dividend isn't as well defined as we might
454 like. So we instead assume that ALIGNMENT is a power of two and
455 use logical operations which are unambiguous. */
456 #ifdef FRAME_GROWS_DOWNWARD
457 function->x_frame_offset
458 = (FLOOR_ROUND (function->x_frame_offset - frame_phase, alignment)
461 function->x_frame_offset
462 = (CEIL_ROUND (function->x_frame_offset - frame_phase, alignment)
467 /* On a big-endian machine, if we are allocating more space than we will use,
468 use the least significant bytes of those that are allocated. */
469 if (BYTES_BIG_ENDIAN && mode != BLKmode)
470 bigend_correction = size - GET_MODE_SIZE (mode);
472 /* If we have already instantiated virtual registers, return the actual
473 address relative to the frame pointer. */
474 if (function == cfun && virtuals_instantiated)
475 addr = plus_constant (frame_pointer_rtx,
477 (frame_offset + bigend_correction
478 + STARTING_FRAME_OFFSET, Pmode));
480 addr = plus_constant (virtual_stack_vars_rtx,
482 (function->x_frame_offset + bigend_correction,
485 #ifndef FRAME_GROWS_DOWNWARD
486 function->x_frame_offset += size;
489 x = gen_rtx_MEM (mode, addr);
491 function->x_stack_slot_list
492 = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list);
497 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
501 assign_stack_local (enum machine_mode mode, HOST_WIDE_INT size, int align)
503 return assign_stack_local_1 (mode, size, align, cfun);
507 /* Removes temporary slot TEMP from LIST. */
510 cut_slot_from_list (struct temp_slot *temp, struct temp_slot **list)
513 temp->next->prev = temp->prev;
515 temp->prev->next = temp->next;
519 temp->prev = temp->next = NULL;
522 /* Inserts temporary slot TEMP to LIST. */
525 insert_slot_to_list (struct temp_slot *temp, struct temp_slot **list)
529 (*list)->prev = temp;
534 /* Returns the list of used temp slots at LEVEL. */
536 static struct temp_slot **
537 temp_slots_at_level (int level)
541 if (!used_temp_slots)
542 VARRAY_GENERIC_PTR_INIT (used_temp_slots, 3, "used_temp_slots");
544 while (level >= (int) VARRAY_ACTIVE_SIZE (used_temp_slots))
545 VARRAY_PUSH_GENERIC_PTR (used_temp_slots, NULL);
547 return (struct temp_slot **) &VARRAY_GENERIC_PTR (used_temp_slots, level);
550 /* Returns the maximal temporary slot level. */
553 max_slot_level (void)
555 if (!used_temp_slots)
558 return VARRAY_ACTIVE_SIZE (used_temp_slots) - 1;
561 /* Moves temporary slot TEMP to LEVEL. */
564 move_slot_to_level (struct temp_slot *temp, int level)
566 cut_slot_from_list (temp, temp_slots_at_level (temp->level));
567 insert_slot_to_list (temp, temp_slots_at_level (level));
571 /* Make temporary slot TEMP available. */
574 make_slot_available (struct temp_slot *temp)
576 cut_slot_from_list (temp, temp_slots_at_level (temp->level));
577 insert_slot_to_list (temp, &avail_temp_slots);
582 /* Allocate a temporary stack slot and record it for possible later
585 MODE is the machine mode to be given to the returned rtx.
587 SIZE is the size in units of the space required. We do no rounding here
588 since assign_stack_local will do any required rounding.
590 KEEP is 1 if this slot is to be retained after a call to
591 free_temp_slots. Automatic variables for a block are allocated
592 with this flag. KEEP is 2 if we allocate a longer term temporary,
593 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
594 if we are to allocate something at an inner level to be treated as
595 a variable in the block (e.g., a SAVE_EXPR).
597 TYPE is the type that will be used for the stack slot. */
600 assign_stack_temp_for_type (enum machine_mode mode, HOST_WIDE_INT size, int keep,
604 struct temp_slot *p, *best_p = 0, *selected = NULL, **pp;
607 /* If SIZE is -1 it means that somebody tried to allocate a temporary
608 of a variable size. */
613 align = BIGGEST_ALIGNMENT;
615 align = GET_MODE_ALIGNMENT (mode);
618 type = lang_hooks.types.type_for_mode (mode, 0);
621 align = LOCAL_ALIGNMENT (type, align);
623 /* Try to find an available, already-allocated temporary of the proper
624 mode which meets the size and alignment requirements. Choose the
625 smallest one with the closest alignment. */
626 for (p = avail_temp_slots; p; p = p->next)
628 if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode
629 && objects_must_conflict_p (p->type, type)
630 && (best_p == 0 || best_p->size > p->size
631 || (best_p->size == p->size && best_p->align > p->align)))
633 if (p->align == align && p->size == size)
636 cut_slot_from_list (selected, &avail_temp_slots);
644 /* Make our best, if any, the one to use. */
648 cut_slot_from_list (selected, &avail_temp_slots);
650 /* If there are enough aligned bytes left over, make them into a new
651 temp_slot so that the extra bytes don't get wasted. Do this only
652 for BLKmode slots, so that we can be sure of the alignment. */
653 if (GET_MODE (best_p->slot) == BLKmode)
655 int alignment = best_p->align / BITS_PER_UNIT;
656 HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment);
658 if (best_p->size - rounded_size >= alignment)
660 p = ggc_alloc (sizeof (struct temp_slot));
661 p->in_use = p->addr_taken = 0;
662 p->size = best_p->size - rounded_size;
663 p->base_offset = best_p->base_offset + rounded_size;
664 p->full_size = best_p->full_size - rounded_size;
665 p->slot = gen_rtx_MEM (BLKmode,
666 plus_constant (XEXP (best_p->slot, 0),
668 p->align = best_p->align;
670 p->type = best_p->type;
671 insert_slot_to_list (p, &avail_temp_slots);
673 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot,
676 best_p->size = rounded_size;
677 best_p->full_size = rounded_size;
682 /* If we still didn't find one, make a new temporary. */
685 HOST_WIDE_INT frame_offset_old = frame_offset;
687 p = ggc_alloc (sizeof (struct temp_slot));
689 /* We are passing an explicit alignment request to assign_stack_local.
690 One side effect of that is assign_stack_local will not round SIZE
691 to ensure the frame offset remains suitably aligned.
693 So for requests which depended on the rounding of SIZE, we go ahead
694 and round it now. We also make sure ALIGNMENT is at least
695 BIGGEST_ALIGNMENT. */
696 if (mode == BLKmode && align < BIGGEST_ALIGNMENT)
698 p->slot = assign_stack_local (mode,
700 ? CEIL_ROUND (size, (int) align / BITS_PER_UNIT)
706 /* The following slot size computation is necessary because we don't
707 know the actual size of the temporary slot until assign_stack_local
708 has performed all the frame alignment and size rounding for the
709 requested temporary. Note that extra space added for alignment
710 can be either above or below this stack slot depending on which
711 way the frame grows. We include the extra space if and only if it
712 is above this slot. */
713 #ifdef FRAME_GROWS_DOWNWARD
714 p->size = frame_offset_old - frame_offset;
719 /* Now define the fields used by combine_temp_slots. */
720 #ifdef FRAME_GROWS_DOWNWARD
721 p->base_offset = frame_offset;
722 p->full_size = frame_offset_old - frame_offset;
724 p->base_offset = frame_offset_old;
725 p->full_size = frame_offset - frame_offset_old;
739 p->level = target_temp_slot_level;
744 p->level = var_temp_slot_level;
749 p->level = temp_slot_level;
753 pp = temp_slots_at_level (p->level);
754 insert_slot_to_list (p, pp);
756 /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
757 slot = gen_rtx_MEM (mode, XEXP (p->slot, 0));
758 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, slot, stack_slot_list);
760 /* If we know the alias set for the memory that will be used, use
761 it. If there's no TYPE, then we don't know anything about the
762 alias set for the memory. */
763 set_mem_alias_set (slot, type ? get_alias_set (type) : 0);
764 set_mem_align (slot, align);
766 /* If a type is specified, set the relevant flags. */
769 RTX_UNCHANGING_P (slot) = (lang_hooks.honor_readonly
770 && TYPE_READONLY (type));
771 MEM_VOLATILE_P (slot) = TYPE_VOLATILE (type);
772 MEM_SET_IN_STRUCT_P (slot, AGGREGATE_TYPE_P (type));
778 /* Allocate a temporary stack slot and record it for possible later
779 reuse. First three arguments are same as in preceding function. */
782 assign_stack_temp (enum machine_mode mode, HOST_WIDE_INT size, int keep)
784 return assign_stack_temp_for_type (mode, size, keep, NULL_TREE);
787 /* Assign a temporary.
788 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
789 and so that should be used in error messages. In either case, we
790 allocate of the given type.
791 KEEP is as for assign_stack_temp.
792 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
793 it is 0 if a register is OK.
794 DONT_PROMOTE is 1 if we should not promote values in register
798 assign_temp (tree type_or_decl, int keep, int memory_required,
799 int dont_promote ATTRIBUTE_UNUSED)
802 enum machine_mode mode;
807 if (DECL_P (type_or_decl))
808 decl = type_or_decl, type = TREE_TYPE (decl);
810 decl = NULL, type = type_or_decl;
812 mode = TYPE_MODE (type);
814 unsignedp = TYPE_UNSIGNED (type);
817 if (mode == BLKmode || memory_required)
819 HOST_WIDE_INT size = int_size_in_bytes (type);
823 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
824 problems with allocating the stack space. */
828 /* Unfortunately, we don't yet know how to allocate variable-sized
829 temporaries. However, sometimes we have a fixed upper limit on
830 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
831 instead. This is the case for Chill variable-sized strings. */
832 if (size == -1 && TREE_CODE (type) == ARRAY_TYPE
833 && TYPE_ARRAY_MAX_SIZE (type) != NULL_TREE
834 && host_integerp (TYPE_ARRAY_MAX_SIZE (type), 1))
835 size = tree_low_cst (TYPE_ARRAY_MAX_SIZE (type), 1);
837 /* If we still haven't been able to get a size, see if the language
838 can compute a maximum size. */
840 && (size_tree = lang_hooks.types.max_size (type)) != 0
841 && host_integerp (size_tree, 1))
842 size = tree_low_cst (size_tree, 1);
844 /* The size of the temporary may be too large to fit into an integer. */
845 /* ??? Not sure this should happen except for user silliness, so limit
846 this to things that aren't compiler-generated temporaries. The
847 rest of the time we'll abort in assign_stack_temp_for_type. */
848 if (decl && size == -1
849 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST)
851 error ("%Jsize of variable '%D' is too large", decl, decl);
855 tmp = assign_stack_temp_for_type (mode, size, keep, type);
861 mode = promote_mode (type, mode, &unsignedp, 0);
864 return gen_reg_rtx (mode);
867 /* Combine temporary stack slots which are adjacent on the stack.
869 This allows for better use of already allocated stack space. This is only
870 done for BLKmode slots because we can be sure that we won't have alignment
871 problems in this case. */
874 combine_temp_slots (void)
876 struct temp_slot *p, *q, *next, *next_q;
879 /* We can't combine slots, because the information about which slot
880 is in which alias set will be lost. */
881 if (flag_strict_aliasing)
884 /* If there are a lot of temp slots, don't do anything unless
885 high levels of optimization. */
886 if (! flag_expensive_optimizations)
887 for (p = avail_temp_slots, num_slots = 0; p; p = p->next, num_slots++)
888 if (num_slots > 100 || (num_slots > 10 && optimize == 0))
891 for (p = avail_temp_slots; p; p = next)
897 if (GET_MODE (p->slot) != BLKmode)
900 for (q = p->next; q; q = next_q)
906 if (GET_MODE (q->slot) != BLKmode)
909 if (p->base_offset + p->full_size == q->base_offset)
911 /* Q comes after P; combine Q into P. */
913 p->full_size += q->full_size;
916 else if (q->base_offset + q->full_size == p->base_offset)
918 /* P comes after Q; combine P into Q. */
920 q->full_size += p->full_size;
925 cut_slot_from_list (q, &avail_temp_slots);
928 /* Either delete P or advance past it. */
930 cut_slot_from_list (p, &avail_temp_slots);
934 /* Find the temp slot corresponding to the object at address X. */
936 static struct temp_slot *
937 find_temp_slot_from_address (rtx x)
943 for (i = max_slot_level (); i >= 0; i--)
944 for (p = *temp_slots_at_level (i); p; p = p->next)
946 if (XEXP (p->slot, 0) == x
948 || (GET_CODE (x) == PLUS
949 && XEXP (x, 0) == virtual_stack_vars_rtx
950 && GET_CODE (XEXP (x, 1)) == CONST_INT
951 && INTVAL (XEXP (x, 1)) >= p->base_offset
952 && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size))
955 else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST)
956 for (next = p->address; next; next = XEXP (next, 1))
957 if (XEXP (next, 0) == x)
961 /* If we have a sum involving a register, see if it points to a temp
963 if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 0))
964 && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
966 else if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 1))
967 && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
973 /* Indicate that NEW is an alternate way of referring to the temp slot
974 that previously was known by OLD. */
977 update_temp_slot_address (rtx old, rtx new)
981 if (rtx_equal_p (old, new))
984 p = find_temp_slot_from_address (old);
986 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
987 is a register, see if one operand of the PLUS is a temporary
988 location. If so, NEW points into it. Otherwise, if both OLD and
989 NEW are a PLUS and if there is a register in common between them.
990 If so, try a recursive call on those values. */
993 if (GET_CODE (old) != PLUS)
998 update_temp_slot_address (XEXP (old, 0), new);
999 update_temp_slot_address (XEXP (old, 1), new);
1002 else if (GET_CODE (new) != PLUS)
1005 if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0)))
1006 update_temp_slot_address (XEXP (old, 1), XEXP (new, 1));
1007 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0)))
1008 update_temp_slot_address (XEXP (old, 0), XEXP (new, 1));
1009 else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1)))
1010 update_temp_slot_address (XEXP (old, 1), XEXP (new, 0));
1011 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1)))
1012 update_temp_slot_address (XEXP (old, 0), XEXP (new, 0));
1017 /* Otherwise add an alias for the temp's address. */
1018 else if (p->address == 0)
1022 if (GET_CODE (p->address) != EXPR_LIST)
1023 p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX);
1025 p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address);
1029 /* If X could be a reference to a temporary slot, mark the fact that its
1030 address was taken. */
1033 mark_temp_addr_taken (rtx x)
1035 struct temp_slot *p;
1040 /* If X is not in memory or is at a constant address, it cannot be in
1041 a temporary slot. */
1042 if (!MEM_P (x) || CONSTANT_P (XEXP (x, 0)))
1045 p = find_temp_slot_from_address (XEXP (x, 0));
1050 /* If X could be a reference to a temporary slot, mark that slot as
1051 belonging to the to one level higher than the current level. If X
1052 matched one of our slots, just mark that one. Otherwise, we can't
1053 easily predict which it is, so upgrade all of them. Kept slots
1054 need not be touched.
1056 This is called when an ({...}) construct occurs and a statement
1057 returns a value in memory. */
1060 preserve_temp_slots (rtx x)
1062 struct temp_slot *p = 0, *next;
1064 /* If there is no result, we still might have some objects whose address
1065 were taken, so we need to make sure they stay around. */
1068 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1073 move_slot_to_level (p, temp_slot_level - 1);
1079 /* If X is a register that is being used as a pointer, see if we have
1080 a temporary slot we know it points to. To be consistent with
1081 the code below, we really should preserve all non-kept slots
1082 if we can't find a match, but that seems to be much too costly. */
1083 if (REG_P (x) && REG_POINTER (x))
1084 p = find_temp_slot_from_address (x);
1086 /* If X is not in memory or is at a constant address, it cannot be in
1087 a temporary slot, but it can contain something whose address was
1089 if (p == 0 && (!MEM_P (x) || CONSTANT_P (XEXP (x, 0))))
1091 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1096 move_slot_to_level (p, temp_slot_level - 1);
1102 /* First see if we can find a match. */
1104 p = find_temp_slot_from_address (XEXP (x, 0));
1108 /* Move everything at our level whose address was taken to our new
1109 level in case we used its address. */
1110 struct temp_slot *q;
1112 if (p->level == temp_slot_level)
1114 for (q = *temp_slots_at_level (temp_slot_level); q; q = next)
1118 if (p != q && q->addr_taken)
1119 move_slot_to_level (q, temp_slot_level - 1);
1122 move_slot_to_level (p, temp_slot_level - 1);
1128 /* Otherwise, preserve all non-kept slots at this level. */
1129 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1134 move_slot_to_level (p, temp_slot_level - 1);
1138 /* Free all temporaries used so far. This is normally called at the
1139 end of generating code for a statement. */
1142 free_temp_slots (void)
1144 struct temp_slot *p, *next;
1146 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1151 make_slot_available (p);
1154 combine_temp_slots ();
1157 /* Push deeper into the nesting level for stack temporaries. */
1160 push_temp_slots (void)
1165 /* Pop a temporary nesting level. All slots in use in the current level
1169 pop_temp_slots (void)
1171 struct temp_slot *p, *next;
1173 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1176 make_slot_available (p);
1179 combine_temp_slots ();
1184 /* Initialize temporary slots. */
1187 init_temp_slots (void)
1189 /* We have not allocated any temporaries yet. */
1190 avail_temp_slots = 0;
1191 used_temp_slots = 0;
1192 temp_slot_level = 0;
1193 var_temp_slot_level = 0;
1194 target_temp_slot_level = 0;
1197 /* These routines are responsible for converting virtual register references
1198 to the actual hard register references once RTL generation is complete.
1200 The following four variables are used for communication between the
1201 routines. They contain the offsets of the virtual registers from their
1202 respective hard registers. */
1204 static int in_arg_offset;
1205 static int var_offset;
1206 static int dynamic_offset;
1207 static int out_arg_offset;
1208 static int cfa_offset;
1210 /* In most machines, the stack pointer register is equivalent to the bottom
1213 #ifndef STACK_POINTER_OFFSET
1214 #define STACK_POINTER_OFFSET 0
1217 /* If not defined, pick an appropriate default for the offset of dynamically
1218 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
1219 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
1221 #ifndef STACK_DYNAMIC_OFFSET
1223 /* The bottom of the stack points to the actual arguments. If
1224 REG_PARM_STACK_SPACE is defined, this includes the space for the register
1225 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
1226 stack space for register parameters is not pushed by the caller, but
1227 rather part of the fixed stack areas and hence not included in
1228 `current_function_outgoing_args_size'. Nevertheless, we must allow
1229 for it when allocating stack dynamic objects. */
1231 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1232 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1233 ((ACCUMULATE_OUTGOING_ARGS \
1234 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
1235 + (STACK_POINTER_OFFSET)) \
1238 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1239 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
1240 + (STACK_POINTER_OFFSET))
1244 /* On most machines, the CFA coincides with the first incoming parm. */
1246 #ifndef ARG_POINTER_CFA_OFFSET
1247 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
1251 /* Convert a SET of a hard subreg to a set of the appropriate hard
1252 register. A subroutine of purge_hard_subreg_sets. */
1255 purge_single_hard_subreg_set (rtx pattern)
1257 rtx reg = SET_DEST (pattern);
1258 enum machine_mode mode = GET_MODE (SET_DEST (pattern));
1261 if (GET_CODE (reg) == SUBREG && REG_P (SUBREG_REG (reg))
1262 && REGNO (SUBREG_REG (reg)) < FIRST_PSEUDO_REGISTER)
1264 offset = subreg_regno_offset (REGNO (SUBREG_REG (reg)),
1265 GET_MODE (SUBREG_REG (reg)),
1268 reg = SUBREG_REG (reg);
1272 if (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER)
1274 reg = gen_rtx_REG (mode, REGNO (reg) + offset);
1275 SET_DEST (pattern) = reg;
1279 /* Eliminate all occurrences of SETs of hard subregs from INSNS. The
1280 only such SETs that we expect to see are those left in because
1281 integrate can't handle sets of parts of a return value register.
1283 We don't use alter_subreg because we only want to eliminate subregs
1284 of hard registers. */
1287 purge_hard_subreg_sets (rtx insn)
1289 for (; insn; insn = NEXT_INSN (insn))
1293 rtx pattern = PATTERN (insn);
1294 switch (GET_CODE (pattern))
1297 if (GET_CODE (SET_DEST (pattern)) == SUBREG)
1298 purge_single_hard_subreg_set (pattern);
1303 for (j = XVECLEN (pattern, 0) - 1; j >= 0; j--)
1305 rtx inner_pattern = XVECEXP (pattern, 0, j);
1306 if (GET_CODE (inner_pattern) == SET
1307 && GET_CODE (SET_DEST (inner_pattern)) == SUBREG)
1308 purge_single_hard_subreg_set (inner_pattern);
1319 /* Pass through the INSNS of function FNDECL and convert virtual register
1320 references to hard register references. */
1323 instantiate_virtual_regs (void)
1327 /* Compute the offsets to use for this function. */
1328 in_arg_offset = FIRST_PARM_OFFSET (current_function_decl);
1329 var_offset = STARTING_FRAME_OFFSET;
1330 dynamic_offset = STACK_DYNAMIC_OFFSET (current_function_decl);
1331 out_arg_offset = STACK_POINTER_OFFSET;
1332 cfa_offset = ARG_POINTER_CFA_OFFSET (current_function_decl);
1334 /* Scan all variables and parameters of this function. For each that is
1335 in memory, instantiate all virtual registers if the result is a valid
1336 address. If not, we do it later. That will handle most uses of virtual
1337 regs on many machines. */
1338 instantiate_decls (current_function_decl, 1);
1340 /* Initialize recognition, indicating that volatile is OK. */
1343 /* Scan through all the insns, instantiating every virtual register still
1345 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
1346 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
1347 || GET_CODE (insn) == CALL_INSN)
1349 instantiate_virtual_regs_1 (&PATTERN (insn), insn, 1);
1350 if (INSN_DELETED_P (insn))
1352 instantiate_virtual_regs_1 (®_NOTES (insn), NULL_RTX, 0);
1353 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
1354 if (GET_CODE (insn) == CALL_INSN)
1355 instantiate_virtual_regs_1 (&CALL_INSN_FUNCTION_USAGE (insn),
1358 /* Past this point all ASM statements should match. Verify that
1359 to avoid failures later in the compilation process. */
1360 if (asm_noperands (PATTERN (insn)) >= 0
1361 && ! check_asm_operands (PATTERN (insn)))
1362 instantiate_virtual_regs_lossage (insn);
1365 /* Now instantiate the remaining register equivalences for debugging info.
1366 These will not be valid addresses. */
1367 instantiate_decls (current_function_decl, 0);
1369 /* Indicate that, from now on, assign_stack_local should use
1370 frame_pointer_rtx. */
1371 virtuals_instantiated = 1;
1374 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
1375 all virtual registers in their DECL_RTL's.
1377 If VALID_ONLY, do this only if the resulting address is still valid.
1378 Otherwise, always do it. */
1381 instantiate_decls (tree fndecl, int valid_only)
1385 /* Process all parameters of the function. */
1386 for (decl = DECL_ARGUMENTS (fndecl); decl; decl = TREE_CHAIN (decl))
1388 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (decl));
1389 HOST_WIDE_INT size_rtl;
1391 instantiate_decl (DECL_RTL (decl), size, valid_only);
1393 /* If the parameter was promoted, then the incoming RTL mode may be
1394 larger than the declared type size. We must use the larger of
1396 size_rtl = GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl)));
1397 size = MAX (size_rtl, size);
1398 instantiate_decl (DECL_INCOMING_RTL (decl), size, valid_only);
1401 /* Now process all variables defined in the function or its subblocks. */
1402 instantiate_decls_1 (DECL_INITIAL (fndecl), valid_only);
1405 /* Subroutine of instantiate_decls: Process all decls in the given
1406 BLOCK node and all its subblocks. */
1409 instantiate_decls_1 (tree let, int valid_only)
1413 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
1414 if (DECL_RTL_SET_P (t))
1415 instantiate_decl (DECL_RTL (t),
1416 int_size_in_bytes (TREE_TYPE (t)),
1419 /* Process all subblocks. */
1420 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
1421 instantiate_decls_1 (t, valid_only);
1424 /* Subroutine of the preceding procedures: Given RTL representing a
1425 decl and the size of the object, do any instantiation required.
1427 If VALID_ONLY is nonzero, it means that the RTL should only be
1428 changed if the new address is valid. */
1431 instantiate_decl (rtx x, HOST_WIDE_INT size, int valid_only)
1433 enum machine_mode mode;
1436 /* If this is not a MEM, no need to do anything. Similarly if the
1437 address is a constant or a register that is not a virtual register. */
1439 if (x == 0 || !MEM_P (x))
1443 if (CONSTANT_P (addr)
1445 && (REGNO (addr) < FIRST_VIRTUAL_REGISTER
1446 || REGNO (addr) > LAST_VIRTUAL_REGISTER)))
1449 /* If we should only do this if the address is valid, copy the address.
1450 We need to do this so we can undo any changes that might make the
1451 address invalid. This copy is unfortunate, but probably can't be
1455 addr = copy_rtx (addr);
1457 instantiate_virtual_regs_1 (&addr, NULL_RTX, 0);
1459 if (valid_only && size >= 0)
1461 unsigned HOST_WIDE_INT decl_size = size;
1463 /* Now verify that the resulting address is valid for every integer or
1464 floating-point mode up to and including SIZE bytes long. We do this
1465 since the object might be accessed in any mode and frame addresses
1468 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1469 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
1470 mode = GET_MODE_WIDER_MODE (mode))
1471 if (! memory_address_p (mode, addr))
1474 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
1475 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
1476 mode = GET_MODE_WIDER_MODE (mode))
1477 if (! memory_address_p (mode, addr))
1481 /* Put back the address now that we have updated it and we either know
1482 it is valid or we don't care whether it is valid. */
1487 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
1488 is a virtual register, return the equivalent hard register and set the
1489 offset indirectly through the pointer. Otherwise, return 0. */
1492 instantiate_new_reg (rtx x, HOST_WIDE_INT *poffset)
1495 HOST_WIDE_INT offset;
1497 if (x == virtual_incoming_args_rtx)
1498 new = arg_pointer_rtx, offset = in_arg_offset;
1499 else if (x == virtual_stack_vars_rtx)
1500 new = frame_pointer_rtx, offset = var_offset;
1501 else if (x == virtual_stack_dynamic_rtx)
1502 new = stack_pointer_rtx, offset = dynamic_offset;
1503 else if (x == virtual_outgoing_args_rtx)
1504 new = stack_pointer_rtx, offset = out_arg_offset;
1505 else if (x == virtual_cfa_rtx)
1506 new = arg_pointer_rtx, offset = cfa_offset;
1515 /* Called when instantiate_virtual_regs has failed to update the instruction.
1516 Usually this means that non-matching instruction has been emit, however for
1517 asm statements it may be the problem in the constraints. */
1519 instantiate_virtual_regs_lossage (rtx insn)
1521 if (asm_noperands (PATTERN (insn)) >= 0)
1523 error_for_asm (insn, "impossible constraint in `asm'");
1529 /* Given a pointer to a piece of rtx and an optional pointer to the
1530 containing object, instantiate any virtual registers present in it.
1532 If EXTRA_INSNS, we always do the replacement and generate
1533 any extra insns before OBJECT. If it zero, we do nothing if replacement
1536 Return 1 if we either had nothing to do or if we were able to do the
1537 needed replacement. Return 0 otherwise; we only return zero if
1538 EXTRA_INSNS is zero.
1540 We first try some simple transformations to avoid the creation of extra
1544 instantiate_virtual_regs_1 (rtx *loc, rtx object, int extra_insns)
1549 HOST_WIDE_INT offset = 0;
1555 /* Re-start here to avoid recursion in common cases. */
1562 /* We may have detected and deleted invalid asm statements. */
1563 if (object && INSN_P (object) && INSN_DELETED_P (object))
1566 code = GET_CODE (x);
1568 /* Check for some special cases. */
1586 /* We are allowed to set the virtual registers. This means that
1587 the actual register should receive the source minus the
1588 appropriate offset. This is used, for example, in the handling
1589 of non-local gotos. */
1590 if ((new = instantiate_new_reg (SET_DEST (x), &offset)) != 0)
1592 rtx src = SET_SRC (x);
1594 /* We are setting the register, not using it, so the relevant
1595 offset is the negative of the offset to use were we using
1598 instantiate_virtual_regs_1 (&src, NULL_RTX, 0);
1600 /* The only valid sources here are PLUS or REG. Just do
1601 the simplest possible thing to handle them. */
1602 if (!REG_P (src) && GET_CODE (src) != PLUS)
1604 instantiate_virtual_regs_lossage (object);
1610 temp = force_operand (src, NULL_RTX);
1613 temp = force_operand (plus_constant (temp, offset), NULL_RTX);
1617 emit_insn_before (seq, object);
1620 if (! validate_change (object, &SET_SRC (x), temp, 0)
1622 instantiate_virtual_regs_lossage (object);
1627 instantiate_virtual_regs_1 (&SET_DEST (x), object, extra_insns);
1632 /* Handle special case of virtual register plus constant. */
1633 if (CONSTANT_P (XEXP (x, 1)))
1635 rtx old, new_offset;
1637 /* Check for (plus (plus VIRT foo) (const_int)) first. */
1638 if (GET_CODE (XEXP (x, 0)) == PLUS)
1640 if ((new = instantiate_new_reg (XEXP (XEXP (x, 0), 0), &offset)))
1642 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 1), object,
1644 new = gen_rtx_PLUS (Pmode, new, XEXP (XEXP (x, 0), 1));
1653 #ifdef POINTERS_EXTEND_UNSIGNED
1654 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
1655 we can commute the PLUS and SUBREG because pointers into the
1656 frame are well-behaved. */
1657 else if (GET_CODE (XEXP (x, 0)) == SUBREG && GET_MODE (x) == ptr_mode
1658 && GET_CODE (XEXP (x, 1)) == CONST_INT
1660 = instantiate_new_reg (SUBREG_REG (XEXP (x, 0)),
1662 && validate_change (object, loc,
1663 plus_constant (gen_lowpart (ptr_mode,
1666 + INTVAL (XEXP (x, 1))),
1670 else if ((new = instantiate_new_reg (XEXP (x, 0), &offset)) == 0)
1672 /* We know the second operand is a constant. Unless the
1673 first operand is a REG (which has been already checked),
1674 it needs to be checked. */
1675 if (!REG_P (XEXP (x, 0)))
1683 new_offset = plus_constant (XEXP (x, 1), offset);
1685 /* If the new constant is zero, try to replace the sum with just
1687 if (new_offset == const0_rtx
1688 && validate_change (object, loc, new, 0))
1691 /* Next try to replace the register and new offset.
1692 There are two changes to validate here and we can't assume that
1693 in the case of old offset equals new just changing the register
1694 will yield a valid insn. In the interests of a little efficiency,
1695 however, we only call validate change once (we don't queue up the
1696 changes and then call apply_change_group). */
1700 ? ! validate_change (object, &XEXP (x, 0), new, 0)
1701 : (XEXP (x, 0) = new,
1702 ! validate_change (object, &XEXP (x, 1), new_offset, 0)))
1710 /* Otherwise copy the new constant into a register and replace
1711 constant with that register. */
1712 temp = gen_reg_rtx (Pmode);
1714 if (validate_change (object, &XEXP (x, 1), temp, 0))
1715 emit_insn_before (gen_move_insn (temp, new_offset), object);
1718 /* If that didn't work, replace this expression with a
1719 register containing the sum. */
1722 new = gen_rtx_PLUS (Pmode, new, new_offset);
1725 temp = force_operand (new, NULL_RTX);
1729 emit_insn_before (seq, object);
1730 if (! validate_change (object, loc, temp, 0)
1731 && ! validate_replace_rtx (x, temp, object))
1733 instantiate_virtual_regs_lossage (object);
1742 /* Fall through to generic two-operand expression case. */
1748 case DIV: case UDIV:
1749 case MOD: case UMOD:
1750 case AND: case IOR: case XOR:
1751 case ROTATERT: case ROTATE:
1752 case ASHIFTRT: case LSHIFTRT: case ASHIFT:
1754 case GE: case GT: case GEU: case GTU:
1755 case LE: case LT: case LEU: case LTU:
1756 if (XEXP (x, 1) && ! CONSTANT_P (XEXP (x, 1)))
1757 instantiate_virtual_regs_1 (&XEXP (x, 1), object, extra_insns);
1762 /* Most cases of MEM that convert to valid addresses have already been
1763 handled by our scan of decls. The only special handling we
1764 need here is to make a copy of the rtx to ensure it isn't being
1765 shared if we have to change it to a pseudo.
1767 If the rtx is a simple reference to an address via a virtual register,
1768 it can potentially be shared. In such cases, first try to make it
1769 a valid address, which can also be shared. Otherwise, copy it and
1772 First check for common cases that need no processing. These are
1773 usually due to instantiation already being done on a previous instance
1777 if (CONSTANT_ADDRESS_P (temp)
1778 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
1779 || temp == arg_pointer_rtx
1781 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
1782 || temp == hard_frame_pointer_rtx
1784 || temp == frame_pointer_rtx)
1787 if (GET_CODE (temp) == PLUS
1788 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
1789 && (XEXP (temp, 0) == frame_pointer_rtx
1790 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
1791 || XEXP (temp, 0) == hard_frame_pointer_rtx
1793 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
1794 || XEXP (temp, 0) == arg_pointer_rtx
1799 if (temp == virtual_stack_vars_rtx
1800 || temp == virtual_incoming_args_rtx
1801 || (GET_CODE (temp) == PLUS
1802 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
1803 && (XEXP (temp, 0) == virtual_stack_vars_rtx
1804 || XEXP (temp, 0) == virtual_incoming_args_rtx)))
1806 /* This MEM may be shared. If the substitution can be done without
1807 the need to generate new pseudos, we want to do it in place
1808 so all copies of the shared rtx benefit. The call below will
1809 only make substitutions if the resulting address is still
1812 Note that we cannot pass X as the object in the recursive call
1813 since the insn being processed may not allow all valid
1814 addresses. However, if we were not passed on object, we can
1815 only modify X without copying it if X will have a valid
1818 ??? Also note that this can still lose if OBJECT is an insn that
1819 has less restrictions on an address that some other insn.
1820 In that case, we will modify the shared address. This case
1821 doesn't seem very likely, though. One case where this could
1822 happen is in the case of a USE or CLOBBER reference, but we
1823 take care of that below. */
1825 if (instantiate_virtual_regs_1 (&XEXP (x, 0),
1826 object ? object : x, 0))
1829 /* Otherwise make a copy and process that copy. We copy the entire
1830 RTL expression since it might be a PLUS which could also be
1832 *loc = x = copy_rtx (x);
1835 /* Fall through to generic unary operation case. */
1838 case STRICT_LOW_PART:
1840 case PRE_DEC: case PRE_INC: case POST_DEC: case POST_INC:
1841 case SIGN_EXTEND: case ZERO_EXTEND:
1842 case TRUNCATE: case FLOAT_EXTEND: case FLOAT_TRUNCATE:
1843 case FLOAT: case FIX:
1844 case UNSIGNED_FIX: case UNSIGNED_FLOAT:
1849 case POPCOUNT: case PARITY:
1850 /* These case either have just one operand or we know that we need not
1851 check the rest of the operands. */
1857 /* If the operand is a MEM, see if the change is a valid MEM. If not,
1858 go ahead and make the invalid one, but do it to a copy. For a REG,
1859 just make the recursive call, since there's no chance of a problem. */
1861 if ((MEM_P (XEXP (x, 0))
1862 && instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), XEXP (x, 0),
1864 || (REG_P (XEXP (x, 0))
1865 && instantiate_virtual_regs_1 (&XEXP (x, 0), object, 0)))
1868 XEXP (x, 0) = copy_rtx (XEXP (x, 0));
1873 /* Try to replace with a PLUS. If that doesn't work, compute the sum
1874 in front of this insn and substitute the temporary. */
1875 if ((new = instantiate_new_reg (x, &offset)) != 0)
1877 temp = plus_constant (new, offset);
1878 if (!validate_change (object, loc, temp, 0))
1884 temp = force_operand (temp, NULL_RTX);
1888 emit_insn_before (seq, object);
1889 if (! validate_change (object, loc, temp, 0)
1890 && ! validate_replace_rtx (x, temp, object))
1891 instantiate_virtual_regs_lossage (object);
1901 /* Scan all subexpressions. */
1902 fmt = GET_RTX_FORMAT (code);
1903 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
1906 if (!instantiate_virtual_regs_1 (&XEXP (x, i), object, extra_insns))
1909 else if (*fmt == 'E')
1910 for (j = 0; j < XVECLEN (x, i); j++)
1911 if (! instantiate_virtual_regs_1 (&XVECEXP (x, i, j), object,
1918 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
1919 This means a type for which function calls must pass an address to the
1920 function or get an address back from the function.
1921 EXP may be a type node or an expression (whose type is tested). */
1924 aggregate_value_p (tree exp, tree fntype)
1926 int i, regno, nregs;
1929 tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
1932 switch (TREE_CODE (fntype))
1935 fntype = get_callee_fndecl (fntype);
1936 fntype = fntype ? TREE_TYPE (fntype) : 0;
1939 fntype = TREE_TYPE (fntype);
1944 case IDENTIFIER_NODE:
1948 /* We don't expect other rtl types here. */
1952 if (TREE_CODE (type) == VOID_TYPE)
1954 if (targetm.calls.return_in_memory (type, fntype))
1956 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
1957 and thus can't be returned in registers. */
1958 if (TREE_ADDRESSABLE (type))
1960 if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
1962 /* Make sure we have suitable call-clobbered regs to return
1963 the value in; if not, we must return it in memory. */
1964 reg = hard_function_value (type, 0, 0);
1966 /* If we have something other than a REG (e.g. a PARALLEL), then assume
1971 regno = REGNO (reg);
1972 nregs = hard_regno_nregs[regno][TYPE_MODE (type)];
1973 for (i = 0; i < nregs; i++)
1974 if (! call_used_regs[regno + i])
1979 /* Return true if we should assign DECL a pseudo register; false if it
1980 should live on the local stack. */
1983 use_register_for_decl (tree decl)
1985 /* Honor volatile. */
1986 if (TREE_SIDE_EFFECTS (decl))
1989 /* Honor addressability. */
1990 if (TREE_ADDRESSABLE (decl))
1993 /* Only register-like things go in registers. */
1994 if (DECL_MODE (decl) == BLKmode)
1997 /* If -ffloat-store specified, don't put explicit float variables
1999 /* ??? This should be checked after DECL_ARTIFICIAL, but tree-ssa
2000 propagates values across these stores, and it probably shouldn't. */
2001 if (flag_float_store && FLOAT_TYPE_P (TREE_TYPE (decl)))
2004 /* Compiler-generated temporaries can always go in registers. */
2005 if (DECL_ARTIFICIAL (decl))
2008 #ifdef NON_SAVING_SETJMP
2009 /* Protect variables not declared "register" from setjmp. */
2010 if (NON_SAVING_SETJMP
2011 && current_function_calls_setjmp
2012 && !DECL_REGISTER (decl))
2016 return (optimize || DECL_REGISTER (decl));
2019 /* Return true if TYPE should be passed by invisible reference. */
2022 pass_by_reference (CUMULATIVE_ARGS *ca, enum machine_mode mode,
2023 tree type, bool named_arg)
2027 /* If this type contains non-trivial constructors, then it is
2028 forbidden for the middle-end to create any new copies. */
2029 if (TREE_ADDRESSABLE (type))
2032 /* GCC post 3.4 passes *all* variable sized types by reference. */
2033 if (!TYPE_SIZE (type) || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
2037 return targetm.calls.pass_by_reference (ca, mode, type, named_arg);
2040 /* Structures to communicate between the subroutines of assign_parms.
2041 The first holds data persistent across all parameters, the second
2042 is cleared out for each parameter. */
2044 struct assign_parm_data_all
2046 CUMULATIVE_ARGS args_so_far;
2047 struct args_size stack_args_size;
2048 tree function_result_decl;
2050 rtx conversion_insns;
2051 HOST_WIDE_INT pretend_args_size;
2052 HOST_WIDE_INT extra_pretend_bytes;
2053 int reg_parm_stack_space;
2056 struct assign_parm_data_one
2062 enum machine_mode nominal_mode;
2063 enum machine_mode passed_mode;
2064 enum machine_mode promoted_mode;
2065 struct locate_and_pad_arg_data locate;
2067 BOOL_BITFIELD named_arg : 1;
2068 BOOL_BITFIELD last_named : 1;
2069 BOOL_BITFIELD passed_pointer : 1;
2070 BOOL_BITFIELD on_stack : 1;
2071 BOOL_BITFIELD loaded_in_reg : 1;
2074 /* A subroutine of assign_parms. Initialize ALL. */
2077 assign_parms_initialize_all (struct assign_parm_data_all *all)
2081 memset (all, 0, sizeof (*all));
2083 fntype = TREE_TYPE (current_function_decl);
2085 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
2086 INIT_CUMULATIVE_INCOMING_ARGS (all->args_so_far, fntype, NULL_RTX);
2088 INIT_CUMULATIVE_ARGS (all->args_so_far, fntype, NULL_RTX,
2089 current_function_decl, -1);
2092 #ifdef REG_PARM_STACK_SPACE
2093 all->reg_parm_stack_space = REG_PARM_STACK_SPACE (current_function_decl);
2097 /* If ARGS contains entries with complex types, split the entry into two
2098 entries of the component type. Return a new list of substitutions are
2099 needed, else the old list. */
2102 split_complex_args (tree args)
2106 /* Before allocating memory, check for the common case of no complex. */
2107 for (p = args; p; p = TREE_CHAIN (p))
2109 tree type = TREE_TYPE (p);
2110 if (TREE_CODE (type) == COMPLEX_TYPE
2111 && targetm.calls.split_complex_arg (type))
2117 args = copy_list (args);
2119 for (p = args; p; p = TREE_CHAIN (p))
2121 tree type = TREE_TYPE (p);
2122 if (TREE_CODE (type) == COMPLEX_TYPE
2123 && targetm.calls.split_complex_arg (type))
2126 tree subtype = TREE_TYPE (type);
2128 /* Rewrite the PARM_DECL's type with its component. */
2129 TREE_TYPE (p) = subtype;
2130 DECL_ARG_TYPE (p) = TREE_TYPE (DECL_ARG_TYPE (p));
2131 DECL_MODE (p) = VOIDmode;
2132 DECL_SIZE (p) = NULL;
2133 DECL_SIZE_UNIT (p) = NULL;
2136 /* Build a second synthetic decl. */
2137 decl = build_decl (PARM_DECL, NULL_TREE, subtype);
2138 DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (p);
2139 layout_decl (decl, 0);
2141 /* Splice it in; skip the new decl. */
2142 TREE_CHAIN (decl) = TREE_CHAIN (p);
2143 TREE_CHAIN (p) = decl;
2151 /* A subroutine of assign_parms. Adjust the parameter list to incorporate
2152 the hidden struct return argument, and (abi willing) complex args.
2153 Return the new parameter list. */
2156 assign_parms_augmented_arg_list (struct assign_parm_data_all *all)
2158 tree fndecl = current_function_decl;
2159 tree fntype = TREE_TYPE (fndecl);
2160 tree fnargs = DECL_ARGUMENTS (fndecl);
2162 /* If struct value address is treated as the first argument, make it so. */
2163 if (aggregate_value_p (DECL_RESULT (fndecl), fndecl)
2164 && ! current_function_returns_pcc_struct
2165 && targetm.calls.struct_value_rtx (TREE_TYPE (fndecl), 1) == 0)
2167 tree type = build_pointer_type (TREE_TYPE (fntype));
2170 decl = build_decl (PARM_DECL, NULL_TREE, type);
2171 DECL_ARG_TYPE (decl) = type;
2172 DECL_ARTIFICIAL (decl) = 1;
2174 TREE_CHAIN (decl) = fnargs;
2176 all->function_result_decl = decl;
2179 all->orig_fnargs = fnargs;
2181 /* If the target wants to split complex arguments into scalars, do so. */
2182 if (targetm.calls.split_complex_arg)
2183 fnargs = split_complex_args (fnargs);
2188 /* A subroutine of assign_parms. Examine PARM and pull out type and mode
2189 data for the parameter. Incorporate ABI specifics such as pass-by-
2190 reference and type promotion. */
2193 assign_parm_find_data_types (struct assign_parm_data_all *all, tree parm,
2194 struct assign_parm_data_one *data)
2196 tree nominal_type, passed_type;
2197 enum machine_mode nominal_mode, passed_mode, promoted_mode;
2199 memset (data, 0, sizeof (*data));
2201 /* Set LAST_NAMED if this is last named arg before last anonymous args. */
2202 if (current_function_stdarg)
2205 for (tem = TREE_CHAIN (parm); tem; tem = TREE_CHAIN (tem))
2206 if (DECL_NAME (tem))
2209 data->last_named = true;
2212 /* Set NAMED_ARG if this arg should be treated as a named arg. For
2213 most machines, if this is a varargs/stdarg function, then we treat
2214 the last named arg as if it were anonymous too. */
2215 if (targetm.calls.strict_argument_naming (&all->args_so_far))
2216 data->named_arg = 1;
2218 data->named_arg = !data->last_named;
2220 nominal_type = TREE_TYPE (parm);
2221 passed_type = DECL_ARG_TYPE (parm);
2223 /* Look out for errors propagating this far. Also, if the parameter's
2224 type is void then its value doesn't matter. */
2225 if (TREE_TYPE (parm) == error_mark_node
2226 /* This can happen after weird syntax errors
2227 or if an enum type is defined among the parms. */
2228 || TREE_CODE (parm) != PARM_DECL
2229 || passed_type == NULL
2230 || VOID_TYPE_P (nominal_type))
2232 nominal_type = passed_type = void_type_node;
2233 nominal_mode = passed_mode = promoted_mode = VOIDmode;
2237 /* Find mode of arg as it is passed, and mode of arg as it should be
2238 during execution of this function. */
2239 passed_mode = TYPE_MODE (passed_type);
2240 nominal_mode = TYPE_MODE (nominal_type);
2242 /* If the parm is to be passed as a transparent union, use the type of
2243 the first field for the tests below. We have already verified that
2244 the modes are the same. */
2245 if (DECL_TRANSPARENT_UNION (parm)
2246 || (TREE_CODE (passed_type) == UNION_TYPE
2247 && TYPE_TRANSPARENT_UNION (passed_type)))
2248 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
2250 /* See if this arg was passed by invisible reference. */
2251 if (pass_by_reference (&all->args_so_far, passed_mode,
2252 passed_type, data->named_arg))
2254 passed_type = nominal_type = build_pointer_type (passed_type);
2255 data->passed_pointer = true;
2256 passed_mode = nominal_mode = Pmode;
2258 /* See if the frontend wants to pass this by invisible reference. */
2259 else if (passed_type != nominal_type
2260 && POINTER_TYPE_P (passed_type)
2261 && TREE_TYPE (passed_type) == nominal_type)
2263 nominal_type = passed_type;
2264 data->passed_pointer = 1;
2265 passed_mode = nominal_mode = Pmode;
2268 /* Find mode as it is passed by the ABI. */
2269 promoted_mode = passed_mode;
2270 if (targetm.calls.promote_function_args (TREE_TYPE (current_function_decl)))
2272 int unsignedp = TYPE_UNSIGNED (passed_type);
2273 promoted_mode = promote_mode (passed_type, promoted_mode,
2278 data->nominal_type = nominal_type;
2279 data->passed_type = passed_type;
2280 data->nominal_mode = nominal_mode;
2281 data->passed_mode = passed_mode;
2282 data->promoted_mode = promoted_mode;
2285 /* A subroutine of assign_parms. Invoke setup_incoming_varargs. */
2288 assign_parms_setup_varargs (struct assign_parm_data_all *all,
2289 struct assign_parm_data_one *data, bool no_rtl)
2291 int varargs_pretend_bytes = 0;
2293 targetm.calls.setup_incoming_varargs (&all->args_so_far,
2294 data->promoted_mode,
2296 &varargs_pretend_bytes, no_rtl);
2298 /* If the back-end has requested extra stack space, record how much is
2299 needed. Do not change pretend_args_size otherwise since it may be
2300 nonzero from an earlier partial argument. */
2301 if (varargs_pretend_bytes > 0)
2302 all->pretend_args_size = varargs_pretend_bytes;
2305 /* A subroutine of assign_parms. Set DATA->ENTRY_PARM corresponding to
2306 the incoming location of the current parameter. */
2309 assign_parm_find_entry_rtl (struct assign_parm_data_all *all,
2310 struct assign_parm_data_one *data)
2312 HOST_WIDE_INT pretend_bytes = 0;
2316 if (data->promoted_mode == VOIDmode)
2318 data->entry_parm = data->stack_parm = const0_rtx;
2322 #ifdef FUNCTION_INCOMING_ARG
2323 entry_parm = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
2324 data->passed_type, data->named_arg);
2326 entry_parm = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
2327 data->passed_type, data->named_arg);
2330 if (entry_parm == 0)
2331 data->promoted_mode = data->passed_mode;
2333 /* Determine parm's home in the stack, in case it arrives in the stack
2334 or we should pretend it did. Compute the stack position and rtx where
2335 the argument arrives and its size.
2337 There is one complexity here: If this was a parameter that would
2338 have been passed in registers, but wasn't only because it is
2339 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
2340 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
2341 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of 0
2342 as it was the previous time. */
2343 in_regs = entry_parm != 0;
2344 #ifdef STACK_PARMS_IN_REG_PARM_AREA
2347 if (!in_regs && !data->named_arg)
2349 if (targetm.calls.pretend_outgoing_varargs_named (&all->args_so_far))
2352 #ifdef FUNCTION_INCOMING_ARG
2353 tem = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
2354 data->passed_type, true);
2356 tem = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
2357 data->passed_type, true);
2359 in_regs = tem != NULL;
2363 /* If this parameter was passed both in registers and in the stack, use
2364 the copy on the stack. */
2365 if (targetm.calls.must_pass_in_stack (data->promoted_mode,
2373 partial = FUNCTION_ARG_PARTIAL_NREGS (all->args_so_far,
2374 data->promoted_mode,
2377 data->partial = partial;
2379 /* The caller might already have allocated stack space for the
2380 register parameters. */
2381 if (partial != 0 && all->reg_parm_stack_space == 0)
2383 /* Part of this argument is passed in registers and part
2384 is passed on the stack. Ask the prologue code to extend
2385 the stack part so that we can recreate the full value.
2387 PRETEND_BYTES is the size of the registers we need to store.
2388 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
2389 stack space that the prologue should allocate.
2391 Internally, gcc assumes that the argument pointer is aligned
2392 to STACK_BOUNDARY bits. This is used both for alignment
2393 optimizations (see init_emit) and to locate arguments that are
2394 aligned to more than PARM_BOUNDARY bits. We must preserve this
2395 invariant by rounding CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to
2396 a stack boundary. */
2398 /* We assume at most one partial arg, and it must be the first
2399 argument on the stack. */
2400 if (all->extra_pretend_bytes || all->pretend_args_size)
2403 pretend_bytes = partial * UNITS_PER_WORD;
2404 all->pretend_args_size = CEIL_ROUND (pretend_bytes, STACK_BYTES);
2406 /* We want to align relative to the actual stack pointer, so
2407 don't include this in the stack size until later. */
2408 all->extra_pretend_bytes = all->pretend_args_size;
2412 locate_and_pad_parm (data->promoted_mode, data->passed_type, in_regs,
2413 entry_parm ? data->partial : 0, current_function_decl,
2414 &all->stack_args_size, &data->locate);
2416 /* Adjust offsets to include the pretend args. */
2417 pretend_bytes = all->extra_pretend_bytes - pretend_bytes;
2418 data->locate.slot_offset.constant += pretend_bytes;
2419 data->locate.offset.constant += pretend_bytes;
2421 data->entry_parm = entry_parm;
2424 /* A subroutine of assign_parms. If there is actually space on the stack
2425 for this parm, count it in stack_args_size and return true. */
2428 assign_parm_is_stack_parm (struct assign_parm_data_all *all,
2429 struct assign_parm_data_one *data)
2431 /* Trivially true if we've no incomming register. */
2432 if (data->entry_parm == NULL)
2434 /* Also true if we're partially in registers and partially not,
2435 since we've arranged to drop the entire argument on the stack. */
2436 else if (data->partial != 0)
2438 /* Also true if the target says that it's passed in both registers
2439 and on the stack. */
2440 else if (GET_CODE (data->entry_parm) == PARALLEL
2441 && XEXP (XVECEXP (data->entry_parm, 0, 0), 0) == NULL_RTX)
2443 /* Also true if the target says that there's stack allocated for
2444 all register parameters. */
2445 else if (all->reg_parm_stack_space > 0)
2447 /* Otherwise, no, this parameter has no ABI defined stack slot. */
2451 all->stack_args_size.constant += data->locate.size.constant;
2452 if (data->locate.size.var)
2453 ADD_PARM_SIZE (all->stack_args_size, data->locate.size.var);
2458 /* A subroutine of assign_parms. Given that this parameter is allocated
2459 stack space by the ABI, find it. */
2462 assign_parm_find_stack_rtl (tree parm, struct assign_parm_data_one *data)
2464 rtx offset_rtx, stack_parm;
2465 unsigned int align, boundary;
2467 /* If we're passing this arg using a reg, make its stack home the
2468 aligned stack slot. */
2469 if (data->entry_parm)
2470 offset_rtx = ARGS_SIZE_RTX (data->locate.slot_offset);
2472 offset_rtx = ARGS_SIZE_RTX (data->locate.offset);
2474 stack_parm = current_function_internal_arg_pointer;
2475 if (offset_rtx != const0_rtx)
2476 stack_parm = gen_rtx_PLUS (Pmode, stack_parm, offset_rtx);
2477 stack_parm = gen_rtx_MEM (data->promoted_mode, stack_parm);
2479 set_mem_attributes (stack_parm, parm, 1);
2481 boundary = FUNCTION_ARG_BOUNDARY (data->promoted_mode, data->passed_type);
2484 /* If we're padding upward, we know that the alignment of the slot
2485 is FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
2486 intentionally forcing upward padding. Otherwise we have to come
2487 up with a guess at the alignment based on OFFSET_RTX. */
2488 if (data->locate.where_pad == upward || data->entry_parm)
2490 else if (GET_CODE (offset_rtx) == CONST_INT)
2492 align = INTVAL (offset_rtx) * BITS_PER_UNIT | boundary;
2493 align = align & -align;
2496 set_mem_align (stack_parm, align);
2498 if (data->entry_parm)
2499 set_reg_attrs_for_parm (data->entry_parm, stack_parm);
2501 data->stack_parm = stack_parm;
2504 /* A subroutine of assign_parms. Adjust DATA->ENTRY_RTL such that it's
2505 always valid and contiguous. */
2508 assign_parm_adjust_entry_rtl (struct assign_parm_data_one *data)
2510 rtx entry_parm = data->entry_parm;
2511 rtx stack_parm = data->stack_parm;
2513 /* If this parm was passed part in regs and part in memory, pretend it
2514 arrived entirely in memory by pushing the register-part onto the stack.
2515 In the special case of a DImode or DFmode that is split, we could put
2516 it together in a pseudoreg directly, but for now that's not worth
2518 if (data->partial != 0)
2520 /* Handle calls that pass values in multiple non-contiguous
2521 locations. The Irix 6 ABI has examples of this. */
2522 if (GET_CODE (entry_parm) == PARALLEL)
2523 emit_group_store (validize_mem (stack_parm), entry_parm,
2525 int_size_in_bytes (data->passed_type));
2527 move_block_from_reg (REGNO (entry_parm), validize_mem (stack_parm),
2530 entry_parm = stack_parm;
2533 /* If we didn't decide this parm came in a register, by default it came
2535 else if (entry_parm == NULL)
2536 entry_parm = stack_parm;
2538 /* When an argument is passed in multiple locations, we can't make use
2539 of this information, but we can save some copying if the whole argument
2540 is passed in a single register. */
2541 else if (GET_CODE (entry_parm) == PARALLEL
2542 && data->nominal_mode != BLKmode
2543 && data->passed_mode != BLKmode)
2545 size_t i, len = XVECLEN (entry_parm, 0);
2547 for (i = 0; i < len; i++)
2548 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
2549 && REG_P (XEXP (XVECEXP (entry_parm, 0, i), 0))
2550 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
2551 == data->passed_mode)
2552 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
2554 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
2559 data->entry_parm = entry_parm;
2562 /* A subroutine of assign_parms. Adjust DATA->STACK_RTL such that it's
2563 always valid and properly aligned. */
2567 assign_parm_adjust_stack_rtl (struct assign_parm_data_one *data)
2569 rtx stack_parm = data->stack_parm;
2571 /* If we can't trust the parm stack slot to be aligned enough for its
2572 ultimate type, don't use that slot after entry. We'll make another
2573 stack slot, if we need one. */
2574 if (STRICT_ALIGNMENT && stack_parm
2575 && GET_MODE_ALIGNMENT (data->nominal_mode) > MEM_ALIGN (stack_parm))
2578 /* If parm was passed in memory, and we need to convert it on entry,
2579 don't store it back in that same slot. */
2580 else if (data->entry_parm == stack_parm
2581 && data->nominal_mode != BLKmode
2582 && data->nominal_mode != data->passed_mode)
2585 data->stack_parm = stack_parm;
2588 /* A subroutine of assign_parms. Return true if the current parameter
2589 should be stored as a BLKmode in the current frame. */
2592 assign_parm_setup_block_p (struct assign_parm_data_one *data)
2594 if (data->nominal_mode == BLKmode)
2596 if (GET_CODE (data->entry_parm) == PARALLEL)
2599 #ifdef BLOCK_REG_PADDING
2600 if (data->locate.where_pad == (BYTES_BIG_ENDIAN ? upward : downward)
2601 && GET_MODE_SIZE (data->promoted_mode) < UNITS_PER_WORD)
2608 /* A subroutine of assign_parms. Arrange for the parameter to be
2609 present and valid in DATA->STACK_RTL. */
2612 assign_parm_setup_block (tree parm, struct assign_parm_data_one *data)
2614 rtx entry_parm = data->entry_parm;
2615 rtx stack_parm = data->stack_parm;
2617 /* If we've a non-block object that's nevertheless passed in parts,
2618 reconstitute it in register operations rather than on the stack. */
2619 if (GET_CODE (entry_parm) == PARALLEL
2620 && data->nominal_mode != BLKmode
2621 && XVECLEN (entry_parm, 0) > 1
2624 rtx parmreg = gen_reg_rtx (data->nominal_mode);
2626 emit_group_store (parmreg, entry_parm, data->nominal_type,
2627 int_size_in_bytes (data->nominal_type));
2628 SET_DECL_RTL (parm, parmreg);
2632 /* If a BLKmode arrives in registers, copy it to a stack slot. Handle
2633 calls that pass values in multiple non-contiguous locations. */
2634 if (REG_P (entry_parm) || GET_CODE (entry_parm) == PARALLEL)
2636 HOST_WIDE_INT size = int_size_in_bytes (data->passed_type);
2637 HOST_WIDE_INT size_stored = CEIL_ROUND (size, UNITS_PER_WORD);
2640 /* Note that we will be storing an integral number of words.
2641 So we have to be careful to ensure that we allocate an
2642 integral number of words. We do this below in the
2643 assign_stack_local if space was not allocated in the argument
2644 list. If it was, this will not work if PARM_BOUNDARY is not
2645 a multiple of BITS_PER_WORD. It isn't clear how to fix this
2646 if it becomes a problem. Exception is when BLKmode arrives
2647 with arguments not conforming to word_mode. */
2649 if (stack_parm == 0)
2651 stack_parm = assign_stack_local (BLKmode, size_stored, 0);
2652 data->stack_parm = stack_parm;
2653 PUT_MODE (stack_parm, GET_MODE (entry_parm));
2654 set_mem_attributes (stack_parm, parm, 1);
2656 else if (GET_CODE (entry_parm) == PARALLEL)
2658 else if (size != 0 && PARM_BOUNDARY % BITS_PER_WORD != 0)
2661 mem = validize_mem (stack_parm);
2663 /* Handle values in multiple non-contiguous locations. */
2664 if (GET_CODE (entry_parm) == PARALLEL)
2665 emit_group_store (mem, entry_parm, data->passed_type, size);
2670 /* If SIZE is that of a mode no bigger than a word, just use
2671 that mode's store operation. */
2672 else if (size <= UNITS_PER_WORD)
2674 enum machine_mode mode
2675 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
2678 #ifdef BLOCK_REG_PADDING
2679 && (size == UNITS_PER_WORD
2680 || (BLOCK_REG_PADDING (mode, data->passed_type, 1)
2681 != (BYTES_BIG_ENDIAN ? upward : downward)))
2685 rtx reg = gen_rtx_REG (mode, REGNO (entry_parm));
2686 emit_move_insn (change_address (mem, mode, 0), reg);
2689 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
2690 machine must be aligned to the left before storing
2691 to memory. Note that the previous test doesn't
2692 handle all cases (e.g. SIZE == 3). */
2693 else if (size != UNITS_PER_WORD
2694 #ifdef BLOCK_REG_PADDING
2695 && (BLOCK_REG_PADDING (mode, data->passed_type, 1)
2703 int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
2704 rtx reg = gen_rtx_REG (word_mode, REGNO (data->entry_parm));
2706 x = expand_shift (LSHIFT_EXPR, word_mode, reg,
2707 build_int_2 (by, 0), NULL_RTX, 1);
2708 tem = change_address (mem, word_mode, 0);
2709 emit_move_insn (tem, x);
2712 move_block_from_reg (REGNO (data->entry_parm), mem,
2713 size_stored / UNITS_PER_WORD);
2716 move_block_from_reg (REGNO (data->entry_parm), mem,
2717 size_stored / UNITS_PER_WORD);
2720 SET_DECL_RTL (parm, stack_parm);
2723 /* A subroutine of assign_parms. Allocate a pseudo to hold the current
2724 parameter. Get it there. Perform all ABI specified conversions. */
2727 assign_parm_setup_reg (struct assign_parm_data_all *all, tree parm,
2728 struct assign_parm_data_one *data)
2731 enum machine_mode promoted_nominal_mode;
2732 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (parm));
2733 bool did_conversion = false;
2735 /* Store the parm in a pseudoregister during the function, but we may
2736 need to do it in a wider mode. */
2738 promoted_nominal_mode
2739 = promote_mode (data->nominal_type, data->nominal_mode, &unsignedp, 0);
2741 parmreg = gen_reg_rtx (promoted_nominal_mode);
2743 if (!DECL_ARTIFICIAL (parm))
2744 mark_user_reg (parmreg);
2746 /* If this was an item that we received a pointer to,
2747 set DECL_RTL appropriately. */
2748 if (data->passed_pointer)
2750 rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data->passed_type)), parmreg);
2751 set_mem_attributes (x, parm, 1);
2752 SET_DECL_RTL (parm, x);
2756 SET_DECL_RTL (parm, parmreg);
2757 maybe_set_unchanging (DECL_RTL (parm), parm);
2760 /* Copy the value into the register. */
2761 if (data->nominal_mode != data->passed_mode
2762 || promoted_nominal_mode != data->promoted_mode)
2766 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
2767 mode, by the caller. We now have to convert it to
2768 NOMINAL_MODE, if different. However, PARMREG may be in
2769 a different mode than NOMINAL_MODE if it is being stored
2772 If ENTRY_PARM is a hard register, it might be in a register
2773 not valid for operating in its mode (e.g., an odd-numbered
2774 register for a DFmode). In that case, moves are the only
2775 thing valid, so we can't do a convert from there. This
2776 occurs when the calling sequence allow such misaligned
2779 In addition, the conversion may involve a call, which could
2780 clobber parameters which haven't been copied to pseudo
2781 registers yet. Therefore, we must first copy the parm to
2782 a pseudo reg here, and save the conversion until after all
2783 parameters have been moved. */
2785 rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
2787 emit_move_insn (tempreg, validize_mem (data->entry_parm));
2789 push_to_sequence (all->conversion_insns);
2790 tempreg = convert_to_mode (data->nominal_mode, tempreg, unsignedp);
2792 if (GET_CODE (tempreg) == SUBREG
2793 && GET_MODE (tempreg) == data->nominal_mode
2794 && REG_P (SUBREG_REG (tempreg))
2795 && data->nominal_mode == data->passed_mode
2796 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (data->entry_parm)
2797 && GET_MODE_SIZE (GET_MODE (tempreg))
2798 < GET_MODE_SIZE (GET_MODE (data->entry_parm)))
2800 /* The argument is already sign/zero extended, so note it
2802 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
2803 SUBREG_PROMOTED_UNSIGNED_SET (tempreg, unsignedp);
2806 /* TREE_USED gets set erroneously during expand_assignment. */
2807 save_tree_used = TREE_USED (parm);
2808 expand_assignment (parm, make_tree (data->nominal_type, tempreg), 0);
2809 TREE_USED (parm) = save_tree_used;
2810 all->conversion_insns = get_insns ();
2813 did_conversion = true;
2816 emit_move_insn (parmreg, validize_mem (data->entry_parm));
2818 /* If we were passed a pointer but the actual value can safely live
2819 in a register, put it in one. */
2820 if (data->passed_pointer
2821 && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
2822 /* If by-reference argument was promoted, demote it. */
2823 && (TYPE_MODE (TREE_TYPE (parm)) != GET_MODE (DECL_RTL (parm))
2824 || use_register_for_decl (parm)))
2826 /* We can't use nominal_mode, because it will have been set to
2827 Pmode above. We must use the actual mode of the parm. */
2828 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
2829 mark_user_reg (parmreg);
2831 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
2833 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
2834 int unsigned_p = TYPE_UNSIGNED (TREE_TYPE (parm));
2836 push_to_sequence (all->conversion_insns);
2837 emit_move_insn (tempreg, DECL_RTL (parm));
2838 tempreg = convert_to_mode (GET_MODE (parmreg), tempreg, unsigned_p);
2839 emit_move_insn (parmreg, tempreg);
2840 all->conversion_insns = get_insns();
2843 did_conversion = true;
2846 emit_move_insn (parmreg, DECL_RTL (parm));
2848 SET_DECL_RTL (parm, parmreg);
2850 /* STACK_PARM is the pointer, not the parm, and PARMREG is
2852 data->stack_parm = NULL;
2855 /* If we are passed an arg by reference and it is our responsibility
2856 to make a copy, do it now.
2857 PASSED_TYPE and PASSED mode now refer to the pointer, not the
2858 original argument, so we must recreate them in the call to
2859 FUNCTION_ARG_CALLEE_COPIES. */
2860 /* ??? Later add code to handle the case that if the argument isn't
2861 modified, don't do the copy. */
2863 else if (data->passed_pointer)
2865 tree type = TREE_TYPE (data->passed_type);
2867 if (FUNCTION_ARG_CALLEE_COPIES (all->args_so_far, TYPE_MODE (type),
2868 type, data->named_arg)
2869 && !TREE_ADDRESSABLE (type))
2873 /* This sequence may involve a library call perhaps clobbering
2874 registers that haven't been copied to pseudos yet. */
2876 push_to_sequence (all->conversion_insns);
2878 if (!COMPLETE_TYPE_P (type)
2879 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
2881 /* This is a variable sized object. */
2882 copy = allocate_dynamic_stack_space (expr_size (parm), NULL_RTX,
2884 copy = gen_rtx_MEM (BLKmode, copy);
2887 copy = assign_stack_temp (TYPE_MODE (type),
2888 int_size_in_bytes (type), 1);
2889 set_mem_attributes (copy, parm, 1);
2891 store_expr (parm, copy, 0);
2892 emit_move_insn (parmreg, XEXP (copy, 0));
2893 all->conversion_insns = get_insns ();
2896 did_conversion = true;
2900 /* Mark the register as eliminable if we did no conversion and it was
2901 copied from memory at a fixed offset, and the arg pointer was not
2902 copied to a pseudo-reg. If the arg pointer is a pseudo reg or the
2903 offset formed an invalid address, such memory-equivalences as we
2904 make here would screw up life analysis for it. */
2905 if (data->nominal_mode == data->passed_mode
2907 && data->stack_parm != 0
2908 && MEM_P (data->stack_parm)
2909 && data->locate.offset.var == 0
2910 && reg_mentioned_p (virtual_incoming_args_rtx,
2911 XEXP (data->stack_parm, 0)))
2913 rtx linsn = get_last_insn ();
2916 /* Mark complex types separately. */
2917 if (GET_CODE (parmreg) == CONCAT)
2919 enum machine_mode submode
2920 = GET_MODE_INNER (GET_MODE (parmreg));
2921 int regnor = REGNO (gen_realpart (submode, parmreg));
2922 int regnoi = REGNO (gen_imagpart (submode, parmreg));
2923 rtx stackr = gen_realpart (submode, data->stack_parm);
2924 rtx stacki = gen_imagpart (submode, data->stack_parm);
2926 /* Scan backwards for the set of the real and
2928 for (sinsn = linsn; sinsn != 0;
2929 sinsn = prev_nonnote_insn (sinsn))
2931 set = single_set (sinsn);
2935 if (SET_DEST (set) == regno_reg_rtx [regnoi])
2937 = gen_rtx_EXPR_LIST (REG_EQUIV, stacki,
2939 else if (SET_DEST (set) == regno_reg_rtx [regnor])
2941 = gen_rtx_EXPR_LIST (REG_EQUIV, stackr,
2945 else if ((set = single_set (linsn)) != 0
2946 && SET_DEST (set) == parmreg)
2948 = gen_rtx_EXPR_LIST (REG_EQUIV,
2949 data->stack_parm, REG_NOTES (linsn));
2952 /* For pointer data type, suggest pointer register. */
2953 if (POINTER_TYPE_P (TREE_TYPE (parm)))
2954 mark_reg_pointer (parmreg,
2955 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
2958 /* A subroutine of assign_parms. Allocate stack space to hold the current
2959 parameter. Get it there. Perform all ABI specified conversions. */
2962 assign_parm_setup_stack (struct assign_parm_data_all *all, tree parm,
2963 struct assign_parm_data_one *data)
2965 /* Value must be stored in the stack slot STACK_PARM during function
2968 if (data->promoted_mode != data->nominal_mode)
2970 /* Conversion is required. */
2971 rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
2973 emit_move_insn (tempreg, validize_mem (data->entry_parm));
2975 push_to_sequence (all->conversion_insns);
2976 data->entry_parm = convert_to_mode (data->nominal_mode, tempreg,
2977 TYPE_UNSIGNED (TREE_TYPE (parm)));
2979 if (data->stack_parm)
2980 /* ??? This may need a big-endian conversion on sparc64. */
2982 = adjust_address (data->stack_parm, data->nominal_mode, 0);
2984 all->conversion_insns = get_insns ();
2988 if (data->entry_parm != data->stack_parm)
2990 if (data->stack_parm == 0)
2993 = assign_stack_local (GET_MODE (data->entry_parm),
2994 GET_MODE_SIZE (GET_MODE (data->entry_parm)),
2996 set_mem_attributes (data->stack_parm, parm, 1);
2999 if (data->promoted_mode != data->nominal_mode)
3001 push_to_sequence (all->conversion_insns);
3002 emit_move_insn (validize_mem (data->stack_parm),
3003 validize_mem (data->entry_parm));
3004 all->conversion_insns = get_insns ();
3008 emit_move_insn (validize_mem (data->stack_parm),
3009 validize_mem (data->entry_parm));
3012 SET_DECL_RTL (parm, data->stack_parm);
3015 /* A subroutine of assign_parms. If the ABI splits complex arguments, then
3016 undo the frobbing that we did in assign_parms_augmented_arg_list. */
3019 assign_parms_unsplit_complex (tree orig_fnargs, tree fnargs)
3023 for (parm = orig_fnargs; parm; parm = TREE_CHAIN (parm))
3025 if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
3026 && targetm.calls.split_complex_arg (TREE_TYPE (parm)))
3028 rtx tmp, real, imag;
3029 enum machine_mode inner = GET_MODE_INNER (DECL_MODE (parm));
3031 real = DECL_RTL (fnargs);
3032 imag = DECL_RTL (TREE_CHAIN (fnargs));
3033 if (inner != GET_MODE (real))
3035 real = gen_lowpart_SUBREG (inner, real);
3036 imag = gen_lowpart_SUBREG (inner, imag);
3038 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
3039 SET_DECL_RTL (parm, tmp);
3041 real = DECL_INCOMING_RTL (fnargs);
3042 imag = DECL_INCOMING_RTL (TREE_CHAIN (fnargs));
3043 if (inner != GET_MODE (real))
3045 real = gen_lowpart_SUBREG (inner, real);
3046 imag = gen_lowpart_SUBREG (inner, imag);
3048 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
3049 set_decl_incoming_rtl (parm, tmp);
3050 fnargs = TREE_CHAIN (fnargs);
3054 SET_DECL_RTL (parm, DECL_RTL (fnargs));
3055 set_decl_incoming_rtl (parm, DECL_INCOMING_RTL (fnargs));
3057 /* Set MEM_EXPR to the original decl, i.e. to PARM,
3058 instead of the copy of decl, i.e. FNARGS. */
3059 if (DECL_INCOMING_RTL (parm) && MEM_P (DECL_INCOMING_RTL (parm)))
3060 set_mem_expr (DECL_INCOMING_RTL (parm), parm);
3063 fnargs = TREE_CHAIN (fnargs);
3067 /* Assign RTL expressions to the function's parameters. This may involve
3068 copying them into registers and using those registers as the DECL_RTL. */
3071 assign_parms (tree fndecl)
3073 struct assign_parm_data_all all;
3075 rtx internal_arg_pointer;
3076 int varargs_setup = 0;
3078 /* If the reg that the virtual arg pointer will be translated into is
3079 not a fixed reg or is the stack pointer, make a copy of the virtual
3080 arg pointer, and address parms via the copy. The frame pointer is
3081 considered fixed even though it is not marked as such.
3083 The second time through, simply use ap to avoid generating rtx. */
3085 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
3086 || ! (fixed_regs[ARG_POINTER_REGNUM]
3087 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
3088 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
3090 internal_arg_pointer = virtual_incoming_args_rtx;
3091 current_function_internal_arg_pointer = internal_arg_pointer;
3093 assign_parms_initialize_all (&all);
3094 fnargs = assign_parms_augmented_arg_list (&all);
3096 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
3098 struct assign_parm_data_one data;
3100 /* Extract the type of PARM; adjust it according to ABI. */
3101 assign_parm_find_data_types (&all, parm, &data);
3103 /* Early out for errors and void parameters. */
3104 if (data.passed_mode == VOIDmode)
3106 SET_DECL_RTL (parm, const0_rtx);
3107 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
3111 /* Handle stdargs. LAST_NAMED is a slight mis-nomer; it's also true
3112 for the unnamed dummy argument following the last named argument.
3113 See ABI silliness wrt strict_argument_naming and NAMED_ARG. So
3114 we only want to do this when we get to the actual last named
3115 argument, which will be the first time LAST_NAMED gets set. */
3116 if (data.last_named && !varargs_setup)
3118 varargs_setup = true;
3119 assign_parms_setup_varargs (&all, &data, false);
3122 /* Find out where the parameter arrives in this function. */
3123 assign_parm_find_entry_rtl (&all, &data);
3125 /* Find out where stack space for this parameter might be. */
3126 if (assign_parm_is_stack_parm (&all, &data))
3128 assign_parm_find_stack_rtl (parm, &data);
3129 assign_parm_adjust_entry_rtl (&data);
3132 /* Record permanently how this parm was passed. */
3133 set_decl_incoming_rtl (parm, data.entry_parm);
3135 /* Update info on where next arg arrives in registers. */
3136 FUNCTION_ARG_ADVANCE (all.args_so_far, data.promoted_mode,
3137 data.passed_type, data.named_arg);
3139 assign_parm_adjust_stack_rtl (&data);
3141 if (assign_parm_setup_block_p (&data))
3142 assign_parm_setup_block (parm, &data);
3143 else if (data.passed_pointer || use_register_for_decl (parm))
3144 assign_parm_setup_reg (&all, parm, &data);
3146 assign_parm_setup_stack (&all, parm, &data);
3149 if (targetm.calls.split_complex_arg && fnargs != all.orig_fnargs)
3150 assign_parms_unsplit_complex (all.orig_fnargs, fnargs);
3152 /* Output all parameter conversion instructions (possibly including calls)
3153 now that all parameters have been copied out of hard registers. */
3154 emit_insn (all.conversion_insns);
3156 /* If we are receiving a struct value address as the first argument, set up
3157 the RTL for the function result. As this might require code to convert
3158 the transmitted address to Pmode, we do this here to ensure that possible
3159 preliminary conversions of the address have been emitted already. */
3160 if (all.function_result_decl)
3162 tree result = DECL_RESULT (current_function_decl);
3163 rtx addr = DECL_RTL (all.function_result_decl);
3166 addr = convert_memory_address (Pmode, addr);
3167 x = gen_rtx_MEM (DECL_MODE (result), addr);
3168 set_mem_attributes (x, result, 1);
3169 SET_DECL_RTL (result, x);
3172 /* We have aligned all the args, so add space for the pretend args. */
3173 current_function_pretend_args_size = all.pretend_args_size;
3174 all.stack_args_size.constant += all.extra_pretend_bytes;
3175 current_function_args_size = all.stack_args_size.constant;
3177 /* Adjust function incoming argument size for alignment and
3180 #ifdef REG_PARM_STACK_SPACE
3181 current_function_args_size = MAX (current_function_args_size,
3182 REG_PARM_STACK_SPACE (fndecl));
3185 current_function_args_size
3186 = ((current_function_args_size + STACK_BYTES - 1)
3187 / STACK_BYTES) * STACK_BYTES;
3189 #ifdef ARGS_GROW_DOWNWARD
3190 current_function_arg_offset_rtx
3191 = (all.stack_args_size.var == 0 ? GEN_INT (-all.stack_args_size.constant)
3192 : expand_expr (size_diffop (all.stack_args_size.var,
3193 size_int (-all.stack_args_size.constant)),
3194 NULL_RTX, VOIDmode, 0));
3196 current_function_arg_offset_rtx = ARGS_SIZE_RTX (all.stack_args_size);
3199 /* See how many bytes, if any, of its args a function should try to pop
3202 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
3203 current_function_args_size);
3205 /* For stdarg.h function, save info about
3206 regs and stack space used by the named args. */
3208 current_function_args_info = all.args_so_far;
3210 /* Set the rtx used for the function return value. Put this in its
3211 own variable so any optimizers that need this information don't have
3212 to include tree.h. Do this here so it gets done when an inlined
3213 function gets output. */
3215 current_function_return_rtx
3216 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
3217 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
3219 /* If scalar return value was computed in a pseudo-reg, or was a named
3220 return value that got dumped to the stack, copy that to the hard
3222 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
3224 tree decl_result = DECL_RESULT (fndecl);
3225 rtx decl_rtl = DECL_RTL (decl_result);
3227 if (REG_P (decl_rtl)
3228 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
3229 : DECL_REGISTER (decl_result))
3233 #ifdef FUNCTION_OUTGOING_VALUE
3234 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
3237 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
3240 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
3241 /* The delay slot scheduler assumes that current_function_return_rtx
3242 holds the hard register containing the return value, not a
3243 temporary pseudo. */
3244 current_function_return_rtx = real_decl_rtl;
3249 /* Indicate whether REGNO is an incoming argument to the current function
3250 that was promoted to a wider mode. If so, return the RTX for the
3251 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
3252 that REGNO is promoted from and whether the promotion was signed or
3256 promoted_input_arg (unsigned int regno, enum machine_mode *pmode, int *punsignedp)
3260 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
3261 arg = TREE_CHAIN (arg))
3262 if (REG_P (DECL_INCOMING_RTL (arg))
3263 && REGNO (DECL_INCOMING_RTL (arg)) == regno
3264 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
3266 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
3267 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (arg));
3269 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
3270 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
3271 && mode != DECL_MODE (arg))
3273 *pmode = DECL_MODE (arg);
3274 *punsignedp = unsignedp;
3275 return DECL_INCOMING_RTL (arg);
3283 /* Compute the size and offset from the start of the stacked arguments for a
3284 parm passed in mode PASSED_MODE and with type TYPE.
3286 INITIAL_OFFSET_PTR points to the current offset into the stacked
3289 The starting offset and size for this parm are returned in
3290 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
3291 nonzero, the offset is that of stack slot, which is returned in
3292 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
3293 padding required from the initial offset ptr to the stack slot.
3295 IN_REGS is nonzero if the argument will be passed in registers. It will
3296 never be set if REG_PARM_STACK_SPACE is not defined.
3298 FNDECL is the function in which the argument was defined.
3300 There are two types of rounding that are done. The first, controlled by
3301 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
3302 list to be aligned to the specific boundary (in bits). This rounding
3303 affects the initial and starting offsets, but not the argument size.
3305 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
3306 optionally rounds the size of the parm to PARM_BOUNDARY. The
3307 initial offset is not affected by this rounding, while the size always
3308 is and the starting offset may be. */
3310 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
3311 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
3312 callers pass in the total size of args so far as
3313 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
3316 locate_and_pad_parm (enum machine_mode passed_mode, tree type, int in_regs,
3317 int partial, tree fndecl ATTRIBUTE_UNUSED,
3318 struct args_size *initial_offset_ptr,
3319 struct locate_and_pad_arg_data *locate)
3322 enum direction where_pad;
3324 int reg_parm_stack_space = 0;
3325 int part_size_in_regs;
3327 #ifdef REG_PARM_STACK_SPACE
3328 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
3330 /* If we have found a stack parm before we reach the end of the
3331 area reserved for registers, skip that area. */
3334 if (reg_parm_stack_space > 0)
3336 if (initial_offset_ptr->var)
3338 initial_offset_ptr->var
3339 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
3340 ssize_int (reg_parm_stack_space));
3341 initial_offset_ptr->constant = 0;
3343 else if (initial_offset_ptr->constant < reg_parm_stack_space)
3344 initial_offset_ptr->constant = reg_parm_stack_space;
3347 #endif /* REG_PARM_STACK_SPACE */
3349 part_size_in_regs = 0;
3350 if (reg_parm_stack_space == 0)
3351 part_size_in_regs = ((partial * UNITS_PER_WORD)
3352 / (PARM_BOUNDARY / BITS_PER_UNIT)
3353 * (PARM_BOUNDARY / BITS_PER_UNIT));
3356 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
3357 where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
3358 boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
3359 locate->where_pad = where_pad;
3361 #ifdef ARGS_GROW_DOWNWARD
3362 locate->slot_offset.constant = -initial_offset_ptr->constant;
3363 if (initial_offset_ptr->var)
3364 locate->slot_offset.var = size_binop (MINUS_EXPR, ssize_int (0),
3365 initial_offset_ptr->var);
3369 if (where_pad != none
3370 && (!host_integerp (sizetree, 1)
3371 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
3372 s2 = round_up (s2, PARM_BOUNDARY / BITS_PER_UNIT);
3373 SUB_PARM_SIZE (locate->slot_offset, s2);
3376 locate->slot_offset.constant += part_size_in_regs;
3379 #ifdef REG_PARM_STACK_SPACE
3380 || REG_PARM_STACK_SPACE (fndecl) > 0
3383 pad_to_arg_alignment (&locate->slot_offset, boundary,
3384 &locate->alignment_pad);
3386 locate->size.constant = (-initial_offset_ptr->constant
3387 - locate->slot_offset.constant);
3388 if (initial_offset_ptr->var)
3389 locate->size.var = size_binop (MINUS_EXPR,
3390 size_binop (MINUS_EXPR,
3392 initial_offset_ptr->var),
3393 locate->slot_offset.var);
3395 /* Pad_below needs the pre-rounded size to know how much to pad
3397 locate->offset = locate->slot_offset;
3398 if (where_pad == downward)
3399 pad_below (&locate->offset, passed_mode, sizetree);
3401 #else /* !ARGS_GROW_DOWNWARD */
3403 #ifdef REG_PARM_STACK_SPACE
3404 || REG_PARM_STACK_SPACE (fndecl) > 0
3407 pad_to_arg_alignment (initial_offset_ptr, boundary,
3408 &locate->alignment_pad);
3409 locate->slot_offset = *initial_offset_ptr;
3411 #ifdef PUSH_ROUNDING
3412 if (passed_mode != BLKmode)
3413 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
3416 /* Pad_below needs the pre-rounded size to know how much to pad below
3417 so this must be done before rounding up. */
3418 locate->offset = locate->slot_offset;
3419 if (where_pad == downward)
3420 pad_below (&locate->offset, passed_mode, sizetree);
3422 if (where_pad != none
3423 && (!host_integerp (sizetree, 1)
3424 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
3425 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
3427 ADD_PARM_SIZE (locate->size, sizetree);
3429 locate->size.constant -= part_size_in_regs;
3430 #endif /* ARGS_GROW_DOWNWARD */
3433 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
3434 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
3437 pad_to_arg_alignment (struct args_size *offset_ptr, int boundary,
3438 struct args_size *alignment_pad)
3440 tree save_var = NULL_TREE;
3441 HOST_WIDE_INT save_constant = 0;
3442 int boundary_in_bytes = boundary / BITS_PER_UNIT;
3443 HOST_WIDE_INT sp_offset = STACK_POINTER_OFFSET;
3445 #ifdef SPARC_STACK_BOUNDARY_HACK
3446 /* The sparc port has a bug. It sometimes claims a STACK_BOUNDARY
3447 higher than the real alignment of %sp. However, when it does this,
3448 the alignment of %sp+STACK_POINTER_OFFSET will be STACK_BOUNDARY.
3449 This is a temporary hack while the sparc port is fixed. */
3450 if (SPARC_STACK_BOUNDARY_HACK)
3454 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3456 save_var = offset_ptr->var;
3457 save_constant = offset_ptr->constant;
3460 alignment_pad->var = NULL_TREE;
3461 alignment_pad->constant = 0;
3463 if (boundary > BITS_PER_UNIT)
3465 if (offset_ptr->var)
3467 tree sp_offset_tree = ssize_int (sp_offset);
3468 tree offset = size_binop (PLUS_EXPR,
3469 ARGS_SIZE_TREE (*offset_ptr),
3471 #ifdef ARGS_GROW_DOWNWARD
3472 tree rounded = round_down (offset, boundary / BITS_PER_UNIT);
3474 tree rounded = round_up (offset, boundary / BITS_PER_UNIT);
3477 offset_ptr->var = size_binop (MINUS_EXPR, rounded, sp_offset_tree);
3478 /* ARGS_SIZE_TREE includes constant term. */
3479 offset_ptr->constant = 0;
3480 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3481 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
3486 offset_ptr->constant = -sp_offset +
3487 #ifdef ARGS_GROW_DOWNWARD
3488 FLOOR_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
3490 CEIL_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
3492 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3493 alignment_pad->constant = offset_ptr->constant - save_constant;
3499 pad_below (struct args_size *offset_ptr, enum machine_mode passed_mode, tree sizetree)
3501 if (passed_mode != BLKmode)
3503 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
3504 offset_ptr->constant
3505 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
3506 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
3507 - GET_MODE_SIZE (passed_mode));
3511 if (TREE_CODE (sizetree) != INTEGER_CST
3512 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
3514 /* Round the size up to multiple of PARM_BOUNDARY bits. */
3515 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
3517 ADD_PARM_SIZE (*offset_ptr, s2);
3518 SUB_PARM_SIZE (*offset_ptr, sizetree);
3523 /* Walk the tree of blocks describing the binding levels within a function
3524 and warn about variables the might be killed by setjmp or vfork.
3525 This is done after calling flow_analysis and before global_alloc
3526 clobbers the pseudo-regs to hard regs. */
3529 setjmp_vars_warning (tree block)
3533 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
3535 if (TREE_CODE (decl) == VAR_DECL
3536 && DECL_RTL_SET_P (decl)
3537 && REG_P (DECL_RTL (decl))
3538 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
3539 warning ("%Jvariable '%D' might be clobbered by `longjmp' or `vfork'",
3543 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
3544 setjmp_vars_warning (sub);
3547 /* Do the appropriate part of setjmp_vars_warning
3548 but for arguments instead of local variables. */
3551 setjmp_args_warning (void)
3554 for (decl = DECL_ARGUMENTS (current_function_decl);
3555 decl; decl = TREE_CHAIN (decl))
3556 if (DECL_RTL (decl) != 0
3557 && REG_P (DECL_RTL (decl))
3558 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
3559 warning ("%Jargument '%D' might be clobbered by `longjmp' or `vfork'",
3564 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
3565 and create duplicate blocks. */
3566 /* ??? Need an option to either create block fragments or to create
3567 abstract origin duplicates of a source block. It really depends
3568 on what optimization has been performed. */
3571 reorder_blocks (void)
3573 tree block = DECL_INITIAL (current_function_decl);
3574 varray_type block_stack;
3576 if (block == NULL_TREE)
3579 VARRAY_TREE_INIT (block_stack, 10, "block_stack");
3581 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
3582 clear_block_marks (block);
3584 /* Prune the old trees away, so that they don't get in the way. */
3585 BLOCK_SUBBLOCKS (block) = NULL_TREE;
3586 BLOCK_CHAIN (block) = NULL_TREE;
3588 /* Recreate the block tree from the note nesting. */
3589 reorder_blocks_1 (get_insns (), block, &block_stack);
3590 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
3592 /* Remove deleted blocks from the block fragment chains. */
3593 reorder_fix_fragments (block);
3596 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
3599 clear_block_marks (tree block)
3603 TREE_ASM_WRITTEN (block) = 0;
3604 clear_block_marks (BLOCK_SUBBLOCKS (block));
3605 block = BLOCK_CHAIN (block);
3610 reorder_blocks_1 (rtx insns, tree current_block, varray_type *p_block_stack)
3614 for (insn = insns; insn; insn = NEXT_INSN (insn))
3618 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
3620 tree block = NOTE_BLOCK (insn);
3622 /* If we have seen this block before, that means it now
3623 spans multiple address regions. Create a new fragment. */
3624 if (TREE_ASM_WRITTEN (block))
3626 tree new_block = copy_node (block);
3629 origin = (BLOCK_FRAGMENT_ORIGIN (block)
3630 ? BLOCK_FRAGMENT_ORIGIN (block)
3632 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
3633 BLOCK_FRAGMENT_CHAIN (new_block)
3634 = BLOCK_FRAGMENT_CHAIN (origin);
3635 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
3637 NOTE_BLOCK (insn) = new_block;
3641 BLOCK_SUBBLOCKS (block) = 0;
3642 TREE_ASM_WRITTEN (block) = 1;
3643 /* When there's only one block for the entire function,
3644 current_block == block and we mustn't do this, it
3645 will cause infinite recursion. */
3646 if (block != current_block)
3648 BLOCK_SUPERCONTEXT (block) = current_block;
3649 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
3650 BLOCK_SUBBLOCKS (current_block) = block;
3651 current_block = block;
3653 VARRAY_PUSH_TREE (*p_block_stack, block);
3655 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
3657 NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack);
3658 VARRAY_POP (*p_block_stack);
3659 BLOCK_SUBBLOCKS (current_block)
3660 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
3661 current_block = BLOCK_SUPERCONTEXT (current_block);
3667 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
3668 appears in the block tree, select one of the fragments to become
3669 the new origin block. */
3672 reorder_fix_fragments (tree block)
3676 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
3677 tree new_origin = NULL_TREE;
3681 if (! TREE_ASM_WRITTEN (dup_origin))
3683 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
3685 /* Find the first of the remaining fragments. There must
3686 be at least one -- the current block. */
3687 while (! TREE_ASM_WRITTEN (new_origin))
3688 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
3689 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
3692 else if (! dup_origin)
3695 /* Re-root the rest of the fragments to the new origin. In the
3696 case that DUP_ORIGIN was null, that means BLOCK was the origin
3697 of a chain of fragments and we want to remove those fragments
3698 that didn't make it to the output. */
3701 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
3706 if (TREE_ASM_WRITTEN (chain))
3708 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
3710 pp = &BLOCK_FRAGMENT_CHAIN (chain);
3712 chain = BLOCK_FRAGMENT_CHAIN (chain);
3717 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
3718 block = BLOCK_CHAIN (block);
3722 /* Reverse the order of elements in the chain T of blocks,
3723 and return the new head of the chain (old last element). */
3726 blocks_nreverse (tree t)
3728 tree prev = 0, decl, next;
3729 for (decl = t; decl; decl = next)
3731 next = BLOCK_CHAIN (decl);
3732 BLOCK_CHAIN (decl) = prev;
3738 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
3739 non-NULL, list them all into VECTOR, in a depth-first preorder
3740 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
3744 all_blocks (tree block, tree *vector)
3750 TREE_ASM_WRITTEN (block) = 0;
3752 /* Record this block. */
3754 vector[n_blocks] = block;
3758 /* Record the subblocks, and their subblocks... */
3759 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
3760 vector ? vector + n_blocks : 0);
3761 block = BLOCK_CHAIN (block);
3767 /* Return a vector containing all the blocks rooted at BLOCK. The
3768 number of elements in the vector is stored in N_BLOCKS_P. The
3769 vector is dynamically allocated; it is the caller's responsibility
3770 to call `free' on the pointer returned. */
3773 get_block_vector (tree block, int *n_blocks_p)
3777 *n_blocks_p = all_blocks (block, NULL);
3778 block_vector = xmalloc (*n_blocks_p * sizeof (tree));
3779 all_blocks (block, block_vector);
3781 return block_vector;
3784 static GTY(()) int next_block_index = 2;
3786 /* Set BLOCK_NUMBER for all the blocks in FN. */
3789 number_blocks (tree fn)
3795 /* For SDB and XCOFF debugging output, we start numbering the blocks
3796 from 1 within each function, rather than keeping a running
3798 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
3799 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
3800 next_block_index = 1;
3803 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
3805 /* The top-level BLOCK isn't numbered at all. */
3806 for (i = 1; i < n_blocks; ++i)
3807 /* We number the blocks from two. */
3808 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
3810 free (block_vector);
3815 /* If VAR is present in a subblock of BLOCK, return the subblock. */
3818 debug_find_var_in_block_tree (tree var, tree block)
3822 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
3826 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
3828 tree ret = debug_find_var_in_block_tree (var, t);
3836 /* Allocate a function structure for FNDECL and set its contents
3840 allocate_struct_function (tree fndecl)
3843 tree fntype = fndecl ? TREE_TYPE (fndecl) : NULL_TREE;
3845 cfun = ggc_alloc_cleared (sizeof (struct function));
3847 cfun->stack_alignment_needed = STACK_BOUNDARY;
3848 cfun->preferred_stack_boundary = STACK_BOUNDARY;
3850 current_function_funcdef_no = funcdef_no++;
3852 cfun->function_frequency = FUNCTION_FREQUENCY_NORMAL;
3854 init_stmt_for_function ();
3855 init_eh_for_function ();
3857 lang_hooks.function.init (cfun);
3858 if (init_machine_status)
3859 cfun->machine = (*init_machine_status) ();
3864 DECL_STRUCT_FUNCTION (fndecl) = cfun;
3865 cfun->decl = fndecl;
3867 result = DECL_RESULT (fndecl);
3868 if (aggregate_value_p (result, fndecl))
3870 #ifdef PCC_STATIC_STRUCT_RETURN
3871 current_function_returns_pcc_struct = 1;
3873 current_function_returns_struct = 1;
3876 current_function_returns_pointer = POINTER_TYPE_P (TREE_TYPE (result));
3878 current_function_stdarg
3880 && TYPE_ARG_TYPES (fntype) != 0
3881 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
3882 != void_type_node));
3885 /* Reset cfun, and other non-struct-function variables to defaults as
3886 appropriate for emitting rtl at the start of a function. */
3889 prepare_function_start (tree fndecl)
3891 if (fndecl && DECL_STRUCT_FUNCTION (fndecl))
3892 cfun = DECL_STRUCT_FUNCTION (fndecl);
3894 allocate_struct_function (fndecl);
3896 init_varasm_status (cfun);
3899 cse_not_expected = ! optimize;
3901 /* Caller save not needed yet. */
3902 caller_save_needed = 0;
3904 /* We haven't done register allocation yet. */
3907 /* Indicate that we need to distinguish between the return value of the
3908 present function and the return value of a function being called. */
3909 rtx_equal_function_value_matters = 1;
3911 /* Indicate that we have not instantiated virtual registers yet. */
3912 virtuals_instantiated = 0;
3914 /* Indicate that we want CONCATs now. */
3915 generating_concat_p = 1;
3917 /* Indicate we have no need of a frame pointer yet. */
3918 frame_pointer_needed = 0;
3921 /* Initialize the rtl expansion mechanism so that we can do simple things
3922 like generate sequences. This is used to provide a context during global
3923 initialization of some passes. */
3925 init_dummy_function_start (void)
3927 prepare_function_start (NULL);
3930 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
3931 and initialize static variables for generating RTL for the statements
3935 init_function_start (tree subr)
3937 prepare_function_start (subr);
3939 /* Prevent ever trying to delete the first instruction of a
3940 function. Also tell final how to output a linenum before the
3941 function prologue. Note linenums could be missing, e.g. when
3942 compiling a Java .class file. */
3943 if (! DECL_IS_BUILTIN (subr))
3944 emit_line_note (DECL_SOURCE_LOCATION (subr));
3946 /* Make sure first insn is a note even if we don't want linenums.
3947 This makes sure the first insn will never be deleted.
3948 Also, final expects a note to appear there. */
3949 emit_note (NOTE_INSN_DELETED);
3951 /* Warn if this value is an aggregate type,
3952 regardless of which calling convention we are using for it. */
3953 if (warn_aggregate_return
3954 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
3955 warning ("function returns an aggregate");
3958 /* Make sure all values used by the optimization passes have sane
3961 init_function_for_compilation (void)
3965 /* No prologue/epilogue insns yet. */
3966 VARRAY_GROW (prologue, 0);
3967 VARRAY_GROW (epilogue, 0);
3968 VARRAY_GROW (sibcall_epilogue, 0);
3971 /* Expand a call to __main at the beginning of a possible main function. */
3973 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
3974 #undef HAS_INIT_SECTION
3975 #define HAS_INIT_SECTION
3979 expand_main_function (void)
3981 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
3982 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
3984 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
3988 /* Forcibly align the stack. */
3989 #ifdef STACK_GROWS_DOWNWARD
3990 tmp = expand_simple_binop (Pmode, AND, stack_pointer_rtx, GEN_INT(-align),
3991 stack_pointer_rtx, 1, OPTAB_WIDEN);
3993 tmp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
3994 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
3995 tmp = expand_simple_binop (Pmode, AND, tmp, GEN_INT (-align),
3996 stack_pointer_rtx, 1, OPTAB_WIDEN);
3998 if (tmp != stack_pointer_rtx)
3999 emit_move_insn (stack_pointer_rtx, tmp);
4001 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
4002 tmp = force_reg (Pmode, const0_rtx);
4003 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
4007 for (tmp = get_last_insn (); tmp; tmp = PREV_INSN (tmp))
4008 if (NOTE_P (tmp) && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_FUNCTION_BEG)
4011 emit_insn_before (seq, tmp);
4017 #ifndef HAS_INIT_SECTION
4018 emit_library_call (init_one_libfunc (NAME__MAIN), LCT_NORMAL, VOIDmode, 0);
4022 /* The PENDING_SIZES represent the sizes of variable-sized types.
4023 Create RTL for the various sizes now (using temporary variables),
4024 so that we can refer to the sizes from the RTL we are generating
4025 for the current function. The PENDING_SIZES are a TREE_LIST. The
4026 TREE_VALUE of each node is a SAVE_EXPR. */
4029 expand_pending_sizes (tree pending_sizes)
4033 /* Evaluate now the sizes of any types declared among the arguments. */
4034 for (tem = pending_sizes; tem; tem = TREE_CHAIN (tem))
4035 expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode, 0);
4038 /* Start the RTL for a new function, and set variables used for
4040 SUBR is the FUNCTION_DECL node.
4041 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
4042 the function's parameters, which must be run at any return statement. */
4045 expand_function_start (tree subr)
4047 /* Make sure volatile mem refs aren't considered
4048 valid operands of arithmetic insns. */
4049 init_recog_no_volatile ();
4051 current_function_profile
4053 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
4055 current_function_limit_stack
4056 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
4058 /* Make the label for return statements to jump to. Do not special
4059 case machines with special return instructions -- they will be
4060 handled later during jump, ifcvt, or epilogue creation. */
4061 return_label = gen_label_rtx ();
4063 /* Initialize rtx used to return the value. */
4064 /* Do this before assign_parms so that we copy the struct value address
4065 before any library calls that assign parms might generate. */
4067 /* Decide whether to return the value in memory or in a register. */
4068 if (aggregate_value_p (DECL_RESULT (subr), subr))
4070 /* Returning something that won't go in a register. */
4071 rtx value_address = 0;
4073 #ifdef PCC_STATIC_STRUCT_RETURN
4074 if (current_function_returns_pcc_struct)
4076 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
4077 value_address = assemble_static_space (size);
4082 rtx sv = targetm.calls.struct_value_rtx (TREE_TYPE (subr), 1);
4083 /* Expect to be passed the address of a place to store the value.
4084 If it is passed as an argument, assign_parms will take care of
4088 value_address = gen_reg_rtx (Pmode);
4089 emit_move_insn (value_address, sv);
4094 rtx x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), value_address);
4095 set_mem_attributes (x, DECL_RESULT (subr), 1);
4096 SET_DECL_RTL (DECL_RESULT (subr), x);
4099 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
4100 /* If return mode is void, this decl rtl should not be used. */
4101 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
4104 /* Compute the return values into a pseudo reg, which we will copy
4105 into the true return register after the cleanups are done. */
4107 /* In order to figure out what mode to use for the pseudo, we
4108 figure out what the mode of the eventual return register will
4109 actually be, and use that. */
4111 = hard_function_value (TREE_TYPE (DECL_RESULT (subr)),
4114 /* Structures that are returned in registers are not aggregate_value_p,
4115 so we may see a PARALLEL or a REG. */
4116 if (REG_P (hard_reg))
4117 SET_DECL_RTL (DECL_RESULT (subr), gen_reg_rtx (GET_MODE (hard_reg)));
4118 else if (GET_CODE (hard_reg) == PARALLEL)
4119 SET_DECL_RTL (DECL_RESULT (subr), gen_group_rtx (hard_reg));
4123 /* Set DECL_REGISTER flag so that expand_function_end will copy the
4124 result to the real return register(s). */
4125 DECL_REGISTER (DECL_RESULT (subr)) = 1;
4128 /* Initialize rtx for parameters and local variables.
4129 In some cases this requires emitting insns. */
4130 assign_parms (subr);
4132 /* If function gets a static chain arg, store it. */
4133 if (cfun->static_chain_decl)
4135 tree parm = cfun->static_chain_decl;
4136 rtx local = gen_reg_rtx (Pmode);
4138 set_decl_incoming_rtl (parm, static_chain_incoming_rtx);
4139 SET_DECL_RTL (parm, local);
4140 maybe_set_unchanging (local, parm);
4141 mark_reg_pointer (local, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
4143 emit_move_insn (local, static_chain_incoming_rtx);
4146 /* If the function receives a non-local goto, then store the
4147 bits we need to restore the frame pointer. */
4148 if (cfun->nonlocal_goto_save_area)
4153 /* ??? We need to do this save early. Unfortunately here is
4154 before the frame variable gets declared. Help out... */
4155 expand_var (TREE_OPERAND (cfun->nonlocal_goto_save_area, 0));
4157 t_save = build4 (ARRAY_REF, ptr_type_node,
4158 cfun->nonlocal_goto_save_area,
4159 integer_zero_node, NULL_TREE, NULL_TREE);
4160 r_save = expand_expr (t_save, NULL_RTX, VOIDmode, EXPAND_WRITE);
4161 r_save = convert_memory_address (Pmode, r_save);
4163 emit_move_insn (r_save, virtual_stack_vars_rtx);
4164 update_nonlocal_goto_save_area ();
4167 /* The following was moved from init_function_start.
4168 The move is supposed to make sdb output more accurate. */
4169 /* Indicate the beginning of the function body,
4170 as opposed to parm setup. */
4171 emit_note (NOTE_INSN_FUNCTION_BEG);
4173 if (!NOTE_P (get_last_insn ()))
4174 emit_note (NOTE_INSN_DELETED);
4175 parm_birth_insn = get_last_insn ();
4177 if (current_function_profile)
4180 PROFILE_HOOK (current_function_funcdef_no);
4184 /* After the display initializations is where the tail-recursion label
4185 should go, if we end up needing one. Ensure we have a NOTE here
4186 since some things (like trampolines) get placed before this. */
4187 tail_recursion_reentry = emit_note (NOTE_INSN_DELETED);
4189 /* Evaluate now the sizes of any types declared among the arguments. */
4190 expand_pending_sizes (nreverse (get_pending_sizes ()));
4192 /* Make sure there is a line number after the function entry setup code. */
4193 force_next_line_note ();
4196 /* Undo the effects of init_dummy_function_start. */
4198 expand_dummy_function_end (void)
4200 /* End any sequences that failed to be closed due to syntax errors. */
4201 while (in_sequence_p ())
4204 /* Outside function body, can't compute type's actual size
4205 until next function's body starts. */
4207 free_after_parsing (cfun);
4208 free_after_compilation (cfun);
4212 /* Call DOIT for each hard register used as a return value from
4213 the current function. */
4216 diddle_return_value (void (*doit) (rtx, void *), void *arg)
4218 rtx outgoing = current_function_return_rtx;
4223 if (REG_P (outgoing))
4224 (*doit) (outgoing, arg);
4225 else if (GET_CODE (outgoing) == PARALLEL)
4229 for (i = 0; i < XVECLEN (outgoing, 0); i++)
4231 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
4233 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
4240 do_clobber_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
4242 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
4246 clobber_return_register (void)
4248 diddle_return_value (do_clobber_return_reg, NULL);
4250 /* In case we do use pseudo to return value, clobber it too. */
4251 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
4253 tree decl_result = DECL_RESULT (current_function_decl);
4254 rtx decl_rtl = DECL_RTL (decl_result);
4255 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
4257 do_clobber_return_reg (decl_rtl, NULL);
4263 do_use_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
4265 emit_insn (gen_rtx_USE (VOIDmode, reg));
4269 use_return_register (void)
4271 diddle_return_value (do_use_return_reg, NULL);
4274 /* Possibly warn about unused parameters. */
4276 do_warn_unused_parameter (tree fn)
4280 for (decl = DECL_ARGUMENTS (fn);
4281 decl; decl = TREE_CHAIN (decl))
4282 if (!TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
4283 && DECL_NAME (decl) && !DECL_ARTIFICIAL (decl))
4284 warning ("%Junused parameter '%D'", decl, decl);
4287 static GTY(()) rtx initial_trampoline;
4289 /* Generate RTL for the end of the current function. */
4292 expand_function_end (void)
4296 /* If arg_pointer_save_area was referenced only from a nested
4297 function, we will not have initialized it yet. Do that now. */
4298 if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
4299 get_arg_pointer_save_area (cfun);
4301 /* If we are doing stack checking and this function makes calls,
4302 do a stack probe at the start of the function to ensure we have enough
4303 space for another stack frame. */
4304 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
4308 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4312 probe_stack_range (STACK_CHECK_PROTECT,
4313 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
4316 emit_insn_before (seq, tail_recursion_reentry);
4321 /* Possibly warn about unused parameters.
4322 When frontend does unit-at-a-time, the warning is already
4323 issued at finalization time. */
4324 if (warn_unused_parameter
4325 && !lang_hooks.callgraph.expand_function)
4326 do_warn_unused_parameter (current_function_decl);
4328 /* End any sequences that failed to be closed due to syntax errors. */
4329 while (in_sequence_p ())
4332 clear_pending_stack_adjust ();
4333 do_pending_stack_adjust ();
4335 /* @@@ This is a kludge. We want to ensure that instructions that
4336 may trap are not moved into the epilogue by scheduling, because
4337 we don't always emit unwind information for the epilogue.
4338 However, not all machine descriptions define a blockage insn, so
4339 emit an ASM_INPUT to act as one. */
4340 if (flag_non_call_exceptions)
4341 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, ""));
4343 /* Mark the end of the function body.
4344 If control reaches this insn, the function can drop through
4345 without returning a value. */
4346 emit_note (NOTE_INSN_FUNCTION_END);
4348 /* Must mark the last line number note in the function, so that the test
4349 coverage code can avoid counting the last line twice. This just tells
4350 the code to ignore the immediately following line note, since there
4351 already exists a copy of this note somewhere above. This line number
4352 note is still needed for debugging though, so we can't delete it. */
4353 if (flag_test_coverage)
4354 emit_note (NOTE_INSN_REPEATED_LINE_NUMBER);
4356 /* Output a linenumber for the end of the function.
4357 SDB depends on this. */
4358 force_next_line_note ();
4359 emit_line_note (input_location);
4361 /* Before the return label (if any), clobber the return
4362 registers so that they are not propagated live to the rest of
4363 the function. This can only happen with functions that drop
4364 through; if there had been a return statement, there would
4365 have either been a return rtx, or a jump to the return label.
4367 We delay actual code generation after the current_function_value_rtx
4369 clobber_after = get_last_insn ();
4371 /* Output the label for the actual return from the function,
4372 if one is expected. This happens either because a function epilogue
4373 is used instead of a return instruction, or because a return was done
4374 with a goto in order to run local cleanups, or because of pcc-style
4375 structure returning. */
4377 emit_label (return_label);
4379 /* Let except.c know where it should emit the call to unregister
4380 the function context for sjlj exceptions. */
4381 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
4382 sjlj_emit_function_exit_after (get_last_insn ());
4384 /* If we had calls to alloca, and this machine needs
4385 an accurate stack pointer to exit the function,
4386 insert some code to save and restore the stack pointer. */
4387 if (! EXIT_IGNORE_STACK
4388 && current_function_calls_alloca)
4392 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
4393 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
4396 /* If scalar return value was computed in a pseudo-reg, or was a named
4397 return value that got dumped to the stack, copy that to the hard
4399 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
4401 tree decl_result = DECL_RESULT (current_function_decl);
4402 rtx decl_rtl = DECL_RTL (decl_result);
4404 if (REG_P (decl_rtl)
4405 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
4406 : DECL_REGISTER (decl_result))
4408 rtx real_decl_rtl = current_function_return_rtx;
4410 /* This should be set in assign_parms. */
4411 if (! REG_FUNCTION_VALUE_P (real_decl_rtl))
4414 /* If this is a BLKmode structure being returned in registers,
4415 then use the mode computed in expand_return. Note that if
4416 decl_rtl is memory, then its mode may have been changed,
4417 but that current_function_return_rtx has not. */
4418 if (GET_MODE (real_decl_rtl) == BLKmode)
4419 PUT_MODE (real_decl_rtl, GET_MODE (decl_rtl));
4421 /* If a named return value dumped decl_return to memory, then
4422 we may need to re-do the PROMOTE_MODE signed/unsigned
4424 if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
4426 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (decl_result));
4428 if (targetm.calls.promote_function_return (TREE_TYPE (current_function_decl)))
4429 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
4432 convert_move (real_decl_rtl, decl_rtl, unsignedp);
4434 else if (GET_CODE (real_decl_rtl) == PARALLEL)
4436 /* If expand_function_start has created a PARALLEL for decl_rtl,
4437 move the result to the real return registers. Otherwise, do
4438 a group load from decl_rtl for a named return. */
4439 if (GET_CODE (decl_rtl) == PARALLEL)
4440 emit_group_move (real_decl_rtl, decl_rtl);
4442 emit_group_load (real_decl_rtl, decl_rtl,
4443 TREE_TYPE (decl_result),
4444 int_size_in_bytes (TREE_TYPE (decl_result)));
4447 emit_move_insn (real_decl_rtl, decl_rtl);
4451 /* If returning a structure, arrange to return the address of the value
4452 in a place where debuggers expect to find it.
4454 If returning a structure PCC style,
4455 the caller also depends on this value.
4456 And current_function_returns_pcc_struct is not necessarily set. */
4457 if (current_function_returns_struct
4458 || current_function_returns_pcc_struct)
4461 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
4462 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
4463 #ifdef FUNCTION_OUTGOING_VALUE
4465 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
4466 current_function_decl);
4469 = FUNCTION_VALUE (build_pointer_type (type), current_function_decl);
4472 /* Mark this as a function return value so integrate will delete the
4473 assignment and USE below when inlining this function. */
4474 REG_FUNCTION_VALUE_P (outgoing) = 1;
4476 /* The address may be ptr_mode and OUTGOING may be Pmode. */
4477 value_address = convert_memory_address (GET_MODE (outgoing),
4480 emit_move_insn (outgoing, value_address);
4482 /* Show return register used to hold result (in this case the address
4484 current_function_return_rtx = outgoing;
4487 /* If this is an implementation of throw, do what's necessary to
4488 communicate between __builtin_eh_return and the epilogue. */
4489 expand_eh_return ();
4491 /* Emit the actual code to clobber return register. */
4496 clobber_return_register ();
4500 after = emit_insn_after (seq, clobber_after);
4503 /* Output the label for the naked return from the function, if one is
4504 expected. This is currently used only by __builtin_return. */
4505 if (naked_return_label)
4506 emit_label (naked_return_label);
4508 /* ??? This should no longer be necessary since stupid is no longer with
4509 us, but there are some parts of the compiler (eg reload_combine, and
4510 sh mach_dep_reorg) that still try and compute their own lifetime info
4511 instead of using the general framework. */
4512 use_return_register ();
4516 get_arg_pointer_save_area (struct function *f)
4518 rtx ret = f->x_arg_pointer_save_area;
4522 ret = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, f);
4523 f->x_arg_pointer_save_area = ret;
4526 if (f == cfun && ! f->arg_pointer_save_area_init)
4530 /* Save the arg pointer at the beginning of the function. The
4531 generated stack slot may not be a valid memory address, so we
4532 have to check it and fix it if necessary. */
4534 emit_move_insn (validize_mem (ret), virtual_incoming_args_rtx);
4538 push_topmost_sequence ();
4539 emit_insn_after (seq, get_insns ());
4540 pop_topmost_sequence ();
4546 /* Extend a vector that records the INSN_UIDs of INSNS
4547 (a list of one or more insns). */
4550 record_insns (rtx insns, varray_type *vecp)
4557 while (tmp != NULL_RTX)
4560 tmp = NEXT_INSN (tmp);
4563 i = VARRAY_SIZE (*vecp);
4564 VARRAY_GROW (*vecp, i + len);
4566 while (tmp != NULL_RTX)
4568 VARRAY_INT (*vecp, i) = INSN_UID (tmp);
4570 tmp = NEXT_INSN (tmp);
4574 /* Set the locator of the insn chain starting at INSN to LOC. */
4576 set_insn_locators (rtx insn, int loc)
4578 while (insn != NULL_RTX)
4581 INSN_LOCATOR (insn) = loc;
4582 insn = NEXT_INSN (insn);
4586 /* Determine how many INSN_UIDs in VEC are part of INSN. Because we can
4587 be running after reorg, SEQUENCE rtl is possible. */
4590 contains (rtx insn, varray_type vec)
4594 if (NONJUMP_INSN_P (insn)
4595 && GET_CODE (PATTERN (insn)) == SEQUENCE)
4598 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
4599 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
4600 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j))
4606 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
4607 if (INSN_UID (insn) == VARRAY_INT (vec, j))
4614 prologue_epilogue_contains (rtx insn)
4616 if (contains (insn, prologue))
4618 if (contains (insn, epilogue))
4624 sibcall_epilogue_contains (rtx insn)
4626 if (sibcall_epilogue)
4627 return contains (insn, sibcall_epilogue);
4632 /* Insert gen_return at the end of block BB. This also means updating
4633 block_for_insn appropriately. */
4636 emit_return_into_block (basic_block bb, rtx line_note)
4638 emit_jump_insn_after (gen_return (), BB_END (bb));
4640 emit_note_copy_after (line_note, PREV_INSN (BB_END (bb)));
4642 #endif /* HAVE_return */
4644 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
4646 /* These functions convert the epilogue into a variant that does not modify the
4647 stack pointer. This is used in cases where a function returns an object
4648 whose size is not known until it is computed. The called function leaves the
4649 object on the stack, leaves the stack depressed, and returns a pointer to
4652 What we need to do is track all modifications and references to the stack
4653 pointer, deleting the modifications and changing the references to point to
4654 the location the stack pointer would have pointed to had the modifications
4657 These functions need to be portable so we need to make as few assumptions
4658 about the epilogue as we can. However, the epilogue basically contains
4659 three things: instructions to reset the stack pointer, instructions to
4660 reload registers, possibly including the frame pointer, and an
4661 instruction to return to the caller.
4663 If we can't be sure of what a relevant epilogue insn is doing, we abort.
4664 We also make no attempt to validate the insns we make since if they are
4665 invalid, we probably can't do anything valid. The intent is that these
4666 routines get "smarter" as more and more machines start to use them and
4667 they try operating on different epilogues.
4669 We use the following structure to track what the part of the epilogue that
4670 we've already processed has done. We keep two copies of the SP equivalence,
4671 one for use during the insn we are processing and one for use in the next
4672 insn. The difference is because one part of a PARALLEL may adjust SP
4673 and the other may use it. */
4677 rtx sp_equiv_reg; /* REG that SP is set from, perhaps SP. */
4678 HOST_WIDE_INT sp_offset; /* Offset from SP_EQUIV_REG of present SP. */
4679 rtx new_sp_equiv_reg; /* REG to be used at end of insn. */
4680 HOST_WIDE_INT new_sp_offset; /* Offset to be used at end of insn. */
4681 rtx equiv_reg_src; /* If nonzero, the value that SP_EQUIV_REG
4682 should be set to once we no longer need
4684 rtx const_equiv[FIRST_PSEUDO_REGISTER]; /* Any known constant equivalences
4688 static void handle_epilogue_set (rtx, struct epi_info *);
4689 static void update_epilogue_consts (rtx, rtx, void *);
4690 static void emit_equiv_load (struct epi_info *);
4692 /* Modify INSN, a list of one or more insns that is part of the epilogue, to
4693 no modifications to the stack pointer. Return the new list of insns. */
4696 keep_stack_depressed (rtx insns)
4699 struct epi_info info;
4702 /* If the epilogue is just a single instruction, it must be OK as is. */
4703 if (NEXT_INSN (insns) == NULL_RTX)
4706 /* Otherwise, start a sequence, initialize the information we have, and
4707 process all the insns we were given. */
4710 info.sp_equiv_reg = stack_pointer_rtx;
4712 info.equiv_reg_src = 0;
4714 for (j = 0; j < FIRST_PSEUDO_REGISTER; j++)
4715 info.const_equiv[j] = 0;
4719 while (insn != NULL_RTX)
4721 next = NEXT_INSN (insn);
4730 /* If this insn references the register that SP is equivalent to and
4731 we have a pending load to that register, we must force out the load
4732 first and then indicate we no longer know what SP's equivalent is. */
4733 if (info.equiv_reg_src != 0
4734 && reg_referenced_p (info.sp_equiv_reg, PATTERN (insn)))
4736 emit_equiv_load (&info);
4737 info.sp_equiv_reg = 0;
4740 info.new_sp_equiv_reg = info.sp_equiv_reg;
4741 info.new_sp_offset = info.sp_offset;
4743 /* If this is a (RETURN) and the return address is on the stack,
4744 update the address and change to an indirect jump. */
4745 if (GET_CODE (PATTERN (insn)) == RETURN
4746 || (GET_CODE (PATTERN (insn)) == PARALLEL
4747 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
4749 rtx retaddr = INCOMING_RETURN_ADDR_RTX;
4751 HOST_WIDE_INT offset = 0;
4752 rtx jump_insn, jump_set;
4754 /* If the return address is in a register, we can emit the insn
4755 unchanged. Otherwise, it must be a MEM and we see what the
4756 base register and offset are. In any case, we have to emit any
4757 pending load to the equivalent reg of SP, if any. */
4758 if (REG_P (retaddr))
4760 emit_equiv_load (&info);
4765 else if (MEM_P (retaddr)
4766 && REG_P (XEXP (retaddr, 0)))
4767 base = gen_rtx_REG (Pmode, REGNO (XEXP (retaddr, 0))), offset = 0;
4768 else if (MEM_P (retaddr)
4769 && GET_CODE (XEXP (retaddr, 0)) == PLUS
4770 && REG_P (XEXP (XEXP (retaddr, 0), 0))
4771 && GET_CODE (XEXP (XEXP (retaddr, 0), 1)) == CONST_INT)
4773 base = gen_rtx_REG (Pmode, REGNO (XEXP (XEXP (retaddr, 0), 0)));
4774 offset = INTVAL (XEXP (XEXP (retaddr, 0), 1));
4779 /* If the base of the location containing the return pointer
4780 is SP, we must update it with the replacement address. Otherwise,
4781 just build the necessary MEM. */
4782 retaddr = plus_constant (base, offset);
4783 if (base == stack_pointer_rtx)
4784 retaddr = simplify_replace_rtx (retaddr, stack_pointer_rtx,
4785 plus_constant (info.sp_equiv_reg,
4788 retaddr = gen_rtx_MEM (Pmode, retaddr);
4790 /* If there is a pending load to the equivalent register for SP
4791 and we reference that register, we must load our address into
4792 a scratch register and then do that load. */
4793 if (info.equiv_reg_src
4794 && reg_overlap_mentioned_p (info.equiv_reg_src, retaddr))
4799 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
4800 if (HARD_REGNO_MODE_OK (regno, Pmode)
4801 && !fixed_regs[regno]
4802 && TEST_HARD_REG_BIT (regs_invalidated_by_call, regno)
4803 && !REGNO_REG_SET_P (EXIT_BLOCK_PTR->global_live_at_start,
4805 && !refers_to_regno_p (regno,
4806 regno + hard_regno_nregs[regno]
4808 info.equiv_reg_src, NULL)
4809 && info.const_equiv[regno] == 0)
4812 if (regno == FIRST_PSEUDO_REGISTER)
4815 reg = gen_rtx_REG (Pmode, regno);
4816 emit_move_insn (reg, retaddr);
4820 emit_equiv_load (&info);
4821 jump_insn = emit_jump_insn (gen_indirect_jump (retaddr));
4823 /* Show the SET in the above insn is a RETURN. */
4824 jump_set = single_set (jump_insn);
4828 SET_IS_RETURN_P (jump_set) = 1;
4831 /* If SP is not mentioned in the pattern and its equivalent register, if
4832 any, is not modified, just emit it. Otherwise, if neither is set,
4833 replace the reference to SP and emit the insn. If none of those are
4834 true, handle each SET individually. */
4835 else if (!reg_mentioned_p (stack_pointer_rtx, PATTERN (insn))
4836 && (info.sp_equiv_reg == stack_pointer_rtx
4837 || !reg_set_p (info.sp_equiv_reg, insn)))
4839 else if (! reg_set_p (stack_pointer_rtx, insn)
4840 && (info.sp_equiv_reg == stack_pointer_rtx
4841 || !reg_set_p (info.sp_equiv_reg, insn)))
4843 if (! validate_replace_rtx (stack_pointer_rtx,
4844 plus_constant (info.sp_equiv_reg,
4851 else if (GET_CODE (PATTERN (insn)) == SET)
4852 handle_epilogue_set (PATTERN (insn), &info);
4853 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
4855 for (j = 0; j < XVECLEN (PATTERN (insn), 0); j++)
4856 if (GET_CODE (XVECEXP (PATTERN (insn), 0, j)) == SET)
4857 handle_epilogue_set (XVECEXP (PATTERN (insn), 0, j), &info);
4862 info.sp_equiv_reg = info.new_sp_equiv_reg;
4863 info.sp_offset = info.new_sp_offset;
4865 /* Now update any constants this insn sets. */
4866 note_stores (PATTERN (insn), update_epilogue_consts, &info);
4870 insns = get_insns ();
4875 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
4876 structure that contains information about what we've seen so far. We
4877 process this SET by either updating that data or by emitting one or
4881 handle_epilogue_set (rtx set, struct epi_info *p)
4883 /* First handle the case where we are setting SP. Record what it is being
4884 set from. If unknown, abort. */
4885 if (reg_set_p (stack_pointer_rtx, set))
4887 if (SET_DEST (set) != stack_pointer_rtx)
4890 if (GET_CODE (SET_SRC (set)) == PLUS)
4892 p->new_sp_equiv_reg = XEXP (SET_SRC (set), 0);
4893 if (GET_CODE (XEXP (SET_SRC (set), 1)) == CONST_INT)
4894 p->new_sp_offset = INTVAL (XEXP (SET_SRC (set), 1));
4895 else if (REG_P (XEXP (SET_SRC (set), 1))
4896 && REGNO (XEXP (SET_SRC (set), 1)) < FIRST_PSEUDO_REGISTER
4897 && p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))] != 0)
4899 = INTVAL (p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
4904 p->new_sp_equiv_reg = SET_SRC (set), p->new_sp_offset = 0;
4906 /* If we are adjusting SP, we adjust from the old data. */
4907 if (p->new_sp_equiv_reg == stack_pointer_rtx)
4909 p->new_sp_equiv_reg = p->sp_equiv_reg;
4910 p->new_sp_offset += p->sp_offset;
4913 if (p->new_sp_equiv_reg == 0 || !REG_P (p->new_sp_equiv_reg))
4919 /* Next handle the case where we are setting SP's equivalent register.
4920 If we already have a value to set it to, abort. We could update, but
4921 there seems little point in handling that case. Note that we have
4922 to allow for the case where we are setting the register set in
4923 the previous part of a PARALLEL inside a single insn. But use the
4924 old offset for any updates within this insn. We must allow for the case
4925 where the register is being set in a different (usually wider) mode than
4927 else if (p->new_sp_equiv_reg != 0 && reg_set_p (p->new_sp_equiv_reg, set))
4929 if (p->equiv_reg_src != 0
4930 || !REG_P (p->new_sp_equiv_reg)
4931 || !REG_P (SET_DEST (set))
4932 || GET_MODE_BITSIZE (GET_MODE (SET_DEST (set))) > BITS_PER_WORD
4933 || REGNO (p->new_sp_equiv_reg) != REGNO (SET_DEST (set)))
4937 = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
4938 plus_constant (p->sp_equiv_reg,
4942 /* Otherwise, replace any references to SP in the insn to its new value
4943 and emit the insn. */
4946 SET_SRC (set) = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
4947 plus_constant (p->sp_equiv_reg,
4949 SET_DEST (set) = simplify_replace_rtx (SET_DEST (set), stack_pointer_rtx,
4950 plus_constant (p->sp_equiv_reg,
4956 /* Update the tracking information for registers set to constants. */
4959 update_epilogue_consts (rtx dest, rtx x, void *data)
4961 struct epi_info *p = (struct epi_info *) data;
4964 if (!REG_P (dest) || REGNO (dest) >= FIRST_PSEUDO_REGISTER)
4967 /* If we are either clobbering a register or doing a partial set,
4968 show we don't know the value. */
4969 else if (GET_CODE (x) == CLOBBER || ! rtx_equal_p (dest, SET_DEST (x)))
4970 p->const_equiv[REGNO (dest)] = 0;
4972 /* If we are setting it to a constant, record that constant. */
4973 else if (GET_CODE (SET_SRC (x)) == CONST_INT)
4974 p->const_equiv[REGNO (dest)] = SET_SRC (x);
4976 /* If this is a binary operation between a register we have been tracking
4977 and a constant, see if we can compute a new constant value. */
4978 else if (ARITHMETIC_P (SET_SRC (x))
4979 && REG_P (XEXP (SET_SRC (x), 0))
4980 && REGNO (XEXP (SET_SRC (x), 0)) < FIRST_PSEUDO_REGISTER
4981 && p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))] != 0
4982 && GET_CODE (XEXP (SET_SRC (x), 1)) == CONST_INT
4983 && 0 != (new = simplify_binary_operation
4984 (GET_CODE (SET_SRC (x)), GET_MODE (dest),
4985 p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))],
4986 XEXP (SET_SRC (x), 1)))
4987 && GET_CODE (new) == CONST_INT)
4988 p->const_equiv[REGNO (dest)] = new;
4990 /* Otherwise, we can't do anything with this value. */
4992 p->const_equiv[REGNO (dest)] = 0;
4995 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
4998 emit_equiv_load (struct epi_info *p)
5000 if (p->equiv_reg_src != 0)
5002 rtx dest = p->sp_equiv_reg;
5004 if (GET_MODE (p->equiv_reg_src) != GET_MODE (dest))
5005 dest = gen_rtx_REG (GET_MODE (p->equiv_reg_src),
5006 REGNO (p->sp_equiv_reg));
5008 emit_move_insn (dest, p->equiv_reg_src);
5009 p->equiv_reg_src = 0;
5014 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
5015 this into place with notes indicating where the prologue ends and where
5016 the epilogue begins. Update the basic block information when possible. */
5019 thread_prologue_and_epilogue_insns (rtx f ATTRIBUTE_UNUSED)
5023 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
5026 #ifdef HAVE_prologue
5027 rtx prologue_end = NULL_RTX;
5029 #if defined (HAVE_epilogue) || defined(HAVE_return)
5030 rtx epilogue_end = NULL_RTX;
5033 #ifdef HAVE_prologue
5037 seq = gen_prologue ();
5040 /* Retain a map of the prologue insns. */
5041 record_insns (seq, &prologue);
5042 prologue_end = emit_note (NOTE_INSN_PROLOGUE_END);
5046 set_insn_locators (seq, prologue_locator);
5048 /* Can't deal with multiple successors of the entry block
5049 at the moment. Function should always have at least one
5051 if (!ENTRY_BLOCK_PTR->succ || ENTRY_BLOCK_PTR->succ->succ_next)
5054 insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ);
5059 /* If the exit block has no non-fake predecessors, we don't need
5061 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5062 if ((e->flags & EDGE_FAKE) == 0)
5068 if (optimize && HAVE_return)
5070 /* If we're allowed to generate a simple return instruction,
5071 then by definition we don't need a full epilogue. Examine
5072 the block that falls through to EXIT. If it does not
5073 contain any code, examine its predecessors and try to
5074 emit (conditional) return instructions. */
5080 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5081 if (e->flags & EDGE_FALLTHRU)
5087 /* Verify that there are no active instructions in the last block. */
5088 label = BB_END (last);
5089 while (label && !LABEL_P (label))
5091 if (active_insn_p (label))
5093 label = PREV_INSN (label);
5096 if (BB_HEAD (last) == label && LABEL_P (label))
5098 rtx epilogue_line_note = NULL_RTX;
5100 /* Locate the line number associated with the closing brace,
5101 if we can find one. */
5102 for (seq = get_last_insn ();
5103 seq && ! active_insn_p (seq);
5104 seq = PREV_INSN (seq))
5105 if (NOTE_P (seq) && NOTE_LINE_NUMBER (seq) > 0)
5107 epilogue_line_note = seq;
5111 for (e = last->pred; e; e = e_next)
5113 basic_block bb = e->src;
5116 e_next = e->pred_next;
5117 if (bb == ENTRY_BLOCK_PTR)
5121 if (!JUMP_P (jump) || JUMP_LABEL (jump) != label)
5124 /* If we have an unconditional jump, we can replace that
5125 with a simple return instruction. */
5126 if (simplejump_p (jump))
5128 emit_return_into_block (bb, epilogue_line_note);
5132 /* If we have a conditional jump, we can try to replace
5133 that with a conditional return instruction. */
5134 else if (condjump_p (jump))
5136 if (! redirect_jump (jump, 0, 0))
5139 /* If this block has only one successor, it both jumps
5140 and falls through to the fallthru block, so we can't
5142 if (bb->succ->succ_next == NULL)
5148 /* Fix up the CFG for the successful change we just made. */
5149 redirect_edge_succ (e, EXIT_BLOCK_PTR);
5152 /* Emit a return insn for the exit fallthru block. Whether
5153 this is still reachable will be determined later. */
5155 emit_barrier_after (BB_END (last));
5156 emit_return_into_block (last, epilogue_line_note);
5157 epilogue_end = BB_END (last);
5158 last->succ->flags &= ~EDGE_FALLTHRU;
5163 /* Find the edge that falls through to EXIT. Other edges may exist
5164 due to RETURN instructions, but those don't need epilogues.
5165 There really shouldn't be a mixture -- either all should have
5166 been converted or none, however... */
5168 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5169 if (e->flags & EDGE_FALLTHRU)
5174 #ifdef HAVE_epilogue
5178 epilogue_end = emit_note (NOTE_INSN_EPILOGUE_BEG);
5180 seq = gen_epilogue ();
5182 #ifdef INCOMING_RETURN_ADDR_RTX
5183 /* If this function returns with the stack depressed and we can support
5184 it, massage the epilogue to actually do that. */
5185 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
5186 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
5187 seq = keep_stack_depressed (seq);
5190 emit_jump_insn (seq);
5192 /* Retain a map of the epilogue insns. */
5193 record_insns (seq, &epilogue);
5194 set_insn_locators (seq, epilogue_locator);
5199 insert_insn_on_edge (seq, e);
5207 if (! next_active_insn (BB_END (e->src)))
5209 /* We have a fall-through edge to the exit block, the source is not
5210 at the end of the function, and there will be an assembler epilogue
5211 at the end of the function.
5212 We can't use force_nonfallthru here, because that would try to
5213 use return. Inserting a jump 'by hand' is extremely messy, so
5214 we take advantage of cfg_layout_finalize using
5215 fixup_fallthru_exit_predecessor. */
5216 cfg_layout_initialize (0);
5217 FOR_EACH_BB (cur_bb)
5218 if (cur_bb->index >= 0 && cur_bb->next_bb->index >= 0)
5219 cur_bb->rbi->next = cur_bb->next_bb;
5220 cfg_layout_finalize ();
5225 commit_edge_insertions ();
5227 #ifdef HAVE_sibcall_epilogue
5228 /* Emit sibling epilogues before any sibling call sites. */
5229 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
5231 basic_block bb = e->src;
5232 rtx insn = BB_END (bb);
5237 || ! SIBLING_CALL_P (insn))
5241 emit_insn (gen_sibcall_epilogue ());
5245 /* Retain a map of the epilogue insns. Used in life analysis to
5246 avoid getting rid of sibcall epilogue insns. Do this before we
5247 actually emit the sequence. */
5248 record_insns (seq, &sibcall_epilogue);
5249 set_insn_locators (seq, epilogue_locator);
5251 i = PREV_INSN (insn);
5252 newinsn = emit_insn_before (seq, insn);
5256 #ifdef HAVE_prologue
5257 /* This is probably all useless now that we use locators. */
5262 /* GDB handles `break f' by setting a breakpoint on the first
5263 line note after the prologue. Which means (1) that if
5264 there are line number notes before where we inserted the
5265 prologue we should move them, and (2) we should generate a
5266 note before the end of the first basic block, if there isn't
5269 ??? This behavior is completely broken when dealing with
5270 multiple entry functions. We simply place the note always
5271 into first basic block and let alternate entry points
5275 for (insn = prologue_end; insn; insn = prev)
5277 prev = PREV_INSN (insn);
5278 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5280 /* Note that we cannot reorder the first insn in the
5281 chain, since rest_of_compilation relies on that
5282 remaining constant. */
5285 reorder_insns (insn, insn, prologue_end);
5289 /* Find the last line number note in the first block. */
5290 for (insn = BB_END (ENTRY_BLOCK_PTR->next_bb);
5291 insn != prologue_end && insn;
5292 insn = PREV_INSN (insn))
5293 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5296 /* If we didn't find one, make a copy of the first line number
5300 for (insn = next_active_insn (prologue_end);
5302 insn = PREV_INSN (insn))
5303 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5305 emit_note_copy_after (insn, prologue_end);
5311 #ifdef HAVE_epilogue
5316 /* Similarly, move any line notes that appear after the epilogue.
5317 There is no need, however, to be quite so anal about the existence
5318 of such a note. Also move the NOTE_INSN_FUNCTION_END and (possibly)
5319 NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
5321 for (insn = epilogue_end; insn; insn = next)
5323 next = NEXT_INSN (insn);
5325 && (NOTE_LINE_NUMBER (insn) > 0
5326 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG
5327 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_END))
5328 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
5334 /* Reposition the prologue-end and epilogue-begin notes after instruction
5335 scheduling and delayed branch scheduling. */
5338 reposition_prologue_and_epilogue_notes (rtx f ATTRIBUTE_UNUSED)
5340 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
5341 rtx insn, last, note;
5344 if ((len = VARRAY_SIZE (prologue)) > 0)
5348 /* Scan from the beginning until we reach the last prologue insn.
5349 We apparently can't depend on basic_block_{head,end} after
5351 for (insn = f; insn; insn = NEXT_INSN (insn))
5355 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
5358 else if (contains (insn, prologue))
5368 /* Find the prologue-end note if we haven't already, and
5369 move it to just after the last prologue insn. */
5372 for (note = last; (note = NEXT_INSN (note));)
5374 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
5378 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
5380 last = NEXT_INSN (last);
5381 reorder_insns (note, note, last);
5385 if ((len = VARRAY_SIZE (epilogue)) > 0)
5389 /* Scan from the end until we reach the first epilogue insn.
5390 We apparently can't depend on basic_block_{head,end} after
5392 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
5396 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
5399 else if (contains (insn, epilogue))
5409 /* Find the epilogue-begin note if we haven't already, and
5410 move it to just before the first epilogue insn. */
5413 for (note = insn; (note = PREV_INSN (note));)
5415 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
5419 if (PREV_INSN (last) != note)
5420 reorder_insns (note, note, PREV_INSN (last));
5423 #endif /* HAVE_prologue or HAVE_epilogue */
5426 /* Called once, at initialization, to initialize function.c. */
5429 init_function_once (void)
5431 VARRAY_INT_INIT (prologue, 0, "prologue");
5432 VARRAY_INT_INIT (epilogue, 0, "epilogue");
5433 VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue");
5436 /* Resets insn_block_boundaries array. */
5439 reset_block_changes (void)
5441 VARRAY_TREE_INIT (cfun->ib_boundaries_block, 100, "ib_boundaries_block");
5442 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, NULL_TREE);
5445 /* Record the boundary for BLOCK. */
5447 record_block_change (tree block)
5455 last_block = VARRAY_TOP_TREE (cfun->ib_boundaries_block);
5456 VARRAY_POP (cfun->ib_boundaries_block);
5458 for (i = VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block); i < n; i++)
5459 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, last_block);
5461 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, block);
5464 /* Finishes record of boundaries. */
5465 void finalize_block_changes (void)
5467 record_block_change (DECL_INITIAL (current_function_decl));
5470 /* For INSN return the BLOCK it belongs to. */
5472 check_block_change (rtx insn, tree *block)
5474 unsigned uid = INSN_UID (insn);
5476 if (uid >= VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block))
5479 *block = VARRAY_TREE (cfun->ib_boundaries_block, uid);
5482 /* Releases the ib_boundaries_block records. */
5484 free_block_changes (void)
5486 cfun->ib_boundaries_block = NULL;
5489 /* Returns the name of the current function. */
5491 current_function_name (void)
5493 return lang_hooks.decl_printable_name (cfun->decl, 2);
5496 #include "gt-function.h"