1 /* Expands front end tree to back end RTL for GCC.
2 Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
23 /* This file handles the generation of rtl code from tree structure
24 at the level of the function as a whole.
25 It creates the rtl expressions for parameters and auto variables
26 and has full responsibility for allocating stack slots.
28 `expand_function_start' is called at the beginning of a function,
29 before the function body is parsed, and `expand_function_end' is
30 called after parsing the body.
32 Call `assign_stack_local' to allocate a stack slot for a local variable.
33 This is usually done during the RTL generation for the function body,
34 but it can also be done in the reload pass when a pseudo-register does
35 not get a hard register. */
39 #include "coretypes.h"
50 #include "hard-reg-set.h"
51 #include "insn-config.h"
54 #include "basic-block.h"
59 #include "integrate.h"
60 #include "langhooks.h"
62 #include "cfglayout.h"
63 #include "tree-gimple.h"
64 #include "tree-pass.h"
67 #ifndef LOCAL_ALIGNMENT
68 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
71 #ifndef STACK_ALIGNMENT_NEEDED
72 #define STACK_ALIGNMENT_NEEDED 1
75 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
77 /* Some systems use __main in a way incompatible with its use in gcc, in these
78 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
79 give the same symbol without quotes for an alternative entry point. You
80 must define both, or neither. */
82 #define NAME__MAIN "__main"
85 /* Round a value to the lowest integer less than it that is a multiple of
86 the required alignment. Avoid using division in case the value is
87 negative. Assume the alignment is a power of two. */
88 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
90 /* Similar, but round to the next highest integer that meets the
92 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
94 /* Nonzero if function being compiled doesn't contain any calls
95 (ignoring the prologue and epilogue). This is set prior to
96 local register allocation and is valid for the remaining
98 int current_function_is_leaf
;
100 /* Nonzero if function being compiled doesn't modify the stack pointer
101 (ignoring the prologue and epilogue). This is only valid after
102 life_analysis has run. */
103 int current_function_sp_is_unchanging
;
105 /* Nonzero if the function being compiled is a leaf function which only
106 uses leaf registers. This is valid after reload (specifically after
107 sched2) and is useful only if the port defines LEAF_REGISTERS. */
108 int current_function_uses_only_leaf_regs
;
110 /* Nonzero once virtual register instantiation has been done.
111 assign_stack_local uses frame_pointer_rtx when this is nonzero.
112 calls.c:emit_library_call_value_1 uses it to set up
113 post-instantiation libcalls. */
114 int virtuals_instantiated
;
116 /* Assign unique numbers to labels generated for profiling, debugging, etc. */
117 static GTY(()) int funcdef_no
;
119 /* These variables hold pointers to functions to create and destroy
120 target specific, per-function data structures. */
121 struct machine_function
* (*init_machine_status
) (void);
123 /* The currently compiled function. */
124 struct function
*cfun
= 0;
127 DEF_VEC_ALLOC_I(int,heap
);
129 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
130 static VEC(int,heap
) *prologue
;
131 static VEC(int,heap
) *epilogue
;
133 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
135 static VEC(int,heap
) *sibcall_epilogue
;
137 /* In order to evaluate some expressions, such as function calls returning
138 structures in memory, we need to temporarily allocate stack locations.
139 We record each allocated temporary in the following structure.
141 Associated with each temporary slot is a nesting level. When we pop up
142 one level, all temporaries associated with the previous level are freed.
143 Normally, all temporaries are freed after the execution of the statement
144 in which they were created. However, if we are inside a ({...}) grouping,
145 the result may be in a temporary and hence must be preserved. If the
146 result could be in a temporary, we preserve it if we can determine which
147 one it is in. If we cannot determine which temporary may contain the
148 result, all temporaries are preserved. A temporary is preserved by
149 pretending it was allocated at the previous nesting level.
151 Automatic variables are also assigned temporary slots, at the nesting
152 level where they are defined. They are marked a "kept" so that
153 free_temp_slots will not free them. */
155 struct temp_slot
GTY(())
157 /* Points to next temporary slot. */
158 struct temp_slot
*next
;
159 /* Points to previous temporary slot. */
160 struct temp_slot
*prev
;
162 /* The rtx to used to reference the slot. */
164 /* The rtx used to represent the address if not the address of the
165 slot above. May be an EXPR_LIST if multiple addresses exist. */
167 /* The alignment (in bits) of the slot. */
169 /* The size, in units, of the slot. */
171 /* The type of the object in the slot, or zero if it doesn't correspond
172 to a type. We use this to determine whether a slot can be reused.
173 It can be reused if objects of the type of the new slot will always
174 conflict with objects of the type of the old slot. */
176 /* Nonzero if this temporary is currently in use. */
178 /* Nonzero if this temporary has its address taken. */
180 /* Nesting level at which this slot is being used. */
182 /* Nonzero if this should survive a call to free_temp_slots. */
184 /* The offset of the slot from the frame_pointer, including extra space
185 for alignment. This info is for combine_temp_slots. */
186 HOST_WIDE_INT base_offset
;
187 /* The size of the slot, including extra space for alignment. This
188 info is for combine_temp_slots. */
189 HOST_WIDE_INT full_size
;
192 /* Forward declarations. */
194 static rtx
assign_stack_local_1 (enum machine_mode
, HOST_WIDE_INT
, int,
196 static struct temp_slot
*find_temp_slot_from_address (rtx
);
197 static void pad_to_arg_alignment (struct args_size
*, int, struct args_size
*);
198 static void pad_below (struct args_size
*, enum machine_mode
, tree
);
199 static void reorder_blocks_1 (rtx
, tree
, VEC(tree
,heap
) **);
200 static void reorder_fix_fragments (tree
);
201 static int all_blocks (tree
, tree
*);
202 static tree
*get_block_vector (tree
, int *);
203 extern tree
debug_find_var_in_block_tree (tree
, tree
);
204 /* We always define `record_insns' even if it's not used so that we
205 can always export `prologue_epilogue_contains'. */
206 static void record_insns (rtx
, VEC(int,heap
) **) ATTRIBUTE_UNUSED
;
207 static int contains (rtx
, VEC(int,heap
) **);
209 static void emit_return_into_block (basic_block
, rtx
);
211 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
212 static rtx
keep_stack_depressed (rtx
);
214 static void prepare_function_start (tree
);
215 static void do_clobber_return_reg (rtx
, void *);
216 static void do_use_return_reg (rtx
, void *);
217 static void set_insn_locators (rtx
, int) ATTRIBUTE_UNUSED
;
219 /* Pointer to chain of `struct function' for containing functions. */
220 struct function
*outer_function_chain
;
222 /* Given a function decl for a containing function,
223 return the `struct function' for it. */
226 find_function_data (tree decl
)
230 for (p
= outer_function_chain
; p
; p
= p
->outer
)
237 /* Save the current context for compilation of a nested function.
238 This is called from language-specific code. The caller should use
239 the enter_nested langhook to save any language-specific state,
240 since this function knows only about language-independent
244 push_function_context_to (tree context ATTRIBUTE_UNUSED
)
249 init_dummy_function_start ();
252 p
->outer
= outer_function_chain
;
253 outer_function_chain
= p
;
255 lang_hooks
.function
.enter_nested (p
);
261 push_function_context (void)
263 push_function_context_to (current_function_decl
);
266 /* Restore the last saved context, at the end of a nested function.
267 This function is called from language-specific code. */
270 pop_function_context_from (tree context ATTRIBUTE_UNUSED
)
272 struct function
*p
= outer_function_chain
;
275 outer_function_chain
= p
->outer
;
277 current_function_decl
= p
->decl
;
279 lang_hooks
.function
.leave_nested (p
);
281 /* Reset variables that have known state during rtx generation. */
282 virtuals_instantiated
= 0;
283 generating_concat_p
= 1;
287 pop_function_context (void)
289 pop_function_context_from (current_function_decl
);
292 /* Clear out all parts of the state in F that can safely be discarded
293 after the function has been parsed, but not compiled, to let
294 garbage collection reclaim the memory. */
297 free_after_parsing (struct function
*f
)
299 /* f->expr->forced_labels is used by code generation. */
300 /* f->emit->regno_reg_rtx is used by code generation. */
301 /* f->varasm is used by code generation. */
302 /* f->eh->eh_return_stub_label is used by code generation. */
304 lang_hooks
.function
.final (f
);
307 /* Clear out all parts of the state in F that can safely be discarded
308 after the function has been compiled, to let garbage collection
309 reclaim the memory. */
312 free_after_compilation (struct function
*f
)
314 VEC_free (int, heap
, prologue
);
315 VEC_free (int, heap
, epilogue
);
316 VEC_free (int, heap
, sibcall_epilogue
);
325 f
->x_avail_temp_slots
= NULL
;
326 f
->x_used_temp_slots
= NULL
;
327 f
->arg_offset_rtx
= NULL
;
328 f
->return_rtx
= NULL
;
329 f
->internal_arg_pointer
= NULL
;
330 f
->x_nonlocal_goto_handler_labels
= NULL
;
331 f
->x_return_label
= NULL
;
332 f
->x_naked_return_label
= NULL
;
333 f
->x_stack_slot_list
= NULL
;
334 f
->x_tail_recursion_reentry
= NULL
;
335 f
->x_arg_pointer_save_area
= NULL
;
336 f
->x_parm_birth_insn
= NULL
;
337 f
->original_arg_vector
= NULL
;
338 f
->original_decl_initial
= NULL
;
339 f
->epilogue_delay_list
= NULL
;
342 /* Allocate fixed slots in the stack frame of the current function. */
344 /* Return size needed for stack frame based on slots so far allocated in
346 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
347 the caller may have to do that. */
350 get_func_frame_size (struct function
*f
)
352 if (FRAME_GROWS_DOWNWARD
)
353 return -f
->x_frame_offset
;
355 return f
->x_frame_offset
;
358 /* Return size needed for stack frame based on slots so far allocated.
359 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
360 the caller may have to do that. */
362 get_frame_size (void)
364 return get_func_frame_size (cfun
);
367 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
368 with machine mode MODE.
370 ALIGN controls the amount of alignment for the address of the slot:
371 0 means according to MODE,
372 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
373 -2 means use BITS_PER_UNIT,
374 positive specifies alignment boundary in bits.
376 We do not round to stack_boundary here.
378 FUNCTION specifies the function to allocate in. */
381 assign_stack_local_1 (enum machine_mode mode
, HOST_WIDE_INT size
, int align
,
382 struct function
*function
)
385 int bigend_correction
= 0;
386 unsigned int alignment
;
387 int frame_off
, frame_alignment
, frame_phase
;
394 alignment
= BIGGEST_ALIGNMENT
;
396 alignment
= GET_MODE_ALIGNMENT (mode
);
398 /* Allow the target to (possibly) increase the alignment of this
400 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
402 alignment
= LOCAL_ALIGNMENT (type
, alignment
);
404 alignment
/= BITS_PER_UNIT
;
406 else if (align
== -1)
408 alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
409 size
= CEIL_ROUND (size
, alignment
);
411 else if (align
== -2)
412 alignment
= 1; /* BITS_PER_UNIT / BITS_PER_UNIT */
414 alignment
= align
/ BITS_PER_UNIT
;
416 if (FRAME_GROWS_DOWNWARD
)
417 function
->x_frame_offset
-= size
;
419 /* Ignore alignment we can't do with expected alignment of the boundary. */
420 if (alignment
* BITS_PER_UNIT
> PREFERRED_STACK_BOUNDARY
)
421 alignment
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
423 if (function
->stack_alignment_needed
< alignment
* BITS_PER_UNIT
)
424 function
->stack_alignment_needed
= alignment
* BITS_PER_UNIT
;
426 /* Calculate how many bytes the start of local variables is off from
428 frame_alignment
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
429 frame_off
= STARTING_FRAME_OFFSET
% frame_alignment
;
430 frame_phase
= frame_off
? frame_alignment
- frame_off
: 0;
432 /* Round the frame offset to the specified alignment. The default is
433 to always honor requests to align the stack but a port may choose to
434 do its own stack alignment by defining STACK_ALIGNMENT_NEEDED. */
435 if (STACK_ALIGNMENT_NEEDED
439 /* We must be careful here, since FRAME_OFFSET might be negative and
440 division with a negative dividend isn't as well defined as we might
441 like. So we instead assume that ALIGNMENT is a power of two and
442 use logical operations which are unambiguous. */
443 if (FRAME_GROWS_DOWNWARD
)
444 function
->x_frame_offset
445 = (FLOOR_ROUND (function
->x_frame_offset
- frame_phase
,
446 (unsigned HOST_WIDE_INT
) alignment
)
449 function
->x_frame_offset
450 = (CEIL_ROUND (function
->x_frame_offset
- frame_phase
,
451 (unsigned HOST_WIDE_INT
) alignment
)
455 /* On a big-endian machine, if we are allocating more space than we will use,
456 use the least significant bytes of those that are allocated. */
457 if (BYTES_BIG_ENDIAN
&& mode
!= BLKmode
&& GET_MODE_SIZE (mode
) < size
)
458 bigend_correction
= size
- GET_MODE_SIZE (mode
);
460 /* If we have already instantiated virtual registers, return the actual
461 address relative to the frame pointer. */
462 if (function
== cfun
&& virtuals_instantiated
)
463 addr
= plus_constant (frame_pointer_rtx
,
465 (frame_offset
+ bigend_correction
466 + STARTING_FRAME_OFFSET
, Pmode
));
468 addr
= plus_constant (virtual_stack_vars_rtx
,
470 (function
->x_frame_offset
+ bigend_correction
,
473 if (!FRAME_GROWS_DOWNWARD
)
474 function
->x_frame_offset
+= size
;
476 x
= gen_rtx_MEM (mode
, addr
);
477 MEM_NOTRAP_P (x
) = 1;
479 function
->x_stack_slot_list
480 = gen_rtx_EXPR_LIST (VOIDmode
, x
, function
->x_stack_slot_list
);
482 /* Try to detect frame size overflows. */
483 if ((FRAME_GROWS_DOWNWARD
484 ? (unsigned HOST_WIDE_INT
) -function
->x_frame_offset
485 : (unsigned HOST_WIDE_INT
) function
->x_frame_offset
)
486 > ((unsigned HOST_WIDE_INT
) 1 << (BITS_PER_WORD
- 1))
487 /* Leave room for the fixed part of the frame. */
488 - 64 * UNITS_PER_WORD
)
490 error ("%Jtotal size of local objects too large", function
->decl
);
491 /* Avoid duplicate error messages as much as possible. */
492 function
->x_frame_offset
= 0;
498 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
502 assign_stack_local (enum machine_mode mode
, HOST_WIDE_INT size
, int align
)
504 return assign_stack_local_1 (mode
, size
, align
, cfun
);
508 /* Removes temporary slot TEMP from LIST. */
511 cut_slot_from_list (struct temp_slot
*temp
, struct temp_slot
**list
)
514 temp
->next
->prev
= temp
->prev
;
516 temp
->prev
->next
= temp
->next
;
520 temp
->prev
= temp
->next
= NULL
;
523 /* Inserts temporary slot TEMP to LIST. */
526 insert_slot_to_list (struct temp_slot
*temp
, struct temp_slot
**list
)
530 (*list
)->prev
= temp
;
535 /* Returns the list of used temp slots at LEVEL. */
537 static struct temp_slot
**
538 temp_slots_at_level (int level
)
541 if (!used_temp_slots
)
542 VARRAY_GENERIC_PTR_INIT (used_temp_slots
, 3, "used_temp_slots");
544 while (level
>= (int) VARRAY_ACTIVE_SIZE (used_temp_slots
))
545 VARRAY_PUSH_GENERIC_PTR (used_temp_slots
, NULL
);
547 return (struct temp_slot
**) &VARRAY_GENERIC_PTR (used_temp_slots
, level
);
550 /* Returns the maximal temporary slot level. */
553 max_slot_level (void)
555 if (!used_temp_slots
)
558 return VARRAY_ACTIVE_SIZE (used_temp_slots
) - 1;
561 /* Moves temporary slot TEMP to LEVEL. */
564 move_slot_to_level (struct temp_slot
*temp
, int level
)
566 cut_slot_from_list (temp
, temp_slots_at_level (temp
->level
));
567 insert_slot_to_list (temp
, temp_slots_at_level (level
));
571 /* Make temporary slot TEMP available. */
574 make_slot_available (struct temp_slot
*temp
)
576 cut_slot_from_list (temp
, temp_slots_at_level (temp
->level
));
577 insert_slot_to_list (temp
, &avail_temp_slots
);
582 /* Allocate a temporary stack slot and record it for possible later
585 MODE is the machine mode to be given to the returned rtx.
587 SIZE is the size in units of the space required. We do no rounding here
588 since assign_stack_local will do any required rounding.
590 KEEP is 1 if this slot is to be retained after a call to
591 free_temp_slots. Automatic variables for a block are allocated
592 with this flag. KEEP values of 2 or 3 were needed respectively
593 for variables whose lifetime is controlled by CLEANUP_POINT_EXPRs
594 or for SAVE_EXPRs, but they are now unused.
596 TYPE is the type that will be used for the stack slot. */
599 assign_stack_temp_for_type (enum machine_mode mode
, HOST_WIDE_INT size
,
603 struct temp_slot
*p
, *best_p
= 0, *selected
= NULL
, **pp
;
606 /* If SIZE is -1 it means that somebody tried to allocate a temporary
607 of a variable size. */
608 gcc_assert (size
!= -1);
610 /* These are now unused. */
611 gcc_assert (keep
<= 1);
614 align
= BIGGEST_ALIGNMENT
;
616 align
= GET_MODE_ALIGNMENT (mode
);
619 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
622 align
= LOCAL_ALIGNMENT (type
, align
);
624 /* Try to find an available, already-allocated temporary of the proper
625 mode which meets the size and alignment requirements. Choose the
626 smallest one with the closest alignment. */
627 for (p
= avail_temp_slots
; p
; p
= p
->next
)
629 if (p
->align
>= align
&& p
->size
>= size
&& GET_MODE (p
->slot
) == mode
630 && objects_must_conflict_p (p
->type
, type
)
631 && (best_p
== 0 || best_p
->size
> p
->size
632 || (best_p
->size
== p
->size
&& best_p
->align
> p
->align
)))
634 if (p
->align
== align
&& p
->size
== size
)
637 cut_slot_from_list (selected
, &avail_temp_slots
);
645 /* Make our best, if any, the one to use. */
649 cut_slot_from_list (selected
, &avail_temp_slots
);
651 /* If there are enough aligned bytes left over, make them into a new
652 temp_slot so that the extra bytes don't get wasted. Do this only
653 for BLKmode slots, so that we can be sure of the alignment. */
654 if (GET_MODE (best_p
->slot
) == BLKmode
)
656 int alignment
= best_p
->align
/ BITS_PER_UNIT
;
657 HOST_WIDE_INT rounded_size
= CEIL_ROUND (size
, alignment
);
659 if (best_p
->size
- rounded_size
>= alignment
)
661 p
= ggc_alloc (sizeof (struct temp_slot
));
662 p
->in_use
= p
->addr_taken
= 0;
663 p
->size
= best_p
->size
- rounded_size
;
664 p
->base_offset
= best_p
->base_offset
+ rounded_size
;
665 p
->full_size
= best_p
->full_size
- rounded_size
;
666 p
->slot
= adjust_address_nv (best_p
->slot
, BLKmode
, rounded_size
);
667 p
->align
= best_p
->align
;
669 p
->type
= best_p
->type
;
670 insert_slot_to_list (p
, &avail_temp_slots
);
672 stack_slot_list
= gen_rtx_EXPR_LIST (VOIDmode
, p
->slot
,
675 best_p
->size
= rounded_size
;
676 best_p
->full_size
= rounded_size
;
681 /* If we still didn't find one, make a new temporary. */
684 HOST_WIDE_INT frame_offset_old
= frame_offset
;
686 p
= ggc_alloc (sizeof (struct temp_slot
));
688 /* We are passing an explicit alignment request to assign_stack_local.
689 One side effect of that is assign_stack_local will not round SIZE
690 to ensure the frame offset remains suitably aligned.
692 So for requests which depended on the rounding of SIZE, we go ahead
693 and round it now. We also make sure ALIGNMENT is at least
694 BIGGEST_ALIGNMENT. */
695 gcc_assert (mode
!= BLKmode
|| align
== BIGGEST_ALIGNMENT
);
696 p
->slot
= assign_stack_local (mode
,
698 ? CEIL_ROUND (size
, (int) align
/ BITS_PER_UNIT
)
704 /* The following slot size computation is necessary because we don't
705 know the actual size of the temporary slot until assign_stack_local
706 has performed all the frame alignment and size rounding for the
707 requested temporary. Note that extra space added for alignment
708 can be either above or below this stack slot depending on which
709 way the frame grows. We include the extra space if and only if it
710 is above this slot. */
711 if (FRAME_GROWS_DOWNWARD
)
712 p
->size
= frame_offset_old
- frame_offset
;
716 /* Now define the fields used by combine_temp_slots. */
717 if (FRAME_GROWS_DOWNWARD
)
719 p
->base_offset
= frame_offset
;
720 p
->full_size
= frame_offset_old
- frame_offset
;
724 p
->base_offset
= frame_offset_old
;
725 p
->full_size
= frame_offset
- frame_offset_old
;
736 p
->level
= temp_slot_level
;
739 pp
= temp_slots_at_level (p
->level
);
740 insert_slot_to_list (p
, pp
);
742 /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
743 slot
= gen_rtx_MEM (mode
, XEXP (p
->slot
, 0));
744 stack_slot_list
= gen_rtx_EXPR_LIST (VOIDmode
, slot
, stack_slot_list
);
746 /* If we know the alias set for the memory that will be used, use
747 it. If there's no TYPE, then we don't know anything about the
748 alias set for the memory. */
749 set_mem_alias_set (slot
, type
? get_alias_set (type
) : 0);
750 set_mem_align (slot
, align
);
752 /* If a type is specified, set the relevant flags. */
755 MEM_VOLATILE_P (slot
) = TYPE_VOLATILE (type
);
756 MEM_SET_IN_STRUCT_P (slot
, AGGREGATE_TYPE_P (type
));
758 MEM_NOTRAP_P (slot
) = 1;
763 /* Allocate a temporary stack slot and record it for possible later
764 reuse. First three arguments are same as in preceding function. */
767 assign_stack_temp (enum machine_mode mode
, HOST_WIDE_INT size
, int keep
)
769 return assign_stack_temp_for_type (mode
, size
, keep
, NULL_TREE
);
772 /* Assign a temporary.
773 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
774 and so that should be used in error messages. In either case, we
775 allocate of the given type.
776 KEEP is as for assign_stack_temp.
777 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
778 it is 0 if a register is OK.
779 DONT_PROMOTE is 1 if we should not promote values in register
783 assign_temp (tree type_or_decl
, int keep
, int memory_required
,
784 int dont_promote ATTRIBUTE_UNUSED
)
787 enum machine_mode mode
;
792 if (DECL_P (type_or_decl
))
793 decl
= type_or_decl
, type
= TREE_TYPE (decl
);
795 decl
= NULL
, type
= type_or_decl
;
797 mode
= TYPE_MODE (type
);
799 unsignedp
= TYPE_UNSIGNED (type
);
802 if (mode
== BLKmode
|| memory_required
)
804 HOST_WIDE_INT size
= int_size_in_bytes (type
);
808 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
809 problems with allocating the stack space. */
813 /* Unfortunately, we don't yet know how to allocate variable-sized
814 temporaries. However, sometimes we have a fixed upper limit on
815 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
816 instead. This is the case for Chill variable-sized strings. */
817 if (size
== -1 && TREE_CODE (type
) == ARRAY_TYPE
818 && TYPE_ARRAY_MAX_SIZE (type
) != NULL_TREE
819 && host_integerp (TYPE_ARRAY_MAX_SIZE (type
), 1))
820 size
= tree_low_cst (TYPE_ARRAY_MAX_SIZE (type
), 1);
822 /* If we still haven't been able to get a size, see if the language
823 can compute a maximum size. */
825 && (size_tree
= lang_hooks
.types
.max_size (type
)) != 0
826 && host_integerp (size_tree
, 1))
827 size
= tree_low_cst (size_tree
, 1);
829 /* The size of the temporary may be too large to fit into an integer. */
830 /* ??? Not sure this should happen except for user silliness, so limit
831 this to things that aren't compiler-generated temporaries. The
832 rest of the time we'll die in assign_stack_temp_for_type. */
833 if (decl
&& size
== -1
834 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
)
836 error ("size of variable %q+D is too large", decl
);
840 tmp
= assign_stack_temp_for_type (mode
, size
, keep
, type
);
846 mode
= promote_mode (type
, mode
, &unsignedp
, 0);
849 return gen_reg_rtx (mode
);
852 /* Combine temporary stack slots which are adjacent on the stack.
854 This allows for better use of already allocated stack space. This is only
855 done for BLKmode slots because we can be sure that we won't have alignment
856 problems in this case. */
859 combine_temp_slots (void)
861 struct temp_slot
*p
, *q
, *next
, *next_q
;
864 /* We can't combine slots, because the information about which slot
865 is in which alias set will be lost. */
866 if (flag_strict_aliasing
)
869 /* If there are a lot of temp slots, don't do anything unless
870 high levels of optimization. */
871 if (! flag_expensive_optimizations
)
872 for (p
= avail_temp_slots
, num_slots
= 0; p
; p
= p
->next
, num_slots
++)
873 if (num_slots
> 100 || (num_slots
> 10 && optimize
== 0))
876 for (p
= avail_temp_slots
; p
; p
= next
)
882 if (GET_MODE (p
->slot
) != BLKmode
)
885 for (q
= p
->next
; q
; q
= next_q
)
891 if (GET_MODE (q
->slot
) != BLKmode
)
894 if (p
->base_offset
+ p
->full_size
== q
->base_offset
)
896 /* Q comes after P; combine Q into P. */
898 p
->full_size
+= q
->full_size
;
901 else if (q
->base_offset
+ q
->full_size
== p
->base_offset
)
903 /* P comes after Q; combine P into Q. */
905 q
->full_size
+= p
->full_size
;
910 cut_slot_from_list (q
, &avail_temp_slots
);
913 /* Either delete P or advance past it. */
915 cut_slot_from_list (p
, &avail_temp_slots
);
919 /* Find the temp slot corresponding to the object at address X. */
921 static struct temp_slot
*
922 find_temp_slot_from_address (rtx x
)
928 for (i
= max_slot_level (); i
>= 0; i
--)
929 for (p
= *temp_slots_at_level (i
); p
; p
= p
->next
)
931 if (XEXP (p
->slot
, 0) == x
933 || (GET_CODE (x
) == PLUS
934 && XEXP (x
, 0) == virtual_stack_vars_rtx
935 && GET_CODE (XEXP (x
, 1)) == CONST_INT
936 && INTVAL (XEXP (x
, 1)) >= p
->base_offset
937 && INTVAL (XEXP (x
, 1)) < p
->base_offset
+ p
->full_size
))
940 else if (p
->address
!= 0 && GET_CODE (p
->address
) == EXPR_LIST
)
941 for (next
= p
->address
; next
; next
= XEXP (next
, 1))
942 if (XEXP (next
, 0) == x
)
946 /* If we have a sum involving a register, see if it points to a temp
948 if (GET_CODE (x
) == PLUS
&& REG_P (XEXP (x
, 0))
949 && (p
= find_temp_slot_from_address (XEXP (x
, 0))) != 0)
951 else if (GET_CODE (x
) == PLUS
&& REG_P (XEXP (x
, 1))
952 && (p
= find_temp_slot_from_address (XEXP (x
, 1))) != 0)
958 /* Indicate that NEW is an alternate way of referring to the temp slot
959 that previously was known by OLD. */
962 update_temp_slot_address (rtx old
, rtx
new)
966 if (rtx_equal_p (old
, new))
969 p
= find_temp_slot_from_address (old
);
971 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
972 is a register, see if one operand of the PLUS is a temporary
973 location. If so, NEW points into it. Otherwise, if both OLD and
974 NEW are a PLUS and if there is a register in common between them.
975 If so, try a recursive call on those values. */
978 if (GET_CODE (old
) != PLUS
)
983 update_temp_slot_address (XEXP (old
, 0), new);
984 update_temp_slot_address (XEXP (old
, 1), new);
987 else if (GET_CODE (new) != PLUS
)
990 if (rtx_equal_p (XEXP (old
, 0), XEXP (new, 0)))
991 update_temp_slot_address (XEXP (old
, 1), XEXP (new, 1));
992 else if (rtx_equal_p (XEXP (old
, 1), XEXP (new, 0)))
993 update_temp_slot_address (XEXP (old
, 0), XEXP (new, 1));
994 else if (rtx_equal_p (XEXP (old
, 0), XEXP (new, 1)))
995 update_temp_slot_address (XEXP (old
, 1), XEXP (new, 0));
996 else if (rtx_equal_p (XEXP (old
, 1), XEXP (new, 1)))
997 update_temp_slot_address (XEXP (old
, 0), XEXP (new, 0));
1002 /* Otherwise add an alias for the temp's address. */
1003 else if (p
->address
== 0)
1007 if (GET_CODE (p
->address
) != EXPR_LIST
)
1008 p
->address
= gen_rtx_EXPR_LIST (VOIDmode
, p
->address
, NULL_RTX
);
1010 p
->address
= gen_rtx_EXPR_LIST (VOIDmode
, new, p
->address
);
1014 /* If X could be a reference to a temporary slot, mark the fact that its
1015 address was taken. */
1018 mark_temp_addr_taken (rtx x
)
1020 struct temp_slot
*p
;
1025 /* If X is not in memory or is at a constant address, it cannot be in
1026 a temporary slot. */
1027 if (!MEM_P (x
) || CONSTANT_P (XEXP (x
, 0)))
1030 p
= find_temp_slot_from_address (XEXP (x
, 0));
1035 /* If X could be a reference to a temporary slot, mark that slot as
1036 belonging to the to one level higher than the current level. If X
1037 matched one of our slots, just mark that one. Otherwise, we can't
1038 easily predict which it is, so upgrade all of them. Kept slots
1039 need not be touched.
1041 This is called when an ({...}) construct occurs and a statement
1042 returns a value in memory. */
1045 preserve_temp_slots (rtx x
)
1047 struct temp_slot
*p
= 0, *next
;
1049 /* If there is no result, we still might have some objects whose address
1050 were taken, so we need to make sure they stay around. */
1053 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1058 move_slot_to_level (p
, temp_slot_level
- 1);
1064 /* If X is a register that is being used as a pointer, see if we have
1065 a temporary slot we know it points to. To be consistent with
1066 the code below, we really should preserve all non-kept slots
1067 if we can't find a match, but that seems to be much too costly. */
1068 if (REG_P (x
) && REG_POINTER (x
))
1069 p
= find_temp_slot_from_address (x
);
1071 /* If X is not in memory or is at a constant address, it cannot be in
1072 a temporary slot, but it can contain something whose address was
1074 if (p
== 0 && (!MEM_P (x
) || CONSTANT_P (XEXP (x
, 0))))
1076 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1081 move_slot_to_level (p
, temp_slot_level
- 1);
1087 /* First see if we can find a match. */
1089 p
= find_temp_slot_from_address (XEXP (x
, 0));
1093 /* Move everything at our level whose address was taken to our new
1094 level in case we used its address. */
1095 struct temp_slot
*q
;
1097 if (p
->level
== temp_slot_level
)
1099 for (q
= *temp_slots_at_level (temp_slot_level
); q
; q
= next
)
1103 if (p
!= q
&& q
->addr_taken
)
1104 move_slot_to_level (q
, temp_slot_level
- 1);
1107 move_slot_to_level (p
, temp_slot_level
- 1);
1113 /* Otherwise, preserve all non-kept slots at this level. */
1114 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1119 move_slot_to_level (p
, temp_slot_level
- 1);
1123 /* Free all temporaries used so far. This is normally called at the
1124 end of generating code for a statement. */
1127 free_temp_slots (void)
1129 struct temp_slot
*p
, *next
;
1131 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1136 make_slot_available (p
);
1139 combine_temp_slots ();
1142 /* Push deeper into the nesting level for stack temporaries. */
1145 push_temp_slots (void)
1150 /* Pop a temporary nesting level. All slots in use in the current level
1154 pop_temp_slots (void)
1156 struct temp_slot
*p
, *next
;
1158 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1161 make_slot_available (p
);
1164 combine_temp_slots ();
1169 /* Initialize temporary slots. */
1172 init_temp_slots (void)
1174 /* We have not allocated any temporaries yet. */
1175 avail_temp_slots
= 0;
1176 used_temp_slots
= 0;
1177 temp_slot_level
= 0;
1180 /* These routines are responsible for converting virtual register references
1181 to the actual hard register references once RTL generation is complete.
1183 The following four variables are used for communication between the
1184 routines. They contain the offsets of the virtual registers from their
1185 respective hard registers. */
1187 static int in_arg_offset
;
1188 static int var_offset
;
1189 static int dynamic_offset
;
1190 static int out_arg_offset
;
1191 static int cfa_offset
;
1193 /* In most machines, the stack pointer register is equivalent to the bottom
1196 #ifndef STACK_POINTER_OFFSET
1197 #define STACK_POINTER_OFFSET 0
1200 /* If not defined, pick an appropriate default for the offset of dynamically
1201 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
1202 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
1204 #ifndef STACK_DYNAMIC_OFFSET
1206 /* The bottom of the stack points to the actual arguments. If
1207 REG_PARM_STACK_SPACE is defined, this includes the space for the register
1208 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
1209 stack space for register parameters is not pushed by the caller, but
1210 rather part of the fixed stack areas and hence not included in
1211 `current_function_outgoing_args_size'. Nevertheless, we must allow
1212 for it when allocating stack dynamic objects. */
1214 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1215 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1216 ((ACCUMULATE_OUTGOING_ARGS \
1217 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
1218 + (STACK_POINTER_OFFSET)) \
1221 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1222 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
1223 + (STACK_POINTER_OFFSET))
1228 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
1229 is a virtual register, return the equivalent hard register and set the
1230 offset indirectly through the pointer. Otherwise, return 0. */
1233 instantiate_new_reg (rtx x
, HOST_WIDE_INT
*poffset
)
1236 HOST_WIDE_INT offset
;
1238 if (x
== virtual_incoming_args_rtx
)
1239 new = arg_pointer_rtx
, offset
= in_arg_offset
;
1240 else if (x
== virtual_stack_vars_rtx
)
1241 new = frame_pointer_rtx
, offset
= var_offset
;
1242 else if (x
== virtual_stack_dynamic_rtx
)
1243 new = stack_pointer_rtx
, offset
= dynamic_offset
;
1244 else if (x
== virtual_outgoing_args_rtx
)
1245 new = stack_pointer_rtx
, offset
= out_arg_offset
;
1246 else if (x
== virtual_cfa_rtx
)
1247 new = arg_pointer_rtx
, offset
= cfa_offset
;
1255 /* A subroutine of instantiate_virtual_regs, called via for_each_rtx.
1256 Instantiate any virtual registers present inside of *LOC. The expression
1257 is simplified, as much as possible, but is not to be considered "valid"
1258 in any sense implied by the target. If any change is made, set CHANGED
1262 instantiate_virtual_regs_in_rtx (rtx
*loc
, void *data
)
1264 HOST_WIDE_INT offset
;
1265 bool *changed
= (bool *) data
;
1272 switch (GET_CODE (x
))
1275 new = instantiate_new_reg (x
, &offset
);
1278 *loc
= plus_constant (new, offset
);
1285 new = instantiate_new_reg (XEXP (x
, 0), &offset
);
1288 new = plus_constant (new, offset
);
1289 *loc
= simplify_gen_binary (PLUS
, GET_MODE (x
), new, XEXP (x
, 1));
1295 /* FIXME -- from old code */
1296 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
1297 we can commute the PLUS and SUBREG because pointers into the
1298 frame are well-behaved. */
1308 /* A subroutine of instantiate_virtual_regs_in_insn. Return true if X
1309 matches the predicate for insn CODE operand OPERAND. */
1312 safe_insn_predicate (int code
, int operand
, rtx x
)
1314 const struct insn_operand_data
*op_data
;
1319 op_data
= &insn_data
[code
].operand
[operand
];
1320 if (op_data
->predicate
== NULL
)
1323 return op_data
->predicate (x
, op_data
->mode
);
1326 /* A subroutine of instantiate_virtual_regs. Instantiate any virtual
1327 registers present inside of insn. The result will be a valid insn. */
1330 instantiate_virtual_regs_in_insn (rtx insn
)
1332 HOST_WIDE_INT offset
;
1334 bool any_change
= false;
1335 rtx set
, new, x
, seq
;
1337 /* There are some special cases to be handled first. */
1338 set
= single_set (insn
);
1341 /* We're allowed to assign to a virtual register. This is interpreted
1342 to mean that the underlying register gets assigned the inverse
1343 transformation. This is used, for example, in the handling of
1345 new = instantiate_new_reg (SET_DEST (set
), &offset
);
1350 for_each_rtx (&SET_SRC (set
), instantiate_virtual_regs_in_rtx
, NULL
);
1351 x
= simplify_gen_binary (PLUS
, GET_MODE (new), SET_SRC (set
),
1353 x
= force_operand (x
, new);
1355 emit_move_insn (new, x
);
1360 emit_insn_before (seq
, insn
);
1365 /* Handle a straight copy from a virtual register by generating a
1366 new add insn. The difference between this and falling through
1367 to the generic case is avoiding a new pseudo and eliminating a
1368 move insn in the initial rtl stream. */
1369 new = instantiate_new_reg (SET_SRC (set
), &offset
);
1370 if (new && offset
!= 0
1371 && REG_P (SET_DEST (set
))
1372 && REGNO (SET_DEST (set
)) > LAST_VIRTUAL_REGISTER
)
1376 x
= expand_simple_binop (GET_MODE (SET_DEST (set
)), PLUS
,
1377 new, GEN_INT (offset
), SET_DEST (set
),
1378 1, OPTAB_LIB_WIDEN
);
1379 if (x
!= SET_DEST (set
))
1380 emit_move_insn (SET_DEST (set
), x
);
1385 emit_insn_before (seq
, insn
);
1390 extract_insn (insn
);
1391 insn_code
= INSN_CODE (insn
);
1393 /* Handle a plus involving a virtual register by determining if the
1394 operands remain valid if they're modified in place. */
1395 if (GET_CODE (SET_SRC (set
)) == PLUS
1396 && recog_data
.n_operands
>= 3
1397 && recog_data
.operand_loc
[1] == &XEXP (SET_SRC (set
), 0)
1398 && recog_data
.operand_loc
[2] == &XEXP (SET_SRC (set
), 1)
1399 && GET_CODE (recog_data
.operand
[2]) == CONST_INT
1400 && (new = instantiate_new_reg (recog_data
.operand
[1], &offset
)))
1402 offset
+= INTVAL (recog_data
.operand
[2]);
1404 /* If the sum is zero, then replace with a plain move. */
1406 && REG_P (SET_DEST (set
))
1407 && REGNO (SET_DEST (set
)) > LAST_VIRTUAL_REGISTER
)
1410 emit_move_insn (SET_DEST (set
), new);
1414 emit_insn_before (seq
, insn
);
1419 x
= gen_int_mode (offset
, recog_data
.operand_mode
[2]);
1421 /* Using validate_change and apply_change_group here leaves
1422 recog_data in an invalid state. Since we know exactly what
1423 we want to check, do those two by hand. */
1424 if (safe_insn_predicate (insn_code
, 1, new)
1425 && safe_insn_predicate (insn_code
, 2, x
))
1427 *recog_data
.operand_loc
[1] = recog_data
.operand
[1] = new;
1428 *recog_data
.operand_loc
[2] = recog_data
.operand
[2] = x
;
1431 /* Fall through into the regular operand fixup loop in
1432 order to take care of operands other than 1 and 2. */
1438 extract_insn (insn
);
1439 insn_code
= INSN_CODE (insn
);
1442 /* In the general case, we expect virtual registers to appear only in
1443 operands, and then only as either bare registers or inside memories. */
1444 for (i
= 0; i
< recog_data
.n_operands
; ++i
)
1446 x
= recog_data
.operand
[i
];
1447 switch (GET_CODE (x
))
1451 rtx addr
= XEXP (x
, 0);
1452 bool changed
= false;
1454 for_each_rtx (&addr
, instantiate_virtual_regs_in_rtx
, &changed
);
1459 x
= replace_equiv_address (x
, addr
);
1463 emit_insn_before (seq
, insn
);
1468 new = instantiate_new_reg (x
, &offset
);
1477 /* Careful, special mode predicates may have stuff in
1478 insn_data[insn_code].operand[i].mode that isn't useful
1479 to us for computing a new value. */
1480 /* ??? Recognize address_operand and/or "p" constraints
1481 to see if (plus new offset) is a valid before we put
1482 this through expand_simple_binop. */
1483 x
= expand_simple_binop (GET_MODE (x
), PLUS
, new,
1484 GEN_INT (offset
), NULL_RTX
,
1485 1, OPTAB_LIB_WIDEN
);
1488 emit_insn_before (seq
, insn
);
1493 new = instantiate_new_reg (SUBREG_REG (x
), &offset
);
1499 new = expand_simple_binop (GET_MODE (new), PLUS
, new,
1500 GEN_INT (offset
), NULL_RTX
,
1501 1, OPTAB_LIB_WIDEN
);
1504 emit_insn_before (seq
, insn
);
1506 x
= simplify_gen_subreg (recog_data
.operand_mode
[i
], new,
1507 GET_MODE (new), SUBREG_BYTE (x
));
1514 /* At this point, X contains the new value for the operand.
1515 Validate the new value vs the insn predicate. Note that
1516 asm insns will have insn_code -1 here. */
1517 if (!safe_insn_predicate (insn_code
, i
, x
))
1518 x
= force_reg (insn_data
[insn_code
].operand
[i
].mode
, x
);
1520 *recog_data
.operand_loc
[i
] = recog_data
.operand
[i
] = x
;
1526 /* Propagate operand changes into the duplicates. */
1527 for (i
= 0; i
< recog_data
.n_dups
; ++i
)
1528 *recog_data
.dup_loc
[i
]
1529 = recog_data
.operand
[(unsigned)recog_data
.dup_num
[i
]];
1531 /* Force re-recognition of the instruction for validation. */
1532 INSN_CODE (insn
) = -1;
1535 if (asm_noperands (PATTERN (insn
)) >= 0)
1537 if (!check_asm_operands (PATTERN (insn
)))
1539 error_for_asm (insn
, "impossible constraint in %<asm%>");
1545 if (recog_memoized (insn
) < 0)
1546 fatal_insn_not_found (insn
);
1550 /* Subroutine of instantiate_decls. Given RTL representing a decl,
1551 do any instantiation required. */
1554 instantiate_decl (rtx x
)
1561 /* If this is a CONCAT, recurse for the pieces. */
1562 if (GET_CODE (x
) == CONCAT
)
1564 instantiate_decl (XEXP (x
, 0));
1565 instantiate_decl (XEXP (x
, 1));
1569 /* If this is not a MEM, no need to do anything. Similarly if the
1570 address is a constant or a register that is not a virtual register. */
1575 if (CONSTANT_P (addr
)
1577 && (REGNO (addr
) < FIRST_VIRTUAL_REGISTER
1578 || REGNO (addr
) > LAST_VIRTUAL_REGISTER
)))
1581 for_each_rtx (&XEXP (x
, 0), instantiate_virtual_regs_in_rtx
, NULL
);
1584 /* Subroutine of instantiate_decls: Process all decls in the given
1585 BLOCK node and all its subblocks. */
1588 instantiate_decls_1 (tree let
)
1592 for (t
= BLOCK_VARS (let
); t
; t
= TREE_CHAIN (t
))
1593 if (DECL_RTL_SET_P (t
))
1594 instantiate_decl (DECL_RTL (t
));
1596 /* Process all subblocks. */
1597 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= TREE_CHAIN (t
))
1598 instantiate_decls_1 (t
);
1601 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
1602 all virtual registers in their DECL_RTL's. */
1605 instantiate_decls (tree fndecl
)
1609 /* Process all parameters of the function. */
1610 for (decl
= DECL_ARGUMENTS (fndecl
); decl
; decl
= TREE_CHAIN (decl
))
1612 instantiate_decl (DECL_RTL (decl
));
1613 instantiate_decl (DECL_INCOMING_RTL (decl
));
1616 /* Now process all variables defined in the function or its subblocks. */
1617 instantiate_decls_1 (DECL_INITIAL (fndecl
));
1620 /* Pass through the INSNS of function FNDECL and convert virtual register
1621 references to hard register references. */
1624 instantiate_virtual_regs (void)
1628 /* Compute the offsets to use for this function. */
1629 in_arg_offset
= FIRST_PARM_OFFSET (current_function_decl
);
1630 var_offset
= STARTING_FRAME_OFFSET
;
1631 dynamic_offset
= STACK_DYNAMIC_OFFSET (current_function_decl
);
1632 out_arg_offset
= STACK_POINTER_OFFSET
;
1633 cfa_offset
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
1635 /* Initialize recognition, indicating that volatile is OK. */
1638 /* Scan through all the insns, instantiating every virtual register still
1640 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1643 /* These patterns in the instruction stream can never be recognized.
1644 Fortunately, they shouldn't contain virtual registers either. */
1645 if (GET_CODE (PATTERN (insn
)) == USE
1646 || GET_CODE (PATTERN (insn
)) == CLOBBER
1647 || GET_CODE (PATTERN (insn
)) == ADDR_VEC
1648 || GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
1649 || GET_CODE (PATTERN (insn
)) == ASM_INPUT
)
1652 instantiate_virtual_regs_in_insn (insn
);
1654 if (INSN_DELETED_P (insn
))
1657 for_each_rtx (®_NOTES (insn
), instantiate_virtual_regs_in_rtx
, NULL
);
1659 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
1660 if (GET_CODE (insn
) == CALL_INSN
)
1661 for_each_rtx (&CALL_INSN_FUNCTION_USAGE (insn
),
1662 instantiate_virtual_regs_in_rtx
, NULL
);
1665 /* Instantiate the virtual registers in the DECLs for debugging purposes. */
1666 instantiate_decls (current_function_decl
);
1668 /* Indicate that, from now on, assign_stack_local should use
1669 frame_pointer_rtx. */
1670 virtuals_instantiated
= 1;
1673 struct tree_opt_pass pass_instantiate_virtual_regs
=
1677 instantiate_virtual_regs
, /* execute */
1680 0, /* static_pass_number */
1682 0, /* properties_required */
1683 0, /* properties_provided */
1684 0, /* properties_destroyed */
1685 0, /* todo_flags_start */
1686 TODO_dump_func
, /* todo_flags_finish */
1691 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
1692 This means a type for which function calls must pass an address to the
1693 function or get an address back from the function.
1694 EXP may be a type node or an expression (whose type is tested). */
1697 aggregate_value_p (tree exp
, tree fntype
)
1699 int i
, regno
, nregs
;
1702 tree type
= (TYPE_P (exp
)) ? exp
: TREE_TYPE (exp
);
1705 switch (TREE_CODE (fntype
))
1708 fntype
= get_callee_fndecl (fntype
);
1709 fntype
= fntype
? TREE_TYPE (fntype
) : 0;
1712 fntype
= TREE_TYPE (fntype
);
1717 case IDENTIFIER_NODE
:
1721 /* We don't expect other rtl types here. */
1725 if (TREE_CODE (type
) == VOID_TYPE
)
1727 /* If the front end has decided that this needs to be passed by
1728 reference, do so. */
1729 if ((TREE_CODE (exp
) == PARM_DECL
|| TREE_CODE (exp
) == RESULT_DECL
)
1730 && DECL_BY_REFERENCE (exp
))
1732 if (targetm
.calls
.return_in_memory (type
, fntype
))
1734 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
1735 and thus can't be returned in registers. */
1736 if (TREE_ADDRESSABLE (type
))
1738 if (flag_pcc_struct_return
&& AGGREGATE_TYPE_P (type
))
1740 /* Make sure we have suitable call-clobbered regs to return
1741 the value in; if not, we must return it in memory. */
1742 reg
= hard_function_value (type
, 0, fntype
, 0);
1744 /* If we have something other than a REG (e.g. a PARALLEL), then assume
1749 regno
= REGNO (reg
);
1750 nregs
= hard_regno_nregs
[regno
][TYPE_MODE (type
)];
1751 for (i
= 0; i
< nregs
; i
++)
1752 if (! call_used_regs
[regno
+ i
])
1757 /* Return true if we should assign DECL a pseudo register; false if it
1758 should live on the local stack. */
1761 use_register_for_decl (tree decl
)
1763 /* Honor volatile. */
1764 if (TREE_SIDE_EFFECTS (decl
))
1767 /* Honor addressability. */
1768 if (TREE_ADDRESSABLE (decl
))
1771 /* Only register-like things go in registers. */
1772 if (DECL_MODE (decl
) == BLKmode
)
1775 /* If -ffloat-store specified, don't put explicit float variables
1777 /* ??? This should be checked after DECL_ARTIFICIAL, but tree-ssa
1778 propagates values across these stores, and it probably shouldn't. */
1779 if (flag_float_store
&& FLOAT_TYPE_P (TREE_TYPE (decl
)))
1782 /* If we're not interested in tracking debugging information for
1783 this decl, then we can certainly put it in a register. */
1784 if (DECL_IGNORED_P (decl
))
1787 return (optimize
|| DECL_REGISTER (decl
));
1790 /* Return true if TYPE should be passed by invisible reference. */
1793 pass_by_reference (CUMULATIVE_ARGS
*ca
, enum machine_mode mode
,
1794 tree type
, bool named_arg
)
1798 /* If this type contains non-trivial constructors, then it is
1799 forbidden for the middle-end to create any new copies. */
1800 if (TREE_ADDRESSABLE (type
))
1803 /* GCC post 3.4 passes *all* variable sized types by reference. */
1804 if (!TYPE_SIZE (type
) || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
1808 return targetm
.calls
.pass_by_reference (ca
, mode
, type
, named_arg
);
1811 /* Return true if TYPE, which is passed by reference, should be callee
1812 copied instead of caller copied. */
1815 reference_callee_copied (CUMULATIVE_ARGS
*ca
, enum machine_mode mode
,
1816 tree type
, bool named_arg
)
1818 if (type
&& TREE_ADDRESSABLE (type
))
1820 return targetm
.calls
.callee_copies (ca
, mode
, type
, named_arg
);
1823 /* Structures to communicate between the subroutines of assign_parms.
1824 The first holds data persistent across all parameters, the second
1825 is cleared out for each parameter. */
1827 struct assign_parm_data_all
1829 CUMULATIVE_ARGS args_so_far
;
1830 struct args_size stack_args_size
;
1831 tree function_result_decl
;
1833 rtx conversion_insns
;
1834 HOST_WIDE_INT pretend_args_size
;
1835 HOST_WIDE_INT extra_pretend_bytes
;
1836 int reg_parm_stack_space
;
1839 struct assign_parm_data_one
1845 enum machine_mode nominal_mode
;
1846 enum machine_mode passed_mode
;
1847 enum machine_mode promoted_mode
;
1848 struct locate_and_pad_arg_data locate
;
1850 BOOL_BITFIELD named_arg
: 1;
1851 BOOL_BITFIELD passed_pointer
: 1;
1852 BOOL_BITFIELD on_stack
: 1;
1853 BOOL_BITFIELD loaded_in_reg
: 1;
1856 /* A subroutine of assign_parms. Initialize ALL. */
1859 assign_parms_initialize_all (struct assign_parm_data_all
*all
)
1863 memset (all
, 0, sizeof (*all
));
1865 fntype
= TREE_TYPE (current_function_decl
);
1867 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
1868 INIT_CUMULATIVE_INCOMING_ARGS (all
->args_so_far
, fntype
, NULL_RTX
);
1870 INIT_CUMULATIVE_ARGS (all
->args_so_far
, fntype
, NULL_RTX
,
1871 current_function_decl
, -1);
1874 #ifdef REG_PARM_STACK_SPACE
1875 all
->reg_parm_stack_space
= REG_PARM_STACK_SPACE (current_function_decl
);
1879 /* If ARGS contains entries with complex types, split the entry into two
1880 entries of the component type. Return a new list of substitutions are
1881 needed, else the old list. */
1884 split_complex_args (tree args
)
1888 /* Before allocating memory, check for the common case of no complex. */
1889 for (p
= args
; p
; p
= TREE_CHAIN (p
))
1891 tree type
= TREE_TYPE (p
);
1892 if (TREE_CODE (type
) == COMPLEX_TYPE
1893 && targetm
.calls
.split_complex_arg (type
))
1899 args
= copy_list (args
);
1901 for (p
= args
; p
; p
= TREE_CHAIN (p
))
1903 tree type
= TREE_TYPE (p
);
1904 if (TREE_CODE (type
) == COMPLEX_TYPE
1905 && targetm
.calls
.split_complex_arg (type
))
1908 tree subtype
= TREE_TYPE (type
);
1909 bool addressable
= TREE_ADDRESSABLE (p
);
1911 /* Rewrite the PARM_DECL's type with its component. */
1912 TREE_TYPE (p
) = subtype
;
1913 DECL_ARG_TYPE (p
) = TREE_TYPE (DECL_ARG_TYPE (p
));
1914 DECL_MODE (p
) = VOIDmode
;
1915 DECL_SIZE (p
) = NULL
;
1916 DECL_SIZE_UNIT (p
) = NULL
;
1917 /* If this arg must go in memory, put it in a pseudo here.
1918 We can't allow it to go in memory as per normal parms,
1919 because the usual place might not have the imag part
1920 adjacent to the real part. */
1921 DECL_ARTIFICIAL (p
) = addressable
;
1922 DECL_IGNORED_P (p
) = addressable
;
1923 TREE_ADDRESSABLE (p
) = 0;
1926 /* Build a second synthetic decl. */
1927 decl
= build_decl (PARM_DECL
, NULL_TREE
, subtype
);
1928 DECL_ARG_TYPE (decl
) = DECL_ARG_TYPE (p
);
1929 DECL_ARTIFICIAL (decl
) = addressable
;
1930 DECL_IGNORED_P (decl
) = addressable
;
1931 layout_decl (decl
, 0);
1933 /* Splice it in; skip the new decl. */
1934 TREE_CHAIN (decl
) = TREE_CHAIN (p
);
1935 TREE_CHAIN (p
) = decl
;
1943 /* A subroutine of assign_parms. Adjust the parameter list to incorporate
1944 the hidden struct return argument, and (abi willing) complex args.
1945 Return the new parameter list. */
1948 assign_parms_augmented_arg_list (struct assign_parm_data_all
*all
)
1950 tree fndecl
= current_function_decl
;
1951 tree fntype
= TREE_TYPE (fndecl
);
1952 tree fnargs
= DECL_ARGUMENTS (fndecl
);
1954 /* If struct value address is treated as the first argument, make it so. */
1955 if (aggregate_value_p (DECL_RESULT (fndecl
), fndecl
)
1956 && ! current_function_returns_pcc_struct
1957 && targetm
.calls
.struct_value_rtx (TREE_TYPE (fndecl
), 1) == 0)
1959 tree type
= build_pointer_type (TREE_TYPE (fntype
));
1962 decl
= build_decl (PARM_DECL
, NULL_TREE
, type
);
1963 DECL_ARG_TYPE (decl
) = type
;
1964 DECL_ARTIFICIAL (decl
) = 1;
1965 DECL_IGNORED_P (decl
) = 1;
1967 TREE_CHAIN (decl
) = fnargs
;
1969 all
->function_result_decl
= decl
;
1972 all
->orig_fnargs
= fnargs
;
1974 /* If the target wants to split complex arguments into scalars, do so. */
1975 if (targetm
.calls
.split_complex_arg
)
1976 fnargs
= split_complex_args (fnargs
);
1981 /* A subroutine of assign_parms. Examine PARM and pull out type and mode
1982 data for the parameter. Incorporate ABI specifics such as pass-by-
1983 reference and type promotion. */
1986 assign_parm_find_data_types (struct assign_parm_data_all
*all
, tree parm
,
1987 struct assign_parm_data_one
*data
)
1989 tree nominal_type
, passed_type
;
1990 enum machine_mode nominal_mode
, passed_mode
, promoted_mode
;
1992 memset (data
, 0, sizeof (*data
));
1994 /* NAMED_ARG is a mis-nomer. We really mean 'non-varadic'. */
1995 if (!current_function_stdarg
)
1996 data
->named_arg
= 1; /* No varadic parms. */
1997 else if (TREE_CHAIN (parm
))
1998 data
->named_arg
= 1; /* Not the last non-varadic parm. */
1999 else if (targetm
.calls
.strict_argument_naming (&all
->args_so_far
))
2000 data
->named_arg
= 1; /* Only varadic ones are unnamed. */
2002 data
->named_arg
= 0; /* Treat as varadic. */
2004 nominal_type
= TREE_TYPE (parm
);
2005 passed_type
= DECL_ARG_TYPE (parm
);
2007 /* Look out for errors propagating this far. Also, if the parameter's
2008 type is void then its value doesn't matter. */
2009 if (TREE_TYPE (parm
) == error_mark_node
2010 /* This can happen after weird syntax errors
2011 or if an enum type is defined among the parms. */
2012 || TREE_CODE (parm
) != PARM_DECL
2013 || passed_type
== NULL
2014 || VOID_TYPE_P (nominal_type
))
2016 nominal_type
= passed_type
= void_type_node
;
2017 nominal_mode
= passed_mode
= promoted_mode
= VOIDmode
;
2021 /* Find mode of arg as it is passed, and mode of arg as it should be
2022 during execution of this function. */
2023 passed_mode
= TYPE_MODE (passed_type
);
2024 nominal_mode
= TYPE_MODE (nominal_type
);
2026 /* If the parm is to be passed as a transparent union, use the type of
2027 the first field for the tests below. We have already verified that
2028 the modes are the same. */
2029 if (TREE_CODE (passed_type
) == UNION_TYPE
2030 && TYPE_TRANSPARENT_UNION (passed_type
))
2031 passed_type
= TREE_TYPE (TYPE_FIELDS (passed_type
));
2033 /* See if this arg was passed by invisible reference. */
2034 if (pass_by_reference (&all
->args_so_far
, passed_mode
,
2035 passed_type
, data
->named_arg
))
2037 passed_type
= nominal_type
= build_pointer_type (passed_type
);
2038 data
->passed_pointer
= true;
2039 passed_mode
= nominal_mode
= Pmode
;
2042 /* Find mode as it is passed by the ABI. */
2043 promoted_mode
= passed_mode
;
2044 if (targetm
.calls
.promote_function_args (TREE_TYPE (current_function_decl
)))
2046 int unsignedp
= TYPE_UNSIGNED (passed_type
);
2047 promoted_mode
= promote_mode (passed_type
, promoted_mode
,
2052 data
->nominal_type
= nominal_type
;
2053 data
->passed_type
= passed_type
;
2054 data
->nominal_mode
= nominal_mode
;
2055 data
->passed_mode
= passed_mode
;
2056 data
->promoted_mode
= promoted_mode
;
2059 /* A subroutine of assign_parms. Invoke setup_incoming_varargs. */
2062 assign_parms_setup_varargs (struct assign_parm_data_all
*all
,
2063 struct assign_parm_data_one
*data
, bool no_rtl
)
2065 int varargs_pretend_bytes
= 0;
2067 targetm
.calls
.setup_incoming_varargs (&all
->args_so_far
,
2068 data
->promoted_mode
,
2070 &varargs_pretend_bytes
, no_rtl
);
2072 /* If the back-end has requested extra stack space, record how much is
2073 needed. Do not change pretend_args_size otherwise since it may be
2074 nonzero from an earlier partial argument. */
2075 if (varargs_pretend_bytes
> 0)
2076 all
->pretend_args_size
= varargs_pretend_bytes
;
2079 /* A subroutine of assign_parms. Set DATA->ENTRY_PARM corresponding to
2080 the incoming location of the current parameter. */
2083 assign_parm_find_entry_rtl (struct assign_parm_data_all
*all
,
2084 struct assign_parm_data_one
*data
)
2086 HOST_WIDE_INT pretend_bytes
= 0;
2090 if (data
->promoted_mode
== VOIDmode
)
2092 data
->entry_parm
= data
->stack_parm
= const0_rtx
;
2096 #ifdef FUNCTION_INCOMING_ARG
2097 entry_parm
= FUNCTION_INCOMING_ARG (all
->args_so_far
, data
->promoted_mode
,
2098 data
->passed_type
, data
->named_arg
);
2100 entry_parm
= FUNCTION_ARG (all
->args_so_far
, data
->promoted_mode
,
2101 data
->passed_type
, data
->named_arg
);
2104 if (entry_parm
== 0)
2105 data
->promoted_mode
= data
->passed_mode
;
2107 /* Determine parm's home in the stack, in case it arrives in the stack
2108 or we should pretend it did. Compute the stack position and rtx where
2109 the argument arrives and its size.
2111 There is one complexity here: If this was a parameter that would
2112 have been passed in registers, but wasn't only because it is
2113 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
2114 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
2115 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of 0
2116 as it was the previous time. */
2117 in_regs
= entry_parm
!= 0;
2118 #ifdef STACK_PARMS_IN_REG_PARM_AREA
2121 if (!in_regs
&& !data
->named_arg
)
2123 if (targetm
.calls
.pretend_outgoing_varargs_named (&all
->args_so_far
))
2126 #ifdef FUNCTION_INCOMING_ARG
2127 tem
= FUNCTION_INCOMING_ARG (all
->args_so_far
, data
->promoted_mode
,
2128 data
->passed_type
, true);
2130 tem
= FUNCTION_ARG (all
->args_so_far
, data
->promoted_mode
,
2131 data
->passed_type
, true);
2133 in_regs
= tem
!= NULL
;
2137 /* If this parameter was passed both in registers and in the stack, use
2138 the copy on the stack. */
2139 if (targetm
.calls
.must_pass_in_stack (data
->promoted_mode
,
2147 partial
= targetm
.calls
.arg_partial_bytes (&all
->args_so_far
,
2148 data
->promoted_mode
,
2151 data
->partial
= partial
;
2153 /* The caller might already have allocated stack space for the
2154 register parameters. */
2155 if (partial
!= 0 && all
->reg_parm_stack_space
== 0)
2157 /* Part of this argument is passed in registers and part
2158 is passed on the stack. Ask the prologue code to extend
2159 the stack part so that we can recreate the full value.
2161 PRETEND_BYTES is the size of the registers we need to store.
2162 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
2163 stack space that the prologue should allocate.
2165 Internally, gcc assumes that the argument pointer is aligned
2166 to STACK_BOUNDARY bits. This is used both for alignment
2167 optimizations (see init_emit) and to locate arguments that are
2168 aligned to more than PARM_BOUNDARY bits. We must preserve this
2169 invariant by rounding CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to
2170 a stack boundary. */
2172 /* We assume at most one partial arg, and it must be the first
2173 argument on the stack. */
2174 gcc_assert (!all
->extra_pretend_bytes
&& !all
->pretend_args_size
);
2176 pretend_bytes
= partial
;
2177 all
->pretend_args_size
= CEIL_ROUND (pretend_bytes
, STACK_BYTES
);
2179 /* We want to align relative to the actual stack pointer, so
2180 don't include this in the stack size until later. */
2181 all
->extra_pretend_bytes
= all
->pretend_args_size
;
2185 locate_and_pad_parm (data
->promoted_mode
, data
->passed_type
, in_regs
,
2186 entry_parm
? data
->partial
: 0, current_function_decl
,
2187 &all
->stack_args_size
, &data
->locate
);
2189 /* Adjust offsets to include the pretend args. */
2190 pretend_bytes
= all
->extra_pretend_bytes
- pretend_bytes
;
2191 data
->locate
.slot_offset
.constant
+= pretend_bytes
;
2192 data
->locate
.offset
.constant
+= pretend_bytes
;
2194 data
->entry_parm
= entry_parm
;
2197 /* A subroutine of assign_parms. If there is actually space on the stack
2198 for this parm, count it in stack_args_size and return true. */
2201 assign_parm_is_stack_parm (struct assign_parm_data_all
*all
,
2202 struct assign_parm_data_one
*data
)
2204 /* Trivially true if we've no incoming register. */
2205 if (data
->entry_parm
== NULL
)
2207 /* Also true if we're partially in registers and partially not,
2208 since we've arranged to drop the entire argument on the stack. */
2209 else if (data
->partial
!= 0)
2211 /* Also true if the target says that it's passed in both registers
2212 and on the stack. */
2213 else if (GET_CODE (data
->entry_parm
) == PARALLEL
2214 && XEXP (XVECEXP (data
->entry_parm
, 0, 0), 0) == NULL_RTX
)
2216 /* Also true if the target says that there's stack allocated for
2217 all register parameters. */
2218 else if (all
->reg_parm_stack_space
> 0)
2220 /* Otherwise, no, this parameter has no ABI defined stack slot. */
2224 all
->stack_args_size
.constant
+= data
->locate
.size
.constant
;
2225 if (data
->locate
.size
.var
)
2226 ADD_PARM_SIZE (all
->stack_args_size
, data
->locate
.size
.var
);
2231 /* A subroutine of assign_parms. Given that this parameter is allocated
2232 stack space by the ABI, find it. */
2235 assign_parm_find_stack_rtl (tree parm
, struct assign_parm_data_one
*data
)
2237 rtx offset_rtx
, stack_parm
;
2238 unsigned int align
, boundary
;
2240 /* If we're passing this arg using a reg, make its stack home the
2241 aligned stack slot. */
2242 if (data
->entry_parm
)
2243 offset_rtx
= ARGS_SIZE_RTX (data
->locate
.slot_offset
);
2245 offset_rtx
= ARGS_SIZE_RTX (data
->locate
.offset
);
2247 stack_parm
= current_function_internal_arg_pointer
;
2248 if (offset_rtx
!= const0_rtx
)
2249 stack_parm
= gen_rtx_PLUS (Pmode
, stack_parm
, offset_rtx
);
2250 stack_parm
= gen_rtx_MEM (data
->promoted_mode
, stack_parm
);
2252 set_mem_attributes (stack_parm
, parm
, 1);
2254 boundary
= data
->locate
.boundary
;
2255 align
= BITS_PER_UNIT
;
2257 /* If we're padding upward, we know that the alignment of the slot
2258 is FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
2259 intentionally forcing upward padding. Otherwise we have to come
2260 up with a guess at the alignment based on OFFSET_RTX. */
2261 if (data
->locate
.where_pad
!= downward
|| data
->entry_parm
)
2263 else if (GET_CODE (offset_rtx
) == CONST_INT
)
2265 align
= INTVAL (offset_rtx
) * BITS_PER_UNIT
| boundary
;
2266 align
= align
& -align
;
2268 set_mem_align (stack_parm
, align
);
2270 if (data
->entry_parm
)
2271 set_reg_attrs_for_parm (data
->entry_parm
, stack_parm
);
2273 data
->stack_parm
= stack_parm
;
2276 /* A subroutine of assign_parms. Adjust DATA->ENTRY_RTL such that it's
2277 always valid and contiguous. */
2280 assign_parm_adjust_entry_rtl (struct assign_parm_data_one
*data
)
2282 rtx entry_parm
= data
->entry_parm
;
2283 rtx stack_parm
= data
->stack_parm
;
2285 /* If this parm was passed part in regs and part in memory, pretend it
2286 arrived entirely in memory by pushing the register-part onto the stack.
2287 In the special case of a DImode or DFmode that is split, we could put
2288 it together in a pseudoreg directly, but for now that's not worth
2290 if (data
->partial
!= 0)
2292 /* Handle calls that pass values in multiple non-contiguous
2293 locations. The Irix 6 ABI has examples of this. */
2294 if (GET_CODE (entry_parm
) == PARALLEL
)
2295 emit_group_store (validize_mem (stack_parm
), entry_parm
,
2297 int_size_in_bytes (data
->passed_type
));
2300 gcc_assert (data
->partial
% UNITS_PER_WORD
== 0);
2301 move_block_from_reg (REGNO (entry_parm
), validize_mem (stack_parm
),
2302 data
->partial
/ UNITS_PER_WORD
);
2305 entry_parm
= stack_parm
;
2308 /* If we didn't decide this parm came in a register, by default it came
2310 else if (entry_parm
== NULL
)
2311 entry_parm
= stack_parm
;
2313 /* When an argument is passed in multiple locations, we can't make use
2314 of this information, but we can save some copying if the whole argument
2315 is passed in a single register. */
2316 else if (GET_CODE (entry_parm
) == PARALLEL
2317 && data
->nominal_mode
!= BLKmode
2318 && data
->passed_mode
!= BLKmode
)
2320 size_t i
, len
= XVECLEN (entry_parm
, 0);
2322 for (i
= 0; i
< len
; i
++)
2323 if (XEXP (XVECEXP (entry_parm
, 0, i
), 0) != NULL_RTX
2324 && REG_P (XEXP (XVECEXP (entry_parm
, 0, i
), 0))
2325 && (GET_MODE (XEXP (XVECEXP (entry_parm
, 0, i
), 0))
2326 == data
->passed_mode
)
2327 && INTVAL (XEXP (XVECEXP (entry_parm
, 0, i
), 1)) == 0)
2329 entry_parm
= XEXP (XVECEXP (entry_parm
, 0, i
), 0);
2334 data
->entry_parm
= entry_parm
;
2337 /* A subroutine of assign_parms. Adjust DATA->STACK_RTL such that it's
2338 always valid and properly aligned. */
2341 assign_parm_adjust_stack_rtl (struct assign_parm_data_one
*data
)
2343 rtx stack_parm
= data
->stack_parm
;
2345 /* If we can't trust the parm stack slot to be aligned enough for its
2346 ultimate type, don't use that slot after entry. We'll make another
2347 stack slot, if we need one. */
2349 && ((STRICT_ALIGNMENT
2350 && GET_MODE_ALIGNMENT (data
->nominal_mode
) > MEM_ALIGN (stack_parm
))
2351 || (data
->nominal_type
2352 && TYPE_ALIGN (data
->nominal_type
) > MEM_ALIGN (stack_parm
)
2353 && MEM_ALIGN (stack_parm
) < PREFERRED_STACK_BOUNDARY
)))
2356 /* If parm was passed in memory, and we need to convert it on entry,
2357 don't store it back in that same slot. */
2358 else if (data
->entry_parm
== stack_parm
2359 && data
->nominal_mode
!= BLKmode
2360 && data
->nominal_mode
!= data
->passed_mode
)
2363 /* If stack protection is in effect for this function, don't leave any
2364 pointers in their passed stack slots. */
2365 else if (cfun
->stack_protect_guard
2366 && (flag_stack_protect
== 2
2367 || data
->passed_pointer
2368 || POINTER_TYPE_P (data
->nominal_type
)))
2371 data
->stack_parm
= stack_parm
;
2374 /* A subroutine of assign_parms. Return true if the current parameter
2375 should be stored as a BLKmode in the current frame. */
2378 assign_parm_setup_block_p (struct assign_parm_data_one
*data
)
2380 if (data
->nominal_mode
== BLKmode
)
2382 if (GET_CODE (data
->entry_parm
) == PARALLEL
)
2385 #ifdef BLOCK_REG_PADDING
2386 /* Only assign_parm_setup_block knows how to deal with register arguments
2387 that are padded at the least significant end. */
2388 if (REG_P (data
->entry_parm
)
2389 && GET_MODE_SIZE (data
->promoted_mode
) < UNITS_PER_WORD
2390 && (BLOCK_REG_PADDING (data
->passed_mode
, data
->passed_type
, 1)
2391 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
2398 /* A subroutine of assign_parms. Arrange for the parameter to be
2399 present and valid in DATA->STACK_RTL. */
2402 assign_parm_setup_block (struct assign_parm_data_all
*all
,
2403 tree parm
, struct assign_parm_data_one
*data
)
2405 rtx entry_parm
= data
->entry_parm
;
2406 rtx stack_parm
= data
->stack_parm
;
2408 HOST_WIDE_INT size_stored
;
2409 rtx orig_entry_parm
= entry_parm
;
2411 if (GET_CODE (entry_parm
) == PARALLEL
)
2412 entry_parm
= emit_group_move_into_temps (entry_parm
);
2414 /* If we've a non-block object that's nevertheless passed in parts,
2415 reconstitute it in register operations rather than on the stack. */
2416 if (GET_CODE (entry_parm
) == PARALLEL
2417 && data
->nominal_mode
!= BLKmode
)
2419 rtx elt0
= XEXP (XVECEXP (orig_entry_parm
, 0, 0), 0);
2421 if ((XVECLEN (entry_parm
, 0) > 1
2422 || hard_regno_nregs
[REGNO (elt0
)][GET_MODE (elt0
)] > 1)
2423 && use_register_for_decl (parm
))
2425 rtx parmreg
= gen_reg_rtx (data
->nominal_mode
);
2427 push_to_sequence (all
->conversion_insns
);
2429 /* For values returned in multiple registers, handle possible
2430 incompatible calls to emit_group_store.
2432 For example, the following would be invalid, and would have to
2433 be fixed by the conditional below:
2435 emit_group_store ((reg:SF), (parallel:DF))
2436 emit_group_store ((reg:SI), (parallel:DI))
2438 An example of this are doubles in e500 v2:
2439 (parallel:DF (expr_list (reg:SI) (const_int 0))
2440 (expr_list (reg:SI) (const_int 4))). */
2441 if (data
->nominal_mode
!= data
->passed_mode
)
2443 rtx t
= gen_reg_rtx (GET_MODE (entry_parm
));
2444 emit_group_store (t
, entry_parm
, NULL_TREE
,
2445 GET_MODE_SIZE (GET_MODE (entry_parm
)));
2446 convert_move (parmreg
, t
, 0);
2449 emit_group_store (parmreg
, entry_parm
, data
->nominal_type
,
2450 int_size_in_bytes (data
->nominal_type
));
2452 all
->conversion_insns
= get_insns ();
2455 SET_DECL_RTL (parm
, parmreg
);
2460 size
= int_size_in_bytes (data
->passed_type
);
2461 size_stored
= CEIL_ROUND (size
, UNITS_PER_WORD
);
2462 if (stack_parm
== 0)
2464 DECL_ALIGN (parm
) = MAX (DECL_ALIGN (parm
), BITS_PER_WORD
);
2465 stack_parm
= assign_stack_local (BLKmode
, size_stored
,
2467 if (GET_MODE_SIZE (GET_MODE (entry_parm
)) == size
)
2468 PUT_MODE (stack_parm
, GET_MODE (entry_parm
));
2469 set_mem_attributes (stack_parm
, parm
, 1);
2472 /* If a BLKmode arrives in registers, copy it to a stack slot. Handle
2473 calls that pass values in multiple non-contiguous locations. */
2474 if (REG_P (entry_parm
) || GET_CODE (entry_parm
) == PARALLEL
)
2478 /* Note that we will be storing an integral number of words.
2479 So we have to be careful to ensure that we allocate an
2480 integral number of words. We do this above when we call
2481 assign_stack_local if space was not allocated in the argument
2482 list. If it was, this will not work if PARM_BOUNDARY is not
2483 a multiple of BITS_PER_WORD. It isn't clear how to fix this
2484 if it becomes a problem. Exception is when BLKmode arrives
2485 with arguments not conforming to word_mode. */
2487 if (data
->stack_parm
== 0)
2489 else if (GET_CODE (entry_parm
) == PARALLEL
)
2492 gcc_assert (!size
|| !(PARM_BOUNDARY
% BITS_PER_WORD
));
2494 mem
= validize_mem (stack_parm
);
2496 /* Handle values in multiple non-contiguous locations. */
2497 if (GET_CODE (entry_parm
) == PARALLEL
)
2499 push_to_sequence (all
->conversion_insns
);
2500 emit_group_store (mem
, entry_parm
, data
->passed_type
, size
);
2501 all
->conversion_insns
= get_insns ();
2508 /* If SIZE is that of a mode no bigger than a word, just use
2509 that mode's store operation. */
2510 else if (size
<= UNITS_PER_WORD
)
2512 enum machine_mode mode
2513 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
2516 #ifdef BLOCK_REG_PADDING
2517 && (size
== UNITS_PER_WORD
2518 || (BLOCK_REG_PADDING (mode
, data
->passed_type
, 1)
2519 != (BYTES_BIG_ENDIAN
? upward
: downward
)))
2523 rtx reg
= gen_rtx_REG (mode
, REGNO (entry_parm
));
2524 emit_move_insn (change_address (mem
, mode
, 0), reg
);
2527 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
2528 machine must be aligned to the left before storing
2529 to memory. Note that the previous test doesn't
2530 handle all cases (e.g. SIZE == 3). */
2531 else if (size
!= UNITS_PER_WORD
2532 #ifdef BLOCK_REG_PADDING
2533 && (BLOCK_REG_PADDING (mode
, data
->passed_type
, 1)
2541 int by
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
2542 rtx reg
= gen_rtx_REG (word_mode
, REGNO (entry_parm
));
2544 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
,
2545 build_int_cst (NULL_TREE
, by
),
2547 tem
= change_address (mem
, word_mode
, 0);
2548 emit_move_insn (tem
, x
);
2551 move_block_from_reg (REGNO (entry_parm
), mem
,
2552 size_stored
/ UNITS_PER_WORD
);
2555 move_block_from_reg (REGNO (entry_parm
), mem
,
2556 size_stored
/ UNITS_PER_WORD
);
2558 else if (data
->stack_parm
== 0)
2560 push_to_sequence (all
->conversion_insns
);
2561 emit_block_move (stack_parm
, data
->entry_parm
, GEN_INT (size
),
2563 all
->conversion_insns
= get_insns ();
2567 data
->stack_parm
= stack_parm
;
2568 SET_DECL_RTL (parm
, stack_parm
);
2571 /* A subroutine of assign_parms. Allocate a pseudo to hold the current
2572 parameter. Get it there. Perform all ABI specified conversions. */
2575 assign_parm_setup_reg (struct assign_parm_data_all
*all
, tree parm
,
2576 struct assign_parm_data_one
*data
)
2579 enum machine_mode promoted_nominal_mode
;
2580 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (parm
));
2581 bool did_conversion
= false;
2583 /* Store the parm in a pseudoregister during the function, but we may
2584 need to do it in a wider mode. */
2586 promoted_nominal_mode
2587 = promote_mode (data
->nominal_type
, data
->nominal_mode
, &unsignedp
, 0);
2589 parmreg
= gen_reg_rtx (promoted_nominal_mode
);
2591 if (!DECL_ARTIFICIAL (parm
))
2592 mark_user_reg (parmreg
);
2594 /* If this was an item that we received a pointer to,
2595 set DECL_RTL appropriately. */
2596 if (data
->passed_pointer
)
2598 rtx x
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data
->passed_type
)), parmreg
);
2599 set_mem_attributes (x
, parm
, 1);
2600 SET_DECL_RTL (parm
, x
);
2603 SET_DECL_RTL (parm
, parmreg
);
2605 /* Copy the value into the register. */
2606 if (data
->nominal_mode
!= data
->passed_mode
2607 || promoted_nominal_mode
!= data
->promoted_mode
)
2611 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
2612 mode, by the caller. We now have to convert it to
2613 NOMINAL_MODE, if different. However, PARMREG may be in
2614 a different mode than NOMINAL_MODE if it is being stored
2617 If ENTRY_PARM is a hard register, it might be in a register
2618 not valid for operating in its mode (e.g., an odd-numbered
2619 register for a DFmode). In that case, moves are the only
2620 thing valid, so we can't do a convert from there. This
2621 occurs when the calling sequence allow such misaligned
2624 In addition, the conversion may involve a call, which could
2625 clobber parameters which haven't been copied to pseudo
2626 registers yet. Therefore, we must first copy the parm to
2627 a pseudo reg here, and save the conversion until after all
2628 parameters have been moved. */
2630 rtx tempreg
= gen_reg_rtx (GET_MODE (data
->entry_parm
));
2632 emit_move_insn (tempreg
, validize_mem (data
->entry_parm
));
2634 push_to_sequence (all
->conversion_insns
);
2635 tempreg
= convert_to_mode (data
->nominal_mode
, tempreg
, unsignedp
);
2637 if (GET_CODE (tempreg
) == SUBREG
2638 && GET_MODE (tempreg
) == data
->nominal_mode
2639 && REG_P (SUBREG_REG (tempreg
))
2640 && data
->nominal_mode
== data
->passed_mode
2641 && GET_MODE (SUBREG_REG (tempreg
)) == GET_MODE (data
->entry_parm
)
2642 && GET_MODE_SIZE (GET_MODE (tempreg
))
2643 < GET_MODE_SIZE (GET_MODE (data
->entry_parm
)))
2645 /* The argument is already sign/zero extended, so note it
2647 SUBREG_PROMOTED_VAR_P (tempreg
) = 1;
2648 SUBREG_PROMOTED_UNSIGNED_SET (tempreg
, unsignedp
);
2651 /* TREE_USED gets set erroneously during expand_assignment. */
2652 save_tree_used
= TREE_USED (parm
);
2653 expand_assignment (parm
, make_tree (data
->nominal_type
, tempreg
));
2654 TREE_USED (parm
) = save_tree_used
;
2655 all
->conversion_insns
= get_insns ();
2658 did_conversion
= true;
2661 emit_move_insn (parmreg
, validize_mem (data
->entry_parm
));
2663 /* If we were passed a pointer but the actual value can safely live
2664 in a register, put it in one. */
2665 if (data
->passed_pointer
2666 && TYPE_MODE (TREE_TYPE (parm
)) != BLKmode
2667 /* If by-reference argument was promoted, demote it. */
2668 && (TYPE_MODE (TREE_TYPE (parm
)) != GET_MODE (DECL_RTL (parm
))
2669 || use_register_for_decl (parm
)))
2671 /* We can't use nominal_mode, because it will have been set to
2672 Pmode above. We must use the actual mode of the parm. */
2673 parmreg
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm
)));
2674 mark_user_reg (parmreg
);
2676 if (GET_MODE (parmreg
) != GET_MODE (DECL_RTL (parm
)))
2678 rtx tempreg
= gen_reg_rtx (GET_MODE (DECL_RTL (parm
)));
2679 int unsigned_p
= TYPE_UNSIGNED (TREE_TYPE (parm
));
2681 push_to_sequence (all
->conversion_insns
);
2682 emit_move_insn (tempreg
, DECL_RTL (parm
));
2683 tempreg
= convert_to_mode (GET_MODE (parmreg
), tempreg
, unsigned_p
);
2684 emit_move_insn (parmreg
, tempreg
);
2685 all
->conversion_insns
= get_insns ();
2688 did_conversion
= true;
2691 emit_move_insn (parmreg
, DECL_RTL (parm
));
2693 SET_DECL_RTL (parm
, parmreg
);
2695 /* STACK_PARM is the pointer, not the parm, and PARMREG is
2697 data
->stack_parm
= NULL
;
2700 /* Mark the register as eliminable if we did no conversion and it was
2701 copied from memory at a fixed offset, and the arg pointer was not
2702 copied to a pseudo-reg. If the arg pointer is a pseudo reg or the
2703 offset formed an invalid address, such memory-equivalences as we
2704 make here would screw up life analysis for it. */
2705 if (data
->nominal_mode
== data
->passed_mode
2707 && data
->stack_parm
!= 0
2708 && MEM_P (data
->stack_parm
)
2709 && data
->locate
.offset
.var
== 0
2710 && reg_mentioned_p (virtual_incoming_args_rtx
,
2711 XEXP (data
->stack_parm
, 0)))
2713 rtx linsn
= get_last_insn ();
2716 /* Mark complex types separately. */
2717 if (GET_CODE (parmreg
) == CONCAT
)
2719 enum machine_mode submode
2720 = GET_MODE_INNER (GET_MODE (parmreg
));
2721 int regnor
= REGNO (XEXP (parmreg
, 0));
2722 int regnoi
= REGNO (XEXP (parmreg
, 1));
2723 rtx stackr
= adjust_address_nv (data
->stack_parm
, submode
, 0);
2724 rtx stacki
= adjust_address_nv (data
->stack_parm
, submode
,
2725 GET_MODE_SIZE (submode
));
2727 /* Scan backwards for the set of the real and
2729 for (sinsn
= linsn
; sinsn
!= 0;
2730 sinsn
= prev_nonnote_insn (sinsn
))
2732 set
= single_set (sinsn
);
2736 if (SET_DEST (set
) == regno_reg_rtx
[regnoi
])
2738 = gen_rtx_EXPR_LIST (REG_EQUIV
, stacki
,
2740 else if (SET_DEST (set
) == regno_reg_rtx
[regnor
])
2742 = gen_rtx_EXPR_LIST (REG_EQUIV
, stackr
,
2746 else if ((set
= single_set (linsn
)) != 0
2747 && SET_DEST (set
) == parmreg
)
2749 = gen_rtx_EXPR_LIST (REG_EQUIV
,
2750 data
->stack_parm
, REG_NOTES (linsn
));
2753 /* For pointer data type, suggest pointer register. */
2754 if (POINTER_TYPE_P (TREE_TYPE (parm
)))
2755 mark_reg_pointer (parmreg
,
2756 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
))));
2759 /* A subroutine of assign_parms. Allocate stack space to hold the current
2760 parameter. Get it there. Perform all ABI specified conversions. */
2763 assign_parm_setup_stack (struct assign_parm_data_all
*all
, tree parm
,
2764 struct assign_parm_data_one
*data
)
2766 /* Value must be stored in the stack slot STACK_PARM during function
2768 bool to_conversion
= false;
2770 if (data
->promoted_mode
!= data
->nominal_mode
)
2772 /* Conversion is required. */
2773 rtx tempreg
= gen_reg_rtx (GET_MODE (data
->entry_parm
));
2775 emit_move_insn (tempreg
, validize_mem (data
->entry_parm
));
2777 push_to_sequence (all
->conversion_insns
);
2778 to_conversion
= true;
2780 data
->entry_parm
= convert_to_mode (data
->nominal_mode
, tempreg
,
2781 TYPE_UNSIGNED (TREE_TYPE (parm
)));
2783 if (data
->stack_parm
)
2784 /* ??? This may need a big-endian conversion on sparc64. */
2786 = adjust_address (data
->stack_parm
, data
->nominal_mode
, 0);
2789 if (data
->entry_parm
!= data
->stack_parm
)
2793 if (data
->stack_parm
== 0)
2796 = assign_stack_local (GET_MODE (data
->entry_parm
),
2797 GET_MODE_SIZE (GET_MODE (data
->entry_parm
)),
2798 TYPE_ALIGN (data
->passed_type
));
2799 set_mem_attributes (data
->stack_parm
, parm
, 1);
2802 dest
= validize_mem (data
->stack_parm
);
2803 src
= validize_mem (data
->entry_parm
);
2807 /* Use a block move to handle potentially misaligned entry_parm. */
2809 push_to_sequence (all
->conversion_insns
);
2810 to_conversion
= true;
2812 emit_block_move (dest
, src
,
2813 GEN_INT (int_size_in_bytes (data
->passed_type
)),
2817 emit_move_insn (dest
, src
);
2822 all
->conversion_insns
= get_insns ();
2826 SET_DECL_RTL (parm
, data
->stack_parm
);
2829 /* A subroutine of assign_parms. If the ABI splits complex arguments, then
2830 undo the frobbing that we did in assign_parms_augmented_arg_list. */
2833 assign_parms_unsplit_complex (struct assign_parm_data_all
*all
, tree fnargs
)
2836 tree orig_fnargs
= all
->orig_fnargs
;
2838 for (parm
= orig_fnargs
; parm
; parm
= TREE_CHAIN (parm
))
2840 if (TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
2841 && targetm
.calls
.split_complex_arg (TREE_TYPE (parm
)))
2843 rtx tmp
, real
, imag
;
2844 enum machine_mode inner
= GET_MODE_INNER (DECL_MODE (parm
));
2846 real
= DECL_RTL (fnargs
);
2847 imag
= DECL_RTL (TREE_CHAIN (fnargs
));
2848 if (inner
!= GET_MODE (real
))
2850 real
= gen_lowpart_SUBREG (inner
, real
);
2851 imag
= gen_lowpart_SUBREG (inner
, imag
);
2854 if (TREE_ADDRESSABLE (parm
))
2857 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (parm
));
2859 /* split_complex_arg put the real and imag parts in
2860 pseudos. Move them to memory. */
2861 tmp
= assign_stack_local (DECL_MODE (parm
), size
,
2862 TYPE_ALIGN (TREE_TYPE (parm
)));
2863 set_mem_attributes (tmp
, parm
, 1);
2864 rmem
= adjust_address_nv (tmp
, inner
, 0);
2865 imem
= adjust_address_nv (tmp
, inner
, GET_MODE_SIZE (inner
));
2866 push_to_sequence (all
->conversion_insns
);
2867 emit_move_insn (rmem
, real
);
2868 emit_move_insn (imem
, imag
);
2869 all
->conversion_insns
= get_insns ();
2873 tmp
= gen_rtx_CONCAT (DECL_MODE (parm
), real
, imag
);
2874 SET_DECL_RTL (parm
, tmp
);
2876 real
= DECL_INCOMING_RTL (fnargs
);
2877 imag
= DECL_INCOMING_RTL (TREE_CHAIN (fnargs
));
2878 if (inner
!= GET_MODE (real
))
2880 real
= gen_lowpart_SUBREG (inner
, real
);
2881 imag
= gen_lowpart_SUBREG (inner
, imag
);
2883 tmp
= gen_rtx_CONCAT (DECL_MODE (parm
), real
, imag
);
2884 set_decl_incoming_rtl (parm
, tmp
);
2885 fnargs
= TREE_CHAIN (fnargs
);
2889 SET_DECL_RTL (parm
, DECL_RTL (fnargs
));
2890 set_decl_incoming_rtl (parm
, DECL_INCOMING_RTL (fnargs
));
2892 /* Set MEM_EXPR to the original decl, i.e. to PARM,
2893 instead of the copy of decl, i.e. FNARGS. */
2894 if (DECL_INCOMING_RTL (parm
) && MEM_P (DECL_INCOMING_RTL (parm
)))
2895 set_mem_expr (DECL_INCOMING_RTL (parm
), parm
);
2898 fnargs
= TREE_CHAIN (fnargs
);
2902 /* Assign RTL expressions to the function's parameters. This may involve
2903 copying them into registers and using those registers as the DECL_RTL. */
2906 assign_parms (tree fndecl
)
2908 struct assign_parm_data_all all
;
2911 current_function_internal_arg_pointer
2912 = targetm
.calls
.internal_arg_pointer ();
2914 assign_parms_initialize_all (&all
);
2915 fnargs
= assign_parms_augmented_arg_list (&all
);
2917 for (parm
= fnargs
; parm
; parm
= TREE_CHAIN (parm
))
2919 struct assign_parm_data_one data
;
2921 /* Extract the type of PARM; adjust it according to ABI. */
2922 assign_parm_find_data_types (&all
, parm
, &data
);
2924 /* Early out for errors and void parameters. */
2925 if (data
.passed_mode
== VOIDmode
)
2927 SET_DECL_RTL (parm
, const0_rtx
);
2928 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
);
2932 if (current_function_stdarg
&& !TREE_CHAIN (parm
))
2933 assign_parms_setup_varargs (&all
, &data
, false);
2935 /* Find out where the parameter arrives in this function. */
2936 assign_parm_find_entry_rtl (&all
, &data
);
2938 /* Find out where stack space for this parameter might be. */
2939 if (assign_parm_is_stack_parm (&all
, &data
))
2941 assign_parm_find_stack_rtl (parm
, &data
);
2942 assign_parm_adjust_entry_rtl (&data
);
2945 /* Record permanently how this parm was passed. */
2946 set_decl_incoming_rtl (parm
, data
.entry_parm
);
2948 /* Update info on where next arg arrives in registers. */
2949 FUNCTION_ARG_ADVANCE (all
.args_so_far
, data
.promoted_mode
,
2950 data
.passed_type
, data
.named_arg
);
2952 assign_parm_adjust_stack_rtl (&data
);
2954 if (assign_parm_setup_block_p (&data
))
2955 assign_parm_setup_block (&all
, parm
, &data
);
2956 else if (data
.passed_pointer
|| use_register_for_decl (parm
))
2957 assign_parm_setup_reg (&all
, parm
, &data
);
2959 assign_parm_setup_stack (&all
, parm
, &data
);
2962 if (targetm
.calls
.split_complex_arg
&& fnargs
!= all
.orig_fnargs
)
2963 assign_parms_unsplit_complex (&all
, fnargs
);
2965 /* Output all parameter conversion instructions (possibly including calls)
2966 now that all parameters have been copied out of hard registers. */
2967 emit_insn (all
.conversion_insns
);
2969 /* If we are receiving a struct value address as the first argument, set up
2970 the RTL for the function result. As this might require code to convert
2971 the transmitted address to Pmode, we do this here to ensure that possible
2972 preliminary conversions of the address have been emitted already. */
2973 if (all
.function_result_decl
)
2975 tree result
= DECL_RESULT (current_function_decl
);
2976 rtx addr
= DECL_RTL (all
.function_result_decl
);
2979 if (DECL_BY_REFERENCE (result
))
2983 addr
= convert_memory_address (Pmode
, addr
);
2984 x
= gen_rtx_MEM (DECL_MODE (result
), addr
);
2985 set_mem_attributes (x
, result
, 1);
2987 SET_DECL_RTL (result
, x
);
2990 /* We have aligned all the args, so add space for the pretend args. */
2991 current_function_pretend_args_size
= all
.pretend_args_size
;
2992 all
.stack_args_size
.constant
+= all
.extra_pretend_bytes
;
2993 current_function_args_size
= all
.stack_args_size
.constant
;
2995 /* Adjust function incoming argument size for alignment and
2998 #ifdef REG_PARM_STACK_SPACE
2999 current_function_args_size
= MAX (current_function_args_size
,
3000 REG_PARM_STACK_SPACE (fndecl
));
3003 current_function_args_size
= CEIL_ROUND (current_function_args_size
,
3004 PARM_BOUNDARY
/ BITS_PER_UNIT
);
3006 #ifdef ARGS_GROW_DOWNWARD
3007 current_function_arg_offset_rtx
3008 = (all
.stack_args_size
.var
== 0 ? GEN_INT (-all
.stack_args_size
.constant
)
3009 : expand_expr (size_diffop (all
.stack_args_size
.var
,
3010 size_int (-all
.stack_args_size
.constant
)),
3011 NULL_RTX
, VOIDmode
, 0));
3013 current_function_arg_offset_rtx
= ARGS_SIZE_RTX (all
.stack_args_size
);
3016 /* See how many bytes, if any, of its args a function should try to pop
3019 current_function_pops_args
= RETURN_POPS_ARGS (fndecl
, TREE_TYPE (fndecl
),
3020 current_function_args_size
);
3022 /* For stdarg.h function, save info about
3023 regs and stack space used by the named args. */
3025 current_function_args_info
= all
.args_so_far
;
3027 /* Set the rtx used for the function return value. Put this in its
3028 own variable so any optimizers that need this information don't have
3029 to include tree.h. Do this here so it gets done when an inlined
3030 function gets output. */
3032 current_function_return_rtx
3033 = (DECL_RTL_SET_P (DECL_RESULT (fndecl
))
3034 ? DECL_RTL (DECL_RESULT (fndecl
)) : NULL_RTX
);
3036 /* If scalar return value was computed in a pseudo-reg, or was a named
3037 return value that got dumped to the stack, copy that to the hard
3039 if (DECL_RTL_SET_P (DECL_RESULT (fndecl
)))
3041 tree decl_result
= DECL_RESULT (fndecl
);
3042 rtx decl_rtl
= DECL_RTL (decl_result
);
3044 if (REG_P (decl_rtl
)
3045 ? REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
3046 : DECL_REGISTER (decl_result
))
3050 real_decl_rtl
= targetm
.calls
.function_value (TREE_TYPE (decl_result
),
3052 REG_FUNCTION_VALUE_P (real_decl_rtl
) = 1;
3053 /* The delay slot scheduler assumes that current_function_return_rtx
3054 holds the hard register containing the return value, not a
3055 temporary pseudo. */
3056 current_function_return_rtx
= real_decl_rtl
;
3061 /* A subroutine of gimplify_parameters, invoked via walk_tree.
3062 For all seen types, gimplify their sizes. */
3065 gimplify_parm_type (tree
*tp
, int *walk_subtrees
, void *data
)
3072 if (POINTER_TYPE_P (t
))
3074 else if (TYPE_SIZE (t
) && !TREE_CONSTANT (TYPE_SIZE (t
))
3075 && !TYPE_SIZES_GIMPLIFIED (t
))
3077 gimplify_type_sizes (t
, (tree
*) data
);
3085 /* Gimplify the parameter list for current_function_decl. This involves
3086 evaluating SAVE_EXPRs of variable sized parameters and generating code
3087 to implement callee-copies reference parameters. Returns a list of
3088 statements to add to the beginning of the function, or NULL if nothing
3092 gimplify_parameters (void)
3094 struct assign_parm_data_all all
;
3095 tree fnargs
, parm
, stmts
= NULL
;
3097 assign_parms_initialize_all (&all
);
3098 fnargs
= assign_parms_augmented_arg_list (&all
);
3100 for (parm
= fnargs
; parm
; parm
= TREE_CHAIN (parm
))
3102 struct assign_parm_data_one data
;
3104 /* Extract the type of PARM; adjust it according to ABI. */
3105 assign_parm_find_data_types (&all
, parm
, &data
);
3107 /* Early out for errors and void parameters. */
3108 if (data
.passed_mode
== VOIDmode
|| DECL_SIZE (parm
) == NULL
)
3111 /* Update info on where next arg arrives in registers. */
3112 FUNCTION_ARG_ADVANCE (all
.args_so_far
, data
.promoted_mode
,
3113 data
.passed_type
, data
.named_arg
);
3115 /* ??? Once upon a time variable_size stuffed parameter list
3116 SAVE_EXPRs (amongst others) onto a pending sizes list. This
3117 turned out to be less than manageable in the gimple world.
3118 Now we have to hunt them down ourselves. */
3119 walk_tree_without_duplicates (&data
.passed_type
,
3120 gimplify_parm_type
, &stmts
);
3122 if (!TREE_CONSTANT (DECL_SIZE (parm
)))
3124 gimplify_one_sizepos (&DECL_SIZE (parm
), &stmts
);
3125 gimplify_one_sizepos (&DECL_SIZE_UNIT (parm
), &stmts
);
3128 if (data
.passed_pointer
)
3130 tree type
= TREE_TYPE (data
.passed_type
);
3131 if (reference_callee_copied (&all
.args_so_far
, TYPE_MODE (type
),
3132 type
, data
.named_arg
))
3136 /* For constant sized objects, this is trivial; for
3137 variable-sized objects, we have to play games. */
3138 if (TREE_CONSTANT (DECL_SIZE (parm
)))
3140 local
= create_tmp_var (type
, get_name (parm
));
3141 DECL_IGNORED_P (local
) = 0;
3145 tree ptr_type
, addr
, args
;
3147 ptr_type
= build_pointer_type (type
);
3148 addr
= create_tmp_var (ptr_type
, get_name (parm
));
3149 DECL_IGNORED_P (addr
) = 0;
3150 local
= build_fold_indirect_ref (addr
);
3152 args
= tree_cons (NULL
, DECL_SIZE_UNIT (parm
), NULL
);
3153 t
= built_in_decls
[BUILT_IN_ALLOCA
];
3154 t
= build_function_call_expr (t
, args
);
3155 t
= fold_convert (ptr_type
, t
);
3156 t
= build2 (MODIFY_EXPR
, void_type_node
, addr
, t
);
3157 gimplify_and_add (t
, &stmts
);
3160 t
= build2 (MODIFY_EXPR
, void_type_node
, local
, parm
);
3161 gimplify_and_add (t
, &stmts
);
3163 SET_DECL_VALUE_EXPR (parm
, local
);
3164 DECL_HAS_VALUE_EXPR_P (parm
) = 1;
3172 /* Indicate whether REGNO is an incoming argument to the current function
3173 that was promoted to a wider mode. If so, return the RTX for the
3174 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
3175 that REGNO is promoted from and whether the promotion was signed or
3179 promoted_input_arg (unsigned int regno
, enum machine_mode
*pmode
, int *punsignedp
)
3183 for (arg
= DECL_ARGUMENTS (current_function_decl
); arg
;
3184 arg
= TREE_CHAIN (arg
))
3185 if (REG_P (DECL_INCOMING_RTL (arg
))
3186 && REGNO (DECL_INCOMING_RTL (arg
)) == regno
3187 && TYPE_MODE (DECL_ARG_TYPE (arg
)) == TYPE_MODE (TREE_TYPE (arg
)))
3189 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (arg
));
3190 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (arg
));
3192 mode
= promote_mode (TREE_TYPE (arg
), mode
, &unsignedp
, 1);
3193 if (mode
== GET_MODE (DECL_INCOMING_RTL (arg
))
3194 && mode
!= DECL_MODE (arg
))
3196 *pmode
= DECL_MODE (arg
);
3197 *punsignedp
= unsignedp
;
3198 return DECL_INCOMING_RTL (arg
);
3206 /* Compute the size and offset from the start of the stacked arguments for a
3207 parm passed in mode PASSED_MODE and with type TYPE.
3209 INITIAL_OFFSET_PTR points to the current offset into the stacked
3212 The starting offset and size for this parm are returned in
3213 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
3214 nonzero, the offset is that of stack slot, which is returned in
3215 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
3216 padding required from the initial offset ptr to the stack slot.
3218 IN_REGS is nonzero if the argument will be passed in registers. It will
3219 never be set if REG_PARM_STACK_SPACE is not defined.
3221 FNDECL is the function in which the argument was defined.
3223 There are two types of rounding that are done. The first, controlled by
3224 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
3225 list to be aligned to the specific boundary (in bits). This rounding
3226 affects the initial and starting offsets, but not the argument size.
3228 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
3229 optionally rounds the size of the parm to PARM_BOUNDARY. The
3230 initial offset is not affected by this rounding, while the size always
3231 is and the starting offset may be. */
3233 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
3234 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
3235 callers pass in the total size of args so far as
3236 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
3239 locate_and_pad_parm (enum machine_mode passed_mode
, tree type
, int in_regs
,
3240 int partial
, tree fndecl ATTRIBUTE_UNUSED
,
3241 struct args_size
*initial_offset_ptr
,
3242 struct locate_and_pad_arg_data
*locate
)
3245 enum direction where_pad
;
3246 unsigned int boundary
;
3247 int reg_parm_stack_space
= 0;
3248 int part_size_in_regs
;
3250 #ifdef REG_PARM_STACK_SPACE
3251 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
3253 /* If we have found a stack parm before we reach the end of the
3254 area reserved for registers, skip that area. */
3257 if (reg_parm_stack_space
> 0)
3259 if (initial_offset_ptr
->var
)
3261 initial_offset_ptr
->var
3262 = size_binop (MAX_EXPR
, ARGS_SIZE_TREE (*initial_offset_ptr
),
3263 ssize_int (reg_parm_stack_space
));
3264 initial_offset_ptr
->constant
= 0;
3266 else if (initial_offset_ptr
->constant
< reg_parm_stack_space
)
3267 initial_offset_ptr
->constant
= reg_parm_stack_space
;
3270 #endif /* REG_PARM_STACK_SPACE */
3272 part_size_in_regs
= (reg_parm_stack_space
== 0 ? partial
: 0);
3275 = type
? size_in_bytes (type
) : size_int (GET_MODE_SIZE (passed_mode
));
3276 where_pad
= FUNCTION_ARG_PADDING (passed_mode
, type
);
3277 boundary
= FUNCTION_ARG_BOUNDARY (passed_mode
, type
);
3278 locate
->where_pad
= where_pad
;
3279 locate
->boundary
= boundary
;
3281 /* Remember if the outgoing parameter requires extra alignment on the
3282 calling function side. */
3283 if (boundary
> PREFERRED_STACK_BOUNDARY
)
3284 boundary
= PREFERRED_STACK_BOUNDARY
;
3285 if (cfun
->stack_alignment_needed
< boundary
)
3286 cfun
->stack_alignment_needed
= boundary
;
3288 #ifdef ARGS_GROW_DOWNWARD
3289 locate
->slot_offset
.constant
= -initial_offset_ptr
->constant
;
3290 if (initial_offset_ptr
->var
)
3291 locate
->slot_offset
.var
= size_binop (MINUS_EXPR
, ssize_int (0),
3292 initial_offset_ptr
->var
);
3296 if (where_pad
!= none
3297 && (!host_integerp (sizetree
, 1)
3298 || (tree_low_cst (sizetree
, 1) * BITS_PER_UNIT
) % PARM_BOUNDARY
))
3299 s2
= round_up (s2
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
3300 SUB_PARM_SIZE (locate
->slot_offset
, s2
);
3303 locate
->slot_offset
.constant
+= part_size_in_regs
;
3306 #ifdef REG_PARM_STACK_SPACE
3307 || REG_PARM_STACK_SPACE (fndecl
) > 0
3310 pad_to_arg_alignment (&locate
->slot_offset
, boundary
,
3311 &locate
->alignment_pad
);
3313 locate
->size
.constant
= (-initial_offset_ptr
->constant
3314 - locate
->slot_offset
.constant
);
3315 if (initial_offset_ptr
->var
)
3316 locate
->size
.var
= size_binop (MINUS_EXPR
,
3317 size_binop (MINUS_EXPR
,
3319 initial_offset_ptr
->var
),
3320 locate
->slot_offset
.var
);
3322 /* Pad_below needs the pre-rounded size to know how much to pad
3324 locate
->offset
= locate
->slot_offset
;
3325 if (where_pad
== downward
)
3326 pad_below (&locate
->offset
, passed_mode
, sizetree
);
3328 #else /* !ARGS_GROW_DOWNWARD */
3330 #ifdef REG_PARM_STACK_SPACE
3331 || REG_PARM_STACK_SPACE (fndecl
) > 0
3334 pad_to_arg_alignment (initial_offset_ptr
, boundary
,
3335 &locate
->alignment_pad
);
3336 locate
->slot_offset
= *initial_offset_ptr
;
3338 #ifdef PUSH_ROUNDING
3339 if (passed_mode
!= BLKmode
)
3340 sizetree
= size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree
)));
3343 /* Pad_below needs the pre-rounded size to know how much to pad below
3344 so this must be done before rounding up. */
3345 locate
->offset
= locate
->slot_offset
;
3346 if (where_pad
== downward
)
3347 pad_below (&locate
->offset
, passed_mode
, sizetree
);
3349 if (where_pad
!= none
3350 && (!host_integerp (sizetree
, 1)
3351 || (tree_low_cst (sizetree
, 1) * BITS_PER_UNIT
) % PARM_BOUNDARY
))
3352 sizetree
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
3354 ADD_PARM_SIZE (locate
->size
, sizetree
);
3356 locate
->size
.constant
-= part_size_in_regs
;
3357 #endif /* ARGS_GROW_DOWNWARD */
3360 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
3361 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
3364 pad_to_arg_alignment (struct args_size
*offset_ptr
, int boundary
,
3365 struct args_size
*alignment_pad
)
3367 tree save_var
= NULL_TREE
;
3368 HOST_WIDE_INT save_constant
= 0;
3369 int boundary_in_bytes
= boundary
/ BITS_PER_UNIT
;
3370 HOST_WIDE_INT sp_offset
= STACK_POINTER_OFFSET
;
3372 #ifdef SPARC_STACK_BOUNDARY_HACK
3373 /* ??? The SPARC port may claim a STACK_BOUNDARY higher than
3374 the real alignment of %sp. However, when it does this, the
3375 alignment of %sp+STACK_POINTER_OFFSET is STACK_BOUNDARY. */
3376 if (SPARC_STACK_BOUNDARY_HACK
)
3380 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
3382 save_var
= offset_ptr
->var
;
3383 save_constant
= offset_ptr
->constant
;
3386 alignment_pad
->var
= NULL_TREE
;
3387 alignment_pad
->constant
= 0;
3389 if (boundary
> BITS_PER_UNIT
)
3391 if (offset_ptr
->var
)
3393 tree sp_offset_tree
= ssize_int (sp_offset
);
3394 tree offset
= size_binop (PLUS_EXPR
,
3395 ARGS_SIZE_TREE (*offset_ptr
),
3397 #ifdef ARGS_GROW_DOWNWARD
3398 tree rounded
= round_down (offset
, boundary
/ BITS_PER_UNIT
);
3400 tree rounded
= round_up (offset
, boundary
/ BITS_PER_UNIT
);
3403 offset_ptr
->var
= size_binop (MINUS_EXPR
, rounded
, sp_offset_tree
);
3404 /* ARGS_SIZE_TREE includes constant term. */
3405 offset_ptr
->constant
= 0;
3406 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
3407 alignment_pad
->var
= size_binop (MINUS_EXPR
, offset_ptr
->var
,
3412 offset_ptr
->constant
= -sp_offset
+
3413 #ifdef ARGS_GROW_DOWNWARD
3414 FLOOR_ROUND (offset_ptr
->constant
+ sp_offset
, boundary_in_bytes
);
3416 CEIL_ROUND (offset_ptr
->constant
+ sp_offset
, boundary_in_bytes
);
3418 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
3419 alignment_pad
->constant
= offset_ptr
->constant
- save_constant
;
3425 pad_below (struct args_size
*offset_ptr
, enum machine_mode passed_mode
, tree sizetree
)
3427 if (passed_mode
!= BLKmode
)
3429 if (GET_MODE_BITSIZE (passed_mode
) % PARM_BOUNDARY
)
3430 offset_ptr
->constant
3431 += (((GET_MODE_BITSIZE (passed_mode
) + PARM_BOUNDARY
- 1)
3432 / PARM_BOUNDARY
* PARM_BOUNDARY
/ BITS_PER_UNIT
)
3433 - GET_MODE_SIZE (passed_mode
));
3437 if (TREE_CODE (sizetree
) != INTEGER_CST
3438 || (TREE_INT_CST_LOW (sizetree
) * BITS_PER_UNIT
) % PARM_BOUNDARY
)
3440 /* Round the size up to multiple of PARM_BOUNDARY bits. */
3441 tree s2
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
3443 ADD_PARM_SIZE (*offset_ptr
, s2
);
3444 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
3449 /* Walk the tree of blocks describing the binding levels within a function
3450 and warn about variables the might be killed by setjmp or vfork.
3451 This is done after calling flow_analysis and before global_alloc
3452 clobbers the pseudo-regs to hard regs. */
3455 setjmp_vars_warning (tree block
)
3459 for (decl
= BLOCK_VARS (block
); decl
; decl
= TREE_CHAIN (decl
))
3461 if (TREE_CODE (decl
) == VAR_DECL
3462 && DECL_RTL_SET_P (decl
)
3463 && REG_P (DECL_RTL (decl
))
3464 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl
))))
3465 warning (0, "variable %q+D might be clobbered by %<longjmp%>"
3470 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= TREE_CHAIN (sub
))
3471 setjmp_vars_warning (sub
);
3474 /* Do the appropriate part of setjmp_vars_warning
3475 but for arguments instead of local variables. */
3478 setjmp_args_warning (void)
3481 for (decl
= DECL_ARGUMENTS (current_function_decl
);
3482 decl
; decl
= TREE_CHAIN (decl
))
3483 if (DECL_RTL (decl
) != 0
3484 && REG_P (DECL_RTL (decl
))
3485 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl
))))
3486 warning (0, "argument %q+D might be clobbered by %<longjmp%> or %<vfork%>",
3491 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
3492 and create duplicate blocks. */
3493 /* ??? Need an option to either create block fragments or to create
3494 abstract origin duplicates of a source block. It really depends
3495 on what optimization has been performed. */
3498 reorder_blocks (void)
3500 tree block
= DECL_INITIAL (current_function_decl
);
3501 VEC(tree
,heap
) *block_stack
;
3503 if (block
== NULL_TREE
)
3506 block_stack
= VEC_alloc (tree
, heap
, 10);
3508 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
3509 clear_block_marks (block
);
3511 /* Prune the old trees away, so that they don't get in the way. */
3512 BLOCK_SUBBLOCKS (block
) = NULL_TREE
;
3513 BLOCK_CHAIN (block
) = NULL_TREE
;
3515 /* Recreate the block tree from the note nesting. */
3516 reorder_blocks_1 (get_insns (), block
, &block_stack
);
3517 BLOCK_SUBBLOCKS (block
) = blocks_nreverse (BLOCK_SUBBLOCKS (block
));
3519 /* Remove deleted blocks from the block fragment chains. */
3520 reorder_fix_fragments (block
);
3522 VEC_free (tree
, heap
, block_stack
);
3525 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
3528 clear_block_marks (tree block
)
3532 TREE_ASM_WRITTEN (block
) = 0;
3533 clear_block_marks (BLOCK_SUBBLOCKS (block
));
3534 block
= BLOCK_CHAIN (block
);
3539 reorder_blocks_1 (rtx insns
, tree current_block
, VEC(tree
,heap
) **p_block_stack
)
3543 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
3547 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
)
3549 tree block
= NOTE_BLOCK (insn
);
3551 /* If we have seen this block before, that means it now
3552 spans multiple address regions. Create a new fragment. */
3553 if (TREE_ASM_WRITTEN (block
))
3555 tree new_block
= copy_node (block
);
3558 origin
= (BLOCK_FRAGMENT_ORIGIN (block
)
3559 ? BLOCK_FRAGMENT_ORIGIN (block
)
3561 BLOCK_FRAGMENT_ORIGIN (new_block
) = origin
;
3562 BLOCK_FRAGMENT_CHAIN (new_block
)
3563 = BLOCK_FRAGMENT_CHAIN (origin
);
3564 BLOCK_FRAGMENT_CHAIN (origin
) = new_block
;
3566 NOTE_BLOCK (insn
) = new_block
;
3570 BLOCK_SUBBLOCKS (block
) = 0;
3571 TREE_ASM_WRITTEN (block
) = 1;
3572 /* When there's only one block for the entire function,
3573 current_block == block and we mustn't do this, it
3574 will cause infinite recursion. */
3575 if (block
!= current_block
)
3577 BLOCK_SUPERCONTEXT (block
) = current_block
;
3578 BLOCK_CHAIN (block
) = BLOCK_SUBBLOCKS (current_block
);
3579 BLOCK_SUBBLOCKS (current_block
) = block
;
3580 current_block
= block
;
3582 VEC_safe_push (tree
, heap
, *p_block_stack
, block
);
3584 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
)
3586 NOTE_BLOCK (insn
) = VEC_pop (tree
, *p_block_stack
);
3587 BLOCK_SUBBLOCKS (current_block
)
3588 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block
));
3589 current_block
= BLOCK_SUPERCONTEXT (current_block
);
3595 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
3596 appears in the block tree, select one of the fragments to become
3597 the new origin block. */
3600 reorder_fix_fragments (tree block
)
3604 tree dup_origin
= BLOCK_FRAGMENT_ORIGIN (block
);
3605 tree new_origin
= NULL_TREE
;
3609 if (! TREE_ASM_WRITTEN (dup_origin
))
3611 new_origin
= BLOCK_FRAGMENT_CHAIN (dup_origin
);
3613 /* Find the first of the remaining fragments. There must
3614 be at least one -- the current block. */
3615 while (! TREE_ASM_WRITTEN (new_origin
))
3616 new_origin
= BLOCK_FRAGMENT_CHAIN (new_origin
);
3617 BLOCK_FRAGMENT_ORIGIN (new_origin
) = NULL_TREE
;
3620 else if (! dup_origin
)
3623 /* Re-root the rest of the fragments to the new origin. In the
3624 case that DUP_ORIGIN was null, that means BLOCK was the origin
3625 of a chain of fragments and we want to remove those fragments
3626 that didn't make it to the output. */
3629 tree
*pp
= &BLOCK_FRAGMENT_CHAIN (new_origin
);
3634 if (TREE_ASM_WRITTEN (chain
))
3636 BLOCK_FRAGMENT_ORIGIN (chain
) = new_origin
;
3638 pp
= &BLOCK_FRAGMENT_CHAIN (chain
);
3640 chain
= BLOCK_FRAGMENT_CHAIN (chain
);
3645 reorder_fix_fragments (BLOCK_SUBBLOCKS (block
));
3646 block
= BLOCK_CHAIN (block
);
3650 /* Reverse the order of elements in the chain T of blocks,
3651 and return the new head of the chain (old last element). */
3654 blocks_nreverse (tree t
)
3656 tree prev
= 0, decl
, next
;
3657 for (decl
= t
; decl
; decl
= next
)
3659 next
= BLOCK_CHAIN (decl
);
3660 BLOCK_CHAIN (decl
) = prev
;
3666 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
3667 non-NULL, list them all into VECTOR, in a depth-first preorder
3668 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
3672 all_blocks (tree block
, tree
*vector
)
3678 TREE_ASM_WRITTEN (block
) = 0;
3680 /* Record this block. */
3682 vector
[n_blocks
] = block
;
3686 /* Record the subblocks, and their subblocks... */
3687 n_blocks
+= all_blocks (BLOCK_SUBBLOCKS (block
),
3688 vector
? vector
+ n_blocks
: 0);
3689 block
= BLOCK_CHAIN (block
);
3695 /* Return a vector containing all the blocks rooted at BLOCK. The
3696 number of elements in the vector is stored in N_BLOCKS_P. The
3697 vector is dynamically allocated; it is the caller's responsibility
3698 to call `free' on the pointer returned. */
3701 get_block_vector (tree block
, int *n_blocks_p
)
3705 *n_blocks_p
= all_blocks (block
, NULL
);
3706 block_vector
= xmalloc (*n_blocks_p
* sizeof (tree
));
3707 all_blocks (block
, block_vector
);
3709 return block_vector
;
3712 static GTY(()) int next_block_index
= 2;
3714 /* Set BLOCK_NUMBER for all the blocks in FN. */
3717 number_blocks (tree fn
)
3723 /* For SDB and XCOFF debugging output, we start numbering the blocks
3724 from 1 within each function, rather than keeping a running
3726 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
3727 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
3728 next_block_index
= 1;
3731 block_vector
= get_block_vector (DECL_INITIAL (fn
), &n_blocks
);
3733 /* The top-level BLOCK isn't numbered at all. */
3734 for (i
= 1; i
< n_blocks
; ++i
)
3735 /* We number the blocks from two. */
3736 BLOCK_NUMBER (block_vector
[i
]) = next_block_index
++;
3738 free (block_vector
);
3743 /* If VAR is present in a subblock of BLOCK, return the subblock. */
3746 debug_find_var_in_block_tree (tree var
, tree block
)
3750 for (t
= BLOCK_VARS (block
); t
; t
= TREE_CHAIN (t
))
3754 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= TREE_CHAIN (t
))
3756 tree ret
= debug_find_var_in_block_tree (var
, t
);
3764 /* Allocate a function structure for FNDECL and set its contents
3768 allocate_struct_function (tree fndecl
)
3771 tree fntype
= fndecl
? TREE_TYPE (fndecl
) : NULL_TREE
;
3773 cfun
= ggc_alloc_cleared (sizeof (struct function
));
3775 cfun
->stack_alignment_needed
= STACK_BOUNDARY
;
3776 cfun
->preferred_stack_boundary
= STACK_BOUNDARY
;
3778 current_function_funcdef_no
= funcdef_no
++;
3780 cfun
->function_frequency
= FUNCTION_FREQUENCY_NORMAL
;
3782 init_eh_for_function ();
3784 lang_hooks
.function
.init (cfun
);
3785 if (init_machine_status
)
3786 cfun
->machine
= (*init_machine_status
) ();
3791 DECL_STRUCT_FUNCTION (fndecl
) = cfun
;
3792 cfun
->decl
= fndecl
;
3794 result
= DECL_RESULT (fndecl
);
3795 if (aggregate_value_p (result
, fndecl
))
3797 #ifdef PCC_STATIC_STRUCT_RETURN
3798 current_function_returns_pcc_struct
= 1;
3800 current_function_returns_struct
= 1;
3803 current_function_returns_pointer
= POINTER_TYPE_P (TREE_TYPE (result
));
3805 current_function_stdarg
3807 && TYPE_ARG_TYPES (fntype
) != 0
3808 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype
)))
3809 != void_type_node
));
3811 /* Assume all registers in stdarg functions need to be saved. */
3812 cfun
->va_list_gpr_size
= VA_LIST_MAX_GPR_SIZE
;
3813 cfun
->va_list_fpr_size
= VA_LIST_MAX_FPR_SIZE
;
3816 /* Reset cfun, and other non-struct-function variables to defaults as
3817 appropriate for emitting rtl at the start of a function. */
3820 prepare_function_start (tree fndecl
)
3822 if (fndecl
&& DECL_STRUCT_FUNCTION (fndecl
))
3823 cfun
= DECL_STRUCT_FUNCTION (fndecl
);
3825 allocate_struct_function (fndecl
);
3827 init_varasm_status (cfun
);
3830 cse_not_expected
= ! optimize
;
3832 /* Caller save not needed yet. */
3833 caller_save_needed
= 0;
3835 /* We haven't done register allocation yet. */
3838 /* Indicate that we have not instantiated virtual registers yet. */
3839 virtuals_instantiated
= 0;
3841 /* Indicate that we want CONCATs now. */
3842 generating_concat_p
= 1;
3844 /* Indicate we have no need of a frame pointer yet. */
3845 frame_pointer_needed
= 0;
3848 /* Initialize the rtl expansion mechanism so that we can do simple things
3849 like generate sequences. This is used to provide a context during global
3850 initialization of some passes. */
3852 init_dummy_function_start (void)
3854 prepare_function_start (NULL
);
3857 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
3858 and initialize static variables for generating RTL for the statements
3862 init_function_start (tree subr
)
3864 prepare_function_start (subr
);
3866 /* Prevent ever trying to delete the first instruction of a
3867 function. Also tell final how to output a linenum before the
3868 function prologue. Note linenums could be missing, e.g. when
3869 compiling a Java .class file. */
3870 if (! DECL_IS_BUILTIN (subr
))
3871 emit_line_note (DECL_SOURCE_LOCATION (subr
));
3873 /* Make sure first insn is a note even if we don't want linenums.
3874 This makes sure the first insn will never be deleted.
3875 Also, final expects a note to appear there. */
3876 emit_note (NOTE_INSN_DELETED
);
3878 /* Warn if this value is an aggregate type,
3879 regardless of which calling convention we are using for it. */
3880 if (AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr
))))
3881 warning (OPT_Waggregate_return
, "function returns an aggregate");
3884 /* Make sure all values used by the optimization passes have sane
3887 init_function_for_compilation (void)
3891 /* No prologue/epilogue insns yet. Make sure that these vectors are
3893 gcc_assert (VEC_length (int, prologue
) == 0);
3894 gcc_assert (VEC_length (int, epilogue
) == 0);
3895 gcc_assert (VEC_length (int, sibcall_epilogue
) == 0);
3898 struct tree_opt_pass pass_init_function
=
3902 init_function_for_compilation
, /* execute */
3905 0, /* static_pass_number */
3907 0, /* properties_required */
3908 0, /* properties_provided */
3909 0, /* properties_destroyed */
3910 0, /* todo_flags_start */
3911 0, /* todo_flags_finish */
3917 expand_main_function (void)
3919 #if (defined(INVOKE__main) \
3920 || (!defined(HAS_INIT_SECTION) \
3921 && !defined(INIT_SECTION_ASM_OP) \
3922 && !defined(INIT_ARRAY_SECTION_ASM_OP)))
3923 emit_library_call (init_one_libfunc (NAME__MAIN
), LCT_NORMAL
, VOIDmode
, 0);
3927 /* Expand code to initialize the stack_protect_guard. This is invoked at
3928 the beginning of a function to be protected. */
3930 #ifndef HAVE_stack_protect_set
3931 # define HAVE_stack_protect_set 0
3932 # define gen_stack_protect_set(x,y) (gcc_unreachable (), NULL_RTX)
3936 stack_protect_prologue (void)
3938 tree guard_decl
= targetm
.stack_protect_guard ();
3941 /* Avoid expand_expr here, because we don't want guard_decl pulled
3942 into registers unless absolutely necessary. And we know that
3943 cfun->stack_protect_guard is a local stack slot, so this skips
3945 x
= validize_mem (DECL_RTL (cfun
->stack_protect_guard
));
3946 y
= validize_mem (DECL_RTL (guard_decl
));
3948 /* Allow the target to copy from Y to X without leaking Y into a
3950 if (HAVE_stack_protect_set
)
3952 rtx insn
= gen_stack_protect_set (x
, y
);
3960 /* Otherwise do a straight move. */
3961 emit_move_insn (x
, y
);
3964 /* Expand code to verify the stack_protect_guard. This is invoked at
3965 the end of a function to be protected. */
3967 #ifndef HAVE_stack_protect_test
3968 # define HAVE_stack_protect_test 0
3969 # define gen_stack_protect_test(x, y, z) (gcc_unreachable (), NULL_RTX)
3973 stack_protect_epilogue (void)
3975 tree guard_decl
= targetm
.stack_protect_guard ();
3976 rtx label
= gen_label_rtx ();
3979 /* Avoid expand_expr here, because we don't want guard_decl pulled
3980 into registers unless absolutely necessary. And we know that
3981 cfun->stack_protect_guard is a local stack slot, so this skips
3983 x
= validize_mem (DECL_RTL (cfun
->stack_protect_guard
));
3984 y
= validize_mem (DECL_RTL (guard_decl
));
3986 /* Allow the target to compare Y with X without leaking either into
3988 switch (HAVE_stack_protect_test
!= 0)
3991 tmp
= gen_stack_protect_test (x
, y
, label
);
4000 emit_cmp_and_jump_insns (x
, y
, EQ
, NULL_RTX
, ptr_mode
, 1, label
);
4004 /* The noreturn predictor has been moved to the tree level. The rtl-level
4005 predictors estimate this branch about 20%, which isn't enough to get
4006 things moved out of line. Since this is the only extant case of adding
4007 a noreturn function at the rtl level, it doesn't seem worth doing ought
4008 except adding the prediction by hand. */
4009 tmp
= get_last_insn ();
4011 predict_insn_def (tmp
, PRED_NORETURN
, TAKEN
);
4013 expand_expr_stmt (targetm
.stack_protect_fail ());
4017 /* Start the RTL for a new function, and set variables used for
4019 SUBR is the FUNCTION_DECL node.
4020 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
4021 the function's parameters, which must be run at any return statement. */
4024 expand_function_start (tree subr
)
4026 /* Make sure volatile mem refs aren't considered
4027 valid operands of arithmetic insns. */
4028 init_recog_no_volatile ();
4030 current_function_profile
4032 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr
));
4034 current_function_limit_stack
4035 = (stack_limit_rtx
!= NULL_RTX
&& ! DECL_NO_LIMIT_STACK (subr
));
4037 /* Make the label for return statements to jump to. Do not special
4038 case machines with special return instructions -- they will be
4039 handled later during jump, ifcvt, or epilogue creation. */
4040 return_label
= gen_label_rtx ();
4042 /* Initialize rtx used to return the value. */
4043 /* Do this before assign_parms so that we copy the struct value address
4044 before any library calls that assign parms might generate. */
4046 /* Decide whether to return the value in memory or in a register. */
4047 if (aggregate_value_p (DECL_RESULT (subr
), subr
))
4049 /* Returning something that won't go in a register. */
4050 rtx value_address
= 0;
4052 #ifdef PCC_STATIC_STRUCT_RETURN
4053 if (current_function_returns_pcc_struct
)
4055 int size
= int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr
)));
4056 value_address
= assemble_static_space (size
);
4061 rtx sv
= targetm
.calls
.struct_value_rtx (TREE_TYPE (subr
), 1);
4062 /* Expect to be passed the address of a place to store the value.
4063 If it is passed as an argument, assign_parms will take care of
4067 value_address
= gen_reg_rtx (Pmode
);
4068 emit_move_insn (value_address
, sv
);
4073 rtx x
= value_address
;
4074 if (!DECL_BY_REFERENCE (DECL_RESULT (subr
)))
4076 x
= gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr
)), x
);
4077 set_mem_attributes (x
, DECL_RESULT (subr
), 1);
4079 SET_DECL_RTL (DECL_RESULT (subr
), x
);
4082 else if (DECL_MODE (DECL_RESULT (subr
)) == VOIDmode
)
4083 /* If return mode is void, this decl rtl should not be used. */
4084 SET_DECL_RTL (DECL_RESULT (subr
), NULL_RTX
);
4087 /* Compute the return values into a pseudo reg, which we will copy
4088 into the true return register after the cleanups are done. */
4089 tree return_type
= TREE_TYPE (DECL_RESULT (subr
));
4090 if (TYPE_MODE (return_type
) != BLKmode
4091 && targetm
.calls
.return_in_msb (return_type
))
4092 /* expand_function_end will insert the appropriate padding in
4093 this case. Use the return value's natural (unpadded) mode
4094 within the function proper. */
4095 SET_DECL_RTL (DECL_RESULT (subr
),
4096 gen_reg_rtx (TYPE_MODE (return_type
)));
4099 /* In order to figure out what mode to use for the pseudo, we
4100 figure out what the mode of the eventual return register will
4101 actually be, and use that. */
4102 rtx hard_reg
= hard_function_value (return_type
, subr
, 0, 1);
4104 /* Structures that are returned in registers are not
4105 aggregate_value_p, so we may see a PARALLEL or a REG. */
4106 if (REG_P (hard_reg
))
4107 SET_DECL_RTL (DECL_RESULT (subr
),
4108 gen_reg_rtx (GET_MODE (hard_reg
)));
4111 gcc_assert (GET_CODE (hard_reg
) == PARALLEL
);
4112 SET_DECL_RTL (DECL_RESULT (subr
), gen_group_rtx (hard_reg
));
4116 /* Set DECL_REGISTER flag so that expand_function_end will copy the
4117 result to the real return register(s). */
4118 DECL_REGISTER (DECL_RESULT (subr
)) = 1;
4121 /* Initialize rtx for parameters and local variables.
4122 In some cases this requires emitting insns. */
4123 assign_parms (subr
);
4125 /* If function gets a static chain arg, store it. */
4126 if (cfun
->static_chain_decl
)
4128 tree parm
= cfun
->static_chain_decl
;
4129 rtx local
= gen_reg_rtx (Pmode
);
4131 set_decl_incoming_rtl (parm
, static_chain_incoming_rtx
);
4132 SET_DECL_RTL (parm
, local
);
4133 mark_reg_pointer (local
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
))));
4135 emit_move_insn (local
, static_chain_incoming_rtx
);
4138 /* If the function receives a non-local goto, then store the
4139 bits we need to restore the frame pointer. */
4140 if (cfun
->nonlocal_goto_save_area
)
4145 /* ??? We need to do this save early. Unfortunately here is
4146 before the frame variable gets declared. Help out... */
4147 expand_var (TREE_OPERAND (cfun
->nonlocal_goto_save_area
, 0));
4149 t_save
= build4 (ARRAY_REF
, ptr_type_node
,
4150 cfun
->nonlocal_goto_save_area
,
4151 integer_zero_node
, NULL_TREE
, NULL_TREE
);
4152 r_save
= expand_expr (t_save
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4153 r_save
= convert_memory_address (Pmode
, r_save
);
4155 emit_move_insn (r_save
, virtual_stack_vars_rtx
);
4156 update_nonlocal_goto_save_area ();
4159 /* The following was moved from init_function_start.
4160 The move is supposed to make sdb output more accurate. */
4161 /* Indicate the beginning of the function body,
4162 as opposed to parm setup. */
4163 emit_note (NOTE_INSN_FUNCTION_BEG
);
4165 if (!NOTE_P (get_last_insn ()))
4166 emit_note (NOTE_INSN_DELETED
);
4167 parm_birth_insn
= get_last_insn ();
4169 if (current_function_profile
)
4172 PROFILE_HOOK (current_function_funcdef_no
);
4176 /* After the display initializations is where the tail-recursion label
4177 should go, if we end up needing one. Ensure we have a NOTE here
4178 since some things (like trampolines) get placed before this. */
4179 tail_recursion_reentry
= emit_note (NOTE_INSN_DELETED
);
4181 /* Make sure there is a line number after the function entry setup code. */
4182 force_next_line_note ();
4185 /* Undo the effects of init_dummy_function_start. */
4187 expand_dummy_function_end (void)
4189 /* End any sequences that failed to be closed due to syntax errors. */
4190 while (in_sequence_p ())
4193 /* Outside function body, can't compute type's actual size
4194 until next function's body starts. */
4196 free_after_parsing (cfun
);
4197 free_after_compilation (cfun
);
4201 /* Call DOIT for each hard register used as a return value from
4202 the current function. */
4205 diddle_return_value (void (*doit
) (rtx
, void *), void *arg
)
4207 rtx outgoing
= current_function_return_rtx
;
4212 if (REG_P (outgoing
))
4213 (*doit
) (outgoing
, arg
);
4214 else if (GET_CODE (outgoing
) == PARALLEL
)
4218 for (i
= 0; i
< XVECLEN (outgoing
, 0); i
++)
4220 rtx x
= XEXP (XVECEXP (outgoing
, 0, i
), 0);
4222 if (REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
)
4229 do_clobber_return_reg (rtx reg
, void *arg ATTRIBUTE_UNUSED
)
4231 emit_insn (gen_rtx_CLOBBER (VOIDmode
, reg
));
4235 clobber_return_register (void)
4237 diddle_return_value (do_clobber_return_reg
, NULL
);
4239 /* In case we do use pseudo to return value, clobber it too. */
4240 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
4242 tree decl_result
= DECL_RESULT (current_function_decl
);
4243 rtx decl_rtl
= DECL_RTL (decl_result
);
4244 if (REG_P (decl_rtl
) && REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
)
4246 do_clobber_return_reg (decl_rtl
, NULL
);
4252 do_use_return_reg (rtx reg
, void *arg ATTRIBUTE_UNUSED
)
4254 emit_insn (gen_rtx_USE (VOIDmode
, reg
));
4258 use_return_register (void)
4260 diddle_return_value (do_use_return_reg
, NULL
);
4263 /* Possibly warn about unused parameters. */
4265 do_warn_unused_parameter (tree fn
)
4269 for (decl
= DECL_ARGUMENTS (fn
);
4270 decl
; decl
= TREE_CHAIN (decl
))
4271 if (!TREE_USED (decl
) && TREE_CODE (decl
) == PARM_DECL
4272 && DECL_NAME (decl
) && !DECL_ARTIFICIAL (decl
))
4273 warning (OPT_Wunused_parameter
, "unused parameter %q+D", decl
);
4276 static GTY(()) rtx initial_trampoline
;
4278 /* Generate RTL for the end of the current function. */
4281 expand_function_end (void)
4285 /* If arg_pointer_save_area was referenced only from a nested
4286 function, we will not have initialized it yet. Do that now. */
4287 if (arg_pointer_save_area
&& ! cfun
->arg_pointer_save_area_init
)
4288 get_arg_pointer_save_area (cfun
);
4290 /* If we are doing stack checking and this function makes calls,
4291 do a stack probe at the start of the function to ensure we have enough
4292 space for another stack frame. */
4293 if (flag_stack_check
&& ! STACK_CHECK_BUILTIN
)
4297 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4301 probe_stack_range (STACK_CHECK_PROTECT
,
4302 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE
));
4305 emit_insn_before (seq
, tail_recursion_reentry
);
4310 /* Possibly warn about unused parameters.
4311 When frontend does unit-at-a-time, the warning is already
4312 issued at finalization time. */
4313 if (warn_unused_parameter
4314 && !lang_hooks
.callgraph
.expand_function
)
4315 do_warn_unused_parameter (current_function_decl
);
4317 /* End any sequences that failed to be closed due to syntax errors. */
4318 while (in_sequence_p ())
4321 clear_pending_stack_adjust ();
4322 do_pending_stack_adjust ();
4324 /* @@@ This is a kludge. We want to ensure that instructions that
4325 may trap are not moved into the epilogue by scheduling, because
4326 we don't always emit unwind information for the epilogue.
4327 However, not all machine descriptions define a blockage insn, so
4328 emit an ASM_INPUT to act as one. */
4329 if (flag_non_call_exceptions
)
4330 emit_insn (gen_rtx_ASM_INPUT (VOIDmode
, ""));
4332 /* Mark the end of the function body.
4333 If control reaches this insn, the function can drop through
4334 without returning a value. */
4335 emit_note (NOTE_INSN_FUNCTION_END
);
4337 /* Must mark the last line number note in the function, so that the test
4338 coverage code can avoid counting the last line twice. This just tells
4339 the code to ignore the immediately following line note, since there
4340 already exists a copy of this note somewhere above. This line number
4341 note is still needed for debugging though, so we can't delete it. */
4342 if (flag_test_coverage
)
4343 emit_note (NOTE_INSN_REPEATED_LINE_NUMBER
);
4345 /* Output a linenumber for the end of the function.
4346 SDB depends on this. */
4347 force_next_line_note ();
4348 emit_line_note (input_location
);
4350 /* Before the return label (if any), clobber the return
4351 registers so that they are not propagated live to the rest of
4352 the function. This can only happen with functions that drop
4353 through; if there had been a return statement, there would
4354 have either been a return rtx, or a jump to the return label.
4356 We delay actual code generation after the current_function_value_rtx
4358 clobber_after
= get_last_insn ();
4360 /* Output the label for the actual return from the function. */
4361 emit_label (return_label
);
4363 /* Let except.c know where it should emit the call to unregister
4364 the function context for sjlj exceptions. */
4365 if (flag_exceptions
&& USING_SJLJ_EXCEPTIONS
)
4366 sjlj_emit_function_exit_after (get_last_insn ());
4368 /* If this is an implementation of throw, do what's necessary to
4369 communicate between __builtin_eh_return and the epilogue. */
4370 expand_eh_return ();
4372 /* If scalar return value was computed in a pseudo-reg, or was a named
4373 return value that got dumped to the stack, copy that to the hard
4375 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
4377 tree decl_result
= DECL_RESULT (current_function_decl
);
4378 rtx decl_rtl
= DECL_RTL (decl_result
);
4380 if (REG_P (decl_rtl
)
4381 ? REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
4382 : DECL_REGISTER (decl_result
))
4384 rtx real_decl_rtl
= current_function_return_rtx
;
4386 /* This should be set in assign_parms. */
4387 gcc_assert (REG_FUNCTION_VALUE_P (real_decl_rtl
));
4389 /* If this is a BLKmode structure being returned in registers,
4390 then use the mode computed in expand_return. Note that if
4391 decl_rtl is memory, then its mode may have been changed,
4392 but that current_function_return_rtx has not. */
4393 if (GET_MODE (real_decl_rtl
) == BLKmode
)
4394 PUT_MODE (real_decl_rtl
, GET_MODE (decl_rtl
));
4396 /* If a non-BLKmode return value should be padded at the least
4397 significant end of the register, shift it left by the appropriate
4398 amount. BLKmode results are handled using the group load/store
4400 if (TYPE_MODE (TREE_TYPE (decl_result
)) != BLKmode
4401 && targetm
.calls
.return_in_msb (TREE_TYPE (decl_result
)))
4403 emit_move_insn (gen_rtx_REG (GET_MODE (decl_rtl
),
4404 REGNO (real_decl_rtl
)),
4406 shift_return_value (GET_MODE (decl_rtl
), true, real_decl_rtl
);
4408 /* If a named return value dumped decl_return to memory, then
4409 we may need to re-do the PROMOTE_MODE signed/unsigned
4411 else if (GET_MODE (real_decl_rtl
) != GET_MODE (decl_rtl
))
4413 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (decl_result
));
4415 if (targetm
.calls
.promote_function_return (TREE_TYPE (current_function_decl
)))
4416 promote_mode (TREE_TYPE (decl_result
), GET_MODE (decl_rtl
),
4419 convert_move (real_decl_rtl
, decl_rtl
, unsignedp
);
4421 else if (GET_CODE (real_decl_rtl
) == PARALLEL
)
4423 /* If expand_function_start has created a PARALLEL for decl_rtl,
4424 move the result to the real return registers. Otherwise, do
4425 a group load from decl_rtl for a named return. */
4426 if (GET_CODE (decl_rtl
) == PARALLEL
)
4427 emit_group_move (real_decl_rtl
, decl_rtl
);
4429 emit_group_load (real_decl_rtl
, decl_rtl
,
4430 TREE_TYPE (decl_result
),
4431 int_size_in_bytes (TREE_TYPE (decl_result
)));
4433 /* In the case of complex integer modes smaller than a word, we'll
4434 need to generate some non-trivial bitfield insertions. Do that
4435 on a pseudo and not the hard register. */
4436 else if (GET_CODE (decl_rtl
) == CONCAT
4437 && GET_MODE_CLASS (GET_MODE (decl_rtl
)) == MODE_COMPLEX_INT
4438 && GET_MODE_BITSIZE (GET_MODE (decl_rtl
)) <= BITS_PER_WORD
)
4440 int old_generating_concat_p
;
4443 old_generating_concat_p
= generating_concat_p
;
4444 generating_concat_p
= 0;
4445 tmp
= gen_reg_rtx (GET_MODE (decl_rtl
));
4446 generating_concat_p
= old_generating_concat_p
;
4448 emit_move_insn (tmp
, decl_rtl
);
4449 emit_move_insn (real_decl_rtl
, tmp
);
4452 emit_move_insn (real_decl_rtl
, decl_rtl
);
4456 /* If returning a structure, arrange to return the address of the value
4457 in a place where debuggers expect to find it.
4459 If returning a structure PCC style,
4460 the caller also depends on this value.
4461 And current_function_returns_pcc_struct is not necessarily set. */
4462 if (current_function_returns_struct
4463 || current_function_returns_pcc_struct
)
4465 rtx value_address
= DECL_RTL (DECL_RESULT (current_function_decl
));
4466 tree type
= TREE_TYPE (DECL_RESULT (current_function_decl
));
4469 if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl
)))
4470 type
= TREE_TYPE (type
);
4472 value_address
= XEXP (value_address
, 0);
4474 outgoing
= targetm
.calls
.function_value (build_pointer_type (type
),
4475 current_function_decl
, true);
4477 /* Mark this as a function return value so integrate will delete the
4478 assignment and USE below when inlining this function. */
4479 REG_FUNCTION_VALUE_P (outgoing
) = 1;
4481 /* The address may be ptr_mode and OUTGOING may be Pmode. */
4482 value_address
= convert_memory_address (GET_MODE (outgoing
),
4485 emit_move_insn (outgoing
, value_address
);
4487 /* Show return register used to hold result (in this case the address
4489 current_function_return_rtx
= outgoing
;
4492 /* Emit the actual code to clobber return register. */
4497 clobber_return_register ();
4498 expand_naked_return ();
4502 emit_insn_after (seq
, clobber_after
);
4505 /* Output the label for the naked return from the function. */
4506 emit_label (naked_return_label
);
4508 /* If stack protection is enabled for this function, check the guard. */
4509 if (cfun
->stack_protect_guard
)
4510 stack_protect_epilogue ();
4512 /* If we had calls to alloca, and this machine needs
4513 an accurate stack pointer to exit the function,
4514 insert some code to save and restore the stack pointer. */
4515 if (! EXIT_IGNORE_STACK
4516 && current_function_calls_alloca
)
4520 emit_stack_save (SAVE_FUNCTION
, &tem
, parm_birth_insn
);
4521 emit_stack_restore (SAVE_FUNCTION
, tem
, NULL_RTX
);
4524 /* ??? This should no longer be necessary since stupid is no longer with
4525 us, but there are some parts of the compiler (eg reload_combine, and
4526 sh mach_dep_reorg) that still try and compute their own lifetime info
4527 instead of using the general framework. */
4528 use_return_register ();
4532 get_arg_pointer_save_area (struct function
*f
)
4534 rtx ret
= f
->x_arg_pointer_save_area
;
4538 ret
= assign_stack_local_1 (Pmode
, GET_MODE_SIZE (Pmode
), 0, f
);
4539 f
->x_arg_pointer_save_area
= ret
;
4542 if (f
== cfun
&& ! f
->arg_pointer_save_area_init
)
4546 /* Save the arg pointer at the beginning of the function. The
4547 generated stack slot may not be a valid memory address, so we
4548 have to check it and fix it if necessary. */
4550 emit_move_insn (validize_mem (ret
), virtual_incoming_args_rtx
);
4554 push_topmost_sequence ();
4555 emit_insn_after (seq
, entry_of_function ());
4556 pop_topmost_sequence ();
4562 /* Extend a vector that records the INSN_UIDs of INSNS
4563 (a list of one or more insns). */
4566 record_insns (rtx insns
, VEC(int,heap
) **vecp
)
4570 for (tmp
= insns
; tmp
!= NULL_RTX
; tmp
= NEXT_INSN (tmp
))
4571 VEC_safe_push (int, heap
, *vecp
, INSN_UID (tmp
));
4574 /* Set the locator of the insn chain starting at INSN to LOC. */
4576 set_insn_locators (rtx insn
, int loc
)
4578 while (insn
!= NULL_RTX
)
4581 INSN_LOCATOR (insn
) = loc
;
4582 insn
= NEXT_INSN (insn
);
4586 /* Determine how many INSN_UIDs in VEC are part of INSN. Because we can
4587 be running after reorg, SEQUENCE rtl is possible. */
4590 contains (rtx insn
, VEC(int,heap
) **vec
)
4594 if (NONJUMP_INSN_P (insn
)
4595 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
4598 for (i
= XVECLEN (PATTERN (insn
), 0) - 1; i
>= 0; i
--)
4599 for (j
= VEC_length (int, *vec
) - 1; j
>= 0; --j
)
4600 if (INSN_UID (XVECEXP (PATTERN (insn
), 0, i
))
4601 == VEC_index (int, *vec
, j
))
4607 for (j
= VEC_length (int, *vec
) - 1; j
>= 0; --j
)
4608 if (INSN_UID (insn
) == VEC_index (int, *vec
, j
))
4615 prologue_epilogue_contains (rtx insn
)
4617 if (contains (insn
, &prologue
))
4619 if (contains (insn
, &epilogue
))
4625 sibcall_epilogue_contains (rtx insn
)
4627 if (sibcall_epilogue
)
4628 return contains (insn
, &sibcall_epilogue
);
4633 /* Insert gen_return at the end of block BB. This also means updating
4634 block_for_insn appropriately. */
4637 emit_return_into_block (basic_block bb
, rtx line_note
)
4639 emit_jump_insn_after (gen_return (), BB_END (bb
));
4641 emit_note_copy_after (line_note
, PREV_INSN (BB_END (bb
)));
4643 #endif /* HAVE_return */
4645 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
4647 /* These functions convert the epilogue into a variant that does not
4648 modify the stack pointer. This is used in cases where a function
4649 returns an object whose size is not known until it is computed.
4650 The called function leaves the object on the stack, leaves the
4651 stack depressed, and returns a pointer to the object.
4653 What we need to do is track all modifications and references to the
4654 stack pointer, deleting the modifications and changing the
4655 references to point to the location the stack pointer would have
4656 pointed to had the modifications taken place.
4658 These functions need to be portable so we need to make as few
4659 assumptions about the epilogue as we can. However, the epilogue
4660 basically contains three things: instructions to reset the stack
4661 pointer, instructions to reload registers, possibly including the
4662 frame pointer, and an instruction to return to the caller.
4664 We must be sure of what a relevant epilogue insn is doing. We also
4665 make no attempt to validate the insns we make since if they are
4666 invalid, we probably can't do anything valid. The intent is that
4667 these routines get "smarter" as more and more machines start to use
4668 them and they try operating on different epilogues.
4670 We use the following structure to track what the part of the
4671 epilogue that we've already processed has done. We keep two copies
4672 of the SP equivalence, one for use during the insn we are
4673 processing and one for use in the next insn. The difference is
4674 because one part of a PARALLEL may adjust SP and the other may use
4679 rtx sp_equiv_reg
; /* REG that SP is set from, perhaps SP. */
4680 HOST_WIDE_INT sp_offset
; /* Offset from SP_EQUIV_REG of present SP. */
4681 rtx new_sp_equiv_reg
; /* REG to be used at end of insn. */
4682 HOST_WIDE_INT new_sp_offset
; /* Offset to be used at end of insn. */
4683 rtx equiv_reg_src
; /* If nonzero, the value that SP_EQUIV_REG
4684 should be set to once we no longer need
4686 rtx const_equiv
[FIRST_PSEUDO_REGISTER
]; /* Any known constant equivalences
4690 static void handle_epilogue_set (rtx
, struct epi_info
*);
4691 static void update_epilogue_consts (rtx
, rtx
, void *);
4692 static void emit_equiv_load (struct epi_info
*);
4694 /* Modify INSN, a list of one or more insns that is part of the epilogue, to
4695 no modifications to the stack pointer. Return the new list of insns. */
4698 keep_stack_depressed (rtx insns
)
4701 struct epi_info info
;
4704 /* If the epilogue is just a single instruction, it must be OK as is. */
4705 if (NEXT_INSN (insns
) == NULL_RTX
)
4708 /* Otherwise, start a sequence, initialize the information we have, and
4709 process all the insns we were given. */
4712 info
.sp_equiv_reg
= stack_pointer_rtx
;
4714 info
.equiv_reg_src
= 0;
4716 for (j
= 0; j
< FIRST_PSEUDO_REGISTER
; j
++)
4717 info
.const_equiv
[j
] = 0;
4721 while (insn
!= NULL_RTX
)
4723 next
= NEXT_INSN (insn
);
4732 /* If this insn references the register that SP is equivalent to and
4733 we have a pending load to that register, we must force out the load
4734 first and then indicate we no longer know what SP's equivalent is. */
4735 if (info
.equiv_reg_src
!= 0
4736 && reg_referenced_p (info
.sp_equiv_reg
, PATTERN (insn
)))
4738 emit_equiv_load (&info
);
4739 info
.sp_equiv_reg
= 0;
4742 info
.new_sp_equiv_reg
= info
.sp_equiv_reg
;
4743 info
.new_sp_offset
= info
.sp_offset
;
4745 /* If this is a (RETURN) and the return address is on the stack,
4746 update the address and change to an indirect jump. */
4747 if (GET_CODE (PATTERN (insn
)) == RETURN
4748 || (GET_CODE (PATTERN (insn
)) == PARALLEL
4749 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == RETURN
))
4751 rtx retaddr
= INCOMING_RETURN_ADDR_RTX
;
4753 HOST_WIDE_INT offset
= 0;
4754 rtx jump_insn
, jump_set
;
4756 /* If the return address is in a register, we can emit the insn
4757 unchanged. Otherwise, it must be a MEM and we see what the
4758 base register and offset are. In any case, we have to emit any
4759 pending load to the equivalent reg of SP, if any. */
4760 if (REG_P (retaddr
))
4762 emit_equiv_load (&info
);
4770 gcc_assert (MEM_P (retaddr
));
4772 ret_ptr
= XEXP (retaddr
, 0);
4774 if (REG_P (ret_ptr
))
4776 base
= gen_rtx_REG (Pmode
, REGNO (ret_ptr
));
4781 gcc_assert (GET_CODE (ret_ptr
) == PLUS
4782 && REG_P (XEXP (ret_ptr
, 0))
4783 && GET_CODE (XEXP (ret_ptr
, 1)) == CONST_INT
);
4784 base
= gen_rtx_REG (Pmode
, REGNO (XEXP (ret_ptr
, 0)));
4785 offset
= INTVAL (XEXP (ret_ptr
, 1));
4789 /* If the base of the location containing the return pointer
4790 is SP, we must update it with the replacement address. Otherwise,
4791 just build the necessary MEM. */
4792 retaddr
= plus_constant (base
, offset
);
4793 if (base
== stack_pointer_rtx
)
4794 retaddr
= simplify_replace_rtx (retaddr
, stack_pointer_rtx
,
4795 plus_constant (info
.sp_equiv_reg
,
4798 retaddr
= gen_rtx_MEM (Pmode
, retaddr
);
4799 MEM_NOTRAP_P (retaddr
) = 1;
4801 /* If there is a pending load to the equivalent register for SP
4802 and we reference that register, we must load our address into
4803 a scratch register and then do that load. */
4804 if (info
.equiv_reg_src
4805 && reg_overlap_mentioned_p (info
.equiv_reg_src
, retaddr
))
4810 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
4811 if (HARD_REGNO_MODE_OK (regno
, Pmode
)
4812 && !fixed_regs
[regno
]
4813 && TEST_HARD_REG_BIT (regs_invalidated_by_call
, regno
)
4815 (EXIT_BLOCK_PTR
->il
.rtl
->global_live_at_start
, regno
)
4816 && !refers_to_regno_p (regno
,
4817 regno
+ hard_regno_nregs
[regno
]
4819 info
.equiv_reg_src
, NULL
)
4820 && info
.const_equiv
[regno
] == 0)
4823 gcc_assert (regno
< FIRST_PSEUDO_REGISTER
);
4825 reg
= gen_rtx_REG (Pmode
, regno
);
4826 emit_move_insn (reg
, retaddr
);
4830 emit_equiv_load (&info
);
4831 jump_insn
= emit_jump_insn (gen_indirect_jump (retaddr
));
4833 /* Show the SET in the above insn is a RETURN. */
4834 jump_set
= single_set (jump_insn
);
4835 gcc_assert (jump_set
);
4836 SET_IS_RETURN_P (jump_set
) = 1;
4839 /* If SP is not mentioned in the pattern and its equivalent register, if
4840 any, is not modified, just emit it. Otherwise, if neither is set,
4841 replace the reference to SP and emit the insn. If none of those are
4842 true, handle each SET individually. */
4843 else if (!reg_mentioned_p (stack_pointer_rtx
, PATTERN (insn
))
4844 && (info
.sp_equiv_reg
== stack_pointer_rtx
4845 || !reg_set_p (info
.sp_equiv_reg
, insn
)))
4847 else if (! reg_set_p (stack_pointer_rtx
, insn
)
4848 && (info
.sp_equiv_reg
== stack_pointer_rtx
4849 || !reg_set_p (info
.sp_equiv_reg
, insn
)))
4853 changed
= validate_replace_rtx (stack_pointer_rtx
,
4854 plus_constant (info
.sp_equiv_reg
,
4857 gcc_assert (changed
);
4861 else if (GET_CODE (PATTERN (insn
)) == SET
)
4862 handle_epilogue_set (PATTERN (insn
), &info
);
4863 else if (GET_CODE (PATTERN (insn
)) == PARALLEL
)
4865 for (j
= 0; j
< XVECLEN (PATTERN (insn
), 0); j
++)
4866 if (GET_CODE (XVECEXP (PATTERN (insn
), 0, j
)) == SET
)
4867 handle_epilogue_set (XVECEXP (PATTERN (insn
), 0, j
), &info
);
4872 info
.sp_equiv_reg
= info
.new_sp_equiv_reg
;
4873 info
.sp_offset
= info
.new_sp_offset
;
4875 /* Now update any constants this insn sets. */
4876 note_stores (PATTERN (insn
), update_epilogue_consts
, &info
);
4880 insns
= get_insns ();
4885 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
4886 structure that contains information about what we've seen so far. We
4887 process this SET by either updating that data or by emitting one or
4891 handle_epilogue_set (rtx set
, struct epi_info
*p
)
4893 /* First handle the case where we are setting SP. Record what it is being
4894 set from, which we must be able to determine */
4895 if (reg_set_p (stack_pointer_rtx
, set
))
4897 gcc_assert (SET_DEST (set
) == stack_pointer_rtx
);
4899 if (GET_CODE (SET_SRC (set
)) == PLUS
)
4901 p
->new_sp_equiv_reg
= XEXP (SET_SRC (set
), 0);
4902 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == CONST_INT
)
4903 p
->new_sp_offset
= INTVAL (XEXP (SET_SRC (set
), 1));
4906 gcc_assert (REG_P (XEXP (SET_SRC (set
), 1))
4907 && (REGNO (XEXP (SET_SRC (set
), 1))
4908 < FIRST_PSEUDO_REGISTER
)
4909 && p
->const_equiv
[REGNO (XEXP (SET_SRC (set
), 1))]);
4911 = INTVAL (p
->const_equiv
[REGNO (XEXP (SET_SRC (set
), 1))]);
4915 p
->new_sp_equiv_reg
= SET_SRC (set
), p
->new_sp_offset
= 0;
4917 /* If we are adjusting SP, we adjust from the old data. */
4918 if (p
->new_sp_equiv_reg
== stack_pointer_rtx
)
4920 p
->new_sp_equiv_reg
= p
->sp_equiv_reg
;
4921 p
->new_sp_offset
+= p
->sp_offset
;
4924 gcc_assert (p
->new_sp_equiv_reg
&& REG_P (p
->new_sp_equiv_reg
));
4929 /* Next handle the case where we are setting SP's equivalent
4930 register. We must not already have a value to set it to. We
4931 could update, but there seems little point in handling that case.
4932 Note that we have to allow for the case where we are setting the
4933 register set in the previous part of a PARALLEL inside a single
4934 insn. But use the old offset for any updates within this insn.
4935 We must allow for the case where the register is being set in a
4936 different (usually wider) mode than Pmode). */
4937 else if (p
->new_sp_equiv_reg
!= 0 && reg_set_p (p
->new_sp_equiv_reg
, set
))
4939 gcc_assert (!p
->equiv_reg_src
4940 && REG_P (p
->new_sp_equiv_reg
)
4941 && REG_P (SET_DEST (set
))
4942 && (GET_MODE_BITSIZE (GET_MODE (SET_DEST (set
)))
4944 && REGNO (p
->new_sp_equiv_reg
) == REGNO (SET_DEST (set
)));
4946 = simplify_replace_rtx (SET_SRC (set
), stack_pointer_rtx
,
4947 plus_constant (p
->sp_equiv_reg
,
4951 /* Otherwise, replace any references to SP in the insn to its new value
4952 and emit the insn. */
4955 SET_SRC (set
) = simplify_replace_rtx (SET_SRC (set
), stack_pointer_rtx
,
4956 plus_constant (p
->sp_equiv_reg
,
4958 SET_DEST (set
) = simplify_replace_rtx (SET_DEST (set
), stack_pointer_rtx
,
4959 plus_constant (p
->sp_equiv_reg
,
4965 /* Update the tracking information for registers set to constants. */
4968 update_epilogue_consts (rtx dest
, rtx x
, void *data
)
4970 struct epi_info
*p
= (struct epi_info
*) data
;
4973 if (!REG_P (dest
) || REGNO (dest
) >= FIRST_PSEUDO_REGISTER
)
4976 /* If we are either clobbering a register or doing a partial set,
4977 show we don't know the value. */
4978 else if (GET_CODE (x
) == CLOBBER
|| ! rtx_equal_p (dest
, SET_DEST (x
)))
4979 p
->const_equiv
[REGNO (dest
)] = 0;
4981 /* If we are setting it to a constant, record that constant. */
4982 else if (GET_CODE (SET_SRC (x
)) == CONST_INT
)
4983 p
->const_equiv
[REGNO (dest
)] = SET_SRC (x
);
4985 /* If this is a binary operation between a register we have been tracking
4986 and a constant, see if we can compute a new constant value. */
4987 else if (ARITHMETIC_P (SET_SRC (x
))
4988 && REG_P (XEXP (SET_SRC (x
), 0))
4989 && REGNO (XEXP (SET_SRC (x
), 0)) < FIRST_PSEUDO_REGISTER
4990 && p
->const_equiv
[REGNO (XEXP (SET_SRC (x
), 0))] != 0
4991 && GET_CODE (XEXP (SET_SRC (x
), 1)) == CONST_INT
4992 && 0 != (new = simplify_binary_operation
4993 (GET_CODE (SET_SRC (x
)), GET_MODE (dest
),
4994 p
->const_equiv
[REGNO (XEXP (SET_SRC (x
), 0))],
4995 XEXP (SET_SRC (x
), 1)))
4996 && GET_CODE (new) == CONST_INT
)
4997 p
->const_equiv
[REGNO (dest
)] = new;
4999 /* Otherwise, we can't do anything with this value. */
5001 p
->const_equiv
[REGNO (dest
)] = 0;
5004 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
5007 emit_equiv_load (struct epi_info
*p
)
5009 if (p
->equiv_reg_src
!= 0)
5011 rtx dest
= p
->sp_equiv_reg
;
5013 if (GET_MODE (p
->equiv_reg_src
) != GET_MODE (dest
))
5014 dest
= gen_rtx_REG (GET_MODE (p
->equiv_reg_src
),
5015 REGNO (p
->sp_equiv_reg
));
5017 emit_move_insn (dest
, p
->equiv_reg_src
);
5018 p
->equiv_reg_src
= 0;
5023 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
5024 this into place with notes indicating where the prologue ends and where
5025 the epilogue begins. Update the basic block information when possible. */
5028 thread_prologue_and_epilogue_insns (rtx f ATTRIBUTE_UNUSED
)
5032 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
5035 #ifdef HAVE_prologue
5036 rtx prologue_end
= NULL_RTX
;
5038 #if defined (HAVE_epilogue) || defined(HAVE_return)
5039 rtx epilogue_end
= NULL_RTX
;
5043 #ifdef HAVE_prologue
5047 seq
= gen_prologue ();
5050 /* Retain a map of the prologue insns. */
5051 record_insns (seq
, &prologue
);
5052 prologue_end
= emit_note (NOTE_INSN_PROLOGUE_END
);
5056 set_insn_locators (seq
, prologue_locator
);
5058 /* Can't deal with multiple successors of the entry block
5059 at the moment. Function should always have at least one
5061 gcc_assert (single_succ_p (ENTRY_BLOCK_PTR
));
5063 insert_insn_on_edge (seq
, single_succ_edge (ENTRY_BLOCK_PTR
));
5068 /* If the exit block has no non-fake predecessors, we don't need
5070 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
5071 if ((e
->flags
& EDGE_FAKE
) == 0)
5077 if (optimize
&& HAVE_return
)
5079 /* If we're allowed to generate a simple return instruction,
5080 then by definition we don't need a full epilogue. Examine
5081 the block that falls through to EXIT. If it does not
5082 contain any code, examine its predecessors and try to
5083 emit (conditional) return instructions. */
5088 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
5089 if (e
->flags
& EDGE_FALLTHRU
)
5095 /* Verify that there are no active instructions in the last block. */
5096 label
= BB_END (last
);
5097 while (label
&& !LABEL_P (label
))
5099 if (active_insn_p (label
))
5101 label
= PREV_INSN (label
);
5104 if (BB_HEAD (last
) == label
&& LABEL_P (label
))
5107 rtx epilogue_line_note
= NULL_RTX
;
5109 /* Locate the line number associated with the closing brace,
5110 if we can find one. */
5111 for (seq
= get_last_insn ();
5112 seq
&& ! active_insn_p (seq
);
5113 seq
= PREV_INSN (seq
))
5114 if (NOTE_P (seq
) && NOTE_LINE_NUMBER (seq
) > 0)
5116 epilogue_line_note
= seq
;
5120 for (ei2
= ei_start (last
->preds
); (e
= ei_safe_edge (ei2
)); )
5122 basic_block bb
= e
->src
;
5125 if (bb
== ENTRY_BLOCK_PTR
)
5132 if (!JUMP_P (jump
) || JUMP_LABEL (jump
) != label
)
5138 /* If we have an unconditional jump, we can replace that
5139 with a simple return instruction. */
5140 if (simplejump_p (jump
))
5142 emit_return_into_block (bb
, epilogue_line_note
);
5146 /* If we have a conditional jump, we can try to replace
5147 that with a conditional return instruction. */
5148 else if (condjump_p (jump
))
5150 if (! redirect_jump (jump
, 0, 0))
5156 /* If this block has only one successor, it both jumps
5157 and falls through to the fallthru block, so we can't
5159 if (single_succ_p (bb
))
5171 /* Fix up the CFG for the successful change we just made. */
5172 redirect_edge_succ (e
, EXIT_BLOCK_PTR
);
5175 /* Emit a return insn for the exit fallthru block. Whether
5176 this is still reachable will be determined later. */
5178 emit_barrier_after (BB_END (last
));
5179 emit_return_into_block (last
, epilogue_line_note
);
5180 epilogue_end
= BB_END (last
);
5181 single_succ_edge (last
)->flags
&= ~EDGE_FALLTHRU
;
5186 /* Find the edge that falls through to EXIT. Other edges may exist
5187 due to RETURN instructions, but those don't need epilogues.
5188 There really shouldn't be a mixture -- either all should have
5189 been converted or none, however... */
5191 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
5192 if (e
->flags
& EDGE_FALLTHRU
)
5197 #ifdef HAVE_epilogue
5201 epilogue_end
= emit_note (NOTE_INSN_EPILOGUE_BEG
);
5203 seq
= gen_epilogue ();
5205 #ifdef INCOMING_RETURN_ADDR_RTX
5206 /* If this function returns with the stack depressed and we can support
5207 it, massage the epilogue to actually do that. */
5208 if (TREE_CODE (TREE_TYPE (current_function_decl
)) == FUNCTION_TYPE
5209 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl
)))
5210 seq
= keep_stack_depressed (seq
);
5213 emit_jump_insn (seq
);
5215 /* Retain a map of the epilogue insns. */
5216 record_insns (seq
, &epilogue
);
5217 set_insn_locators (seq
, epilogue_locator
);
5222 insert_insn_on_edge (seq
, e
);
5230 if (! next_active_insn (BB_END (e
->src
)))
5232 /* We have a fall-through edge to the exit block, the source is not
5233 at the end of the function, and there will be an assembler epilogue
5234 at the end of the function.
5235 We can't use force_nonfallthru here, because that would try to
5236 use return. Inserting a jump 'by hand' is extremely messy, so
5237 we take advantage of cfg_layout_finalize using
5238 fixup_fallthru_exit_predecessor. */
5239 cfg_layout_initialize (0);
5240 FOR_EACH_BB (cur_bb
)
5241 if (cur_bb
->index
>= 0 && cur_bb
->next_bb
->index
>= 0)
5242 cur_bb
->aux
= cur_bb
->next_bb
;
5243 cfg_layout_finalize ();
5248 commit_edge_insertions ();
5250 #ifdef HAVE_sibcall_epilogue
5251 /* Emit sibling epilogues before any sibling call sites. */
5252 for (ei
= ei_start (EXIT_BLOCK_PTR
->preds
); (e
= ei_safe_edge (ei
)); )
5254 basic_block bb
= e
->src
;
5255 rtx insn
= BB_END (bb
);
5258 || ! SIBLING_CALL_P (insn
))
5265 emit_insn (gen_sibcall_epilogue ());
5269 /* Retain a map of the epilogue insns. Used in life analysis to
5270 avoid getting rid of sibcall epilogue insns. Do this before we
5271 actually emit the sequence. */
5272 record_insns (seq
, &sibcall_epilogue
);
5273 set_insn_locators (seq
, epilogue_locator
);
5275 emit_insn_before (seq
, insn
);
5280 #ifdef HAVE_prologue
5281 /* This is probably all useless now that we use locators. */
5286 /* GDB handles `break f' by setting a breakpoint on the first
5287 line note after the prologue. Which means (1) that if
5288 there are line number notes before where we inserted the
5289 prologue we should move them, and (2) we should generate a
5290 note before the end of the first basic block, if there isn't
5293 ??? This behavior is completely broken when dealing with
5294 multiple entry functions. We simply place the note always
5295 into first basic block and let alternate entry points
5299 for (insn
= prologue_end
; insn
; insn
= prev
)
5301 prev
= PREV_INSN (insn
);
5302 if (NOTE_P (insn
) && NOTE_LINE_NUMBER (insn
) > 0)
5304 /* Note that we cannot reorder the first insn in the
5305 chain, since rest_of_compilation relies on that
5306 remaining constant. */
5309 reorder_insns (insn
, insn
, prologue_end
);
5313 /* Find the last line number note in the first block. */
5314 for (insn
= BB_END (ENTRY_BLOCK_PTR
->next_bb
);
5315 insn
!= prologue_end
&& insn
;
5316 insn
= PREV_INSN (insn
))
5317 if (NOTE_P (insn
) && NOTE_LINE_NUMBER (insn
) > 0)
5320 /* If we didn't find one, make a copy of the first line number
5324 for (insn
= next_active_insn (prologue_end
);
5326 insn
= PREV_INSN (insn
))
5327 if (NOTE_P (insn
) && NOTE_LINE_NUMBER (insn
) > 0)
5329 emit_note_copy_after (insn
, prologue_end
);
5335 #ifdef HAVE_epilogue
5340 /* Similarly, move any line notes that appear after the epilogue.
5341 There is no need, however, to be quite so anal about the existence
5342 of such a note. Also move the NOTE_INSN_FUNCTION_END and (possibly)
5343 NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
5345 for (insn
= epilogue_end
; insn
; insn
= next
)
5347 next
= NEXT_INSN (insn
);
5349 && (NOTE_LINE_NUMBER (insn
) > 0
5350 || NOTE_LINE_NUMBER (insn
) == NOTE_INSN_FUNCTION_BEG
5351 || NOTE_LINE_NUMBER (insn
) == NOTE_INSN_FUNCTION_END
))
5352 reorder_insns (insn
, insn
, PREV_INSN (epilogue_end
));
5358 /* Reposition the prologue-end and epilogue-begin notes after instruction
5359 scheduling and delayed branch scheduling. */
5362 reposition_prologue_and_epilogue_notes (rtx f ATTRIBUTE_UNUSED
)
5364 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
5365 rtx insn
, last
, note
;
5368 if ((len
= VEC_length (int, prologue
)) > 0)
5372 /* Scan from the beginning until we reach the last prologue insn.
5373 We apparently can't depend on basic_block_{head,end} after
5375 for (insn
= f
; insn
; insn
= NEXT_INSN (insn
))
5379 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
5382 else if (contains (insn
, &prologue
))
5392 /* Find the prologue-end note if we haven't already, and
5393 move it to just after the last prologue insn. */
5396 for (note
= last
; (note
= NEXT_INSN (note
));)
5398 && NOTE_LINE_NUMBER (note
) == NOTE_INSN_PROLOGUE_END
)
5402 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
5404 last
= NEXT_INSN (last
);
5405 reorder_insns (note
, note
, last
);
5409 if ((len
= VEC_length (int, epilogue
)) > 0)
5413 /* Scan from the end until we reach the first epilogue insn.
5414 We apparently can't depend on basic_block_{head,end} after
5416 for (insn
= get_last_insn (); insn
; insn
= PREV_INSN (insn
))
5420 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EPILOGUE_BEG
)
5423 else if (contains (insn
, &epilogue
))
5433 /* Find the epilogue-begin note if we haven't already, and
5434 move it to just before the first epilogue insn. */
5437 for (note
= insn
; (note
= PREV_INSN (note
));)
5439 && NOTE_LINE_NUMBER (note
) == NOTE_INSN_EPILOGUE_BEG
)
5443 if (PREV_INSN (last
) != note
)
5444 reorder_insns (note
, note
, PREV_INSN (last
));
5447 #endif /* HAVE_prologue or HAVE_epilogue */
5450 /* Resets insn_block_boundaries array. */
5453 reset_block_changes (void)
5455 VARRAY_TREE_INIT (cfun
->ib_boundaries_block
, 100, "ib_boundaries_block");
5456 VARRAY_PUSH_TREE (cfun
->ib_boundaries_block
, NULL_TREE
);
5459 /* Record the boundary for BLOCK. */
5461 record_block_change (tree block
)
5469 if(!cfun
->ib_boundaries_block
)
5472 last_block
= VARRAY_TOP_TREE (cfun
->ib_boundaries_block
);
5473 VARRAY_POP (cfun
->ib_boundaries_block
);
5475 for (i
= VARRAY_ACTIVE_SIZE (cfun
->ib_boundaries_block
); i
< n
; i
++)
5476 VARRAY_PUSH_TREE (cfun
->ib_boundaries_block
, last_block
);
5478 VARRAY_PUSH_TREE (cfun
->ib_boundaries_block
, block
);
5481 /* Finishes record of boundaries. */
5482 void finalize_block_changes (void)
5484 record_block_change (DECL_INITIAL (current_function_decl
));
5487 /* For INSN return the BLOCK it belongs to. */
5489 check_block_change (rtx insn
, tree
*block
)
5491 unsigned uid
= INSN_UID (insn
);
5493 if (uid
>= VARRAY_ACTIVE_SIZE (cfun
->ib_boundaries_block
))
5496 *block
= VARRAY_TREE (cfun
->ib_boundaries_block
, uid
);
5499 /* Releases the ib_boundaries_block records. */
5501 free_block_changes (void)
5503 cfun
->ib_boundaries_block
= NULL
;
5506 /* Returns the name of the current function. */
5508 current_function_name (void)
5510 return lang_hooks
.decl_printable_name (cfun
->decl
, 2);
5515 rest_of_handle_check_leaf_regs (void)
5517 #ifdef LEAF_REGISTERS
5518 current_function_uses_only_leaf_regs
5519 = optimize
> 0 && only_leaf_regs_used () && leaf_function_p ();
5523 struct tree_opt_pass pass_leaf_regs
=
5527 rest_of_handle_check_leaf_regs
, /* execute */
5530 0, /* static_pass_number */
5532 0, /* properties_required */
5533 0, /* properties_provided */
5534 0, /* properties_destroyed */
5535 0, /* todo_flags_start */
5536 0, /* todo_flags_finish */
5541 #include "gt-function.h"