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, 2006, 2007, 2008, 2009
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 3, 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 COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file handles the generation of rtl code from tree structure
23 at the level of the function as a whole.
24 It creates the rtl expressions for parameters and auto variables
25 and has full responsibility for allocating stack slots.
27 `expand_function_start' is called at the beginning of a function,
28 before the function body is parsed, and `expand_function_end' is
29 called after parsing the body.
31 Call `assign_stack_local' to allocate a stack slot for a local variable.
32 This is usually done during the RTL generation for the function body,
33 but it can also be done in the reload pass when a pseudo-register does
34 not get a hard register. */
38 #include "coretypes.h"
49 #include "hard-reg-set.h"
50 #include "insn-config.h"
53 #include "basic-block.h"
58 #include "integrate.h"
59 #include "langhooks.h"
61 #include "cfglayout.h"
63 #include "tree-pass.h"
69 /* So we can assign to cfun in this file. */
72 #ifndef STACK_ALIGNMENT_NEEDED
73 #define STACK_ALIGNMENT_NEEDED 1
76 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
78 /* Some systems use __main in a way incompatible with its use in gcc, in these
79 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
80 give the same symbol without quotes for an alternative entry point. You
81 must define both, or neither. */
83 #define NAME__MAIN "__main"
86 /* Round a value to the lowest integer less than it that is a multiple of
87 the required alignment. Avoid using division in case the value is
88 negative. Assume the alignment is a power of two. */
89 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
91 /* Similar, but round to the next highest integer that meets the
93 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
95 /* Nonzero if function being compiled doesn't contain any calls
96 (ignoring the prologue and epilogue). This is set prior to
97 local register allocation and is valid for the remaining
99 int current_function_is_leaf
;
101 /* Nonzero if function being compiled doesn't modify the stack pointer
102 (ignoring the prologue and epilogue). This is only valid after
103 pass_stack_ptr_mod has run. */
104 int current_function_sp_is_unchanging
;
106 /* Nonzero if the function being compiled is a leaf function which only
107 uses leaf registers. This is valid after reload (specifically after
108 sched2) and is useful only if the port defines LEAF_REGISTERS. */
109 int current_function_uses_only_leaf_regs
;
111 /* Nonzero once virtual register instantiation has been done.
112 assign_stack_local uses frame_pointer_rtx when this is nonzero.
113 calls.c:emit_library_call_value_1 uses it to set up
114 post-instantiation libcalls. */
115 int virtuals_instantiated
;
117 /* Assign unique numbers to labels generated for profiling, debugging, etc. */
118 static GTY(()) int funcdef_no
;
120 /* These variables hold pointers to functions to create and destroy
121 target specific, per-function data structures. */
122 struct machine_function
* (*init_machine_status
) (void);
124 /* The currently compiled function. */
125 struct function
*cfun
= 0;
127 /* These hashes record the prologue and epilogue insns. */
128 static GTY((if_marked ("ggc_marked_p"), param_is (struct rtx_def
)))
129 htab_t prologue_insn_hash
;
130 static GTY((if_marked ("ggc_marked_p"), param_is (struct rtx_def
)))
131 htab_t epilogue_insn_hash
;
133 /* Forward declarations. */
135 static struct temp_slot
*find_temp_slot_from_address (rtx
);
136 static void pad_to_arg_alignment (struct args_size
*, int, struct args_size
*);
137 static void pad_below (struct args_size
*, enum machine_mode
, tree
);
138 static void reorder_blocks_1 (rtx
, tree
, VEC(tree
,heap
) **);
139 static int all_blocks (tree
, tree
*);
140 static tree
*get_block_vector (tree
, int *);
141 extern tree
debug_find_var_in_block_tree (tree
, tree
);
142 /* We always define `record_insns' even if it's not used so that we
143 can always export `prologue_epilogue_contains'. */
144 static void record_insns (rtx
, rtx
, htab_t
*) ATTRIBUTE_UNUSED
;
145 static bool contains (const_rtx
, htab_t
);
147 static void emit_return_into_block (basic_block
);
149 static void prepare_function_start (void);
150 static void do_clobber_return_reg (rtx
, void *);
151 static void do_use_return_reg (rtx
, void *);
152 static void set_insn_locators (rtx
, int) ATTRIBUTE_UNUSED
;
154 /* Stack of nested functions. */
155 /* Keep track of the cfun stack. */
157 typedef struct function
*function_p
;
159 DEF_VEC_P(function_p
);
160 DEF_VEC_ALLOC_P(function_p
,heap
);
161 static VEC(function_p
,heap
) *function_context_stack
;
163 /* Save the current context for compilation of a nested function.
164 This is called from language-specific code. */
167 push_function_context (void)
170 allocate_struct_function (NULL
, false);
172 VEC_safe_push (function_p
, heap
, function_context_stack
, cfun
);
176 /* Restore the last saved context, at the end of a nested function.
177 This function is called from language-specific code. */
180 pop_function_context (void)
182 struct function
*p
= VEC_pop (function_p
, function_context_stack
);
184 current_function_decl
= p
->decl
;
186 /* Reset variables that have known state during rtx generation. */
187 virtuals_instantiated
= 0;
188 generating_concat_p
= 1;
191 /* Clear out all parts of the state in F that can safely be discarded
192 after the function has been parsed, but not compiled, to let
193 garbage collection reclaim the memory. */
196 free_after_parsing (struct function
*f
)
201 /* Clear out all parts of the state in F that can safely be discarded
202 after the function has been compiled, to let garbage collection
203 reclaim the memory. */
206 free_after_compilation (struct function
*f
)
208 prologue_insn_hash
= NULL
;
209 epilogue_insn_hash
= NULL
;
211 if (crtl
->emit
.regno_pointer_align
)
212 free (crtl
->emit
.regno_pointer_align
);
214 memset (crtl
, 0, sizeof (struct rtl_data
));
219 regno_reg_rtx
= NULL
;
220 insn_locators_free ();
223 /* Return size needed for stack frame based on slots so far allocated.
224 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
225 the caller may have to do that. */
228 get_frame_size (void)
230 if (FRAME_GROWS_DOWNWARD
)
231 return -frame_offset
;
236 /* Issue an error message and return TRUE if frame OFFSET overflows in
237 the signed target pointer arithmetics for function FUNC. Otherwise
241 frame_offset_overflow (HOST_WIDE_INT offset
, tree func
)
243 unsigned HOST_WIDE_INT size
= FRAME_GROWS_DOWNWARD
? -offset
: offset
;
245 if (size
> ((unsigned HOST_WIDE_INT
) 1 << (GET_MODE_BITSIZE (Pmode
) - 1))
246 /* Leave room for the fixed part of the frame. */
247 - 64 * UNITS_PER_WORD
)
249 error_at (DECL_SOURCE_LOCATION (func
),
250 "total size of local objects too large");
257 /* Return stack slot alignment in bits for TYPE and MODE. */
260 get_stack_local_alignment (tree type
, enum machine_mode mode
)
262 unsigned int alignment
;
265 alignment
= BIGGEST_ALIGNMENT
;
267 alignment
= GET_MODE_ALIGNMENT (mode
);
269 /* Allow the frond-end to (possibly) increase the alignment of this
272 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
274 return STACK_SLOT_ALIGNMENT (type
, mode
, alignment
);
277 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
278 with machine mode MODE.
280 ALIGN controls the amount of alignment for the address of the slot:
281 0 means according to MODE,
282 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
283 -2 means use BITS_PER_UNIT,
284 positive specifies alignment boundary in bits.
286 If REDUCE_ALIGNMENT_OK is true, it is OK to reduce alignment.
288 We do not round to stack_boundary here. */
291 assign_stack_local_1 (enum machine_mode mode
, HOST_WIDE_INT size
,
293 bool reduce_alignment_ok ATTRIBUTE_UNUSED
)
296 int bigend_correction
= 0;
297 unsigned int alignment
, alignment_in_bits
;
298 int frame_off
, frame_alignment
, frame_phase
;
302 alignment
= get_stack_local_alignment (NULL
, mode
);
303 alignment
/= BITS_PER_UNIT
;
305 else if (align
== -1)
307 alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
308 size
= CEIL_ROUND (size
, alignment
);
310 else if (align
== -2)
311 alignment
= 1; /* BITS_PER_UNIT / BITS_PER_UNIT */
313 alignment
= align
/ BITS_PER_UNIT
;
315 alignment_in_bits
= alignment
* BITS_PER_UNIT
;
317 if (FRAME_GROWS_DOWNWARD
)
318 frame_offset
-= size
;
320 /* Ignore alignment if it exceeds MAX_SUPPORTED_STACK_ALIGNMENT. */
321 if (alignment_in_bits
> MAX_SUPPORTED_STACK_ALIGNMENT
)
323 alignment_in_bits
= MAX_SUPPORTED_STACK_ALIGNMENT
;
324 alignment
= alignment_in_bits
/ BITS_PER_UNIT
;
327 if (SUPPORTS_STACK_ALIGNMENT
)
329 if (crtl
->stack_alignment_estimated
< alignment_in_bits
)
331 if (!crtl
->stack_realign_processed
)
332 crtl
->stack_alignment_estimated
= alignment_in_bits
;
335 /* If stack is realigned and stack alignment value
336 hasn't been finalized, it is OK not to increase
337 stack_alignment_estimated. The bigger alignment
338 requirement is recorded in stack_alignment_needed
340 gcc_assert (!crtl
->stack_realign_finalized
);
341 if (!crtl
->stack_realign_needed
)
343 /* It is OK to reduce the alignment as long as the
344 requested size is 0 or the estimated stack
345 alignment >= mode alignment. */
346 gcc_assert (reduce_alignment_ok
348 || (crtl
->stack_alignment_estimated
349 >= GET_MODE_ALIGNMENT (mode
)));
350 alignment_in_bits
= crtl
->stack_alignment_estimated
;
351 alignment
= alignment_in_bits
/ BITS_PER_UNIT
;
357 if (crtl
->stack_alignment_needed
< alignment_in_bits
)
358 crtl
->stack_alignment_needed
= alignment_in_bits
;
359 if (crtl
->max_used_stack_slot_alignment
< alignment_in_bits
)
360 crtl
->max_used_stack_slot_alignment
= alignment_in_bits
;
362 /* Calculate how many bytes the start of local variables is off from
364 frame_alignment
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
365 frame_off
= STARTING_FRAME_OFFSET
% frame_alignment
;
366 frame_phase
= frame_off
? frame_alignment
- frame_off
: 0;
368 /* Round the frame offset to the specified alignment. The default is
369 to always honor requests to align the stack but a port may choose to
370 do its own stack alignment by defining STACK_ALIGNMENT_NEEDED. */
371 if (STACK_ALIGNMENT_NEEDED
375 /* We must be careful here, since FRAME_OFFSET might be negative and
376 division with a negative dividend isn't as well defined as we might
377 like. So we instead assume that ALIGNMENT is a power of two and
378 use logical operations which are unambiguous. */
379 if (FRAME_GROWS_DOWNWARD
)
381 = (FLOOR_ROUND (frame_offset
- frame_phase
,
382 (unsigned HOST_WIDE_INT
) alignment
)
386 = (CEIL_ROUND (frame_offset
- frame_phase
,
387 (unsigned HOST_WIDE_INT
) alignment
)
391 /* On a big-endian machine, if we are allocating more space than we will use,
392 use the least significant bytes of those that are allocated. */
393 if (BYTES_BIG_ENDIAN
&& mode
!= BLKmode
&& GET_MODE_SIZE (mode
) < size
)
394 bigend_correction
= size
- GET_MODE_SIZE (mode
);
396 /* If we have already instantiated virtual registers, return the actual
397 address relative to the frame pointer. */
398 if (virtuals_instantiated
)
399 addr
= plus_constant (frame_pointer_rtx
,
401 (frame_offset
+ bigend_correction
402 + STARTING_FRAME_OFFSET
, Pmode
));
404 addr
= plus_constant (virtual_stack_vars_rtx
,
406 (frame_offset
+ bigend_correction
,
409 if (!FRAME_GROWS_DOWNWARD
)
410 frame_offset
+= size
;
412 x
= gen_rtx_MEM (mode
, addr
);
413 set_mem_align (x
, alignment_in_bits
);
414 MEM_NOTRAP_P (x
) = 1;
417 = gen_rtx_EXPR_LIST (VOIDmode
, x
, stack_slot_list
);
419 if (frame_offset_overflow (frame_offset
, current_function_decl
))
425 /* Wrap up assign_stack_local_1 with last parameter as false. */
428 assign_stack_local (enum machine_mode mode
, HOST_WIDE_INT size
, int align
)
430 return assign_stack_local_1 (mode
, size
, align
, false);
434 /* In order to evaluate some expressions, such as function calls returning
435 structures in memory, we need to temporarily allocate stack locations.
436 We record each allocated temporary in the following structure.
438 Associated with each temporary slot is a nesting level. When we pop up
439 one level, all temporaries associated with the previous level are freed.
440 Normally, all temporaries are freed after the execution of the statement
441 in which they were created. However, if we are inside a ({...}) grouping,
442 the result may be in a temporary and hence must be preserved. If the
443 result could be in a temporary, we preserve it if we can determine which
444 one it is in. If we cannot determine which temporary may contain the
445 result, all temporaries are preserved. A temporary is preserved by
446 pretending it was allocated at the previous nesting level.
448 Automatic variables are also assigned temporary slots, at the nesting
449 level where they are defined. They are marked a "kept" so that
450 free_temp_slots will not free them. */
452 struct GTY(()) temp_slot
{
453 /* Points to next temporary slot. */
454 struct temp_slot
*next
;
455 /* Points to previous temporary slot. */
456 struct temp_slot
*prev
;
457 /* The rtx to used to reference the slot. */
459 /* The size, in units, of the slot. */
461 /* The type of the object in the slot, or zero if it doesn't correspond
462 to a type. We use this to determine whether a slot can be reused.
463 It can be reused if objects of the type of the new slot will always
464 conflict with objects of the type of the old slot. */
466 /* The alignment (in bits) of the slot. */
468 /* Nonzero if this temporary is currently in use. */
470 /* Nonzero if this temporary has its address taken. */
472 /* Nesting level at which this slot is being used. */
474 /* Nonzero if this should survive a call to free_temp_slots. */
476 /* The offset of the slot from the frame_pointer, including extra space
477 for alignment. This info is for combine_temp_slots. */
478 HOST_WIDE_INT base_offset
;
479 /* The size of the slot, including extra space for alignment. This
480 info is for combine_temp_slots. */
481 HOST_WIDE_INT full_size
;
484 /* A table of addresses that represent a stack slot. The table is a mapping
485 from address RTXen to a temp slot. */
486 static GTY((param_is(struct temp_slot_address_entry
))) htab_t temp_slot_address_table
;
488 /* Entry for the above hash table. */
489 struct GTY(()) temp_slot_address_entry
{
492 struct temp_slot
*temp_slot
;
495 /* Removes temporary slot TEMP from LIST. */
498 cut_slot_from_list (struct temp_slot
*temp
, struct temp_slot
**list
)
501 temp
->next
->prev
= temp
->prev
;
503 temp
->prev
->next
= temp
->next
;
507 temp
->prev
= temp
->next
= NULL
;
510 /* Inserts temporary slot TEMP to LIST. */
513 insert_slot_to_list (struct temp_slot
*temp
, struct temp_slot
**list
)
517 (*list
)->prev
= temp
;
522 /* Returns the list of used temp slots at LEVEL. */
524 static struct temp_slot
**
525 temp_slots_at_level (int level
)
527 if (level
>= (int) VEC_length (temp_slot_p
, used_temp_slots
))
528 VEC_safe_grow_cleared (temp_slot_p
, gc
, used_temp_slots
, level
+ 1);
530 return &(VEC_address (temp_slot_p
, used_temp_slots
)[level
]);
533 /* Returns the maximal temporary slot level. */
536 max_slot_level (void)
538 if (!used_temp_slots
)
541 return VEC_length (temp_slot_p
, used_temp_slots
) - 1;
544 /* Moves temporary slot TEMP to LEVEL. */
547 move_slot_to_level (struct temp_slot
*temp
, int level
)
549 cut_slot_from_list (temp
, temp_slots_at_level (temp
->level
));
550 insert_slot_to_list (temp
, temp_slots_at_level (level
));
554 /* Make temporary slot TEMP available. */
557 make_slot_available (struct temp_slot
*temp
)
559 cut_slot_from_list (temp
, temp_slots_at_level (temp
->level
));
560 insert_slot_to_list (temp
, &avail_temp_slots
);
565 /* Compute the hash value for an address -> temp slot mapping.
566 The value is cached on the mapping entry. */
568 temp_slot_address_compute_hash (struct temp_slot_address_entry
*t
)
570 int do_not_record
= 0;
571 return hash_rtx (t
->address
, GET_MODE (t
->address
),
572 &do_not_record
, NULL
, false);
575 /* Return the hash value for an address -> temp slot mapping. */
577 temp_slot_address_hash (const void *p
)
579 const struct temp_slot_address_entry
*t
;
580 t
= (const struct temp_slot_address_entry
*) p
;
584 /* Compare two address -> temp slot mapping entries. */
586 temp_slot_address_eq (const void *p1
, const void *p2
)
588 const struct temp_slot_address_entry
*t1
, *t2
;
589 t1
= (const struct temp_slot_address_entry
*) p1
;
590 t2
= (const struct temp_slot_address_entry
*) p2
;
591 return exp_equiv_p (t1
->address
, t2
->address
, 0, true);
594 /* Add ADDRESS as an alias of TEMP_SLOT to the addess -> temp slot mapping. */
596 insert_temp_slot_address (rtx address
, struct temp_slot
*temp_slot
)
599 struct temp_slot_address_entry
*t
= GGC_NEW (struct temp_slot_address_entry
);
600 t
->address
= address
;
601 t
->temp_slot
= temp_slot
;
602 t
->hash
= temp_slot_address_compute_hash (t
);
603 slot
= htab_find_slot_with_hash (temp_slot_address_table
, t
, t
->hash
, INSERT
);
607 /* Remove an address -> temp slot mapping entry if the temp slot is
608 not in use anymore. Callback for remove_unused_temp_slot_addresses. */
610 remove_unused_temp_slot_addresses_1 (void **slot
, void *data ATTRIBUTE_UNUSED
)
612 const struct temp_slot_address_entry
*t
;
613 t
= (const struct temp_slot_address_entry
*) *slot
;
614 if (! t
->temp_slot
->in_use
)
619 /* Remove all mappings of addresses to unused temp slots. */
621 remove_unused_temp_slot_addresses (void)
623 htab_traverse (temp_slot_address_table
,
624 remove_unused_temp_slot_addresses_1
,
628 /* Find the temp slot corresponding to the object at address X. */
630 static struct temp_slot
*
631 find_temp_slot_from_address (rtx x
)
634 struct temp_slot_address_entry tmp
, *t
;
636 /* First try the easy way:
637 See if X exists in the address -> temp slot mapping. */
639 tmp
.temp_slot
= NULL
;
640 tmp
.hash
= temp_slot_address_compute_hash (&tmp
);
641 t
= (struct temp_slot_address_entry
*)
642 htab_find_with_hash (temp_slot_address_table
, &tmp
, tmp
.hash
);
646 /* If we have a sum involving a register, see if it points to a temp
648 if (GET_CODE (x
) == PLUS
&& REG_P (XEXP (x
, 0))
649 && (p
= find_temp_slot_from_address (XEXP (x
, 0))) != 0)
651 else if (GET_CODE (x
) == PLUS
&& REG_P (XEXP (x
, 1))
652 && (p
= find_temp_slot_from_address (XEXP (x
, 1))) != 0)
655 /* Last resort: Address is a virtual stack var address. */
656 if (GET_CODE (x
) == PLUS
657 && XEXP (x
, 0) == virtual_stack_vars_rtx
658 && CONST_INT_P (XEXP (x
, 1)))
661 for (i
= max_slot_level (); i
>= 0; i
--)
662 for (p
= *temp_slots_at_level (i
); p
; p
= p
->next
)
664 if (INTVAL (XEXP (x
, 1)) >= p
->base_offset
665 && INTVAL (XEXP (x
, 1)) < p
->base_offset
+ p
->full_size
)
673 /* Allocate a temporary stack slot and record it for possible later
676 MODE is the machine mode to be given to the returned rtx.
678 SIZE is the size in units of the space required. We do no rounding here
679 since assign_stack_local will do any required rounding.
681 KEEP is 1 if this slot is to be retained after a call to
682 free_temp_slots. Automatic variables for a block are allocated
683 with this flag. KEEP values of 2 or 3 were needed respectively
684 for variables whose lifetime is controlled by CLEANUP_POINT_EXPRs
685 or for SAVE_EXPRs, but they are now unused.
687 TYPE is the type that will be used for the stack slot. */
690 assign_stack_temp_for_type (enum machine_mode mode
, HOST_WIDE_INT size
,
694 struct temp_slot
*p
, *best_p
= 0, *selected
= NULL
, **pp
;
697 /* If SIZE is -1 it means that somebody tried to allocate a temporary
698 of a variable size. */
699 gcc_assert (size
!= -1);
701 /* These are now unused. */
702 gcc_assert (keep
<= 1);
704 align
= get_stack_local_alignment (type
, mode
);
706 /* Try to find an available, already-allocated temporary of the proper
707 mode which meets the size and alignment requirements. Choose the
708 smallest one with the closest alignment.
710 If assign_stack_temp is called outside of the tree->rtl expansion,
711 we cannot reuse the stack slots (that may still refer to
712 VIRTUAL_STACK_VARS_REGNUM). */
713 if (!virtuals_instantiated
)
715 for (p
= avail_temp_slots
; p
; p
= p
->next
)
717 if (p
->align
>= align
&& p
->size
>= size
718 && GET_MODE (p
->slot
) == mode
719 && objects_must_conflict_p (p
->type
, type
)
720 && (best_p
== 0 || best_p
->size
> p
->size
721 || (best_p
->size
== p
->size
&& best_p
->align
> p
->align
)))
723 if (p
->align
== align
&& p
->size
== size
)
726 cut_slot_from_list (selected
, &avail_temp_slots
);
735 /* Make our best, if any, the one to use. */
739 cut_slot_from_list (selected
, &avail_temp_slots
);
741 /* If there are enough aligned bytes left over, make them into a new
742 temp_slot so that the extra bytes don't get wasted. Do this only
743 for BLKmode slots, so that we can be sure of the alignment. */
744 if (GET_MODE (best_p
->slot
) == BLKmode
)
746 int alignment
= best_p
->align
/ BITS_PER_UNIT
;
747 HOST_WIDE_INT rounded_size
= CEIL_ROUND (size
, alignment
);
749 if (best_p
->size
- rounded_size
>= alignment
)
751 p
= GGC_NEW (struct temp_slot
);
752 p
->in_use
= p
->addr_taken
= 0;
753 p
->size
= best_p
->size
- rounded_size
;
754 p
->base_offset
= best_p
->base_offset
+ rounded_size
;
755 p
->full_size
= best_p
->full_size
- rounded_size
;
756 p
->slot
= adjust_address_nv (best_p
->slot
, BLKmode
, rounded_size
);
757 p
->align
= best_p
->align
;
758 p
->type
= best_p
->type
;
759 insert_slot_to_list (p
, &avail_temp_slots
);
761 stack_slot_list
= gen_rtx_EXPR_LIST (VOIDmode
, p
->slot
,
764 best_p
->size
= rounded_size
;
765 best_p
->full_size
= rounded_size
;
770 /* If we still didn't find one, make a new temporary. */
773 HOST_WIDE_INT frame_offset_old
= frame_offset
;
775 p
= GGC_NEW (struct temp_slot
);
777 /* We are passing an explicit alignment request to assign_stack_local.
778 One side effect of that is assign_stack_local will not round SIZE
779 to ensure the frame offset remains suitably aligned.
781 So for requests which depended on the rounding of SIZE, we go ahead
782 and round it now. We also make sure ALIGNMENT is at least
783 BIGGEST_ALIGNMENT. */
784 gcc_assert (mode
!= BLKmode
|| align
== BIGGEST_ALIGNMENT
);
785 p
->slot
= assign_stack_local (mode
,
787 ? CEIL_ROUND (size
, (int) align
/ BITS_PER_UNIT
)
793 /* The following slot size computation is necessary because we don't
794 know the actual size of the temporary slot until assign_stack_local
795 has performed all the frame alignment and size rounding for the
796 requested temporary. Note that extra space added for alignment
797 can be either above or below this stack slot depending on which
798 way the frame grows. We include the extra space if and only if it
799 is above this slot. */
800 if (FRAME_GROWS_DOWNWARD
)
801 p
->size
= frame_offset_old
- frame_offset
;
805 /* Now define the fields used by combine_temp_slots. */
806 if (FRAME_GROWS_DOWNWARD
)
808 p
->base_offset
= frame_offset
;
809 p
->full_size
= frame_offset_old
- frame_offset
;
813 p
->base_offset
= frame_offset_old
;
814 p
->full_size
= frame_offset
- frame_offset_old
;
824 p
->level
= temp_slot_level
;
827 pp
= temp_slots_at_level (p
->level
);
828 insert_slot_to_list (p
, pp
);
829 insert_temp_slot_address (XEXP (p
->slot
, 0), p
);
831 /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
832 slot
= gen_rtx_MEM (mode
, XEXP (p
->slot
, 0));
833 stack_slot_list
= gen_rtx_EXPR_LIST (VOIDmode
, slot
, stack_slot_list
);
835 /* If we know the alias set for the memory that will be used, use
836 it. If there's no TYPE, then we don't know anything about the
837 alias set for the memory. */
838 set_mem_alias_set (slot
, type
? get_alias_set (type
) : 0);
839 set_mem_align (slot
, align
);
841 /* If a type is specified, set the relevant flags. */
844 MEM_VOLATILE_P (slot
) = TYPE_VOLATILE (type
);
845 MEM_SET_IN_STRUCT_P (slot
, (AGGREGATE_TYPE_P (type
)
846 || TREE_CODE (type
) == COMPLEX_TYPE
));
848 MEM_NOTRAP_P (slot
) = 1;
853 /* Allocate a temporary stack slot and record it for possible later
854 reuse. First three arguments are same as in preceding function. */
857 assign_stack_temp (enum machine_mode mode
, HOST_WIDE_INT size
, int keep
)
859 return assign_stack_temp_for_type (mode
, size
, keep
, NULL_TREE
);
862 /* Assign a temporary.
863 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
864 and so that should be used in error messages. In either case, we
865 allocate of the given type.
866 KEEP is as for assign_stack_temp.
867 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
868 it is 0 if a register is OK.
869 DONT_PROMOTE is 1 if we should not promote values in register
873 assign_temp (tree type_or_decl
, int keep
, int memory_required
,
874 int dont_promote ATTRIBUTE_UNUSED
)
877 enum machine_mode mode
;
882 if (DECL_P (type_or_decl
))
883 decl
= type_or_decl
, type
= TREE_TYPE (decl
);
885 decl
= NULL
, type
= type_or_decl
;
887 mode
= TYPE_MODE (type
);
889 unsignedp
= TYPE_UNSIGNED (type
);
892 if (mode
== BLKmode
|| memory_required
)
894 HOST_WIDE_INT size
= int_size_in_bytes (type
);
897 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
898 problems with allocating the stack space. */
902 /* Unfortunately, we don't yet know how to allocate variable-sized
903 temporaries. However, sometimes we can find a fixed upper limit on
904 the size, so try that instead. */
906 size
= max_int_size_in_bytes (type
);
908 /* The size of the temporary may be too large to fit into an integer. */
909 /* ??? Not sure this should happen except for user silliness, so limit
910 this to things that aren't compiler-generated temporaries. The
911 rest of the time we'll die in assign_stack_temp_for_type. */
912 if (decl
&& size
== -1
913 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
)
915 error ("size of variable %q+D is too large", decl
);
919 tmp
= assign_stack_temp_for_type (mode
, size
, keep
, type
);
925 mode
= promote_mode (type
, mode
, &unsignedp
, 0);
928 return gen_reg_rtx (mode
);
931 /* Combine temporary stack slots which are adjacent on the stack.
933 This allows for better use of already allocated stack space. This is only
934 done for BLKmode slots because we can be sure that we won't have alignment
935 problems in this case. */
938 combine_temp_slots (void)
940 struct temp_slot
*p
, *q
, *next
, *next_q
;
943 /* We can't combine slots, because the information about which slot
944 is in which alias set will be lost. */
945 if (flag_strict_aliasing
)
948 /* If there are a lot of temp slots, don't do anything unless
949 high levels of optimization. */
950 if (! flag_expensive_optimizations
)
951 for (p
= avail_temp_slots
, num_slots
= 0; p
; p
= p
->next
, num_slots
++)
952 if (num_slots
> 100 || (num_slots
> 10 && optimize
== 0))
955 for (p
= avail_temp_slots
; p
; p
= next
)
961 if (GET_MODE (p
->slot
) != BLKmode
)
964 for (q
= p
->next
; q
; q
= next_q
)
970 if (GET_MODE (q
->slot
) != BLKmode
)
973 if (p
->base_offset
+ p
->full_size
== q
->base_offset
)
975 /* Q comes after P; combine Q into P. */
977 p
->full_size
+= q
->full_size
;
980 else if (q
->base_offset
+ q
->full_size
== p
->base_offset
)
982 /* P comes after Q; combine P into Q. */
984 q
->full_size
+= p
->full_size
;
989 cut_slot_from_list (q
, &avail_temp_slots
);
992 /* Either delete P or advance past it. */
994 cut_slot_from_list (p
, &avail_temp_slots
);
998 /* Indicate that NEW_RTX is an alternate way of referring to the temp
999 slot that previously was known by OLD_RTX. */
1002 update_temp_slot_address (rtx old_rtx
, rtx new_rtx
)
1004 struct temp_slot
*p
;
1006 if (rtx_equal_p (old_rtx
, new_rtx
))
1009 p
= find_temp_slot_from_address (old_rtx
);
1011 /* If we didn't find one, see if both OLD_RTX is a PLUS. If so, and
1012 NEW_RTX is a register, see if one operand of the PLUS is a
1013 temporary location. If so, NEW_RTX points into it. Otherwise,
1014 if both OLD_RTX and NEW_RTX are a PLUS and if there is a register
1015 in common between them. If so, try a recursive call on those
1019 if (GET_CODE (old_rtx
) != PLUS
)
1022 if (REG_P (new_rtx
))
1024 update_temp_slot_address (XEXP (old_rtx
, 0), new_rtx
);
1025 update_temp_slot_address (XEXP (old_rtx
, 1), new_rtx
);
1028 else if (GET_CODE (new_rtx
) != PLUS
)
1031 if (rtx_equal_p (XEXP (old_rtx
, 0), XEXP (new_rtx
, 0)))
1032 update_temp_slot_address (XEXP (old_rtx
, 1), XEXP (new_rtx
, 1));
1033 else if (rtx_equal_p (XEXP (old_rtx
, 1), XEXP (new_rtx
, 0)))
1034 update_temp_slot_address (XEXP (old_rtx
, 0), XEXP (new_rtx
, 1));
1035 else if (rtx_equal_p (XEXP (old_rtx
, 0), XEXP (new_rtx
, 1)))
1036 update_temp_slot_address (XEXP (old_rtx
, 1), XEXP (new_rtx
, 0));
1037 else if (rtx_equal_p (XEXP (old_rtx
, 1), XEXP (new_rtx
, 1)))
1038 update_temp_slot_address (XEXP (old_rtx
, 0), XEXP (new_rtx
, 0));
1043 /* Otherwise add an alias for the temp's address. */
1044 insert_temp_slot_address (new_rtx
, p
);
1047 /* If X could be a reference to a temporary slot, mark the fact that its
1048 address was taken. */
1051 mark_temp_addr_taken (rtx x
)
1053 struct temp_slot
*p
;
1058 /* If X is not in memory or is at a constant address, it cannot be in
1059 a temporary slot. */
1060 if (!MEM_P (x
) || CONSTANT_P (XEXP (x
, 0)))
1063 p
= find_temp_slot_from_address (XEXP (x
, 0));
1068 /* If X could be a reference to a temporary slot, mark that slot as
1069 belonging to the to one level higher than the current level. If X
1070 matched one of our slots, just mark that one. Otherwise, we can't
1071 easily predict which it is, so upgrade all of them. Kept slots
1072 need not be touched.
1074 This is called when an ({...}) construct occurs and a statement
1075 returns a value in memory. */
1078 preserve_temp_slots (rtx x
)
1080 struct temp_slot
*p
= 0, *next
;
1082 /* If there is no result, we still might have some objects whose address
1083 were taken, so we need to make sure they stay around. */
1086 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1091 move_slot_to_level (p
, temp_slot_level
- 1);
1097 /* If X is a register that is being used as a pointer, see if we have
1098 a temporary slot we know it points to. To be consistent with
1099 the code below, we really should preserve all non-kept slots
1100 if we can't find a match, but that seems to be much too costly. */
1101 if (REG_P (x
) && REG_POINTER (x
))
1102 p
= find_temp_slot_from_address (x
);
1104 /* If X is not in memory or is at a constant address, it cannot be in
1105 a temporary slot, but it can contain something whose address was
1107 if (p
== 0 && (!MEM_P (x
) || CONSTANT_P (XEXP (x
, 0))))
1109 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1114 move_slot_to_level (p
, temp_slot_level
- 1);
1120 /* First see if we can find a match. */
1122 p
= find_temp_slot_from_address (XEXP (x
, 0));
1126 /* Move everything at our level whose address was taken to our new
1127 level in case we used its address. */
1128 struct temp_slot
*q
;
1130 if (p
->level
== temp_slot_level
)
1132 for (q
= *temp_slots_at_level (temp_slot_level
); q
; q
= next
)
1136 if (p
!= q
&& q
->addr_taken
)
1137 move_slot_to_level (q
, temp_slot_level
- 1);
1140 move_slot_to_level (p
, temp_slot_level
- 1);
1146 /* Otherwise, preserve all non-kept slots at this level. */
1147 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1152 move_slot_to_level (p
, temp_slot_level
- 1);
1156 /* Free all temporaries used so far. This is normally called at the
1157 end of generating code for a statement. */
1160 free_temp_slots (void)
1162 struct temp_slot
*p
, *next
;
1164 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1169 make_slot_available (p
);
1172 remove_unused_temp_slot_addresses ();
1173 combine_temp_slots ();
1176 /* Push deeper into the nesting level for stack temporaries. */
1179 push_temp_slots (void)
1184 /* Pop a temporary nesting level. All slots in use in the current level
1188 pop_temp_slots (void)
1190 struct temp_slot
*p
, *next
;
1192 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1195 make_slot_available (p
);
1198 remove_unused_temp_slot_addresses ();
1199 combine_temp_slots ();
1204 /* Initialize temporary slots. */
1207 init_temp_slots (void)
1209 /* We have not allocated any temporaries yet. */
1210 avail_temp_slots
= 0;
1211 used_temp_slots
= 0;
1212 temp_slot_level
= 0;
1214 /* Set up the table to map addresses to temp slots. */
1215 if (! temp_slot_address_table
)
1216 temp_slot_address_table
= htab_create_ggc (32,
1217 temp_slot_address_hash
,
1218 temp_slot_address_eq
,
1221 htab_empty (temp_slot_address_table
);
1224 /* These routines are responsible for converting virtual register references
1225 to the actual hard register references once RTL generation is complete.
1227 The following four variables are used for communication between the
1228 routines. They contain the offsets of the virtual registers from their
1229 respective hard registers. */
1231 static int in_arg_offset
;
1232 static int var_offset
;
1233 static int dynamic_offset
;
1234 static int out_arg_offset
;
1235 static int cfa_offset
;
1237 /* In most machines, the stack pointer register is equivalent to the bottom
1240 #ifndef STACK_POINTER_OFFSET
1241 #define STACK_POINTER_OFFSET 0
1244 /* If not defined, pick an appropriate default for the offset of dynamically
1245 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
1246 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
1248 #ifndef STACK_DYNAMIC_OFFSET
1250 /* The bottom of the stack points to the actual arguments. If
1251 REG_PARM_STACK_SPACE is defined, this includes the space for the register
1252 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
1253 stack space for register parameters is not pushed by the caller, but
1254 rather part of the fixed stack areas and hence not included in
1255 `crtl->outgoing_args_size'. Nevertheless, we must allow
1256 for it when allocating stack dynamic objects. */
1258 #if defined(REG_PARM_STACK_SPACE)
1259 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1260 ((ACCUMULATE_OUTGOING_ARGS \
1261 ? (crtl->outgoing_args_size \
1262 + (OUTGOING_REG_PARM_STACK_SPACE ((!(FNDECL) ? NULL_TREE : TREE_TYPE (FNDECL))) ? 0 \
1263 : REG_PARM_STACK_SPACE (FNDECL))) \
1264 : 0) + (STACK_POINTER_OFFSET))
1266 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1267 ((ACCUMULATE_OUTGOING_ARGS ? crtl->outgoing_args_size : 0) \
1268 + (STACK_POINTER_OFFSET))
1273 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
1274 is a virtual register, return the equivalent hard register and set the
1275 offset indirectly through the pointer. Otherwise, return 0. */
1278 instantiate_new_reg (rtx x
, HOST_WIDE_INT
*poffset
)
1281 HOST_WIDE_INT offset
;
1283 if (x
== virtual_incoming_args_rtx
)
1285 if (stack_realign_drap
)
1287 /* Replace virtual_incoming_args_rtx with internal arg
1288 pointer if DRAP is used to realign stack. */
1289 new_rtx
= crtl
->args
.internal_arg_pointer
;
1293 new_rtx
= arg_pointer_rtx
, offset
= in_arg_offset
;
1295 else if (x
== virtual_stack_vars_rtx
)
1296 new_rtx
= frame_pointer_rtx
, offset
= var_offset
;
1297 else if (x
== virtual_stack_dynamic_rtx
)
1298 new_rtx
= stack_pointer_rtx
, offset
= dynamic_offset
;
1299 else if (x
== virtual_outgoing_args_rtx
)
1300 new_rtx
= stack_pointer_rtx
, offset
= out_arg_offset
;
1301 else if (x
== virtual_cfa_rtx
)
1303 #ifdef FRAME_POINTER_CFA_OFFSET
1304 new_rtx
= frame_pointer_rtx
;
1306 new_rtx
= arg_pointer_rtx
;
1308 offset
= cfa_offset
;
1317 /* A subroutine of instantiate_virtual_regs, called via for_each_rtx.
1318 Instantiate any virtual registers present inside of *LOC. The expression
1319 is simplified, as much as possible, but is not to be considered "valid"
1320 in any sense implied by the target. If any change is made, set CHANGED
1324 instantiate_virtual_regs_in_rtx (rtx
*loc
, void *data
)
1326 HOST_WIDE_INT offset
;
1327 bool *changed
= (bool *) data
;
1334 switch (GET_CODE (x
))
1337 new_rtx
= instantiate_new_reg (x
, &offset
);
1340 *loc
= plus_constant (new_rtx
, offset
);
1347 new_rtx
= instantiate_new_reg (XEXP (x
, 0), &offset
);
1350 new_rtx
= plus_constant (new_rtx
, offset
);
1351 *loc
= simplify_gen_binary (PLUS
, GET_MODE (x
), new_rtx
, XEXP (x
, 1));
1357 /* FIXME -- from old code */
1358 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
1359 we can commute the PLUS and SUBREG because pointers into the
1360 frame are well-behaved. */
1370 /* A subroutine of instantiate_virtual_regs_in_insn. Return true if X
1371 matches the predicate for insn CODE operand OPERAND. */
1374 safe_insn_predicate (int code
, int operand
, rtx x
)
1376 const struct insn_operand_data
*op_data
;
1381 op_data
= &insn_data
[code
].operand
[operand
];
1382 if (op_data
->predicate
== NULL
)
1385 return op_data
->predicate (x
, op_data
->mode
);
1388 /* A subroutine of instantiate_virtual_regs. Instantiate any virtual
1389 registers present inside of insn. The result will be a valid insn. */
1392 instantiate_virtual_regs_in_insn (rtx insn
)
1394 HOST_WIDE_INT offset
;
1396 bool any_change
= false;
1397 rtx set
, new_rtx
, x
, seq
;
1399 /* There are some special cases to be handled first. */
1400 set
= single_set (insn
);
1403 /* We're allowed to assign to a virtual register. This is interpreted
1404 to mean that the underlying register gets assigned the inverse
1405 transformation. This is used, for example, in the handling of
1407 new_rtx
= instantiate_new_reg (SET_DEST (set
), &offset
);
1412 for_each_rtx (&SET_SRC (set
), instantiate_virtual_regs_in_rtx
, NULL
);
1413 x
= simplify_gen_binary (PLUS
, GET_MODE (new_rtx
), SET_SRC (set
),
1415 x
= force_operand (x
, new_rtx
);
1417 emit_move_insn (new_rtx
, x
);
1422 emit_insn_before (seq
, insn
);
1427 /* Handle a straight copy from a virtual register by generating a
1428 new add insn. The difference between this and falling through
1429 to the generic case is avoiding a new pseudo and eliminating a
1430 move insn in the initial rtl stream. */
1431 new_rtx
= instantiate_new_reg (SET_SRC (set
), &offset
);
1432 if (new_rtx
&& offset
!= 0
1433 && REG_P (SET_DEST (set
))
1434 && REGNO (SET_DEST (set
)) > LAST_VIRTUAL_REGISTER
)
1438 x
= expand_simple_binop (GET_MODE (SET_DEST (set
)), PLUS
,
1439 new_rtx
, GEN_INT (offset
), SET_DEST (set
),
1440 1, OPTAB_LIB_WIDEN
);
1441 if (x
!= SET_DEST (set
))
1442 emit_move_insn (SET_DEST (set
), x
);
1447 emit_insn_before (seq
, insn
);
1452 extract_insn (insn
);
1453 insn_code
= INSN_CODE (insn
);
1455 /* Handle a plus involving a virtual register by determining if the
1456 operands remain valid if they're modified in place. */
1457 if (GET_CODE (SET_SRC (set
)) == PLUS
1458 && recog_data
.n_operands
>= 3
1459 && recog_data
.operand_loc
[1] == &XEXP (SET_SRC (set
), 0)
1460 && recog_data
.operand_loc
[2] == &XEXP (SET_SRC (set
), 1)
1461 && CONST_INT_P (recog_data
.operand
[2])
1462 && (new_rtx
= instantiate_new_reg (recog_data
.operand
[1], &offset
)))
1464 offset
+= INTVAL (recog_data
.operand
[2]);
1466 /* If the sum is zero, then replace with a plain move. */
1468 && REG_P (SET_DEST (set
))
1469 && REGNO (SET_DEST (set
)) > LAST_VIRTUAL_REGISTER
)
1472 emit_move_insn (SET_DEST (set
), new_rtx
);
1476 emit_insn_before (seq
, insn
);
1481 x
= gen_int_mode (offset
, recog_data
.operand_mode
[2]);
1483 /* Using validate_change and apply_change_group here leaves
1484 recog_data in an invalid state. Since we know exactly what
1485 we want to check, do those two by hand. */
1486 if (safe_insn_predicate (insn_code
, 1, new_rtx
)
1487 && safe_insn_predicate (insn_code
, 2, x
))
1489 *recog_data
.operand_loc
[1] = recog_data
.operand
[1] = new_rtx
;
1490 *recog_data
.operand_loc
[2] = recog_data
.operand
[2] = x
;
1493 /* Fall through into the regular operand fixup loop in
1494 order to take care of operands other than 1 and 2. */
1500 extract_insn (insn
);
1501 insn_code
= INSN_CODE (insn
);
1504 /* In the general case, we expect virtual registers to appear only in
1505 operands, and then only as either bare registers or inside memories. */
1506 for (i
= 0; i
< recog_data
.n_operands
; ++i
)
1508 x
= recog_data
.operand
[i
];
1509 switch (GET_CODE (x
))
1513 rtx addr
= XEXP (x
, 0);
1514 bool changed
= false;
1516 for_each_rtx (&addr
, instantiate_virtual_regs_in_rtx
, &changed
);
1521 x
= replace_equiv_address (x
, addr
);
1522 /* It may happen that the address with the virtual reg
1523 was valid (e.g. based on the virtual stack reg, which might
1524 be acceptable to the predicates with all offsets), whereas
1525 the address now isn't anymore, for instance when the address
1526 is still offsetted, but the base reg isn't virtual-stack-reg
1527 anymore. Below we would do a force_reg on the whole operand,
1528 but this insn might actually only accept memory. Hence,
1529 before doing that last resort, try to reload the address into
1530 a register, so this operand stays a MEM. */
1531 if (!safe_insn_predicate (insn_code
, i
, x
))
1533 addr
= force_reg (GET_MODE (addr
), addr
);
1534 x
= replace_equiv_address (x
, addr
);
1539 emit_insn_before (seq
, insn
);
1544 new_rtx
= instantiate_new_reg (x
, &offset
);
1545 if (new_rtx
== NULL
)
1553 /* Careful, special mode predicates may have stuff in
1554 insn_data[insn_code].operand[i].mode that isn't useful
1555 to us for computing a new value. */
1556 /* ??? Recognize address_operand and/or "p" constraints
1557 to see if (plus new offset) is a valid before we put
1558 this through expand_simple_binop. */
1559 x
= expand_simple_binop (GET_MODE (x
), PLUS
, new_rtx
,
1560 GEN_INT (offset
), NULL_RTX
,
1561 1, OPTAB_LIB_WIDEN
);
1564 emit_insn_before (seq
, insn
);
1569 new_rtx
= instantiate_new_reg (SUBREG_REG (x
), &offset
);
1570 if (new_rtx
== NULL
)
1575 new_rtx
= expand_simple_binop (GET_MODE (new_rtx
), PLUS
, new_rtx
,
1576 GEN_INT (offset
), NULL_RTX
,
1577 1, OPTAB_LIB_WIDEN
);
1580 emit_insn_before (seq
, insn
);
1582 x
= simplify_gen_subreg (recog_data
.operand_mode
[i
], new_rtx
,
1583 GET_MODE (new_rtx
), SUBREG_BYTE (x
));
1591 /* At this point, X contains the new value for the operand.
1592 Validate the new value vs the insn predicate. Note that
1593 asm insns will have insn_code -1 here. */
1594 if (!safe_insn_predicate (insn_code
, i
, x
))
1597 x
= force_reg (insn_data
[insn_code
].operand
[i
].mode
, x
);
1601 emit_insn_before (seq
, insn
);
1604 *recog_data
.operand_loc
[i
] = recog_data
.operand
[i
] = x
;
1610 /* Propagate operand changes into the duplicates. */
1611 for (i
= 0; i
< recog_data
.n_dups
; ++i
)
1612 *recog_data
.dup_loc
[i
]
1613 = copy_rtx (recog_data
.operand
[(unsigned)recog_data
.dup_num
[i
]]);
1615 /* Force re-recognition of the instruction for validation. */
1616 INSN_CODE (insn
) = -1;
1619 if (asm_noperands (PATTERN (insn
)) >= 0)
1621 if (!check_asm_operands (PATTERN (insn
)))
1623 error_for_asm (insn
, "impossible constraint in %<asm%>");
1629 if (recog_memoized (insn
) < 0)
1630 fatal_insn_not_found (insn
);
1634 /* Subroutine of instantiate_decls. Given RTL representing a decl,
1635 do any instantiation required. */
1638 instantiate_decl_rtl (rtx x
)
1645 /* If this is a CONCAT, recurse for the pieces. */
1646 if (GET_CODE (x
) == CONCAT
)
1648 instantiate_decl_rtl (XEXP (x
, 0));
1649 instantiate_decl_rtl (XEXP (x
, 1));
1653 /* If this is not a MEM, no need to do anything. Similarly if the
1654 address is a constant or a register that is not a virtual register. */
1659 if (CONSTANT_P (addr
)
1661 && (REGNO (addr
) < FIRST_VIRTUAL_REGISTER
1662 || REGNO (addr
) > LAST_VIRTUAL_REGISTER
)))
1665 for_each_rtx (&XEXP (x
, 0), instantiate_virtual_regs_in_rtx
, NULL
);
1668 /* Helper for instantiate_decls called via walk_tree: Process all decls
1669 in the given DECL_VALUE_EXPR. */
1672 instantiate_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1678 if (DECL_P (t
) && DECL_RTL_SET_P (t
))
1679 instantiate_decl_rtl (DECL_RTL (t
));
1684 /* Subroutine of instantiate_decls: Process all decls in the given
1685 BLOCK node and all its subblocks. */
1688 instantiate_decls_1 (tree let
)
1692 for (t
= BLOCK_VARS (let
); t
; t
= TREE_CHAIN (t
))
1694 if (DECL_RTL_SET_P (t
))
1695 instantiate_decl_rtl (DECL_RTL (t
));
1696 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (t
))
1698 tree v
= DECL_VALUE_EXPR (t
);
1699 walk_tree (&v
, instantiate_expr
, NULL
, NULL
);
1703 /* Process all subblocks. */
1704 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= BLOCK_CHAIN (t
))
1705 instantiate_decls_1 (t
);
1708 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
1709 all virtual registers in their DECL_RTL's. */
1712 instantiate_decls (tree fndecl
)
1716 /* Process all parameters of the function. */
1717 for (decl
= DECL_ARGUMENTS (fndecl
); decl
; decl
= TREE_CHAIN (decl
))
1719 instantiate_decl_rtl (DECL_RTL (decl
));
1720 instantiate_decl_rtl (DECL_INCOMING_RTL (decl
));
1721 if (DECL_HAS_VALUE_EXPR_P (decl
))
1723 tree v
= DECL_VALUE_EXPR (decl
);
1724 walk_tree (&v
, instantiate_expr
, NULL
, NULL
);
1728 /* Now process all variables defined in the function or its subblocks. */
1729 instantiate_decls_1 (DECL_INITIAL (fndecl
));
1731 t
= cfun
->local_decls
;
1732 cfun
->local_decls
= NULL_TREE
;
1735 next
= TREE_CHAIN (t
);
1736 decl
= TREE_VALUE (t
);
1737 if (DECL_RTL_SET_P (decl
))
1738 instantiate_decl_rtl (DECL_RTL (decl
));
1743 /* Pass through the INSNS of function FNDECL and convert virtual register
1744 references to hard register references. */
1747 instantiate_virtual_regs (void)
1751 /* Compute the offsets to use for this function. */
1752 in_arg_offset
= FIRST_PARM_OFFSET (current_function_decl
);
1753 var_offset
= STARTING_FRAME_OFFSET
;
1754 dynamic_offset
= STACK_DYNAMIC_OFFSET (current_function_decl
);
1755 out_arg_offset
= STACK_POINTER_OFFSET
;
1756 #ifdef FRAME_POINTER_CFA_OFFSET
1757 cfa_offset
= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
1759 cfa_offset
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
1762 /* Initialize recognition, indicating that volatile is OK. */
1765 /* Scan through all the insns, instantiating every virtual register still
1767 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1770 /* These patterns in the instruction stream can never be recognized.
1771 Fortunately, they shouldn't contain virtual registers either. */
1772 if (GET_CODE (PATTERN (insn
)) == USE
1773 || GET_CODE (PATTERN (insn
)) == CLOBBER
1774 || GET_CODE (PATTERN (insn
)) == ADDR_VEC
1775 || GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
1776 || GET_CODE (PATTERN (insn
)) == ASM_INPUT
)
1779 instantiate_virtual_regs_in_insn (insn
);
1781 if (INSN_DELETED_P (insn
))
1784 for_each_rtx (®_NOTES (insn
), instantiate_virtual_regs_in_rtx
, NULL
);
1786 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
1788 for_each_rtx (&CALL_INSN_FUNCTION_USAGE (insn
),
1789 instantiate_virtual_regs_in_rtx
, NULL
);
1792 /* Instantiate the virtual registers in the DECLs for debugging purposes. */
1793 instantiate_decls (current_function_decl
);
1795 targetm
.instantiate_decls ();
1797 /* Indicate that, from now on, assign_stack_local should use
1798 frame_pointer_rtx. */
1799 virtuals_instantiated
= 1;
1803 struct rtl_opt_pass pass_instantiate_virtual_regs
=
1809 instantiate_virtual_regs
, /* execute */
1812 0, /* static_pass_number */
1813 TV_NONE
, /* tv_id */
1814 0, /* properties_required */
1815 0, /* properties_provided */
1816 0, /* properties_destroyed */
1817 0, /* todo_flags_start */
1818 TODO_dump_func
/* todo_flags_finish */
1823 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
1824 This means a type for which function calls must pass an address to the
1825 function or get an address back from the function.
1826 EXP may be a type node or an expression (whose type is tested). */
1829 aggregate_value_p (const_tree exp
, const_tree fntype
)
1831 int i
, regno
, nregs
;
1834 const_tree type
= (TYPE_P (exp
)) ? exp
: TREE_TYPE (exp
);
1836 /* DECL node associated with FNTYPE when relevant, which we might need to
1837 check for by-invisible-reference returns, typically for CALL_EXPR input
1839 const_tree fndecl
= NULL_TREE
;
1842 switch (TREE_CODE (fntype
))
1845 fndecl
= get_callee_fndecl (fntype
);
1847 ? TREE_TYPE (fndecl
)
1848 : TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (fntype
))));
1852 fntype
= TREE_TYPE (fndecl
);
1857 case IDENTIFIER_NODE
:
1861 /* We don't expect other rtl types here. */
1865 if (TREE_CODE (type
) == VOID_TYPE
)
1868 /* If the front end has decided that this needs to be passed by
1869 reference, do so. */
1870 if ((TREE_CODE (exp
) == PARM_DECL
|| TREE_CODE (exp
) == RESULT_DECL
)
1871 && DECL_BY_REFERENCE (exp
))
1874 /* If the EXPression is a CALL_EXPR, honor DECL_BY_REFERENCE set on the
1875 called function RESULT_DECL, meaning the function returns in memory by
1876 invisible reference. This check lets front-ends not set TREE_ADDRESSABLE
1877 on the function type, which used to be the way to request such a return
1878 mechanism but might now be causing troubles at gimplification time if
1879 temporaries with the function type need to be created. */
1880 if (TREE_CODE (exp
) == CALL_EXPR
&& fndecl
&& DECL_RESULT (fndecl
)
1881 && DECL_BY_REFERENCE (DECL_RESULT (fndecl
)))
1884 if (targetm
.calls
.return_in_memory (type
, fntype
))
1886 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
1887 and thus can't be returned in registers. */
1888 if (TREE_ADDRESSABLE (type
))
1890 if (flag_pcc_struct_return
&& AGGREGATE_TYPE_P (type
))
1892 /* Make sure we have suitable call-clobbered regs to return
1893 the value in; if not, we must return it in memory. */
1894 reg
= hard_function_value (type
, 0, fntype
, 0);
1896 /* If we have something other than a REG (e.g. a PARALLEL), then assume
1901 regno
= REGNO (reg
);
1902 nregs
= hard_regno_nregs
[regno
][TYPE_MODE (type
)];
1903 for (i
= 0; i
< nregs
; i
++)
1904 if (! call_used_regs
[regno
+ i
])
1909 /* Return true if we should assign DECL a pseudo register; false if it
1910 should live on the local stack. */
1913 use_register_for_decl (const_tree decl
)
1915 if (!targetm
.calls
.allocate_stack_slots_for_args())
1918 /* Honor volatile. */
1919 if (TREE_SIDE_EFFECTS (decl
))
1922 /* Honor addressability. */
1923 if (TREE_ADDRESSABLE (decl
))
1926 /* Only register-like things go in registers. */
1927 if (DECL_MODE (decl
) == BLKmode
)
1930 /* If -ffloat-store specified, don't put explicit float variables
1932 /* ??? This should be checked after DECL_ARTIFICIAL, but tree-ssa
1933 propagates values across these stores, and it probably shouldn't. */
1934 if (flag_float_store
&& FLOAT_TYPE_P (TREE_TYPE (decl
)))
1937 /* If we're not interested in tracking debugging information for
1938 this decl, then we can certainly put it in a register. */
1939 if (DECL_IGNORED_P (decl
))
1945 if (!DECL_REGISTER (decl
))
1948 switch (TREE_CODE (TREE_TYPE (decl
)))
1952 case QUAL_UNION_TYPE
:
1953 /* When not optimizing, disregard register keyword for variables with
1954 types containing methods, otherwise the methods won't be callable
1955 from the debugger. */
1956 if (TYPE_METHODS (TREE_TYPE (decl
)))
1966 /* Return true if TYPE should be passed by invisible reference. */
1969 pass_by_reference (CUMULATIVE_ARGS
*ca
, enum machine_mode mode
,
1970 tree type
, bool named_arg
)
1974 /* If this type contains non-trivial constructors, then it is
1975 forbidden for the middle-end to create any new copies. */
1976 if (TREE_ADDRESSABLE (type
))
1979 /* GCC post 3.4 passes *all* variable sized types by reference. */
1980 if (!TYPE_SIZE (type
) || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
1984 return targetm
.calls
.pass_by_reference (ca
, mode
, type
, named_arg
);
1987 /* Return true if TYPE, which is passed by reference, should be callee
1988 copied instead of caller copied. */
1991 reference_callee_copied (CUMULATIVE_ARGS
*ca
, enum machine_mode mode
,
1992 tree type
, bool named_arg
)
1994 if (type
&& TREE_ADDRESSABLE (type
))
1996 return targetm
.calls
.callee_copies (ca
, mode
, type
, named_arg
);
1999 /* Structures to communicate between the subroutines of assign_parms.
2000 The first holds data persistent across all parameters, the second
2001 is cleared out for each parameter. */
2003 struct assign_parm_data_all
2005 CUMULATIVE_ARGS args_so_far
;
2006 struct args_size stack_args_size
;
2007 tree function_result_decl
;
2009 rtx first_conversion_insn
;
2010 rtx last_conversion_insn
;
2011 HOST_WIDE_INT pretend_args_size
;
2012 HOST_WIDE_INT extra_pretend_bytes
;
2013 int reg_parm_stack_space
;
2016 struct assign_parm_data_one
2022 enum machine_mode nominal_mode
;
2023 enum machine_mode passed_mode
;
2024 enum machine_mode promoted_mode
;
2025 struct locate_and_pad_arg_data locate
;
2027 BOOL_BITFIELD named_arg
: 1;
2028 BOOL_BITFIELD passed_pointer
: 1;
2029 BOOL_BITFIELD on_stack
: 1;
2030 BOOL_BITFIELD loaded_in_reg
: 1;
2033 /* A subroutine of assign_parms. Initialize ALL. */
2036 assign_parms_initialize_all (struct assign_parm_data_all
*all
)
2040 memset (all
, 0, sizeof (*all
));
2042 fntype
= TREE_TYPE (current_function_decl
);
2044 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
2045 INIT_CUMULATIVE_INCOMING_ARGS (all
->args_so_far
, fntype
, NULL_RTX
);
2047 INIT_CUMULATIVE_ARGS (all
->args_so_far
, fntype
, NULL_RTX
,
2048 current_function_decl
, -1);
2051 #ifdef REG_PARM_STACK_SPACE
2052 all
->reg_parm_stack_space
= REG_PARM_STACK_SPACE (current_function_decl
);
2056 /* If ARGS contains entries with complex types, split the entry into two
2057 entries of the component type. Return a new list of substitutions are
2058 needed, else the old list. */
2061 split_complex_args (tree args
)
2065 /* Before allocating memory, check for the common case of no complex. */
2066 for (p
= args
; p
; p
= TREE_CHAIN (p
))
2068 tree type
= TREE_TYPE (p
);
2069 if (TREE_CODE (type
) == COMPLEX_TYPE
2070 && targetm
.calls
.split_complex_arg (type
))
2076 args
= copy_list (args
);
2078 for (p
= args
; p
; p
= TREE_CHAIN (p
))
2080 tree type
= TREE_TYPE (p
);
2081 if (TREE_CODE (type
) == COMPLEX_TYPE
2082 && targetm
.calls
.split_complex_arg (type
))
2085 tree subtype
= TREE_TYPE (type
);
2086 bool addressable
= TREE_ADDRESSABLE (p
);
2088 /* Rewrite the PARM_DECL's type with its component. */
2089 TREE_TYPE (p
) = subtype
;
2090 DECL_ARG_TYPE (p
) = TREE_TYPE (DECL_ARG_TYPE (p
));
2091 DECL_MODE (p
) = VOIDmode
;
2092 DECL_SIZE (p
) = NULL
;
2093 DECL_SIZE_UNIT (p
) = NULL
;
2094 /* If this arg must go in memory, put it in a pseudo here.
2095 We can't allow it to go in memory as per normal parms,
2096 because the usual place might not have the imag part
2097 adjacent to the real part. */
2098 DECL_ARTIFICIAL (p
) = addressable
;
2099 DECL_IGNORED_P (p
) = addressable
;
2100 TREE_ADDRESSABLE (p
) = 0;
2103 /* Build a second synthetic decl. */
2104 decl
= build_decl (EXPR_LOCATION (p
),
2105 PARM_DECL
, NULL_TREE
, subtype
);
2106 DECL_ARG_TYPE (decl
) = DECL_ARG_TYPE (p
);
2107 DECL_ARTIFICIAL (decl
) = addressable
;
2108 DECL_IGNORED_P (decl
) = addressable
;
2109 layout_decl (decl
, 0);
2111 /* Splice it in; skip the new decl. */
2112 TREE_CHAIN (decl
) = TREE_CHAIN (p
);
2113 TREE_CHAIN (p
) = decl
;
2121 /* A subroutine of assign_parms. Adjust the parameter list to incorporate
2122 the hidden struct return argument, and (abi willing) complex args.
2123 Return the new parameter list. */
2126 assign_parms_augmented_arg_list (struct assign_parm_data_all
*all
)
2128 tree fndecl
= current_function_decl
;
2129 tree fntype
= TREE_TYPE (fndecl
);
2130 tree fnargs
= DECL_ARGUMENTS (fndecl
);
2132 /* If struct value address is treated as the first argument, make it so. */
2133 if (aggregate_value_p (DECL_RESULT (fndecl
), fndecl
)
2134 && ! cfun
->returns_pcc_struct
2135 && targetm
.calls
.struct_value_rtx (TREE_TYPE (fndecl
), 1) == 0)
2137 tree type
= build_pointer_type (TREE_TYPE (fntype
));
2140 decl
= build_decl (DECL_SOURCE_LOCATION (fndecl
),
2141 PARM_DECL
, NULL_TREE
, type
);
2142 DECL_ARG_TYPE (decl
) = type
;
2143 DECL_ARTIFICIAL (decl
) = 1;
2144 DECL_IGNORED_P (decl
) = 1;
2146 TREE_CHAIN (decl
) = fnargs
;
2148 all
->function_result_decl
= decl
;
2151 all
->orig_fnargs
= fnargs
;
2153 /* If the target wants to split complex arguments into scalars, do so. */
2154 if (targetm
.calls
.split_complex_arg
)
2155 fnargs
= split_complex_args (fnargs
);
2160 /* A subroutine of assign_parms. Examine PARM and pull out type and mode
2161 data for the parameter. Incorporate ABI specifics such as pass-by-
2162 reference and type promotion. */
2165 assign_parm_find_data_types (struct assign_parm_data_all
*all
, tree parm
,
2166 struct assign_parm_data_one
*data
)
2168 tree nominal_type
, passed_type
;
2169 enum machine_mode nominal_mode
, passed_mode
, promoted_mode
;
2171 memset (data
, 0, sizeof (*data
));
2173 /* NAMED_ARG is a misnomer. We really mean 'non-variadic'. */
2175 data
->named_arg
= 1; /* No variadic parms. */
2176 else if (TREE_CHAIN (parm
))
2177 data
->named_arg
= 1; /* Not the last non-variadic parm. */
2178 else if (targetm
.calls
.strict_argument_naming (&all
->args_so_far
))
2179 data
->named_arg
= 1; /* Only variadic ones are unnamed. */
2181 data
->named_arg
= 0; /* Treat as variadic. */
2183 nominal_type
= TREE_TYPE (parm
);
2184 passed_type
= DECL_ARG_TYPE (parm
);
2186 /* Look out for errors propagating this far. Also, if the parameter's
2187 type is void then its value doesn't matter. */
2188 if (TREE_TYPE (parm
) == error_mark_node
2189 /* This can happen after weird syntax errors
2190 or if an enum type is defined among the parms. */
2191 || TREE_CODE (parm
) != PARM_DECL
2192 || passed_type
== NULL
2193 || VOID_TYPE_P (nominal_type
))
2195 nominal_type
= passed_type
= void_type_node
;
2196 nominal_mode
= passed_mode
= promoted_mode
= VOIDmode
;
2200 /* Find mode of arg as it is passed, and mode of arg as it should be
2201 during execution of this function. */
2202 passed_mode
= TYPE_MODE (passed_type
);
2203 nominal_mode
= TYPE_MODE (nominal_type
);
2205 /* If the parm is to be passed as a transparent union, use the type of
2206 the first field for the tests below. We have already verified that
2207 the modes are the same. */
2208 if (TREE_CODE (passed_type
) == UNION_TYPE
2209 && TYPE_TRANSPARENT_UNION (passed_type
))
2210 passed_type
= TREE_TYPE (TYPE_FIELDS (passed_type
));
2212 /* See if this arg was passed by invisible reference. */
2213 if (pass_by_reference (&all
->args_so_far
, passed_mode
,
2214 passed_type
, data
->named_arg
))
2216 passed_type
= nominal_type
= build_pointer_type (passed_type
);
2217 data
->passed_pointer
= true;
2218 passed_mode
= nominal_mode
= Pmode
;
2221 /* Find mode as it is passed by the ABI. */
2222 promoted_mode
= passed_mode
;
2223 if (targetm
.calls
.promote_function_args (TREE_TYPE (current_function_decl
)))
2225 int unsignedp
= TYPE_UNSIGNED (passed_type
);
2226 promoted_mode
= promote_mode (passed_type
, promoted_mode
,
2231 data
->nominal_type
= nominal_type
;
2232 data
->passed_type
= passed_type
;
2233 data
->nominal_mode
= nominal_mode
;
2234 data
->passed_mode
= passed_mode
;
2235 data
->promoted_mode
= promoted_mode
;
2238 /* A subroutine of assign_parms. Invoke setup_incoming_varargs. */
2241 assign_parms_setup_varargs (struct assign_parm_data_all
*all
,
2242 struct assign_parm_data_one
*data
, bool no_rtl
)
2244 int varargs_pretend_bytes
= 0;
2246 targetm
.calls
.setup_incoming_varargs (&all
->args_so_far
,
2247 data
->promoted_mode
,
2249 &varargs_pretend_bytes
, no_rtl
);
2251 /* If the back-end has requested extra stack space, record how much is
2252 needed. Do not change pretend_args_size otherwise since it may be
2253 nonzero from an earlier partial argument. */
2254 if (varargs_pretend_bytes
> 0)
2255 all
->pretend_args_size
= varargs_pretend_bytes
;
2258 /* A subroutine of assign_parms. Set DATA->ENTRY_PARM corresponding to
2259 the incoming location of the current parameter. */
2262 assign_parm_find_entry_rtl (struct assign_parm_data_all
*all
,
2263 struct assign_parm_data_one
*data
)
2265 HOST_WIDE_INT pretend_bytes
= 0;
2269 if (data
->promoted_mode
== VOIDmode
)
2271 data
->entry_parm
= data
->stack_parm
= const0_rtx
;
2275 #ifdef FUNCTION_INCOMING_ARG
2276 entry_parm
= FUNCTION_INCOMING_ARG (all
->args_so_far
, data
->promoted_mode
,
2277 data
->passed_type
, data
->named_arg
);
2279 entry_parm
= FUNCTION_ARG (all
->args_so_far
, data
->promoted_mode
,
2280 data
->passed_type
, data
->named_arg
);
2283 if (entry_parm
== 0)
2284 data
->promoted_mode
= data
->passed_mode
;
2286 /* Determine parm's home in the stack, in case it arrives in the stack
2287 or we should pretend it did. Compute the stack position and rtx where
2288 the argument arrives and its size.
2290 There is one complexity here: If this was a parameter that would
2291 have been passed in registers, but wasn't only because it is
2292 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
2293 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
2294 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of 0
2295 as it was the previous time. */
2296 in_regs
= entry_parm
!= 0;
2297 #ifdef STACK_PARMS_IN_REG_PARM_AREA
2300 if (!in_regs
&& !data
->named_arg
)
2302 if (targetm
.calls
.pretend_outgoing_varargs_named (&all
->args_so_far
))
2305 #ifdef FUNCTION_INCOMING_ARG
2306 tem
= FUNCTION_INCOMING_ARG (all
->args_so_far
, data
->promoted_mode
,
2307 data
->passed_type
, true);
2309 tem
= FUNCTION_ARG (all
->args_so_far
, data
->promoted_mode
,
2310 data
->passed_type
, true);
2312 in_regs
= tem
!= NULL
;
2316 /* If this parameter was passed both in registers and in the stack, use
2317 the copy on the stack. */
2318 if (targetm
.calls
.must_pass_in_stack (data
->promoted_mode
,
2326 partial
= targetm
.calls
.arg_partial_bytes (&all
->args_so_far
,
2327 data
->promoted_mode
,
2330 data
->partial
= partial
;
2332 /* The caller might already have allocated stack space for the
2333 register parameters. */
2334 if (partial
!= 0 && all
->reg_parm_stack_space
== 0)
2336 /* Part of this argument is passed in registers and part
2337 is passed on the stack. Ask the prologue code to extend
2338 the stack part so that we can recreate the full value.
2340 PRETEND_BYTES is the size of the registers we need to store.
2341 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
2342 stack space that the prologue should allocate.
2344 Internally, gcc assumes that the argument pointer is aligned
2345 to STACK_BOUNDARY bits. This is used both for alignment
2346 optimizations (see init_emit) and to locate arguments that are
2347 aligned to more than PARM_BOUNDARY bits. We must preserve this
2348 invariant by rounding CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to
2349 a stack boundary. */
2351 /* We assume at most one partial arg, and it must be the first
2352 argument on the stack. */
2353 gcc_assert (!all
->extra_pretend_bytes
&& !all
->pretend_args_size
);
2355 pretend_bytes
= partial
;
2356 all
->pretend_args_size
= CEIL_ROUND (pretend_bytes
, STACK_BYTES
);
2358 /* We want to align relative to the actual stack pointer, so
2359 don't include this in the stack size until later. */
2360 all
->extra_pretend_bytes
= all
->pretend_args_size
;
2364 locate_and_pad_parm (data
->promoted_mode
, data
->passed_type
, in_regs
,
2365 entry_parm
? data
->partial
: 0, current_function_decl
,
2366 &all
->stack_args_size
, &data
->locate
);
2368 /* Update parm_stack_boundary if this parameter is passed in the
2370 if (!in_regs
&& crtl
->parm_stack_boundary
< data
->locate
.boundary
)
2371 crtl
->parm_stack_boundary
= data
->locate
.boundary
;
2373 /* Adjust offsets to include the pretend args. */
2374 pretend_bytes
= all
->extra_pretend_bytes
- pretend_bytes
;
2375 data
->locate
.slot_offset
.constant
+= pretend_bytes
;
2376 data
->locate
.offset
.constant
+= pretend_bytes
;
2378 data
->entry_parm
= entry_parm
;
2381 /* A subroutine of assign_parms. If there is actually space on the stack
2382 for this parm, count it in stack_args_size and return true. */
2385 assign_parm_is_stack_parm (struct assign_parm_data_all
*all
,
2386 struct assign_parm_data_one
*data
)
2388 /* Trivially true if we've no incoming register. */
2389 if (data
->entry_parm
== NULL
)
2391 /* Also true if we're partially in registers and partially not,
2392 since we've arranged to drop the entire argument on the stack. */
2393 else if (data
->partial
!= 0)
2395 /* Also true if the target says that it's passed in both registers
2396 and on the stack. */
2397 else if (GET_CODE (data
->entry_parm
) == PARALLEL
2398 && XEXP (XVECEXP (data
->entry_parm
, 0, 0), 0) == NULL_RTX
)
2400 /* Also true if the target says that there's stack allocated for
2401 all register parameters. */
2402 else if (all
->reg_parm_stack_space
> 0)
2404 /* Otherwise, no, this parameter has no ABI defined stack slot. */
2408 all
->stack_args_size
.constant
+= data
->locate
.size
.constant
;
2409 if (data
->locate
.size
.var
)
2410 ADD_PARM_SIZE (all
->stack_args_size
, data
->locate
.size
.var
);
2415 /* A subroutine of assign_parms. Given that this parameter is allocated
2416 stack space by the ABI, find it. */
2419 assign_parm_find_stack_rtl (tree parm
, struct assign_parm_data_one
*data
)
2421 rtx offset_rtx
, stack_parm
;
2422 unsigned int align
, boundary
;
2424 /* If we're passing this arg using a reg, make its stack home the
2425 aligned stack slot. */
2426 if (data
->entry_parm
)
2427 offset_rtx
= ARGS_SIZE_RTX (data
->locate
.slot_offset
);
2429 offset_rtx
= ARGS_SIZE_RTX (data
->locate
.offset
);
2431 stack_parm
= crtl
->args
.internal_arg_pointer
;
2432 if (offset_rtx
!= const0_rtx
)
2433 stack_parm
= gen_rtx_PLUS (Pmode
, stack_parm
, offset_rtx
);
2434 stack_parm
= gen_rtx_MEM (data
->promoted_mode
, stack_parm
);
2436 set_mem_attributes (stack_parm
, parm
, 1);
2437 /* set_mem_attributes could set MEM_SIZE to the passed mode's size,
2438 while promoted mode's size is needed. */
2439 if (data
->promoted_mode
!= BLKmode
2440 && data
->promoted_mode
!= DECL_MODE (parm
))
2442 set_mem_size (stack_parm
, GEN_INT (GET_MODE_SIZE (data
->promoted_mode
)));
2443 if (MEM_EXPR (stack_parm
) && MEM_OFFSET (stack_parm
))
2445 int offset
= subreg_lowpart_offset (DECL_MODE (parm
),
2446 data
->promoted_mode
);
2448 set_mem_offset (stack_parm
,
2449 plus_constant (MEM_OFFSET (stack_parm
), -offset
));
2453 boundary
= data
->locate
.boundary
;
2454 align
= BITS_PER_UNIT
;
2456 /* If we're padding upward, we know that the alignment of the slot
2457 is FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
2458 intentionally forcing upward padding. Otherwise we have to come
2459 up with a guess at the alignment based on OFFSET_RTX. */
2460 if (data
->locate
.where_pad
!= downward
|| data
->entry_parm
)
2462 else if (CONST_INT_P (offset_rtx
))
2464 align
= INTVAL (offset_rtx
) * BITS_PER_UNIT
| boundary
;
2465 align
= align
& -align
;
2467 set_mem_align (stack_parm
, align
);
2469 if (data
->entry_parm
)
2470 set_reg_attrs_for_parm (data
->entry_parm
, stack_parm
);
2472 data
->stack_parm
= stack_parm
;
2475 /* A subroutine of assign_parms. Adjust DATA->ENTRY_RTL such that it's
2476 always valid and contiguous. */
2479 assign_parm_adjust_entry_rtl (struct assign_parm_data_one
*data
)
2481 rtx entry_parm
= data
->entry_parm
;
2482 rtx stack_parm
= data
->stack_parm
;
2484 /* If this parm was passed part in regs and part in memory, pretend it
2485 arrived entirely in memory by pushing the register-part onto the stack.
2486 In the special case of a DImode or DFmode that is split, we could put
2487 it together in a pseudoreg directly, but for now that's not worth
2489 if (data
->partial
!= 0)
2491 /* Handle calls that pass values in multiple non-contiguous
2492 locations. The Irix 6 ABI has examples of this. */
2493 if (GET_CODE (entry_parm
) == PARALLEL
)
2494 emit_group_store (validize_mem (stack_parm
), entry_parm
,
2496 int_size_in_bytes (data
->passed_type
));
2499 gcc_assert (data
->partial
% UNITS_PER_WORD
== 0);
2500 move_block_from_reg (REGNO (entry_parm
), validize_mem (stack_parm
),
2501 data
->partial
/ UNITS_PER_WORD
);
2504 entry_parm
= stack_parm
;
2507 /* If we didn't decide this parm came in a register, by default it came
2509 else if (entry_parm
== NULL
)
2510 entry_parm
= stack_parm
;
2512 /* When an argument is passed in multiple locations, we can't make use
2513 of this information, but we can save some copying if the whole argument
2514 is passed in a single register. */
2515 else if (GET_CODE (entry_parm
) == PARALLEL
2516 && data
->nominal_mode
!= BLKmode
2517 && data
->passed_mode
!= BLKmode
)
2519 size_t i
, len
= XVECLEN (entry_parm
, 0);
2521 for (i
= 0; i
< len
; i
++)
2522 if (XEXP (XVECEXP (entry_parm
, 0, i
), 0) != NULL_RTX
2523 && REG_P (XEXP (XVECEXP (entry_parm
, 0, i
), 0))
2524 && (GET_MODE (XEXP (XVECEXP (entry_parm
, 0, i
), 0))
2525 == data
->passed_mode
)
2526 && INTVAL (XEXP (XVECEXP (entry_parm
, 0, i
), 1)) == 0)
2528 entry_parm
= XEXP (XVECEXP (entry_parm
, 0, i
), 0);
2533 data
->entry_parm
= entry_parm
;
2536 /* A subroutine of assign_parms. Reconstitute any values which were
2537 passed in multiple registers and would fit in a single register. */
2540 assign_parm_remove_parallels (struct assign_parm_data_one
*data
)
2542 rtx entry_parm
= data
->entry_parm
;
2544 /* Convert the PARALLEL to a REG of the same mode as the parallel.
2545 This can be done with register operations rather than on the
2546 stack, even if we will store the reconstituted parameter on the
2548 if (GET_CODE (entry_parm
) == PARALLEL
&& GET_MODE (entry_parm
) != BLKmode
)
2550 rtx parmreg
= gen_reg_rtx (GET_MODE (entry_parm
));
2551 emit_group_store (parmreg
, entry_parm
, data
->passed_type
,
2552 GET_MODE_SIZE (GET_MODE (entry_parm
)));
2553 entry_parm
= parmreg
;
2556 data
->entry_parm
= entry_parm
;
2559 /* A subroutine of assign_parms. Adjust DATA->STACK_RTL such that it's
2560 always valid and properly aligned. */
2563 assign_parm_adjust_stack_rtl (struct assign_parm_data_one
*data
)
2565 rtx stack_parm
= data
->stack_parm
;
2567 /* If we can't trust the parm stack slot to be aligned enough for its
2568 ultimate type, don't use that slot after entry. We'll make another
2569 stack slot, if we need one. */
2571 && ((STRICT_ALIGNMENT
2572 && GET_MODE_ALIGNMENT (data
->nominal_mode
) > MEM_ALIGN (stack_parm
))
2573 || (data
->nominal_type
2574 && TYPE_ALIGN (data
->nominal_type
) > MEM_ALIGN (stack_parm
)
2575 && MEM_ALIGN (stack_parm
) < PREFERRED_STACK_BOUNDARY
)))
2578 /* If parm was passed in memory, and we need to convert it on entry,
2579 don't store it back in that same slot. */
2580 else if (data
->entry_parm
== stack_parm
2581 && data
->nominal_mode
!= BLKmode
2582 && data
->nominal_mode
!= data
->passed_mode
)
2585 /* If stack protection is in effect for this function, don't leave any
2586 pointers in their passed stack slots. */
2587 else if (crtl
->stack_protect_guard
2588 && (flag_stack_protect
== 2
2589 || data
->passed_pointer
2590 || POINTER_TYPE_P (data
->nominal_type
)))
2593 data
->stack_parm
= stack_parm
;
2596 /* A subroutine of assign_parms. Return true if the current parameter
2597 should be stored as a BLKmode in the current frame. */
2600 assign_parm_setup_block_p (struct assign_parm_data_one
*data
)
2602 if (data
->nominal_mode
== BLKmode
)
2604 if (GET_MODE (data
->entry_parm
) == BLKmode
)
2607 #ifdef BLOCK_REG_PADDING
2608 /* Only assign_parm_setup_block knows how to deal with register arguments
2609 that are padded at the least significant end. */
2610 if (REG_P (data
->entry_parm
)
2611 && GET_MODE_SIZE (data
->promoted_mode
) < UNITS_PER_WORD
2612 && (BLOCK_REG_PADDING (data
->passed_mode
, data
->passed_type
, 1)
2613 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
2620 /* A subroutine of assign_parms. Arrange for the parameter to be
2621 present and valid in DATA->STACK_RTL. */
2624 assign_parm_setup_block (struct assign_parm_data_all
*all
,
2625 tree parm
, struct assign_parm_data_one
*data
)
2627 rtx entry_parm
= data
->entry_parm
;
2628 rtx stack_parm
= data
->stack_parm
;
2630 HOST_WIDE_INT size_stored
;
2632 if (GET_CODE (entry_parm
) == PARALLEL
)
2633 entry_parm
= emit_group_move_into_temps (entry_parm
);
2635 size
= int_size_in_bytes (data
->passed_type
);
2636 size_stored
= CEIL_ROUND (size
, UNITS_PER_WORD
);
2637 if (stack_parm
== 0)
2639 DECL_ALIGN (parm
) = MAX (DECL_ALIGN (parm
), BITS_PER_WORD
);
2640 stack_parm
= assign_stack_local (BLKmode
, size_stored
,
2642 if (GET_MODE_SIZE (GET_MODE (entry_parm
)) == size
)
2643 PUT_MODE (stack_parm
, GET_MODE (entry_parm
));
2644 set_mem_attributes (stack_parm
, parm
, 1);
2647 /* If a BLKmode arrives in registers, copy it to a stack slot. Handle
2648 calls that pass values in multiple non-contiguous locations. */
2649 if (REG_P (entry_parm
) || GET_CODE (entry_parm
) == PARALLEL
)
2653 /* Note that we will be storing an integral number of words.
2654 So we have to be careful to ensure that we allocate an
2655 integral number of words. We do this above when we call
2656 assign_stack_local if space was not allocated in the argument
2657 list. If it was, this will not work if PARM_BOUNDARY is not
2658 a multiple of BITS_PER_WORD. It isn't clear how to fix this
2659 if it becomes a problem. Exception is when BLKmode arrives
2660 with arguments not conforming to word_mode. */
2662 if (data
->stack_parm
== 0)
2664 else if (GET_CODE (entry_parm
) == PARALLEL
)
2667 gcc_assert (!size
|| !(PARM_BOUNDARY
% BITS_PER_WORD
));
2669 mem
= validize_mem (stack_parm
);
2671 /* Handle values in multiple non-contiguous locations. */
2672 if (GET_CODE (entry_parm
) == PARALLEL
)
2674 push_to_sequence2 (all
->first_conversion_insn
,
2675 all
->last_conversion_insn
);
2676 emit_group_store (mem
, entry_parm
, data
->passed_type
, size
);
2677 all
->first_conversion_insn
= get_insns ();
2678 all
->last_conversion_insn
= get_last_insn ();
2685 /* If SIZE is that of a mode no bigger than a word, just use
2686 that mode's store operation. */
2687 else if (size
<= UNITS_PER_WORD
)
2689 enum machine_mode mode
2690 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
2693 #ifdef BLOCK_REG_PADDING
2694 && (size
== UNITS_PER_WORD
2695 || (BLOCK_REG_PADDING (mode
, data
->passed_type
, 1)
2696 != (BYTES_BIG_ENDIAN
? upward
: downward
)))
2702 /* We are really truncating a word_mode value containing
2703 SIZE bytes into a value of mode MODE. If such an
2704 operation requires no actual instructions, we can refer
2705 to the value directly in mode MODE, otherwise we must
2706 start with the register in word_mode and explicitly
2708 if (TRULY_NOOP_TRUNCATION (size
* BITS_PER_UNIT
, BITS_PER_WORD
))
2709 reg
= gen_rtx_REG (mode
, REGNO (entry_parm
));
2712 reg
= gen_rtx_REG (word_mode
, REGNO (entry_parm
));
2713 reg
= convert_to_mode (mode
, copy_to_reg (reg
), 1);
2715 emit_move_insn (change_address (mem
, mode
, 0), reg
);
2718 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
2719 machine must be aligned to the left before storing
2720 to memory. Note that the previous test doesn't
2721 handle all cases (e.g. SIZE == 3). */
2722 else if (size
!= UNITS_PER_WORD
2723 #ifdef BLOCK_REG_PADDING
2724 && (BLOCK_REG_PADDING (mode
, data
->passed_type
, 1)
2732 int by
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
2733 rtx reg
= gen_rtx_REG (word_mode
, REGNO (entry_parm
));
2735 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
,
2736 build_int_cst (NULL_TREE
, by
),
2738 tem
= change_address (mem
, word_mode
, 0);
2739 emit_move_insn (tem
, x
);
2742 move_block_from_reg (REGNO (entry_parm
), mem
,
2743 size_stored
/ UNITS_PER_WORD
);
2746 move_block_from_reg (REGNO (entry_parm
), mem
,
2747 size_stored
/ UNITS_PER_WORD
);
2749 else if (data
->stack_parm
== 0)
2751 push_to_sequence2 (all
->first_conversion_insn
, all
->last_conversion_insn
);
2752 emit_block_move (stack_parm
, data
->entry_parm
, GEN_INT (size
),
2754 all
->first_conversion_insn
= get_insns ();
2755 all
->last_conversion_insn
= get_last_insn ();
2759 data
->stack_parm
= stack_parm
;
2760 SET_DECL_RTL (parm
, stack_parm
);
2763 /* A subroutine of assign_parms. Allocate a pseudo to hold the current
2764 parameter. Get it there. Perform all ABI specified conversions. */
2767 assign_parm_setup_reg (struct assign_parm_data_all
*all
, tree parm
,
2768 struct assign_parm_data_one
*data
)
2771 enum machine_mode promoted_nominal_mode
;
2772 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (parm
));
2773 bool did_conversion
= false;
2775 /* Store the parm in a pseudoregister during the function, but we may
2776 need to do it in a wider mode. */
2778 /* This is not really promoting for a call. However we need to be
2779 consistent with assign_parm_find_data_types and expand_expr_real_1. */
2780 promoted_nominal_mode
2781 = promote_mode (data
->nominal_type
, data
->nominal_mode
, &unsignedp
, 1);
2783 parmreg
= gen_reg_rtx (promoted_nominal_mode
);
2785 if (!DECL_ARTIFICIAL (parm
))
2786 mark_user_reg (parmreg
);
2788 /* If this was an item that we received a pointer to,
2789 set DECL_RTL appropriately. */
2790 if (data
->passed_pointer
)
2792 rtx x
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data
->passed_type
)), parmreg
);
2793 set_mem_attributes (x
, parm
, 1);
2794 SET_DECL_RTL (parm
, x
);
2797 SET_DECL_RTL (parm
, parmreg
);
2799 assign_parm_remove_parallels (data
);
2801 /* Copy the value into the register. */
2802 if (data
->nominal_mode
!= data
->passed_mode
2803 || promoted_nominal_mode
!= data
->promoted_mode
)
2807 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
2808 mode, by the caller. We now have to convert it to
2809 NOMINAL_MODE, if different. However, PARMREG may be in
2810 a different mode than NOMINAL_MODE if it is being stored
2813 If ENTRY_PARM is a hard register, it might be in a register
2814 not valid for operating in its mode (e.g., an odd-numbered
2815 register for a DFmode). In that case, moves are the only
2816 thing valid, so we can't do a convert from there. This
2817 occurs when the calling sequence allow such misaligned
2820 In addition, the conversion may involve a call, which could
2821 clobber parameters which haven't been copied to pseudo
2822 registers yet. Therefore, we must first copy the parm to
2823 a pseudo reg here, and save the conversion until after all
2824 parameters have been moved. */
2826 rtx tempreg
= gen_reg_rtx (GET_MODE (data
->entry_parm
));
2828 emit_move_insn (tempreg
, validize_mem (data
->entry_parm
));
2830 push_to_sequence2 (all
->first_conversion_insn
, all
->last_conversion_insn
);
2831 tempreg
= convert_to_mode (data
->nominal_mode
, tempreg
, unsignedp
);
2833 if (GET_CODE (tempreg
) == SUBREG
2834 && GET_MODE (tempreg
) == data
->nominal_mode
2835 && REG_P (SUBREG_REG (tempreg
))
2836 && data
->nominal_mode
== data
->passed_mode
2837 && GET_MODE (SUBREG_REG (tempreg
)) == GET_MODE (data
->entry_parm
)
2838 && GET_MODE_SIZE (GET_MODE (tempreg
))
2839 < GET_MODE_SIZE (GET_MODE (data
->entry_parm
)))
2841 /* The argument is already sign/zero extended, so note it
2843 SUBREG_PROMOTED_VAR_P (tempreg
) = 1;
2844 SUBREG_PROMOTED_UNSIGNED_SET (tempreg
, unsignedp
);
2847 /* TREE_USED gets set erroneously during expand_assignment. */
2848 save_tree_used
= TREE_USED (parm
);
2849 expand_assignment (parm
, make_tree (data
->nominal_type
, tempreg
), false);
2850 TREE_USED (parm
) = save_tree_used
;
2851 all
->first_conversion_insn
= get_insns ();
2852 all
->last_conversion_insn
= get_last_insn ();
2855 did_conversion
= true;
2858 emit_move_insn (parmreg
, validize_mem (data
->entry_parm
));
2860 /* If we were passed a pointer but the actual value can safely live
2861 in a register, put it in one. */
2862 if (data
->passed_pointer
2863 && TYPE_MODE (TREE_TYPE (parm
)) != BLKmode
2864 /* If by-reference argument was promoted, demote it. */
2865 && (TYPE_MODE (TREE_TYPE (parm
)) != GET_MODE (DECL_RTL (parm
))
2866 || use_register_for_decl (parm
)))
2868 /* We can't use nominal_mode, because it will have been set to
2869 Pmode above. We must use the actual mode of the parm. */
2870 parmreg
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm
)));
2871 mark_user_reg (parmreg
);
2873 if (GET_MODE (parmreg
) != GET_MODE (DECL_RTL (parm
)))
2875 rtx tempreg
= gen_reg_rtx (GET_MODE (DECL_RTL (parm
)));
2876 int unsigned_p
= TYPE_UNSIGNED (TREE_TYPE (parm
));
2878 push_to_sequence2 (all
->first_conversion_insn
,
2879 all
->last_conversion_insn
);
2880 emit_move_insn (tempreg
, DECL_RTL (parm
));
2881 tempreg
= convert_to_mode (GET_MODE (parmreg
), tempreg
, unsigned_p
);
2882 emit_move_insn (parmreg
, tempreg
);
2883 all
->first_conversion_insn
= get_insns ();
2884 all
->last_conversion_insn
= get_last_insn ();
2887 did_conversion
= true;
2890 emit_move_insn (parmreg
, DECL_RTL (parm
));
2892 SET_DECL_RTL (parm
, parmreg
);
2894 /* STACK_PARM is the pointer, not the parm, and PARMREG is
2896 data
->stack_parm
= NULL
;
2899 /* Mark the register as eliminable if we did no conversion and it was
2900 copied from memory at a fixed offset, and the arg pointer was not
2901 copied to a pseudo-reg. If the arg pointer is a pseudo reg or the
2902 offset formed an invalid address, such memory-equivalences as we
2903 make here would screw up life analysis for it. */
2904 if (data
->nominal_mode
== data
->passed_mode
2906 && data
->stack_parm
!= 0
2907 && MEM_P (data
->stack_parm
)
2908 && data
->locate
.offset
.var
== 0
2909 && reg_mentioned_p (virtual_incoming_args_rtx
,
2910 XEXP (data
->stack_parm
, 0)))
2912 rtx linsn
= get_last_insn ();
2915 /* Mark complex types separately. */
2916 if (GET_CODE (parmreg
) == CONCAT
)
2918 enum machine_mode submode
2919 = GET_MODE_INNER (GET_MODE (parmreg
));
2920 int regnor
= REGNO (XEXP (parmreg
, 0));
2921 int regnoi
= REGNO (XEXP (parmreg
, 1));
2922 rtx stackr
= adjust_address_nv (data
->stack_parm
, submode
, 0);
2923 rtx stacki
= adjust_address_nv (data
->stack_parm
, submode
,
2924 GET_MODE_SIZE (submode
));
2926 /* Scan backwards for the set of the real and
2928 for (sinsn
= linsn
; sinsn
!= 0;
2929 sinsn
= prev_nonnote_insn (sinsn
))
2931 set
= single_set (sinsn
);
2935 if (SET_DEST (set
) == regno_reg_rtx
[regnoi
])
2936 set_unique_reg_note (sinsn
, REG_EQUIV
, stacki
);
2937 else if (SET_DEST (set
) == regno_reg_rtx
[regnor
])
2938 set_unique_reg_note (sinsn
, REG_EQUIV
, stackr
);
2941 else if ((set
= single_set (linsn
)) != 0
2942 && SET_DEST (set
) == parmreg
)
2943 set_unique_reg_note (linsn
, REG_EQUIV
, data
->stack_parm
);
2946 /* For pointer data type, suggest pointer register. */
2947 if (POINTER_TYPE_P (TREE_TYPE (parm
)))
2948 mark_reg_pointer (parmreg
,
2949 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
))));
2952 /* A subroutine of assign_parms. Allocate stack space to hold the current
2953 parameter. Get it there. Perform all ABI specified conversions. */
2956 assign_parm_setup_stack (struct assign_parm_data_all
*all
, tree parm
,
2957 struct assign_parm_data_one
*data
)
2959 /* Value must be stored in the stack slot STACK_PARM during function
2961 bool to_conversion
= false;
2963 assign_parm_remove_parallels (data
);
2965 if (data
->promoted_mode
!= data
->nominal_mode
)
2967 /* Conversion is required. */
2968 rtx tempreg
= gen_reg_rtx (GET_MODE (data
->entry_parm
));
2970 emit_move_insn (tempreg
, validize_mem (data
->entry_parm
));
2972 push_to_sequence2 (all
->first_conversion_insn
, all
->last_conversion_insn
);
2973 to_conversion
= true;
2975 data
->entry_parm
= convert_to_mode (data
->nominal_mode
, tempreg
,
2976 TYPE_UNSIGNED (TREE_TYPE (parm
)));
2978 if (data
->stack_parm
)
2980 int offset
= subreg_lowpart_offset (data
->nominal_mode
,
2981 GET_MODE (data
->stack_parm
));
2982 /* ??? This may need a big-endian conversion on sparc64. */
2984 = adjust_address (data
->stack_parm
, data
->nominal_mode
, 0);
2985 if (offset
&& MEM_OFFSET (data
->stack_parm
))
2986 set_mem_offset (data
->stack_parm
,
2987 plus_constant (MEM_OFFSET (data
->stack_parm
),
2992 if (data
->entry_parm
!= data
->stack_parm
)
2996 if (data
->stack_parm
== 0)
2998 int align
= STACK_SLOT_ALIGNMENT (data
->passed_type
,
2999 GET_MODE (data
->entry_parm
),
3000 TYPE_ALIGN (data
->passed_type
));
3002 = assign_stack_local (GET_MODE (data
->entry_parm
),
3003 GET_MODE_SIZE (GET_MODE (data
->entry_parm
)),
3005 set_mem_attributes (data
->stack_parm
, parm
, 1);
3008 dest
= validize_mem (data
->stack_parm
);
3009 src
= validize_mem (data
->entry_parm
);
3013 /* Use a block move to handle potentially misaligned entry_parm. */
3015 push_to_sequence2 (all
->first_conversion_insn
,
3016 all
->last_conversion_insn
);
3017 to_conversion
= true;
3019 emit_block_move (dest
, src
,
3020 GEN_INT (int_size_in_bytes (data
->passed_type
)),
3024 emit_move_insn (dest
, src
);
3029 all
->first_conversion_insn
= get_insns ();
3030 all
->last_conversion_insn
= get_last_insn ();
3034 SET_DECL_RTL (parm
, data
->stack_parm
);
3037 /* A subroutine of assign_parms. If the ABI splits complex arguments, then
3038 undo the frobbing that we did in assign_parms_augmented_arg_list. */
3041 assign_parms_unsplit_complex (struct assign_parm_data_all
*all
, tree fnargs
)
3044 tree orig_fnargs
= all
->orig_fnargs
;
3046 for (parm
= orig_fnargs
; parm
; parm
= TREE_CHAIN (parm
))
3048 if (TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
3049 && targetm
.calls
.split_complex_arg (TREE_TYPE (parm
)))
3051 rtx tmp
, real
, imag
;
3052 enum machine_mode inner
= GET_MODE_INNER (DECL_MODE (parm
));
3054 real
= DECL_RTL (fnargs
);
3055 imag
= DECL_RTL (TREE_CHAIN (fnargs
));
3056 if (inner
!= GET_MODE (real
))
3058 real
= gen_lowpart_SUBREG (inner
, real
);
3059 imag
= gen_lowpart_SUBREG (inner
, imag
);
3062 if (TREE_ADDRESSABLE (parm
))
3065 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (parm
));
3066 int align
= STACK_SLOT_ALIGNMENT (TREE_TYPE (parm
),
3068 TYPE_ALIGN (TREE_TYPE (parm
)));
3070 /* split_complex_arg put the real and imag parts in
3071 pseudos. Move them to memory. */
3072 tmp
= assign_stack_local (DECL_MODE (parm
), size
, align
);
3073 set_mem_attributes (tmp
, parm
, 1);
3074 rmem
= adjust_address_nv (tmp
, inner
, 0);
3075 imem
= adjust_address_nv (tmp
, inner
, GET_MODE_SIZE (inner
));
3076 push_to_sequence2 (all
->first_conversion_insn
,
3077 all
->last_conversion_insn
);
3078 emit_move_insn (rmem
, real
);
3079 emit_move_insn (imem
, imag
);
3080 all
->first_conversion_insn
= get_insns ();
3081 all
->last_conversion_insn
= get_last_insn ();
3085 tmp
= gen_rtx_CONCAT (DECL_MODE (parm
), real
, imag
);
3086 SET_DECL_RTL (parm
, tmp
);
3088 real
= DECL_INCOMING_RTL (fnargs
);
3089 imag
= DECL_INCOMING_RTL (TREE_CHAIN (fnargs
));
3090 if (inner
!= GET_MODE (real
))
3092 real
= gen_lowpart_SUBREG (inner
, real
);
3093 imag
= gen_lowpart_SUBREG (inner
, imag
);
3095 tmp
= gen_rtx_CONCAT (DECL_MODE (parm
), real
, imag
);
3096 set_decl_incoming_rtl (parm
, tmp
, false);
3097 fnargs
= TREE_CHAIN (fnargs
);
3101 SET_DECL_RTL (parm
, DECL_RTL (fnargs
));
3102 set_decl_incoming_rtl (parm
, DECL_INCOMING_RTL (fnargs
), false);
3104 /* Set MEM_EXPR to the original decl, i.e. to PARM,
3105 instead of the copy of decl, i.e. FNARGS. */
3106 if (DECL_INCOMING_RTL (parm
) && MEM_P (DECL_INCOMING_RTL (parm
)))
3107 set_mem_expr (DECL_INCOMING_RTL (parm
), parm
);
3110 fnargs
= TREE_CHAIN (fnargs
);
3114 /* Assign RTL expressions to the function's parameters. This may involve
3115 copying them into registers and using those registers as the DECL_RTL. */
3118 assign_parms (tree fndecl
)
3120 struct assign_parm_data_all all
;
3123 crtl
->args
.internal_arg_pointer
3124 = targetm
.calls
.internal_arg_pointer ();
3126 assign_parms_initialize_all (&all
);
3127 fnargs
= assign_parms_augmented_arg_list (&all
);
3129 for (parm
= fnargs
; parm
; parm
= TREE_CHAIN (parm
))
3131 struct assign_parm_data_one data
;
3133 /* Extract the type of PARM; adjust it according to ABI. */
3134 assign_parm_find_data_types (&all
, parm
, &data
);
3136 /* Early out for errors and void parameters. */
3137 if (data
.passed_mode
== VOIDmode
)
3139 SET_DECL_RTL (parm
, const0_rtx
);
3140 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
);
3144 /* Estimate stack alignment from parameter alignment. */
3145 if (SUPPORTS_STACK_ALIGNMENT
)
3147 unsigned int align
= FUNCTION_ARG_BOUNDARY (data
.promoted_mode
,
3149 if (TYPE_ALIGN (data
.nominal_type
) > align
)
3150 align
= TYPE_ALIGN (data
.passed_type
);
3151 if (crtl
->stack_alignment_estimated
< align
)
3153 gcc_assert (!crtl
->stack_realign_processed
);
3154 crtl
->stack_alignment_estimated
= align
;
3158 if (cfun
->stdarg
&& !TREE_CHAIN (parm
))
3159 assign_parms_setup_varargs (&all
, &data
, false);
3161 /* Find out where the parameter arrives in this function. */
3162 assign_parm_find_entry_rtl (&all
, &data
);
3164 /* Find out where stack space for this parameter might be. */
3165 if (assign_parm_is_stack_parm (&all
, &data
))
3167 assign_parm_find_stack_rtl (parm
, &data
);
3168 assign_parm_adjust_entry_rtl (&data
);
3171 /* Record permanently how this parm was passed. */
3172 set_decl_incoming_rtl (parm
, data
.entry_parm
, data
.passed_pointer
);
3174 /* Update info on where next arg arrives in registers. */
3175 FUNCTION_ARG_ADVANCE (all
.args_so_far
, data
.promoted_mode
,
3176 data
.passed_type
, data
.named_arg
);
3178 assign_parm_adjust_stack_rtl (&data
);
3180 if (assign_parm_setup_block_p (&data
))
3181 assign_parm_setup_block (&all
, parm
, &data
);
3182 else if (data
.passed_pointer
|| use_register_for_decl (parm
))
3183 assign_parm_setup_reg (&all
, parm
, &data
);
3185 assign_parm_setup_stack (&all
, parm
, &data
);
3188 if (targetm
.calls
.split_complex_arg
&& fnargs
!= all
.orig_fnargs
)
3189 assign_parms_unsplit_complex (&all
, fnargs
);
3191 /* Output all parameter conversion instructions (possibly including calls)
3192 now that all parameters have been copied out of hard registers. */
3193 emit_insn (all
.first_conversion_insn
);
3195 /* Estimate reload stack alignment from scalar return mode. */
3196 if (SUPPORTS_STACK_ALIGNMENT
)
3198 if (DECL_RESULT (fndecl
))
3200 tree type
= TREE_TYPE (DECL_RESULT (fndecl
));
3201 enum machine_mode mode
= TYPE_MODE (type
);
3205 && !AGGREGATE_TYPE_P (type
))
3207 unsigned int align
= GET_MODE_ALIGNMENT (mode
);
3208 if (crtl
->stack_alignment_estimated
< align
)
3210 gcc_assert (!crtl
->stack_realign_processed
);
3211 crtl
->stack_alignment_estimated
= align
;
3217 /* If we are receiving a struct value address as the first argument, set up
3218 the RTL for the function result. As this might require code to convert
3219 the transmitted address to Pmode, we do this here to ensure that possible
3220 preliminary conversions of the address have been emitted already. */
3221 if (all
.function_result_decl
)
3223 tree result
= DECL_RESULT (current_function_decl
);
3224 rtx addr
= DECL_RTL (all
.function_result_decl
);
3227 if (DECL_BY_REFERENCE (result
))
3231 addr
= convert_memory_address (Pmode
, addr
);
3232 x
= gen_rtx_MEM (DECL_MODE (result
), addr
);
3233 set_mem_attributes (x
, result
, 1);
3235 SET_DECL_RTL (result
, x
);
3238 /* We have aligned all the args, so add space for the pretend args. */
3239 crtl
->args
.pretend_args_size
= all
.pretend_args_size
;
3240 all
.stack_args_size
.constant
+= all
.extra_pretend_bytes
;
3241 crtl
->args
.size
= all
.stack_args_size
.constant
;
3243 /* Adjust function incoming argument size for alignment and
3246 #ifdef REG_PARM_STACK_SPACE
3247 crtl
->args
.size
= MAX (crtl
->args
.size
,
3248 REG_PARM_STACK_SPACE (fndecl
));
3251 crtl
->args
.size
= CEIL_ROUND (crtl
->args
.size
,
3252 PARM_BOUNDARY
/ BITS_PER_UNIT
);
3254 #ifdef ARGS_GROW_DOWNWARD
3255 crtl
->args
.arg_offset_rtx
3256 = (all
.stack_args_size
.var
== 0 ? GEN_INT (-all
.stack_args_size
.constant
)
3257 : expand_expr (size_diffop (all
.stack_args_size
.var
,
3258 size_int (-all
.stack_args_size
.constant
)),
3259 NULL_RTX
, VOIDmode
, EXPAND_NORMAL
));
3261 crtl
->args
.arg_offset_rtx
= ARGS_SIZE_RTX (all
.stack_args_size
);
3264 /* See how many bytes, if any, of its args a function should try to pop
3267 crtl
->args
.pops_args
= RETURN_POPS_ARGS (fndecl
, TREE_TYPE (fndecl
),
3270 /* For stdarg.h function, save info about
3271 regs and stack space used by the named args. */
3273 crtl
->args
.info
= all
.args_so_far
;
3275 /* Set the rtx used for the function return value. Put this in its
3276 own variable so any optimizers that need this information don't have
3277 to include tree.h. Do this here so it gets done when an inlined
3278 function gets output. */
3281 = (DECL_RTL_SET_P (DECL_RESULT (fndecl
))
3282 ? DECL_RTL (DECL_RESULT (fndecl
)) : NULL_RTX
);
3284 /* If scalar return value was computed in a pseudo-reg, or was a named
3285 return value that got dumped to the stack, copy that to the hard
3287 if (DECL_RTL_SET_P (DECL_RESULT (fndecl
)))
3289 tree decl_result
= DECL_RESULT (fndecl
);
3290 rtx decl_rtl
= DECL_RTL (decl_result
);
3292 if (REG_P (decl_rtl
)
3293 ? REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
3294 : DECL_REGISTER (decl_result
))
3298 real_decl_rtl
= targetm
.calls
.function_value (TREE_TYPE (decl_result
),
3300 REG_FUNCTION_VALUE_P (real_decl_rtl
) = 1;
3301 /* The delay slot scheduler assumes that crtl->return_rtx
3302 holds the hard register containing the return value, not a
3303 temporary pseudo. */
3304 crtl
->return_rtx
= real_decl_rtl
;
3309 /* A subroutine of gimplify_parameters, invoked via walk_tree.
3310 For all seen types, gimplify their sizes. */
3313 gimplify_parm_type (tree
*tp
, int *walk_subtrees
, void *data
)
3320 if (POINTER_TYPE_P (t
))
3322 else if (TYPE_SIZE (t
) && !TREE_CONSTANT (TYPE_SIZE (t
))
3323 && !TYPE_SIZES_GIMPLIFIED (t
))
3325 gimplify_type_sizes (t
, (gimple_seq
*) data
);
3333 /* Gimplify the parameter list for current_function_decl. This involves
3334 evaluating SAVE_EXPRs of variable sized parameters and generating code
3335 to implement callee-copies reference parameters. Returns a sequence of
3336 statements to add to the beginning of the function. */
3339 gimplify_parameters (void)
3341 struct assign_parm_data_all all
;
3343 gimple_seq stmts
= NULL
;
3345 assign_parms_initialize_all (&all
);
3346 fnargs
= assign_parms_augmented_arg_list (&all
);
3348 for (parm
= fnargs
; parm
; parm
= TREE_CHAIN (parm
))
3350 struct assign_parm_data_one data
;
3352 /* Extract the type of PARM; adjust it according to ABI. */
3353 assign_parm_find_data_types (&all
, parm
, &data
);
3355 /* Early out for errors and void parameters. */
3356 if (data
.passed_mode
== VOIDmode
|| DECL_SIZE (parm
) == NULL
)
3359 /* Update info on where next arg arrives in registers. */
3360 FUNCTION_ARG_ADVANCE (all
.args_so_far
, data
.promoted_mode
,
3361 data
.passed_type
, data
.named_arg
);
3363 /* ??? Once upon a time variable_size stuffed parameter list
3364 SAVE_EXPRs (amongst others) onto a pending sizes list. This
3365 turned out to be less than manageable in the gimple world.
3366 Now we have to hunt them down ourselves. */
3367 walk_tree_without_duplicates (&data
.passed_type
,
3368 gimplify_parm_type
, &stmts
);
3370 if (TREE_CODE (DECL_SIZE_UNIT (parm
)) != INTEGER_CST
)
3372 gimplify_one_sizepos (&DECL_SIZE (parm
), &stmts
);
3373 gimplify_one_sizepos (&DECL_SIZE_UNIT (parm
), &stmts
);
3376 if (data
.passed_pointer
)
3378 tree type
= TREE_TYPE (data
.passed_type
);
3379 if (reference_callee_copied (&all
.args_so_far
, TYPE_MODE (type
),
3380 type
, data
.named_arg
))
3384 /* For constant-sized objects, this is trivial; for
3385 variable-sized objects, we have to play games. */
3386 if (TREE_CODE (DECL_SIZE_UNIT (parm
)) == INTEGER_CST
3387 && !(flag_stack_check
== GENERIC_STACK_CHECK
3388 && compare_tree_int (DECL_SIZE_UNIT (parm
),
3389 STACK_CHECK_MAX_VAR_SIZE
) > 0))
3391 local
= create_tmp_var (type
, get_name (parm
));
3392 DECL_IGNORED_P (local
) = 0;
3393 /* If PARM was addressable, move that flag over
3394 to the local copy, as its address will be taken,
3396 if (TREE_ADDRESSABLE (parm
))
3398 TREE_ADDRESSABLE (parm
) = 0;
3399 TREE_ADDRESSABLE (local
) = 1;
3404 tree ptr_type
, addr
;
3406 ptr_type
= build_pointer_type (type
);
3407 addr
= create_tmp_var (ptr_type
, get_name (parm
));
3408 DECL_IGNORED_P (addr
) = 0;
3409 local
= build_fold_indirect_ref (addr
);
3411 t
= built_in_decls
[BUILT_IN_ALLOCA
];
3412 t
= build_call_expr (t
, 1, DECL_SIZE_UNIT (parm
));
3413 t
= fold_convert (ptr_type
, t
);
3414 t
= build2 (MODIFY_EXPR
, TREE_TYPE (addr
), addr
, t
);
3415 gimplify_and_add (t
, &stmts
);
3418 gimplify_assign (local
, parm
, &stmts
);
3420 SET_DECL_VALUE_EXPR (parm
, local
);
3421 DECL_HAS_VALUE_EXPR_P (parm
) = 1;
3429 /* Compute the size and offset from the start of the stacked arguments for a
3430 parm passed in mode PASSED_MODE and with type TYPE.
3432 INITIAL_OFFSET_PTR points to the current offset into the stacked
3435 The starting offset and size for this parm are returned in
3436 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
3437 nonzero, the offset is that of stack slot, which is returned in
3438 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
3439 padding required from the initial offset ptr to the stack slot.
3441 IN_REGS is nonzero if the argument will be passed in registers. It will
3442 never be set if REG_PARM_STACK_SPACE is not defined.
3444 FNDECL is the function in which the argument was defined.
3446 There are two types of rounding that are done. The first, controlled by
3447 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
3448 list to be aligned to the specific boundary (in bits). This rounding
3449 affects the initial and starting offsets, but not the argument size.
3451 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
3452 optionally rounds the size of the parm to PARM_BOUNDARY. The
3453 initial offset is not affected by this rounding, while the size always
3454 is and the starting offset may be. */
3456 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
3457 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
3458 callers pass in the total size of args so far as
3459 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
3462 locate_and_pad_parm (enum machine_mode passed_mode
, tree type
, int in_regs
,
3463 int partial
, tree fndecl ATTRIBUTE_UNUSED
,
3464 struct args_size
*initial_offset_ptr
,
3465 struct locate_and_pad_arg_data
*locate
)
3468 enum direction where_pad
;
3469 unsigned int boundary
;
3470 int reg_parm_stack_space
= 0;
3471 int part_size_in_regs
;
3473 #ifdef REG_PARM_STACK_SPACE
3474 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
3476 /* If we have found a stack parm before we reach the end of the
3477 area reserved for registers, skip that area. */
3480 if (reg_parm_stack_space
> 0)
3482 if (initial_offset_ptr
->var
)
3484 initial_offset_ptr
->var
3485 = size_binop (MAX_EXPR
, ARGS_SIZE_TREE (*initial_offset_ptr
),
3486 ssize_int (reg_parm_stack_space
));
3487 initial_offset_ptr
->constant
= 0;
3489 else if (initial_offset_ptr
->constant
< reg_parm_stack_space
)
3490 initial_offset_ptr
->constant
= reg_parm_stack_space
;
3493 #endif /* REG_PARM_STACK_SPACE */
3495 part_size_in_regs
= (reg_parm_stack_space
== 0 ? partial
: 0);
3498 = type
? size_in_bytes (type
) : size_int (GET_MODE_SIZE (passed_mode
));
3499 where_pad
= FUNCTION_ARG_PADDING (passed_mode
, type
);
3500 boundary
= FUNCTION_ARG_BOUNDARY (passed_mode
, type
);
3501 locate
->where_pad
= where_pad
;
3503 /* Alignment can't exceed MAX_SUPPORTED_STACK_ALIGNMENT. */
3504 if (boundary
> MAX_SUPPORTED_STACK_ALIGNMENT
)
3505 boundary
= MAX_SUPPORTED_STACK_ALIGNMENT
;
3507 locate
->boundary
= boundary
;
3509 if (SUPPORTS_STACK_ALIGNMENT
)
3511 /* stack_alignment_estimated can't change after stack has been
3513 if (crtl
->stack_alignment_estimated
< boundary
)
3515 if (!crtl
->stack_realign_processed
)
3516 crtl
->stack_alignment_estimated
= boundary
;
3519 /* If stack is realigned and stack alignment value
3520 hasn't been finalized, it is OK not to increase
3521 stack_alignment_estimated. The bigger alignment
3522 requirement is recorded in stack_alignment_needed
3524 gcc_assert (!crtl
->stack_realign_finalized
3525 && crtl
->stack_realign_needed
);
3530 /* Remember if the outgoing parameter requires extra alignment on the
3531 calling function side. */
3532 if (crtl
->stack_alignment_needed
< boundary
)
3533 crtl
->stack_alignment_needed
= boundary
;
3534 if (crtl
->preferred_stack_boundary
< boundary
)
3535 crtl
->preferred_stack_boundary
= boundary
;
3537 #ifdef ARGS_GROW_DOWNWARD
3538 locate
->slot_offset
.constant
= -initial_offset_ptr
->constant
;
3539 if (initial_offset_ptr
->var
)
3540 locate
->slot_offset
.var
= size_binop (MINUS_EXPR
, ssize_int (0),
3541 initial_offset_ptr
->var
);
3545 if (where_pad
!= none
3546 && (!host_integerp (sizetree
, 1)
3547 || (tree_low_cst (sizetree
, 1) * BITS_PER_UNIT
) % PARM_BOUNDARY
))
3548 s2
= round_up (s2
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
3549 SUB_PARM_SIZE (locate
->slot_offset
, s2
);
3552 locate
->slot_offset
.constant
+= part_size_in_regs
;
3555 #ifdef REG_PARM_STACK_SPACE
3556 || REG_PARM_STACK_SPACE (fndecl
) > 0
3559 pad_to_arg_alignment (&locate
->slot_offset
, boundary
,
3560 &locate
->alignment_pad
);
3562 locate
->size
.constant
= (-initial_offset_ptr
->constant
3563 - locate
->slot_offset
.constant
);
3564 if (initial_offset_ptr
->var
)
3565 locate
->size
.var
= size_binop (MINUS_EXPR
,
3566 size_binop (MINUS_EXPR
,
3568 initial_offset_ptr
->var
),
3569 locate
->slot_offset
.var
);
3571 /* Pad_below needs the pre-rounded size to know how much to pad
3573 locate
->offset
= locate
->slot_offset
;
3574 if (where_pad
== downward
)
3575 pad_below (&locate
->offset
, passed_mode
, sizetree
);
3577 #else /* !ARGS_GROW_DOWNWARD */
3579 #ifdef REG_PARM_STACK_SPACE
3580 || REG_PARM_STACK_SPACE (fndecl
) > 0
3583 pad_to_arg_alignment (initial_offset_ptr
, boundary
,
3584 &locate
->alignment_pad
);
3585 locate
->slot_offset
= *initial_offset_ptr
;
3587 #ifdef PUSH_ROUNDING
3588 if (passed_mode
!= BLKmode
)
3589 sizetree
= size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree
)));
3592 /* Pad_below needs the pre-rounded size to know how much to pad below
3593 so this must be done before rounding up. */
3594 locate
->offset
= locate
->slot_offset
;
3595 if (where_pad
== downward
)
3596 pad_below (&locate
->offset
, passed_mode
, sizetree
);
3598 if (where_pad
!= none
3599 && (!host_integerp (sizetree
, 1)
3600 || (tree_low_cst (sizetree
, 1) * BITS_PER_UNIT
) % PARM_BOUNDARY
))
3601 sizetree
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
3603 ADD_PARM_SIZE (locate
->size
, sizetree
);
3605 locate
->size
.constant
-= part_size_in_regs
;
3606 #endif /* ARGS_GROW_DOWNWARD */
3608 #ifdef FUNCTION_ARG_OFFSET
3609 locate
->offset
.constant
+= FUNCTION_ARG_OFFSET (passed_mode
, type
);
3613 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
3614 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
3617 pad_to_arg_alignment (struct args_size
*offset_ptr
, int boundary
,
3618 struct args_size
*alignment_pad
)
3620 tree save_var
= NULL_TREE
;
3621 HOST_WIDE_INT save_constant
= 0;
3622 int boundary_in_bytes
= boundary
/ BITS_PER_UNIT
;
3623 HOST_WIDE_INT sp_offset
= STACK_POINTER_OFFSET
;
3625 #ifdef SPARC_STACK_BOUNDARY_HACK
3626 /* ??? The SPARC port may claim a STACK_BOUNDARY higher than
3627 the real alignment of %sp. However, when it does this, the
3628 alignment of %sp+STACK_POINTER_OFFSET is STACK_BOUNDARY. */
3629 if (SPARC_STACK_BOUNDARY_HACK
)
3633 if (boundary
> PARM_BOUNDARY
)
3635 save_var
= offset_ptr
->var
;
3636 save_constant
= offset_ptr
->constant
;
3639 alignment_pad
->var
= NULL_TREE
;
3640 alignment_pad
->constant
= 0;
3642 if (boundary
> BITS_PER_UNIT
)
3644 if (offset_ptr
->var
)
3646 tree sp_offset_tree
= ssize_int (sp_offset
);
3647 tree offset
= size_binop (PLUS_EXPR
,
3648 ARGS_SIZE_TREE (*offset_ptr
),
3650 #ifdef ARGS_GROW_DOWNWARD
3651 tree rounded
= round_down (offset
, boundary
/ BITS_PER_UNIT
);
3653 tree rounded
= round_up (offset
, boundary
/ BITS_PER_UNIT
);
3656 offset_ptr
->var
= size_binop (MINUS_EXPR
, rounded
, sp_offset_tree
);
3657 /* ARGS_SIZE_TREE includes constant term. */
3658 offset_ptr
->constant
= 0;
3659 if (boundary
> PARM_BOUNDARY
)
3660 alignment_pad
->var
= size_binop (MINUS_EXPR
, offset_ptr
->var
,
3665 offset_ptr
->constant
= -sp_offset
+
3666 #ifdef ARGS_GROW_DOWNWARD
3667 FLOOR_ROUND (offset_ptr
->constant
+ sp_offset
, boundary_in_bytes
);
3669 CEIL_ROUND (offset_ptr
->constant
+ sp_offset
, boundary_in_bytes
);
3671 if (boundary
> PARM_BOUNDARY
)
3672 alignment_pad
->constant
= offset_ptr
->constant
- save_constant
;
3678 pad_below (struct args_size
*offset_ptr
, enum machine_mode passed_mode
, tree sizetree
)
3680 if (passed_mode
!= BLKmode
)
3682 if (GET_MODE_BITSIZE (passed_mode
) % PARM_BOUNDARY
)
3683 offset_ptr
->constant
3684 += (((GET_MODE_BITSIZE (passed_mode
) + PARM_BOUNDARY
- 1)
3685 / PARM_BOUNDARY
* PARM_BOUNDARY
/ BITS_PER_UNIT
)
3686 - GET_MODE_SIZE (passed_mode
));
3690 if (TREE_CODE (sizetree
) != INTEGER_CST
3691 || (TREE_INT_CST_LOW (sizetree
) * BITS_PER_UNIT
) % PARM_BOUNDARY
)
3693 /* Round the size up to multiple of PARM_BOUNDARY bits. */
3694 tree s2
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
3696 ADD_PARM_SIZE (*offset_ptr
, s2
);
3697 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
3703 /* True if register REGNO was alive at a place where `setjmp' was
3704 called and was set more than once or is an argument. Such regs may
3705 be clobbered by `longjmp'. */
3708 regno_clobbered_at_setjmp (bitmap setjmp_crosses
, int regno
)
3710 /* There appear to be cases where some local vars never reach the
3711 backend but have bogus regnos. */
3712 if (regno
>= max_reg_num ())
3715 return ((REG_N_SETS (regno
) > 1
3716 || REGNO_REG_SET_P (df_get_live_out (ENTRY_BLOCK_PTR
), regno
))
3717 && REGNO_REG_SET_P (setjmp_crosses
, regno
));
3720 /* Walk the tree of blocks describing the binding levels within a
3721 function and warn about variables the might be killed by setjmp or
3722 vfork. This is done after calling flow_analysis before register
3723 allocation since that will clobber the pseudo-regs to hard
3727 setjmp_vars_warning (bitmap setjmp_crosses
, tree block
)
3731 for (decl
= BLOCK_VARS (block
); decl
; decl
= TREE_CHAIN (decl
))
3733 if (TREE_CODE (decl
) == VAR_DECL
3734 && DECL_RTL_SET_P (decl
)
3735 && REG_P (DECL_RTL (decl
))
3736 && regno_clobbered_at_setjmp (setjmp_crosses
, REGNO (DECL_RTL (decl
))))
3737 warning (OPT_Wclobbered
, "variable %q+D might be clobbered by"
3738 " %<longjmp%> or %<vfork%>", decl
);
3741 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= BLOCK_CHAIN (sub
))
3742 setjmp_vars_warning (setjmp_crosses
, sub
);
3745 /* Do the appropriate part of setjmp_vars_warning
3746 but for arguments instead of local variables. */
3749 setjmp_args_warning (bitmap setjmp_crosses
)
3752 for (decl
= DECL_ARGUMENTS (current_function_decl
);
3753 decl
; decl
= TREE_CHAIN (decl
))
3754 if (DECL_RTL (decl
) != 0
3755 && REG_P (DECL_RTL (decl
))
3756 && regno_clobbered_at_setjmp (setjmp_crosses
, REGNO (DECL_RTL (decl
))))
3757 warning (OPT_Wclobbered
,
3758 "argument %q+D might be clobbered by %<longjmp%> or %<vfork%>",
3762 /* Generate warning messages for variables live across setjmp. */
3765 generate_setjmp_warnings (void)
3767 bitmap setjmp_crosses
= regstat_get_setjmp_crosses ();
3769 if (n_basic_blocks
== NUM_FIXED_BLOCKS
3770 || bitmap_empty_p (setjmp_crosses
))
3773 setjmp_vars_warning (setjmp_crosses
, DECL_INITIAL (current_function_decl
));
3774 setjmp_args_warning (setjmp_crosses
);
3778 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
3779 and create duplicate blocks. */
3780 /* ??? Need an option to either create block fragments or to create
3781 abstract origin duplicates of a source block. It really depends
3782 on what optimization has been performed. */
3785 reorder_blocks (void)
3787 tree block
= DECL_INITIAL (current_function_decl
);
3788 VEC(tree
,heap
) *block_stack
;
3790 if (block
== NULL_TREE
)
3793 block_stack
= VEC_alloc (tree
, heap
, 10);
3795 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
3796 clear_block_marks (block
);
3798 /* Prune the old trees away, so that they don't get in the way. */
3799 BLOCK_SUBBLOCKS (block
) = NULL_TREE
;
3800 BLOCK_CHAIN (block
) = NULL_TREE
;
3802 /* Recreate the block tree from the note nesting. */
3803 reorder_blocks_1 (get_insns (), block
, &block_stack
);
3804 BLOCK_SUBBLOCKS (block
) = blocks_nreverse (BLOCK_SUBBLOCKS (block
));
3806 VEC_free (tree
, heap
, block_stack
);
3809 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
3812 clear_block_marks (tree block
)
3816 TREE_ASM_WRITTEN (block
) = 0;
3817 clear_block_marks (BLOCK_SUBBLOCKS (block
));
3818 block
= BLOCK_CHAIN (block
);
3823 reorder_blocks_1 (rtx insns
, tree current_block
, VEC(tree
,heap
) **p_block_stack
)
3827 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
3831 if (NOTE_KIND (insn
) == NOTE_INSN_BLOCK_BEG
)
3833 tree block
= NOTE_BLOCK (insn
);
3836 origin
= (BLOCK_FRAGMENT_ORIGIN (block
)
3837 ? BLOCK_FRAGMENT_ORIGIN (block
)
3840 /* If we have seen this block before, that means it now
3841 spans multiple address regions. Create a new fragment. */
3842 if (TREE_ASM_WRITTEN (block
))
3844 tree new_block
= copy_node (block
);
3846 BLOCK_FRAGMENT_ORIGIN (new_block
) = origin
;
3847 BLOCK_FRAGMENT_CHAIN (new_block
)
3848 = BLOCK_FRAGMENT_CHAIN (origin
);
3849 BLOCK_FRAGMENT_CHAIN (origin
) = new_block
;
3851 NOTE_BLOCK (insn
) = new_block
;
3855 BLOCK_SUBBLOCKS (block
) = 0;
3856 TREE_ASM_WRITTEN (block
) = 1;
3857 /* When there's only one block for the entire function,
3858 current_block == block and we mustn't do this, it
3859 will cause infinite recursion. */
3860 if (block
!= current_block
)
3862 if (block
!= origin
)
3863 gcc_assert (BLOCK_SUPERCONTEXT (origin
) == current_block
);
3865 BLOCK_SUPERCONTEXT (block
) = current_block
;
3866 BLOCK_CHAIN (block
) = BLOCK_SUBBLOCKS (current_block
);
3867 BLOCK_SUBBLOCKS (current_block
) = block
;
3868 current_block
= origin
;
3870 VEC_safe_push (tree
, heap
, *p_block_stack
, block
);
3872 else if (NOTE_KIND (insn
) == NOTE_INSN_BLOCK_END
)
3874 NOTE_BLOCK (insn
) = VEC_pop (tree
, *p_block_stack
);
3875 BLOCK_SUBBLOCKS (current_block
)
3876 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block
));
3877 current_block
= BLOCK_SUPERCONTEXT (current_block
);
3883 /* Reverse the order of elements in the chain T of blocks,
3884 and return the new head of the chain (old last element). */
3887 blocks_nreverse (tree t
)
3889 tree prev
= 0, decl
, next
;
3890 for (decl
= t
; decl
; decl
= next
)
3892 next
= BLOCK_CHAIN (decl
);
3893 BLOCK_CHAIN (decl
) = prev
;
3899 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
3900 non-NULL, list them all into VECTOR, in a depth-first preorder
3901 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
3905 all_blocks (tree block
, tree
*vector
)
3911 TREE_ASM_WRITTEN (block
) = 0;
3913 /* Record this block. */
3915 vector
[n_blocks
] = block
;
3919 /* Record the subblocks, and their subblocks... */
3920 n_blocks
+= all_blocks (BLOCK_SUBBLOCKS (block
),
3921 vector
? vector
+ n_blocks
: 0);
3922 block
= BLOCK_CHAIN (block
);
3928 /* Return a vector containing all the blocks rooted at BLOCK. The
3929 number of elements in the vector is stored in N_BLOCKS_P. The
3930 vector is dynamically allocated; it is the caller's responsibility
3931 to call `free' on the pointer returned. */
3934 get_block_vector (tree block
, int *n_blocks_p
)
3938 *n_blocks_p
= all_blocks (block
, NULL
);
3939 block_vector
= XNEWVEC (tree
, *n_blocks_p
);
3940 all_blocks (block
, block_vector
);
3942 return block_vector
;
3945 static GTY(()) int next_block_index
= 2;
3947 /* Set BLOCK_NUMBER for all the blocks in FN. */
3950 number_blocks (tree fn
)
3956 /* For SDB and XCOFF debugging output, we start numbering the blocks
3957 from 1 within each function, rather than keeping a running
3959 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
3960 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
3961 next_block_index
= 1;
3964 block_vector
= get_block_vector (DECL_INITIAL (fn
), &n_blocks
);
3966 /* The top-level BLOCK isn't numbered at all. */
3967 for (i
= 1; i
< n_blocks
; ++i
)
3968 /* We number the blocks from two. */
3969 BLOCK_NUMBER (block_vector
[i
]) = next_block_index
++;
3971 free (block_vector
);
3976 /* If VAR is present in a subblock of BLOCK, return the subblock. */
3979 debug_find_var_in_block_tree (tree var
, tree block
)
3983 for (t
= BLOCK_VARS (block
); t
; t
= TREE_CHAIN (t
))
3987 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= TREE_CHAIN (t
))
3989 tree ret
= debug_find_var_in_block_tree (var
, t
);
3997 /* Keep track of whether we're in a dummy function context. If we are,
3998 we don't want to invoke the set_current_function hook, because we'll
3999 get into trouble if the hook calls target_reinit () recursively or
4000 when the initial initialization is not yet complete. */
4002 static bool in_dummy_function
;
4004 /* Invoke the target hook when setting cfun. Update the optimization options
4005 if the function uses different options than the default. */
4008 invoke_set_current_function_hook (tree fndecl
)
4010 if (!in_dummy_function
)
4012 tree opts
= ((fndecl
)
4013 ? DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
)
4014 : optimization_default_node
);
4017 opts
= optimization_default_node
;
4019 /* Change optimization options if needed. */
4020 if (optimization_current_node
!= opts
)
4022 optimization_current_node
= opts
;
4023 cl_optimization_restore (TREE_OPTIMIZATION (opts
));
4026 targetm
.set_current_function (fndecl
);
4030 /* cfun should never be set directly; use this function. */
4033 set_cfun (struct function
*new_cfun
)
4035 if (cfun
!= new_cfun
)
4038 invoke_set_current_function_hook (new_cfun
? new_cfun
->decl
: NULL_TREE
);
4042 /* Initialized with NOGC, making this poisonous to the garbage collector. */
4044 static VEC(function_p
,heap
) *cfun_stack
;
4046 /* Push the current cfun onto the stack, and set cfun to new_cfun. */
4049 push_cfun (struct function
*new_cfun
)
4051 VEC_safe_push (function_p
, heap
, cfun_stack
, cfun
);
4052 set_cfun (new_cfun
);
4055 /* Pop cfun from the stack. */
4060 struct function
*new_cfun
= VEC_pop (function_p
, cfun_stack
);
4061 set_cfun (new_cfun
);
4064 /* Return value of funcdef and increase it. */
4066 get_next_funcdef_no (void)
4068 return funcdef_no
++;
4071 /* Allocate a function structure for FNDECL and set its contents
4072 to the defaults. Set cfun to the newly-allocated object.
4073 Some of the helper functions invoked during initialization assume
4074 that cfun has already been set. Therefore, assign the new object
4075 directly into cfun and invoke the back end hook explicitly at the
4076 very end, rather than initializing a temporary and calling set_cfun
4079 ABSTRACT_P is true if this is a function that will never be seen by
4080 the middle-end. Such functions are front-end concepts (like C++
4081 function templates) that do not correspond directly to functions
4082 placed in object files. */
4085 allocate_struct_function (tree fndecl
, bool abstract_p
)
4088 tree fntype
= fndecl
? TREE_TYPE (fndecl
) : NULL_TREE
;
4090 cfun
= GGC_CNEW (struct function
);
4092 cfun
->function_frequency
= FUNCTION_FREQUENCY_NORMAL
;
4094 init_eh_for_function ();
4096 if (init_machine_status
)
4097 cfun
->machine
= (*init_machine_status
) ();
4099 #ifdef OVERRIDE_ABI_FORMAT
4100 OVERRIDE_ABI_FORMAT (fndecl
);
4103 invoke_set_current_function_hook (fndecl
);
4105 if (fndecl
!= NULL_TREE
)
4107 DECL_STRUCT_FUNCTION (fndecl
) = cfun
;
4108 cfun
->decl
= fndecl
;
4109 current_function_funcdef_no
= get_next_funcdef_no ();
4111 result
= DECL_RESULT (fndecl
);
4112 if (!abstract_p
&& aggregate_value_p (result
, fndecl
))
4114 #ifdef PCC_STATIC_STRUCT_RETURN
4115 cfun
->returns_pcc_struct
= 1;
4117 cfun
->returns_struct
= 1;
4122 && TYPE_ARG_TYPES (fntype
) != 0
4123 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype
)))
4124 != void_type_node
));
4126 /* Assume all registers in stdarg functions need to be saved. */
4127 cfun
->va_list_gpr_size
= VA_LIST_MAX_GPR_SIZE
;
4128 cfun
->va_list_fpr_size
= VA_LIST_MAX_FPR_SIZE
;
4132 /* This is like allocate_struct_function, but pushes a new cfun for FNDECL
4133 instead of just setting it. */
4136 push_struct_function (tree fndecl
)
4138 VEC_safe_push (function_p
, heap
, cfun_stack
, cfun
);
4139 allocate_struct_function (fndecl
, false);
4142 /* Reset cfun, and other non-struct-function variables to defaults as
4143 appropriate for emitting rtl at the start of a function. */
4146 prepare_function_start (void)
4148 gcc_assert (!crtl
->emit
.x_last_insn
);
4151 init_varasm_status ();
4153 default_rtl_profile ();
4155 cse_not_expected
= ! optimize
;
4157 /* Caller save not needed yet. */
4158 caller_save_needed
= 0;
4160 /* We haven't done register allocation yet. */
4163 /* Indicate that we have not instantiated virtual registers yet. */
4164 virtuals_instantiated
= 0;
4166 /* Indicate that we want CONCATs now. */
4167 generating_concat_p
= 1;
4169 /* Indicate we have no need of a frame pointer yet. */
4170 frame_pointer_needed
= 0;
4173 /* Initialize the rtl expansion mechanism so that we can do simple things
4174 like generate sequences. This is used to provide a context during global
4175 initialization of some passes. You must call expand_dummy_function_end
4176 to exit this context. */
4179 init_dummy_function_start (void)
4181 gcc_assert (!in_dummy_function
);
4182 in_dummy_function
= true;
4183 push_struct_function (NULL_TREE
);
4184 prepare_function_start ();
4187 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
4188 and initialize static variables for generating RTL for the statements
4192 init_function_start (tree subr
)
4194 if (subr
&& DECL_STRUCT_FUNCTION (subr
))
4195 set_cfun (DECL_STRUCT_FUNCTION (subr
));
4197 allocate_struct_function (subr
, false);
4198 prepare_function_start ();
4200 /* Warn if this value is an aggregate type,
4201 regardless of which calling convention we are using for it. */
4202 if (AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr
))))
4203 warning (OPT_Waggregate_return
, "function returns an aggregate");
4206 /* Make sure all values used by the optimization passes have sane defaults. */
4208 init_function_for_compilation (void)
4214 struct rtl_opt_pass pass_init_function
=
4220 init_function_for_compilation
, /* execute */
4223 0, /* static_pass_number */
4224 TV_NONE
, /* tv_id */
4225 0, /* properties_required */
4226 0, /* properties_provided */
4227 0, /* properties_destroyed */
4228 0, /* todo_flags_start */
4229 0 /* todo_flags_finish */
4235 expand_main_function (void)
4237 #if (defined(INVOKE__main) \
4238 || (!defined(HAS_INIT_SECTION) \
4239 && !defined(INIT_SECTION_ASM_OP) \
4240 && !defined(INIT_ARRAY_SECTION_ASM_OP)))
4241 emit_library_call (init_one_libfunc (NAME__MAIN
), LCT_NORMAL
, VOIDmode
, 0);
4245 /* Expand code to initialize the stack_protect_guard. This is invoked at
4246 the beginning of a function to be protected. */
4248 #ifndef HAVE_stack_protect_set
4249 # define HAVE_stack_protect_set 0
4250 # define gen_stack_protect_set(x,y) (gcc_unreachable (), NULL_RTX)
4254 stack_protect_prologue (void)
4256 tree guard_decl
= targetm
.stack_protect_guard ();
4259 /* Avoid expand_expr here, because we don't want guard_decl pulled
4260 into registers unless absolutely necessary. And we know that
4261 crtl->stack_protect_guard is a local stack slot, so this skips
4263 x
= validize_mem (DECL_RTL (crtl
->stack_protect_guard
));
4264 y
= validize_mem (DECL_RTL (guard_decl
));
4266 /* Allow the target to copy from Y to X without leaking Y into a
4268 if (HAVE_stack_protect_set
)
4270 rtx insn
= gen_stack_protect_set (x
, y
);
4278 /* Otherwise do a straight move. */
4279 emit_move_insn (x
, y
);
4282 /* Expand code to verify the stack_protect_guard. This is invoked at
4283 the end of a function to be protected. */
4285 #ifndef HAVE_stack_protect_test
4286 # define HAVE_stack_protect_test 0
4287 # define gen_stack_protect_test(x, y, z) (gcc_unreachable (), NULL_RTX)
4291 stack_protect_epilogue (void)
4293 tree guard_decl
= targetm
.stack_protect_guard ();
4294 rtx label
= gen_label_rtx ();
4297 /* Avoid expand_expr here, because we don't want guard_decl pulled
4298 into registers unless absolutely necessary. And we know that
4299 crtl->stack_protect_guard is a local stack slot, so this skips
4301 x
= validize_mem (DECL_RTL (crtl
->stack_protect_guard
));
4302 y
= validize_mem (DECL_RTL (guard_decl
));
4304 /* Allow the target to compare Y with X without leaking either into
4306 switch (HAVE_stack_protect_test
!= 0)
4309 tmp
= gen_stack_protect_test (x
, y
, label
);
4318 emit_cmp_and_jump_insns (x
, y
, EQ
, NULL_RTX
, ptr_mode
, 1, label
);
4322 /* The noreturn predictor has been moved to the tree level. The rtl-level
4323 predictors estimate this branch about 20%, which isn't enough to get
4324 things moved out of line. Since this is the only extant case of adding
4325 a noreturn function at the rtl level, it doesn't seem worth doing ought
4326 except adding the prediction by hand. */
4327 tmp
= get_last_insn ();
4329 predict_insn_def (tmp
, PRED_NORETURN
, TAKEN
);
4331 expand_expr_stmt (targetm
.stack_protect_fail ());
4335 /* Start the RTL for a new function, and set variables used for
4337 SUBR is the FUNCTION_DECL node.
4338 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
4339 the function's parameters, which must be run at any return statement. */
4342 expand_function_start (tree subr
)
4344 /* Make sure volatile mem refs aren't considered
4345 valid operands of arithmetic insns. */
4346 init_recog_no_volatile ();
4350 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr
));
4353 = (stack_limit_rtx
!= NULL_RTX
&& ! DECL_NO_LIMIT_STACK (subr
));
4355 /* Make the label for return statements to jump to. Do not special
4356 case machines with special return instructions -- they will be
4357 handled later during jump, ifcvt, or epilogue creation. */
4358 return_label
= gen_label_rtx ();
4360 /* Initialize rtx used to return the value. */
4361 /* Do this before assign_parms so that we copy the struct value address
4362 before any library calls that assign parms might generate. */
4364 /* Decide whether to return the value in memory or in a register. */
4365 if (aggregate_value_p (DECL_RESULT (subr
), subr
))
4367 /* Returning something that won't go in a register. */
4368 rtx value_address
= 0;
4370 #ifdef PCC_STATIC_STRUCT_RETURN
4371 if (cfun
->returns_pcc_struct
)
4373 int size
= int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr
)));
4374 value_address
= assemble_static_space (size
);
4379 rtx sv
= targetm
.calls
.struct_value_rtx (TREE_TYPE (subr
), 2);
4380 /* Expect to be passed the address of a place to store the value.
4381 If it is passed as an argument, assign_parms will take care of
4385 value_address
= gen_reg_rtx (Pmode
);
4386 emit_move_insn (value_address
, sv
);
4391 rtx x
= value_address
;
4392 if (!DECL_BY_REFERENCE (DECL_RESULT (subr
)))
4394 x
= gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr
)), x
);
4395 set_mem_attributes (x
, DECL_RESULT (subr
), 1);
4397 SET_DECL_RTL (DECL_RESULT (subr
), x
);
4400 else if (DECL_MODE (DECL_RESULT (subr
)) == VOIDmode
)
4401 /* If return mode is void, this decl rtl should not be used. */
4402 SET_DECL_RTL (DECL_RESULT (subr
), NULL_RTX
);
4405 /* Compute the return values into a pseudo reg, which we will copy
4406 into the true return register after the cleanups are done. */
4407 tree return_type
= TREE_TYPE (DECL_RESULT (subr
));
4408 if (TYPE_MODE (return_type
) != BLKmode
4409 && targetm
.calls
.return_in_msb (return_type
))
4410 /* expand_function_end will insert the appropriate padding in
4411 this case. Use the return value's natural (unpadded) mode
4412 within the function proper. */
4413 SET_DECL_RTL (DECL_RESULT (subr
),
4414 gen_reg_rtx (TYPE_MODE (return_type
)));
4417 /* In order to figure out what mode to use for the pseudo, we
4418 figure out what the mode of the eventual return register will
4419 actually be, and use that. */
4420 rtx hard_reg
= hard_function_value (return_type
, subr
, 0, 1);
4422 /* Structures that are returned in registers are not
4423 aggregate_value_p, so we may see a PARALLEL or a REG. */
4424 if (REG_P (hard_reg
))
4425 SET_DECL_RTL (DECL_RESULT (subr
),
4426 gen_reg_rtx (GET_MODE (hard_reg
)));
4429 gcc_assert (GET_CODE (hard_reg
) == PARALLEL
);
4430 SET_DECL_RTL (DECL_RESULT (subr
), gen_group_rtx (hard_reg
));
4434 /* Set DECL_REGISTER flag so that expand_function_end will copy the
4435 result to the real return register(s). */
4436 DECL_REGISTER (DECL_RESULT (subr
)) = 1;
4439 /* Initialize rtx for parameters and local variables.
4440 In some cases this requires emitting insns. */
4441 assign_parms (subr
);
4443 /* If function gets a static chain arg, store it. */
4444 if (cfun
->static_chain_decl
)
4446 tree parm
= cfun
->static_chain_decl
;
4447 rtx local
= gen_reg_rtx (Pmode
);
4449 set_decl_incoming_rtl (parm
, static_chain_incoming_rtx
, false);
4450 SET_DECL_RTL (parm
, local
);
4451 mark_reg_pointer (local
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
))));
4453 emit_move_insn (local
, static_chain_incoming_rtx
);
4456 /* If the function receives a non-local goto, then store the
4457 bits we need to restore the frame pointer. */
4458 if (cfun
->nonlocal_goto_save_area
)
4463 /* ??? We need to do this save early. Unfortunately here is
4464 before the frame variable gets declared. Help out... */
4465 tree var
= TREE_OPERAND (cfun
->nonlocal_goto_save_area
, 0);
4466 if (!DECL_RTL_SET_P (var
))
4469 t_save
= build4 (ARRAY_REF
, ptr_type_node
,
4470 cfun
->nonlocal_goto_save_area
,
4471 integer_zero_node
, NULL_TREE
, NULL_TREE
);
4472 r_save
= expand_expr (t_save
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4473 r_save
= convert_memory_address (Pmode
, r_save
);
4475 emit_move_insn (r_save
, targetm
.builtin_setjmp_frame_value ());
4476 update_nonlocal_goto_save_area ();
4479 /* The following was moved from init_function_start.
4480 The move is supposed to make sdb output more accurate. */
4481 /* Indicate the beginning of the function body,
4482 as opposed to parm setup. */
4483 emit_note (NOTE_INSN_FUNCTION_BEG
);
4485 gcc_assert (NOTE_P (get_last_insn ()));
4487 parm_birth_insn
= get_last_insn ();
4492 PROFILE_HOOK (current_function_funcdef_no
);
4496 /* After the display initializations is where the stack checking
4498 if(flag_stack_check
)
4499 stack_check_probe_note
= emit_note (NOTE_INSN_DELETED
);
4501 /* Make sure there is a line number after the function entry setup code. */
4502 force_next_line_note ();
4505 /* Undo the effects of init_dummy_function_start. */
4507 expand_dummy_function_end (void)
4509 gcc_assert (in_dummy_function
);
4511 /* End any sequences that failed to be closed due to syntax errors. */
4512 while (in_sequence_p ())
4515 /* Outside function body, can't compute type's actual size
4516 until next function's body starts. */
4518 free_after_parsing (cfun
);
4519 free_after_compilation (cfun
);
4521 in_dummy_function
= false;
4524 /* Call DOIT for each hard register used as a return value from
4525 the current function. */
4528 diddle_return_value (void (*doit
) (rtx
, void *), void *arg
)
4530 rtx outgoing
= crtl
->return_rtx
;
4535 if (REG_P (outgoing
))
4536 (*doit
) (outgoing
, arg
);
4537 else if (GET_CODE (outgoing
) == PARALLEL
)
4541 for (i
= 0; i
< XVECLEN (outgoing
, 0); i
++)
4543 rtx x
= XEXP (XVECEXP (outgoing
, 0, i
), 0);
4545 if (REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
)
4552 do_clobber_return_reg (rtx reg
, void *arg ATTRIBUTE_UNUSED
)
4558 clobber_return_register (void)
4560 diddle_return_value (do_clobber_return_reg
, NULL
);
4562 /* In case we do use pseudo to return value, clobber it too. */
4563 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
4565 tree decl_result
= DECL_RESULT (current_function_decl
);
4566 rtx decl_rtl
= DECL_RTL (decl_result
);
4567 if (REG_P (decl_rtl
) && REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
)
4569 do_clobber_return_reg (decl_rtl
, NULL
);
4575 do_use_return_reg (rtx reg
, void *arg ATTRIBUTE_UNUSED
)
4581 use_return_register (void)
4583 diddle_return_value (do_use_return_reg
, NULL
);
4586 /* Possibly warn about unused parameters. */
4588 do_warn_unused_parameter (tree fn
)
4592 for (decl
= DECL_ARGUMENTS (fn
);
4593 decl
; decl
= TREE_CHAIN (decl
))
4594 if (!TREE_USED (decl
) && TREE_CODE (decl
) == PARM_DECL
4595 && DECL_NAME (decl
) && !DECL_ARTIFICIAL (decl
)
4596 && !TREE_NO_WARNING (decl
))
4597 warning (OPT_Wunused_parameter
, "unused parameter %q+D", decl
);
4600 static GTY(()) rtx initial_trampoline
;
4602 /* Generate RTL for the end of the current function. */
4605 expand_function_end (void)
4609 /* If arg_pointer_save_area was referenced only from a nested
4610 function, we will not have initialized it yet. Do that now. */
4611 if (arg_pointer_save_area
&& ! crtl
->arg_pointer_save_area_init
)
4612 get_arg_pointer_save_area ();
4614 /* If we are doing generic stack checking and this function makes calls,
4615 do a stack probe at the start of the function to ensure we have enough
4616 space for another stack frame. */
4617 if (flag_stack_check
== GENERIC_STACK_CHECK
)
4621 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4625 probe_stack_range (STACK_OLD_CHECK_PROTECT
,
4626 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE
));
4629 emit_insn_before (seq
, stack_check_probe_note
);
4634 /* End any sequences that failed to be closed due to syntax errors. */
4635 while (in_sequence_p ())
4638 clear_pending_stack_adjust ();
4639 do_pending_stack_adjust ();
4641 /* Output a linenumber for the end of the function.
4642 SDB depends on this. */
4643 force_next_line_note ();
4644 set_curr_insn_source_location (input_location
);
4646 /* Before the return label (if any), clobber the return
4647 registers so that they are not propagated live to the rest of
4648 the function. This can only happen with functions that drop
4649 through; if there had been a return statement, there would
4650 have either been a return rtx, or a jump to the return label.
4652 We delay actual code generation after the current_function_value_rtx
4654 clobber_after
= get_last_insn ();
4656 /* Output the label for the actual return from the function. */
4657 emit_label (return_label
);
4659 if (USING_SJLJ_EXCEPTIONS
)
4661 /* Let except.c know where it should emit the call to unregister
4662 the function context for sjlj exceptions. */
4663 if (flag_exceptions
)
4664 sjlj_emit_function_exit_after (get_last_insn ());
4668 /* We want to ensure that instructions that may trap are not
4669 moved into the epilogue by scheduling, because we don't
4670 always emit unwind information for the epilogue. */
4671 if (flag_non_call_exceptions
)
4672 emit_insn (gen_blockage ());
4675 /* If this is an implementation of throw, do what's necessary to
4676 communicate between __builtin_eh_return and the epilogue. */
4677 expand_eh_return ();
4679 /* If scalar return value was computed in a pseudo-reg, or was a named
4680 return value that got dumped to the stack, copy that to the hard
4682 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
4684 tree decl_result
= DECL_RESULT (current_function_decl
);
4685 rtx decl_rtl
= DECL_RTL (decl_result
);
4687 if (REG_P (decl_rtl
)
4688 ? REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
4689 : DECL_REGISTER (decl_result
))
4691 rtx real_decl_rtl
= crtl
->return_rtx
;
4693 /* This should be set in assign_parms. */
4694 gcc_assert (REG_FUNCTION_VALUE_P (real_decl_rtl
));
4696 /* If this is a BLKmode structure being returned in registers,
4697 then use the mode computed in expand_return. Note that if
4698 decl_rtl is memory, then its mode may have been changed,
4699 but that crtl->return_rtx has not. */
4700 if (GET_MODE (real_decl_rtl
) == BLKmode
)
4701 PUT_MODE (real_decl_rtl
, GET_MODE (decl_rtl
));
4703 /* If a non-BLKmode return value should be padded at the least
4704 significant end of the register, shift it left by the appropriate
4705 amount. BLKmode results are handled using the group load/store
4707 if (TYPE_MODE (TREE_TYPE (decl_result
)) != BLKmode
4708 && targetm
.calls
.return_in_msb (TREE_TYPE (decl_result
)))
4710 emit_move_insn (gen_rtx_REG (GET_MODE (decl_rtl
),
4711 REGNO (real_decl_rtl
)),
4713 shift_return_value (GET_MODE (decl_rtl
), true, real_decl_rtl
);
4715 /* If a named return value dumped decl_return to memory, then
4716 we may need to re-do the PROMOTE_MODE signed/unsigned
4718 else if (GET_MODE (real_decl_rtl
) != GET_MODE (decl_rtl
))
4720 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (decl_result
));
4722 if (targetm
.calls
.promote_function_return (TREE_TYPE (current_function_decl
)))
4723 promote_mode (TREE_TYPE (decl_result
), GET_MODE (decl_rtl
),
4726 convert_move (real_decl_rtl
, decl_rtl
, unsignedp
);
4728 else if (GET_CODE (real_decl_rtl
) == PARALLEL
)
4730 /* If expand_function_start has created a PARALLEL for decl_rtl,
4731 move the result to the real return registers. Otherwise, do
4732 a group load from decl_rtl for a named return. */
4733 if (GET_CODE (decl_rtl
) == PARALLEL
)
4734 emit_group_move (real_decl_rtl
, decl_rtl
);
4736 emit_group_load (real_decl_rtl
, decl_rtl
,
4737 TREE_TYPE (decl_result
),
4738 int_size_in_bytes (TREE_TYPE (decl_result
)));
4740 /* In the case of complex integer modes smaller than a word, we'll
4741 need to generate some non-trivial bitfield insertions. Do that
4742 on a pseudo and not the hard register. */
4743 else if (GET_CODE (decl_rtl
) == CONCAT
4744 && GET_MODE_CLASS (GET_MODE (decl_rtl
)) == MODE_COMPLEX_INT
4745 && GET_MODE_BITSIZE (GET_MODE (decl_rtl
)) <= BITS_PER_WORD
)
4747 int old_generating_concat_p
;
4750 old_generating_concat_p
= generating_concat_p
;
4751 generating_concat_p
= 0;
4752 tmp
= gen_reg_rtx (GET_MODE (decl_rtl
));
4753 generating_concat_p
= old_generating_concat_p
;
4755 emit_move_insn (tmp
, decl_rtl
);
4756 emit_move_insn (real_decl_rtl
, tmp
);
4759 emit_move_insn (real_decl_rtl
, decl_rtl
);
4763 /* If returning a structure, arrange to return the address of the value
4764 in a place where debuggers expect to find it.
4766 If returning a structure PCC style,
4767 the caller also depends on this value.
4768 And cfun->returns_pcc_struct is not necessarily set. */
4769 if (cfun
->returns_struct
4770 || cfun
->returns_pcc_struct
)
4772 rtx value_address
= DECL_RTL (DECL_RESULT (current_function_decl
));
4773 tree type
= TREE_TYPE (DECL_RESULT (current_function_decl
));
4776 if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl
)))
4777 type
= TREE_TYPE (type
);
4779 value_address
= XEXP (value_address
, 0);
4781 outgoing
= targetm
.calls
.function_value (build_pointer_type (type
),
4782 current_function_decl
, true);
4784 /* Mark this as a function return value so integrate will delete the
4785 assignment and USE below when inlining this function. */
4786 REG_FUNCTION_VALUE_P (outgoing
) = 1;
4788 /* The address may be ptr_mode and OUTGOING may be Pmode. */
4789 value_address
= convert_memory_address (GET_MODE (outgoing
),
4792 emit_move_insn (outgoing
, value_address
);
4794 /* Show return register used to hold result (in this case the address
4796 crtl
->return_rtx
= outgoing
;
4799 /* Emit the actual code to clobber return register. */
4804 clobber_return_register ();
4808 emit_insn_after (seq
, clobber_after
);
4811 /* Output the label for the naked return from the function. */
4812 if (naked_return_label
)
4813 emit_label (naked_return_label
);
4815 /* @@@ This is a kludge. We want to ensure that instructions that
4816 may trap are not moved into the epilogue by scheduling, because
4817 we don't always emit unwind information for the epilogue. */
4818 if (! USING_SJLJ_EXCEPTIONS
&& flag_non_call_exceptions
)
4819 emit_insn (gen_blockage ());
4821 /* If stack protection is enabled for this function, check the guard. */
4822 if (crtl
->stack_protect_guard
)
4823 stack_protect_epilogue ();
4825 /* If we had calls to alloca, and this machine needs
4826 an accurate stack pointer to exit the function,
4827 insert some code to save and restore the stack pointer. */
4828 if (! EXIT_IGNORE_STACK
4829 && cfun
->calls_alloca
)
4833 emit_stack_save (SAVE_FUNCTION
, &tem
, parm_birth_insn
);
4834 emit_stack_restore (SAVE_FUNCTION
, tem
, NULL_RTX
);
4837 /* ??? This should no longer be necessary since stupid is no longer with
4838 us, but there are some parts of the compiler (eg reload_combine, and
4839 sh mach_dep_reorg) that still try and compute their own lifetime info
4840 instead of using the general framework. */
4841 use_return_register ();
4845 get_arg_pointer_save_area (void)
4847 rtx ret
= arg_pointer_save_area
;
4851 ret
= assign_stack_local (Pmode
, GET_MODE_SIZE (Pmode
), 0);
4852 arg_pointer_save_area
= ret
;
4855 if (! crtl
->arg_pointer_save_area_init
)
4859 /* Save the arg pointer at the beginning of the function. The
4860 generated stack slot may not be a valid memory address, so we
4861 have to check it and fix it if necessary. */
4863 emit_move_insn (validize_mem (ret
),
4864 crtl
->args
.internal_arg_pointer
);
4868 push_topmost_sequence ();
4869 emit_insn_after (seq
, entry_of_function ());
4870 pop_topmost_sequence ();
4876 /* Add a list of INSNS to the hash HASHP, possibly allocating HASHP
4877 for the first time. */
4880 record_insns (rtx insns
, rtx end
, htab_t
*hashp
)
4883 htab_t hash
= *hashp
;
4887 = htab_create_ggc (17, htab_hash_pointer
, htab_eq_pointer
, NULL
);
4889 for (tmp
= insns
; tmp
!= end
; tmp
= NEXT_INSN (tmp
))
4891 void **slot
= htab_find_slot (hash
, tmp
, INSERT
);
4892 gcc_assert (*slot
== NULL
);
4897 /* INSN has been duplicated as COPY, as part of duping a basic block.
4898 If INSN is an epilogue insn, then record COPY as epilogue as well. */
4901 maybe_copy_epilogue_insn (rtx insn
, rtx copy
)
4905 if (epilogue_insn_hash
== NULL
4906 || htab_find (epilogue_insn_hash
, insn
) == NULL
)
4909 slot
= htab_find_slot (epilogue_insn_hash
, copy
, INSERT
);
4910 gcc_assert (*slot
== NULL
);
4914 /* Set the locator of the insn chain starting at INSN to LOC. */
4916 set_insn_locators (rtx insn
, int loc
)
4918 while (insn
!= NULL_RTX
)
4921 INSN_LOCATOR (insn
) = loc
;
4922 insn
= NEXT_INSN (insn
);
4926 /* Determine if any INSNs in HASH are, or are part of, INSN. Because
4927 we can be running after reorg, SEQUENCE rtl is possible. */
4930 contains (const_rtx insn
, htab_t hash
)
4935 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
4938 for (i
= XVECLEN (PATTERN (insn
), 0) - 1; i
>= 0; i
--)
4939 if (htab_find (hash
, XVECEXP (PATTERN (insn
), 0, i
)))
4944 return htab_find (hash
, insn
) != NULL
;
4948 prologue_epilogue_contains (const_rtx insn
)
4950 if (contains (insn
, prologue_insn_hash
))
4952 if (contains (insn
, epilogue_insn_hash
))
4958 /* Insert gen_return at the end of block BB. This also means updating
4959 block_for_insn appropriately. */
4962 emit_return_into_block (basic_block bb
)
4964 emit_jump_insn_after (gen_return (), BB_END (bb
));
4966 #endif /* HAVE_return */
4968 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
4969 this into place with notes indicating where the prologue ends and where
4970 the epilogue begins. Update the basic block information when possible. */
4973 thread_prologue_and_epilogue_insns (void)
4977 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
4980 #if defined (HAVE_epilogue) || defined(HAVE_return)
4981 rtx epilogue_end
= NULL_RTX
;
4985 rtl_profile_for_bb (ENTRY_BLOCK_PTR
);
4986 #ifdef HAVE_prologue
4990 seq
= gen_prologue ();
4993 /* Insert an explicit USE for the frame pointer
4994 if the profiling is on and the frame pointer is required. */
4995 if (crtl
->profile
&& frame_pointer_needed
)
4996 emit_use (hard_frame_pointer_rtx
);
4998 /* Retain a map of the prologue insns. */
4999 record_insns (seq
, NULL
, &prologue_insn_hash
);
5000 emit_note (NOTE_INSN_PROLOGUE_END
);
5002 #ifndef PROFILE_BEFORE_PROLOGUE
5003 /* Ensure that instructions are not moved into the prologue when
5004 profiling is on. The call to the profiling routine can be
5005 emitted within the live range of a call-clobbered register. */
5007 emit_insn (gen_blockage ());
5012 set_insn_locators (seq
, prologue_locator
);
5014 /* Can't deal with multiple successors of the entry block
5015 at the moment. Function should always have at least one
5017 gcc_assert (single_succ_p (ENTRY_BLOCK_PTR
));
5019 insert_insn_on_edge (seq
, single_succ_edge (ENTRY_BLOCK_PTR
));
5024 /* If the exit block has no non-fake predecessors, we don't need
5026 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
5027 if ((e
->flags
& EDGE_FAKE
) == 0)
5032 rtl_profile_for_bb (EXIT_BLOCK_PTR
);
5034 if (optimize
&& HAVE_return
)
5036 /* If we're allowed to generate a simple return instruction,
5037 then by definition we don't need a full epilogue. Examine
5038 the block that falls through to EXIT. If it does not
5039 contain any code, examine its predecessors and try to
5040 emit (conditional) return instructions. */
5045 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
5046 if (e
->flags
& EDGE_FALLTHRU
)
5052 /* Verify that there are no active instructions in the last block. */
5053 label
= BB_END (last
);
5054 while (label
&& !LABEL_P (label
))
5056 if (active_insn_p (label
))
5058 label
= PREV_INSN (label
);
5061 if (BB_HEAD (last
) == label
&& LABEL_P (label
))
5065 for (ei2
= ei_start (last
->preds
); (e
= ei_safe_edge (ei2
)); )
5067 basic_block bb
= e
->src
;
5070 if (bb
== ENTRY_BLOCK_PTR
)
5077 if (!JUMP_P (jump
) || JUMP_LABEL (jump
) != label
)
5083 /* If we have an unconditional jump, we can replace that
5084 with a simple return instruction. */
5085 if (simplejump_p (jump
))
5087 emit_return_into_block (bb
);
5091 /* If we have a conditional jump, we can try to replace
5092 that with a conditional return instruction. */
5093 else if (condjump_p (jump
))
5095 if (! redirect_jump (jump
, 0, 0))
5101 /* If this block has only one successor, it both jumps
5102 and falls through to the fallthru block, so we can't
5104 if (single_succ_p (bb
))
5116 /* Fix up the CFG for the successful change we just made. */
5117 redirect_edge_succ (e
, EXIT_BLOCK_PTR
);
5120 /* Emit a return insn for the exit fallthru block. Whether
5121 this is still reachable will be determined later. */
5123 emit_barrier_after (BB_END (last
));
5124 emit_return_into_block (last
);
5125 epilogue_end
= BB_END (last
);
5126 single_succ_edge (last
)->flags
&= ~EDGE_FALLTHRU
;
5132 /* A small fib -- epilogue is not yet completed, but we wish to re-use
5133 this marker for the splits of EH_RETURN patterns, and nothing else
5134 uses the flag in the meantime. */
5135 epilogue_completed
= 1;
5137 #ifdef HAVE_eh_return
5138 /* Find non-fallthru edges that end with EH_RETURN instructions. On
5139 some targets, these get split to a special version of the epilogue
5140 code. In order to be able to properly annotate these with unwind
5141 info, try to split them now. If we get a valid split, drop an
5142 EPILOGUE_BEG note and mark the insns as epilogue insns. */
5143 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
5145 rtx prev
, last
, trial
;
5147 if (e
->flags
& EDGE_FALLTHRU
)
5149 last
= BB_END (e
->src
);
5150 if (!eh_returnjump_p (last
))
5153 prev
= PREV_INSN (last
);
5154 trial
= try_split (PATTERN (last
), last
, 1);
5158 record_insns (NEXT_INSN (prev
), NEXT_INSN (trial
), &epilogue_insn_hash
);
5159 emit_note_after (NOTE_INSN_EPILOGUE_BEG
, prev
);
5163 /* Find the edge that falls through to EXIT. Other edges may exist
5164 due to RETURN instructions, but those don't need epilogues.
5165 There really shouldn't be a mixture -- either all should have
5166 been converted or none, however... */
5168 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
5169 if (e
->flags
& EDGE_FALLTHRU
)
5174 #ifdef HAVE_epilogue
5178 epilogue_end
= emit_note (NOTE_INSN_EPILOGUE_BEG
);
5179 seq
= gen_epilogue ();
5180 emit_jump_insn (seq
);
5182 /* Retain a map of the epilogue insns. */
5183 record_insns (seq
, NULL
, &epilogue_insn_hash
);
5184 set_insn_locators (seq
, epilogue_locator
);
5189 insert_insn_on_edge (seq
, e
);
5197 if (! next_active_insn (BB_END (e
->src
)))
5199 /* We have a fall-through edge to the exit block, the source is not
5200 at the end of the function, and there will be an assembler epilogue
5201 at the end of the function.
5202 We can't use force_nonfallthru here, because that would try to
5203 use return. Inserting a jump 'by hand' is extremely messy, so
5204 we take advantage of cfg_layout_finalize using
5205 fixup_fallthru_exit_predecessor. */
5206 cfg_layout_initialize (0);
5207 FOR_EACH_BB (cur_bb
)
5208 if (cur_bb
->index
>= NUM_FIXED_BLOCKS
5209 && cur_bb
->next_bb
->index
>= NUM_FIXED_BLOCKS
)
5210 cur_bb
->aux
= cur_bb
->next_bb
;
5211 cfg_layout_finalize ();
5214 default_rtl_profile ();
5218 commit_edge_insertions ();
5220 /* The epilogue insns we inserted may cause the exit edge to no longer
5222 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
5224 if (((e
->flags
& EDGE_FALLTHRU
) != 0)
5225 && returnjump_p (BB_END (e
->src
)))
5226 e
->flags
&= ~EDGE_FALLTHRU
;
5230 #ifdef HAVE_sibcall_epilogue
5231 /* Emit sibling epilogues before any sibling call sites. */
5232 for (ei
= ei_start (EXIT_BLOCK_PTR
->preds
); (e
= ei_safe_edge (ei
)); )
5234 basic_block bb
= e
->src
;
5235 rtx insn
= BB_END (bb
);
5238 || ! SIBLING_CALL_P (insn
))
5245 emit_note (NOTE_INSN_EPILOGUE_BEG
);
5246 emit_insn (gen_sibcall_epilogue ());
5250 /* Retain a map of the epilogue insns. Used in life analysis to
5251 avoid getting rid of sibcall epilogue insns. Do this before we
5252 actually emit the sequence. */
5253 record_insns (seq
, NULL
, &epilogue_insn_hash
);
5254 set_insn_locators (seq
, epilogue_locator
);
5256 emit_insn_before (seq
, insn
);
5261 #ifdef HAVE_epilogue
5266 /* Similarly, move any line notes that appear after the epilogue.
5267 There is no need, however, to be quite so anal about the existence
5268 of such a note. Also possibly move
5269 NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
5271 for (insn
= epilogue_end
; insn
; insn
= next
)
5273 next
= NEXT_INSN (insn
);
5275 && (NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
))
5276 reorder_insns (insn
, insn
, PREV_INSN (epilogue_end
));
5281 /* Threading the prologue and epilogue changes the artificial refs
5282 in the entry and exit blocks. */
5283 epilogue_completed
= 1;
5284 df_update_entry_exit_and_calls ();
5287 /* Reposition the prologue-end and epilogue-begin notes after
5288 instruction scheduling. */
5291 reposition_prologue_and_epilogue_notes (void)
5293 #if defined (HAVE_prologue) || defined (HAVE_epilogue) \
5294 || defined (HAVE_sibcall_epilogue)
5295 /* Since the hash table is created on demand, the fact that it is
5296 non-null is a signal that it is non-empty. */
5297 if (prologue_insn_hash
!= NULL
)
5299 size_t len
= htab_elements (prologue_insn_hash
);
5300 rtx insn
, last
= NULL
, note
= NULL
;
5302 /* Scan from the beginning until we reach the last prologue insn. */
5303 /* ??? While we do have the CFG intact, there are two problems:
5304 (1) The prologue can contain loops (typically probing the stack),
5305 which means that the end of the prologue isn't in the first bb.
5306 (2) Sometimes the PROLOGUE_END note gets pushed into the next bb. */
5307 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
5311 if (NOTE_KIND (insn
) == NOTE_INSN_PROLOGUE_END
)
5314 else if (contains (insn
, prologue_insn_hash
))
5326 /* Scan forward looking for the PROLOGUE_END note. It should
5327 be right at the beginning of the block, possibly with other
5328 insn notes that got moved there. */
5329 for (note
= NEXT_INSN (last
); ; note
= NEXT_INSN (note
))
5332 && NOTE_KIND (note
) == NOTE_INSN_PROLOGUE_END
)
5337 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
5339 last
= NEXT_INSN (last
);
5340 reorder_insns (note
, note
, last
);
5344 if (epilogue_insn_hash
!= NULL
)
5349 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
5351 rtx insn
, first
= NULL
, note
= NULL
;
5352 basic_block bb
= e
->src
;
5354 /* Scan from the beginning until we reach the first epilogue insn. */
5355 FOR_BB_INSNS (bb
, insn
)
5359 if (NOTE_KIND (insn
) == NOTE_INSN_EPILOGUE_BEG
)
5366 else if (first
== NULL
&& contains (insn
, epilogue_insn_hash
))
5376 /* If the function has a single basic block, and no real
5377 epilogue insns (e.g. sibcall with no cleanup), the
5378 epilogue note can get scheduled before the prologue
5379 note. If we have frame related prologue insns, having
5380 them scanned during the epilogue will result in a crash.
5381 In this case re-order the epilogue note to just before
5382 the last insn in the block. */
5384 first
= BB_END (bb
);
5386 if (PREV_INSN (first
) != note
)
5387 reorder_insns (note
, note
, PREV_INSN (first
));
5391 #endif /* HAVE_prologue or HAVE_epilogue */
5394 /* Returns the name of the current function. */
5396 current_function_name (void)
5398 return lang_hooks
.decl_printable_name (cfun
->decl
, 2);
5403 rest_of_handle_check_leaf_regs (void)
5405 #ifdef LEAF_REGISTERS
5406 current_function_uses_only_leaf_regs
5407 = optimize
> 0 && only_leaf_regs_used () && leaf_function_p ();
5412 /* Insert a TYPE into the used types hash table of CFUN. */
5414 used_types_insert_helper (tree type
, struct function
*func
)
5416 if (type
!= NULL
&& func
!= NULL
)
5420 if (func
->used_types_hash
== NULL
)
5421 func
->used_types_hash
= htab_create_ggc (37, htab_hash_pointer
,
5422 htab_eq_pointer
, NULL
);
5423 slot
= htab_find_slot (func
->used_types_hash
, type
, INSERT
);
5429 /* Given a type, insert it into the used hash table in cfun. */
5431 used_types_insert (tree t
)
5433 while (POINTER_TYPE_P (t
) || TREE_CODE (t
) == ARRAY_TYPE
)
5435 t
= TYPE_MAIN_VARIANT (t
);
5436 if (debug_info_level
> DINFO_LEVEL_NONE
)
5437 used_types_insert_helper (t
, cfun
);
5440 struct rtl_opt_pass pass_leaf_regs
=
5446 rest_of_handle_check_leaf_regs
, /* execute */
5449 0, /* static_pass_number */
5450 TV_NONE
, /* tv_id */
5451 0, /* properties_required */
5452 0, /* properties_provided */
5453 0, /* properties_destroyed */
5454 0, /* todo_flags_start */
5455 0 /* todo_flags_finish */
5460 rest_of_handle_thread_prologue_and_epilogue (void)
5463 cleanup_cfg (CLEANUP_EXPENSIVE
);
5464 /* On some machines, the prologue and epilogue code, or parts thereof,
5465 can be represented as RTL. Doing so lets us schedule insns between
5466 it and the rest of the code and also allows delayed branch
5467 scheduling to operate in the epilogue. */
5469 thread_prologue_and_epilogue_insns ();
5473 struct rtl_opt_pass pass_thread_prologue_and_epilogue
=
5477 "pro_and_epilogue", /* name */
5479 rest_of_handle_thread_prologue_and_epilogue
, /* execute */
5482 0, /* static_pass_number */
5483 TV_THREAD_PROLOGUE_AND_EPILOGUE
, /* tv_id */
5484 0, /* properties_required */
5485 0, /* properties_provided */
5486 0, /* properties_destroyed */
5487 TODO_verify_flow
, /* todo_flags_start */
5490 TODO_df_finish
| TODO_verify_rtl_sharing
|
5491 TODO_ggc_collect
/* todo_flags_finish */
5496 /* This mini-pass fixes fall-out from SSA in asm statements that have
5497 in-out constraints. Say you start with
5500 asm ("": "+mr" (inout));
5503 which is transformed very early to use explicit output and match operands:
5506 asm ("": "=mr" (inout) : "0" (inout));
5509 Or, after SSA and copyprop,
5511 asm ("": "=mr" (inout_2) : "0" (inout_1));
5514 Clearly inout_2 and inout_1 can't be coalesced easily anymore, as
5515 they represent two separate values, so they will get different pseudo
5516 registers during expansion. Then, since the two operands need to match
5517 per the constraints, but use different pseudo registers, reload can
5518 only register a reload for these operands. But reloads can only be
5519 satisfied by hardregs, not by memory, so we need a register for this
5520 reload, just because we are presented with non-matching operands.
5521 So, even though we allow memory for this operand, no memory can be
5522 used for it, just because the two operands don't match. This can
5523 cause reload failures on register-starved targets.
5525 So it's a symptom of reload not being able to use memory for reloads
5526 or, alternatively it's also a symptom of both operands not coming into
5527 reload as matching (in which case the pseudo could go to memory just
5528 fine, as the alternative allows it, and no reload would be necessary).
5529 We fix the latter problem here, by transforming
5531 asm ("": "=mr" (inout_2) : "0" (inout_1));
5536 asm ("": "=mr" (inout_2) : "0" (inout_2)); */
5539 match_asm_constraints_1 (rtx insn
, rtx
*p_sets
, int noutputs
)
5542 bool changed
= false;
5543 rtx op
= SET_SRC (p_sets
[0]);
5544 int ninputs
= ASM_OPERANDS_INPUT_LENGTH (op
);
5545 rtvec inputs
= ASM_OPERANDS_INPUT_VEC (op
);
5546 bool *output_matched
= XALLOCAVEC (bool, noutputs
);
5548 memset (output_matched
, 0, noutputs
* sizeof (bool));
5549 for (i
= 0; i
< ninputs
; i
++)
5551 rtx input
, output
, insns
;
5552 const char *constraint
= ASM_OPERANDS_INPUT_CONSTRAINT (op
, i
);
5556 if (*constraint
== '%')
5559 match
= strtoul (constraint
, &end
, 10);
5560 if (end
== constraint
)
5563 gcc_assert (match
< noutputs
);
5564 output
= SET_DEST (p_sets
[match
]);
5565 input
= RTVEC_ELT (inputs
, i
);
5566 /* Only do the transformation for pseudos. */
5567 if (! REG_P (output
)
5568 || rtx_equal_p (output
, input
)
5569 || (GET_MODE (input
) != VOIDmode
5570 && GET_MODE (input
) != GET_MODE (output
)))
5573 /* We can't do anything if the output is also used as input,
5574 as we're going to overwrite it. */
5575 for (j
= 0; j
< ninputs
; j
++)
5576 if (reg_overlap_mentioned_p (output
, RTVEC_ELT (inputs
, j
)))
5581 /* Avoid changing the same input several times. For
5582 asm ("" : "=mr" (out1), "=mr" (out2) : "0" (in), "1" (in));
5583 only change in once (to out1), rather than changing it
5584 first to out1 and afterwards to out2. */
5587 for (j
= 0; j
< noutputs
; j
++)
5588 if (output_matched
[j
] && input
== SET_DEST (p_sets
[j
]))
5593 output_matched
[match
] = true;
5596 emit_move_insn (output
, input
);
5597 insns
= get_insns ();
5599 emit_insn_before (insns
, insn
);
5601 /* Now replace all mentions of the input with output. We can't
5602 just replace the occurrence in inputs[i], as the register might
5603 also be used in some other input (or even in an address of an
5604 output), which would mean possibly increasing the number of
5605 inputs by one (namely 'output' in addition), which might pose
5606 a too complicated problem for reload to solve. E.g. this situation:
5608 asm ("" : "=r" (output), "=m" (input) : "0" (input))
5610 Here 'input' is used in two occurrences as input (once for the
5611 input operand, once for the address in the second output operand).
5612 If we would replace only the occurrence of the input operand (to
5613 make the matching) we would be left with this:
5616 asm ("" : "=r" (output), "=m" (input) : "0" (output))
5618 Now we suddenly have two different input values (containing the same
5619 value, but different pseudos) where we formerly had only one.
5620 With more complicated asms this might lead to reload failures
5621 which wouldn't have happen without this pass. So, iterate over
5622 all operands and replace all occurrences of the register used. */
5623 for (j
= 0; j
< noutputs
; j
++)
5624 if (!rtx_equal_p (SET_DEST (p_sets
[j
]), input
)
5625 && reg_overlap_mentioned_p (input
, SET_DEST (p_sets
[j
])))
5626 SET_DEST (p_sets
[j
]) = replace_rtx (SET_DEST (p_sets
[j
]),
5628 for (j
= 0; j
< ninputs
; j
++)
5629 if (reg_overlap_mentioned_p (input
, RTVEC_ELT (inputs
, j
)))
5630 RTVEC_ELT (inputs
, j
) = replace_rtx (RTVEC_ELT (inputs
, j
),
5637 df_insn_rescan (insn
);
5641 rest_of_match_asm_constraints (void)
5644 rtx insn
, pat
, *p_sets
;
5647 if (!crtl
->has_asm_statement
)
5650 df_set_flags (DF_DEFER_INSN_RESCAN
);
5653 FOR_BB_INSNS (bb
, insn
)
5658 pat
= PATTERN (insn
);
5659 if (GET_CODE (pat
) == PARALLEL
)
5660 p_sets
= &XVECEXP (pat
, 0, 0), noutputs
= XVECLEN (pat
, 0);
5661 else if (GET_CODE (pat
) == SET
)
5662 p_sets
= &PATTERN (insn
), noutputs
= 1;
5666 if (GET_CODE (*p_sets
) == SET
5667 && GET_CODE (SET_SRC (*p_sets
)) == ASM_OPERANDS
)
5668 match_asm_constraints_1 (insn
, p_sets
, noutputs
);
5672 return TODO_df_finish
;
5675 struct rtl_opt_pass pass_match_asm_constraints
=
5679 "asmcons", /* name */
5681 rest_of_match_asm_constraints
, /* execute */
5684 0, /* static_pass_number */
5685 TV_NONE
, /* tv_id */
5686 0, /* properties_required */
5687 0, /* properties_provided */
5688 0, /* properties_destroyed */
5689 0, /* todo_flags_start */
5690 TODO_dump_func
/* todo_flags_finish */
5695 #include "gt-function.h"