1 /* Expands front end tree to back end RTL for GCC.
2 Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file handles the generation of rtl code from tree structure
23 at the level of the function as a whole.
24 It creates the rtl expressions for parameters and auto variables
25 and has full responsibility for allocating stack slots.
27 `expand_function_start' is called at the beginning of a function,
28 before the function body is parsed, and `expand_function_end' is
29 called after parsing the body.
31 Call `assign_stack_local' to allocate a stack slot for a local variable.
32 This is usually done during the RTL generation for the function body,
33 but it can also be done in the reload pass when a pseudo-register does
34 not get a hard register. */
38 #include "coretypes.h"
49 #include "hard-reg-set.h"
50 #include "insn-config.h"
53 #include "basic-block.h"
58 #include "integrate.h"
59 #include "langhooks.h"
61 #include "cfglayout.h"
62 #include "tree-gimple.h"
64 #ifndef LOCAL_ALIGNMENT
65 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
68 #ifndef STACK_ALIGNMENT_NEEDED
69 #define STACK_ALIGNMENT_NEEDED 1
72 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
74 /* Some systems use __main in a way incompatible with its use in gcc, in these
75 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
76 give the same symbol without quotes for an alternative entry point. You
77 must define both, or neither. */
79 #define NAME__MAIN "__main"
82 /* Round a value to the lowest integer less than it that is a multiple of
83 the required alignment. Avoid using division in case the value is
84 negative. Assume the alignment is a power of two. */
85 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
87 /* Similar, but round to the next highest integer that meets the
89 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
91 /* Nonzero if function being compiled doesn't contain any calls
92 (ignoring the prologue and epilogue). This is set prior to
93 local register allocation and is valid for the remaining
95 int current_function_is_leaf;
97 /* Nonzero if function being compiled doesn't modify the stack pointer
98 (ignoring the prologue and epilogue). This is only valid after
99 life_analysis has run. */
100 int current_function_sp_is_unchanging;
102 /* Nonzero if the function being compiled is a leaf function which only
103 uses leaf registers. This is valid after reload (specifically after
104 sched2) and is useful only if the port defines LEAF_REGISTERS. */
105 int current_function_uses_only_leaf_regs;
107 /* Nonzero once virtual register instantiation has been done.
108 assign_stack_local uses frame_pointer_rtx when this is nonzero.
109 calls.c:emit_library_call_value_1 uses it to set up
110 post-instantiation libcalls. */
111 int virtuals_instantiated;
113 /* Assign unique numbers to labels generated for profiling, debugging, etc. */
114 static GTY(()) int funcdef_no;
116 /* These variables hold pointers to functions to create and destroy
117 target specific, per-function data structures. */
118 struct machine_function * (*init_machine_status) (void);
120 /* The currently compiled function. */
121 struct function *cfun = 0;
123 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
124 static GTY(()) varray_type prologue;
125 static GTY(()) varray_type epilogue;
127 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
129 static GTY(()) varray_type sibcall_epilogue;
131 /* In order to evaluate some expressions, such as function calls returning
132 structures in memory, we need to temporarily allocate stack locations.
133 We record each allocated temporary in the following structure.
135 Associated with each temporary slot is a nesting level. When we pop up
136 one level, all temporaries associated with the previous level are freed.
137 Normally, all temporaries are freed after the execution of the statement
138 in which they were created. However, if we are inside a ({...}) grouping,
139 the result may be in a temporary and hence must be preserved. If the
140 result could be in a temporary, we preserve it if we can determine which
141 one it is in. If we cannot determine which temporary may contain the
142 result, all temporaries are preserved. A temporary is preserved by
143 pretending it was allocated at the previous nesting level.
145 Automatic variables are also assigned temporary slots, at the nesting
146 level where they are defined. They are marked a "kept" so that
147 free_temp_slots will not free them. */
149 struct temp_slot GTY(())
151 /* Points to next temporary slot. */
152 struct temp_slot *next;
153 /* Points to previous temporary slot. */
154 struct temp_slot *prev;
156 /* The rtx to used to reference the slot. */
158 /* The rtx used to represent the address if not the address of the
159 slot above. May be an EXPR_LIST if multiple addresses exist. */
161 /* The alignment (in bits) of the slot. */
163 /* The size, in units, of the slot. */
165 /* The type of the object in the slot, or zero if it doesn't correspond
166 to a type. We use this to determine whether a slot can be reused.
167 It can be reused if objects of the type of the new slot will always
168 conflict with objects of the type of the old slot. */
170 /* Nonzero if this temporary is currently in use. */
172 /* Nonzero if this temporary has its address taken. */
174 /* Nesting level at which this slot is being used. */
176 /* Nonzero if this should survive a call to free_temp_slots. */
178 /* The offset of the slot from the frame_pointer, including extra space
179 for alignment. This info is for combine_temp_slots. */
180 HOST_WIDE_INT base_offset;
181 /* The size of the slot, including extra space for alignment. This
182 info is for combine_temp_slots. */
183 HOST_WIDE_INT full_size;
186 /* Forward declarations. */
188 static rtx assign_stack_local_1 (enum machine_mode, HOST_WIDE_INT, int,
190 static struct temp_slot *find_temp_slot_from_address (rtx);
191 static void instantiate_decls (tree, int);
192 static void instantiate_decls_1 (tree, int);
193 static void instantiate_decl (rtx, HOST_WIDE_INT, int);
194 static rtx instantiate_new_reg (rtx, HOST_WIDE_INT *);
195 static int instantiate_virtual_regs_1 (rtx *, rtx, int);
196 static void pad_to_arg_alignment (struct args_size *, int, struct args_size *);
197 static void pad_below (struct args_size *, enum machine_mode, tree);
198 static void reorder_blocks_1 (rtx, tree, varray_type *);
199 static void reorder_fix_fragments (tree);
200 static int all_blocks (tree, tree *);
201 static tree *get_block_vector (tree, int *);
202 extern tree debug_find_var_in_block_tree (tree, tree);
203 /* We always define `record_insns' even if it's not used so that we
204 can always export `prologue_epilogue_contains'. */
205 static void record_insns (rtx, varray_type *) ATTRIBUTE_UNUSED;
206 static int contains (rtx, varray_type);
208 static void emit_return_into_block (basic_block, rtx);
210 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
211 static rtx keep_stack_depressed (rtx);
213 static void prepare_function_start (tree);
214 static void do_clobber_return_reg (rtx, void *);
215 static void do_use_return_reg (rtx, void *);
216 static void instantiate_virtual_regs_lossage (rtx);
217 static void set_insn_locators (rtx, int) ATTRIBUTE_UNUSED;
219 /* Pointer to chain of `struct function' for containing functions. */
220 struct function *outer_function_chain;
222 /* Given a function decl for a containing function,
223 return the `struct function' for it. */
226 find_function_data (tree decl)
230 for (p = outer_function_chain; p; p = p->outer)
237 /* Save the current context for compilation of a nested function.
238 This is called from language-specific code. The caller should use
239 the enter_nested langhook to save any language-specific state,
240 since this function knows only about language-independent
244 push_function_context_to (tree context)
250 if (context == current_function_decl)
251 cfun->contains_functions = 1;
254 struct function *containing = find_function_data (context);
255 containing->contains_functions = 1;
260 init_dummy_function_start ();
263 p->outer = outer_function_chain;
264 outer_function_chain = p;
266 lang_hooks.function.enter_nested (p);
272 push_function_context (void)
274 push_function_context_to (current_function_decl);
277 /* Restore the last saved context, at the end of a nested function.
278 This function is called from language-specific code. */
281 pop_function_context_from (tree context ATTRIBUTE_UNUSED)
283 struct function *p = outer_function_chain;
286 outer_function_chain = p->outer;
288 current_function_decl = p->decl;
290 lang_hooks.function.leave_nested (p);
292 /* Reset variables that have known state during rtx generation. */
293 virtuals_instantiated = 0;
294 generating_concat_p = 1;
298 pop_function_context (void)
300 pop_function_context_from (current_function_decl);
303 /* Clear out all parts of the state in F that can safely be discarded
304 after the function has been parsed, but not compiled, to let
305 garbage collection reclaim the memory. */
308 free_after_parsing (struct function *f)
310 /* f->expr->forced_labels is used by code generation. */
311 /* f->emit->regno_reg_rtx is used by code generation. */
312 /* f->varasm is used by code generation. */
313 /* f->eh->eh_return_stub_label is used by code generation. */
315 lang_hooks.function.final (f);
318 /* Clear out all parts of the state in F that can safely be discarded
319 after the function has been compiled, to let garbage collection
320 reclaim the memory. */
323 free_after_compilation (struct function *f)
331 f->x_avail_temp_slots = NULL;
332 f->x_used_temp_slots = NULL;
333 f->arg_offset_rtx = NULL;
334 f->return_rtx = NULL;
335 f->internal_arg_pointer = NULL;
336 f->x_nonlocal_goto_handler_labels = NULL;
337 f->x_return_label = NULL;
338 f->x_naked_return_label = NULL;
339 f->x_stack_slot_list = NULL;
340 f->x_tail_recursion_reentry = NULL;
341 f->x_arg_pointer_save_area = NULL;
342 f->x_parm_birth_insn = NULL;
343 f->original_arg_vector = NULL;
344 f->original_decl_initial = NULL;
345 f->epilogue_delay_list = NULL;
348 /* Allocate fixed slots in the stack frame of the current function. */
350 /* Return size needed for stack frame based on slots so far allocated in
352 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
353 the caller may have to do that. */
356 get_func_frame_size (struct function *f)
358 #ifdef FRAME_GROWS_DOWNWARD
359 return -f->x_frame_offset;
361 return f->x_frame_offset;
365 /* Return size needed for stack frame based on slots so far allocated.
366 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
367 the caller may have to do that. */
369 get_frame_size (void)
371 return get_func_frame_size (cfun);
374 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
375 with machine mode MODE.
377 ALIGN controls the amount of alignment for the address of the slot:
378 0 means according to MODE,
379 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
380 -2 means use BITS_PER_UNIT,
381 positive specifies alignment boundary in bits.
383 We do not round to stack_boundary here.
385 FUNCTION specifies the function to allocate in. */
388 assign_stack_local_1 (enum machine_mode mode, HOST_WIDE_INT size, int align,
389 struct function *function)
392 int bigend_correction = 0;
393 unsigned int alignment;
394 int frame_off, frame_alignment, frame_phase;
401 alignment = BIGGEST_ALIGNMENT;
403 alignment = GET_MODE_ALIGNMENT (mode);
405 /* Allow the target to (possibly) increase the alignment of this
407 type = lang_hooks.types.type_for_mode (mode, 0);
409 alignment = LOCAL_ALIGNMENT (type, alignment);
411 alignment /= BITS_PER_UNIT;
413 else if (align == -1)
415 alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
416 size = CEIL_ROUND (size, alignment);
418 else if (align == -2)
419 alignment = 1; /* BITS_PER_UNIT / BITS_PER_UNIT */
421 alignment = align / BITS_PER_UNIT;
423 #ifdef FRAME_GROWS_DOWNWARD
424 function->x_frame_offset -= size;
427 /* Ignore alignment we can't do with expected alignment of the boundary. */
428 if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY)
429 alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
431 if (function->stack_alignment_needed < alignment * BITS_PER_UNIT)
432 function->stack_alignment_needed = alignment * BITS_PER_UNIT;
434 /* Calculate how many bytes the start of local variables is off from
436 frame_alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
437 frame_off = STARTING_FRAME_OFFSET % frame_alignment;
438 frame_phase = frame_off ? frame_alignment - frame_off : 0;
440 /* Round the frame offset to the specified alignment. The default is
441 to always honor requests to align the stack but a port may choose to
442 do its own stack alignment by defining STACK_ALIGNMENT_NEEDED. */
443 if (STACK_ALIGNMENT_NEEDED
447 /* We must be careful here, since FRAME_OFFSET might be negative and
448 division with a negative dividend isn't as well defined as we might
449 like. So we instead assume that ALIGNMENT is a power of two and
450 use logical operations which are unambiguous. */
451 #ifdef FRAME_GROWS_DOWNWARD
452 function->x_frame_offset
453 = (FLOOR_ROUND (function->x_frame_offset - frame_phase,
454 (unsigned HOST_WIDE_INT) alignment)
457 function->x_frame_offset
458 = (CEIL_ROUND (function->x_frame_offset - frame_phase,
459 (unsigned HOST_WIDE_INT) alignment)
464 /* On a big-endian machine, if we are allocating more space than we will use,
465 use the least significant bytes of those that are allocated. */
466 if (BYTES_BIG_ENDIAN && mode != BLKmode)
467 bigend_correction = size - GET_MODE_SIZE (mode);
469 /* If we have already instantiated virtual registers, return the actual
470 address relative to the frame pointer. */
471 if (function == cfun && virtuals_instantiated)
472 addr = plus_constant (frame_pointer_rtx,
474 (frame_offset + bigend_correction
475 + STARTING_FRAME_OFFSET, Pmode));
477 addr = plus_constant (virtual_stack_vars_rtx,
479 (function->x_frame_offset + bigend_correction,
482 #ifndef FRAME_GROWS_DOWNWARD
483 function->x_frame_offset += size;
486 x = gen_rtx_MEM (mode, addr);
488 function->x_stack_slot_list
489 = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list);
494 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
498 assign_stack_local (enum machine_mode mode, HOST_WIDE_INT size, int align)
500 return assign_stack_local_1 (mode, size, align, cfun);
504 /* Removes temporary slot TEMP from LIST. */
507 cut_slot_from_list (struct temp_slot *temp, struct temp_slot **list)
510 temp->next->prev = temp->prev;
512 temp->prev->next = temp->next;
516 temp->prev = temp->next = NULL;
519 /* Inserts temporary slot TEMP to LIST. */
522 insert_slot_to_list (struct temp_slot *temp, struct temp_slot **list)
526 (*list)->prev = temp;
531 /* Returns the list of used temp slots at LEVEL. */
533 static struct temp_slot **
534 temp_slots_at_level (int level)
537 if (!used_temp_slots)
538 VARRAY_GENERIC_PTR_INIT (used_temp_slots, 3, "used_temp_slots");
540 while (level >= (int) VARRAY_ACTIVE_SIZE (used_temp_slots))
541 VARRAY_PUSH_GENERIC_PTR (used_temp_slots, NULL);
543 return (struct temp_slot **) &VARRAY_GENERIC_PTR (used_temp_slots, level);
546 /* Returns the maximal temporary slot level. */
549 max_slot_level (void)
551 if (!used_temp_slots)
554 return VARRAY_ACTIVE_SIZE (used_temp_slots) - 1;
557 /* Moves temporary slot TEMP to LEVEL. */
560 move_slot_to_level (struct temp_slot *temp, int level)
562 cut_slot_from_list (temp, temp_slots_at_level (temp->level));
563 insert_slot_to_list (temp, temp_slots_at_level (level));
567 /* Make temporary slot TEMP available. */
570 make_slot_available (struct temp_slot *temp)
572 cut_slot_from_list (temp, temp_slots_at_level (temp->level));
573 insert_slot_to_list (temp, &avail_temp_slots);
578 /* Allocate a temporary stack slot and record it for possible later
581 MODE is the machine mode to be given to the returned rtx.
583 SIZE is the size in units of the space required. We do no rounding here
584 since assign_stack_local will do any required rounding.
586 KEEP is 1 if this slot is to be retained after a call to
587 free_temp_slots. Automatic variables for a block are allocated
588 with this flag. KEEP values of 2 or 3 were needed respectively
589 for variables whose lifetime is controlled by CLEANUP_POINT_EXPRs
590 or for SAVE_EXPRs, but they are now unused and will abort.
592 TYPE is the type that will be used for the stack slot. */
595 assign_stack_temp_for_type (enum machine_mode mode, HOST_WIDE_INT size, int keep,
599 struct temp_slot *p, *best_p = 0, *selected = NULL, **pp;
602 /* If SIZE is -1 it means that somebody tried to allocate a temporary
603 of a variable size. */
604 gcc_assert (size != -1);
606 /* These are now unused. */
607 gcc_assert (keep <= 1);
610 align = BIGGEST_ALIGNMENT;
612 align = GET_MODE_ALIGNMENT (mode);
615 type = lang_hooks.types.type_for_mode (mode, 0);
618 align = LOCAL_ALIGNMENT (type, align);
620 /* Try to find an available, already-allocated temporary of the proper
621 mode which meets the size and alignment requirements. Choose the
622 smallest one with the closest alignment. */
623 for (p = avail_temp_slots; p; p = p->next)
625 if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode
626 && objects_must_conflict_p (p->type, type)
627 && (best_p == 0 || best_p->size > p->size
628 || (best_p->size == p->size && best_p->align > p->align)))
630 if (p->align == align && p->size == size)
633 cut_slot_from_list (selected, &avail_temp_slots);
641 /* Make our best, if any, the one to use. */
645 cut_slot_from_list (selected, &avail_temp_slots);
647 /* If there are enough aligned bytes left over, make them into a new
648 temp_slot so that the extra bytes don't get wasted. Do this only
649 for BLKmode slots, so that we can be sure of the alignment. */
650 if (GET_MODE (best_p->slot) == BLKmode)
652 int alignment = best_p->align / BITS_PER_UNIT;
653 HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment);
655 if (best_p->size - rounded_size >= alignment)
657 p = ggc_alloc (sizeof (struct temp_slot));
658 p->in_use = p->addr_taken = 0;
659 p->size = best_p->size - rounded_size;
660 p->base_offset = best_p->base_offset + rounded_size;
661 p->full_size = best_p->full_size - rounded_size;
662 p->slot = gen_rtx_MEM (BLKmode,
663 plus_constant (XEXP (best_p->slot, 0),
665 p->align = best_p->align;
667 p->type = best_p->type;
668 insert_slot_to_list (p, &avail_temp_slots);
670 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot,
673 best_p->size = rounded_size;
674 best_p->full_size = rounded_size;
679 /* If we still didn't find one, make a new temporary. */
682 HOST_WIDE_INT frame_offset_old = frame_offset;
684 p = ggc_alloc (sizeof (struct temp_slot));
686 /* We are passing an explicit alignment request to assign_stack_local.
687 One side effect of that is assign_stack_local will not round SIZE
688 to ensure the frame offset remains suitably aligned.
690 So for requests which depended on the rounding of SIZE, we go ahead
691 and round it now. We also make sure ALIGNMENT is at least
692 BIGGEST_ALIGNMENT. */
693 gcc_assert (mode != BLKmode || align == BIGGEST_ALIGNMENT);
694 p->slot = assign_stack_local (mode,
696 ? CEIL_ROUND (size, (int) align / BITS_PER_UNIT)
702 /* The following slot size computation is necessary because we don't
703 know the actual size of the temporary slot until assign_stack_local
704 has performed all the frame alignment and size rounding for the
705 requested temporary. Note that extra space added for alignment
706 can be either above or below this stack slot depending on which
707 way the frame grows. We include the extra space if and only if it
708 is above this slot. */
709 #ifdef FRAME_GROWS_DOWNWARD
710 p->size = frame_offset_old - frame_offset;
715 /* Now define the fields used by combine_temp_slots. */
716 #ifdef FRAME_GROWS_DOWNWARD
717 p->base_offset = frame_offset;
718 p->full_size = frame_offset_old - frame_offset;
720 p->base_offset = frame_offset_old;
721 p->full_size = frame_offset - frame_offset_old;
732 p->level = temp_slot_level;
735 pp = temp_slots_at_level (p->level);
736 insert_slot_to_list (p, pp);
738 /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
739 slot = gen_rtx_MEM (mode, XEXP (p->slot, 0));
740 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, slot, stack_slot_list);
742 /* If we know the alias set for the memory that will be used, use
743 it. If there's no TYPE, then we don't know anything about the
744 alias set for the memory. */
745 set_mem_alias_set (slot, type ? get_alias_set (type) : 0);
746 set_mem_align (slot, align);
748 /* If a type is specified, set the relevant flags. */
751 MEM_VOLATILE_P (slot) = TYPE_VOLATILE (type);
752 MEM_SET_IN_STRUCT_P (slot, AGGREGATE_TYPE_P (type));
758 /* Allocate a temporary stack slot and record it for possible later
759 reuse. First three arguments are same as in preceding function. */
762 assign_stack_temp (enum machine_mode mode, HOST_WIDE_INT size, int keep)
764 return assign_stack_temp_for_type (mode, size, keep, NULL_TREE);
767 /* Assign a temporary.
768 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
769 and so that should be used in error messages. In either case, we
770 allocate of the given type.
771 KEEP is as for assign_stack_temp.
772 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
773 it is 0 if a register is OK.
774 DONT_PROMOTE is 1 if we should not promote values in register
778 assign_temp (tree type_or_decl, int keep, int memory_required,
779 int dont_promote ATTRIBUTE_UNUSED)
782 enum machine_mode mode;
787 if (DECL_P (type_or_decl))
788 decl = type_or_decl, type = TREE_TYPE (decl);
790 decl = NULL, type = type_or_decl;
792 mode = TYPE_MODE (type);
794 unsignedp = TYPE_UNSIGNED (type);
797 if (mode == BLKmode || memory_required)
799 HOST_WIDE_INT size = int_size_in_bytes (type);
803 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
804 problems with allocating the stack space. */
808 /* Unfortunately, we don't yet know how to allocate variable-sized
809 temporaries. However, sometimes we have a fixed upper limit on
810 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
811 instead. This is the case for Chill variable-sized strings. */
812 if (size == -1 && TREE_CODE (type) == ARRAY_TYPE
813 && TYPE_ARRAY_MAX_SIZE (type) != NULL_TREE
814 && host_integerp (TYPE_ARRAY_MAX_SIZE (type), 1))
815 size = tree_low_cst (TYPE_ARRAY_MAX_SIZE (type), 1);
817 /* If we still haven't been able to get a size, see if the language
818 can compute a maximum size. */
820 && (size_tree = lang_hooks.types.max_size (type)) != 0
821 && host_integerp (size_tree, 1))
822 size = tree_low_cst (size_tree, 1);
824 /* The size of the temporary may be too large to fit into an integer. */
825 /* ??? Not sure this should happen except for user silliness, so limit
826 this to things that aren't compiler-generated temporaries. The
827 rest of the time we'll abort in assign_stack_temp_for_type. */
828 if (decl && size == -1
829 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST)
831 error ("%Jsize of variable %qD is too large", decl, decl);
835 tmp = assign_stack_temp_for_type (mode, size, keep, type);
841 mode = promote_mode (type, mode, &unsignedp, 0);
844 return gen_reg_rtx (mode);
847 /* Combine temporary stack slots which are adjacent on the stack.
849 This allows for better use of already allocated stack space. This is only
850 done for BLKmode slots because we can be sure that we won't have alignment
851 problems in this case. */
854 combine_temp_slots (void)
856 struct temp_slot *p, *q, *next, *next_q;
859 /* We can't combine slots, because the information about which slot
860 is in which alias set will be lost. */
861 if (flag_strict_aliasing)
864 /* If there are a lot of temp slots, don't do anything unless
865 high levels of optimization. */
866 if (! flag_expensive_optimizations)
867 for (p = avail_temp_slots, num_slots = 0; p; p = p->next, num_slots++)
868 if (num_slots > 100 || (num_slots > 10 && optimize == 0))
871 for (p = avail_temp_slots; p; p = next)
877 if (GET_MODE (p->slot) != BLKmode)
880 for (q = p->next; q; q = next_q)
886 if (GET_MODE (q->slot) != BLKmode)
889 if (p->base_offset + p->full_size == q->base_offset)
891 /* Q comes after P; combine Q into P. */
893 p->full_size += q->full_size;
896 else if (q->base_offset + q->full_size == p->base_offset)
898 /* P comes after Q; combine P into Q. */
900 q->full_size += p->full_size;
905 cut_slot_from_list (q, &avail_temp_slots);
908 /* Either delete P or advance past it. */
910 cut_slot_from_list (p, &avail_temp_slots);
914 /* Find the temp slot corresponding to the object at address X. */
916 static struct temp_slot *
917 find_temp_slot_from_address (rtx x)
923 for (i = max_slot_level (); i >= 0; i--)
924 for (p = *temp_slots_at_level (i); p; p = p->next)
926 if (XEXP (p->slot, 0) == x
928 || (GET_CODE (x) == PLUS
929 && XEXP (x, 0) == virtual_stack_vars_rtx
930 && GET_CODE (XEXP (x, 1)) == CONST_INT
931 && INTVAL (XEXP (x, 1)) >= p->base_offset
932 && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size))
935 else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST)
936 for (next = p->address; next; next = XEXP (next, 1))
937 if (XEXP (next, 0) == x)
941 /* If we have a sum involving a register, see if it points to a temp
943 if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 0))
944 && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
946 else if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 1))
947 && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
953 /* Indicate that NEW is an alternate way of referring to the temp slot
954 that previously was known by OLD. */
957 update_temp_slot_address (rtx old, rtx new)
961 if (rtx_equal_p (old, new))
964 p = find_temp_slot_from_address (old);
966 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
967 is a register, see if one operand of the PLUS is a temporary
968 location. If so, NEW points into it. Otherwise, if both OLD and
969 NEW are a PLUS and if there is a register in common between them.
970 If so, try a recursive call on those values. */
973 if (GET_CODE (old) != PLUS)
978 update_temp_slot_address (XEXP (old, 0), new);
979 update_temp_slot_address (XEXP (old, 1), new);
982 else if (GET_CODE (new) != PLUS)
985 if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0)))
986 update_temp_slot_address (XEXP (old, 1), XEXP (new, 1));
987 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0)))
988 update_temp_slot_address (XEXP (old, 0), XEXP (new, 1));
989 else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1)))
990 update_temp_slot_address (XEXP (old, 1), XEXP (new, 0));
991 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1)))
992 update_temp_slot_address (XEXP (old, 0), XEXP (new, 0));
997 /* Otherwise add an alias for the temp's address. */
998 else if (p->address == 0)
1002 if (GET_CODE (p->address) != EXPR_LIST)
1003 p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX);
1005 p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address);
1009 /* If X could be a reference to a temporary slot, mark the fact that its
1010 address was taken. */
1013 mark_temp_addr_taken (rtx x)
1015 struct temp_slot *p;
1020 /* If X is not in memory or is at a constant address, it cannot be in
1021 a temporary slot. */
1022 if (!MEM_P (x) || CONSTANT_P (XEXP (x, 0)))
1025 p = find_temp_slot_from_address (XEXP (x, 0));
1030 /* If X could be a reference to a temporary slot, mark that slot as
1031 belonging to the to one level higher than the current level. If X
1032 matched one of our slots, just mark that one. Otherwise, we can't
1033 easily predict which it is, so upgrade all of them. Kept slots
1034 need not be touched.
1036 This is called when an ({...}) construct occurs and a statement
1037 returns a value in memory. */
1040 preserve_temp_slots (rtx x)
1042 struct temp_slot *p = 0, *next;
1044 /* If there is no result, we still might have some objects whose address
1045 were taken, so we need to make sure they stay around. */
1048 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1053 move_slot_to_level (p, temp_slot_level - 1);
1059 /* If X is a register that is being used as a pointer, see if we have
1060 a temporary slot we know it points to. To be consistent with
1061 the code below, we really should preserve all non-kept slots
1062 if we can't find a match, but that seems to be much too costly. */
1063 if (REG_P (x) && REG_POINTER (x))
1064 p = find_temp_slot_from_address (x);
1066 /* If X is not in memory or is at a constant address, it cannot be in
1067 a temporary slot, but it can contain something whose address was
1069 if (p == 0 && (!MEM_P (x) || CONSTANT_P (XEXP (x, 0))))
1071 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1076 move_slot_to_level (p, temp_slot_level - 1);
1082 /* First see if we can find a match. */
1084 p = find_temp_slot_from_address (XEXP (x, 0));
1088 /* Move everything at our level whose address was taken to our new
1089 level in case we used its address. */
1090 struct temp_slot *q;
1092 if (p->level == temp_slot_level)
1094 for (q = *temp_slots_at_level (temp_slot_level); q; q = next)
1098 if (p != q && q->addr_taken)
1099 move_slot_to_level (q, temp_slot_level - 1);
1102 move_slot_to_level (p, temp_slot_level - 1);
1108 /* Otherwise, preserve all non-kept slots at this level. */
1109 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1114 move_slot_to_level (p, temp_slot_level - 1);
1118 /* Free all temporaries used so far. This is normally called at the
1119 end of generating code for a statement. */
1122 free_temp_slots (void)
1124 struct temp_slot *p, *next;
1126 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1131 make_slot_available (p);
1134 combine_temp_slots ();
1137 /* Push deeper into the nesting level for stack temporaries. */
1140 push_temp_slots (void)
1145 /* Pop a temporary nesting level. All slots in use in the current level
1149 pop_temp_slots (void)
1151 struct temp_slot *p, *next;
1153 for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
1156 make_slot_available (p);
1159 combine_temp_slots ();
1164 /* Initialize temporary slots. */
1167 init_temp_slots (void)
1169 /* We have not allocated any temporaries yet. */
1170 avail_temp_slots = 0;
1171 used_temp_slots = 0;
1172 temp_slot_level = 0;
1175 /* These routines are responsible for converting virtual register references
1176 to the actual hard register references once RTL generation is complete.
1178 The following four variables are used for communication between the
1179 routines. They contain the offsets of the virtual registers from their
1180 respective hard registers. */
1182 static int in_arg_offset;
1183 static int var_offset;
1184 static int dynamic_offset;
1185 static int out_arg_offset;
1186 static int cfa_offset;
1188 /* In most machines, the stack pointer register is equivalent to the bottom
1191 #ifndef STACK_POINTER_OFFSET
1192 #define STACK_POINTER_OFFSET 0
1195 /* If not defined, pick an appropriate default for the offset of dynamically
1196 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
1197 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
1199 #ifndef STACK_DYNAMIC_OFFSET
1201 /* The bottom of the stack points to the actual arguments. If
1202 REG_PARM_STACK_SPACE is defined, this includes the space for the register
1203 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
1204 stack space for register parameters is not pushed by the caller, but
1205 rather part of the fixed stack areas and hence not included in
1206 `current_function_outgoing_args_size'. Nevertheless, we must allow
1207 for it when allocating stack dynamic objects. */
1209 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1210 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1211 ((ACCUMULATE_OUTGOING_ARGS \
1212 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
1213 + (STACK_POINTER_OFFSET)) \
1216 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1217 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
1218 + (STACK_POINTER_OFFSET))
1222 /* On most machines, the CFA coincides with the first incoming parm. */
1224 #ifndef ARG_POINTER_CFA_OFFSET
1225 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
1229 /* Pass through the INSNS of function FNDECL and convert virtual register
1230 references to hard register references. */
1233 instantiate_virtual_regs (void)
1237 /* Compute the offsets to use for this function. */
1238 in_arg_offset = FIRST_PARM_OFFSET (current_function_decl);
1239 var_offset = STARTING_FRAME_OFFSET;
1240 dynamic_offset = STACK_DYNAMIC_OFFSET (current_function_decl);
1241 out_arg_offset = STACK_POINTER_OFFSET;
1242 cfa_offset = ARG_POINTER_CFA_OFFSET (current_function_decl);
1244 /* Scan all variables and parameters of this function. For each that is
1245 in memory, instantiate all virtual registers if the result is a valid
1246 address. If not, we do it later. That will handle most uses of virtual
1247 regs on many machines. */
1248 instantiate_decls (current_function_decl, 1);
1250 /* Initialize recognition, indicating that volatile is OK. */
1253 /* Scan through all the insns, instantiating every virtual register still
1255 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
1256 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
1257 || GET_CODE (insn) == CALL_INSN)
1259 instantiate_virtual_regs_1 (&PATTERN (insn), insn, 1);
1260 if (INSN_DELETED_P (insn))
1262 instantiate_virtual_regs_1 (®_NOTES (insn), NULL_RTX, 0);
1263 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
1264 if (GET_CODE (insn) == CALL_INSN)
1265 instantiate_virtual_regs_1 (&CALL_INSN_FUNCTION_USAGE (insn),
1268 /* Past this point all ASM statements should match. Verify that
1269 to avoid failures later in the compilation process. */
1270 if (asm_noperands (PATTERN (insn)) >= 0
1271 && ! check_asm_operands (PATTERN (insn)))
1272 instantiate_virtual_regs_lossage (insn);
1275 /* Now instantiate the remaining register equivalences for debugging info.
1276 These will not be valid addresses. */
1277 instantiate_decls (current_function_decl, 0);
1279 /* Indicate that, from now on, assign_stack_local should use
1280 frame_pointer_rtx. */
1281 virtuals_instantiated = 1;
1284 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
1285 all virtual registers in their DECL_RTL's.
1287 If VALID_ONLY, do this only if the resulting address is still valid.
1288 Otherwise, always do it. */
1291 instantiate_decls (tree fndecl, int valid_only)
1295 /* Process all parameters of the function. */
1296 for (decl = DECL_ARGUMENTS (fndecl); decl; decl = TREE_CHAIN (decl))
1298 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (decl));
1299 HOST_WIDE_INT size_rtl;
1301 instantiate_decl (DECL_RTL (decl), size, valid_only);
1303 /* If the parameter was promoted, then the incoming RTL mode may be
1304 larger than the declared type size. We must use the larger of
1306 size_rtl = GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl)));
1307 size = MAX (size_rtl, size);
1308 instantiate_decl (DECL_INCOMING_RTL (decl), size, valid_only);
1311 /* Now process all variables defined in the function or its subblocks. */
1312 instantiate_decls_1 (DECL_INITIAL (fndecl), valid_only);
1315 /* Subroutine of instantiate_decls: Process all decls in the given
1316 BLOCK node and all its subblocks. */
1319 instantiate_decls_1 (tree let, int valid_only)
1323 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
1324 if (DECL_RTL_SET_P (t))
1325 instantiate_decl (DECL_RTL (t),
1326 int_size_in_bytes (TREE_TYPE (t)),
1329 /* Process all subblocks. */
1330 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
1331 instantiate_decls_1 (t, valid_only);
1334 /* Subroutine of the preceding procedures: Given RTL representing a
1335 decl and the size of the object, do any instantiation required.
1337 If VALID_ONLY is nonzero, it means that the RTL should only be
1338 changed if the new address is valid. */
1341 instantiate_decl (rtx x, HOST_WIDE_INT size, int valid_only)
1343 enum machine_mode mode;
1349 /* If this is a CONCAT, recurse for the pieces. */
1350 if (GET_CODE (x) == CONCAT)
1352 instantiate_decl (XEXP (x, 0), size / 2, valid_only);
1353 instantiate_decl (XEXP (x, 1), size / 2, valid_only);
1357 /* If this is not a MEM, no need to do anything. Similarly if the
1358 address is a constant or a register that is not a virtual register. */
1363 if (CONSTANT_P (addr)
1365 && (REGNO (addr) < FIRST_VIRTUAL_REGISTER
1366 || REGNO (addr) > LAST_VIRTUAL_REGISTER)))
1369 /* If we should only do this if the address is valid, copy the address.
1370 We need to do this so we can undo any changes that might make the
1371 address invalid. This copy is unfortunate, but probably can't be
1375 addr = copy_rtx (addr);
1377 instantiate_virtual_regs_1 (&addr, NULL_RTX, 0);
1379 if (valid_only && size >= 0)
1381 unsigned HOST_WIDE_INT decl_size = size;
1383 /* Now verify that the resulting address is valid for every integer or
1384 floating-point mode up to and including SIZE bytes long. We do this
1385 since the object might be accessed in any mode and frame addresses
1388 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1389 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
1390 mode = GET_MODE_WIDER_MODE (mode))
1391 if (! memory_address_p (mode, addr))
1394 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
1395 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
1396 mode = GET_MODE_WIDER_MODE (mode))
1397 if (! memory_address_p (mode, addr))
1401 /* Put back the address now that we have updated it and we either know
1402 it is valid or we don't care whether it is valid. */
1407 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
1408 is a virtual register, return the equivalent hard register and set the
1409 offset indirectly through the pointer. Otherwise, return 0. */
1412 instantiate_new_reg (rtx x, HOST_WIDE_INT *poffset)
1415 HOST_WIDE_INT offset;
1417 if (x == virtual_incoming_args_rtx)
1418 new = arg_pointer_rtx, offset = in_arg_offset;
1419 else if (x == virtual_stack_vars_rtx)
1420 new = frame_pointer_rtx, offset = var_offset;
1421 else if (x == virtual_stack_dynamic_rtx)
1422 new = stack_pointer_rtx, offset = dynamic_offset;
1423 else if (x == virtual_outgoing_args_rtx)
1424 new = stack_pointer_rtx, offset = out_arg_offset;
1425 else if (x == virtual_cfa_rtx)
1426 new = arg_pointer_rtx, offset = cfa_offset;
1435 /* Called when instantiate_virtual_regs has failed to update the instruction.
1436 Usually this means that non-matching instruction has been emit, however for
1437 asm statements it may be the problem in the constraints. */
1439 instantiate_virtual_regs_lossage (rtx insn)
1441 gcc_assert (asm_noperands (PATTERN (insn)) >= 0);
1442 error_for_asm (insn, "impossible constraint in %<asm%>");
1445 /* Given a pointer to a piece of rtx and an optional pointer to the
1446 containing object, instantiate any virtual registers present in it.
1448 If EXTRA_INSNS, we always do the replacement and generate
1449 any extra insns before OBJECT. If it zero, we do nothing if replacement
1452 Return 1 if we either had nothing to do or if we were able to do the
1453 needed replacement. Return 0 otherwise; we only return zero if
1454 EXTRA_INSNS is zero.
1456 We first try some simple transformations to avoid the creation of extra
1460 instantiate_virtual_regs_1 (rtx *loc, rtx object, int extra_insns)
1465 HOST_WIDE_INT offset = 0;
1471 /* Re-start here to avoid recursion in common cases. */
1478 /* We may have detected and deleted invalid asm statements. */
1479 if (object && INSN_P (object) && INSN_DELETED_P (object))
1482 code = GET_CODE (x);
1484 /* Check for some special cases. */
1502 /* We are allowed to set the virtual registers. This means that
1503 the actual register should receive the source minus the
1504 appropriate offset. This is used, for example, in the handling
1505 of non-local gotos. */
1506 if ((new = instantiate_new_reg (SET_DEST (x), &offset)) != 0)
1508 rtx src = SET_SRC (x);
1510 /* We are setting the register, not using it, so the relevant
1511 offset is the negative of the offset to use were we using
1514 instantiate_virtual_regs_1 (&src, NULL_RTX, 0);
1516 /* The only valid sources here are PLUS or REG. Just do
1517 the simplest possible thing to handle them. */
1518 if (!REG_P (src) && GET_CODE (src) != PLUS)
1520 instantiate_virtual_regs_lossage (object);
1526 temp = force_operand (src, NULL_RTX);
1529 temp = force_operand (plus_constant (temp, offset), NULL_RTX);
1533 emit_insn_before (seq, object);
1536 if (! validate_change (object, &SET_SRC (x), temp, 0)
1538 instantiate_virtual_regs_lossage (object);
1543 instantiate_virtual_regs_1 (&SET_DEST (x), object, extra_insns);
1548 /* Handle special case of virtual register plus constant. */
1549 if (CONSTANT_P (XEXP (x, 1)))
1551 rtx old, new_offset;
1553 /* Check for (plus (plus VIRT foo) (const_int)) first. */
1554 if (GET_CODE (XEXP (x, 0)) == PLUS)
1556 if ((new = instantiate_new_reg (XEXP (XEXP (x, 0), 0), &offset)))
1558 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 1), object,
1560 new = gen_rtx_PLUS (Pmode, new, XEXP (XEXP (x, 0), 1));
1569 #ifdef POINTERS_EXTEND_UNSIGNED
1570 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
1571 we can commute the PLUS and SUBREG because pointers into the
1572 frame are well-behaved. */
1573 else if (GET_CODE (XEXP (x, 0)) == SUBREG && GET_MODE (x) == ptr_mode
1574 && GET_CODE (XEXP (x, 1)) == CONST_INT
1576 = instantiate_new_reg (SUBREG_REG (XEXP (x, 0)),
1578 && validate_change (object, loc,
1579 plus_constant (gen_lowpart (ptr_mode,
1582 + INTVAL (XEXP (x, 1))),
1586 else if ((new = instantiate_new_reg (XEXP (x, 0), &offset)) == 0)
1588 /* We know the second operand is a constant. Unless the
1589 first operand is a REG (which has been already checked),
1590 it needs to be checked. */
1591 if (!REG_P (XEXP (x, 0)))
1599 new_offset = plus_constant (XEXP (x, 1), offset);
1601 /* If the new constant is zero, try to replace the sum with just
1603 if (new_offset == const0_rtx
1604 && validate_change (object, loc, new, 0))
1607 /* Next try to replace the register and new offset.
1608 There are two changes to validate here and we can't assume that
1609 in the case of old offset equals new just changing the register
1610 will yield a valid insn. In the interests of a little efficiency,
1611 however, we only call validate change once (we don't queue up the
1612 changes and then call apply_change_group). */
1616 ? ! validate_change (object, &XEXP (x, 0), new, 0)
1617 : (XEXP (x, 0) = new,
1618 ! validate_change (object, &XEXP (x, 1), new_offset, 0)))
1626 /* Otherwise copy the new constant into a register and replace
1627 constant with that register. */
1628 temp = gen_reg_rtx (Pmode);
1630 if (validate_change (object, &XEXP (x, 1), temp, 0))
1631 emit_insn_before (gen_move_insn (temp, new_offset), object);
1634 /* If that didn't work, replace this expression with a
1635 register containing the sum. */
1638 new = gen_rtx_PLUS (Pmode, new, new_offset);
1641 temp = force_operand (new, NULL_RTX);
1645 emit_insn_before (seq, object);
1646 if (! validate_change (object, loc, temp, 0)
1647 && ! validate_replace_rtx (x, temp, object))
1649 instantiate_virtual_regs_lossage (object);
1658 /* Fall through to generic two-operand expression case. */
1664 case DIV: case UDIV:
1665 case MOD: case UMOD:
1666 case AND: case IOR: case XOR:
1667 case ROTATERT: case ROTATE:
1668 case ASHIFTRT: case LSHIFTRT: case ASHIFT:
1670 case GE: case GT: case GEU: case GTU:
1671 case LE: case LT: case LEU: case LTU:
1672 if (XEXP (x, 1) && ! CONSTANT_P (XEXP (x, 1)))
1673 instantiate_virtual_regs_1 (&XEXP (x, 1), object, extra_insns);
1678 /* Most cases of MEM that convert to valid addresses have already been
1679 handled by our scan of decls. The only special handling we
1680 need here is to make a copy of the rtx to ensure it isn't being
1681 shared if we have to change it to a pseudo.
1683 If the rtx is a simple reference to an address via a virtual register,
1684 it can potentially be shared. In such cases, first try to make it
1685 a valid address, which can also be shared. Otherwise, copy it and
1688 First check for common cases that need no processing. These are
1689 usually due to instantiation already being done on a previous instance
1693 if (CONSTANT_ADDRESS_P (temp)
1694 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
1695 || temp == arg_pointer_rtx
1697 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
1698 || temp == hard_frame_pointer_rtx
1700 || temp == frame_pointer_rtx)
1703 if (GET_CODE (temp) == PLUS
1704 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
1705 && (XEXP (temp, 0) == frame_pointer_rtx
1706 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
1707 || XEXP (temp, 0) == hard_frame_pointer_rtx
1709 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
1710 || XEXP (temp, 0) == arg_pointer_rtx
1715 if (temp == virtual_stack_vars_rtx
1716 || temp == virtual_incoming_args_rtx
1717 || (GET_CODE (temp) == PLUS
1718 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
1719 && (XEXP (temp, 0) == virtual_stack_vars_rtx
1720 || XEXP (temp, 0) == virtual_incoming_args_rtx)))
1722 /* This MEM may be shared. If the substitution can be done without
1723 the need to generate new pseudos, we want to do it in place
1724 so all copies of the shared rtx benefit. The call below will
1725 only make substitutions if the resulting address is still
1728 Note that we cannot pass X as the object in the recursive call
1729 since the insn being processed may not allow all valid
1730 addresses. However, if we were not passed on object, we can
1731 only modify X without copying it if X will have a valid
1734 ??? Also note that this can still lose if OBJECT is an insn that
1735 has less restrictions on an address that some other insn.
1736 In that case, we will modify the shared address. This case
1737 doesn't seem very likely, though. One case where this could
1738 happen is in the case of a USE or CLOBBER reference, but we
1739 take care of that below. */
1741 if (instantiate_virtual_regs_1 (&XEXP (x, 0),
1742 object ? object : x, 0))
1745 /* Otherwise make a copy and process that copy. We copy the entire
1746 RTL expression since it might be a PLUS which could also be
1748 *loc = x = copy_rtx (x);
1751 /* Fall through to generic unary operation case. */
1754 case STRICT_LOW_PART:
1756 case PRE_DEC: case PRE_INC: case POST_DEC: case POST_INC:
1757 case SIGN_EXTEND: case ZERO_EXTEND:
1758 case TRUNCATE: case FLOAT_EXTEND: case FLOAT_TRUNCATE:
1759 case FLOAT: case FIX:
1760 case UNSIGNED_FIX: case UNSIGNED_FLOAT:
1765 case POPCOUNT: case PARITY:
1766 /* These case either have just one operand or we know that we need not
1767 check the rest of the operands. */
1773 /* If the operand is a MEM, see if the change is a valid MEM. If not,
1774 go ahead and make the invalid one, but do it to a copy. For a REG,
1775 just make the recursive call, since there's no chance of a problem. */
1777 if ((MEM_P (XEXP (x, 0))
1778 && instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), XEXP (x, 0),
1780 || (REG_P (XEXP (x, 0))
1781 && instantiate_virtual_regs_1 (&XEXP (x, 0), object, 0)))
1784 XEXP (x, 0) = copy_rtx (XEXP (x, 0));
1789 /* Try to replace with a PLUS. If that doesn't work, compute the sum
1790 in front of this insn and substitute the temporary. */
1791 if ((new = instantiate_new_reg (x, &offset)) != 0)
1793 temp = plus_constant (new, offset);
1794 if (!validate_change (object, loc, temp, 0))
1800 temp = force_operand (temp, NULL_RTX);
1804 emit_insn_before (seq, object);
1805 if (! validate_change (object, loc, temp, 0)
1806 && ! validate_replace_rtx (x, temp, object))
1807 instantiate_virtual_regs_lossage (object);
1817 /* Scan all subexpressions. */
1818 fmt = GET_RTX_FORMAT (code);
1819 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
1822 if (!instantiate_virtual_regs_1 (&XEXP (x, i), object, extra_insns))
1825 else if (*fmt == 'E')
1826 for (j = 0; j < XVECLEN (x, i); j++)
1827 if (! instantiate_virtual_regs_1 (&XVECEXP (x, i, j), object,
1834 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
1835 This means a type for which function calls must pass an address to the
1836 function or get an address back from the function.
1837 EXP may be a type node or an expression (whose type is tested). */
1840 aggregate_value_p (tree exp, tree fntype)
1842 int i, regno, nregs;
1845 tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
1848 switch (TREE_CODE (fntype))
1851 fntype = get_callee_fndecl (fntype);
1852 fntype = fntype ? TREE_TYPE (fntype) : 0;
1855 fntype = TREE_TYPE (fntype);
1860 case IDENTIFIER_NODE:
1864 /* We don't expect other rtl types here. */
1868 if (TREE_CODE (type) == VOID_TYPE)
1870 /* If the front end has decided that this needs to be passed by
1871 reference, do so. */
1872 if ((TREE_CODE (exp) == PARM_DECL || TREE_CODE (exp) == RESULT_DECL)
1873 && DECL_BY_REFERENCE (exp))
1875 if (targetm.calls.return_in_memory (type, fntype))
1877 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
1878 and thus can't be returned in registers. */
1879 if (TREE_ADDRESSABLE (type))
1881 if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
1883 /* Make sure we have suitable call-clobbered regs to return
1884 the value in; if not, we must return it in memory. */
1885 reg = hard_function_value (type, 0, 0);
1887 /* If we have something other than a REG (e.g. a PARALLEL), then assume
1892 regno = REGNO (reg);
1893 nregs = hard_regno_nregs[regno][TYPE_MODE (type)];
1894 for (i = 0; i < nregs; i++)
1895 if (! call_used_regs[regno + i])
1900 /* Return true if we should assign DECL a pseudo register; false if it
1901 should live on the local stack. */
1904 use_register_for_decl (tree decl)
1906 /* Honor volatile. */
1907 if (TREE_SIDE_EFFECTS (decl))
1910 /* Honor addressability. */
1911 if (TREE_ADDRESSABLE (decl))
1914 /* Only register-like things go in registers. */
1915 if (DECL_MODE (decl) == BLKmode)
1918 /* If -ffloat-store specified, don't put explicit float variables
1920 /* ??? This should be checked after DECL_ARTIFICIAL, but tree-ssa
1921 propagates values across these stores, and it probably shouldn't. */
1922 if (flag_float_store && FLOAT_TYPE_P (TREE_TYPE (decl)))
1925 /* Compiler-generated temporaries can always go in registers. */
1926 if (DECL_ARTIFICIAL (decl))
1929 return (optimize || DECL_REGISTER (decl));
1932 /* Return true if TYPE should be passed by invisible reference. */
1935 pass_by_reference (CUMULATIVE_ARGS *ca, enum machine_mode mode,
1936 tree type, bool named_arg)
1940 /* If this type contains non-trivial constructors, then it is
1941 forbidden for the middle-end to create any new copies. */
1942 if (TREE_ADDRESSABLE (type))
1945 /* GCC post 3.4 passes *all* variable sized types by reference. */
1946 if (!TYPE_SIZE (type) || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
1950 return targetm.calls.pass_by_reference (ca, mode, type, named_arg);
1953 /* Return true if TYPE, which is passed by reference, should be callee
1954 copied instead of caller copied. */
1957 reference_callee_copied (CUMULATIVE_ARGS *ca, enum machine_mode mode,
1958 tree type, bool named_arg)
1960 if (type && TREE_ADDRESSABLE (type))
1962 return targetm.calls.callee_copies (ca, mode, type, named_arg);
1965 /* Structures to communicate between the subroutines of assign_parms.
1966 The first holds data persistent across all parameters, the second
1967 is cleared out for each parameter. */
1969 struct assign_parm_data_all
1971 CUMULATIVE_ARGS args_so_far;
1972 struct args_size stack_args_size;
1973 tree function_result_decl;
1975 rtx conversion_insns;
1976 HOST_WIDE_INT pretend_args_size;
1977 HOST_WIDE_INT extra_pretend_bytes;
1978 int reg_parm_stack_space;
1981 struct assign_parm_data_one
1987 enum machine_mode nominal_mode;
1988 enum machine_mode passed_mode;
1989 enum machine_mode promoted_mode;
1990 struct locate_and_pad_arg_data locate;
1992 BOOL_BITFIELD named_arg : 1;
1993 BOOL_BITFIELD last_named : 1;
1994 BOOL_BITFIELD passed_pointer : 1;
1995 BOOL_BITFIELD on_stack : 1;
1996 BOOL_BITFIELD loaded_in_reg : 1;
1999 /* A subroutine of assign_parms. Initialize ALL. */
2002 assign_parms_initialize_all (struct assign_parm_data_all *all)
2006 memset (all, 0, sizeof (*all));
2008 fntype = TREE_TYPE (current_function_decl);
2010 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
2011 INIT_CUMULATIVE_INCOMING_ARGS (all->args_so_far, fntype, NULL_RTX);
2013 INIT_CUMULATIVE_ARGS (all->args_so_far, fntype, NULL_RTX,
2014 current_function_decl, -1);
2017 #ifdef REG_PARM_STACK_SPACE
2018 all->reg_parm_stack_space = REG_PARM_STACK_SPACE (current_function_decl);
2022 /* If ARGS contains entries with complex types, split the entry into two
2023 entries of the component type. Return a new list of substitutions are
2024 needed, else the old list. */
2027 split_complex_args (tree args)
2031 /* Before allocating memory, check for the common case of no complex. */
2032 for (p = args; p; p = TREE_CHAIN (p))
2034 tree type = TREE_TYPE (p);
2035 if (TREE_CODE (type) == COMPLEX_TYPE
2036 && targetm.calls.split_complex_arg (type))
2042 args = copy_list (args);
2044 for (p = args; p; p = TREE_CHAIN (p))
2046 tree type = TREE_TYPE (p);
2047 if (TREE_CODE (type) == COMPLEX_TYPE
2048 && targetm.calls.split_complex_arg (type))
2051 tree subtype = TREE_TYPE (type);
2052 bool addressable = TREE_ADDRESSABLE (p);
2054 /* Rewrite the PARM_DECL's type with its component. */
2055 TREE_TYPE (p) = subtype;
2056 DECL_ARG_TYPE (p) = TREE_TYPE (DECL_ARG_TYPE (p));
2057 DECL_MODE (p) = VOIDmode;
2058 DECL_SIZE (p) = NULL;
2059 DECL_SIZE_UNIT (p) = NULL;
2060 /* If this arg must go in memory, put it in a pseudo here.
2061 We can't allow it to go in memory as per normal parms,
2062 because the usual place might not have the imag part
2063 adjacent to the real part. */
2064 DECL_ARTIFICIAL (p) = addressable;
2065 DECL_IGNORED_P (p) = addressable;
2066 TREE_ADDRESSABLE (p) = 0;
2069 /* Build a second synthetic decl. */
2070 decl = build_decl (PARM_DECL, NULL_TREE, subtype);
2071 DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (p);
2072 DECL_ARTIFICIAL (decl) = addressable;
2073 DECL_IGNORED_P (decl) = addressable;
2074 layout_decl (decl, 0);
2076 /* Splice it in; skip the new decl. */
2077 TREE_CHAIN (decl) = TREE_CHAIN (p);
2078 TREE_CHAIN (p) = decl;
2086 /* A subroutine of assign_parms. Adjust the parameter list to incorporate
2087 the hidden struct return argument, and (abi willing) complex args.
2088 Return the new parameter list. */
2091 assign_parms_augmented_arg_list (struct assign_parm_data_all *all)
2093 tree fndecl = current_function_decl;
2094 tree fntype = TREE_TYPE (fndecl);
2095 tree fnargs = DECL_ARGUMENTS (fndecl);
2097 /* If struct value address is treated as the first argument, make it so. */
2098 if (aggregate_value_p (DECL_RESULT (fndecl), fndecl)
2099 && ! current_function_returns_pcc_struct
2100 && targetm.calls.struct_value_rtx (TREE_TYPE (fndecl), 1) == 0)
2102 tree type = build_pointer_type (TREE_TYPE (fntype));
2105 decl = build_decl (PARM_DECL, NULL_TREE, type);
2106 DECL_ARG_TYPE (decl) = type;
2107 DECL_ARTIFICIAL (decl) = 1;
2109 TREE_CHAIN (decl) = fnargs;
2111 all->function_result_decl = decl;
2114 all->orig_fnargs = fnargs;
2116 /* If the target wants to split complex arguments into scalars, do so. */
2117 if (targetm.calls.split_complex_arg)
2118 fnargs = split_complex_args (fnargs);
2123 /* A subroutine of assign_parms. Examine PARM and pull out type and mode
2124 data for the parameter. Incorporate ABI specifics such as pass-by-
2125 reference and type promotion. */
2128 assign_parm_find_data_types (struct assign_parm_data_all *all, tree parm,
2129 struct assign_parm_data_one *data)
2131 tree nominal_type, passed_type;
2132 enum machine_mode nominal_mode, passed_mode, promoted_mode;
2134 memset (data, 0, sizeof (*data));
2136 /* Set LAST_NAMED if this is last named arg before last anonymous args. */
2137 if (current_function_stdarg)
2140 for (tem = TREE_CHAIN (parm); tem; tem = TREE_CHAIN (tem))
2141 if (DECL_NAME (tem))
2144 data->last_named = true;
2147 /* Set NAMED_ARG if this arg should be treated as a named arg. For
2148 most machines, if this is a varargs/stdarg function, then we treat
2149 the last named arg as if it were anonymous too. */
2150 if (targetm.calls.strict_argument_naming (&all->args_so_far))
2151 data->named_arg = 1;
2153 data->named_arg = !data->last_named;
2155 nominal_type = TREE_TYPE (parm);
2156 passed_type = DECL_ARG_TYPE (parm);
2158 /* Look out for errors propagating this far. Also, if the parameter's
2159 type is void then its value doesn't matter. */
2160 if (TREE_TYPE (parm) == error_mark_node
2161 /* This can happen after weird syntax errors
2162 or if an enum type is defined among the parms. */
2163 || TREE_CODE (parm) != PARM_DECL
2164 || passed_type == NULL
2165 || VOID_TYPE_P (nominal_type))
2167 nominal_type = passed_type = void_type_node;
2168 nominal_mode = passed_mode = promoted_mode = VOIDmode;
2172 /* Find mode of arg as it is passed, and mode of arg as it should be
2173 during execution of this function. */
2174 passed_mode = TYPE_MODE (passed_type);
2175 nominal_mode = TYPE_MODE (nominal_type);
2177 /* If the parm is to be passed as a transparent union, use the type of
2178 the first field for the tests below. We have already verified that
2179 the modes are the same. */
2180 if (DECL_TRANSPARENT_UNION (parm)
2181 || (TREE_CODE (passed_type) == UNION_TYPE
2182 && TYPE_TRANSPARENT_UNION (passed_type)))
2183 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
2185 /* See if this arg was passed by invisible reference. */
2186 if (pass_by_reference (&all->args_so_far, passed_mode,
2187 passed_type, data->named_arg))
2189 passed_type = nominal_type = build_pointer_type (passed_type);
2190 data->passed_pointer = true;
2191 passed_mode = nominal_mode = Pmode;
2194 /* Find mode as it is passed by the ABI. */
2195 promoted_mode = passed_mode;
2196 if (targetm.calls.promote_function_args (TREE_TYPE (current_function_decl)))
2198 int unsignedp = TYPE_UNSIGNED (passed_type);
2199 promoted_mode = promote_mode (passed_type, promoted_mode,
2204 data->nominal_type = nominal_type;
2205 data->passed_type = passed_type;
2206 data->nominal_mode = nominal_mode;
2207 data->passed_mode = passed_mode;
2208 data->promoted_mode = promoted_mode;
2211 /* A subroutine of assign_parms. Invoke setup_incoming_varargs. */
2214 assign_parms_setup_varargs (struct assign_parm_data_all *all,
2215 struct assign_parm_data_one *data, bool no_rtl)
2217 int varargs_pretend_bytes = 0;
2219 targetm.calls.setup_incoming_varargs (&all->args_so_far,
2220 data->promoted_mode,
2222 &varargs_pretend_bytes, no_rtl);
2224 /* If the back-end has requested extra stack space, record how much is
2225 needed. Do not change pretend_args_size otherwise since it may be
2226 nonzero from an earlier partial argument. */
2227 if (varargs_pretend_bytes > 0)
2228 all->pretend_args_size = varargs_pretend_bytes;
2231 /* A subroutine of assign_parms. Set DATA->ENTRY_PARM corresponding to
2232 the incoming location of the current parameter. */
2235 assign_parm_find_entry_rtl (struct assign_parm_data_all *all,
2236 struct assign_parm_data_one *data)
2238 HOST_WIDE_INT pretend_bytes = 0;
2242 if (data->promoted_mode == VOIDmode)
2244 data->entry_parm = data->stack_parm = const0_rtx;
2248 #ifdef FUNCTION_INCOMING_ARG
2249 entry_parm = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
2250 data->passed_type, data->named_arg);
2252 entry_parm = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
2253 data->passed_type, data->named_arg);
2256 if (entry_parm == 0)
2257 data->promoted_mode = data->passed_mode;
2259 /* Determine parm's home in the stack, in case it arrives in the stack
2260 or we should pretend it did. Compute the stack position and rtx where
2261 the argument arrives and its size.
2263 There is one complexity here: If this was a parameter that would
2264 have been passed in registers, but wasn't only because it is
2265 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
2266 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
2267 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of 0
2268 as it was the previous time. */
2269 in_regs = entry_parm != 0;
2270 #ifdef STACK_PARMS_IN_REG_PARM_AREA
2273 if (!in_regs && !data->named_arg)
2275 if (targetm.calls.pretend_outgoing_varargs_named (&all->args_so_far))
2278 #ifdef FUNCTION_INCOMING_ARG
2279 tem = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
2280 data->passed_type, true);
2282 tem = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
2283 data->passed_type, true);
2285 in_regs = tem != NULL;
2289 /* If this parameter was passed both in registers and in the stack, use
2290 the copy on the stack. */
2291 if (targetm.calls.must_pass_in_stack (data->promoted_mode,
2299 partial = targetm.calls.arg_partial_bytes (&all->args_so_far,
2300 data->promoted_mode,
2303 data->partial = partial;
2305 /* The caller might already have allocated stack space for the
2306 register parameters. */
2307 if (partial != 0 && all->reg_parm_stack_space == 0)
2309 /* Part of this argument is passed in registers and part
2310 is passed on the stack. Ask the prologue code to extend
2311 the stack part so that we can recreate the full value.
2313 PRETEND_BYTES is the size of the registers we need to store.
2314 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
2315 stack space that the prologue should allocate.
2317 Internally, gcc assumes that the argument pointer is aligned
2318 to STACK_BOUNDARY bits. This is used both for alignment
2319 optimizations (see init_emit) and to locate arguments that are
2320 aligned to more than PARM_BOUNDARY bits. We must preserve this
2321 invariant by rounding CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to
2322 a stack boundary. */
2324 /* We assume at most one partial arg, and it must be the first
2325 argument on the stack. */
2326 gcc_assert (!all->extra_pretend_bytes && !all->pretend_args_size);
2328 pretend_bytes = partial;
2329 all->pretend_args_size = CEIL_ROUND (pretend_bytes, STACK_BYTES);
2331 /* We want to align relative to the actual stack pointer, so
2332 don't include this in the stack size until later. */
2333 all->extra_pretend_bytes = all->pretend_args_size;
2337 locate_and_pad_parm (data->promoted_mode, data->passed_type, in_regs,
2338 entry_parm ? data->partial : 0, current_function_decl,
2339 &all->stack_args_size, &data->locate);
2341 /* Adjust offsets to include the pretend args. */
2342 pretend_bytes = all->extra_pretend_bytes - pretend_bytes;
2343 data->locate.slot_offset.constant += pretend_bytes;
2344 data->locate.offset.constant += pretend_bytes;
2346 data->entry_parm = entry_parm;
2349 /* A subroutine of assign_parms. If there is actually space on the stack
2350 for this parm, count it in stack_args_size and return true. */
2353 assign_parm_is_stack_parm (struct assign_parm_data_all *all,
2354 struct assign_parm_data_one *data)
2356 /* Trivially true if we've no incoming register. */
2357 if (data->entry_parm == NULL)
2359 /* Also true if we're partially in registers and partially not,
2360 since we've arranged to drop the entire argument on the stack. */
2361 else if (data->partial != 0)
2363 /* Also true if the target says that it's passed in both registers
2364 and on the stack. */
2365 else if (GET_CODE (data->entry_parm) == PARALLEL
2366 && XEXP (XVECEXP (data->entry_parm, 0, 0), 0) == NULL_RTX)
2368 /* Also true if the target says that there's stack allocated for
2369 all register parameters. */
2370 else if (all->reg_parm_stack_space > 0)
2372 /* Otherwise, no, this parameter has no ABI defined stack slot. */
2376 all->stack_args_size.constant += data->locate.size.constant;
2377 if (data->locate.size.var)
2378 ADD_PARM_SIZE (all->stack_args_size, data->locate.size.var);
2383 /* A subroutine of assign_parms. Given that this parameter is allocated
2384 stack space by the ABI, find it. */
2387 assign_parm_find_stack_rtl (tree parm, struct assign_parm_data_one *data)
2389 rtx offset_rtx, stack_parm;
2390 unsigned int align, boundary;
2392 /* If we're passing this arg using a reg, make its stack home the
2393 aligned stack slot. */
2394 if (data->entry_parm)
2395 offset_rtx = ARGS_SIZE_RTX (data->locate.slot_offset);
2397 offset_rtx = ARGS_SIZE_RTX (data->locate.offset);
2399 stack_parm = current_function_internal_arg_pointer;
2400 if (offset_rtx != const0_rtx)
2401 stack_parm = gen_rtx_PLUS (Pmode, stack_parm, offset_rtx);
2402 stack_parm = gen_rtx_MEM (data->promoted_mode, stack_parm);
2404 set_mem_attributes (stack_parm, parm, 1);
2406 boundary = FUNCTION_ARG_BOUNDARY (data->promoted_mode, data->passed_type);
2409 /* If we're padding upward, we know that the alignment of the slot
2410 is FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
2411 intentionally forcing upward padding. Otherwise we have to come
2412 up with a guess at the alignment based on OFFSET_RTX. */
2413 if (data->locate.where_pad == upward || data->entry_parm)
2415 else if (GET_CODE (offset_rtx) == CONST_INT)
2417 align = INTVAL (offset_rtx) * BITS_PER_UNIT | boundary;
2418 align = align & -align;
2421 set_mem_align (stack_parm, align);
2423 if (data->entry_parm)
2424 set_reg_attrs_for_parm (data->entry_parm, stack_parm);
2426 data->stack_parm = stack_parm;
2429 /* A subroutine of assign_parms. Adjust DATA->ENTRY_RTL such that it's
2430 always valid and contiguous. */
2433 assign_parm_adjust_entry_rtl (struct assign_parm_data_one *data)
2435 rtx entry_parm = data->entry_parm;
2436 rtx stack_parm = data->stack_parm;
2438 /* If this parm was passed part in regs and part in memory, pretend it
2439 arrived entirely in memory by pushing the register-part onto the stack.
2440 In the special case of a DImode or DFmode that is split, we could put
2441 it together in a pseudoreg directly, but for now that's not worth
2443 if (data->partial != 0)
2445 /* Handle calls that pass values in multiple non-contiguous
2446 locations. The Irix 6 ABI has examples of this. */
2447 if (GET_CODE (entry_parm) == PARALLEL)
2448 emit_group_store (validize_mem (stack_parm), entry_parm,
2450 int_size_in_bytes (data->passed_type));
2453 gcc_assert (data->partial % UNITS_PER_WORD == 0);
2454 move_block_from_reg (REGNO (entry_parm), validize_mem (stack_parm),
2455 data->partial / UNITS_PER_WORD);
2458 entry_parm = stack_parm;
2461 /* If we didn't decide this parm came in a register, by default it came
2463 else if (entry_parm == NULL)
2464 entry_parm = stack_parm;
2466 /* When an argument is passed in multiple locations, we can't make use
2467 of this information, but we can save some copying if the whole argument
2468 is passed in a single register. */
2469 else if (GET_CODE (entry_parm) == PARALLEL
2470 && data->nominal_mode != BLKmode
2471 && data->passed_mode != BLKmode)
2473 size_t i, len = XVECLEN (entry_parm, 0);
2475 for (i = 0; i < len; i++)
2476 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
2477 && REG_P (XEXP (XVECEXP (entry_parm, 0, i), 0))
2478 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
2479 == data->passed_mode)
2480 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
2482 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
2487 data->entry_parm = entry_parm;
2490 /* A subroutine of assign_parms. Adjust DATA->STACK_RTL such that it's
2491 always valid and properly aligned. */
2495 assign_parm_adjust_stack_rtl (struct assign_parm_data_one *data)
2497 rtx stack_parm = data->stack_parm;
2499 /* If we can't trust the parm stack slot to be aligned enough for its
2500 ultimate type, don't use that slot after entry. We'll make another
2501 stack slot, if we need one. */
2502 if (STRICT_ALIGNMENT && stack_parm
2503 && GET_MODE_ALIGNMENT (data->nominal_mode) > MEM_ALIGN (stack_parm))
2506 /* If parm was passed in memory, and we need to convert it on entry,
2507 don't store it back in that same slot. */
2508 else if (data->entry_parm == stack_parm
2509 && data->nominal_mode != BLKmode
2510 && data->nominal_mode != data->passed_mode)
2513 data->stack_parm = stack_parm;
2516 /* A subroutine of assign_parms. Return true if the current parameter
2517 should be stored as a BLKmode in the current frame. */
2520 assign_parm_setup_block_p (struct assign_parm_data_one *data)
2522 if (data->nominal_mode == BLKmode)
2524 if (GET_CODE (data->entry_parm) == PARALLEL)
2527 #ifdef BLOCK_REG_PADDING
2528 /* Only assign_parm_setup_block knows how to deal with register arguments
2529 that are padded at the least significant end. */
2530 if (REG_P (data->entry_parm)
2531 && GET_MODE_SIZE (data->promoted_mode) < UNITS_PER_WORD
2532 && (BLOCK_REG_PADDING (data->passed_mode, data->passed_type, 1)
2533 == (BYTES_BIG_ENDIAN ? upward : downward)))
2540 /* A subroutine of assign_parms. Arrange for the parameter to be
2541 present and valid in DATA->STACK_RTL. */
2544 assign_parm_setup_block (struct assign_parm_data_all *all,
2545 tree parm, struct assign_parm_data_one *data)
2547 rtx entry_parm = data->entry_parm;
2548 rtx stack_parm = data->stack_parm;
2550 if (GET_CODE (entry_parm) == PARALLEL)
2551 entry_parm = emit_group_move_into_temps (entry_parm);
2553 /* If we've a non-block object that's nevertheless passed in parts,
2554 reconstitute it in register operations rather than on the stack. */
2555 if (GET_CODE (entry_parm) == PARALLEL
2556 && data->nominal_mode != BLKmode
2557 && XVECLEN (entry_parm, 0) > 1
2558 && use_register_for_decl (parm))
2560 rtx parmreg = gen_reg_rtx (data->nominal_mode);
2562 push_to_sequence (all->conversion_insns);
2564 /* For values returned in multiple registers, handle possible
2565 incompatible calls to emit_group_store.
2567 For example, the following would be invalid, and would have to
2568 be fixed by the conditional below:
2570 emit_group_store ((reg:SF), (parallel:DF))
2571 emit_group_store ((reg:SI), (parallel:DI))
2573 An example of this are doubles in e500 v2:
2574 (parallel:DF (expr_list (reg:SI) (const_int 0))
2575 (expr_list (reg:SI) (const_int 4))). */
2576 if (data->nominal_mode != data->passed_mode)
2578 rtx t = gen_reg_rtx (GET_MODE (entry_parm));
2579 emit_group_store (t, entry_parm, NULL_TREE,
2580 GET_MODE_SIZE (GET_MODE (entry_parm)));
2581 convert_move (parmreg, t, 0);
2584 emit_group_store (parmreg, entry_parm, data->nominal_type,
2585 int_size_in_bytes (data->nominal_type));
2587 all->conversion_insns = get_insns ();
2590 SET_DECL_RTL (parm, parmreg);
2594 /* If a BLKmode arrives in registers, copy it to a stack slot. Handle
2595 calls that pass values in multiple non-contiguous locations. */
2596 if (REG_P (entry_parm) || GET_CODE (entry_parm) == PARALLEL)
2598 HOST_WIDE_INT size = int_size_in_bytes (data->passed_type);
2599 HOST_WIDE_INT size_stored = CEIL_ROUND (size, UNITS_PER_WORD);
2602 /* Note that we will be storing an integral number of words.
2603 So we have to be careful to ensure that we allocate an
2604 integral number of words. We do this below in the
2605 assign_stack_local if space was not allocated in the argument
2606 list. If it was, this will not work if PARM_BOUNDARY is not
2607 a multiple of BITS_PER_WORD. It isn't clear how to fix this
2608 if it becomes a problem. Exception is when BLKmode arrives
2609 with arguments not conforming to word_mode. */
2611 if (stack_parm == 0)
2613 stack_parm = assign_stack_local (BLKmode, size_stored, 0);
2614 data->stack_parm = stack_parm;
2615 PUT_MODE (stack_parm, GET_MODE (entry_parm));
2616 set_mem_attributes (stack_parm, parm, 1);
2618 else if (GET_CODE (entry_parm) == PARALLEL)
2621 gcc_assert (!size || !(PARM_BOUNDARY % BITS_PER_WORD));
2623 mem = validize_mem (stack_parm);
2625 /* Handle values in multiple non-contiguous locations. */
2626 if (GET_CODE (entry_parm) == PARALLEL)
2628 push_to_sequence (all->conversion_insns);
2629 emit_group_store (mem, entry_parm, data->passed_type, size);
2630 all->conversion_insns = get_insns ();
2637 /* If SIZE is that of a mode no bigger than a word, just use
2638 that mode's store operation. */
2639 else if (size <= UNITS_PER_WORD)
2641 enum machine_mode mode
2642 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
2645 #ifdef BLOCK_REG_PADDING
2646 && (size == UNITS_PER_WORD
2647 || (BLOCK_REG_PADDING (mode, data->passed_type, 1)
2648 != (BYTES_BIG_ENDIAN ? upward : downward)))
2652 rtx reg = gen_rtx_REG (mode, REGNO (entry_parm));
2653 emit_move_insn (change_address (mem, mode, 0), reg);
2656 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
2657 machine must be aligned to the left before storing
2658 to memory. Note that the previous test doesn't
2659 handle all cases (e.g. SIZE == 3). */
2660 else if (size != UNITS_PER_WORD
2661 #ifdef BLOCK_REG_PADDING
2662 && (BLOCK_REG_PADDING (mode, data->passed_type, 1)
2670 int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
2671 rtx reg = gen_rtx_REG (word_mode, REGNO (entry_parm));
2673 x = expand_shift (LSHIFT_EXPR, word_mode, reg,
2674 build_int_cst (NULL_TREE, by),
2676 tem = change_address (mem, word_mode, 0);
2677 emit_move_insn (tem, x);
2680 move_block_from_reg (REGNO (entry_parm), mem,
2681 size_stored / UNITS_PER_WORD);
2684 move_block_from_reg (REGNO (entry_parm), mem,
2685 size_stored / UNITS_PER_WORD);
2688 SET_DECL_RTL (parm, stack_parm);
2691 /* A subroutine of assign_parms. Allocate a pseudo to hold the current
2692 parameter. Get it there. Perform all ABI specified conversions. */
2695 assign_parm_setup_reg (struct assign_parm_data_all *all, tree parm,
2696 struct assign_parm_data_one *data)
2699 enum machine_mode promoted_nominal_mode;
2700 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (parm));
2701 bool did_conversion = false;
2703 /* Store the parm in a pseudoregister during the function, but we may
2704 need to do it in a wider mode. */
2706 promoted_nominal_mode
2707 = promote_mode (data->nominal_type, data->nominal_mode, &unsignedp, 0);
2709 parmreg = gen_reg_rtx (promoted_nominal_mode);
2711 if (!DECL_ARTIFICIAL (parm))
2712 mark_user_reg (parmreg);
2714 /* If this was an item that we received a pointer to,
2715 set DECL_RTL appropriately. */
2716 if (data->passed_pointer)
2718 rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data->passed_type)), parmreg);
2719 set_mem_attributes (x, parm, 1);
2720 SET_DECL_RTL (parm, x);
2723 SET_DECL_RTL (parm, parmreg);
2725 /* Copy the value into the register. */
2726 if (data->nominal_mode != data->passed_mode
2727 || promoted_nominal_mode != data->promoted_mode)
2731 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
2732 mode, by the caller. We now have to convert it to
2733 NOMINAL_MODE, if different. However, PARMREG may be in
2734 a different mode than NOMINAL_MODE if it is being stored
2737 If ENTRY_PARM is a hard register, it might be in a register
2738 not valid for operating in its mode (e.g., an odd-numbered
2739 register for a DFmode). In that case, moves are the only
2740 thing valid, so we can't do a convert from there. This
2741 occurs when the calling sequence allow such misaligned
2744 In addition, the conversion may involve a call, which could
2745 clobber parameters which haven't been copied to pseudo
2746 registers yet. Therefore, we must first copy the parm to
2747 a pseudo reg here, and save the conversion until after all
2748 parameters have been moved. */
2750 rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
2752 emit_move_insn (tempreg, validize_mem (data->entry_parm));
2754 push_to_sequence (all->conversion_insns);
2755 tempreg = convert_to_mode (data->nominal_mode, tempreg, unsignedp);
2757 if (GET_CODE (tempreg) == SUBREG
2758 && GET_MODE (tempreg) == data->nominal_mode
2759 && REG_P (SUBREG_REG (tempreg))
2760 && data->nominal_mode == data->passed_mode
2761 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (data->entry_parm)
2762 && GET_MODE_SIZE (GET_MODE (tempreg))
2763 < GET_MODE_SIZE (GET_MODE (data->entry_parm)))
2765 /* The argument is already sign/zero extended, so note it
2767 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
2768 SUBREG_PROMOTED_UNSIGNED_SET (tempreg, unsignedp);
2771 /* TREE_USED gets set erroneously during expand_assignment. */
2772 save_tree_used = TREE_USED (parm);
2773 expand_assignment (parm, make_tree (data->nominal_type, tempreg));
2774 TREE_USED (parm) = save_tree_used;
2775 all->conversion_insns = get_insns ();
2778 did_conversion = true;
2781 emit_move_insn (parmreg, validize_mem (data->entry_parm));
2783 /* If we were passed a pointer but the actual value can safely live
2784 in a register, put it in one. */
2785 if (data->passed_pointer
2786 && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
2787 /* If by-reference argument was promoted, demote it. */
2788 && (TYPE_MODE (TREE_TYPE (parm)) != GET_MODE (DECL_RTL (parm))
2789 || use_register_for_decl (parm)))
2791 /* We can't use nominal_mode, because it will have been set to
2792 Pmode above. We must use the actual mode of the parm. */
2793 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
2794 mark_user_reg (parmreg);
2796 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
2798 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
2799 int unsigned_p = TYPE_UNSIGNED (TREE_TYPE (parm));
2801 push_to_sequence (all->conversion_insns);
2802 emit_move_insn (tempreg, DECL_RTL (parm));
2803 tempreg = convert_to_mode (GET_MODE (parmreg), tempreg, unsigned_p);
2804 emit_move_insn (parmreg, tempreg);
2805 all->conversion_insns = get_insns ();
2808 did_conversion = true;
2811 emit_move_insn (parmreg, DECL_RTL (parm));
2813 SET_DECL_RTL (parm, parmreg);
2815 /* STACK_PARM is the pointer, not the parm, and PARMREG is
2817 data->stack_parm = NULL;
2820 /* Mark the register as eliminable if we did no conversion and it was
2821 copied from memory at a fixed offset, and the arg pointer was not
2822 copied to a pseudo-reg. If the arg pointer is a pseudo reg or the
2823 offset formed an invalid address, such memory-equivalences as we
2824 make here would screw up life analysis for it. */
2825 if (data->nominal_mode == data->passed_mode
2827 && data->stack_parm != 0
2828 && MEM_P (data->stack_parm)
2829 && data->locate.offset.var == 0
2830 && reg_mentioned_p (virtual_incoming_args_rtx,
2831 XEXP (data->stack_parm, 0)))
2833 rtx linsn = get_last_insn ();
2836 /* Mark complex types separately. */
2837 if (GET_CODE (parmreg) == CONCAT)
2839 enum machine_mode submode
2840 = GET_MODE_INNER (GET_MODE (parmreg));
2841 int regnor = REGNO (XEXP (parmreg, 0));
2842 int regnoi = REGNO (XEXP (parmreg, 1));
2843 rtx stackr = adjust_address_nv (data->stack_parm, submode, 0);
2844 rtx stacki = adjust_address_nv (data->stack_parm, submode,
2845 GET_MODE_SIZE (submode));
2847 /* Scan backwards for the set of the real and
2849 for (sinsn = linsn; sinsn != 0;
2850 sinsn = prev_nonnote_insn (sinsn))
2852 set = single_set (sinsn);
2856 if (SET_DEST (set) == regno_reg_rtx [regnoi])
2858 = gen_rtx_EXPR_LIST (REG_EQUIV, stacki,
2860 else if (SET_DEST (set) == regno_reg_rtx [regnor])
2862 = gen_rtx_EXPR_LIST (REG_EQUIV, stackr,
2866 else if ((set = single_set (linsn)) != 0
2867 && SET_DEST (set) == parmreg)
2869 = gen_rtx_EXPR_LIST (REG_EQUIV,
2870 data->stack_parm, REG_NOTES (linsn));
2873 /* For pointer data type, suggest pointer register. */
2874 if (POINTER_TYPE_P (TREE_TYPE (parm)))
2875 mark_reg_pointer (parmreg,
2876 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
2879 /* A subroutine of assign_parms. Allocate stack space to hold the current
2880 parameter. Get it there. Perform all ABI specified conversions. */
2883 assign_parm_setup_stack (struct assign_parm_data_all *all, tree parm,
2884 struct assign_parm_data_one *data)
2886 /* Value must be stored in the stack slot STACK_PARM during function
2889 if (data->promoted_mode != data->nominal_mode)
2891 /* Conversion is required. */
2892 rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
2894 emit_move_insn (tempreg, validize_mem (data->entry_parm));
2896 push_to_sequence (all->conversion_insns);
2897 data->entry_parm = convert_to_mode (data->nominal_mode, tempreg,
2898 TYPE_UNSIGNED (TREE_TYPE (parm)));
2900 if (data->stack_parm)
2901 /* ??? This may need a big-endian conversion on sparc64. */
2903 = adjust_address (data->stack_parm, data->nominal_mode, 0);
2905 all->conversion_insns = get_insns ();
2909 if (data->entry_parm != data->stack_parm)
2911 if (data->stack_parm == 0)
2914 = assign_stack_local (GET_MODE (data->entry_parm),
2915 GET_MODE_SIZE (GET_MODE (data->entry_parm)),
2917 set_mem_attributes (data->stack_parm, parm, 1);
2920 if (data->promoted_mode != data->nominal_mode)
2922 push_to_sequence (all->conversion_insns);
2923 emit_move_insn (validize_mem (data->stack_parm),
2924 validize_mem (data->entry_parm));
2925 all->conversion_insns = get_insns ();
2929 emit_move_insn (validize_mem (data->stack_parm),
2930 validize_mem (data->entry_parm));
2933 SET_DECL_RTL (parm, data->stack_parm);
2936 /* A subroutine of assign_parms. If the ABI splits complex arguments, then
2937 undo the frobbing that we did in assign_parms_augmented_arg_list. */
2940 assign_parms_unsplit_complex (struct assign_parm_data_all *all, tree fnargs)
2943 tree orig_fnargs = all->orig_fnargs;
2945 for (parm = orig_fnargs; parm; parm = TREE_CHAIN (parm))
2947 if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
2948 && targetm.calls.split_complex_arg (TREE_TYPE (parm)))
2950 rtx tmp, real, imag;
2951 enum machine_mode inner = GET_MODE_INNER (DECL_MODE (parm));
2953 real = DECL_RTL (fnargs);
2954 imag = DECL_RTL (TREE_CHAIN (fnargs));
2955 if (inner != GET_MODE (real))
2957 real = gen_lowpart_SUBREG (inner, real);
2958 imag = gen_lowpart_SUBREG (inner, imag);
2961 if (TREE_ADDRESSABLE (parm))
2964 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (parm));
2966 /* split_complex_arg put the real and imag parts in
2967 pseudos. Move them to memory. */
2968 tmp = assign_stack_local (DECL_MODE (parm), size, 0);
2969 set_mem_attributes (tmp, parm, 1);
2970 rmem = adjust_address_nv (tmp, inner, 0);
2971 imem = adjust_address_nv (tmp, inner, GET_MODE_SIZE (inner));
2972 push_to_sequence (all->conversion_insns);
2973 emit_move_insn (rmem, real);
2974 emit_move_insn (imem, imag);
2975 all->conversion_insns = get_insns ();
2979 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
2980 SET_DECL_RTL (parm, tmp);
2982 real = DECL_INCOMING_RTL (fnargs);
2983 imag = DECL_INCOMING_RTL (TREE_CHAIN (fnargs));
2984 if (inner != GET_MODE (real))
2986 real = gen_lowpart_SUBREG (inner, real);
2987 imag = gen_lowpart_SUBREG (inner, imag);
2989 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
2990 set_decl_incoming_rtl (parm, tmp);
2991 fnargs = TREE_CHAIN (fnargs);
2995 SET_DECL_RTL (parm, DECL_RTL (fnargs));
2996 set_decl_incoming_rtl (parm, DECL_INCOMING_RTL (fnargs));
2998 /* Set MEM_EXPR to the original decl, i.e. to PARM,
2999 instead of the copy of decl, i.e. FNARGS. */
3000 if (DECL_INCOMING_RTL (parm) && MEM_P (DECL_INCOMING_RTL (parm)))
3001 set_mem_expr (DECL_INCOMING_RTL (parm), parm);
3004 fnargs = TREE_CHAIN (fnargs);
3008 /* Assign RTL expressions to the function's parameters. This may involve
3009 copying them into registers and using those registers as the DECL_RTL. */
3012 assign_parms (tree fndecl)
3014 struct assign_parm_data_all all;
3016 rtx internal_arg_pointer;
3017 int varargs_setup = 0;
3019 /* If the reg that the virtual arg pointer will be translated into is
3020 not a fixed reg or is the stack pointer, make a copy of the virtual
3021 arg pointer, and address parms via the copy. The frame pointer is
3022 considered fixed even though it is not marked as such.
3024 The second time through, simply use ap to avoid generating rtx. */
3026 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
3027 || ! (fixed_regs[ARG_POINTER_REGNUM]
3028 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
3029 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
3031 internal_arg_pointer = virtual_incoming_args_rtx;
3032 current_function_internal_arg_pointer = internal_arg_pointer;
3034 assign_parms_initialize_all (&all);
3035 fnargs = assign_parms_augmented_arg_list (&all);
3037 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
3039 struct assign_parm_data_one data;
3041 /* Extract the type of PARM; adjust it according to ABI. */
3042 assign_parm_find_data_types (&all, parm, &data);
3044 /* Early out for errors and void parameters. */
3045 if (data.passed_mode == VOIDmode)
3047 SET_DECL_RTL (parm, const0_rtx);
3048 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
3052 /* Handle stdargs. LAST_NAMED is a slight mis-nomer; it's also true
3053 for the unnamed dummy argument following the last named argument.
3054 See ABI silliness wrt strict_argument_naming and NAMED_ARG. So
3055 we only want to do this when we get to the actual last named
3056 argument, which will be the first time LAST_NAMED gets set. */
3057 if (data.last_named && !varargs_setup)
3059 varargs_setup = true;
3060 assign_parms_setup_varargs (&all, &data, false);
3063 /* Find out where the parameter arrives in this function. */
3064 assign_parm_find_entry_rtl (&all, &data);
3066 /* Find out where stack space for this parameter might be. */
3067 if (assign_parm_is_stack_parm (&all, &data))
3069 assign_parm_find_stack_rtl (parm, &data);
3070 assign_parm_adjust_entry_rtl (&data);
3073 /* Record permanently how this parm was passed. */
3074 set_decl_incoming_rtl (parm, data.entry_parm);
3076 /* Update info on where next arg arrives in registers. */
3077 FUNCTION_ARG_ADVANCE (all.args_so_far, data.promoted_mode,
3078 data.passed_type, data.named_arg);
3080 assign_parm_adjust_stack_rtl (&data);
3082 if (assign_parm_setup_block_p (&data))
3083 assign_parm_setup_block (&all, parm, &data);
3084 else if (data.passed_pointer || use_register_for_decl (parm))
3085 assign_parm_setup_reg (&all, parm, &data);
3087 assign_parm_setup_stack (&all, parm, &data);
3090 if (targetm.calls.split_complex_arg && fnargs != all.orig_fnargs)
3091 assign_parms_unsplit_complex (&all, fnargs);
3093 /* Output all parameter conversion instructions (possibly including calls)
3094 now that all parameters have been copied out of hard registers. */
3095 emit_insn (all.conversion_insns);
3097 /* If we are receiving a struct value address as the first argument, set up
3098 the RTL for the function result. As this might require code to convert
3099 the transmitted address to Pmode, we do this here to ensure that possible
3100 preliminary conversions of the address have been emitted already. */
3101 if (all.function_result_decl)
3103 tree result = DECL_RESULT (current_function_decl);
3104 rtx addr = DECL_RTL (all.function_result_decl);
3107 if (DECL_BY_REFERENCE (result))
3111 addr = convert_memory_address (Pmode, addr);
3112 x = gen_rtx_MEM (DECL_MODE (result), addr);
3113 set_mem_attributes (x, result, 1);
3115 SET_DECL_RTL (result, x);
3118 /* We have aligned all the args, so add space for the pretend args. */
3119 current_function_pretend_args_size = all.pretend_args_size;
3120 all.stack_args_size.constant += all.extra_pretend_bytes;
3121 current_function_args_size = all.stack_args_size.constant;
3123 /* Adjust function incoming argument size for alignment and
3126 #ifdef REG_PARM_STACK_SPACE
3127 current_function_args_size = MAX (current_function_args_size,
3128 REG_PARM_STACK_SPACE (fndecl));
3131 current_function_args_size
3132 = ((current_function_args_size + STACK_BYTES - 1)
3133 / STACK_BYTES) * STACK_BYTES;
3135 #ifdef ARGS_GROW_DOWNWARD
3136 current_function_arg_offset_rtx
3137 = (all.stack_args_size.var == 0 ? GEN_INT (-all.stack_args_size.constant)
3138 : expand_expr (size_diffop (all.stack_args_size.var,
3139 size_int (-all.stack_args_size.constant)),
3140 NULL_RTX, VOIDmode, 0));
3142 current_function_arg_offset_rtx = ARGS_SIZE_RTX (all.stack_args_size);
3145 /* See how many bytes, if any, of its args a function should try to pop
3148 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
3149 current_function_args_size);
3151 /* For stdarg.h function, save info about
3152 regs and stack space used by the named args. */
3154 current_function_args_info = all.args_so_far;
3156 /* Set the rtx used for the function return value. Put this in its
3157 own variable so any optimizers that need this information don't have
3158 to include tree.h. Do this here so it gets done when an inlined
3159 function gets output. */
3161 current_function_return_rtx
3162 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
3163 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
3165 /* If scalar return value was computed in a pseudo-reg, or was a named
3166 return value that got dumped to the stack, copy that to the hard
3168 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
3170 tree decl_result = DECL_RESULT (fndecl);
3171 rtx decl_rtl = DECL_RTL (decl_result);
3173 if (REG_P (decl_rtl)
3174 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
3175 : DECL_REGISTER (decl_result))
3179 #ifdef FUNCTION_OUTGOING_VALUE
3180 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
3183 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
3186 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
3187 /* The delay slot scheduler assumes that current_function_return_rtx
3188 holds the hard register containing the return value, not a
3189 temporary pseudo. */
3190 current_function_return_rtx = real_decl_rtl;
3195 /* A subroutine of gimplify_parameters, invoked via walk_tree.
3196 For all seen types, gimplify their sizes. */
3199 gimplify_parm_type (tree *tp, int *walk_subtrees, void *data)
3206 if (POINTER_TYPE_P (t))
3208 else if (TYPE_SIZE (t) && !TREE_CONSTANT (TYPE_SIZE (t))
3209 && !TYPE_SIZES_GIMPLIFIED (t))
3211 gimplify_type_sizes (t, (tree *) data);
3219 /* Gimplify the parameter list for current_function_decl. This involves
3220 evaluating SAVE_EXPRs of variable sized parameters and generating code
3221 to implement callee-copies reference parameters. Returns a list of
3222 statements to add to the beginning of the function, or NULL if nothing
3226 gimplify_parameters (void)
3228 struct assign_parm_data_all all;
3229 tree fnargs, parm, stmts = NULL;
3231 assign_parms_initialize_all (&all);
3232 fnargs = assign_parms_augmented_arg_list (&all);
3234 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
3236 struct assign_parm_data_one data;
3238 /* Extract the type of PARM; adjust it according to ABI. */
3239 assign_parm_find_data_types (&all, parm, &data);
3241 /* Early out for errors and void parameters. */
3242 if (data.passed_mode == VOIDmode || DECL_SIZE (parm) == NULL)
3245 /* Update info on where next arg arrives in registers. */
3246 FUNCTION_ARG_ADVANCE (all.args_so_far, data.promoted_mode,
3247 data.passed_type, data.named_arg);
3249 /* ??? Once upon a time variable_size stuffed parameter list
3250 SAVE_EXPRs (amongst others) onto a pending sizes list. This
3251 turned out to be less than manageable in the gimple world.
3252 Now we have to hunt them down ourselves. */
3253 walk_tree_without_duplicates (&data.passed_type,
3254 gimplify_parm_type, &stmts);
3256 if (!TREE_CONSTANT (DECL_SIZE (parm)))
3258 gimplify_one_sizepos (&DECL_SIZE (parm), &stmts);
3259 gimplify_one_sizepos (&DECL_SIZE_UNIT (parm), &stmts);
3262 if (data.passed_pointer)
3264 tree type = TREE_TYPE (data.passed_type);
3265 if (reference_callee_copied (&all.args_so_far, TYPE_MODE (type),
3266 type, data.named_arg))
3270 /* For constant sized objects, this is trivial; for
3271 variable-sized objects, we have to play games. */
3272 if (TREE_CONSTANT (DECL_SIZE (parm)))
3274 local = create_tmp_var (type, get_name (parm));
3275 DECL_IGNORED_P (local) = 0;
3279 tree ptr_type, addr, args;
3281 ptr_type = build_pointer_type (type);
3282 addr = create_tmp_var (ptr_type, get_name (parm));
3283 DECL_IGNORED_P (addr) = 0;
3284 local = build_fold_indirect_ref (addr);
3286 args = tree_cons (NULL, DECL_SIZE_UNIT (parm), NULL);
3287 t = built_in_decls[BUILT_IN_ALLOCA];
3288 t = build_function_call_expr (t, args);
3289 t = fold_convert (ptr_type, t);
3290 t = build2 (MODIFY_EXPR, void_type_node, addr, t);
3291 gimplify_and_add (t, &stmts);
3294 t = build2 (MODIFY_EXPR, void_type_node, local, parm);
3295 gimplify_and_add (t, &stmts);
3297 DECL_VALUE_EXPR (parm) = local;
3305 /* Indicate whether REGNO is an incoming argument to the current function
3306 that was promoted to a wider mode. If so, return the RTX for the
3307 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
3308 that REGNO is promoted from and whether the promotion was signed or
3312 promoted_input_arg (unsigned int regno, enum machine_mode *pmode, int *punsignedp)
3316 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
3317 arg = TREE_CHAIN (arg))
3318 if (REG_P (DECL_INCOMING_RTL (arg))
3319 && REGNO (DECL_INCOMING_RTL (arg)) == regno
3320 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
3322 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
3323 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (arg));
3325 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
3326 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
3327 && mode != DECL_MODE (arg))
3329 *pmode = DECL_MODE (arg);
3330 *punsignedp = unsignedp;
3331 return DECL_INCOMING_RTL (arg);
3339 /* Compute the size and offset from the start of the stacked arguments for a
3340 parm passed in mode PASSED_MODE and with type TYPE.
3342 INITIAL_OFFSET_PTR points to the current offset into the stacked
3345 The starting offset and size for this parm are returned in
3346 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
3347 nonzero, the offset is that of stack slot, which is returned in
3348 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
3349 padding required from the initial offset ptr to the stack slot.
3351 IN_REGS is nonzero if the argument will be passed in registers. It will
3352 never be set if REG_PARM_STACK_SPACE is not defined.
3354 FNDECL is the function in which the argument was defined.
3356 There are two types of rounding that are done. The first, controlled by
3357 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
3358 list to be aligned to the specific boundary (in bits). This rounding
3359 affects the initial and starting offsets, but not the argument size.
3361 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
3362 optionally rounds the size of the parm to PARM_BOUNDARY. The
3363 initial offset is not affected by this rounding, while the size always
3364 is and the starting offset may be. */
3366 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
3367 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
3368 callers pass in the total size of args so far as
3369 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
3372 locate_and_pad_parm (enum machine_mode passed_mode, tree type, int in_regs,
3373 int partial, tree fndecl ATTRIBUTE_UNUSED,
3374 struct args_size *initial_offset_ptr,
3375 struct locate_and_pad_arg_data *locate)
3378 enum direction where_pad;
3380 int reg_parm_stack_space = 0;
3381 int part_size_in_regs;
3383 #ifdef REG_PARM_STACK_SPACE
3384 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
3386 /* If we have found a stack parm before we reach the end of the
3387 area reserved for registers, skip that area. */
3390 if (reg_parm_stack_space > 0)
3392 if (initial_offset_ptr->var)
3394 initial_offset_ptr->var
3395 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
3396 ssize_int (reg_parm_stack_space));
3397 initial_offset_ptr->constant = 0;
3399 else if (initial_offset_ptr->constant < reg_parm_stack_space)
3400 initial_offset_ptr->constant = reg_parm_stack_space;
3403 #endif /* REG_PARM_STACK_SPACE */
3405 part_size_in_regs = (reg_parm_stack_space == 0 ? partial : 0);
3408 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
3409 where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
3410 boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
3411 locate->where_pad = where_pad;
3413 #ifdef ARGS_GROW_DOWNWARD
3414 locate->slot_offset.constant = -initial_offset_ptr->constant;
3415 if (initial_offset_ptr->var)
3416 locate->slot_offset.var = size_binop (MINUS_EXPR, ssize_int (0),
3417 initial_offset_ptr->var);
3421 if (where_pad != none
3422 && (!host_integerp (sizetree, 1)
3423 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
3424 s2 = round_up (s2, PARM_BOUNDARY / BITS_PER_UNIT);
3425 SUB_PARM_SIZE (locate->slot_offset, s2);
3428 locate->slot_offset.constant += part_size_in_regs;
3431 #ifdef REG_PARM_STACK_SPACE
3432 || REG_PARM_STACK_SPACE (fndecl) > 0
3435 pad_to_arg_alignment (&locate->slot_offset, boundary,
3436 &locate->alignment_pad);
3438 locate->size.constant = (-initial_offset_ptr->constant
3439 - locate->slot_offset.constant);
3440 if (initial_offset_ptr->var)
3441 locate->size.var = size_binop (MINUS_EXPR,
3442 size_binop (MINUS_EXPR,
3444 initial_offset_ptr->var),
3445 locate->slot_offset.var);
3447 /* Pad_below needs the pre-rounded size to know how much to pad
3449 locate->offset = locate->slot_offset;
3450 if (where_pad == downward)
3451 pad_below (&locate->offset, passed_mode, sizetree);
3453 #else /* !ARGS_GROW_DOWNWARD */
3455 #ifdef REG_PARM_STACK_SPACE
3456 || REG_PARM_STACK_SPACE (fndecl) > 0
3459 pad_to_arg_alignment (initial_offset_ptr, boundary,
3460 &locate->alignment_pad);
3461 locate->slot_offset = *initial_offset_ptr;
3463 #ifdef PUSH_ROUNDING
3464 if (passed_mode != BLKmode)
3465 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
3468 /* Pad_below needs the pre-rounded size to know how much to pad below
3469 so this must be done before rounding up. */
3470 locate->offset = locate->slot_offset;
3471 if (where_pad == downward)
3472 pad_below (&locate->offset, passed_mode, sizetree);
3474 if (where_pad != none
3475 && (!host_integerp (sizetree, 1)
3476 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
3477 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
3479 ADD_PARM_SIZE (locate->size, sizetree);
3481 locate->size.constant -= part_size_in_regs;
3482 #endif /* ARGS_GROW_DOWNWARD */
3485 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
3486 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
3489 pad_to_arg_alignment (struct args_size *offset_ptr, int boundary,
3490 struct args_size *alignment_pad)
3492 tree save_var = NULL_TREE;
3493 HOST_WIDE_INT save_constant = 0;
3494 int boundary_in_bytes = boundary / BITS_PER_UNIT;
3495 HOST_WIDE_INT sp_offset = STACK_POINTER_OFFSET;
3497 #ifdef SPARC_STACK_BOUNDARY_HACK
3498 /* The sparc port has a bug. It sometimes claims a STACK_BOUNDARY
3499 higher than the real alignment of %sp. However, when it does this,
3500 the alignment of %sp+STACK_POINTER_OFFSET will be STACK_BOUNDARY.
3501 This is a temporary hack while the sparc port is fixed. */
3502 if (SPARC_STACK_BOUNDARY_HACK)
3506 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3508 save_var = offset_ptr->var;
3509 save_constant = offset_ptr->constant;
3512 alignment_pad->var = NULL_TREE;
3513 alignment_pad->constant = 0;
3515 if (boundary > BITS_PER_UNIT)
3517 if (offset_ptr->var)
3519 tree sp_offset_tree = ssize_int (sp_offset);
3520 tree offset = size_binop (PLUS_EXPR,
3521 ARGS_SIZE_TREE (*offset_ptr),
3523 #ifdef ARGS_GROW_DOWNWARD
3524 tree rounded = round_down (offset, boundary / BITS_PER_UNIT);
3526 tree rounded = round_up (offset, boundary / BITS_PER_UNIT);
3529 offset_ptr->var = size_binop (MINUS_EXPR, rounded, sp_offset_tree);
3530 /* ARGS_SIZE_TREE includes constant term. */
3531 offset_ptr->constant = 0;
3532 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3533 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
3538 offset_ptr->constant = -sp_offset +
3539 #ifdef ARGS_GROW_DOWNWARD
3540 FLOOR_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
3542 CEIL_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
3544 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
3545 alignment_pad->constant = offset_ptr->constant - save_constant;
3551 pad_below (struct args_size *offset_ptr, enum machine_mode passed_mode, tree sizetree)
3553 if (passed_mode != BLKmode)
3555 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
3556 offset_ptr->constant
3557 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
3558 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
3559 - GET_MODE_SIZE (passed_mode));
3563 if (TREE_CODE (sizetree) != INTEGER_CST
3564 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
3566 /* Round the size up to multiple of PARM_BOUNDARY bits. */
3567 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
3569 ADD_PARM_SIZE (*offset_ptr, s2);
3570 SUB_PARM_SIZE (*offset_ptr, sizetree);
3575 /* Walk the tree of blocks describing the binding levels within a function
3576 and warn about variables the might be killed by setjmp or vfork.
3577 This is done after calling flow_analysis and before global_alloc
3578 clobbers the pseudo-regs to hard regs. */
3581 setjmp_vars_warning (tree block)
3585 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
3587 if (TREE_CODE (decl) == VAR_DECL
3588 && DECL_RTL_SET_P (decl)
3589 && REG_P (DECL_RTL (decl))
3590 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
3591 warning ("%Jvariable %qD might be clobbered by %<longjmp%>"
3596 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
3597 setjmp_vars_warning (sub);
3600 /* Do the appropriate part of setjmp_vars_warning
3601 but for arguments instead of local variables. */
3604 setjmp_args_warning (void)
3607 for (decl = DECL_ARGUMENTS (current_function_decl);
3608 decl; decl = TREE_CHAIN (decl))
3609 if (DECL_RTL (decl) != 0
3610 && REG_P (DECL_RTL (decl))
3611 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
3612 warning ("%Jargument %qD might be clobbered by %<longjmp%> or %<vfork%>",
3617 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
3618 and create duplicate blocks. */
3619 /* ??? Need an option to either create block fragments or to create
3620 abstract origin duplicates of a source block. It really depends
3621 on what optimization has been performed. */
3624 reorder_blocks (void)
3626 tree block = DECL_INITIAL (current_function_decl);
3627 varray_type block_stack;
3629 if (block == NULL_TREE)
3632 VARRAY_TREE_INIT (block_stack, 10, "block_stack");
3634 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
3635 clear_block_marks (block);
3637 /* Prune the old trees away, so that they don't get in the way. */
3638 BLOCK_SUBBLOCKS (block) = NULL_TREE;
3639 BLOCK_CHAIN (block) = NULL_TREE;
3641 /* Recreate the block tree from the note nesting. */
3642 reorder_blocks_1 (get_insns (), block, &block_stack);
3643 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
3645 /* Remove deleted blocks from the block fragment chains. */
3646 reorder_fix_fragments (block);
3649 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
3652 clear_block_marks (tree block)
3656 TREE_ASM_WRITTEN (block) = 0;
3657 clear_block_marks (BLOCK_SUBBLOCKS (block));
3658 block = BLOCK_CHAIN (block);
3663 reorder_blocks_1 (rtx insns, tree current_block, varray_type *p_block_stack)
3667 for (insn = insns; insn; insn = NEXT_INSN (insn))
3671 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
3673 tree block = NOTE_BLOCK (insn);
3675 /* If we have seen this block before, that means it now
3676 spans multiple address regions. Create a new fragment. */
3677 if (TREE_ASM_WRITTEN (block))
3679 tree new_block = copy_node (block);
3682 origin = (BLOCK_FRAGMENT_ORIGIN (block)
3683 ? BLOCK_FRAGMENT_ORIGIN (block)
3685 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
3686 BLOCK_FRAGMENT_CHAIN (new_block)
3687 = BLOCK_FRAGMENT_CHAIN (origin);
3688 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
3690 NOTE_BLOCK (insn) = new_block;
3694 BLOCK_SUBBLOCKS (block) = 0;
3695 TREE_ASM_WRITTEN (block) = 1;
3696 /* When there's only one block for the entire function,
3697 current_block == block and we mustn't do this, it
3698 will cause infinite recursion. */
3699 if (block != current_block)
3701 BLOCK_SUPERCONTEXT (block) = current_block;
3702 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
3703 BLOCK_SUBBLOCKS (current_block) = block;
3704 current_block = block;
3706 VARRAY_PUSH_TREE (*p_block_stack, block);
3708 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
3710 NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack);
3711 VARRAY_POP (*p_block_stack);
3712 BLOCK_SUBBLOCKS (current_block)
3713 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
3714 current_block = BLOCK_SUPERCONTEXT (current_block);
3720 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
3721 appears in the block tree, select one of the fragments to become
3722 the new origin block. */
3725 reorder_fix_fragments (tree block)
3729 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
3730 tree new_origin = NULL_TREE;
3734 if (! TREE_ASM_WRITTEN (dup_origin))
3736 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
3738 /* Find the first of the remaining fragments. There must
3739 be at least one -- the current block. */
3740 while (! TREE_ASM_WRITTEN (new_origin))
3741 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
3742 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
3745 else if (! dup_origin)
3748 /* Re-root the rest of the fragments to the new origin. In the
3749 case that DUP_ORIGIN was null, that means BLOCK was the origin
3750 of a chain of fragments and we want to remove those fragments
3751 that didn't make it to the output. */
3754 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
3759 if (TREE_ASM_WRITTEN (chain))
3761 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
3763 pp = &BLOCK_FRAGMENT_CHAIN (chain);
3765 chain = BLOCK_FRAGMENT_CHAIN (chain);
3770 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
3771 block = BLOCK_CHAIN (block);
3775 /* Reverse the order of elements in the chain T of blocks,
3776 and return the new head of the chain (old last element). */
3779 blocks_nreverse (tree t)
3781 tree prev = 0, decl, next;
3782 for (decl = t; decl; decl = next)
3784 next = BLOCK_CHAIN (decl);
3785 BLOCK_CHAIN (decl) = prev;
3791 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
3792 non-NULL, list them all into VECTOR, in a depth-first preorder
3793 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
3797 all_blocks (tree block, tree *vector)
3803 TREE_ASM_WRITTEN (block) = 0;
3805 /* Record this block. */
3807 vector[n_blocks] = block;
3811 /* Record the subblocks, and their subblocks... */
3812 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
3813 vector ? vector + n_blocks : 0);
3814 block = BLOCK_CHAIN (block);
3820 /* Return a vector containing all the blocks rooted at BLOCK. The
3821 number of elements in the vector is stored in N_BLOCKS_P. The
3822 vector is dynamically allocated; it is the caller's responsibility
3823 to call `free' on the pointer returned. */
3826 get_block_vector (tree block, int *n_blocks_p)
3830 *n_blocks_p = all_blocks (block, NULL);
3831 block_vector = xmalloc (*n_blocks_p * sizeof (tree));
3832 all_blocks (block, block_vector);
3834 return block_vector;
3837 static GTY(()) int next_block_index = 2;
3839 /* Set BLOCK_NUMBER for all the blocks in FN. */
3842 number_blocks (tree fn)
3848 /* For SDB and XCOFF debugging output, we start numbering the blocks
3849 from 1 within each function, rather than keeping a running
3851 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
3852 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
3853 next_block_index = 1;
3856 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
3858 /* The top-level BLOCK isn't numbered at all. */
3859 for (i = 1; i < n_blocks; ++i)
3860 /* We number the blocks from two. */
3861 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
3863 free (block_vector);
3868 /* If VAR is present in a subblock of BLOCK, return the subblock. */
3871 debug_find_var_in_block_tree (tree var, tree block)
3875 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
3879 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
3881 tree ret = debug_find_var_in_block_tree (var, t);
3889 /* Allocate a function structure for FNDECL and set its contents
3893 allocate_struct_function (tree fndecl)
3896 tree fntype = fndecl ? TREE_TYPE (fndecl) : NULL_TREE;
3898 cfun = ggc_alloc_cleared (sizeof (struct function));
3900 cfun->stack_alignment_needed = STACK_BOUNDARY;
3901 cfun->preferred_stack_boundary = STACK_BOUNDARY;
3903 current_function_funcdef_no = funcdef_no++;
3905 cfun->function_frequency = FUNCTION_FREQUENCY_NORMAL;
3907 init_eh_for_function ();
3909 lang_hooks.function.init (cfun);
3910 if (init_machine_status)
3911 cfun->machine = (*init_machine_status) ();
3916 DECL_STRUCT_FUNCTION (fndecl) = cfun;
3917 cfun->decl = fndecl;
3919 result = DECL_RESULT (fndecl);
3920 if (aggregate_value_p (result, fndecl))
3922 #ifdef PCC_STATIC_STRUCT_RETURN
3923 current_function_returns_pcc_struct = 1;
3925 current_function_returns_struct = 1;
3928 current_function_returns_pointer = POINTER_TYPE_P (TREE_TYPE (result));
3930 current_function_stdarg
3932 && TYPE_ARG_TYPES (fntype) != 0
3933 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
3934 != void_type_node));
3937 /* Reset cfun, and other non-struct-function variables to defaults as
3938 appropriate for emitting rtl at the start of a function. */
3941 prepare_function_start (tree fndecl)
3943 if (fndecl && DECL_STRUCT_FUNCTION (fndecl))
3944 cfun = DECL_STRUCT_FUNCTION (fndecl);
3946 allocate_struct_function (fndecl);
3948 init_varasm_status (cfun);
3951 cse_not_expected = ! optimize;
3953 /* Caller save not needed yet. */
3954 caller_save_needed = 0;
3956 /* We haven't done register allocation yet. */
3959 /* Indicate that we have not instantiated virtual registers yet. */
3960 virtuals_instantiated = 0;
3962 /* Indicate that we want CONCATs now. */
3963 generating_concat_p = 1;
3965 /* Indicate we have no need of a frame pointer yet. */
3966 frame_pointer_needed = 0;
3969 /* Initialize the rtl expansion mechanism so that we can do simple things
3970 like generate sequences. This is used to provide a context during global
3971 initialization of some passes. */
3973 init_dummy_function_start (void)
3975 prepare_function_start (NULL);
3978 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
3979 and initialize static variables for generating RTL for the statements
3983 init_function_start (tree subr)
3985 prepare_function_start (subr);
3987 /* Prevent ever trying to delete the first instruction of a
3988 function. Also tell final how to output a linenum before the
3989 function prologue. Note linenums could be missing, e.g. when
3990 compiling a Java .class file. */
3991 if (! DECL_IS_BUILTIN (subr))
3992 emit_line_note (DECL_SOURCE_LOCATION (subr));
3994 /* Make sure first insn is a note even if we don't want linenums.
3995 This makes sure the first insn will never be deleted.
3996 Also, final expects a note to appear there. */
3997 emit_note (NOTE_INSN_DELETED);
3999 /* Warn if this value is an aggregate type,
4000 regardless of which calling convention we are using for it. */
4001 if (warn_aggregate_return
4002 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
4003 warning ("function returns an aggregate");
4006 /* Make sure all values used by the optimization passes have sane
4009 init_function_for_compilation (void)
4013 /* No prologue/epilogue insns yet. */
4014 VARRAY_GROW (prologue, 0);
4015 VARRAY_GROW (epilogue, 0);
4016 VARRAY_GROW (sibcall_epilogue, 0);
4019 /* Expand a call to __main at the beginning of a possible main function. */
4021 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
4022 #undef HAS_INIT_SECTION
4023 #define HAS_INIT_SECTION
4027 expand_main_function (void)
4029 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
4030 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
4032 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
4036 /* Forcibly align the stack. */
4037 #ifdef STACK_GROWS_DOWNWARD
4038 tmp = expand_simple_binop (Pmode, AND, stack_pointer_rtx, GEN_INT(-align),
4039 stack_pointer_rtx, 1, OPTAB_WIDEN);
4041 tmp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
4042 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
4043 tmp = expand_simple_binop (Pmode, AND, tmp, GEN_INT (-align),
4044 stack_pointer_rtx, 1, OPTAB_WIDEN);
4046 if (tmp != stack_pointer_rtx)
4047 emit_move_insn (stack_pointer_rtx, tmp);
4049 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
4050 tmp = force_reg (Pmode, const0_rtx);
4051 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
4055 for (tmp = get_last_insn (); tmp; tmp = PREV_INSN (tmp))
4056 if (NOTE_P (tmp) && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_FUNCTION_BEG)
4059 emit_insn_before (seq, tmp);
4065 #ifndef HAS_INIT_SECTION
4066 emit_library_call (init_one_libfunc (NAME__MAIN), LCT_NORMAL, VOIDmode, 0);
4070 /* Start the RTL for a new function, and set variables used for
4072 SUBR is the FUNCTION_DECL node.
4073 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
4074 the function's parameters, which must be run at any return statement. */
4077 expand_function_start (tree subr)
4079 /* Make sure volatile mem refs aren't considered
4080 valid operands of arithmetic insns. */
4081 init_recog_no_volatile ();
4083 current_function_profile
4085 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
4087 current_function_limit_stack
4088 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
4090 /* Make the label for return statements to jump to. Do not special
4091 case machines with special return instructions -- they will be
4092 handled later during jump, ifcvt, or epilogue creation. */
4093 return_label = gen_label_rtx ();
4095 /* Initialize rtx used to return the value. */
4096 /* Do this before assign_parms so that we copy the struct value address
4097 before any library calls that assign parms might generate. */
4099 /* Decide whether to return the value in memory or in a register. */
4100 if (aggregate_value_p (DECL_RESULT (subr), subr))
4102 /* Returning something that won't go in a register. */
4103 rtx value_address = 0;
4105 #ifdef PCC_STATIC_STRUCT_RETURN
4106 if (current_function_returns_pcc_struct)
4108 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
4109 value_address = assemble_static_space (size);
4114 rtx sv = targetm.calls.struct_value_rtx (TREE_TYPE (subr), 1);
4115 /* Expect to be passed the address of a place to store the value.
4116 If it is passed as an argument, assign_parms will take care of
4120 value_address = gen_reg_rtx (Pmode);
4121 emit_move_insn (value_address, sv);
4126 rtx x = value_address;
4127 if (!DECL_BY_REFERENCE (DECL_RESULT (subr)))
4129 x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), x);
4130 set_mem_attributes (x, DECL_RESULT (subr), 1);
4132 SET_DECL_RTL (DECL_RESULT (subr), x);
4135 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
4136 /* If return mode is void, this decl rtl should not be used. */
4137 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
4140 /* Compute the return values into a pseudo reg, which we will copy
4141 into the true return register after the cleanups are done. */
4142 tree return_type = TREE_TYPE (DECL_RESULT (subr));
4143 if (TYPE_MODE (return_type) != BLKmode
4144 && targetm.calls.return_in_msb (return_type))
4145 /* expand_function_end will insert the appropriate padding in
4146 this case. Use the return value's natural (unpadded) mode
4147 within the function proper. */
4148 SET_DECL_RTL (DECL_RESULT (subr),
4149 gen_reg_rtx (TYPE_MODE (return_type)));
4152 /* In order to figure out what mode to use for the pseudo, we
4153 figure out what the mode of the eventual return register will
4154 actually be, and use that. */
4155 rtx hard_reg = hard_function_value (return_type, subr, 1);
4157 /* Structures that are returned in registers are not
4158 aggregate_value_p, so we may see a PARALLEL or a REG. */
4159 if (REG_P (hard_reg))
4160 SET_DECL_RTL (DECL_RESULT (subr),
4161 gen_reg_rtx (GET_MODE (hard_reg)));
4164 gcc_assert (GET_CODE (hard_reg) == PARALLEL);
4165 SET_DECL_RTL (DECL_RESULT (subr), gen_group_rtx (hard_reg));
4169 /* Set DECL_REGISTER flag so that expand_function_end will copy the
4170 result to the real return register(s). */
4171 DECL_REGISTER (DECL_RESULT (subr)) = 1;
4174 /* Initialize rtx for parameters and local variables.
4175 In some cases this requires emitting insns. */
4176 assign_parms (subr);
4178 /* If function gets a static chain arg, store it. */
4179 if (cfun->static_chain_decl)
4181 tree parm = cfun->static_chain_decl;
4182 rtx local = gen_reg_rtx (Pmode);
4184 set_decl_incoming_rtl (parm, static_chain_incoming_rtx);
4185 SET_DECL_RTL (parm, local);
4186 mark_reg_pointer (local, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
4188 emit_move_insn (local, static_chain_incoming_rtx);
4191 /* If the function receives a non-local goto, then store the
4192 bits we need to restore the frame pointer. */
4193 if (cfun->nonlocal_goto_save_area)
4198 /* ??? We need to do this save early. Unfortunately here is
4199 before the frame variable gets declared. Help out... */
4200 expand_var (TREE_OPERAND (cfun->nonlocal_goto_save_area, 0));
4202 t_save = build4 (ARRAY_REF, ptr_type_node,
4203 cfun->nonlocal_goto_save_area,
4204 integer_zero_node, NULL_TREE, NULL_TREE);
4205 r_save = expand_expr (t_save, NULL_RTX, VOIDmode, EXPAND_WRITE);
4206 r_save = convert_memory_address (Pmode, r_save);
4208 emit_move_insn (r_save, virtual_stack_vars_rtx);
4209 update_nonlocal_goto_save_area ();
4212 /* The following was moved from init_function_start.
4213 The move is supposed to make sdb output more accurate. */
4214 /* Indicate the beginning of the function body,
4215 as opposed to parm setup. */
4216 emit_note (NOTE_INSN_FUNCTION_BEG);
4218 if (!NOTE_P (get_last_insn ()))
4219 emit_note (NOTE_INSN_DELETED);
4220 parm_birth_insn = get_last_insn ();
4222 if (current_function_profile)
4225 PROFILE_HOOK (current_function_funcdef_no);
4229 /* After the display initializations is where the tail-recursion label
4230 should go, if we end up needing one. Ensure we have a NOTE here
4231 since some things (like trampolines) get placed before this. */
4232 tail_recursion_reentry = emit_note (NOTE_INSN_DELETED);
4234 /* Make sure there is a line number after the function entry setup code. */
4235 force_next_line_note ();
4238 /* Undo the effects of init_dummy_function_start. */
4240 expand_dummy_function_end (void)
4242 /* End any sequences that failed to be closed due to syntax errors. */
4243 while (in_sequence_p ())
4246 /* Outside function body, can't compute type's actual size
4247 until next function's body starts. */
4249 free_after_parsing (cfun);
4250 free_after_compilation (cfun);
4254 /* Call DOIT for each hard register used as a return value from
4255 the current function. */
4258 diddle_return_value (void (*doit) (rtx, void *), void *arg)
4260 rtx outgoing = current_function_return_rtx;
4265 if (REG_P (outgoing))
4266 (*doit) (outgoing, arg);
4267 else if (GET_CODE (outgoing) == PARALLEL)
4271 for (i = 0; i < XVECLEN (outgoing, 0); i++)
4273 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
4275 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
4282 do_clobber_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
4284 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
4288 clobber_return_register (void)
4290 diddle_return_value (do_clobber_return_reg, NULL);
4292 /* In case we do use pseudo to return value, clobber it too. */
4293 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
4295 tree decl_result = DECL_RESULT (current_function_decl);
4296 rtx decl_rtl = DECL_RTL (decl_result);
4297 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
4299 do_clobber_return_reg (decl_rtl, NULL);
4305 do_use_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
4307 emit_insn (gen_rtx_USE (VOIDmode, reg));
4311 use_return_register (void)
4313 diddle_return_value (do_use_return_reg, NULL);
4316 /* Possibly warn about unused parameters. */
4318 do_warn_unused_parameter (tree fn)
4322 for (decl = DECL_ARGUMENTS (fn);
4323 decl; decl = TREE_CHAIN (decl))
4324 if (!TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
4325 && DECL_NAME (decl) && !DECL_ARTIFICIAL (decl))
4326 warning ("%Junused parameter %qD", decl, decl);
4329 static GTY(()) rtx initial_trampoline;
4331 /* Generate RTL for the end of the current function. */
4334 expand_function_end (void)
4338 /* If arg_pointer_save_area was referenced only from a nested
4339 function, we will not have initialized it yet. Do that now. */
4340 if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
4341 get_arg_pointer_save_area (cfun);
4343 /* If we are doing stack checking and this function makes calls,
4344 do a stack probe at the start of the function to ensure we have enough
4345 space for another stack frame. */
4346 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
4350 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4354 probe_stack_range (STACK_CHECK_PROTECT,
4355 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
4358 emit_insn_before (seq, tail_recursion_reentry);
4363 /* Possibly warn about unused parameters.
4364 When frontend does unit-at-a-time, the warning is already
4365 issued at finalization time. */
4366 if (warn_unused_parameter
4367 && !lang_hooks.callgraph.expand_function)
4368 do_warn_unused_parameter (current_function_decl);
4370 /* End any sequences that failed to be closed due to syntax errors. */
4371 while (in_sequence_p ())
4374 clear_pending_stack_adjust ();
4375 do_pending_stack_adjust ();
4377 /* @@@ This is a kludge. We want to ensure that instructions that
4378 may trap are not moved into the epilogue by scheduling, because
4379 we don't always emit unwind information for the epilogue.
4380 However, not all machine descriptions define a blockage insn, so
4381 emit an ASM_INPUT to act as one. */
4382 if (flag_non_call_exceptions)
4383 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, ""));
4385 /* Mark the end of the function body.
4386 If control reaches this insn, the function can drop through
4387 without returning a value. */
4388 emit_note (NOTE_INSN_FUNCTION_END);
4390 /* Must mark the last line number note in the function, so that the test
4391 coverage code can avoid counting the last line twice. This just tells
4392 the code to ignore the immediately following line note, since there
4393 already exists a copy of this note somewhere above. This line number
4394 note is still needed for debugging though, so we can't delete it. */
4395 if (flag_test_coverage)
4396 emit_note (NOTE_INSN_REPEATED_LINE_NUMBER);
4398 /* Output a linenumber for the end of the function.
4399 SDB depends on this. */
4400 force_next_line_note ();
4401 emit_line_note (input_location);
4403 /* Before the return label (if any), clobber the return
4404 registers so that they are not propagated live to the rest of
4405 the function. This can only happen with functions that drop
4406 through; if there had been a return statement, there would
4407 have either been a return rtx, or a jump to the return label.
4409 We delay actual code generation after the current_function_value_rtx
4411 clobber_after = get_last_insn ();
4413 /* Output the label for the actual return from the function. */
4414 emit_label (return_label);
4416 /* Let except.c know where it should emit the call to unregister
4417 the function context for sjlj exceptions. */
4418 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
4419 sjlj_emit_function_exit_after (get_last_insn ());
4421 /* If we had calls to alloca, and this machine needs
4422 an accurate stack pointer to exit the function,
4423 insert some code to save and restore the stack pointer. */
4424 if (! EXIT_IGNORE_STACK
4425 && current_function_calls_alloca)
4429 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
4430 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
4433 /* If scalar return value was computed in a pseudo-reg, or was a named
4434 return value that got dumped to the stack, copy that to the hard
4436 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
4438 tree decl_result = DECL_RESULT (current_function_decl);
4439 rtx decl_rtl = DECL_RTL (decl_result);
4441 if (REG_P (decl_rtl)
4442 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
4443 : DECL_REGISTER (decl_result))
4445 rtx real_decl_rtl = current_function_return_rtx;
4447 /* This should be set in assign_parms. */
4448 gcc_assert (REG_FUNCTION_VALUE_P (real_decl_rtl));
4450 /* If this is a BLKmode structure being returned in registers,
4451 then use the mode computed in expand_return. Note that if
4452 decl_rtl is memory, then its mode may have been changed,
4453 but that current_function_return_rtx has not. */
4454 if (GET_MODE (real_decl_rtl) == BLKmode)
4455 PUT_MODE (real_decl_rtl, GET_MODE (decl_rtl));
4457 /* If a non-BLKmode return value should be padded at the least
4458 significant end of the register, shift it left by the appropriate
4459 amount. BLKmode results are handled using the group load/store
4461 if (TYPE_MODE (TREE_TYPE (decl_result)) != BLKmode
4462 && targetm.calls.return_in_msb (TREE_TYPE (decl_result)))
4464 emit_move_insn (gen_rtx_REG (GET_MODE (decl_rtl),
4465 REGNO (real_decl_rtl)),
4467 shift_return_value (GET_MODE (decl_rtl), true, real_decl_rtl);
4469 /* If a named return value dumped decl_return to memory, then
4470 we may need to re-do the PROMOTE_MODE signed/unsigned
4472 else if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
4474 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (decl_result));
4476 if (targetm.calls.promote_function_return (TREE_TYPE (current_function_decl)))
4477 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
4480 convert_move (real_decl_rtl, decl_rtl, unsignedp);
4482 else if (GET_CODE (real_decl_rtl) == PARALLEL)
4484 /* If expand_function_start has created a PARALLEL for decl_rtl,
4485 move the result to the real return registers. Otherwise, do
4486 a group load from decl_rtl for a named return. */
4487 if (GET_CODE (decl_rtl) == PARALLEL)
4488 emit_group_move (real_decl_rtl, decl_rtl);
4490 emit_group_load (real_decl_rtl, decl_rtl,
4491 TREE_TYPE (decl_result),
4492 int_size_in_bytes (TREE_TYPE (decl_result)));
4495 emit_move_insn (real_decl_rtl, decl_rtl);
4499 /* If returning a structure, arrange to return the address of the value
4500 in a place where debuggers expect to find it.
4502 If returning a structure PCC style,
4503 the caller also depends on this value.
4504 And current_function_returns_pcc_struct is not necessarily set. */
4505 if (current_function_returns_struct
4506 || current_function_returns_pcc_struct)
4508 rtx value_address = DECL_RTL (DECL_RESULT (current_function_decl));
4509 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
4512 if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)))
4513 type = TREE_TYPE (type);
4515 value_address = XEXP (value_address, 0);
4517 #ifdef FUNCTION_OUTGOING_VALUE
4518 outgoing = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
4519 current_function_decl);
4521 outgoing = FUNCTION_VALUE (build_pointer_type (type),
4522 current_function_decl);
4525 /* Mark this as a function return value so integrate will delete the
4526 assignment and USE below when inlining this function. */
4527 REG_FUNCTION_VALUE_P (outgoing) = 1;
4529 /* The address may be ptr_mode and OUTGOING may be Pmode. */
4530 value_address = convert_memory_address (GET_MODE (outgoing),
4533 emit_move_insn (outgoing, value_address);
4535 /* Show return register used to hold result (in this case the address
4537 current_function_return_rtx = outgoing;
4540 /* If this is an implementation of throw, do what's necessary to
4541 communicate between __builtin_eh_return and the epilogue. */
4542 expand_eh_return ();
4544 /* Emit the actual code to clobber return register. */
4549 clobber_return_register ();
4550 expand_naked_return ();
4554 emit_insn_after (seq, clobber_after);
4557 /* Output the label for the naked return from the function. */
4558 emit_label (naked_return_label);
4560 /* ??? This should no longer be necessary since stupid is no longer with
4561 us, but there are some parts of the compiler (eg reload_combine, and
4562 sh mach_dep_reorg) that still try and compute their own lifetime info
4563 instead of using the general framework. */
4564 use_return_register ();
4568 get_arg_pointer_save_area (struct function *f)
4570 rtx ret = f->x_arg_pointer_save_area;
4574 ret = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, f);
4575 f->x_arg_pointer_save_area = ret;
4578 if (f == cfun && ! f->arg_pointer_save_area_init)
4582 /* Save the arg pointer at the beginning of the function. The
4583 generated stack slot may not be a valid memory address, so we
4584 have to check it and fix it if necessary. */
4586 emit_move_insn (validize_mem (ret), virtual_incoming_args_rtx);
4590 push_topmost_sequence ();
4591 emit_insn_after (seq, get_insns ());
4592 pop_topmost_sequence ();
4598 /* Extend a vector that records the INSN_UIDs of INSNS
4599 (a list of one or more insns). */
4602 record_insns (rtx insns, varray_type *vecp)
4609 while (tmp != NULL_RTX)
4612 tmp = NEXT_INSN (tmp);
4615 i = VARRAY_SIZE (*vecp);
4616 VARRAY_GROW (*vecp, i + len);
4618 while (tmp != NULL_RTX)
4620 VARRAY_INT (*vecp, i) = INSN_UID (tmp);
4622 tmp = NEXT_INSN (tmp);
4626 /* Set the locator of the insn chain starting at INSN to LOC. */
4628 set_insn_locators (rtx insn, int loc)
4630 while (insn != NULL_RTX)
4633 INSN_LOCATOR (insn) = loc;
4634 insn = NEXT_INSN (insn);
4638 /* Determine how many INSN_UIDs in VEC are part of INSN. Because we can
4639 be running after reorg, SEQUENCE rtl is possible. */
4642 contains (rtx insn, varray_type vec)
4646 if (NONJUMP_INSN_P (insn)
4647 && GET_CODE (PATTERN (insn)) == SEQUENCE)
4650 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
4651 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
4652 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j))
4658 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
4659 if (INSN_UID (insn) == VARRAY_INT (vec, j))
4666 prologue_epilogue_contains (rtx insn)
4668 if (contains (insn, prologue))
4670 if (contains (insn, epilogue))
4676 sibcall_epilogue_contains (rtx insn)
4678 if (sibcall_epilogue)
4679 return contains (insn, sibcall_epilogue);
4684 /* Insert gen_return at the end of block BB. This also means updating
4685 block_for_insn appropriately. */
4688 emit_return_into_block (basic_block bb, rtx line_note)
4690 emit_jump_insn_after (gen_return (), BB_END (bb));
4692 emit_note_copy_after (line_note, PREV_INSN (BB_END (bb)));
4694 #endif /* HAVE_return */
4696 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
4698 /* These functions convert the epilogue into a variant that does not modify the
4699 stack pointer. This is used in cases where a function returns an object
4700 whose size is not known until it is computed. The called function leaves the
4701 object on the stack, leaves the stack depressed, and returns a pointer to
4704 What we need to do is track all modifications and references to the stack
4705 pointer, deleting the modifications and changing the references to point to
4706 the location the stack pointer would have pointed to had the modifications
4709 These functions need to be portable so we need to make as few assumptions
4710 about the epilogue as we can. However, the epilogue basically contains
4711 three things: instructions to reset the stack pointer, instructions to
4712 reload registers, possibly including the frame pointer, and an
4713 instruction to return to the caller.
4715 If we can't be sure of what a relevant epilogue insn is doing, we abort.
4716 We also make no attempt to validate the insns we make since if they are
4717 invalid, we probably can't do anything valid. The intent is that these
4718 routines get "smarter" as more and more machines start to use them and
4719 they try operating on different epilogues.
4721 We use the following structure to track what the part of the epilogue that
4722 we've already processed has done. We keep two copies of the SP equivalence,
4723 one for use during the insn we are processing and one for use in the next
4724 insn. The difference is because one part of a PARALLEL may adjust SP
4725 and the other may use it. */
4729 rtx sp_equiv_reg; /* REG that SP is set from, perhaps SP. */
4730 HOST_WIDE_INT sp_offset; /* Offset from SP_EQUIV_REG of present SP. */
4731 rtx new_sp_equiv_reg; /* REG to be used at end of insn. */
4732 HOST_WIDE_INT new_sp_offset; /* Offset to be used at end of insn. */
4733 rtx equiv_reg_src; /* If nonzero, the value that SP_EQUIV_REG
4734 should be set to once we no longer need
4736 rtx const_equiv[FIRST_PSEUDO_REGISTER]; /* Any known constant equivalences
4740 static void handle_epilogue_set (rtx, struct epi_info *);
4741 static void update_epilogue_consts (rtx, rtx, void *);
4742 static void emit_equiv_load (struct epi_info *);
4744 /* Modify INSN, a list of one or more insns that is part of the epilogue, to
4745 no modifications to the stack pointer. Return the new list of insns. */
4748 keep_stack_depressed (rtx insns)
4751 struct epi_info info;
4754 /* If the epilogue is just a single instruction, it must be OK as is. */
4755 if (NEXT_INSN (insns) == NULL_RTX)
4758 /* Otherwise, start a sequence, initialize the information we have, and
4759 process all the insns we were given. */
4762 info.sp_equiv_reg = stack_pointer_rtx;
4764 info.equiv_reg_src = 0;
4766 for (j = 0; j < FIRST_PSEUDO_REGISTER; j++)
4767 info.const_equiv[j] = 0;
4771 while (insn != NULL_RTX)
4773 next = NEXT_INSN (insn);
4782 /* If this insn references the register that SP is equivalent to and
4783 we have a pending load to that register, we must force out the load
4784 first and then indicate we no longer know what SP's equivalent is. */
4785 if (info.equiv_reg_src != 0
4786 && reg_referenced_p (info.sp_equiv_reg, PATTERN (insn)))
4788 emit_equiv_load (&info);
4789 info.sp_equiv_reg = 0;
4792 info.new_sp_equiv_reg = info.sp_equiv_reg;
4793 info.new_sp_offset = info.sp_offset;
4795 /* If this is a (RETURN) and the return address is on the stack,
4796 update the address and change to an indirect jump. */
4797 if (GET_CODE (PATTERN (insn)) == RETURN
4798 || (GET_CODE (PATTERN (insn)) == PARALLEL
4799 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
4801 rtx retaddr = INCOMING_RETURN_ADDR_RTX;
4803 HOST_WIDE_INT offset = 0;
4804 rtx jump_insn, jump_set;
4806 /* If the return address is in a register, we can emit the insn
4807 unchanged. Otherwise, it must be a MEM and we see what the
4808 base register and offset are. In any case, we have to emit any
4809 pending load to the equivalent reg of SP, if any. */
4810 if (REG_P (retaddr))
4812 emit_equiv_load (&info);
4820 gcc_assert (MEM_P (retaddr));
4822 ret_ptr = XEXP (retaddr, 0);
4824 if (REG_P (ret_ptr))
4826 base = gen_rtx_REG (Pmode, REGNO (ret_ptr));
4831 gcc_assert (GET_CODE (ret_ptr) == PLUS
4832 && REG_P (XEXP (ret_ptr, 0))
4833 && GET_CODE (XEXP (ret_ptr, 1)) == CONST_INT);
4834 base = gen_rtx_REG (Pmode, REGNO (XEXP (ret_ptr, 0)));
4835 offset = INTVAL (XEXP (ret_ptr, 1));
4839 /* If the base of the location containing the return pointer
4840 is SP, we must update it with the replacement address. Otherwise,
4841 just build the necessary MEM. */
4842 retaddr = plus_constant (base, offset);
4843 if (base == stack_pointer_rtx)
4844 retaddr = simplify_replace_rtx (retaddr, stack_pointer_rtx,
4845 plus_constant (info.sp_equiv_reg,
4848 retaddr = gen_rtx_MEM (Pmode, retaddr);
4850 /* If there is a pending load to the equivalent register for SP
4851 and we reference that register, we must load our address into
4852 a scratch register and then do that load. */
4853 if (info.equiv_reg_src
4854 && reg_overlap_mentioned_p (info.equiv_reg_src, retaddr))
4859 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
4860 if (HARD_REGNO_MODE_OK (regno, Pmode)
4861 && !fixed_regs[regno]
4862 && TEST_HARD_REG_BIT (regs_invalidated_by_call, regno)
4863 && !REGNO_REG_SET_P (EXIT_BLOCK_PTR->global_live_at_start,
4865 && !refers_to_regno_p (regno,
4866 regno + hard_regno_nregs[regno]
4868 info.equiv_reg_src, NULL)
4869 && info.const_equiv[regno] == 0)
4872 gcc_assert (regno < FIRST_PSEUDO_REGISTER);
4874 reg = gen_rtx_REG (Pmode, regno);
4875 emit_move_insn (reg, retaddr);
4879 emit_equiv_load (&info);
4880 jump_insn = emit_jump_insn (gen_indirect_jump (retaddr));
4882 /* Show the SET in the above insn is a RETURN. */
4883 jump_set = single_set (jump_insn);
4884 gcc_assert (jump_set);
4885 SET_IS_RETURN_P (jump_set) = 1;
4888 /* If SP is not mentioned in the pattern and its equivalent register, if
4889 any, is not modified, just emit it. Otherwise, if neither is set,
4890 replace the reference to SP and emit the insn. If none of those are
4891 true, handle each SET individually. */
4892 else if (!reg_mentioned_p (stack_pointer_rtx, PATTERN (insn))
4893 && (info.sp_equiv_reg == stack_pointer_rtx
4894 || !reg_set_p (info.sp_equiv_reg, insn)))
4896 else if (! reg_set_p (stack_pointer_rtx, insn)
4897 && (info.sp_equiv_reg == stack_pointer_rtx
4898 || !reg_set_p (info.sp_equiv_reg, insn)))
4902 changed = validate_replace_rtx (stack_pointer_rtx,
4903 plus_constant (info.sp_equiv_reg,
4906 gcc_assert (changed);
4910 else if (GET_CODE (PATTERN (insn)) == SET)
4911 handle_epilogue_set (PATTERN (insn), &info);
4912 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
4914 for (j = 0; j < XVECLEN (PATTERN (insn), 0); j++)
4915 if (GET_CODE (XVECEXP (PATTERN (insn), 0, j)) == SET)
4916 handle_epilogue_set (XVECEXP (PATTERN (insn), 0, j), &info);
4921 info.sp_equiv_reg = info.new_sp_equiv_reg;
4922 info.sp_offset = info.new_sp_offset;
4924 /* Now update any constants this insn sets. */
4925 note_stores (PATTERN (insn), update_epilogue_consts, &info);
4929 insns = get_insns ();
4934 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
4935 structure that contains information about what we've seen so far. We
4936 process this SET by either updating that data or by emitting one or
4940 handle_epilogue_set (rtx set, struct epi_info *p)
4942 /* First handle the case where we are setting SP. Record what it is being
4943 set from. If unknown, abort. */
4944 if (reg_set_p (stack_pointer_rtx, set))
4946 gcc_assert (SET_DEST (set) == stack_pointer_rtx);
4948 if (GET_CODE (SET_SRC (set)) == PLUS)
4950 p->new_sp_equiv_reg = XEXP (SET_SRC (set), 0);
4951 if (GET_CODE (XEXP (SET_SRC (set), 1)) == CONST_INT)
4952 p->new_sp_offset = INTVAL (XEXP (SET_SRC (set), 1));
4955 gcc_assert (REG_P (XEXP (SET_SRC (set), 1))
4956 && (REGNO (XEXP (SET_SRC (set), 1))
4957 < FIRST_PSEUDO_REGISTER)
4958 && p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
4960 = INTVAL (p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
4964 p->new_sp_equiv_reg = SET_SRC (set), p->new_sp_offset = 0;
4966 /* If we are adjusting SP, we adjust from the old data. */
4967 if (p->new_sp_equiv_reg == stack_pointer_rtx)
4969 p->new_sp_equiv_reg = p->sp_equiv_reg;
4970 p->new_sp_offset += p->sp_offset;
4973 gcc_assert (p->new_sp_equiv_reg && REG_P (p->new_sp_equiv_reg));
4978 /* Next handle the case where we are setting SP's equivalent register.
4979 If we already have a value to set it to, abort. We could update, but
4980 there seems little point in handling that case. Note that we have
4981 to allow for the case where we are setting the register set in
4982 the previous part of a PARALLEL inside a single insn. But use the
4983 old offset for any updates within this insn. We must allow for the case
4984 where the register is being set in a different (usually wider) mode than
4986 else if (p->new_sp_equiv_reg != 0 && reg_set_p (p->new_sp_equiv_reg, set))
4988 gcc_assert (!p->equiv_reg_src
4989 && REG_P (p->new_sp_equiv_reg)
4990 && REG_P (SET_DEST (set))
4991 && (GET_MODE_BITSIZE (GET_MODE (SET_DEST (set)))
4993 && REGNO (p->new_sp_equiv_reg) == REGNO (SET_DEST (set)));
4995 = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
4996 plus_constant (p->sp_equiv_reg,
5000 /* Otherwise, replace any references to SP in the insn to its new value
5001 and emit the insn. */
5004 SET_SRC (set) = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
5005 plus_constant (p->sp_equiv_reg,
5007 SET_DEST (set) = simplify_replace_rtx (SET_DEST (set), stack_pointer_rtx,
5008 plus_constant (p->sp_equiv_reg,
5014 /* Update the tracking information for registers set to constants. */
5017 update_epilogue_consts (rtx dest, rtx x, void *data)
5019 struct epi_info *p = (struct epi_info *) data;
5022 if (!REG_P (dest) || REGNO (dest) >= FIRST_PSEUDO_REGISTER)
5025 /* If we are either clobbering a register or doing a partial set,
5026 show we don't know the value. */
5027 else if (GET_CODE (x) == CLOBBER || ! rtx_equal_p (dest, SET_DEST (x)))
5028 p->const_equiv[REGNO (dest)] = 0;
5030 /* If we are setting it to a constant, record that constant. */
5031 else if (GET_CODE (SET_SRC (x)) == CONST_INT)
5032 p->const_equiv[REGNO (dest)] = SET_SRC (x);
5034 /* If this is a binary operation between a register we have been tracking
5035 and a constant, see if we can compute a new constant value. */
5036 else if (ARITHMETIC_P (SET_SRC (x))
5037 && REG_P (XEXP (SET_SRC (x), 0))
5038 && REGNO (XEXP (SET_SRC (x), 0)) < FIRST_PSEUDO_REGISTER
5039 && p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))] != 0
5040 && GET_CODE (XEXP (SET_SRC (x), 1)) == CONST_INT
5041 && 0 != (new = simplify_binary_operation
5042 (GET_CODE (SET_SRC (x)), GET_MODE (dest),
5043 p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))],
5044 XEXP (SET_SRC (x), 1)))
5045 && GET_CODE (new) == CONST_INT)
5046 p->const_equiv[REGNO (dest)] = new;
5048 /* Otherwise, we can't do anything with this value. */
5050 p->const_equiv[REGNO (dest)] = 0;
5053 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
5056 emit_equiv_load (struct epi_info *p)
5058 if (p->equiv_reg_src != 0)
5060 rtx dest = p->sp_equiv_reg;
5062 if (GET_MODE (p->equiv_reg_src) != GET_MODE (dest))
5063 dest = gen_rtx_REG (GET_MODE (p->equiv_reg_src),
5064 REGNO (p->sp_equiv_reg));
5066 emit_move_insn (dest, p->equiv_reg_src);
5067 p->equiv_reg_src = 0;
5072 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
5073 this into place with notes indicating where the prologue ends and where
5074 the epilogue begins. Update the basic block information when possible. */
5077 thread_prologue_and_epilogue_insns (rtx f ATTRIBUTE_UNUSED)
5081 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
5084 #ifdef HAVE_prologue
5085 rtx prologue_end = NULL_RTX;
5087 #if defined (HAVE_epilogue) || defined(HAVE_return)
5088 rtx epilogue_end = NULL_RTX;
5092 #ifdef HAVE_prologue
5096 seq = gen_prologue ();
5099 /* Retain a map of the prologue insns. */
5100 record_insns (seq, &prologue);
5101 prologue_end = emit_note (NOTE_INSN_PROLOGUE_END);
5105 set_insn_locators (seq, prologue_locator);
5107 /* Can't deal with multiple successors of the entry block
5108 at the moment. Function should always have at least one
5110 gcc_assert (EDGE_COUNT (ENTRY_BLOCK_PTR->succs) == 1);
5112 insert_insn_on_edge (seq, EDGE_SUCC (ENTRY_BLOCK_PTR, 0));
5117 /* If the exit block has no non-fake predecessors, we don't need
5119 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
5120 if ((e->flags & EDGE_FAKE) == 0)
5126 if (optimize && HAVE_return)
5128 /* If we're allowed to generate a simple return instruction,
5129 then by definition we don't need a full epilogue. Examine
5130 the block that falls through to EXIT. If it does not
5131 contain any code, examine its predecessors and try to
5132 emit (conditional) return instructions. */
5137 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
5138 if (e->flags & EDGE_FALLTHRU)
5144 /* Verify that there are no active instructions in the last block. */
5145 label = BB_END (last);
5146 while (label && !LABEL_P (label))
5148 if (active_insn_p (label))
5150 label = PREV_INSN (label);
5153 if (BB_HEAD (last) == label && LABEL_P (label))
5156 rtx epilogue_line_note = NULL_RTX;
5158 /* Locate the line number associated with the closing brace,
5159 if we can find one. */
5160 for (seq = get_last_insn ();
5161 seq && ! active_insn_p (seq);
5162 seq = PREV_INSN (seq))
5163 if (NOTE_P (seq) && NOTE_LINE_NUMBER (seq) > 0)
5165 epilogue_line_note = seq;
5169 for (ei2 = ei_start (last->preds); (e = ei_safe_edge (ei2)); )
5171 basic_block bb = e->src;
5174 if (bb == ENTRY_BLOCK_PTR)
5181 if (!JUMP_P (jump) || JUMP_LABEL (jump) != label)
5187 /* If we have an unconditional jump, we can replace that
5188 with a simple return instruction. */
5189 if (simplejump_p (jump))
5191 emit_return_into_block (bb, epilogue_line_note);
5195 /* If we have a conditional jump, we can try to replace
5196 that with a conditional return instruction. */
5197 else if (condjump_p (jump))
5199 if (! redirect_jump (jump, 0, 0))
5205 /* If this block has only one successor, it both jumps
5206 and falls through to the fallthru block, so we can't
5208 if (EDGE_COUNT (bb->succs) == 1)
5220 /* Fix up the CFG for the successful change we just made. */
5221 redirect_edge_succ (e, EXIT_BLOCK_PTR);
5224 /* Emit a return insn for the exit fallthru block. Whether
5225 this is still reachable will be determined later. */
5227 emit_barrier_after (BB_END (last));
5228 emit_return_into_block (last, epilogue_line_note);
5229 epilogue_end = BB_END (last);
5230 EDGE_SUCC (last, 0)->flags &= ~EDGE_FALLTHRU;
5235 /* Find the edge that falls through to EXIT. Other edges may exist
5236 due to RETURN instructions, but those don't need epilogues.
5237 There really shouldn't be a mixture -- either all should have
5238 been converted or none, however... */
5240 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
5241 if (e->flags & EDGE_FALLTHRU)
5246 #ifdef HAVE_epilogue
5250 epilogue_end = emit_note (NOTE_INSN_EPILOGUE_BEG);
5252 seq = gen_epilogue ();
5254 #ifdef INCOMING_RETURN_ADDR_RTX
5255 /* If this function returns with the stack depressed and we can support
5256 it, massage the epilogue to actually do that. */
5257 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
5258 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
5259 seq = keep_stack_depressed (seq);
5262 emit_jump_insn (seq);
5264 /* Retain a map of the epilogue insns. */
5265 record_insns (seq, &epilogue);
5266 set_insn_locators (seq, epilogue_locator);
5271 insert_insn_on_edge (seq, e);
5279 if (! next_active_insn (BB_END (e->src)))
5281 /* We have a fall-through edge to the exit block, the source is not
5282 at the end of the function, and there will be an assembler epilogue
5283 at the end of the function.
5284 We can't use force_nonfallthru here, because that would try to
5285 use return. Inserting a jump 'by hand' is extremely messy, so
5286 we take advantage of cfg_layout_finalize using
5287 fixup_fallthru_exit_predecessor. */
5288 cfg_layout_initialize (0);
5289 FOR_EACH_BB (cur_bb)
5290 if (cur_bb->index >= 0 && cur_bb->next_bb->index >= 0)
5291 cur_bb->rbi->next = cur_bb->next_bb;
5292 cfg_layout_finalize ();
5297 commit_edge_insertions ();
5299 #ifdef HAVE_sibcall_epilogue
5300 /* Emit sibling epilogues before any sibling call sites. */
5301 for (ei = ei_start (EXIT_BLOCK_PTR->preds); (e = ei_safe_edge (ei)); )
5303 basic_block bb = e->src;
5304 rtx insn = BB_END (bb);
5309 || ! SIBLING_CALL_P (insn))
5316 emit_insn (gen_sibcall_epilogue ());
5320 /* Retain a map of the epilogue insns. Used in life analysis to
5321 avoid getting rid of sibcall epilogue insns. Do this before we
5322 actually emit the sequence. */
5323 record_insns (seq, &sibcall_epilogue);
5324 set_insn_locators (seq, epilogue_locator);
5326 i = PREV_INSN (insn);
5327 newinsn = emit_insn_before (seq, insn);
5332 #ifdef HAVE_prologue
5333 /* This is probably all useless now that we use locators. */
5338 /* GDB handles `break f' by setting a breakpoint on the first
5339 line note after the prologue. Which means (1) that if
5340 there are line number notes before where we inserted the
5341 prologue we should move them, and (2) we should generate a
5342 note before the end of the first basic block, if there isn't
5345 ??? This behavior is completely broken when dealing with
5346 multiple entry functions. We simply place the note always
5347 into first basic block and let alternate entry points
5351 for (insn = prologue_end; insn; insn = prev)
5353 prev = PREV_INSN (insn);
5354 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5356 /* Note that we cannot reorder the first insn in the
5357 chain, since rest_of_compilation relies on that
5358 remaining constant. */
5361 reorder_insns (insn, insn, prologue_end);
5365 /* Find the last line number note in the first block. */
5366 for (insn = BB_END (ENTRY_BLOCK_PTR->next_bb);
5367 insn != prologue_end && insn;
5368 insn = PREV_INSN (insn))
5369 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5372 /* If we didn't find one, make a copy of the first line number
5376 for (insn = next_active_insn (prologue_end);
5378 insn = PREV_INSN (insn))
5379 if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
5381 emit_note_copy_after (insn, prologue_end);
5387 #ifdef HAVE_epilogue
5392 /* Similarly, move any line notes that appear after the epilogue.
5393 There is no need, however, to be quite so anal about the existence
5394 of such a note. Also move the NOTE_INSN_FUNCTION_END and (possibly)
5395 NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
5397 for (insn = epilogue_end; insn; insn = next)
5399 next = NEXT_INSN (insn);
5401 && (NOTE_LINE_NUMBER (insn) > 0
5402 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG
5403 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_END))
5404 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
5410 /* Reposition the prologue-end and epilogue-begin notes after instruction
5411 scheduling and delayed branch scheduling. */
5414 reposition_prologue_and_epilogue_notes (rtx f ATTRIBUTE_UNUSED)
5416 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
5417 rtx insn, last, note;
5420 if ((len = VARRAY_SIZE (prologue)) > 0)
5424 /* Scan from the beginning until we reach the last prologue insn.
5425 We apparently can't depend on basic_block_{head,end} after
5427 for (insn = f; insn; insn = NEXT_INSN (insn))
5431 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
5434 else if (contains (insn, prologue))
5444 /* Find the prologue-end note if we haven't already, and
5445 move it to just after the last prologue insn. */
5448 for (note = last; (note = NEXT_INSN (note));)
5450 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
5454 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
5456 last = NEXT_INSN (last);
5457 reorder_insns (note, note, last);
5461 if ((len = VARRAY_SIZE (epilogue)) > 0)
5465 /* Scan from the end until we reach the first epilogue insn.
5466 We apparently can't depend on basic_block_{head,end} after
5468 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
5472 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
5475 else if (contains (insn, epilogue))
5485 /* Find the epilogue-begin note if we haven't already, and
5486 move it to just before the first epilogue insn. */
5489 for (note = insn; (note = PREV_INSN (note));)
5491 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
5495 if (PREV_INSN (last) != note)
5496 reorder_insns (note, note, PREV_INSN (last));
5499 #endif /* HAVE_prologue or HAVE_epilogue */
5502 /* Called once, at initialization, to initialize function.c. */
5505 init_function_once (void)
5507 VARRAY_INT_INIT (prologue, 0, "prologue");
5508 VARRAY_INT_INIT (epilogue, 0, "epilogue");
5509 VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue");
5512 /* Resets insn_block_boundaries array. */
5515 reset_block_changes (void)
5517 VARRAY_TREE_INIT (cfun->ib_boundaries_block, 100, "ib_boundaries_block");
5518 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, NULL_TREE);
5521 /* Record the boundary for BLOCK. */
5523 record_block_change (tree block)
5531 last_block = VARRAY_TOP_TREE (cfun->ib_boundaries_block);
5532 VARRAY_POP (cfun->ib_boundaries_block);
5534 for (i = VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block); i < n; i++)
5535 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, last_block);
5537 VARRAY_PUSH_TREE (cfun->ib_boundaries_block, block);
5540 /* Finishes record of boundaries. */
5541 void finalize_block_changes (void)
5543 record_block_change (DECL_INITIAL (current_function_decl));
5546 /* For INSN return the BLOCK it belongs to. */
5548 check_block_change (rtx insn, tree *block)
5550 unsigned uid = INSN_UID (insn);
5552 if (uid >= VARRAY_ACTIVE_SIZE (cfun->ib_boundaries_block))
5555 *block = VARRAY_TREE (cfun->ib_boundaries_block, uid);
5558 /* Releases the ib_boundaries_block records. */
5560 free_block_changes (void)
5562 cfun->ib_boundaries_block = NULL;
5565 /* Returns the name of the current function. */
5567 current_function_name (void)
5569 return lang_hooks.decl_printable_name (cfun->decl, 2);
5572 #include "gt-function.h"