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, 2005
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
23 /* This file handles the generation of rtl code from tree structure
24 at the level of the function as a whole.
25 It creates the rtl expressions for parameters and auto variables
26 and has full responsibility for allocating stack slots.
28 `expand_function_start' is called at the beginning of a function,
29 before the function body is parsed, and `expand_function_end' is
30 called after parsing the body.
32 Call `assign_stack_local' to allocate a stack slot for a local variable.
33 This is usually done during the RTL generation for the function body,
34 but it can also be done in the reload pass when a pseudo-register does
35 not get a hard register. */
39 #include "coretypes.h"
50 #include "hard-reg-set.h"
51 #include "insn-config.h"
54 #include "basic-block.h"
59 #include "integrate.h"
60 #include "langhooks.h"
62 #include "cfglayout.h"
63 #include "tree-gimple.h"
64 #include "tree-pass.h"
67 #ifndef LOCAL_ALIGNMENT
68 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
71 #ifndef STACK_ALIGNMENT_NEEDED
72 #define STACK_ALIGNMENT_NEEDED 1
75 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
77 /* Some systems use __main in a way incompatible with its use in gcc, in these
78 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
79 give the same symbol without quotes for an alternative entry point. You
80 must define both, or neither. */
82 #define NAME__MAIN "__main"
85 /* Round a value to the lowest integer less than it that is a multiple of
86 the required alignment. Avoid using division in case the value is
87 negative. Assume the alignment is a power of two. */
88 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
90 /* Similar, but round to the next highest integer that meets the
92 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
94 /* Nonzero if function being compiled doesn't contain any calls
95 (ignoring the prologue and epilogue). This is set prior to
96 local register allocation and is valid for the remaining
98 int current_function_is_leaf;
100 /* Nonzero if function being compiled doesn't modify the stack pointer
101 (ignoring the prologue and epilogue). This is only valid after
102 life_analysis has run. */
103 int current_function_sp_is_unchanging;
105 /* Nonzero if the function being compiled is a leaf function which only
106 uses leaf registers. This is valid after reload (specifically after
107 sched2) and is useful only if the port defines LEAF_REGISTERS. */
108 int current_function_uses_only_leaf_regs;
110 /* Nonzero once virtual register instantiation has been done.
111 assign_stack_local uses frame_pointer_rtx when this is nonzero.
112 calls.c:emit_library_call_value_1 uses it to set up
113 post-instantiation libcalls. */
114 int virtuals_instantiated;
116 /* Assign unique numbers to labels generated for profiling, debugging, etc. */
117 static GTY(()) int funcdef_no;
119 /* These variables hold pointers to functions to create and destroy
120 target specific, per-function data structures. */
121 struct machine_function * (*init_machine_status) (void);
123 /* The currently compiled function. */
124 struct function *cfun = 0;
127 DEF_VEC_ALLOC_I(int,heap);
129 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
130 static VEC(int,heap) *prologue;
131 static VEC(int,heap) *epilogue;
133 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
135 static VEC(int,heap) *sibcall_epilogue;
137 /* In order to evaluate some expressions, such as function calls returning
138 structures in memory, we need to temporarily allocate stack locations.
139 We record each allocated temporary in the following structure.
141 Associated with each temporary slot is a nesting level. When we pop up
142 one level, all temporaries associated with the previous level are freed.
143 Normally, all temporaries are freed after the execution of the statement
144 in which they were created. However, if we are inside a ({...}) grouping,
145 the result may be in a temporary and hence must be preserved. If the
146 result could be in a temporary, we preserve it if we can determine which
147 one it is in. If we cannot determine which temporary may contain the
148 result, all temporaries are preserved. A temporary is preserved by
149 pretending it was allocated at the previous nesting level.
151 Automatic variables are also assigned temporary slots, at the nesting
152 level where they are defined. They are marked a "kept" so that
153 free_temp_slots will not free them. */
155 struct temp_slot GTY(())
157 /* Points to next temporary slot. */
158 struct temp_slot *next;
159 /* Points to previous temporary slot. */
160 struct temp_slot *prev;
162 /* The rtx to used to reference the slot. */
164 /* The rtx used to represent the address if not the address of the
165 slot above. May be an EXPR_LIST if multiple addresses exist. */
167 /* The alignment (in bits) of the slot. */
169 /* The size, in units, of the slot. */
171 /* The type of the object in the slot, or zero if it doesn't correspond
172 to a type. We use this to determine whether a slot can be reused.
173 It can be reused if objects of the type of the new slot will always
174 conflict with objects of the type of the old slot. */
176 /* Nonzero if this temporary is currently in use. */
178 /* Nonzero if this temporary has its address taken. */
180 /* Nesting level at which this slot is being used. */
182 /* Nonzero if this should survive a call to free_temp_slots. */
184 /* The offset of the slot from the frame_pointer, including extra space
185 for alignment. This info is for combine_temp_slots. */
186 HOST_WIDE_INT base_offset;
187 /* The size of the slot, including extra space for alignment. This
188 info is for combine_temp_slots. */
189 HOST_WIDE_INT full_size;
192 /* Forward declarations. */
194 static rtx assign_stack_local_1 (enum machine_mode, HOST_WIDE_INT, int,
196 static struct temp_slot *find_temp_slot_from_address (rtx);
197 static void pad_to_arg_alignment (struct args_size *, int, struct args_size *);
198 static void pad_below (struct args_size *, enum machine_mode, tree);
199 static void reorder_blocks_1 (rtx, tree, VEC(tree,heap) **);
200 static void reorder_fix_fragments (tree);
201 static int all_blocks (tree, tree *);
202 static tree *get_block_vector (tree, int *);
203 extern tree debug_find_var_in_block_tree (tree, tree);
204 /* We always define `record_insns' even if it's not used so that we
205 can always export `prologue_epilogue_contains'. */
206 static void record_insns (rtx, VEC(int,heap) **) ATTRIBUTE_UNUSED;
207 static int contains (rtx, VEC(int,heap) **);
209 static void emit_return_into_block (basic_block, rtx);
211 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
212 static rtx keep_stack_depressed (rtx);
214 static void prepare_function_start (tree);
215 static void do_clobber_return_reg (rtx, void *);
216 static void do_use_return_reg (rtx, void *);
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 ATTRIBUTE_UNUSED)
249 init_dummy_function_start ();
252 p->outer = outer_function_chain;
253 outer_function_chain = p;
255 lang_hooks.function.enter_nested (p);
261 push_function_context (void)
263 push_function_context_to (current_function_decl);
266 /* Restore the last saved context, at the end of a nested function.
267 This function is called from language-specific code. */
270 pop_function_context_from (tree context ATTRIBUTE_UNUSED)
272 struct function *p = outer_function_chain;
275 outer_function_chain = p->outer;
277 current_function_decl = p->decl;
279 lang_hooks.function.leave_nested (p);
281 /* Reset variables that have known state during rtx generation. */
282 virtuals_instantiated = 0;
283 generating_concat_p = 1;
287 pop_function_context (void)
289 pop_function_context_from (current_function_decl);
292 /* Clear out all parts of the state in F that can safely be discarded
293 after the function has been parsed, but not compiled, to let
294 garbage collection reclaim the memory. */
297 free_after_parsing (struct function *f)
299 /* f->expr->forced_labels is used by code generation. */
300 /* f->emit->regno_reg_rtx is used by code generation. */
301 /* f->varasm is used by code generation. */
302 /* f->eh->eh_return_stub_label is used by code generation. */
304 lang_hooks.function.final (f);
307 /* Clear out all parts of the state in F that can safely be discarded
308 after the function has been compiled, to let garbage collection
309 reclaim the memory. */
312 free_after_compilation (struct function *f)
314 VEC_free (int, heap, prologue);
315 VEC_free (int, heap, epilogue);
316 VEC_free (int, heap, sibcall_epilogue);
325 f->x_avail_temp_slots = NULL;
326 f->x_used_temp_slots = NULL;
327 f->arg_offset_rtx = NULL;
328 f->return_rtx = NULL;
329 f->internal_arg_pointer = NULL;
330 f->x_nonlocal_goto_handler_labels = NULL;
331 f->x_return_label = NULL;
332 f->x_naked_return_label = NULL;
333 f->x_stack_slot_list = NULL;
334 f->x_tail_recursion_reentry = NULL;
335 f->x_arg_pointer_save_area = NULL;
336 f->x_parm_birth_insn = NULL;
337 f->original_arg_vector = NULL;
338 f->original_decl_initial = NULL;
339 f->epilogue_delay_list = NULL;
342 /* Allocate fixed slots in the stack frame of the current function. */
344 /* Return size needed for stack frame based on slots so far allocated in
346 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
347 the caller may have to do that. */
350 get_func_frame_size (struct function *f)
352 if (FRAME_GROWS_DOWNWARD)
353 return -f->x_frame_offset;
355 return f->x_frame_offset;
358 /* Return size needed for stack frame based on slots so far allocated.
359 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
360 the caller may have to do that. */
362 get_frame_size (void)
364 return get_func_frame_size (cfun);
367 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
368 with machine mode MODE.
370 ALIGN controls the amount of alignment for the address of the slot:
371 0 means according to MODE,
372 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
373 -2 means use BITS_PER_UNIT,
374 positive specifies alignment boundary in bits.
376 We do not round to stack_boundary here.
378 FUNCTION specifies the function to allocate in. */
381 assign_stack_local_1 (enum machine_mode mode, HOST_WIDE_INT size, int align,
382 struct function *function)
385 int bigend_correction = 0;
386 unsigned int alignment;
387 int frame_off, frame_alignment, frame_phase;
394 alignment = BIGGEST_ALIGNMENT;
396 alignment = GET_MODE_ALIGNMENT (mode);
398 /* Allow the target to (possibly) increase the alignment of this
400 type = lang_hooks.types.type_for_mode (mode, 0);
402 alignment = LOCAL_ALIGNMENT (type, alignment);
404 alignment /= BITS_PER_UNIT;
406 else if (align == -1)
408 alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
409 size = CEIL_ROUND (size, alignment);
411 else if (align == -2)
412 alignment = 1; /* BITS_PER_UNIT / BITS_PER_UNIT */
414 alignment = align / BITS_PER_UNIT;
416 if (FRAME_GROWS_DOWNWARD)
417 function->x_frame_offset -= size;
419 /* Ignore alignment we can't do with expected alignment of the boundary. */
420 if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY)
421 alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
423 if (function->stack_alignment_needed < alignment * BITS_PER_UNIT)
424 function->stack_alignment_needed = alignment * BITS_PER_UNIT;
426 /* Calculate how many bytes the start of local variables is off from
428 frame_alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
429 frame_off = STARTING_FRAME_OFFSET % frame_alignment;
430 frame_phase = frame_off ? frame_alignment - frame_off : 0;
432 /* Round the frame offset to the specified alignment. The default is
433 to always honor requests to align the stack but a port may choose to
434 do its own stack alignment by defining STACK_ALIGNMENT_NEEDED. */
435 if (STACK_ALIGNMENT_NEEDED
439 /* We must be careful here, since FRAME_OFFSET might be negative and
440 division with a negative dividend isn't as well defined as we might
441 like. So we instead assume that ALIGNMENT is a power of two and
442 use logical operations which are unambiguous. */
443 if (FRAME_GROWS_DOWNWARD)
444 function->x_frame_offset
445 = (FLOOR_ROUND (function->x_frame_offset - frame_phase,
446 (unsigned HOST_WIDE_INT) alignment)
449 function->x_frame_offset
450 = (CEIL_ROUND (function->x_frame_offset - frame_phase,
451 (unsigned HOST_WIDE_INT) alignment)
455 /* On a big-endian machine, if we are allocating more space than we will use,
456 use the least significant bytes of those that are allocated. */
457 if (BYTES_BIG_ENDIAN && mode != BLKmode)
458 bigend_correction = size - GET_MODE_SIZE (mode);
460 /* If we have already instantiated virtual registers, return the actual
461 address relative to the frame pointer. */
462 if (function == cfun && virtuals_instantiated)
463 addr = plus_constant (frame_pointer_rtx,
465 (frame_offset + bigend_correction
466 + STARTING_FRAME_OFFSET, Pmode));
468 addr = plus_constant (virtual_stack_vars_rtx,
470 (function->x_frame_offset + bigend_correction,
473 if (!FRAME_GROWS_DOWNWARD)
474 function->x_frame_offset += size;
476 x = gen_rtx_MEM (mode, addr);
478 function->x_stack_slot_list
479 = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list);
484 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
488 assign_stack_local (enum machine_mode mode, HOST_WIDE_INT size, int align)
490 return assign_stack_local_1 (mode, size, align, cfun);
494 /* Removes temporary slot TEMP from LIST. */
497 cut_slot_from_list (struct temp_slot *temp, struct temp_slot **list)
500 temp->next->prev = temp->prev;
502 temp->prev->next = temp->next;
506 temp->prev = temp->next = NULL;
509 /* Inserts temporary slot TEMP to LIST. */
512 insert_slot_to_list (struct temp_slot *temp, struct temp_slot **list)
516 (*list)->prev = temp;
521 /* Returns the list of used temp slots at LEVEL. */
523 static struct temp_slot **
524 temp_slots_at_level (int level)
527 if (!used_temp_slots)
528 VARRAY_GENERIC_PTR_INIT (used_temp_slots, 3, "used_temp_slots");
530 while (level >= (int) VARRAY_ACTIVE_SIZE (used_temp_slots))
531 VARRAY_PUSH_GENERIC_PTR (used_temp_slots, NULL);
533 return (struct temp_slot **) &VARRAY_GENERIC_PTR (used_temp_slots, level);
536 /* Returns the maximal temporary slot level. */
539 max_slot_level (void)
541 if (!used_temp_slots)
544 return VARRAY_ACTIVE_SIZE (used_temp_slots) - 1;
547 /* Moves temporary slot TEMP to LEVEL. */
550 move_slot_to_level (struct temp_slot *temp, int level)
552 cut_slot_from_list (temp, temp_slots_at_level (temp->level));
553 insert_slot_to_list (temp, temp_slots_at_level (level));
557 /* Make temporary slot TEMP available. */
560 make_slot_available (struct temp_slot *temp)
562 cut_slot_from_list (temp, temp_slots_at_level (temp->level));
563 insert_slot_to_list (temp, &avail_temp_slots);
568 /* Allocate a temporary stack slot and record it for possible later
571 MODE is the machine mode to be given to the returned rtx.
573 SIZE is the size in units of the space required. We do no rounding here
574 since assign_stack_local will do any required rounding.
576 KEEP is 1 if this slot is to be retained after a call to
577 free_temp_slots. Automatic variables for a block are allocated
578 with this flag. KEEP values of 2 or 3 were needed respectively
579 for variables whose lifetime is controlled by CLEANUP_POINT_EXPRs
580 or for SAVE_EXPRs, but they are now unused.
582 TYPE is the type that will be used for the stack slot. */
585 assign_stack_temp_for_type (enum machine_mode mode, HOST_WIDE_INT size,
589 struct temp_slot *p, *best_p = 0, *selected = NULL, **pp;
592 /* If SIZE is -1 it means that somebody tried to allocate a temporary
593 of a variable size. */
594 gcc_assert (size != -1);
596 /* These are now unused. */
597 gcc_assert (keep <= 1);
600 align = BIGGEST_ALIGNMENT;
602 align = GET_MODE_ALIGNMENT (mode);
605 type = lang_hooks.types.type_for_mode (mode, 0);
608 align = LOCAL_ALIGNMENT (type, align);
610 /* Try to find an available, already-allocated temporary of the proper
611 mode which meets the size and alignment requirements. Choose the
612 smallest one with the closest alignment. */
613 for (p = avail_temp_slots; p; p = p->next)
615 if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode
616 && objects_must_conflict_p (p->type, type)
617 && (best_p == 0 || best_p->size > p->size
618 || (best_p->size == p->size && best_p->align > p->align)))
620 if (p->align == align && p->size == size)
623 cut_slot_from_list (selected, &avail_temp_slots);
631 /* Make our best, if any, the one to use. */
635 cut_slot_from_list (selected, &avail_temp_slots);
637 /* If there are enough aligned bytes left over, make them into a new
638 temp_slot so that the extra bytes don't get wasted. Do this only
639 for BLKmode slots, so that we can be sure of the alignment. */
640 if (GET_MODE (best_p->slot) == BLKmode)
642 int alignment = best_p->align / BITS_PER_UNIT;
643 HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment);
645 if (best_p->size - rounded_size >= alignment)
647 p = ggc_alloc (sizeof (struct temp_slot));
648 p->in_use = p->addr_taken = 0;
649 p->size = best_p->size - rounded_size;
650 p->base_offset = best_p->base_offset + rounded_size;
651 p->full_size = best_p->full_size - rounded_size;
652 p->slot = gen_rtx_MEM (BLKmode,
653 plus_constant (XEXP (best_p->slot, 0),
655 p->align = best_p->align;
657 p->type = best_p->type;
658 insert_slot_to_list (p, &avail_temp_slots);
660 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot,
663 best_p->size = rounded_size;
664 best_p->full_size = rounded_size;
669 /* If we still didn't find one, make a new temporary. */
672 HOST_WIDE_INT frame_offset_old = frame_offset;
674 p = ggc_alloc (sizeof (struct temp_slot));
676 /* We are passing an explicit alignment request to assign_stack_local.
677 One side effect of that is assign_stack_local will not round SIZE
678 to ensure the frame offset remains suitably aligned.
680 So for requests which depended on the rounding of SIZE, we go ahead
681 and round it now. We also make sure ALIGNMENT is at least
682 BIGGEST_ALIGNMENT. */
683 gcc_assert (mode != BLKmode || align == BIGGEST_ALIGNMENT);
684 p->slot = assign_stack_local (mode,
686 ? CEIL_ROUND (size, (int) align / BITS_PER_UNIT)
692 /* The following slot size computation is necessary because we don't
693 know the actual size of the temporary slot until assign_stack_local
694 has performed all the frame alignment and size rounding for the
695 requested temporary. Note that extra space added for alignment
696 can be either above or below this stack slot depending on which
697 way the frame grows. We include the extra space if and only if it
698 is above this slot. */
699 if (FRAME_GROWS_DOWNWARD)
700 p->size = frame_offset_old - frame_offset;
704 /* Now define the fields used by combine_temp_slots. */
705 if (FRAME_GROWS_DOWNWARD)
707 p->base_offset = frame_offset;
708 p->full_size = frame_offset_old - frame_offset;
712 p->base_offset = frame_offset_old;
713 p->full_size = frame_offset - frame_offset_old;
724 p->level = temp_slot_level;
727 pp = temp_slots_at_level (p->level);
728 insert_slot_to_list (p, pp);
730 /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
731 slot = gen_rtx_MEM (mode, XEXP (p->slot, 0));
732 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, slot, stack_slot_list);
734 /* If we know the alias set for the memory that will be used, use
735 it. If there's no TYPE, then we don't know anything about the
736 alias set for the memory. */
737 set_mem_alias_set (slot, type ? get_alias_set (type) : 0);
738 set_mem_align (slot, align);
740 /* If a type is specified, set the relevant flags. */
743 MEM_VOLATILE_P (slot) = TYPE_VOLATILE (type);
744 MEM_SET_IN_STRUCT_P (slot, AGGREGATE_TYPE_P (type));
750 /* Allocate a temporary stack slot and record it for possible later
751 reuse. First three arguments are same as in preceding function. */
754 assign_stack_temp (enum machine_mode mode, HOST_WIDE_INT size, int keep)
756 return assign_stack_temp_for_type (mode, size, keep, NULL_TREE);
759 /* Assign a temporary.
760 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
761 and so that should be used in error messages. In either case, we
762 allocate of the given type.
763 KEEP is as for assign_stack_temp.
764 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
765 it is 0 if a register is OK.
766 DONT_PROMOTE is 1 if we should not promote values in register
770 assign_temp (tree type_or_decl, int keep, int memory_required,
771 int dont_promote ATTRIBUTE_UNUSED)
774 enum machine_mode mode;
779 if (DECL_P (type_or_decl))
780 decl = type_or_decl, type = TREE_TYPE (decl);
782 decl = NULL, type = type_or_decl;
784 mode = TYPE_MODE (type);
786 unsignedp = TYPE_UNSIGNED (type);
789 if (mode == BLKmode || memory_required)
791 HOST_WIDE_INT size = int_size_in_bytes (type);
795 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
796 problems with allocating the stack space. */
800 /* Unfortunately, we don't yet know how to allocate variable-sized
801 temporaries. However, sometimes we have a fixed upper limit on
802 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
803 instead. This is the case for Chill variable-sized strings. */
804 if (size == -1 && TREE_CODE (type) == ARRAY_TYPE
805 && TYPE_ARRAY_MAX_SIZE (type) != NULL_TREE
806 && host_integerp (TYPE_ARRAY_MAX_SIZE (type), 1))
807 size = tree_low_cst (TYPE_ARRAY_MAX_SIZE (type), 1);
809 /* If we still haven't been able to get a size, see if the language
810 can compute a maximum size. */
812 && (size_tree = lang_hooks.types.max_size (type)) != 0
813 && host_integerp (size_tree, 1))
814 size = tree_low_cst (size_tree, 1);
816 /* The size of the temporary may be too large to fit into an integer. */
817 /* ??? Not sure this should happen except for user silliness, so limit
818 this to things that aren't compiler-generated temporaries. The
819 rest of the time we'll die in assign_stack_temp_for_type. */
820 if (decl && size == -1
821 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST)
823 error ("size of variable %q+D is too large", decl);
827 tmp = assign_stack_temp_for_type (mode, size, keep, type);
833 mode = promote_mode (type, mode, &unsignedp, 0);
836 return gen_reg_rtx (mode);
839 /* Combine temporary stack slots which are adjacent on the stack.
841 This allows for better use of already allocated stack space. This is only
842 done for BLKmode slots because we can be sure that we won't have alignment
843 problems in this case. */
846 combine_temp_slots (void)
848 struct temp_slot *p, *q, *next, *next_q;
851 /* We can't combine slots, because the information about which slot
852 is in which alias set will be lost. */
853 if (flag_strict_aliasing)
856 /* If there are a lot of temp slots, don't do anything unless
857 high levels of optimization. */
858 if (! flag_expensive_optimizations)
859 for (p = avail_temp_slots, num_slots = 0; p; p = p->next, num_slots++)
860 if (num_slots > 100 || (num_slots > 10 && optimize == 0))
863 for (p = avail_temp_slots; p; p = next)
869 if (GET_MODE (p->slot) != BLKmode)
872 for (q = p->next; q; q = next_q)
878 if (GET_MODE (q->slot) != BLKmode)
881 if (p->base_offset + p->full_size == q->base_offset)
883 /* Q comes after P; combine Q into P. */
885 p->full_size += q->full_size;
888 else if (q->base_offset + q->full_size == p->base_offset)
890 /* P comes after Q; combine P into Q. */
892 q->full_size += p->full_size;
897 cut_slot_from_list (q, &avail_temp_slots);
900 /* Either delete P or advance past it. */
902 cut_slot_from_list (p, &avail_temp_slots);
906 /* Find the temp slot corresponding to the object at address X. */
908 static struct temp_slot *
909 find_temp_slot_from_address (rtx x)
915 for (i = max_slot_level (); i >= 0; i--)
916 for (p = *temp_slots_at_level (i); p; p = p->next)
918 if (XEXP (p->slot, 0) == x
920 || (GET_CODE (x) == PLUS
921 && XEXP (x, 0) == virtual_stack_vars_rtx
922 && GET_CODE (XEXP (x, 1)) == CONST_INT
923 && INTVAL (XEXP (x, 1)) >= p->base_offset
924 && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size))
927 else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST)
928 for (next = p->address; next; next = XEXP (next, 1))
929 if (XEXP (next, 0) == x)
933 /* If we have a sum involving a register, see if it points to a temp
935 if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 0))
936 && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
938 else if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 1))
939 && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
945 /* Indicate that NEW is an alternate way of referring to the temp slot
946 that previously was known by OLD. */
949 update_temp_slot_address (rtx old, rtx new)
953 if (rtx_equal_p (old, new))
956 p = find_temp_slot_from_address (old);
958 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
959 is a register, see if one operand of the PLUS is a temporary
960 location. If so, NEW points into it. Otherwise, if both OLD and
961 NEW are a PLUS and if there is a register in common between them.
962 If so, try a recursive call on those values. */
965 if (GET_CODE (old) != PLUS)
970 update_temp_slot_address (XEXP (old, 0), new);
971 update_temp_slot_address (XEXP (old, 1), new);
974 else if (GET_CODE (new) != PLUS)
977 if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0)))
978 update_temp_slot_address (XEXP (old, 1), XEXP (new, 1));
979 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0)))
980 update_temp_slot_address (XEXP (old, 0), XEXP (new, 1));
981 else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1)))
982 update_temp_slot_address (XEXP (old, 1), XEXP (new, 0));
983 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1)))
984 update_temp_slot_address (XEXP (old, 0), XEXP (new, 0));
989 /* Otherwise add an alias for the temp's address. */
990 else if (p->address == 0)
994 if (GET_CODE (p->address) != EXPR_LIST)
995 p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX);
997 p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address);
1001 /* If X could be a reference to a temporary slot, mark the fact that its
1002 address was taken. */
1005 mark_temp_addr_taken (rtx x)
1007 struct temp_slot *p;
1012 /* If X is not in memory or is at a constant address, it cannot be in
1013 a temporary slot. */
1014 if (!MEM_P (x) || CONSTANT_P (XEXP (x, 0)))
1017 p = find_temp_slot_from_address (XEXP (x, 0));
1022 /* If X could be a reference to a temporary slot, mark that slot as
1023 belonging to the to one level higher than the current level. If X
1024 matched one of our slots, just mark that one. Otherwise, we can't
1025 easily predict which it is, so upgrade all of them. Kept slots
1026 need not be touched.
1028 This is called when an ({...}) construct occurs and a statement
1029 returns a value in memory. */
1032 preserve_temp_slots (rtx x)
1034 struct temp_slot *p = 0, *next;
1036 /* If there is no result, we still might have some objects whose address
1037 were taken, so we need to make sure they stay around. */
1040 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1045 move_slot_to_level (p, temp_slot_level - 1);
1051 /* If X is a register that is being used as a pointer, see if we have
1052 a temporary slot we know it points to. To be consistent with
1053 the code below, we really should preserve all non-kept slots
1054 if we can't find a match, but that seems to be much too costly. */
1055 if (REG_P (x) && REG_POINTER (x))
1056 p = find_temp_slot_from_address (x);
1058 /* If X is not in memory or is at a constant address, it cannot be in
1059 a temporary slot, but it can contain something whose address was
1061 if (p == 0 && (!MEM_P (x) || CONSTANT_P (XEXP (x, 0))))
1063 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1068 move_slot_to_level (p, temp_slot_level - 1);
1074 /* First see if we can find a match. */
1076 p = find_temp_slot_from_address (XEXP (x, 0));
1080 /* Move everything at our level whose address was taken to our new
1081 level in case we used its address. */
1082 struct temp_slot *q;
1084 if (p->level == temp_slot_level)
1086 for (q = *temp_slots_at_level (temp_slot_level); q; q = next)
1090 if (p != q && q->addr_taken)
1091 move_slot_to_level (q, temp_slot_level - 1);
1094 move_slot_to_level (p, temp_slot_level - 1);
1100 /* Otherwise, preserve all non-kept slots at this level. */
1101 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1106 move_slot_to_level (p, temp_slot_level - 1);
1110 /* Free all temporaries used so far. This is normally called at the
1111 end of generating code for a statement. */
1114 free_temp_slots (void)
1116 struct temp_slot *p, *next;
1118 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1123 make_slot_available (p);
1126 combine_temp_slots ();
1129 /* Push deeper into the nesting level for stack temporaries. */
1132 push_temp_slots (void)
1137 /* Pop a temporary nesting level. All slots in use in the current level
1141 pop_temp_slots (void)
1143 struct temp_slot *p, *next;
1145 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1148 make_slot_available (p);
1151 combine_temp_slots ();
1156 /* Initialize temporary slots. */
1159 init_temp_slots (void)
1161 /* We have not allocated any temporaries yet. */
1162 avail_temp_slots = 0;
1163 used_temp_slots = 0;
1164 temp_slot_level = 0;
1167 /* These routines are responsible for converting virtual register references
1168 to the actual hard register references once RTL generation is complete.
1170 The following four variables are used for communication between the
1171 routines. They contain the offsets of the virtual registers from their
1172 respective hard registers. */
1174 static int in_arg_offset;
1175 static int var_offset;
1176 static int dynamic_offset;
1177 static int out_arg_offset;
1178 static int cfa_offset;
1180 /* In most machines, the stack pointer register is equivalent to the bottom
1183 #ifndef STACK_POINTER_OFFSET
1184 #define STACK_POINTER_OFFSET 0
1187 /* If not defined, pick an appropriate default for the offset of dynamically
1188 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
1189 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
1191 #ifndef STACK_DYNAMIC_OFFSET
1193 /* The bottom of the stack points to the actual arguments. If
1194 REG_PARM_STACK_SPACE is defined, this includes the space for the register
1195 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
1196 stack space for register parameters is not pushed by the caller, but
1197 rather part of the fixed stack areas and hence not included in
1198 `current_function_outgoing_args_size'. Nevertheless, we must allow
1199 for it when allocating stack dynamic objects. */
1201 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1202 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1203 ((ACCUMULATE_OUTGOING_ARGS \
1204 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
1205 + (STACK_POINTER_OFFSET)) \
1208 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1209 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
1210 + (STACK_POINTER_OFFSET))
1214 /* On most machines, the CFA coincides with the first incoming parm. */
1216 #ifndef ARG_POINTER_CFA_OFFSET
1217 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
1221 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
1222 is a virtual register, return the equivalent hard register and set the
1223 offset indirectly through the pointer. Otherwise, return 0. */
1226 instantiate_new_reg (rtx x, HOST_WIDE_INT *poffset)
1229 HOST_WIDE_INT offset;
1231 if (x == virtual_incoming_args_rtx)
1232 new = arg_pointer_rtx, offset = in_arg_offset;
1233 else if (x == virtual_stack_vars_rtx)
1234 new = frame_pointer_rtx, offset = var_offset;
1235 else if (x == virtual_stack_dynamic_rtx)
1236 new = stack_pointer_rtx, offset = dynamic_offset;
1237 else if (x == virtual_outgoing_args_rtx)
1238 new = stack_pointer_rtx, offset = out_arg_offset;
1239 else if (x == virtual_cfa_rtx)
1240 new = arg_pointer_rtx, offset = cfa_offset;
1248 /* A subroutine of instantiate_virtual_regs, called via for_each_rtx.
1249 Instantiate any virtual registers present inside of *LOC. The expression
1250 is simplified, as much as possible, but is not to be considered "valid"
1251 in any sense implied by the target. If any change is made, set CHANGED
1255 instantiate_virtual_regs_in_rtx (rtx *loc, void *data)
1257 HOST_WIDE_INT offset;
1258 bool *changed = (bool *) data;
1265 switch (GET_CODE (x))
1268 new = instantiate_new_reg (x, &offset);
1271 *loc = plus_constant (new, offset);
1278 new = instantiate_new_reg (XEXP (x, 0), &offset);
1281 new = plus_constant (new, offset);
1282 *loc = simplify_gen_binary (PLUS, GET_MODE (x), new, XEXP (x, 1));
1288 /* FIXME -- from old code */
1289 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
1290 we can commute the PLUS and SUBREG because pointers into the
1291 frame are well-behaved. */
1301 /* A subroutine of instantiate_virtual_regs_in_insn. Return true if X
1302 matches the predicate for insn CODE operand OPERAND. */
1305 safe_insn_predicate (int code, int operand, rtx x)
1307 const struct insn_operand_data *op_data;
1312 op_data = &insn_data[code].operand[operand];
1313 if (op_data->predicate == NULL)
1316 return op_data->predicate (x, op_data->mode);
1319 /* A subroutine of instantiate_virtual_regs. Instantiate any virtual
1320 registers present inside of insn. The result will be a valid insn. */
1323 instantiate_virtual_regs_in_insn (rtx insn)
1325 HOST_WIDE_INT offset;
1327 bool any_change = false;
1328 rtx set, new, x, seq;
1330 /* There are some special cases to be handled first. */
1331 set = single_set (insn);
1334 /* We're allowed to assign to a virtual register. This is interpreted
1335 to mean that the underlying register gets assigned the inverse
1336 transformation. This is used, for example, in the handling of
1338 new = instantiate_new_reg (SET_DEST (set), &offset);
1343 for_each_rtx (&SET_SRC (set), instantiate_virtual_regs_in_rtx, NULL);
1344 x = simplify_gen_binary (PLUS, GET_MODE (new), SET_SRC (set),
1346 x = force_operand (x, new);
1348 emit_move_insn (new, x);
1353 emit_insn_before (seq, insn);
1358 /* Handle a straight copy from a virtual register by generating a
1359 new add insn. The difference between this and falling through
1360 to the generic case is avoiding a new pseudo and eliminating a
1361 move insn in the initial rtl stream. */
1362 new = instantiate_new_reg (SET_SRC (set), &offset);
1363 if (new && offset != 0
1364 && REG_P (SET_DEST (set))
1365 && REGNO (SET_DEST (set)) > LAST_VIRTUAL_REGISTER)
1369 x = expand_simple_binop (GET_MODE (SET_DEST (set)), PLUS,
1370 new, GEN_INT (offset), SET_DEST (set),
1371 1, OPTAB_LIB_WIDEN);
1372 if (x != SET_DEST (set))
1373 emit_move_insn (SET_DEST (set), x);
1378 emit_insn_before (seq, insn);
1383 extract_insn (insn);
1384 insn_code = INSN_CODE (insn);
1386 /* Handle a plus involving a virtual register by determining if the
1387 operands remain valid if they're modified in place. */
1388 if (GET_CODE (SET_SRC (set)) == PLUS
1389 && recog_data.n_operands >= 3
1390 && recog_data.operand_loc[1] == &XEXP (SET_SRC (set), 0)
1391 && recog_data.operand_loc[2] == &XEXP (SET_SRC (set), 1)
1392 && GET_CODE (recog_data.operand[2]) == CONST_INT
1393 && (new = instantiate_new_reg (recog_data.operand[1], &offset)))
1395 offset += INTVAL (recog_data.operand[2]);
1397 /* If the sum is zero, then replace with a plain move. */
1399 && REG_P (SET_DEST (set))
1400 && REGNO (SET_DEST (set)) > LAST_VIRTUAL_REGISTER)
1403 emit_move_insn (SET_DEST (set), new);
1407 emit_insn_before (seq, insn);
1412 x = gen_int_mode (offset, recog_data.operand_mode[2]);
1414 /* Using validate_change and apply_change_group here leaves
1415 recog_data in an invalid state. Since we know exactly what
1416 we want to check, do those two by hand. */
1417 if (safe_insn_predicate (insn_code, 1, new)
1418 && safe_insn_predicate (insn_code, 2, x))
1420 *recog_data.operand_loc[1] = recog_data.operand[1] = new;
1421 *recog_data.operand_loc[2] = recog_data.operand[2] = x;
1424 /* Fall through into the regular operand fixup loop in
1425 order to take care of operands other than 1 and 2. */
1431 extract_insn (insn);
1432 insn_code = INSN_CODE (insn);
1435 /* In the general case, we expect virtual registers to appear only in
1436 operands, and then only as either bare registers or inside memories. */
1437 for (i = 0; i < recog_data.n_operands; ++i)
1439 x = recog_data.operand[i];
1440 switch (GET_CODE (x))
1444 rtx addr = XEXP (x, 0);
1445 bool changed = false;
1447 for_each_rtx (&addr, instantiate_virtual_regs_in_rtx, &changed);
1452 x = replace_equiv_address (x, addr);
1456 emit_insn_before (seq, insn);
1461 new = instantiate_new_reg (x, &offset);
1470 /* Careful, special mode predicates may have stuff in
1471 insn_data[insn_code].operand[i].mode that isn't useful
1472 to us for computing a new value. */
1473 /* ??? Recognize address_operand and/or "p" constraints
1474 to see if (plus new offset) is a valid before we put
1475 this through expand_simple_binop. */
1476 x = expand_simple_binop (GET_MODE (x), PLUS, new,
1477 GEN_INT (offset), NULL_RTX,
1478 1, OPTAB_LIB_WIDEN);
1481 emit_insn_before (seq, insn);
1486 new = instantiate_new_reg (SUBREG_REG (x), &offset);
1492 new = expand_simple_binop (GET_MODE (new), PLUS, new,
1493 GEN_INT (offset), NULL_RTX,
1494 1, OPTAB_LIB_WIDEN);
1497 emit_insn_before (seq, insn);
1499 x = simplify_gen_subreg (recog_data.operand_mode[i], new,
1500 GET_MODE (new), SUBREG_BYTE (x));
1507 /* At this point, X contains the new value for the operand.
1508 Validate the new value vs the insn predicate. Note that
1509 asm insns will have insn_code -1 here. */
1510 if (!safe_insn_predicate (insn_code, i, x))
1511 x = force_reg (insn_data[insn_code].operand[i].mode, x);
1513 *recog_data.operand_loc[i] = recog_data.operand[i] = x;
1519 /* Propagate operand changes into the duplicates. */
1520 for (i = 0; i < recog_data.n_dups; ++i)
1521 *recog_data.dup_loc[i]
1522 = recog_data.operand[(unsigned)recog_data.dup_num[i]];
1524 /* Force re-recognition of the instruction for validation. */
1525 INSN_CODE (insn) = -1;
1528 if (asm_noperands (PATTERN (insn)) >= 0)
1530 if (!check_asm_operands (PATTERN (insn)))
1532 error_for_asm (insn, "impossible constraint in %<asm%>");
1538 if (recog_memoized (insn) < 0)
1539 fatal_insn_not_found (insn);
1543 /* Subroutine of instantiate_decls. Given RTL representing a decl,
1544 do any instantiation required. */
1547 instantiate_decl (rtx x)
1554 /* If this is a CONCAT, recurse for the pieces. */
1555 if (GET_CODE (x) == CONCAT)
1557 instantiate_decl (XEXP (x, 0));
1558 instantiate_decl (XEXP (x, 1));
1562 /* If this is not a MEM, no need to do anything. Similarly if the
1563 address is a constant or a register that is not a virtual register. */
1568 if (CONSTANT_P (addr)
1570 && (REGNO (addr) < FIRST_VIRTUAL_REGISTER
1571 || REGNO (addr) > LAST_VIRTUAL_REGISTER)))
1574 for_each_rtx (&XEXP (x, 0), instantiate_virtual_regs_in_rtx, NULL);
1577 /* Subroutine of instantiate_decls: Process all decls in the given
1578 BLOCK node and all its subblocks. */
1581 instantiate_decls_1 (tree let)
1585 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
1586 if (DECL_RTL_SET_P (t))
1587 instantiate_decl (DECL_RTL (t));
1589 /* Process all subblocks. */
1590 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
1591 instantiate_decls_1 (t);
1594 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
1595 all virtual registers in their DECL_RTL's. */
1598 instantiate_decls (tree fndecl)
1602 /* Process all parameters of the function. */
1603 for (decl = DECL_ARGUMENTS (fndecl); decl; decl = TREE_CHAIN (decl))
1605 instantiate_decl (DECL_RTL (decl));
1606 instantiate_decl (DECL_INCOMING_RTL (decl));
1609 /* Now process all variables defined in the function or its subblocks. */
1610 instantiate_decls_1 (DECL_INITIAL (fndecl));
1613 /* Pass through the INSNS of function FNDECL and convert virtual register
1614 references to hard register references. */
1617 instantiate_virtual_regs (void)
1621 /* Compute the offsets to use for this function. */
1622 in_arg_offset = FIRST_PARM_OFFSET (current_function_decl);
1623 var_offset = STARTING_FRAME_OFFSET;
1624 dynamic_offset = STACK_DYNAMIC_OFFSET (current_function_decl);
1625 out_arg_offset = STACK_POINTER_OFFSET;
1626 cfa_offset = ARG_POINTER_CFA_OFFSET (current_function_decl);
1628 /* Initialize recognition, indicating that volatile is OK. */
1631 /* Scan through all the insns, instantiating every virtual register still
1633 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
1636 /* These patterns in the instruction stream can never be recognized.
1637 Fortunately, they shouldn't contain virtual registers either. */
1638 if (GET_CODE (PATTERN (insn)) == USE
1639 || GET_CODE (PATTERN (insn)) == CLOBBER
1640 || GET_CODE (PATTERN (insn)) == ADDR_VEC
1641 || GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC
1642 || GET_CODE (PATTERN (insn)) == ASM_INPUT)
1645 instantiate_virtual_regs_in_insn (insn);
1647 if (INSN_DELETED_P (insn))
1650 for_each_rtx (®_NOTES (insn), instantiate_virtual_regs_in_rtx, NULL);
1652 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
1653 if (GET_CODE (insn) == CALL_INSN)
1654 for_each_rtx (&CALL_INSN_FUNCTION_USAGE (insn),
1655 instantiate_virtual_regs_in_rtx, NULL);
1658 /* Instantiate the virtual registers in the DECLs for debugging purposes. */
1659 instantiate_decls (current_function_decl);
1661 /* Indicate that, from now on, assign_stack_local should use
1662 frame_pointer_rtx. */
1663 virtuals_instantiated = 1;
1666 struct tree_opt_pass pass_instantiate_virtual_regs =
1670 instantiate_virtual_regs, /* execute */
1673 0, /* static_pass_number */
1675 0, /* properties_required */
1676 0, /* properties_provided */
1677 0, /* properties_destroyed */
1678 0, /* todo_flags_start */
1679 0, /* todo_flags_finish */
1684 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
1685 This means a type for which function calls must pass an address to the
1686 function or get an address back from the function.
1687 EXP may be a type node or an expression (whose type is tested). */
1690 aggregate_value_p (tree exp, tree fntype)
1692 int i, regno, nregs;
1695 tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
1698 switch (TREE_CODE (fntype))
1701 fntype = get_callee_fndecl (fntype);
1702 fntype = fntype ? TREE_TYPE (fntype) : 0;
1705 fntype = TREE_TYPE (fntype);
1710 case IDENTIFIER_NODE:
1714 /* We don't expect other rtl types here. */
1718 if (TREE_CODE (type) == VOID_TYPE)
1720 /* If the front end has decided that this needs to be passed by
1721 reference, do so. */
1722 if ((TREE_CODE (exp) == PARM_DECL || TREE_CODE (exp) == RESULT_DECL)
1723 && DECL_BY_REFERENCE (exp))
1725 if (targetm.calls.return_in_memory (type, fntype))
1727 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
1728 and thus can't be returned in registers. */
1729 if (TREE_ADDRESSABLE (type))
1731 if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
1733 /* Make sure we have suitable call-clobbered regs to return
1734 the value in; if not, we must return it in memory. */
1735 reg = hard_function_value (type, 0, 0);
1737 /* If we have something other than a REG (e.g. a PARALLEL), then assume
1742 regno = REGNO (reg);
1743 nregs = hard_regno_nregs[regno][TYPE_MODE (type)];
1744 for (i = 0; i < nregs; i++)
1745 if (! call_used_regs[regno + i])
1750 /* Return true if we should assign DECL a pseudo register; false if it
1751 should live on the local stack. */
1754 use_register_for_decl (tree decl)
1756 /* Honor volatile. */
1757 if (TREE_SIDE_EFFECTS (decl))
1760 /* Honor addressability. */
1761 if (TREE_ADDRESSABLE (decl))
1764 /* Only register-like things go in registers. */
1765 if (DECL_MODE (decl) == BLKmode)
1768 /* If -ffloat-store specified, don't put explicit float variables
1770 /* ??? This should be checked after DECL_ARTIFICIAL, but tree-ssa
1771 propagates values across these stores, and it probably shouldn't. */
1772 if (flag_float_store && FLOAT_TYPE_P (TREE_TYPE (decl)))
1775 /* If we're not interested in tracking debugging information for
1776 this decl, then we can certainly put it in a register. */
1777 if (DECL_IGNORED_P (decl))
1780 return (optimize || DECL_REGISTER (decl));
1783 /* Return true if TYPE should be passed by invisible reference. */
1786 pass_by_reference (CUMULATIVE_ARGS *ca, enum machine_mode mode,
1787 tree type, bool named_arg)
1791 /* If this type contains non-trivial constructors, then it is
1792 forbidden for the middle-end to create any new copies. */
1793 if (TREE_ADDRESSABLE (type))
1796 /* GCC post 3.4 passes *all* variable sized types by reference. */
1797 if (!TYPE_SIZE (type) || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
1801 return targetm.calls.pass_by_reference (ca, mode, type, named_arg);
1804 /* Return true if TYPE, which is passed by reference, should be callee
1805 copied instead of caller copied. */
1808 reference_callee_copied (CUMULATIVE_ARGS *ca, enum machine_mode mode,
1809 tree type, bool named_arg)
1811 if (type && TREE_ADDRESSABLE (type))
1813 return targetm.calls.callee_copies (ca, mode, type, named_arg);
1816 /* Structures to communicate between the subroutines of assign_parms.
1817 The first holds data persistent across all parameters, the second
1818 is cleared out for each parameter. */
1820 struct assign_parm_data_all
1822 CUMULATIVE_ARGS args_so_far;
1823 struct args_size stack_args_size;
1824 tree function_result_decl;
1826 rtx conversion_insns;
1827 HOST_WIDE_INT pretend_args_size;
1828 HOST_WIDE_INT extra_pretend_bytes;
1829 int reg_parm_stack_space;
1832 struct assign_parm_data_one
1838 enum machine_mode nominal_mode;
1839 enum machine_mode passed_mode;
1840 enum machine_mode promoted_mode;
1841 struct locate_and_pad_arg_data locate;
1843 BOOL_BITFIELD named_arg : 1;
1844 BOOL_BITFIELD passed_pointer : 1;
1845 BOOL_BITFIELD on_stack : 1;
1846 BOOL_BITFIELD loaded_in_reg : 1;
1849 /* A subroutine of assign_parms. Initialize ALL. */
1852 assign_parms_initialize_all (struct assign_parm_data_all *all)
1856 memset (all, 0, sizeof (*all));
1858 fntype = TREE_TYPE (current_function_decl);
1860 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
1861 INIT_CUMULATIVE_INCOMING_ARGS (all->args_so_far, fntype, NULL_RTX);
1863 INIT_CUMULATIVE_ARGS (all->args_so_far, fntype, NULL_RTX,
1864 current_function_decl, -1);
1867 #ifdef REG_PARM_STACK_SPACE
1868 all->reg_parm_stack_space = REG_PARM_STACK_SPACE (current_function_decl);
1872 /* If ARGS contains entries with complex types, split the entry into two
1873 entries of the component type. Return a new list of substitutions are
1874 needed, else the old list. */
1877 split_complex_args (tree args)
1881 /* Before allocating memory, check for the common case of no complex. */
1882 for (p = args; p; p = TREE_CHAIN (p))
1884 tree type = TREE_TYPE (p);
1885 if (TREE_CODE (type) == COMPLEX_TYPE
1886 && targetm.calls.split_complex_arg (type))
1892 args = copy_list (args);
1894 for (p = args; p; p = TREE_CHAIN (p))
1896 tree type = TREE_TYPE (p);
1897 if (TREE_CODE (type) == COMPLEX_TYPE
1898 && targetm.calls.split_complex_arg (type))
1901 tree subtype = TREE_TYPE (type);
1902 bool addressable = TREE_ADDRESSABLE (p);
1904 /* Rewrite the PARM_DECL's type with its component. */
1905 TREE_TYPE (p) = subtype;
1906 DECL_ARG_TYPE (p) = TREE_TYPE (DECL_ARG_TYPE (p));
1907 DECL_MODE (p) = VOIDmode;
1908 DECL_SIZE (p) = NULL;
1909 DECL_SIZE_UNIT (p) = NULL;
1910 /* If this arg must go in memory, put it in a pseudo here.
1911 We can't allow it to go in memory as per normal parms,
1912 because the usual place might not have the imag part
1913 adjacent to the real part. */
1914 DECL_ARTIFICIAL (p) = addressable;
1915 DECL_IGNORED_P (p) = addressable;
1916 TREE_ADDRESSABLE (p) = 0;
1919 /* Build a second synthetic decl. */
1920 decl = build_decl (PARM_DECL, NULL_TREE, subtype);
1921 DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (p);
1922 DECL_ARTIFICIAL (decl) = addressable;
1923 DECL_IGNORED_P (decl) = addressable;
1924 layout_decl (decl, 0);
1926 /* Splice it in; skip the new decl. */
1927 TREE_CHAIN (decl) = TREE_CHAIN (p);
1928 TREE_CHAIN (p) = decl;
1936 /* A subroutine of assign_parms. Adjust the parameter list to incorporate
1937 the hidden struct return argument, and (abi willing) complex args.
1938 Return the new parameter list. */
1941 assign_parms_augmented_arg_list (struct assign_parm_data_all *all)
1943 tree fndecl = current_function_decl;
1944 tree fntype = TREE_TYPE (fndecl);
1945 tree fnargs = DECL_ARGUMENTS (fndecl);
1947 /* If struct value address is treated as the first argument, make it so. */
1948 if (aggregate_value_p (DECL_RESULT (fndecl), fndecl)
1949 && ! current_function_returns_pcc_struct
1950 && targetm.calls.struct_value_rtx (TREE_TYPE (fndecl), 1) == 0)
1952 tree type = build_pointer_type (TREE_TYPE (fntype));
1955 decl = build_decl (PARM_DECL, NULL_TREE, type);
1956 DECL_ARG_TYPE (decl) = type;
1957 DECL_ARTIFICIAL (decl) = 1;
1958 DECL_IGNORED_P (decl) = 1;
1960 TREE_CHAIN (decl) = fnargs;
1962 all->function_result_decl = decl;
1965 all->orig_fnargs = fnargs;
1967 /* If the target wants to split complex arguments into scalars, do so. */
1968 if (targetm.calls.split_complex_arg)
1969 fnargs = split_complex_args (fnargs);
1974 /* A subroutine of assign_parms. Examine PARM and pull out type and mode
1975 data for the parameter. Incorporate ABI specifics such as pass-by-
1976 reference and type promotion. */
1979 assign_parm_find_data_types (struct assign_parm_data_all *all, tree parm,
1980 struct assign_parm_data_one *data)
1982 tree nominal_type, passed_type;
1983 enum machine_mode nominal_mode, passed_mode, promoted_mode;
1985 memset (data, 0, sizeof (*data));
1987 /* NAMED_ARG is a mis-nomer. We really mean 'non-varadic'. */
1988 if (!current_function_stdarg)
1989 data->named_arg = 1; /* No varadic parms. */
1990 else if (TREE_CHAIN (parm))
1991 data->named_arg = 1; /* Not the last non-varadic parm. */
1992 else if (targetm.calls.strict_argument_naming (&all->args_so_far))
1993 data->named_arg = 1; /* Only varadic ones are unnamed. */
1995 data->named_arg = 0; /* Treat as varadic. */
1997 nominal_type = TREE_TYPE (parm);
1998 passed_type = DECL_ARG_TYPE (parm);
2000 /* Look out for errors propagating this far. Also, if the parameter's
2001 type is void then its value doesn't matter. */
2002 if (TREE_TYPE (parm) == error_mark_node
2003 /* This can happen after weird syntax errors
2004 or if an enum type is defined among the parms. */
2005 || TREE_CODE (parm) != PARM_DECL
2006 || passed_type == NULL
2007 || VOID_TYPE_P (nominal_type))
2009 nominal_type = passed_type = void_type_node;
2010 nominal_mode = passed_mode = promoted_mode = VOIDmode;
2014 /* Find mode of arg as it is passed, and mode of arg as it should be
2015 during execution of this function. */
2016 passed_mode = TYPE_MODE (passed_type);
2017 nominal_mode = TYPE_MODE (nominal_type);
2019 /* If the parm is to be passed as a transparent union, use the type of
2020 the first field for the tests below. We have already verified that
2021 the modes are the same. */
2022 if (DECL_TRANSPARENT_UNION (parm)
2023 || (TREE_CODE (passed_type) == UNION_TYPE
2024 && TYPE_TRANSPARENT_UNION (passed_type)))
2025 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
2027 /* See if this arg was passed by invisible reference. */
2028 if (pass_by_reference (&all->args_so_far, passed_mode,
2029 passed_type, data->named_arg))
2031 passed_type = nominal_type = build_pointer_type (passed_type);
2032 data->passed_pointer = true;
2033 passed_mode = nominal_mode = Pmode;
2036 /* Find mode as it is passed by the ABI. */
2037 promoted_mode = passed_mode;
2038 if (targetm.calls.promote_function_args (TREE_TYPE (current_function_decl)))
2040 int unsignedp = TYPE_UNSIGNED (passed_type);
2041 promoted_mode = promote_mode (passed_type, promoted_mode,
2046 data->nominal_type = nominal_type;
2047 data->passed_type = passed_type;
2048 data->nominal_mode = nominal_mode;
2049 data->passed_mode = passed_mode;
2050 data->promoted_mode = promoted_mode;
2053 /* A subroutine of assign_parms. Invoke setup_incoming_varargs. */
2056 assign_parms_setup_varargs (struct assign_parm_data_all *all,
2057 struct assign_parm_data_one *data, bool no_rtl)
2059 int varargs_pretend_bytes = 0;
2061 targetm.calls.setup_incoming_varargs (&all->args_so_far,
2062 data->promoted_mode,
2064 &varargs_pretend_bytes, no_rtl);
2066 /* If the back-end has requested extra stack space, record how much is
2067 needed. Do not change pretend_args_size otherwise since it may be
2068 nonzero from an earlier partial argument. */
2069 if (varargs_pretend_bytes > 0)
2070 all->pretend_args_size = varargs_pretend_bytes;
2073 /* A subroutine of assign_parms. Set DATA->ENTRY_PARM corresponding to
2074 the incoming location of the current parameter. */
2077 assign_parm_find_entry_rtl (struct assign_parm_data_all *all,
2078 struct assign_parm_data_one *data)
2080 HOST_WIDE_INT pretend_bytes = 0;
2084 if (data->promoted_mode == VOIDmode)
2086 data->entry_parm = data->stack_parm = const0_rtx;
2090 #ifdef FUNCTION_INCOMING_ARG
2091 entry_parm = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
2092 data->passed_type, data->named_arg);
2094 entry_parm = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
2095 data->passed_type, data->named_arg);
2098 if (entry_parm == 0)
2099 data->promoted_mode = data->passed_mode;
2101 /* Determine parm's home in the stack, in case it arrives in the stack
2102 or we should pretend it did. Compute the stack position and rtx where
2103 the argument arrives and its size.
2105 There is one complexity here: If this was a parameter that would
2106 have been passed in registers, but wasn't only because it is
2107 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
2108 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
2109 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of 0
2110 as it was the previous time. */
2111 in_regs = entry_parm != 0;
2112 #ifdef STACK_PARMS_IN_REG_PARM_AREA
2115 if (!in_regs && !data->named_arg)
2117 if (targetm.calls.pretend_outgoing_varargs_named (&all->args_so_far))
2120 #ifdef FUNCTION_INCOMING_ARG
2121 tem = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
2122 data->passed_type, true);
2124 tem = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
2125 data->passed_type, true);
2127 in_regs = tem != NULL;
2131 /* If this parameter was passed both in registers and in the stack, use
2132 the copy on the stack. */
2133 if (targetm.calls.must_pass_in_stack (data->promoted_mode,
2141 partial = targetm.calls.arg_partial_bytes (&all->args_so_far,
2142 data->promoted_mode,
2145 data->partial = partial;
2147 /* The caller might already have allocated stack space for the
2148 register parameters. */
2149 if (partial != 0 && all->reg_parm_stack_space == 0)
2151 /* Part of this argument is passed in registers and part
2152 is passed on the stack. Ask the prologue code to extend
2153 the stack part so that we can recreate the full value.
2155 PRETEND_BYTES is the size of the registers we need to store.
2156 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
2157 stack space that the prologue should allocate.
2159 Internally, gcc assumes that the argument pointer is aligned
2160 to STACK_BOUNDARY bits. This is used both for alignment
2161 optimizations (see init_emit) and to locate arguments that are
2162 aligned to more than PARM_BOUNDARY bits. We must preserve this
2163 invariant by rounding CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to
2164 a stack boundary. */
2166 /* We assume at most one partial arg, and it must be the first
2167 argument on the stack. */
2168 gcc_assert (!all->extra_pretend_bytes && !all->pretend_args_size);
2170 pretend_bytes = partial;
2171 all->pretend_args_size = CEIL_ROUND (pretend_bytes, STACK_BYTES);
2173 /* We want to align relative to the actual stack pointer, so
2174 don't include this in the stack size until later. */
2175 all->extra_pretend_bytes = all->pretend_args_size;
2179 locate_and_pad_parm (data->promoted_mode, data->passed_type, in_regs,
2180 entry_parm ? data->partial : 0, current_function_decl,
2181 &all->stack_args_size, &data->locate);
2183 /* Adjust offsets to include the pretend args. */
2184 pretend_bytes = all->extra_pretend_bytes - pretend_bytes;
2185 data->locate.slot_offset.constant += pretend_bytes;
2186 data->locate.offset.constant += pretend_bytes;
2188 data->entry_parm = entry_parm;
2191 /* A subroutine of assign_parms. If there is actually space on the stack
2192 for this parm, count it in stack_args_size and return true. */
2195 assign_parm_is_stack_parm (struct assign_parm_data_all *all,
2196 struct assign_parm_data_one *data)
2198 /* Trivially true if we've no incoming register. */
2199 if (data->entry_parm == NULL)
2201 /* Also true if we're partially in registers and partially not,
2202 since we've arranged to drop the entire argument on the stack. */
2203 else if (data->partial != 0)
2205 /* Also true if the target says that it's passed in both registers
2206 and on the stack. */
2207 else if (GET_CODE (data->entry_parm) == PARALLEL
2208 && XEXP (XVECEXP (data->entry_parm, 0, 0), 0) == NULL_RTX)
2210 /* Also true if the target says that there's stack allocated for
2211 all register parameters. */
2212 else if (all->reg_parm_stack_space > 0)
2214 /* Otherwise, no, this parameter has no ABI defined stack slot. */
2218 all->stack_args_size.constant += data->locate.size.constant;
2219 if (data->locate.size.var)
2220 ADD_PARM_SIZE (all->stack_args_size, data->locate.size.var);
2225 /* A subroutine of assign_parms. Given that this parameter is allocated
2226 stack space by the ABI, find it. */
2229 assign_parm_find_stack_rtl (tree parm, struct assign_parm_data_one *data)
2231 rtx offset_rtx, stack_parm;
2232 unsigned int align, boundary;
2234 /* If we're passing this arg using a reg, make its stack home the
2235 aligned stack slot. */
2236 if (data->entry_parm)
2237 offset_rtx = ARGS_SIZE_RTX (data->locate.slot_offset);
2239 offset_rtx = ARGS_SIZE_RTX (data->locate.offset);
2241 stack_parm = current_function_internal_arg_pointer;
2242 if (offset_rtx != const0_rtx)
2243 stack_parm = gen_rtx_PLUS (Pmode, stack_parm, offset_rtx);
2244 stack_parm = gen_rtx_MEM (data->promoted_mode, stack_parm);
2246 set_mem_attributes (stack_parm, parm, 1);
2248 boundary = data->locate.boundary;
2249 align = BITS_PER_UNIT;
2251 /* If we're padding upward, we know that the alignment of the slot
2252 is FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
2253 intentionally forcing upward padding. Otherwise we have to come
2254 up with a guess at the alignment based on OFFSET_RTX. */
2255 if (data->locate.where_pad != downward || data->entry_parm)
2257 else if (GET_CODE (offset_rtx) == CONST_INT)
2259 align = INTVAL (offset_rtx) * BITS_PER_UNIT | boundary;
2260 align = align & -align;
2262 set_mem_align (stack_parm, align);
2264 if (data->entry_parm)
2265 set_reg_attrs_for_parm (data->entry_parm, stack_parm);
2267 data->stack_parm = stack_parm;
2270 /* A subroutine of assign_parms. Adjust DATA->ENTRY_RTL such that it's
2271 always valid and contiguous. */
2274 assign_parm_adjust_entry_rtl (struct assign_parm_data_one *data)
2276 rtx entry_parm = data->entry_parm;
2277 rtx stack_parm = data->stack_parm;
2279 /* If this parm was passed part in regs and part in memory, pretend it
2280 arrived entirely in memory by pushing the register-part onto the stack.
2281 In the special case of a DImode or DFmode that is split, we could put
2282 it together in a pseudoreg directly, but for now that's not worth
2284 if (data->partial != 0)
2286 /* Handle calls that pass values in multiple non-contiguous
2287 locations. The Irix 6 ABI has examples of this. */
2288 if (GET_CODE (entry_parm) == PARALLEL)
2289 emit_group_store (validize_mem (stack_parm), entry_parm,
2291 int_size_in_bytes (data->passed_type));
2294 gcc_assert (data->partial % UNITS_PER_WORD == 0);
2295 move_block_from_reg (REGNO (entry_parm), validize_mem (stack_parm),
2296 data->partial / UNITS_PER_WORD);
2299 entry_parm = stack_parm;
2302 /* If we didn't decide this parm came in a register, by default it came
2304 else if (entry_parm == NULL)
2305 entry_parm = stack_parm;
2307 /* When an argument is passed in multiple locations, we can't make use
2308 of this information, but we can save some copying if the whole argument
2309 is passed in a single register. */
2310 else if (GET_CODE (entry_parm) == PARALLEL
2311 && data->nominal_mode != BLKmode
2312 && data->passed_mode != BLKmode)
2314 size_t i, len = XVECLEN (entry_parm, 0);
2316 for (i = 0; i < len; i++)
2317 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
2318 && REG_P (XEXP (XVECEXP (entry_parm, 0, i), 0))
2319 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
2320 == data->passed_mode)
2321 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
2323 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
2328 data->entry_parm = entry_parm;
2331 /* A subroutine of assign_parms. Adjust DATA->STACK_RTL such that it's
2332 always valid and properly aligned. */
2335 assign_parm_adjust_stack_rtl (struct assign_parm_data_one *data)
2337 rtx stack_parm = data->stack_parm;
2339 /* If we can't trust the parm stack slot to be aligned enough for its
2340 ultimate type, don't use that slot after entry. We'll make another
2341 stack slot, if we need one. */
2343 && ((STRICT_ALIGNMENT
2344 && GET_MODE_ALIGNMENT (data->nominal_mode) > MEM_ALIGN (stack_parm))
2345 || (data->nominal_type
2346 && TYPE_ALIGN (data->nominal_type) > MEM_ALIGN (stack_parm)
2347 && MEM_ALIGN (stack_parm) < PREFERRED_STACK_BOUNDARY)))
2350 /* If parm was passed in memory, and we need to convert it on entry,
2351 don't store it back in that same slot. */
2352 else if (data->entry_parm == stack_parm
2353 && data->nominal_mode != BLKmode
2354 && data->nominal_mode != data->passed_mode)
2357 /* If stack protection is in effect for this function, don't leave any
2358 pointers in their passed stack slots. */
2359 else if (cfun->stack_protect_guard
2360 && (flag_stack_protect == 2
2361 || data->passed_pointer
2362 || POINTER_TYPE_P (data->nominal_type)))
2365 data->stack_parm = stack_parm;
2368 /* A subroutine of assign_parms. Return true if the current parameter
2369 should be stored as a BLKmode in the current frame. */
2372 assign_parm_setup_block_p (struct assign_parm_data_one *data)
2374 if (data->nominal_mode == BLKmode)
2376 if (GET_CODE (data->entry_parm) == PARALLEL)
2379 #ifdef BLOCK_REG_PADDING
2380 /* Only assign_parm_setup_block knows how to deal with register arguments
2381 that are padded at the least significant end. */
2382 if (REG_P (data->entry_parm)
2383 && GET_MODE_SIZE (data->promoted_mode) < UNITS_PER_WORD
2384 && (BLOCK_REG_PADDING (data->passed_mode, data->passed_type, 1)
2385 == (BYTES_BIG_ENDIAN ? upward : downward)))
2392 /* A subroutine of assign_parms. Arrange for the parameter to be
2393 present and valid in DATA->STACK_RTL. */
2396 assign_parm_setup_block (struct assign_parm_data_all *all,
2397 tree parm, struct assign_parm_data_one *data)
2399 rtx entry_parm = data->entry_parm;
2400 rtx stack_parm = data->stack_parm;
2402 HOST_WIDE_INT size_stored;
2403 rtx orig_entry_parm = entry_parm;
2405 if (GET_CODE (entry_parm) == PARALLEL)
2406 entry_parm = emit_group_move_into_temps (entry_parm);
2408 /* If we've a non-block object that's nevertheless passed in parts,
2409 reconstitute it in register operations rather than on the stack. */
2410 if (GET_CODE (entry_parm) == PARALLEL
2411 && data->nominal_mode != BLKmode)
2413 rtx elt0 = XEXP (XVECEXP (orig_entry_parm, 0, 0), 0);
2415 if ((XVECLEN (entry_parm, 0) > 1
2416 || hard_regno_nregs[REGNO (elt0)][GET_MODE (elt0)] > 1)
2417 && use_register_for_decl (parm))
2419 rtx parmreg = gen_reg_rtx (data->nominal_mode);
2421 push_to_sequence (all->conversion_insns);
2423 /* For values returned in multiple registers, handle possible
2424 incompatible calls to emit_group_store.
2426 For example, the following would be invalid, and would have to
2427 be fixed by the conditional below:
2429 emit_group_store ((reg:SF), (parallel:DF))
2430 emit_group_store ((reg:SI), (parallel:DI))
2432 An example of this are doubles in e500 v2:
2433 (parallel:DF (expr_list (reg:SI) (const_int 0))
2434 (expr_list (reg:SI) (const_int 4))). */
2435 if (data->nominal_mode != data->passed_mode)
2437 rtx t = gen_reg_rtx (GET_MODE (entry_parm));
2438 emit_group_store (t, entry_parm, NULL_TREE,
2439 GET_MODE_SIZE (GET_MODE (entry_parm)));
2440 convert_move (parmreg, t, 0);
2443 emit_group_store (parmreg, entry_parm, data->nominal_type,
2444 int_size_in_bytes (data->nominal_type));
2446 all->conversion_insns = get_insns ();
2449 SET_DECL_RTL (parm, parmreg);
2454 size = int_size_in_bytes (data->passed_type);
2455 size_stored = CEIL_ROUND (size, UNITS_PER_WORD);
2456 if (stack_parm == 0)
2458 DECL_ALIGN (parm) = MAX (DECL_ALIGN (parm), BITS_PER_WORD);
2459 stack_parm = assign_stack_local (BLKmode, size_stored,
2461 if (GET_MODE_SIZE (GET_MODE (entry_parm)) == size)
2462 PUT_MODE (stack_parm, GET_MODE (entry_parm));
2463 set_mem_attributes (stack_parm, parm, 1);
2466 /* If a BLKmode arrives in registers, copy it to a stack slot. Handle
2467 calls that pass values in multiple non-contiguous locations. */
2468 if (REG_P (entry_parm) || GET_CODE (entry_parm) == PARALLEL)
2472 /* Note that we will be storing an integral number of words.
2473 So we have to be careful to ensure that we allocate an
2474 integral number of words. We do this above when we call
2475 assign_stack_local if space was not allocated in the argument
2476 list. If it was, this will not work if PARM_BOUNDARY is not
2477 a multiple of BITS_PER_WORD. It isn't clear how to fix this
2478 if it becomes a problem. Exception is when BLKmode arrives
2479 with arguments not conforming to word_mode. */
2481 if (data->stack_parm == 0)
2483 else if (GET_CODE (entry_parm) == PARALLEL)
2486 gcc_assert (!size || !(PARM_BOUNDARY % BITS_PER_WORD));
2488 mem = validize_mem (stack_parm);
2490 /* Handle values in multiple non-contiguous locations. */
2491 if (GET_CODE (entry_parm) == PARALLEL)
2493 push_to_sequence (all->conversion_insns);
2494 emit_group_store (mem, entry_parm, data->passed_type, size);
2495 all->conversion_insns = get_insns ();
2502 /* If SIZE is that of a mode no bigger than a word, just use
2503 that mode's store operation. */
2504 else if (size <= UNITS_PER_WORD)
2506 enum machine_mode mode
2507 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
2510 #ifdef BLOCK_REG_PADDING
2511 && (size == UNITS_PER_WORD
2512 || (BLOCK_REG_PADDING (mode, data->passed_type, 1)
2513 != (BYTES_BIG_ENDIAN ? upward : downward)))
2517 rtx reg = gen_rtx_REG (mode, REGNO (entry_parm));
2518 emit_move_insn (change_address (mem, mode, 0), reg);
2521 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
2522 machine must be aligned to the left before storing
2523 to memory. Note that the previous test doesn't
2524 handle all cases (e.g. SIZE == 3). */
2525 else if (size != UNITS_PER_WORD
2526 #ifdef BLOCK_REG_PADDING
2527 && (BLOCK_REG_PADDING (mode, data->passed_type, 1)
2535 int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
2536 rtx reg = gen_rtx_REG (word_mode, REGNO (entry_parm));
2538 x = expand_shift (LSHIFT_EXPR, word_mode, reg,
2539 build_int_cst (NULL_TREE, by),
2541 tem = change_address (mem, word_mode, 0);
2542 emit_move_insn (tem, x);
2545 move_block_from_reg (REGNO (entry_parm), mem,
2546 size_stored / UNITS_PER_WORD);
2549 move_block_from_reg (REGNO (entry_parm), mem,
2550 size_stored / UNITS_PER_WORD);
2552 else if (data->stack_parm == 0)
2554 push_to_sequence (all->conversion_insns);
2555 emit_block_move (stack_parm, data->entry_parm, GEN_INT (size),
2557 all->conversion_insns = get_insns ();
2561 data->stack_parm = stack_parm;
2562 SET_DECL_RTL (parm, stack_parm);
2565 /* A subroutine of assign_parms. Allocate a pseudo to hold the current
2566 parameter. Get it there. Perform all ABI specified conversions. */
2569 assign_parm_setup_reg (struct assign_parm_data_all *all, tree parm,
2570 struct assign_parm_data_one *data)
2573 enum machine_mode promoted_nominal_mode;
2574 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (parm));
2575 bool did_conversion = false;
2577 /* Store the parm in a pseudoregister during the function, but we may
2578 need to do it in a wider mode. */
2580 promoted_nominal_mode
2581 = promote_mode (data->nominal_type, data->nominal_mode, &unsignedp, 0);
2583 parmreg = gen_reg_rtx (promoted_nominal_mode);
2585 if (!DECL_ARTIFICIAL (parm))
2586 mark_user_reg (parmreg);
2588 /* If this was an item that we received a pointer to,
2589 set DECL_RTL appropriately. */
2590 if (data->passed_pointer)
2592 rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data->passed_type)), parmreg);
2593 set_mem_attributes (x, parm, 1);
2594 SET_DECL_RTL (parm, x);
2597 SET_DECL_RTL (parm, parmreg);
2599 /* Copy the value into the register. */
2600 if (data->nominal_mode != data->passed_mode
2601 || promoted_nominal_mode != data->promoted_mode)
2605 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
2606 mode, by the caller. We now have to convert it to
2607 NOMINAL_MODE, if different. However, PARMREG may be in
2608 a different mode than NOMINAL_MODE if it is being stored
2611 If ENTRY_PARM is a hard register, it might be in a register
2612 not valid for operating in its mode (e.g., an odd-numbered
2613 register for a DFmode). In that case, moves are the only
2614 thing valid, so we can't do a convert from there. This
2615 occurs when the calling sequence allow such misaligned
2618 In addition, the conversion may involve a call, which could
2619 clobber parameters which haven't been copied to pseudo
2620 registers yet. Therefore, we must first copy the parm to
2621 a pseudo reg here, and save the conversion until after all
2622 parameters have been moved. */
2624 rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
2626 emit_move_insn (tempreg, validize_mem (data->entry_parm));
2628 push_to_sequence (all->conversion_insns);
2629 tempreg = convert_to_mode (data->nominal_mode, tempreg, unsignedp);
2631 if (GET_CODE (tempreg) == SUBREG
2632 && GET_MODE (tempreg) == data->nominal_mode
2633 && REG_P (SUBREG_REG (tempreg))
2634 && data->nominal_mode == data->passed_mode
2635 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (data->entry_parm)
2636 && GET_MODE_SIZE (GET_MODE (tempreg))
2637 < GET_MODE_SIZE (GET_MODE (data->entry_parm)))
2639 /* The argument is already sign/zero extended, so note it
2641 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
2642 SUBREG_PROMOTED_UNSIGNED_SET (tempreg, unsignedp);
2645 /* TREE_USED gets set erroneously during expand_assignment. */
2646 save_tree_used = TREE_USED (parm);
2647 expand_assignment (parm, make_tree (data->nominal_type, tempreg));
2648 TREE_USED (parm) = save_tree_used;
2649 all->conversion_insns = get_insns ();
2652 did_conversion = true;
2655 emit_move_insn (parmreg, validize_mem (data->entry_parm));
2657 /* If we were passed a pointer but the actual value can safely live
2658 in a register, put it in one. */
2659 if (data->passed_pointer
2660 && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
2661 /* If by-reference argument was promoted, demote it. */
2662 && (TYPE_MODE (TREE_TYPE (parm)) != GET_MODE (DECL_RTL (parm))
2663 || use_register_for_decl (parm)))
2665 /* We can't use nominal_mode, because it will have been set to
2666 Pmode above. We must use the actual mode of the parm. */
2667 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
2668 mark_user_reg (parmreg);
2670 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
2672 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
2673 int unsigned_p = TYPE_UNSIGNED (TREE_TYPE (parm));
2675 push_to_sequence (all->conversion_insns);
2676 emit_move_insn (tempreg, DECL_RTL (parm));
2677 tempreg = convert_to_mode (GET_MODE (parmreg), tempreg, unsigned_p);
2678 emit_move_insn (parmreg, tempreg);
2679 all->conversion_insns = get_insns ();
2682 did_conversion = true;
2685 emit_move_insn (parmreg, DECL_RTL (parm));
2687 SET_DECL_RTL (parm, parmreg);
2689 /* STACK_PARM is the pointer, not the parm, and PARMREG is
2691 data->stack_parm = NULL;
2694 /* Mark the register as eliminable if we did no conversion and it was
2695 copied from memory at a fixed offset, and the arg pointer was not
2696 copied to a pseudo-reg. If the arg pointer is a pseudo reg or the
2697 offset formed an invalid address, such memory-equivalences as we
2698 make here would screw up life analysis for it. */
2699 if (data->nominal_mode == data->passed_mode
2701 && data->stack_parm != 0
2702 && MEM_P (data->stack_parm)
2703 && data->locate.offset.var == 0
2704 && reg_mentioned_p (virtual_incoming_args_rtx,
2705 XEXP (data->stack_parm, 0)))
2707 rtx linsn = get_last_insn ();
2710 /* Mark complex types separately. */
2711 if (GET_CODE (parmreg) == CONCAT)
2713 enum machine_mode submode
2714 = GET_MODE_INNER (GET_MODE (parmreg));
2715 int regnor = REGNO (XEXP (parmreg, 0));
2716 int regnoi = REGNO (XEXP (parmreg, 1));
2717 rtx stackr = adjust_address_nv (data->stack_parm, submode, 0);
2718 rtx stacki = adjust_address_nv (data->stack_parm, submode,
2719 GET_MODE_SIZE (submode));
2721 /* Scan backwards for the set of the real and
2723 for (sinsn = linsn; sinsn != 0;
2724 sinsn = prev_nonnote_insn (sinsn))
2726 set = single_set (sinsn);
2730 if (SET_DEST (set) == regno_reg_rtx [regnoi])
2732 = gen_rtx_EXPR_LIST (REG_EQUIV, stacki,
2734 else if (SET_DEST (set) == regno_reg_rtx [regnor])
2736 = gen_rtx_EXPR_LIST (REG_EQUIV, stackr,
2740 else if ((set = single_set (linsn)) != 0
2741 && SET_DEST (set) == parmreg)
2743 = gen_rtx_EXPR_LIST (REG_EQUIV,
2744 data->stack_parm, REG_NOTES (linsn));
2747 /* For pointer data type, suggest pointer register. */
2748 if (POINTER_TYPE_P (TREE_TYPE (parm)))
2749 mark_reg_pointer (parmreg,
2750 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
2753 /* A subroutine of assign_parms. Allocate stack space to hold the current
2754 parameter. Get it there. Perform all ABI specified conversions. */
2757 assign_parm_setup_stack (struct assign_parm_data_all *all, tree parm,
2758 struct assign_parm_data_one *data)
2760 /* Value must be stored in the stack slot STACK_PARM during function
2762 bool to_conversion = false;
2764 if (data->promoted_mode != data->nominal_mode)
2766 /* Conversion is required. */
2767 rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
2769 emit_move_insn (tempreg, validize_mem (data->entry_parm));
2771 push_to_sequence (all->conversion_insns);
2772 to_conversion = true;
2774 data->entry_parm = convert_to_mode (data->nominal_mode, tempreg,
2775 TYPE_UNSIGNED (TREE_TYPE (parm)));
2777 if (data->stack_parm)
2778 /* ??? This may need a big-endian conversion on sparc64. */
2780 = adjust_address (data->stack_parm, data->nominal_mode, 0);
2783 if (data->entry_parm != data->stack_parm)
2787 if (data->stack_parm == 0)
2790 = assign_stack_local (GET_MODE (data->entry_parm),
2791 GET_MODE_SIZE (GET_MODE (data->entry_parm)),
2792 TYPE_ALIGN (data->passed_type));
2793 set_mem_attributes (data->stack_parm, parm, 1);
2796 dest = validize_mem (data->stack_parm);
2797 src = validize_mem (data->entry_parm);
2801 /* Use a block move to handle potentially misaligned entry_parm. */
2803 push_to_sequence (all->conversion_insns);
2804 to_conversion = true;
2806 emit_block_move (dest, src,
2807 GEN_INT (int_size_in_bytes (data->passed_type)),
2811 emit_move_insn (dest, src);
2816 all->conversion_insns = get_insns ();
2820 SET_DECL_RTL (parm, data->stack_parm);
2823 /* A subroutine of assign_parms. If the ABI splits complex arguments, then
2824 undo the frobbing that we did in assign_parms_augmented_arg_list. */
2827 assign_parms_unsplit_complex (struct assign_parm_data_all *all, tree fnargs)
2830 tree orig_fnargs = all->orig_fnargs;
2832 for (parm = orig_fnargs; parm; parm = TREE_CHAIN (parm))
2834 if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
2835 && targetm.calls.split_complex_arg (TREE_TYPE (parm)))
2837 rtx tmp, real, imag;
2838 enum machine_mode inner = GET_MODE_INNER (DECL_MODE (parm));
2840 real = DECL_RTL (fnargs);
2841 imag = DECL_RTL (TREE_CHAIN (fnargs));
2842 if (inner != GET_MODE (real))
2844 real = gen_lowpart_SUBREG (inner, real);
2845 imag = gen_lowpart_SUBREG (inner, imag);
2848 if (TREE_ADDRESSABLE (parm))
2851 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (parm));
2853 /* split_complex_arg put the real and imag parts in
2854 pseudos. Move them to memory. */
2855 tmp = assign_stack_local (DECL_MODE (parm), size,
2856 TYPE_ALIGN (TREE_TYPE (parm)));
2857 set_mem_attributes (tmp, parm, 1);
2858 rmem = adjust_address_nv (tmp, inner, 0);
2859 imem = adjust_address_nv (tmp, inner, GET_MODE_SIZE (inner));
2860 push_to_sequence (all->conversion_insns);
2861 emit_move_insn (rmem, real);
2862 emit_move_insn (imem, imag);
2863 all->conversion_insns = get_insns ();
2867 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
2868 SET_DECL_RTL (parm, tmp);
2870 real = DECL_INCOMING_RTL (fnargs);
2871 imag = DECL_INCOMING_RTL (TREE_CHAIN (fnargs));
2872 if (inner != GET_MODE (real))
2874 real = gen_lowpart_SUBREG (inner, real);
2875 imag = gen_lowpart_SUBREG (inner, imag);
2877 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
2878 set_decl_incoming_rtl (parm, tmp);
2879 fnargs = TREE_CHAIN (fnargs);
2883 SET_DECL_RTL (parm, DECL_RTL (fnargs));
2884 set_decl_incoming_rtl (parm, DECL_INCOMING_RTL (fnargs));
2886 /* Set MEM_EXPR to the original decl, i.e. to PARM,
2887 instead of the copy of decl, i.e. FNARGS. */
2888 if (DECL_INCOMING_RTL (parm) && MEM_P (DECL_INCOMING_RTL (parm)))
2889 set_mem_expr (DECL_INCOMING_RTL (parm), parm);
2892 fnargs = TREE_CHAIN (fnargs);
2896 /* Assign RTL expressions to the function's parameters. This may involve
2897 copying them into registers and using those registers as the DECL_RTL. */
2900 assign_parms (tree fndecl)
2902 struct assign_parm_data_all all;
2904 rtx internal_arg_pointer;
2906 /* If the reg that the virtual arg pointer will be translated into is
2907 not a fixed reg or is the stack pointer, make a copy of the virtual
2908 arg pointer, and address parms via the copy. The frame pointer is
2909 considered fixed even though it is not marked as such.
2911 The second time through, simply use ap to avoid generating rtx. */
2913 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
2914 || ! (fixed_regs[ARG_POINTER_REGNUM]
2915 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
2916 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
2918 internal_arg_pointer = virtual_incoming_args_rtx;
2919 current_function_internal_arg_pointer = internal_arg_pointer;
2921 assign_parms_initialize_all (&all);
2922 fnargs = assign_parms_augmented_arg_list (&all);
2924 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
2926 struct assign_parm_data_one data;
2928 /* Extract the type of PARM; adjust it according to ABI. */
2929 assign_parm_find_data_types (&all, parm, &data);
2931 /* Early out for errors and void parameters. */
2932 if (data.passed_mode == VOIDmode)
2934 SET_DECL_RTL (parm, const0_rtx);
2935 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
2939 if (current_function_stdarg && !TREE_CHAIN (parm))
2940 assign_parms_setup_varargs (&all, &data, false);
2942 /* Find out where the parameter arrives in this function. */
2943 assign_parm_find_entry_rtl (&all, &data);
2945 /* Find out where stack space for this parameter might be. */
2946 if (assign_parm_is_stack_parm (&all, &data))
2948 assign_parm_find_stack_rtl (parm, &data);
2949 assign_parm_adjust_entry_rtl (&data);
2952 /* Record permanently how this parm was passed. */
2953 set_decl_incoming_rtl (parm, data.entry_parm);
2955 /* Update info on where next arg arrives in registers. */
2956 FUNCTION_ARG_ADVANCE (all.args_so_far, data.promoted_mode,
2957 data.passed_type, data.named_arg);
2959 assign_parm_adjust_stack_rtl (&data);
2961 if (assign_parm_setup_block_p (&data))
2962 assign_parm_setup_block (&all, parm, &data);
2963 else if (data.passed_pointer || use_register_for_decl (parm))
2964 assign_parm_setup_reg (&all, parm, &data);
2966 assign_parm_setup_stack (&all, parm, &data);
2969 if (targetm.calls.split_complex_arg && fnargs != all.orig_fnargs)
2970 assign_parms_unsplit_complex (&all, fnargs);
2972 /* Output all parameter conversion instructions (possibly including calls)
2973 now that all parameters have been copied out of hard registers. */
2974 emit_insn (all.conversion_insns);
2976 /* If we are receiving a struct value address as the first argument, set up
2977 the RTL for the function result. As this might require code to convert
2978 the transmitted address to Pmode, we do this here to ensure that possible
2979 preliminary conversions of the address have been emitted already. */
2980 if (all.function_result_decl)
2982 tree result = DECL_RESULT (current_function_decl);
2983 rtx addr = DECL_RTL (all.function_result_decl);
2986 if (DECL_BY_REFERENCE (result))
2990 addr = convert_memory_address (Pmode, addr);
2991 x = gen_rtx_MEM (DECL_MODE (result), addr);
2992 set_mem_attributes (x, result, 1);
2994 SET_DECL_RTL (result, x);
2997 /* We have aligned all the args, so add space for the pretend args. */
2998 current_function_pretend_args_size = all.pretend_args_size;
2999 all.stack_args_size.constant += all.extra_pretend_bytes;
3000 current_function_args_size = all.stack_args_size.constant;
3002 /* Adjust function incoming argument size for alignment and
3005 #ifdef REG_PARM_STACK_SPACE
3006 current_function_args_size = MAX (current_function_args_size,
3007 REG_PARM_STACK_SPACE (fndecl));
3010 current_function_args_size
3011 = ((current_function_args_size + STACK_BYTES - 1)
3012 / STACK_BYTES) * STACK_BYTES;
3014 #ifdef ARGS_GROW_DOWNWARD
3015 current_function_arg_offset_rtx
3016 = (all.stack_args_size.var == 0 ? GEN_INT (-all.stack_args_size.constant)
3017 : expand_expr (size_diffop (all.stack_args_size.var,
3018 size_int (-all.stack_args_size.constant)),
3019 NULL_RTX, VOIDmode, 0));
3021 current_function_arg_offset_rtx = ARGS_SIZE_RTX (all.stack_args_size);
3024 /* See how many bytes, if any, of its args a function should try to pop
3027 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
3028 current_function_args_size);
3030 /* For stdarg.h function, save info about
3031 regs and stack space used by the named args. */
3033 current_function_args_info = all.args_so_far;
3035 /* Set the rtx used for the function return value. Put this in its
3036 own variable so any optimizers that need this information don't have
3037 to include tree.h. Do this here so it gets done when an inlined
3038 function gets output. */
3040 current_function_return_rtx
3041 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
3042 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
3044 /* If scalar return value was computed in a pseudo-reg, or was a named
3045 return value that got dumped to the stack, copy that to the hard
3047 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
3049 tree decl_result = DECL_RESULT (fndecl);
3050 rtx decl_rtl = DECL_RTL (decl_result);
3052 if (REG_P (decl_rtl)
3053 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
3054 : DECL_REGISTER (decl_result))
3058 #ifdef FUNCTION_OUTGOING_VALUE
3059 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
3062 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
3065 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
3066 /* The delay slot scheduler assumes that current_function_return_rtx
3067 holds the hard register containing the return value, not a
3068 temporary pseudo. */
3069 current_function_return_rtx = real_decl_rtl;
3074 /* A subroutine of gimplify_parameters, invoked via walk_tree.
3075 For all seen types, gimplify their sizes. */
3078 gimplify_parm_type (tree *tp, int *walk_subtrees, void *data)
3085 if (POINTER_TYPE_P (t))
3087 else if (TYPE_SIZE (t) && !TREE_CONSTANT (TYPE_SIZE (t))
3088 && !TYPE_SIZES_GIMPLIFIED (t))
3090 gimplify_type_sizes (t, (tree *) data);
3098 /* Gimplify the parameter list for current_function_decl. This involves
3099 evaluating SAVE_EXPRs of variable sized parameters and generating code
3100 to implement callee-copies reference parameters. Returns a list of
3101 statements to add to the beginning of the function, or NULL if nothing
3105 gimplify_parameters (void)
3107 struct assign_parm_data_all all;
3108 tree fnargs, parm, stmts = NULL;
3110 assign_parms_initialize_all (&all);
3111 fnargs = assign_parms_augmented_arg_list (&all);
3113 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
3115 struct assign_parm_data_one data;
3117 /* Extract the type of PARM; adjust it according to ABI. */
3118 assign_parm_find_data_types (&all, parm, &data);
3120 /* Early out for errors and void parameters. */
3121 if (data.passed_mode == VOIDmode || DECL_SIZE (parm) == NULL)
3124 /* Update info on where next arg arrives in registers. */
3125 FUNCTION_ARG_ADVANCE (all.args_so_far, data.promoted_mode,
3126 data.passed_type, data.named_arg);
3128 /* ??? Once upon a time variable_size stuffed parameter list
3129 SAVE_EXPRs (amongst others) onto a pending sizes list. This
3130 turned out to be less than manageable in the gimple world.
3131 Now we have to hunt them down ourselves. */
3132 walk_tree_without_duplicates (&data.passed_type,
3133 gimplify_parm_type, &stmts);
3135 if (!TREE_CONSTANT (DECL_SIZE (parm)))
3137 gimplify_one_sizepos (&DECL_SIZE (parm), &stmts);
3138 gimplify_one_sizepos (&DECL_SIZE_UNIT (parm), &stmts);
3141 if (data.passed_pointer)
3143 tree type = TREE_TYPE (data.passed_type);
3144 if (reference_callee_copied (&all.args_so_far, TYPE_MODE (type),
3145 type, data.named_arg))
3149 /* For constant sized objects, this is trivial; for
3150 variable-sized objects, we have to play games. */
3151 if (TREE_CONSTANT (DECL_SIZE (parm)))
3153 local = create_tmp_var (type, get_name (parm));
3154 DECL_IGNORED_P (local) = 0;
3158 tree ptr_type, addr, args;
3160 ptr_type = build_pointer_type (type);
3161 addr = create_tmp_var (ptr_type, get_name (parm));
3162 DECL_IGNORED_P (addr) = 0;
3163 local = build_fold_indirect_ref (addr);
3165 args = tree_cons (NULL, DECL_SIZE_UNIT (parm), NULL);
3166 t = built_in_decls[BUILT_IN_ALLOCA];
3167 t = build_function_call_expr (t, args);
3168 t = fold_convert (ptr_type, t);
3169 t = build2 (MODIFY_EXPR, void_type_node, addr, t);
3170 gimplify_and_add (t, &stmts);
3173 t = build2 (MODIFY_EXPR, void_type_node, local, parm);
3174 gimplify_and_add (t, &stmts);
3176 SET_DECL_VALUE_EXPR (parm, local);
3177 DECL_HAS_VALUE_EXPR_P (parm) = 1;
3185 /* Indicate whether REGNO is an incoming argument to the current function
3186 that was promoted to a wider mode. If so, return the RTX for the
3187 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
3188 that REGNO is promoted from and whether the promotion was signed or
3192 promoted_input_arg (unsigned int regno, enum machine_mode *pmode, int *punsignedp)
3196 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
3197 arg = TREE_CHAIN (arg))
3198 if (REG_P (DECL_INCOMING_RTL (arg))
3199 && REGNO (DECL_INCOMING_RTL (arg)) == regno
3200 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
3202 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
3203 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (arg));
3205 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
3206 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
3207 && mode != DECL_MODE (arg))
3209 *pmode = DECL_MODE (arg);
3210 *punsignedp = unsignedp;
3211 return DECL_INCOMING_RTL (arg);
3219 /* Compute the size and offset from the start of the stacked arguments for a
3220 parm passed in mode PASSED_MODE and with type TYPE.
3222 INITIAL_OFFSET_PTR points to the current offset into the stacked
3225 The starting offset and size for this parm are returned in
3226 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
3227 nonzero, the offset is that of stack slot, which is returned in
3228 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
3229 padding required from the initial offset ptr to the stack slot.
3231 IN_REGS is nonzero if the argument will be passed in registers. It will
3232 never be set if REG_PARM_STACK_SPACE is not defined.
3234 FNDECL is the function in which the argument was defined.
3236 There are two types of rounding that are done. The first, controlled by
3237 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
3238 list to be aligned to the specific boundary (in bits). This rounding
3239 affects the initial and starting offsets, but not the argument size.
3241 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
3242 optionally rounds the size of the parm to PARM_BOUNDARY. The
3243 initial offset is not affected by this rounding, while the size always
3244 is and the starting offset may be. */
3246 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
3247 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
3248 callers pass in the total size of args so far as
3249 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
3252 locate_and_pad_parm (enum machine_mode passed_mode, tree type, int in_regs,
3253 int partial, tree fndecl ATTRIBUTE_UNUSED,
3254 struct args_size *initial_offset_ptr,
3255 struct locate_and_pad_arg_data *locate)
3258 enum direction where_pad;
3260 int reg_parm_stack_space = 0;
3261 int part_size_in_regs;
3263 #ifdef REG_PARM_STACK_SPACE
3264 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
3266 /* If we have found a stack parm before we reach the end of the
3267 area reserved for registers, skip that area. */
3270 if (reg_parm_stack_space > 0)
3272 if (initial_offset_ptr->var)
3274 initial_offset_ptr->var
3275 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
3276 ssize_int (reg_parm_stack_space));
3277 initial_offset_ptr->constant = 0;
3279 else if (initial_offset_ptr->constant < reg_parm_stack_space)
3280 initial_offset_ptr->constant = reg_parm_stack_space;
3283 #endif /* REG_PARM_STACK_SPACE */
3285 part_size_in_regs = (reg_parm_stack_space == 0 ? partial : 0);
3288 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
3289 where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
3290 boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
3291 locate->where_pad = where_pad;
3292 locate->boundary = boundary;
3294 #ifdef ARGS_GROW_DOWNWARD
3295 locate->slot_offset.constant = -initial_offset_ptr->constant;
3296 if (initial_offset_ptr->var)
3297 locate->slot_offset.var = size_binop (MINUS_EXPR, ssize_int (0),
3298 initial_offset_ptr->var);
3302 if (where_pad != none
3303 && (!host_integerp (sizetree, 1)
3304 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
3305 s2 = round_up (s2, PARM_BOUNDARY / BITS_PER_UNIT);
3306 SUB_PARM_SIZE (locate->slot_offset, s2);
3309 locate->slot_offset.constant += part_size_in_regs;
3312 #ifdef REG_PARM_STACK_SPACE
3313 || REG_PARM_STACK_SPACE (fndecl) > 0
3316 pad_to_arg_alignment (&locate->slot_offset, boundary,
3317 &locate->alignment_pad);
3319 locate->size.constant = (-initial_offset_ptr->constant
3320 - locate->slot_offset.constant);
3321 if (initial_offset_ptr->var)
3322 locate->size.var = size_binop (MINUS_EXPR,
3323 size_binop (MINUS_EXPR,
3325 initial_offset_ptr->var),
3326 locate->slot_offset.var);
3328 /* Pad_below needs the pre-rounded size to know how much to pad
3330 locate->offset = locate->slot_offset;
3331 if (where_pad == downward)
3332 pad_below (&locate->offset, passed_mode, sizetree);
3334 #else /* !ARGS_GROW_DOWNWARD */
3336 #ifdef REG_PARM_STACK_SPACE
3337 || REG_PARM_STACK_SPACE (fndecl) > 0
3340 pad_to_arg_alignment (initial_offset_ptr, boundary,
3341 &locate->alignment_pad);
3342 locate->slot_offset = *initial_offset_ptr;
3344 #ifdef PUSH_ROUNDING
3345 if (passed_mode != BLKmode)
3346 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
3349 /* Pad_below needs the pre-rounded size to know how much to pad below
3350 so this must be done before rounding up. */
3351 locate->offset = locate->slot_offset;
3352 if (where_pad == downward)
3353 pad_below (&locate->offset, passed_mode, sizetree);
3355 if (where_pad != none
3356 && (!host_integerp (sizetree, 1)
3357 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
3358 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
3360 ADD_PARM_SIZE (locate->size, sizetree);
3362 locate->size.constant -= part_size_in_regs;
3363 #endif /* ARGS_GROW_DOWNWARD */
3366 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
3367 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
3370 pad_to_arg_alignment (struct args_size *offset_ptr, int boundary,
3371 struct args_size *alignment_pad)
3373 tree save_var = NULL_TREE;
3374 HOST_WIDE_INT save_constant = 0;
3375 int boundary_in_bytes = boundary / BITS_PER_UNIT;
3376 HOST_WIDE_INT sp_offset = STACK_POINTER_OFFSET;
3378 #ifdef SPARC_STACK_BOUNDARY_HACK
3379 /* The sparc port has a bug. It sometimes claims a STACK_BOUNDARY
3380 higher than the real alignment of %sp. However, when it does this,
3381 the alignment of %sp+STACK_POINTER_OFFSET will be STACK_BOUNDARY.
3382 This is a temporary hack while the sparc port is fixed. */
3383 if (SPARC_STACK_BOUNDARY_HACK)
3387 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3389 save_var = offset_ptr->var;
3390 save_constant = offset_ptr->constant;
3393 alignment_pad->var = NULL_TREE;
3394 alignment_pad->constant = 0;
3396 if (boundary > BITS_PER_UNIT)
3398 if (offset_ptr->var)
3400 tree sp_offset_tree = ssize_int (sp_offset);
3401 tree offset = size_binop (PLUS_EXPR,
3402 ARGS_SIZE_TREE (*offset_ptr),
3404 #ifdef ARGS_GROW_DOWNWARD
3405 tree rounded = round_down (offset, boundary / BITS_PER_UNIT);
3407 tree rounded = round_up (offset, boundary / BITS_PER_UNIT);
3410 offset_ptr->var = size_binop (MINUS_EXPR, rounded, sp_offset_tree);
3411 /* ARGS_SIZE_TREE includes constant term. */
3412 offset_ptr->constant = 0;
3413 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3414 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
3419 offset_ptr->constant = -sp_offset +
3420 #ifdef ARGS_GROW_DOWNWARD
3421 FLOOR_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
3423 CEIL_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
3425 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3426 alignment_pad->constant = offset_ptr->constant - save_constant;
3432 pad_below (struct args_size *offset_ptr, enum machine_mode passed_mode, tree sizetree)
3434 if (passed_mode != BLKmode)
3436 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
3437 offset_ptr->constant
3438 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
3439 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
3440 - GET_MODE_SIZE (passed_mode));
3444 if (TREE_CODE (sizetree) != INTEGER_CST
3445 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
3447 /* Round the size up to multiple of PARM_BOUNDARY bits. */
3448 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
3450 ADD_PARM_SIZE (*offset_ptr, s2);
3451 SUB_PARM_SIZE (*offset_ptr, sizetree);
3456 /* Walk the tree of blocks describing the binding levels within a function
3457 and warn about variables the might be killed by setjmp or vfork.
3458 This is done after calling flow_analysis and before global_alloc
3459 clobbers the pseudo-regs to hard regs. */
3462 setjmp_vars_warning (tree block)
3466 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
3468 if (TREE_CODE (decl) == VAR_DECL
3469 && DECL_RTL_SET_P (decl)
3470 && REG_P (DECL_RTL (decl))
3471 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
3472 warning (0, "variable %q+D might be clobbered by %<longjmp%>"
3477 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
3478 setjmp_vars_warning (sub);
3481 /* Do the appropriate part of setjmp_vars_warning
3482 but for arguments instead of local variables. */
3485 setjmp_args_warning (void)
3488 for (decl = DECL_ARGUMENTS (current_function_decl);
3489 decl; decl = TREE_CHAIN (decl))
3490 if (DECL_RTL (decl) != 0
3491 && REG_P (DECL_RTL (decl))
3492 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
3493 warning (0, "argument %q+D might be clobbered by %<longjmp%> or %<vfork%>",
3498 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
3499 and create duplicate blocks. */
3500 /* ??? Need an option to either create block fragments or to create
3501 abstract origin duplicates of a source block. It really depends
3502 on what optimization has been performed. */
3505 reorder_blocks (void)
3507 tree block = DECL_INITIAL (current_function_decl);
3508 VEC(tree,heap) *block_stack;
3510 if (block == NULL_TREE)
3513 block_stack = VEC_alloc (tree, heap, 10);
3515 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
3516 clear_block_marks (block);
3518 /* Prune the old trees away, so that they don't get in the way. */
3519 BLOCK_SUBBLOCKS (block) = NULL_TREE;
3520 BLOCK_CHAIN (block) = NULL_TREE;
3522 /* Recreate the block tree from the note nesting. */
3523 reorder_blocks_1 (get_insns (), block, &block_stack);
3524 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
3526 /* Remove deleted blocks from the block fragment chains. */
3527 reorder_fix_fragments (block);
3529 VEC_free (tree, heap, block_stack);
3532 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
3535 clear_block_marks (tree block)
3539 TREE_ASM_WRITTEN (block) = 0;
3540 clear_block_marks (BLOCK_SUBBLOCKS (block));
3541 block = BLOCK_CHAIN (block);
3546 reorder_blocks_1 (rtx insns, tree current_block, VEC(tree,heap) **p_block_stack)
3550 for (insn = insns; insn; insn = NEXT_INSN (insn))
3554 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
3556 tree block = NOTE_BLOCK (insn);
3558 /* If we have seen this block before, that means it now
3559 spans multiple address regions. Create a new fragment. */
3560 if (TREE_ASM_WRITTEN (block))
3562 tree new_block = copy_node (block);
3565 origin = (BLOCK_FRAGMENT_ORIGIN (block)
3566 ? BLOCK_FRAGMENT_ORIGIN (block)
3568 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
3569 BLOCK_FRAGMENT_CHAIN (new_block)
3570 = BLOCK_FRAGMENT_CHAIN (origin);
3571 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
3573 NOTE_BLOCK (insn) = new_block;
3577 BLOCK_SUBBLOCKS (block) = 0;
3578 TREE_ASM_WRITTEN (block) = 1;
3579 /* When there's only one block for the entire function,
3580 current_block == block and we mustn't do this, it
3581 will cause infinite recursion. */
3582 if (block != current_block)
3584 BLOCK_SUPERCONTEXT (block) = current_block;
3585 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
3586 BLOCK_SUBBLOCKS (current_block) = block;
3587 current_block = block;
3589 VEC_safe_push (tree, heap, *p_block_stack, block);
3591 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
3593 NOTE_BLOCK (insn) = VEC_pop (tree, *p_block_stack);
3594 BLOCK_SUBBLOCKS (current_block)
3595 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
3596 current_block = BLOCK_SUPERCONTEXT (current_block);
3602 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
3603 appears in the block tree, select one of the fragments to become
3604 the new origin block. */
3607 reorder_fix_fragments (tree block)
3611 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
3612 tree new_origin = NULL_TREE;
3616 if (! TREE_ASM_WRITTEN (dup_origin))
3618 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
3620 /* Find the first of the remaining fragments. There must
3621 be at least one -- the current block. */
3622 while (! TREE_ASM_WRITTEN (new_origin))
3623 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
3624 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
3627 else if (! dup_origin)
3630 /* Re-root the rest of the fragments to the new origin. In the
3631 case that DUP_ORIGIN was null, that means BLOCK was the origin
3632 of a chain of fragments and we want to remove those fragments
3633 that didn't make it to the output. */
3636 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
3641 if (TREE_ASM_WRITTEN (chain))
3643 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
3645 pp = &BLOCK_FRAGMENT_CHAIN (chain);
3647 chain = BLOCK_FRAGMENT_CHAIN (chain);
3652 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
3653 block = BLOCK_CHAIN (block);
3657 /* Reverse the order of elements in the chain T of blocks,
3658 and return the new head of the chain (old last element). */
3661 blocks_nreverse (tree t)
3663 tree prev = 0, decl, next;
3664 for (decl = t; decl; decl = next)
3666 next = BLOCK_CHAIN (decl);
3667 BLOCK_CHAIN (decl) = prev;
3673 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
3674 non-NULL, list them all into VECTOR, in a depth-first preorder
3675 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
3679 all_blocks (tree block, tree *vector)
3685 TREE_ASM_WRITTEN (block) = 0;
3687 /* Record this block. */
3689 vector[n_blocks] = block;
3693 /* Record the subblocks, and their subblocks... */
3694 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
3695 vector ? vector + n_blocks : 0);
3696 block = BLOCK_CHAIN (block);
3702 /* Return a vector containing all the blocks rooted at BLOCK. The
3703 number of elements in the vector is stored in N_BLOCKS_P. The
3704 vector is dynamically allocated; it is the caller's responsibility
3705 to call `free' on the pointer returned. */
3708 get_block_vector (tree block, int *n_blocks_p)
3712 *n_blocks_p = all_blocks (block, NULL);
3713 block_vector = xmalloc (*n_blocks_p * sizeof (tree));
3714 all_blocks (block, block_vector);
3716 return block_vector;
3719 static GTY(()) int next_block_index = 2;
3721 /* Set BLOCK_NUMBER for all the blocks in FN. */
3724 number_blocks (tree fn)
3730 /* For SDB and XCOFF debugging output, we start numbering the blocks
3731 from 1 within each function, rather than keeping a running
3733 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
3734 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
3735 next_block_index = 1;
3738 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
3740 /* The top-level BLOCK isn't numbered at all. */
3741 for (i = 1; i < n_blocks; ++i)
3742 /* We number the blocks from two. */
3743 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
3745 free (block_vector);
3750 /* If VAR is present in a subblock of BLOCK, return the subblock. */
3753 debug_find_var_in_block_tree (tree var, tree block)
3757 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
3761 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
3763 tree ret = debug_find_var_in_block_tree (var, t);
3771 /* Allocate a function structure for FNDECL and set its contents
3775 allocate_struct_function (tree fndecl)
3778 tree fntype = fndecl ? TREE_TYPE (fndecl) : NULL_TREE;
3780 cfun = ggc_alloc_cleared (sizeof (struct function));
3782 cfun->stack_alignment_needed = STACK_BOUNDARY;
3783 cfun->preferred_stack_boundary = STACK_BOUNDARY;
3785 current_function_funcdef_no = funcdef_no++;
3787 cfun->function_frequency = FUNCTION_FREQUENCY_NORMAL;
3789 init_eh_for_function ();
3791 lang_hooks.function.init (cfun);
3792 if (init_machine_status)
3793 cfun->machine = (*init_machine_status) ();
3798 DECL_STRUCT_FUNCTION (fndecl) = cfun;
3799 cfun->decl = fndecl;
3801 result = DECL_RESULT (fndecl);
3802 if (aggregate_value_p (result, fndecl))
3804 #ifdef PCC_STATIC_STRUCT_RETURN
3805 current_function_returns_pcc_struct = 1;
3807 current_function_returns_struct = 1;
3810 current_function_returns_pointer = POINTER_TYPE_P (TREE_TYPE (result));
3812 current_function_stdarg
3814 && TYPE_ARG_TYPES (fntype) != 0
3815 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
3816 != void_type_node));
3818 /* Assume all registers in stdarg functions need to be saved. */
3819 cfun->va_list_gpr_size = VA_LIST_MAX_GPR_SIZE;
3820 cfun->va_list_fpr_size = VA_LIST_MAX_FPR_SIZE;
3823 /* Reset cfun, and other non-struct-function variables to defaults as
3824 appropriate for emitting rtl at the start of a function. */
3827 prepare_function_start (tree fndecl)
3829 if (fndecl && DECL_STRUCT_FUNCTION (fndecl))
3830 cfun = DECL_STRUCT_FUNCTION (fndecl);
3832 allocate_struct_function (fndecl);
3834 init_varasm_status (cfun);
3837 cse_not_expected = ! optimize;
3839 /* Caller save not needed yet. */
3840 caller_save_needed = 0;
3842 /* We haven't done register allocation yet. */
3845 /* Indicate that we have not instantiated virtual registers yet. */
3846 virtuals_instantiated = 0;
3848 /* Indicate that we want CONCATs now. */
3849 generating_concat_p = 1;
3851 /* Indicate we have no need of a frame pointer yet. */
3852 frame_pointer_needed = 0;
3855 /* Initialize the rtl expansion mechanism so that we can do simple things
3856 like generate sequences. This is used to provide a context during global
3857 initialization of some passes. */
3859 init_dummy_function_start (void)
3861 prepare_function_start (NULL);
3864 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
3865 and initialize static variables for generating RTL for the statements
3869 init_function_start (tree subr)
3871 prepare_function_start (subr);
3873 /* Prevent ever trying to delete the first instruction of a
3874 function. Also tell final how to output a linenum before the
3875 function prologue. Note linenums could be missing, e.g. when
3876 compiling a Java .class file. */
3877 if (! DECL_IS_BUILTIN (subr))
3878 emit_line_note (DECL_SOURCE_LOCATION (subr));
3880 /* Make sure first insn is a note even if we don't want linenums.
3881 This makes sure the first insn will never be deleted.
3882 Also, final expects a note to appear there. */
3883 emit_note (NOTE_INSN_DELETED);
3885 /* Warn if this value is an aggregate type,
3886 regardless of which calling convention we are using for it. */
3887 if (AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
3888 warning (OPT_Waggregate_return, "function returns an aggregate");
3891 /* Make sure all values used by the optimization passes have sane
3894 init_function_for_compilation (void)
3898 /* No prologue/epilogue insns yet. Make sure that these vectors are
3900 gcc_assert (VEC_length (int, prologue) == 0);
3901 gcc_assert (VEC_length (int, epilogue) == 0);
3902 gcc_assert (VEC_length (int, sibcall_epilogue) == 0);
3905 struct tree_opt_pass pass_init_function =
3909 init_function_for_compilation, /* execute */
3912 0, /* static_pass_number */
3914 0, /* properties_required */
3915 0, /* properties_provided */
3916 0, /* properties_destroyed */
3917 0, /* todo_flags_start */
3918 0, /* todo_flags_finish */
3924 expand_main_function (void)
3926 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
3927 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
3929 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
3933 /* Forcibly align the stack. */
3934 #ifdef STACK_GROWS_DOWNWARD
3935 tmp = expand_simple_binop (Pmode, AND, stack_pointer_rtx, GEN_INT(-align),
3936 stack_pointer_rtx, 1, OPTAB_WIDEN);
3938 tmp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
3939 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
3940 tmp = expand_simple_binop (Pmode, AND, tmp, GEN_INT (-align),
3941 stack_pointer_rtx, 1, OPTAB_WIDEN);
3943 if (tmp != stack_pointer_rtx)
3944 emit_move_insn (stack_pointer_rtx, tmp);
3946 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
3947 tmp = force_reg (Pmode, const0_rtx);
3948 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
3952 for (tmp = get_last_insn (); tmp; tmp = PREV_INSN (tmp))
3953 if (NOTE_P (tmp) && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_FUNCTION_BEG)
3956 emit_insn_before (seq, tmp);
3962 #if (defined(INVOKE__main) \
3963 || (!defined(HAS_INIT_SECTION) \
3964 && !defined(INIT_SECTION_ASM_OP) \
3965 && !defined(INIT_ARRAY_SECTION_ASM_OP)))
3966 emit_library_call (init_one_libfunc (NAME__MAIN), LCT_NORMAL, VOIDmode, 0);
3970 /* Expand code to initialize the stack_protect_guard. This is invoked at
3971 the beginning of a function to be protected. */
3973 #ifndef HAVE_stack_protect_set
3974 # define HAVE_stack_protect_set 0
3975 # define gen_stack_protect_set(x,y) (gcc_unreachable (), NULL_RTX)
3979 stack_protect_prologue (void)
3981 tree guard_decl = targetm.stack_protect_guard ();
3984 /* Avoid expand_expr here, because we don't want guard_decl pulled
3985 into registers unless absolutely necessary. And we know that
3986 cfun->stack_protect_guard is a local stack slot, so this skips
3988 x = validize_mem (DECL_RTL (cfun->stack_protect_guard));
3989 y = validize_mem (DECL_RTL (guard_decl));
3991 /* Allow the target to copy from Y to X without leaking Y into a
3993 if (HAVE_stack_protect_set)
3995 rtx insn = gen_stack_protect_set (x, y);
4003 /* Otherwise do a straight move. */
4004 emit_move_insn (x, y);
4007 /* Expand code to verify the stack_protect_guard. This is invoked at
4008 the end of a function to be protected. */
4010 #ifndef HAVE_stack_protect_test
4011 # define HAVE_stack_protect_test 0
4012 # define gen_stack_protect_test(x, y, z) (gcc_unreachable (), NULL_RTX)
4016 stack_protect_epilogue (void)
4018 tree guard_decl = targetm.stack_protect_guard ();
4019 rtx label = gen_label_rtx ();
4022 /* Avoid expand_expr here, because we don't want guard_decl pulled
4023 into registers unless absolutely necessary. And we know that
4024 cfun->stack_protect_guard is a local stack slot, so this skips
4026 x = validize_mem (DECL_RTL (cfun->stack_protect_guard));
4027 y = validize_mem (DECL_RTL (guard_decl));
4029 /* Allow the target to compare Y with X without leaking either into
4031 switch (HAVE_stack_protect_test != 0)
4034 tmp = gen_stack_protect_test (x, y, label);
4043 emit_cmp_and_jump_insns (x, y, EQ, NULL_RTX, ptr_mode, 1, label);
4047 /* The noreturn predictor has been moved to the tree level. The rtl-level
4048 predictors estimate this branch about 20%, which isn't enough to get
4049 things moved out of line. Since this is the only extant case of adding
4050 a noreturn function at the rtl level, it doesn't seem worth doing ought
4051 except adding the prediction by hand. */
4052 tmp = get_last_insn ();
4054 predict_insn_def (tmp, PRED_NORETURN, TAKEN);
4056 expand_expr_stmt (targetm.stack_protect_fail ());
4060 /* Start the RTL for a new function, and set variables used for
4062 SUBR is the FUNCTION_DECL node.
4063 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
4064 the function's parameters, which must be run at any return statement. */
4067 expand_function_start (tree subr)
4069 /* Make sure volatile mem refs aren't considered
4070 valid operands of arithmetic insns. */
4071 init_recog_no_volatile ();
4073 current_function_profile
4075 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
4077 current_function_limit_stack
4078 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
4080 /* Make the label for return statements to jump to. Do not special
4081 case machines with special return instructions -- they will be
4082 handled later during jump, ifcvt, or epilogue creation. */
4083 return_label = gen_label_rtx ();
4085 /* Initialize rtx used to return the value. */
4086 /* Do this before assign_parms so that we copy the struct value address
4087 before any library calls that assign parms might generate. */
4089 /* Decide whether to return the value in memory or in a register. */
4090 if (aggregate_value_p (DECL_RESULT (subr), subr))
4092 /* Returning something that won't go in a register. */
4093 rtx value_address = 0;
4095 #ifdef PCC_STATIC_STRUCT_RETURN
4096 if (current_function_returns_pcc_struct)
4098 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
4099 value_address = assemble_static_space (size);
4104 rtx sv = targetm.calls.struct_value_rtx (TREE_TYPE (subr), 1);
4105 /* Expect to be passed the address of a place to store the value.
4106 If it is passed as an argument, assign_parms will take care of
4110 value_address = gen_reg_rtx (Pmode);
4111 emit_move_insn (value_address, sv);
4116 rtx x = value_address;
4117 if (!DECL_BY_REFERENCE (DECL_RESULT (subr)))
4119 x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), x);
4120 set_mem_attributes (x, DECL_RESULT (subr), 1);
4122 SET_DECL_RTL (DECL_RESULT (subr), x);
4125 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
4126 /* If return mode is void, this decl rtl should not be used. */
4127 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
4130 /* Compute the return values into a pseudo reg, which we will copy
4131 into the true return register after the cleanups are done. */
4132 tree return_type = TREE_TYPE (DECL_RESULT (subr));
4133 if (TYPE_MODE (return_type) != BLKmode
4134 && targetm.calls.return_in_msb (return_type))
4135 /* expand_function_end will insert the appropriate padding in
4136 this case. Use the return value's natural (unpadded) mode
4137 within the function proper. */
4138 SET_DECL_RTL (DECL_RESULT (subr),
4139 gen_reg_rtx (TYPE_MODE (return_type)));
4142 /* In order to figure out what mode to use for the pseudo, we
4143 figure out what the mode of the eventual return register will
4144 actually be, and use that. */
4145 rtx hard_reg = hard_function_value (return_type, subr, 1);
4147 /* Structures that are returned in registers are not
4148 aggregate_value_p, so we may see a PARALLEL or a REG. */
4149 if (REG_P (hard_reg))
4150 SET_DECL_RTL (DECL_RESULT (subr),
4151 gen_reg_rtx (GET_MODE (hard_reg)));
4154 gcc_assert (GET_CODE (hard_reg) == PARALLEL);
4155 SET_DECL_RTL (DECL_RESULT (subr), gen_group_rtx (hard_reg));
4159 /* Set DECL_REGISTER flag so that expand_function_end will copy the
4160 result to the real return register(s). */
4161 DECL_REGISTER (DECL_RESULT (subr)) = 1;
4164 /* Initialize rtx for parameters and local variables.
4165 In some cases this requires emitting insns. */
4166 assign_parms (subr);
4168 /* If function gets a static chain arg, store it. */
4169 if (cfun->static_chain_decl)
4171 tree parm = cfun->static_chain_decl;
4172 rtx local = gen_reg_rtx (Pmode);
4174 set_decl_incoming_rtl (parm, static_chain_incoming_rtx);
4175 SET_DECL_RTL (parm, local);
4176 mark_reg_pointer (local, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
4178 emit_move_insn (local, static_chain_incoming_rtx);
4181 /* If the function receives a non-local goto, then store the
4182 bits we need to restore the frame pointer. */
4183 if (cfun->nonlocal_goto_save_area)
4188 /* ??? We need to do this save early. Unfortunately here is
4189 before the frame variable gets declared. Help out... */
4190 expand_var (TREE_OPERAND (cfun->nonlocal_goto_save_area, 0));
4192 t_save = build4 (ARRAY_REF, ptr_type_node,
4193 cfun->nonlocal_goto_save_area,
4194 integer_zero_node, NULL_TREE, NULL_TREE);
4195 r_save = expand_expr (t_save, NULL_RTX, VOIDmode, EXPAND_WRITE);
4196 r_save = convert_memory_address (Pmode, r_save);
4198 emit_move_insn (r_save, virtual_stack_vars_rtx);
4199 update_nonlocal_goto_save_area ();
4202 /* The following was moved from init_function_start.
4203 The move is supposed to make sdb output more accurate. */
4204 /* Indicate the beginning of the function body,
4205 as opposed to parm setup. */
4206 emit_note (NOTE_INSN_FUNCTION_BEG);
4208 if (!NOTE_P (get_last_insn ()))
4209 emit_note (NOTE_INSN_DELETED);
4210 parm_birth_insn = get_last_insn ();
4212 if (current_function_profile)
4215 PROFILE_HOOK (current_function_funcdef_no);
4219 /* After the display initializations is where the tail-recursion label
4220 should go, if we end up needing one. Ensure we have a NOTE here
4221 since some things (like trampolines) get placed before this. */
4222 tail_recursion_reentry = emit_note (NOTE_INSN_DELETED);
4224 /* Make sure there is a line number after the function entry setup code. */
4225 force_next_line_note ();
4228 /* Undo the effects of init_dummy_function_start. */
4230 expand_dummy_function_end (void)
4232 /* End any sequences that failed to be closed due to syntax errors. */
4233 while (in_sequence_p ())
4236 /* Outside function body, can't compute type's actual size
4237 until next function's body starts. */
4239 free_after_parsing (cfun);
4240 free_after_compilation (cfun);
4244 /* Call DOIT for each hard register used as a return value from
4245 the current function. */
4248 diddle_return_value (void (*doit) (rtx, void *), void *arg)
4250 rtx outgoing = current_function_return_rtx;
4255 if (REG_P (outgoing))
4256 (*doit) (outgoing, arg);
4257 else if (GET_CODE (outgoing) == PARALLEL)
4261 for (i = 0; i < XVECLEN (outgoing, 0); i++)
4263 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
4265 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
4272 do_clobber_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
4274 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
4278 clobber_return_register (void)
4280 diddle_return_value (do_clobber_return_reg, NULL);
4282 /* In case we do use pseudo to return value, clobber it too. */
4283 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
4285 tree decl_result = DECL_RESULT (current_function_decl);
4286 rtx decl_rtl = DECL_RTL (decl_result);
4287 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
4289 do_clobber_return_reg (decl_rtl, NULL);
4295 do_use_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
4297 emit_insn (gen_rtx_USE (VOIDmode, reg));
4301 use_return_register (void)
4303 diddle_return_value (do_use_return_reg, NULL);
4306 /* Possibly warn about unused parameters. */
4308 do_warn_unused_parameter (tree fn)
4312 for (decl = DECL_ARGUMENTS (fn);
4313 decl; decl = TREE_CHAIN (decl))
4314 if (!TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
4315 && DECL_NAME (decl) && !DECL_ARTIFICIAL (decl))
4316 warning (0, "unused parameter %q+D", decl);
4319 static GTY(()) rtx initial_trampoline;
4321 /* Generate RTL for the end of the current function. */
4324 expand_function_end (void)
4328 /* If arg_pointer_save_area was referenced only from a nested
4329 function, we will not have initialized it yet. Do that now. */
4330 if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
4331 get_arg_pointer_save_area (cfun);
4333 /* If we are doing stack checking and this function makes calls,
4334 do a stack probe at the start of the function to ensure we have enough
4335 space for another stack frame. */
4336 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
4340 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4344 probe_stack_range (STACK_CHECK_PROTECT,
4345 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
4348 emit_insn_before (seq, tail_recursion_reentry);
4353 /* Possibly warn about unused parameters.
4354 When frontend does unit-at-a-time, the warning is already
4355 issued at finalization time. */
4356 if (warn_unused_parameter
4357 && !lang_hooks.callgraph.expand_function)
4358 do_warn_unused_parameter (current_function_decl);
4360 /* End any sequences that failed to be closed due to syntax errors. */
4361 while (in_sequence_p ())
4364 clear_pending_stack_adjust ();
4365 do_pending_stack_adjust ();
4367 /* @@@ This is a kludge. We want to ensure that instructions that
4368 may trap are not moved into the epilogue by scheduling, because
4369 we don't always emit unwind information for the epilogue.
4370 However, not all machine descriptions define a blockage insn, so
4371 emit an ASM_INPUT to act as one. */
4372 if (flag_non_call_exceptions)
4373 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, ""));
4375 /* Mark the end of the function body.
4376 If control reaches this insn, the function can drop through
4377 without returning a value. */
4378 emit_note (NOTE_INSN_FUNCTION_END);
4380 /* Must mark the last line number note in the function, so that the test
4381 coverage code can avoid counting the last line twice. This just tells
4382 the code to ignore the immediately following line note, since there
4383 already exists a copy of this note somewhere above. This line number
4384 note is still needed for debugging though, so we can't delete it. */
4385 if (flag_test_coverage)
4386 emit_note (NOTE_INSN_REPEATED_LINE_NUMBER);
4388 /* Output a linenumber for the end of the function.
4389 SDB depends on this. */
4390 force_next_line_note ();
4391 emit_line_note (input_location);
4393 /* Before the return label (if any), clobber the return
4394 registers so that they are not propagated live to the rest of
4395 the function. This can only happen with functions that drop
4396 through; if there had been a return statement, there would
4397 have either been a return rtx, or a jump to the return label.
4399 We delay actual code generation after the current_function_value_rtx
4401 clobber_after = get_last_insn ();
4403 /* Output the label for the actual return from the function. */
4404 emit_label (return_label);
4406 /* If scalar return value was computed in a pseudo-reg, or was a named
4407 return value that got dumped to the stack, copy that to the hard
4409 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
4411 tree decl_result = DECL_RESULT (current_function_decl);
4412 rtx decl_rtl = DECL_RTL (decl_result);
4414 if (REG_P (decl_rtl)
4415 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
4416 : DECL_REGISTER (decl_result))
4418 rtx real_decl_rtl = current_function_return_rtx;
4420 /* This should be set in assign_parms. */
4421 gcc_assert (REG_FUNCTION_VALUE_P (real_decl_rtl));
4423 /* If this is a BLKmode structure being returned in registers,
4424 then use the mode computed in expand_return. Note that if
4425 decl_rtl is memory, then its mode may have been changed,
4426 but that current_function_return_rtx has not. */
4427 if (GET_MODE (real_decl_rtl) == BLKmode)
4428 PUT_MODE (real_decl_rtl, GET_MODE (decl_rtl));
4430 /* If a non-BLKmode return value should be padded at the least
4431 significant end of the register, shift it left by the appropriate
4432 amount. BLKmode results are handled using the group load/store
4434 if (TYPE_MODE (TREE_TYPE (decl_result)) != BLKmode
4435 && targetm.calls.return_in_msb (TREE_TYPE (decl_result)))
4437 emit_move_insn (gen_rtx_REG (GET_MODE (decl_rtl),
4438 REGNO (real_decl_rtl)),
4440 shift_return_value (GET_MODE (decl_rtl), true, real_decl_rtl);
4442 /* If a named return value dumped decl_return to memory, then
4443 we may need to re-do the PROMOTE_MODE signed/unsigned
4445 else if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
4447 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (decl_result));
4449 if (targetm.calls.promote_function_return (TREE_TYPE (current_function_decl)))
4450 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
4453 convert_move (real_decl_rtl, decl_rtl, unsignedp);
4455 else if (GET_CODE (real_decl_rtl) == PARALLEL)
4457 /* If expand_function_start has created a PARALLEL for decl_rtl,
4458 move the result to the real return registers. Otherwise, do
4459 a group load from decl_rtl for a named return. */
4460 if (GET_CODE (decl_rtl) == PARALLEL)
4461 emit_group_move (real_decl_rtl, decl_rtl);
4463 emit_group_load (real_decl_rtl, decl_rtl,
4464 TREE_TYPE (decl_result),
4465 int_size_in_bytes (TREE_TYPE (decl_result)));
4468 emit_move_insn (real_decl_rtl, decl_rtl);
4472 /* If returning a structure, arrange to return the address of the value
4473 in a place where debuggers expect to find it.
4475 If returning a structure PCC style,
4476 the caller also depends on this value.
4477 And current_function_returns_pcc_struct is not necessarily set. */
4478 if (current_function_returns_struct
4479 || current_function_returns_pcc_struct)
4481 rtx value_address = DECL_RTL (DECL_RESULT (current_function_decl));
4482 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
4485 if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)))
4486 type = TREE_TYPE (type);
4488 value_address = XEXP (value_address, 0);
4490 #ifdef FUNCTION_OUTGOING_VALUE
4491 outgoing = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
4492 current_function_decl);
4494 outgoing = FUNCTION_VALUE (build_pointer_type (type),
4495 current_function_decl);
4498 /* Mark this as a function return value so integrate will delete the
4499 assignment and USE below when inlining this function. */
4500 REG_FUNCTION_VALUE_P (outgoing) = 1;
4502 /* The address may be ptr_mode and OUTGOING may be Pmode. */
4503 value_address = convert_memory_address (GET_MODE (outgoing),
4506 emit_move_insn (outgoing, value_address);
4508 /* Show return register used to hold result (in this case the address
4510 current_function_return_rtx = outgoing;
4513 /* If this is an implementation of throw, do what's necessary to
4514 communicate between __builtin_eh_return and the epilogue. */
4515 expand_eh_return ();
4517 /* Emit the actual code to clobber return register. */
4522 clobber_return_register ();
4523 expand_naked_return ();
4527 emit_insn_after (seq, clobber_after);
4530 /* Output the label for the naked return from the function. */
4531 emit_label (naked_return_label);
4533 /* Let except.c know where it should emit the call to unregister
4534 the function context for sjlj exceptions. */
4535 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
4536 sjlj_emit_function_exit_after (get_last_insn ());
4538 /* If stack protection is enabled for this function, check the guard. */
4539 if (cfun->stack_protect_guard)
4540 stack_protect_epilogue ();
4542 /* If we had calls to alloca, and this machine needs
4543 an accurate stack pointer to exit the function,
4544 insert some code to save and restore the stack pointer. */
4545 if (! EXIT_IGNORE_STACK
4546 && current_function_calls_alloca)
4550 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
4551 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
4554 /* ??? This should no longer be necessary since stupid is no longer with
4555 us, but there are some parts of the compiler (eg reload_combine, and
4556 sh mach_dep_reorg) that still try and compute their own lifetime info
4557 instead of using the general framework. */
4558 use_return_register ();
4562 get_arg_pointer_save_area (struct function *f)
4564 rtx ret = f->x_arg_pointer_save_area;
4568 ret = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, f);
4569 f->x_arg_pointer_save_area = ret;
4572 if (f == cfun && ! f->arg_pointer_save_area_init)
4576 /* Save the arg pointer at the beginning of the function. The
4577 generated stack slot may not be a valid memory address, so we
4578 have to check it and fix it if necessary. */
4580 emit_move_insn (validize_mem (ret), virtual_incoming_args_rtx);
4584 push_topmost_sequence ();
4585 emit_insn_after (seq, entry_of_function ());
4586 pop_topmost_sequence ();
4592 /* Extend a vector that records the INSN_UIDs of INSNS
4593 (a list of one or more insns). */
4596 record_insns (rtx insns, VEC(int,heap) **vecp)
4600 for (tmp = insns; tmp != NULL_RTX; tmp = NEXT_INSN (tmp))
4601 VEC_safe_push (int, heap, *vecp, INSN_UID (tmp));
4604 /* Set the locator of the insn chain starting at INSN to LOC. */
4606 set_insn_locators (rtx insn, int loc)
4608 while (insn != NULL_RTX)
4611 INSN_LOCATOR (insn) = loc;
4612 insn = NEXT_INSN (insn);
4616 /* Determine how many INSN_UIDs in VEC are part of INSN. Because we can
4617 be running after reorg, SEQUENCE rtl is possible. */
4620 contains (rtx insn, VEC(int,heap) **vec)
4624 if (NONJUMP_INSN_P (insn)
4625 && GET_CODE (PATTERN (insn)) == SEQUENCE)
4628 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
4629 for (j = VEC_length (int, *vec) - 1; j >= 0; --j)
4630 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i))
4631 == VEC_index (int, *vec, j))
4637 for (j = VEC_length (int, *vec) - 1; j >= 0; --j)
4638 if (INSN_UID (insn) == VEC_index (int, *vec, j))
4645 prologue_epilogue_contains (rtx insn)
4647 if (contains (insn, &prologue))
4649 if (contains (insn, &epilogue))
4655 sibcall_epilogue_contains (rtx insn)
4657 if (sibcall_epilogue)
4658 return contains (insn, &sibcall_epilogue);
4663 /* Insert gen_return at the end of block BB. This also means updating
4664 block_for_insn appropriately. */
4667 emit_return_into_block (basic_block bb, rtx line_note)
4669 emit_jump_insn_after (gen_return (), BB_END (bb));
4671 emit_note_copy_after (line_note, PREV_INSN (BB_END (bb)));
4673 #endif /* HAVE_return */
4675 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
4677 /* These functions convert the epilogue into a variant that does not
4678 modify the stack pointer. This is used in cases where a function
4679 returns an object whose size is not known until it is computed.
4680 The called function leaves the object on the stack, leaves the
4681 stack depressed, and returns a pointer to the object.
4683 What we need to do is track all modifications and references to the
4684 stack pointer, deleting the modifications and changing the
4685 references to point to the location the stack pointer would have
4686 pointed to had the modifications taken place.
4688 These functions need to be portable so we need to make as few
4689 assumptions about the epilogue as we can. However, the epilogue
4690 basically contains three things: instructions to reset the stack
4691 pointer, instructions to reload registers, possibly including the
4692 frame pointer, and an instruction to return to the caller.
4694 We must be sure of what a relevant epilogue insn is doing. We also
4695 make no attempt to validate the insns we make since if they are
4696 invalid, we probably can't do anything valid. The intent is that
4697 these routines get "smarter" as more and more machines start to use
4698 them and they try operating on different epilogues.
4700 We use the following structure to track what the part of the
4701 epilogue that we've already processed has done. We keep two copies
4702 of the SP equivalence, one for use during the insn we are
4703 processing and one for use in the next insn. The difference is
4704 because one part of a PARALLEL may adjust SP and the other may use
4709 rtx sp_equiv_reg; /* REG that SP is set from, perhaps SP. */
4710 HOST_WIDE_INT sp_offset; /* Offset from SP_EQUIV_REG of present SP. */
4711 rtx new_sp_equiv_reg; /* REG to be used at end of insn. */
4712 HOST_WIDE_INT new_sp_offset; /* Offset to be used at end of insn. */
4713 rtx equiv_reg_src; /* If nonzero, the value that SP_EQUIV_REG
4714 should be set to once we no longer need
4716 rtx const_equiv[FIRST_PSEUDO_REGISTER]; /* Any known constant equivalences
4720 static void handle_epilogue_set (rtx, struct epi_info *);
4721 static void update_epilogue_consts (rtx, rtx, void *);
4722 static void emit_equiv_load (struct epi_info *);
4724 /* Modify INSN, a list of one or more insns that is part of the epilogue, to
4725 no modifications to the stack pointer. Return the new list of insns. */
4728 keep_stack_depressed (rtx insns)
4731 struct epi_info info;
4734 /* If the epilogue is just a single instruction, it must be OK as is. */
4735 if (NEXT_INSN (insns) == NULL_RTX)
4738 /* Otherwise, start a sequence, initialize the information we have, and
4739 process all the insns we were given. */
4742 info.sp_equiv_reg = stack_pointer_rtx;
4744 info.equiv_reg_src = 0;
4746 for (j = 0; j < FIRST_PSEUDO_REGISTER; j++)
4747 info.const_equiv[j] = 0;
4751 while (insn != NULL_RTX)
4753 next = NEXT_INSN (insn);
4762 /* If this insn references the register that SP is equivalent to and
4763 we have a pending load to that register, we must force out the load
4764 first and then indicate we no longer know what SP's equivalent is. */
4765 if (info.equiv_reg_src != 0
4766 && reg_referenced_p (info.sp_equiv_reg, PATTERN (insn)))
4768 emit_equiv_load (&info);
4769 info.sp_equiv_reg = 0;
4772 info.new_sp_equiv_reg = info.sp_equiv_reg;
4773 info.new_sp_offset = info.sp_offset;
4775 /* If this is a (RETURN) and the return address is on the stack,
4776 update the address and change to an indirect jump. */
4777 if (GET_CODE (PATTERN (insn)) == RETURN
4778 || (GET_CODE (PATTERN (insn)) == PARALLEL
4779 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
4781 rtx retaddr = INCOMING_RETURN_ADDR_RTX;
4783 HOST_WIDE_INT offset = 0;
4784 rtx jump_insn, jump_set;
4786 /* If the return address is in a register, we can emit the insn
4787 unchanged. Otherwise, it must be a MEM and we see what the
4788 base register and offset are. In any case, we have to emit any
4789 pending load to the equivalent reg of SP, if any. */
4790 if (REG_P (retaddr))
4792 emit_equiv_load (&info);
4800 gcc_assert (MEM_P (retaddr));
4802 ret_ptr = XEXP (retaddr, 0);
4804 if (REG_P (ret_ptr))
4806 base = gen_rtx_REG (Pmode, REGNO (ret_ptr));
4811 gcc_assert (GET_CODE (ret_ptr) == PLUS
4812 && REG_P (XEXP (ret_ptr, 0))
4813 && GET_CODE (XEXP (ret_ptr, 1)) == CONST_INT);
4814 base = gen_rtx_REG (Pmode, REGNO (XEXP (ret_ptr, 0)));
4815 offset = INTVAL (XEXP (ret_ptr, 1));
4819 /* If the base of the location containing the return pointer
4820 is SP, we must update it with the replacement address. Otherwise,
4821 just build the necessary MEM. */
4822 retaddr = plus_constant (base, offset);
4823 if (base == stack_pointer_rtx)
4824 retaddr = simplify_replace_rtx (retaddr, stack_pointer_rtx,
4825 plus_constant (info.sp_equiv_reg,
4828 retaddr = gen_rtx_MEM (Pmode, retaddr);
4830 /* If there is a pending load to the equivalent register for SP
4831 and we reference that register, we must load our address into
4832 a scratch register and then do that load. */
4833 if (info.equiv_reg_src
4834 && reg_overlap_mentioned_p (info.equiv_reg_src, retaddr))
4839 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
4840 if (HARD_REGNO_MODE_OK (regno, Pmode)
4841 && !fixed_regs[regno]
4842 && TEST_HARD_REG_BIT (regs_invalidated_by_call, regno)
4844 (EXIT_BLOCK_PTR->il.rtl->global_live_at_start, regno)
4845 && !refers_to_regno_p (regno,
4846 regno + hard_regno_nregs[regno]
4848 info.equiv_reg_src, NULL)
4849 && info.const_equiv[regno] == 0)
4852 gcc_assert (regno < FIRST_PSEUDO_REGISTER);
4854 reg = gen_rtx_REG (Pmode, regno);
4855 emit_move_insn (reg, retaddr);
4859 emit_equiv_load (&info);
4860 jump_insn = emit_jump_insn (gen_indirect_jump (retaddr));
4862 /* Show the SET in the above insn is a RETURN. */
4863 jump_set = single_set (jump_insn);
4864 gcc_assert (jump_set);
4865 SET_IS_RETURN_P (jump_set) = 1;
4868 /* If SP is not mentioned in the pattern and its equivalent register, if
4869 any, is not modified, just emit it. Otherwise, if neither is set,
4870 replace the reference to SP and emit the insn. If none of those are
4871 true, handle each SET individually. */
4872 else if (!reg_mentioned_p (stack_pointer_rtx, PATTERN (insn))
4873 && (info.sp_equiv_reg == stack_pointer_rtx
4874 || !reg_set_p (info.sp_equiv_reg, insn)))
4876 else if (! reg_set_p (stack_pointer_rtx, insn)
4877 && (info.sp_equiv_reg == stack_pointer_rtx
4878 || !reg_set_p (info.sp_equiv_reg, insn)))
4882 changed = validate_replace_rtx (stack_pointer_rtx,
4883 plus_constant (info.sp_equiv_reg,
4886 gcc_assert (changed);
4890 else if (GET_CODE (PATTERN (insn)) == SET)
4891 handle_epilogue_set (PATTERN (insn), &info);
4892 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
4894 for (j = 0; j < XVECLEN (PATTERN (insn), 0); j++)
4895 if (GET_CODE (XVECEXP (PATTERN (insn), 0, j)) == SET)
4896 handle_epilogue_set (XVECEXP (PATTERN (insn), 0, j), &info);
4901 info.sp_equiv_reg = info.new_sp_equiv_reg;
4902 info.sp_offset = info.new_sp_offset;
4904 /* Now update any constants this insn sets. */
4905 note_stores (PATTERN (insn), update_epilogue_consts, &info);
4909 insns = get_insns ();
4914 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
4915 structure that contains information about what we've seen so far. We
4916 process this SET by either updating that data or by emitting one or
4920 handle_epilogue_set (rtx set, struct epi_info *p)
4922 /* First handle the case where we are setting SP. Record what it is being
4923 set from, which we must be able to determine */
4924 if (reg_set_p (stack_pointer_rtx, set))
4926 gcc_assert (SET_DEST (set) == stack_pointer_rtx);
4928 if (GET_CODE (SET_SRC (set)) == PLUS)
4930 p->new_sp_equiv_reg = XEXP (SET_SRC (set), 0);
4931 if (GET_CODE (XEXP (SET_SRC (set), 1)) == CONST_INT)
4932 p->new_sp_offset = INTVAL (XEXP (SET_SRC (set), 1));
4935 gcc_assert (REG_P (XEXP (SET_SRC (set), 1))
4936 && (REGNO (XEXP (SET_SRC (set), 1))
4937 < FIRST_PSEUDO_REGISTER)
4938 && p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
4940 = INTVAL (p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
4944 p->new_sp_equiv_reg = SET_SRC (set), p->new_sp_offset = 0;
4946 /* If we are adjusting SP, we adjust from the old data. */
4947 if (p->new_sp_equiv_reg == stack_pointer_rtx)
4949 p->new_sp_equiv_reg = p->sp_equiv_reg;
4950 p->new_sp_offset += p->sp_offset;
4953 gcc_assert (p->new_sp_equiv_reg && REG_P (p->new_sp_equiv_reg));
4958 /* Next handle the case where we are setting SP's equivalent
4959 register. We must not already have a value to set it to. We
4960 could update, but there seems little point in handling that case.
4961 Note that we have to allow for the case where we are setting the
4962 register set in the previous part of a PARALLEL inside a single
4963 insn. But use the old offset for any updates within this insn.
4964 We must allow for the case where the register is being set in a
4965 different (usually wider) mode than Pmode). */
4966 else if (p->new_sp_equiv_reg != 0 && reg_set_p (p->new_sp_equiv_reg, set))
4968 gcc_assert (!p->equiv_reg_src
4969 && REG_P (p->new_sp_equiv_reg)
4970 && REG_P (SET_DEST (set))
4971 && (GET_MODE_BITSIZE (GET_MODE (SET_DEST (set)))
4973 && REGNO (p->new_sp_equiv_reg) == REGNO (SET_DEST (set)));
4975 = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
4976 plus_constant (p->sp_equiv_reg,
4980 /* Otherwise, replace any references to SP in the insn to its new value
4981 and emit the insn. */
4984 SET_SRC (set) = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
4985 plus_constant (p->sp_equiv_reg,
4987 SET_DEST (set) = simplify_replace_rtx (SET_DEST (set), stack_pointer_rtx,
4988 plus_constant (p->sp_equiv_reg,
4994 /* Update the tracking information for registers set to constants. */
4997 update_epilogue_consts (rtx dest, rtx x, void *data)
4999 struct epi_info *p = (struct epi_info *) data;
5002 if (!REG_P (dest) || REGNO (dest) >= FIRST_PSEUDO_REGISTER)
5005 /* If we are either clobbering a register or doing a partial set,
5006 show we don't know the value. */
5007 else if (GET_CODE (x) == CLOBBER || ! rtx_equal_p (dest, SET_DEST (x)))
5008 p->const_equiv[REGNO (dest)] = 0;
5010 /* If we are setting it to a constant, record that constant. */
5011 else if (GET_CODE (SET_SRC (x)) == CONST_INT)
5012 p->const_equiv[REGNO (dest)] = SET_SRC (x);
5014 /* If this is a binary operation between a register we have been tracking
5015 and a constant, see if we can compute a new constant value. */
5016 else if (ARITHMETIC_P (SET_SRC (x))
5017 && REG_P (XEXP (SET_SRC (x), 0))
5018 && REGNO (XEXP (SET_SRC (x), 0)) < FIRST_PSEUDO_REGISTER
5019 && p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))] != 0
5020 && GET_CODE (XEXP (SET_SRC (x), 1)) == CONST_INT
5021 && 0 != (new = simplify_binary_operation
5022 (GET_CODE (SET_SRC (x)), GET_MODE (dest),
5023 p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))],
5024 XEXP (SET_SRC (x), 1)))
5025 && GET_CODE (new) == CONST_INT)
5026 p->const_equiv[REGNO (dest)] = new;
5028 /* Otherwise, we can't do anything with this value. */
5030 p->const_equiv[REGNO (dest)] = 0;
5033 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
5036 emit_equiv_load (struct epi_info *p)
5038 if (p->equiv_reg_src != 0)
5040 rtx dest = p->sp_equiv_reg;
5042 if (GET_MODE (p->equiv_reg_src) != GET_MODE (dest))
5043 dest = gen_rtx_REG (GET_MODE (p->equiv_reg_src),
5044 REGNO (p->sp_equiv_reg));
5046 emit_move_insn (dest, p->equiv_reg_src);
5047 p->equiv_reg_src = 0;
5052 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
5053 this into place with notes indicating where the prologue ends and where
5054 the epilogue begins. Update the basic block information when possible. */
5057 thread_prologue_and_epilogue_insns (rtx f ATTRIBUTE_UNUSED)
5061 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
5064 #ifdef HAVE_prologue
5065 rtx prologue_end = NULL_RTX;
5067 #if defined (HAVE_epilogue) || defined(HAVE_return)
5068 rtx epilogue_end = NULL_RTX;
5072 #ifdef HAVE_prologue
5076 seq = gen_prologue ();
5079 /* Retain a map of the prologue insns. */
5080 record_insns (seq, &prologue);
5081 prologue_end = emit_note (NOTE_INSN_PROLOGUE_END);
5085 set_insn_locators (seq, prologue_locator);
5087 /* Can't deal with multiple successors of the entry block
5088 at the moment. Function should always have at least one
5090 gcc_assert (single_succ_p (ENTRY_BLOCK_PTR));
5092 insert_insn_on_edge (seq, single_succ_edge (ENTRY_BLOCK_PTR));
5097 /* If the exit block has no non-fake predecessors, we don't need
5099 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
5100 if ((e->flags & EDGE_FAKE) == 0)
5106 if (optimize && HAVE_return)
5108 /* If we're allowed to generate a simple return instruction,
5109 then by definition we don't need a full epilogue. Examine
5110 the block that falls through to EXIT. If it does not
5111 contain any code, examine its predecessors and try to
5112 emit (conditional) return instructions. */
5117 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
5118 if (e->flags & EDGE_FALLTHRU)
5124 /* Verify that there are no active instructions in the last block. */
5125 label = BB_END (last);
5126 while (label && !LABEL_P (label))
5128 if (active_insn_p (label))
5130 label = PREV_INSN (label);
5133 if (BB_HEAD (last) == label && LABEL_P (label))
5136 rtx epilogue_line_note = NULL_RTX;
5138 /* Locate the line number associated with the closing brace,
5139 if we can find one. */
5140 for (seq = get_last_insn ();
5141 seq && ! active_insn_p (seq);
5142 seq = PREV_INSN (seq))
5143 if (NOTE_P (seq) && NOTE_LINE_NUMBER (seq) > 0)
5145 epilogue_line_note = seq;
5149 for (ei2 = ei_start (last->preds); (e = ei_safe_edge (ei2)); )
5151 basic_block bb = e->src;
5154 if (bb == ENTRY_BLOCK_PTR)
5161 if (!JUMP_P (jump) || JUMP_LABEL (jump) != label)
5167 /* If we have an unconditional jump, we can replace that
5168 with a simple return instruction. */
5169 if (simplejump_p (jump))
5171 emit_return_into_block (bb, epilogue_line_note);
5175 /* If we have a conditional jump, we can try to replace
5176 that with a conditional return instruction. */
5177 else if (condjump_p (jump))
5179 if (! redirect_jump (jump, 0, 0))
5185 /* If this block has only one successor, it both jumps
5186 and falls through to the fallthru block, so we can't
5188 if (single_succ_p (bb))
5200 /* Fix up the CFG for the successful change we just made. */
5201 redirect_edge_succ (e, EXIT_BLOCK_PTR);
5204 /* Emit a return insn for the exit fallthru block. Whether
5205 this is still reachable will be determined later. */
5207 emit_barrier_after (BB_END (last));
5208 emit_return_into_block (last, epilogue_line_note);
5209 epilogue_end = BB_END (last);
5210 single_succ_edge (last)->flags &= ~EDGE_FALLTHRU;
5215 /* Find the edge that falls through to EXIT. Other edges may exist
5216 due to RETURN instructions, but those don't need epilogues.
5217 There really shouldn't be a mixture -- either all should have
5218 been converted or none, however... */
5220 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
5221 if (e->flags & EDGE_FALLTHRU)
5226 #ifdef HAVE_epilogue
5230 epilogue_end = emit_note (NOTE_INSN_EPILOGUE_BEG);
5232 seq = gen_epilogue ();
5234 #ifdef INCOMING_RETURN_ADDR_RTX
5235 /* If this function returns with the stack depressed and we can support
5236 it, massage the epilogue to actually do that. */
5237 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
5238 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
5239 seq = keep_stack_depressed (seq);
5242 emit_jump_insn (seq);
5244 /* Retain a map of the epilogue insns. */
5245 record_insns (seq, &epilogue);
5246 set_insn_locators (seq, epilogue_locator);
5251 insert_insn_on_edge (seq, e);
5259 if (! next_active_insn (BB_END (e->src)))
5261 /* We have a fall-through edge to the exit block, the source is not
5262 at the end of the function, and there will be an assembler epilogue
5263 at the end of the function.
5264 We can't use force_nonfallthru here, because that would try to
5265 use return. Inserting a jump 'by hand' is extremely messy, so
5266 we take advantage of cfg_layout_finalize using
5267 fixup_fallthru_exit_predecessor. */
5268 cfg_layout_initialize (0);
5269 FOR_EACH_BB (cur_bb)
5270 if (cur_bb->index >= 0 && cur_bb->next_bb->index >= 0)
5271 cur_bb->aux = cur_bb->next_bb;
5272 cfg_layout_finalize ();
5277 commit_edge_insertions ();
5279 #ifdef HAVE_sibcall_epilogue
5280 /* Emit sibling epilogues before any sibling call sites. */
5281 for (ei = ei_start (EXIT_BLOCK_PTR->preds); (e = ei_safe_edge (ei)); )
5283 basic_block bb = e->src;
5284 rtx insn = BB_END (bb);
5287 || ! SIBLING_CALL_P (insn))
5294 emit_insn (gen_sibcall_epilogue ());
5298 /* Retain a map of the epilogue insns. Used in life analysis to
5299 avoid getting rid of sibcall epilogue insns. Do this before we
5300 actually emit the sequence. */
5301 record_insns (seq, &sibcall_epilogue);
5302 set_insn_locators (seq, epilogue_locator);
5304 emit_insn_before (seq, insn);
5309 #ifdef HAVE_prologue
5310 /* This is probably all useless now that we use locators. */
5315 /* GDB handles `break f' by setting a breakpoint on the first
5316 line note after the prologue. Which means (1) that if
5317 there are line number notes before where we inserted the
5318 prologue we should move them, and (2) we should generate a
5319 note before the end of the first basic block, if there isn't
5322 ??? This behavior is completely broken when dealing with
5323 multiple entry functions. We simply place the note always
5324 into first basic block and let alternate entry points
5328 for (insn = prologue_end; insn; insn = prev)
5330 prev = PREV_INSN (insn);
5331 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5333 /* Note that we cannot reorder the first insn in the
5334 chain, since rest_of_compilation relies on that
5335 remaining constant. */
5338 reorder_insns (insn, insn, prologue_end);
5342 /* Find the last line number note in the first block. */
5343 for (insn = BB_END (ENTRY_BLOCK_PTR->next_bb);
5344 insn != prologue_end && insn;
5345 insn = PREV_INSN (insn))
5346 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5349 /* If we didn't find one, make a copy of the first line number
5353 for (insn = next_active_insn (prologue_end);
5355 insn = PREV_INSN (insn))
5356 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5358 emit_note_copy_after (insn, prologue_end);
5364 #ifdef HAVE_epilogue
5369 /* Similarly, move any line notes that appear after the epilogue.
5370 There is no need, however, to be quite so anal about the existence
5371 of such a note. Also move the NOTE_INSN_FUNCTION_END and (possibly)
5372 NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
5374 for (insn = epilogue_end; insn; insn = next)
5376 next = NEXT_INSN (insn);
5378 && (NOTE_LINE_NUMBER (insn) > 0
5379 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG
5380 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_END))
5381 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
5387 /* Reposition the prologue-end and epilogue-begin notes after instruction
5388 scheduling and delayed branch scheduling. */
5391 reposition_prologue_and_epilogue_notes (rtx f ATTRIBUTE_UNUSED)
5393 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
5394 rtx insn, last, note;
5397 if ((len = VEC_length (int, prologue)) > 0)
5401 /* Scan from the beginning until we reach the last prologue insn.
5402 We apparently can't depend on basic_block_{head,end} after
5404 for (insn = f; insn; insn = NEXT_INSN (insn))
5408 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
5411 else if (contains (insn, &prologue))
5421 /* Find the prologue-end note if we haven't already, and
5422 move it to just after the last prologue insn. */
5425 for (note = last; (note = NEXT_INSN (note));)
5427 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
5431 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
5433 last = NEXT_INSN (last);
5434 reorder_insns (note, note, last);
5438 if ((len = VEC_length (int, epilogue)) > 0)
5442 /* Scan from the end until we reach the first epilogue insn.
5443 We apparently can't depend on basic_block_{head,end} after
5445 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
5449 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
5452 else if (contains (insn, &epilogue))
5462 /* Find the epilogue-begin note if we haven't already, and
5463 move it to just before the first epilogue insn. */
5466 for (note = insn; (note = PREV_INSN (note));)
5468 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
5472 if (PREV_INSN (last) != note)
5473 reorder_insns (note, note, PREV_INSN (last));
5476 #endif /* HAVE_prologue or HAVE_epilogue */
5479 /* Resets insn_block_boundaries array. */
5482 reset_block_changes (void)
5484 VARRAY_TREE_INIT (cfun->ib_boundaries_block, 100, "ib_boundaries_block");
5485 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, NULL_TREE);
5488 /* Record the boundary for BLOCK. */
5490 record_block_change (tree block)
5498 last_block = VARRAY_TOP_TREE (cfun->ib_boundaries_block);
5499 VARRAY_POP (cfun->ib_boundaries_block);
5501 for (i = VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block); i < n; i++)
5502 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, last_block);
5504 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, block);
5507 /* Finishes record of boundaries. */
5508 void finalize_block_changes (void)
5510 record_block_change (DECL_INITIAL (current_function_decl));
5513 /* For INSN return the BLOCK it belongs to. */
5515 check_block_change (rtx insn, tree *block)
5517 unsigned uid = INSN_UID (insn);
5519 if (uid >= VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block))
5522 *block = VARRAY_TREE (cfun->ib_boundaries_block, uid);
5525 /* Releases the ib_boundaries_block records. */
5527 free_block_changes (void)
5529 cfun->ib_boundaries_block = NULL;
5532 /* Returns the name of the current function. */
5534 current_function_name (void)
5536 return lang_hooks.decl_printable_name (cfun->decl, 2);
5541 rest_of_handle_check_leaf_regs (void)
5543 #ifdef LEAF_REGISTERS
5544 current_function_uses_only_leaf_regs
5545 = optimize > 0 && only_leaf_regs_used () && leaf_function_p ();
5549 struct tree_opt_pass pass_leaf_regs =
5553 rest_of_handle_check_leaf_regs, /* execute */
5556 0, /* static_pass_number */
5558 0, /* properties_required */
5559 0, /* properties_provided */
5560 0, /* properties_destroyed */
5561 0, /* todo_flags_start */
5562 0, /* todo_flags_finish */
5567 #include "gt-function.h"