1 /* Expands front end tree to back end RTL for GCC.
2 Copyright (C) 1987-2019 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file handles the generation of rtl code from tree structure
21 at the level of the function as a whole.
22 It creates the rtl expressions for parameters and auto variables
23 and has full responsibility for allocating stack slots.
25 `expand_function_start' is called at the beginning of a function,
26 before the function body is parsed, and `expand_function_end' is
27 called after parsing the body.
29 Call `assign_stack_local' to allocate a stack slot for a local variable.
30 This is usually done during the RTL generation for the function body,
31 but it can also be done in the reload pass when a pseudo-register does
32 not get a hard register. */
36 #include "coretypes.h"
41 #include "gimple-expr.h"
46 #include "stringpool.h"
52 #include "rtl-error.h"
54 #include "fold-const.h"
55 #include "stor-layout.h"
62 #include "optabs-tree.h"
64 #include "langhooks.h"
65 #include "common/common-target.h"
67 #include "tree-pass.h"
71 #include "cfgcleanup.h"
72 #include "cfgexpand.h"
73 #include "shrink-wrap.h"
78 #include "stringpool.h"
83 /* So we can assign to cfun in this file. */
86 #ifndef STACK_ALIGNMENT_NEEDED
87 #define STACK_ALIGNMENT_NEEDED 1
90 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
92 /* Round a value to the lowest integer less than it that is a multiple of
93 the required alignment. Avoid using division in case the value is
94 negative. Assume the alignment is a power of two. */
95 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
97 /* Similar, but round to the next highest integer that meets the
99 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
101 /* Nonzero once virtual register instantiation has been done.
102 assign_stack_local uses frame_pointer_rtx when this is nonzero.
103 calls.c:emit_library_call_value_1 uses it to set up
104 post-instantiation libcalls. */
105 int virtuals_instantiated
;
107 /* Assign unique numbers to labels generated for profiling, debugging, etc. */
108 static GTY(()) int funcdef_no
;
110 /* These variables hold pointers to functions to create and destroy
111 target specific, per-function data structures. */
112 struct machine_function
* (*init_machine_status
) (void);
114 /* The currently compiled function. */
115 struct function
*cfun
= 0;
117 /* These hashes record the prologue and epilogue insns. */
119 struct insn_cache_hasher
: ggc_cache_ptr_hash
<rtx_def
>
121 static hashval_t
hash (rtx x
) { return htab_hash_pointer (x
); }
122 static bool equal (rtx a
, rtx b
) { return a
== b
; }
126 hash_table
<insn_cache_hasher
> *prologue_insn_hash
;
128 hash_table
<insn_cache_hasher
> *epilogue_insn_hash
;
131 hash_table
<used_type_hasher
> *types_used_by_vars_hash
= NULL
;
132 vec
<tree
, va_gc
> *types_used_by_cur_var_decl
;
134 /* Forward declarations. */
136 static struct temp_slot
*find_temp_slot_from_address (rtx
);
137 static void pad_to_arg_alignment (struct args_size
*, int, struct args_size
*);
138 static void pad_below (struct args_size
*, machine_mode
, tree
);
139 static void reorder_blocks_1 (rtx_insn
*, tree
, vec
<tree
> *);
140 static int all_blocks (tree
, tree
*);
141 static tree
*get_block_vector (tree
, int *);
142 extern tree
debug_find_var_in_block_tree (tree
, tree
);
143 /* We always define `record_insns' even if it's not used so that we
144 can always export `prologue_epilogue_contains'. */
145 static void record_insns (rtx_insn
*, rtx
, hash_table
<insn_cache_hasher
> **)
147 static bool contains (const rtx_insn
*, hash_table
<insn_cache_hasher
> *);
148 static void prepare_function_start (void);
149 static void do_clobber_return_reg (rtx
, void *);
150 static void do_use_return_reg (rtx
, void *);
153 /* Stack of nested functions. */
154 /* Keep track of the cfun stack. */
156 static vec
<function
*> function_context_stack
;
158 /* Save the current context for compilation of a nested function.
159 This is called from language-specific code. */
162 push_function_context (void)
165 allocate_struct_function (NULL
, false);
167 function_context_stack
.safe_push (cfun
);
171 /* Restore the last saved context, at the end of a nested function.
172 This function is called from language-specific code. */
175 pop_function_context (void)
177 struct function
*p
= function_context_stack
.pop ();
179 current_function_decl
= p
->decl
;
181 /* Reset variables that have known state during rtx generation. */
182 virtuals_instantiated
= 0;
183 generating_concat_p
= 1;
186 /* Clear out all parts of the state in F that can safely be discarded
187 after the function has been parsed, but not compiled, to let
188 garbage collection reclaim the memory. */
191 free_after_parsing (struct function
*f
)
196 /* Clear out all parts of the state in F that can safely be discarded
197 after the function has been compiled, to let garbage collection
198 reclaim the memory. */
201 free_after_compilation (struct function
*f
)
203 prologue_insn_hash
= NULL
;
204 epilogue_insn_hash
= NULL
;
206 free (crtl
->emit
.regno_pointer_align
);
208 memset (crtl
, 0, sizeof (struct rtl_data
));
212 f
->curr_properties
&= ~PROP_cfg
;
214 regno_reg_rtx
= NULL
;
217 /* Return size needed for stack frame based on slots so far allocated.
218 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
219 the caller may have to do that. */
222 get_frame_size (void)
224 if (FRAME_GROWS_DOWNWARD
)
225 return -frame_offset
;
230 /* Issue an error message and return TRUE if frame OFFSET overflows in
231 the signed target pointer arithmetics for function FUNC. Otherwise
235 frame_offset_overflow (poly_int64 offset
, tree func
)
237 poly_uint64 size
= FRAME_GROWS_DOWNWARD
? -offset
: offset
;
238 unsigned HOST_WIDE_INT limit
239 = ((HOST_WIDE_INT_1U
<< (GET_MODE_BITSIZE (Pmode
) - 1))
240 /* Leave room for the fixed part of the frame. */
241 - 64 * UNITS_PER_WORD
);
243 if (!coeffs_in_range_p (size
, 0U, limit
))
245 unsigned HOST_WIDE_INT hwisize
;
246 if (size
.is_constant (&hwisize
))
247 error_at (DECL_SOURCE_LOCATION (func
),
248 "total size of local objects %wu exceeds maximum %wu",
251 error_at (DECL_SOURCE_LOCATION (func
),
252 "total size of local objects exceeds maximum %wu",
260 /* Return the minimum spill slot alignment for a register of mode MODE. */
263 spill_slot_alignment (machine_mode mode ATTRIBUTE_UNUSED
)
265 return STACK_SLOT_ALIGNMENT (NULL_TREE
, mode
, GET_MODE_ALIGNMENT (mode
));
268 /* Return stack slot alignment in bits for TYPE and MODE. */
271 get_stack_local_alignment (tree type
, machine_mode mode
)
273 unsigned int alignment
;
276 alignment
= BIGGEST_ALIGNMENT
;
278 alignment
= GET_MODE_ALIGNMENT (mode
);
280 /* Allow the frond-end to (possibly) increase the alignment of this
283 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
285 return STACK_SLOT_ALIGNMENT (type
, mode
, alignment
);
288 /* Determine whether it is possible to fit a stack slot of size SIZE and
289 alignment ALIGNMENT into an area in the stack frame that starts at
290 frame offset START and has a length of LENGTH. If so, store the frame
291 offset to be used for the stack slot in *POFFSET and return true;
292 return false otherwise. This function will extend the frame size when
293 given a start/length pair that lies at the end of the frame. */
296 try_fit_stack_local (poly_int64 start
, poly_int64 length
,
297 poly_int64 size
, unsigned int alignment
,
298 poly_int64_pod
*poffset
)
300 poly_int64 this_frame_offset
;
301 int frame_off
, frame_alignment
, frame_phase
;
303 /* Calculate how many bytes the start of local variables is off from
305 frame_alignment
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
306 frame_off
= targetm
.starting_frame_offset () % frame_alignment
;
307 frame_phase
= frame_off
? frame_alignment
- frame_off
: 0;
309 /* Round the frame offset to the specified alignment. */
311 if (FRAME_GROWS_DOWNWARD
)
313 = (aligned_lower_bound (start
+ length
- size
- frame_phase
, alignment
)
317 = aligned_upper_bound (start
- frame_phase
, alignment
) + frame_phase
;
319 /* See if it fits. If this space is at the edge of the frame,
320 consider extending the frame to make it fit. Our caller relies on
321 this when allocating a new slot. */
322 if (maybe_lt (this_frame_offset
, start
))
324 if (known_eq (frame_offset
, start
))
325 frame_offset
= this_frame_offset
;
329 else if (maybe_gt (this_frame_offset
+ size
, start
+ length
))
331 if (known_eq (frame_offset
, start
+ length
))
332 frame_offset
= this_frame_offset
+ size
;
337 *poffset
= this_frame_offset
;
341 /* Create a new frame_space structure describing free space in the stack
342 frame beginning at START and ending at END, and chain it into the
343 function's frame_space_list. */
346 add_frame_space (poly_int64 start
, poly_int64 end
)
348 struct frame_space
*space
= ggc_alloc
<frame_space
> ();
349 space
->next
= crtl
->frame_space_list
;
350 crtl
->frame_space_list
= space
;
351 space
->start
= start
;
352 space
->length
= end
- start
;
355 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
356 with machine mode MODE.
358 ALIGN controls the amount of alignment for the address of the slot:
359 0 means according to MODE,
360 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
361 -2 means use BITS_PER_UNIT,
362 positive specifies alignment boundary in bits.
364 KIND has ASLK_REDUCE_ALIGN bit set if it is OK to reduce
365 alignment and ASLK_RECORD_PAD bit set if we should remember
366 extra space we allocated for alignment purposes. When we are
367 called from assign_stack_temp_for_type, it is not set so we don't
368 track the same stack slot in two independent lists.
370 We do not round to stack_boundary here. */
373 assign_stack_local_1 (machine_mode mode
, poly_int64 size
,
377 poly_int64 bigend_correction
= 0;
378 poly_int64 slot_offset
= 0, old_frame_offset
;
379 unsigned int alignment
, alignment_in_bits
;
383 alignment
= get_stack_local_alignment (NULL
, mode
);
384 alignment
/= BITS_PER_UNIT
;
386 else if (align
== -1)
388 alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
389 size
= aligned_upper_bound (size
, alignment
);
391 else if (align
== -2)
392 alignment
= 1; /* BITS_PER_UNIT / BITS_PER_UNIT */
394 alignment
= align
/ BITS_PER_UNIT
;
396 alignment_in_bits
= alignment
* BITS_PER_UNIT
;
398 /* Ignore alignment if it exceeds MAX_SUPPORTED_STACK_ALIGNMENT. */
399 if (alignment_in_bits
> MAX_SUPPORTED_STACK_ALIGNMENT
)
401 alignment_in_bits
= MAX_SUPPORTED_STACK_ALIGNMENT
;
402 alignment
= MAX_SUPPORTED_STACK_ALIGNMENT
/ BITS_PER_UNIT
;
405 if (SUPPORTS_STACK_ALIGNMENT
)
407 if (crtl
->stack_alignment_estimated
< alignment_in_bits
)
409 if (!crtl
->stack_realign_processed
)
410 crtl
->stack_alignment_estimated
= alignment_in_bits
;
413 /* If stack is realigned and stack alignment value
414 hasn't been finalized, it is OK not to increase
415 stack_alignment_estimated. The bigger alignment
416 requirement is recorded in stack_alignment_needed
418 gcc_assert (!crtl
->stack_realign_finalized
);
419 if (!crtl
->stack_realign_needed
)
421 /* It is OK to reduce the alignment as long as the
422 requested size is 0 or the estimated stack
423 alignment >= mode alignment. */
424 gcc_assert ((kind
& ASLK_REDUCE_ALIGN
)
425 || known_eq (size
, 0)
426 || (crtl
->stack_alignment_estimated
427 >= GET_MODE_ALIGNMENT (mode
)));
428 alignment_in_bits
= crtl
->stack_alignment_estimated
;
429 alignment
= alignment_in_bits
/ BITS_PER_UNIT
;
435 if (crtl
->stack_alignment_needed
< alignment_in_bits
)
436 crtl
->stack_alignment_needed
= alignment_in_bits
;
437 if (crtl
->max_used_stack_slot_alignment
< alignment_in_bits
)
438 crtl
->max_used_stack_slot_alignment
= alignment_in_bits
;
440 if (mode
!= BLKmode
|| maybe_ne (size
, 0))
442 if (kind
& ASLK_RECORD_PAD
)
444 struct frame_space
**psp
;
446 for (psp
= &crtl
->frame_space_list
; *psp
; psp
= &(*psp
)->next
)
448 struct frame_space
*space
= *psp
;
449 if (!try_fit_stack_local (space
->start
, space
->length
, size
,
450 alignment
, &slot_offset
))
453 if (known_gt (slot_offset
, space
->start
))
454 add_frame_space (space
->start
, slot_offset
);
455 if (known_lt (slot_offset
+ size
, space
->start
+ space
->length
))
456 add_frame_space (slot_offset
+ size
,
457 space
->start
+ space
->length
);
462 else if (!STACK_ALIGNMENT_NEEDED
)
464 slot_offset
= frame_offset
;
468 old_frame_offset
= frame_offset
;
470 if (FRAME_GROWS_DOWNWARD
)
472 frame_offset
-= size
;
473 try_fit_stack_local (frame_offset
, size
, size
, alignment
, &slot_offset
);
475 if (kind
& ASLK_RECORD_PAD
)
477 if (known_gt (slot_offset
, frame_offset
))
478 add_frame_space (frame_offset
, slot_offset
);
479 if (known_lt (slot_offset
+ size
, old_frame_offset
))
480 add_frame_space (slot_offset
+ size
, old_frame_offset
);
485 frame_offset
+= size
;
486 try_fit_stack_local (old_frame_offset
, size
, size
, alignment
, &slot_offset
);
488 if (kind
& ASLK_RECORD_PAD
)
490 if (known_gt (slot_offset
, old_frame_offset
))
491 add_frame_space (old_frame_offset
, slot_offset
);
492 if (known_lt (slot_offset
+ size
, frame_offset
))
493 add_frame_space (slot_offset
+ size
, frame_offset
);
498 /* On a big-endian machine, if we are allocating more space than we will use,
499 use the least significant bytes of those that are allocated. */
502 /* The slot size can sometimes be smaller than the mode size;
503 e.g. the rs6000 port allocates slots with a vector mode
504 that have the size of only one element. However, the slot
505 size must always be ordered wrt to the mode size, in the
506 same way as for a subreg. */
507 gcc_checking_assert (ordered_p (GET_MODE_SIZE (mode
), size
));
508 if (BYTES_BIG_ENDIAN
&& maybe_lt (GET_MODE_SIZE (mode
), size
))
509 bigend_correction
= size
- GET_MODE_SIZE (mode
);
512 /* If we have already instantiated virtual registers, return the actual
513 address relative to the frame pointer. */
514 if (virtuals_instantiated
)
515 addr
= plus_constant (Pmode
, frame_pointer_rtx
,
517 (slot_offset
+ bigend_correction
518 + targetm
.starting_frame_offset (), Pmode
));
520 addr
= plus_constant (Pmode
, virtual_stack_vars_rtx
,
522 (slot_offset
+ bigend_correction
,
525 x
= gen_rtx_MEM (mode
, addr
);
526 set_mem_align (x
, alignment_in_bits
);
527 MEM_NOTRAP_P (x
) = 1;
529 vec_safe_push (stack_slot_list
, x
);
531 if (frame_offset_overflow (frame_offset
, current_function_decl
))
537 /* Wrap up assign_stack_local_1 with last parameter as false. */
540 assign_stack_local (machine_mode mode
, poly_int64 size
, int align
)
542 return assign_stack_local_1 (mode
, size
, align
, ASLK_RECORD_PAD
);
545 /* In order to evaluate some expressions, such as function calls returning
546 structures in memory, we need to temporarily allocate stack locations.
547 We record each allocated temporary in the following structure.
549 Associated with each temporary slot is a nesting level. When we pop up
550 one level, all temporaries associated with the previous level are freed.
551 Normally, all temporaries are freed after the execution of the statement
552 in which they were created. However, if we are inside a ({...}) grouping,
553 the result may be in a temporary and hence must be preserved. If the
554 result could be in a temporary, we preserve it if we can determine which
555 one it is in. If we cannot determine which temporary may contain the
556 result, all temporaries are preserved. A temporary is preserved by
557 pretending it was allocated at the previous nesting level. */
559 class GTY(()) temp_slot
{
561 /* Points to next temporary slot. */
562 struct temp_slot
*next
;
563 /* Points to previous temporary slot. */
564 struct temp_slot
*prev
;
565 /* The rtx to used to reference the slot. */
567 /* The size, in units, of the slot. */
569 /* The type of the object in the slot, or zero if it doesn't correspond
570 to a type. We use this to determine whether a slot can be reused.
571 It can be reused if objects of the type of the new slot will always
572 conflict with objects of the type of the old slot. */
574 /* The alignment (in bits) of the slot. */
576 /* Nonzero if this temporary is currently in use. */
578 /* Nesting level at which this slot is being used. */
580 /* The offset of the slot from the frame_pointer, including extra space
581 for alignment. This info is for combine_temp_slots. */
582 poly_int64 base_offset
;
583 /* The size of the slot, including extra space for alignment. This
584 info is for combine_temp_slots. */
585 poly_int64 full_size
;
588 /* Entry for the below hash table. */
589 struct GTY((for_user
)) temp_slot_address_entry
{
592 struct temp_slot
*temp_slot
;
595 struct temp_address_hasher
: ggc_ptr_hash
<temp_slot_address_entry
>
597 static hashval_t
hash (temp_slot_address_entry
*);
598 static bool equal (temp_slot_address_entry
*, temp_slot_address_entry
*);
601 /* A table of addresses that represent a stack slot. The table is a mapping
602 from address RTXen to a temp slot. */
603 static GTY(()) hash_table
<temp_address_hasher
> *temp_slot_address_table
;
604 static size_t n_temp_slots_in_use
;
606 /* Removes temporary slot TEMP from LIST. */
609 cut_slot_from_list (struct temp_slot
*temp
, struct temp_slot
**list
)
612 temp
->next
->prev
= temp
->prev
;
614 temp
->prev
->next
= temp
->next
;
618 temp
->prev
= temp
->next
= NULL
;
621 /* Inserts temporary slot TEMP to LIST. */
624 insert_slot_to_list (struct temp_slot
*temp
, struct temp_slot
**list
)
628 (*list
)->prev
= temp
;
633 /* Returns the list of used temp slots at LEVEL. */
635 static struct temp_slot
**
636 temp_slots_at_level (int level
)
638 if (level
>= (int) vec_safe_length (used_temp_slots
))
639 vec_safe_grow_cleared (used_temp_slots
, level
+ 1);
641 return &(*used_temp_slots
)[level
];
644 /* Returns the maximal temporary slot level. */
647 max_slot_level (void)
649 if (!used_temp_slots
)
652 return used_temp_slots
->length () - 1;
655 /* Moves temporary slot TEMP to LEVEL. */
658 move_slot_to_level (struct temp_slot
*temp
, int level
)
660 cut_slot_from_list (temp
, temp_slots_at_level (temp
->level
));
661 insert_slot_to_list (temp
, temp_slots_at_level (level
));
665 /* Make temporary slot TEMP available. */
668 make_slot_available (struct temp_slot
*temp
)
670 cut_slot_from_list (temp
, temp_slots_at_level (temp
->level
));
671 insert_slot_to_list (temp
, &avail_temp_slots
);
674 n_temp_slots_in_use
--;
677 /* Compute the hash value for an address -> temp slot mapping.
678 The value is cached on the mapping entry. */
680 temp_slot_address_compute_hash (struct temp_slot_address_entry
*t
)
682 int do_not_record
= 0;
683 return hash_rtx (t
->address
, GET_MODE (t
->address
),
684 &do_not_record
, NULL
, false);
687 /* Return the hash value for an address -> temp slot mapping. */
689 temp_address_hasher::hash (temp_slot_address_entry
*t
)
694 /* Compare two address -> temp slot mapping entries. */
696 temp_address_hasher::equal (temp_slot_address_entry
*t1
,
697 temp_slot_address_entry
*t2
)
699 return exp_equiv_p (t1
->address
, t2
->address
, 0, true);
702 /* Add ADDRESS as an alias of TEMP_SLOT to the addess -> temp slot mapping. */
704 insert_temp_slot_address (rtx address
, struct temp_slot
*temp_slot
)
706 struct temp_slot_address_entry
*t
= ggc_alloc
<temp_slot_address_entry
> ();
707 t
->address
= address
;
708 t
->temp_slot
= temp_slot
;
709 t
->hash
= temp_slot_address_compute_hash (t
);
710 *temp_slot_address_table
->find_slot_with_hash (t
, t
->hash
, INSERT
) = t
;
713 /* Remove an address -> temp slot mapping entry if the temp slot is
714 not in use anymore. Callback for remove_unused_temp_slot_addresses. */
716 remove_unused_temp_slot_addresses_1 (temp_slot_address_entry
**slot
, void *)
718 const struct temp_slot_address_entry
*t
= *slot
;
719 if (! t
->temp_slot
->in_use
)
720 temp_slot_address_table
->clear_slot (slot
);
724 /* Remove all mappings of addresses to unused temp slots. */
726 remove_unused_temp_slot_addresses (void)
728 /* Use quicker clearing if there aren't any active temp slots. */
729 if (n_temp_slots_in_use
)
730 temp_slot_address_table
->traverse
731 <void *, remove_unused_temp_slot_addresses_1
> (NULL
);
733 temp_slot_address_table
->empty ();
736 /* Find the temp slot corresponding to the object at address X. */
738 static struct temp_slot
*
739 find_temp_slot_from_address (rtx x
)
742 struct temp_slot_address_entry tmp
, *t
;
744 /* First try the easy way:
745 See if X exists in the address -> temp slot mapping. */
747 tmp
.temp_slot
= NULL
;
748 tmp
.hash
= temp_slot_address_compute_hash (&tmp
);
749 t
= temp_slot_address_table
->find_with_hash (&tmp
, tmp
.hash
);
753 /* If we have a sum involving a register, see if it points to a temp
755 if (GET_CODE (x
) == PLUS
&& REG_P (XEXP (x
, 0))
756 && (p
= find_temp_slot_from_address (XEXP (x
, 0))) != 0)
758 else if (GET_CODE (x
) == PLUS
&& REG_P (XEXP (x
, 1))
759 && (p
= find_temp_slot_from_address (XEXP (x
, 1))) != 0)
762 /* Last resort: Address is a virtual stack var address. */
764 if (strip_offset (x
, &offset
) == virtual_stack_vars_rtx
)
767 for (i
= max_slot_level (); i
>= 0; i
--)
768 for (p
= *temp_slots_at_level (i
); p
; p
= p
->next
)
769 if (known_in_range_p (offset
, p
->base_offset
, p
->full_size
))
776 /* Allocate a temporary stack slot and record it for possible later
779 MODE is the machine mode to be given to the returned rtx.
781 SIZE is the size in units of the space required. We do no rounding here
782 since assign_stack_local will do any required rounding.
784 TYPE is the type that will be used for the stack slot. */
787 assign_stack_temp_for_type (machine_mode mode
, poly_int64 size
, tree type
)
790 struct temp_slot
*p
, *best_p
= 0, *selected
= NULL
, **pp
;
793 gcc_assert (known_size_p (size
));
795 align
= get_stack_local_alignment (type
, mode
);
797 /* Try to find an available, already-allocated temporary of the proper
798 mode which meets the size and alignment requirements. Choose the
799 smallest one with the closest alignment.
801 If assign_stack_temp is called outside of the tree->rtl expansion,
802 we cannot reuse the stack slots (that may still refer to
803 VIRTUAL_STACK_VARS_REGNUM). */
804 if (!virtuals_instantiated
)
806 for (p
= avail_temp_slots
; p
; p
= p
->next
)
808 if (p
->align
>= align
809 && known_ge (p
->size
, size
)
810 && GET_MODE (p
->slot
) == mode
811 && objects_must_conflict_p (p
->type
, type
)
813 || (known_eq (best_p
->size
, p
->size
)
814 ? best_p
->align
> p
->align
815 : known_ge (best_p
->size
, p
->size
))))
817 if (p
->align
== align
&& known_eq (p
->size
, size
))
820 cut_slot_from_list (selected
, &avail_temp_slots
);
829 /* Make our best, if any, the one to use. */
833 cut_slot_from_list (selected
, &avail_temp_slots
);
835 /* If there are enough aligned bytes left over, make them into a new
836 temp_slot so that the extra bytes don't get wasted. Do this only
837 for BLKmode slots, so that we can be sure of the alignment. */
838 if (GET_MODE (best_p
->slot
) == BLKmode
)
840 int alignment
= best_p
->align
/ BITS_PER_UNIT
;
841 poly_int64 rounded_size
= aligned_upper_bound (size
, alignment
);
843 if (known_ge (best_p
->size
- rounded_size
, alignment
))
845 p
= ggc_alloc
<temp_slot
> ();
847 p
->size
= best_p
->size
- rounded_size
;
848 p
->base_offset
= best_p
->base_offset
+ rounded_size
;
849 p
->full_size
= best_p
->full_size
- rounded_size
;
850 p
->slot
= adjust_address_nv (best_p
->slot
, BLKmode
, rounded_size
);
851 p
->align
= best_p
->align
;
852 p
->type
= best_p
->type
;
853 insert_slot_to_list (p
, &avail_temp_slots
);
855 vec_safe_push (stack_slot_list
, p
->slot
);
857 best_p
->size
= rounded_size
;
858 best_p
->full_size
= rounded_size
;
863 /* If we still didn't find one, make a new temporary. */
866 poly_int64 frame_offset_old
= frame_offset
;
868 p
= ggc_alloc
<temp_slot
> ();
870 /* We are passing an explicit alignment request to assign_stack_local.
871 One side effect of that is assign_stack_local will not round SIZE
872 to ensure the frame offset remains suitably aligned.
874 So for requests which depended on the rounding of SIZE, we go ahead
875 and round it now. We also make sure ALIGNMENT is at least
876 BIGGEST_ALIGNMENT. */
877 gcc_assert (mode
!= BLKmode
|| align
== BIGGEST_ALIGNMENT
);
878 p
->slot
= assign_stack_local_1 (mode
,
880 ? aligned_upper_bound (size
,
888 /* The following slot size computation is necessary because we don't
889 know the actual size of the temporary slot until assign_stack_local
890 has performed all the frame alignment and size rounding for the
891 requested temporary. Note that extra space added for alignment
892 can be either above or below this stack slot depending on which
893 way the frame grows. We include the extra space if and only if it
894 is above this slot. */
895 if (FRAME_GROWS_DOWNWARD
)
896 p
->size
= frame_offset_old
- frame_offset
;
900 /* Now define the fields used by combine_temp_slots. */
901 if (FRAME_GROWS_DOWNWARD
)
903 p
->base_offset
= frame_offset
;
904 p
->full_size
= frame_offset_old
- frame_offset
;
908 p
->base_offset
= frame_offset_old
;
909 p
->full_size
= frame_offset
- frame_offset_old
;
918 p
->level
= temp_slot_level
;
919 n_temp_slots_in_use
++;
921 pp
= temp_slots_at_level (p
->level
);
922 insert_slot_to_list (p
, pp
);
923 insert_temp_slot_address (XEXP (p
->slot
, 0), p
);
925 /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
926 slot
= gen_rtx_MEM (mode
, XEXP (p
->slot
, 0));
927 vec_safe_push (stack_slot_list
, slot
);
929 /* If we know the alias set for the memory that will be used, use
930 it. If there's no TYPE, then we don't know anything about the
931 alias set for the memory. */
932 set_mem_alias_set (slot
, type
? get_alias_set (type
) : 0);
933 set_mem_align (slot
, align
);
935 /* If a type is specified, set the relevant flags. */
937 MEM_VOLATILE_P (slot
) = TYPE_VOLATILE (type
);
938 MEM_NOTRAP_P (slot
) = 1;
943 /* Allocate a temporary stack slot and record it for possible later
944 reuse. First two arguments are same as in preceding function. */
947 assign_stack_temp (machine_mode mode
, poly_int64 size
)
949 return assign_stack_temp_for_type (mode
, size
, NULL_TREE
);
952 /* Assign a temporary.
953 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
954 and so that should be used in error messages. In either case, we
955 allocate of the given type.
956 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
957 it is 0 if a register is OK.
958 DONT_PROMOTE is 1 if we should not promote values in register
962 assign_temp (tree type_or_decl
, int memory_required
,
963 int dont_promote ATTRIBUTE_UNUSED
)
971 if (DECL_P (type_or_decl
))
972 decl
= type_or_decl
, type
= TREE_TYPE (decl
);
974 decl
= NULL
, type
= type_or_decl
;
976 mode
= TYPE_MODE (type
);
978 unsignedp
= TYPE_UNSIGNED (type
);
981 /* Allocating temporaries of TREE_ADDRESSABLE type must be done in the front
982 end. See also create_tmp_var for the gimplification-time check. */
983 gcc_assert (!TREE_ADDRESSABLE (type
) && COMPLETE_TYPE_P (type
));
985 if (mode
== BLKmode
|| memory_required
)
990 /* Unfortunately, we don't yet know how to allocate variable-sized
991 temporaries. However, sometimes we can find a fixed upper limit on
992 the size, so try that instead. */
993 if (!poly_int_tree_p (TYPE_SIZE_UNIT (type
), &size
))
994 size
= max_int_size_in_bytes (type
);
996 /* Zero sized arrays are a GNU C extension. Set size to 1 to avoid
997 problems with allocating the stack space. */
998 if (known_eq (size
, 0))
1001 /* The size of the temporary may be too large to fit into an integer. */
1002 /* ??? Not sure this should happen except for user silliness, so limit
1003 this to things that aren't compiler-generated temporaries. The
1004 rest of the time we'll die in assign_stack_temp_for_type. */
1006 && !known_size_p (size
)
1007 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
)
1009 error ("size of variable %q+D is too large", decl
);
1013 tmp
= assign_stack_temp_for_type (mode
, size
, type
);
1019 mode
= promote_mode (type
, mode
, &unsignedp
);
1022 return gen_reg_rtx (mode
);
1025 /* Combine temporary stack slots which are adjacent on the stack.
1027 This allows for better use of already allocated stack space. This is only
1028 done for BLKmode slots because we can be sure that we won't have alignment
1029 problems in this case. */
1032 combine_temp_slots (void)
1034 struct temp_slot
*p
, *q
, *next
, *next_q
;
1037 /* We can't combine slots, because the information about which slot
1038 is in which alias set will be lost. */
1039 if (flag_strict_aliasing
)
1042 /* If there are a lot of temp slots, don't do anything unless
1043 high levels of optimization. */
1044 if (! flag_expensive_optimizations
)
1045 for (p
= avail_temp_slots
, num_slots
= 0; p
; p
= p
->next
, num_slots
++)
1046 if (num_slots
> 100 || (num_slots
> 10 && optimize
== 0))
1049 for (p
= avail_temp_slots
; p
; p
= next
)
1055 if (GET_MODE (p
->slot
) != BLKmode
)
1058 for (q
= p
->next
; q
; q
= next_q
)
1064 if (GET_MODE (q
->slot
) != BLKmode
)
1067 if (known_eq (p
->base_offset
+ p
->full_size
, q
->base_offset
))
1069 /* Q comes after P; combine Q into P. */
1071 p
->full_size
+= q
->full_size
;
1074 else if (known_eq (q
->base_offset
+ q
->full_size
, p
->base_offset
))
1076 /* P comes after Q; combine P into Q. */
1078 q
->full_size
+= p
->full_size
;
1083 cut_slot_from_list (q
, &avail_temp_slots
);
1086 /* Either delete P or advance past it. */
1088 cut_slot_from_list (p
, &avail_temp_slots
);
1092 /* Indicate that NEW_RTX is an alternate way of referring to the temp
1093 slot that previously was known by OLD_RTX. */
1096 update_temp_slot_address (rtx old_rtx
, rtx new_rtx
)
1098 struct temp_slot
*p
;
1100 if (rtx_equal_p (old_rtx
, new_rtx
))
1103 p
= find_temp_slot_from_address (old_rtx
);
1105 /* If we didn't find one, see if both OLD_RTX is a PLUS. If so, and
1106 NEW_RTX is a register, see if one operand of the PLUS is a
1107 temporary location. If so, NEW_RTX points into it. Otherwise,
1108 if both OLD_RTX and NEW_RTX are a PLUS and if there is a register
1109 in common between them. If so, try a recursive call on those
1113 if (GET_CODE (old_rtx
) != PLUS
)
1116 if (REG_P (new_rtx
))
1118 update_temp_slot_address (XEXP (old_rtx
, 0), new_rtx
);
1119 update_temp_slot_address (XEXP (old_rtx
, 1), new_rtx
);
1122 else if (GET_CODE (new_rtx
) != PLUS
)
1125 if (rtx_equal_p (XEXP (old_rtx
, 0), XEXP (new_rtx
, 0)))
1126 update_temp_slot_address (XEXP (old_rtx
, 1), XEXP (new_rtx
, 1));
1127 else if (rtx_equal_p (XEXP (old_rtx
, 1), XEXP (new_rtx
, 0)))
1128 update_temp_slot_address (XEXP (old_rtx
, 0), XEXP (new_rtx
, 1));
1129 else if (rtx_equal_p (XEXP (old_rtx
, 0), XEXP (new_rtx
, 1)))
1130 update_temp_slot_address (XEXP (old_rtx
, 1), XEXP (new_rtx
, 0));
1131 else if (rtx_equal_p (XEXP (old_rtx
, 1), XEXP (new_rtx
, 1)))
1132 update_temp_slot_address (XEXP (old_rtx
, 0), XEXP (new_rtx
, 0));
1137 /* Otherwise add an alias for the temp's address. */
1138 insert_temp_slot_address (new_rtx
, p
);
1141 /* If X could be a reference to a temporary slot, mark that slot as
1142 belonging to the to one level higher than the current level. If X
1143 matched one of our slots, just mark that one. Otherwise, we can't
1144 easily predict which it is, so upgrade all of them.
1146 This is called when an ({...}) construct occurs and a statement
1147 returns a value in memory. */
1150 preserve_temp_slots (rtx x
)
1152 struct temp_slot
*p
= 0, *next
;
1157 /* If X is a register that is being used as a pointer, see if we have
1158 a temporary slot we know it points to. */
1159 if (REG_P (x
) && REG_POINTER (x
))
1160 p
= find_temp_slot_from_address (x
);
1162 /* If X is not in memory or is at a constant address, it cannot be in
1163 a temporary slot. */
1164 if (p
== 0 && (!MEM_P (x
) || CONSTANT_P (XEXP (x
, 0))))
1167 /* First see if we can find a match. */
1169 p
= find_temp_slot_from_address (XEXP (x
, 0));
1173 if (p
->level
== temp_slot_level
)
1174 move_slot_to_level (p
, temp_slot_level
- 1);
1178 /* Otherwise, preserve all non-kept slots at this level. */
1179 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1182 move_slot_to_level (p
, temp_slot_level
- 1);
1186 /* Free all temporaries used so far. This is normally called at the
1187 end of generating code for a statement. */
1190 free_temp_slots (void)
1192 struct temp_slot
*p
, *next
;
1193 bool some_available
= false;
1195 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1198 make_slot_available (p
);
1199 some_available
= true;
1204 remove_unused_temp_slot_addresses ();
1205 combine_temp_slots ();
1209 /* Push deeper into the nesting level for stack temporaries. */
1212 push_temp_slots (void)
1217 /* Pop a temporary nesting level. All slots in use in the current level
1221 pop_temp_slots (void)
1227 /* Initialize temporary slots. */
1230 init_temp_slots (void)
1232 /* We have not allocated any temporaries yet. */
1233 avail_temp_slots
= 0;
1234 vec_alloc (used_temp_slots
, 0);
1235 temp_slot_level
= 0;
1236 n_temp_slots_in_use
= 0;
1238 /* Set up the table to map addresses to temp slots. */
1239 if (! temp_slot_address_table
)
1240 temp_slot_address_table
= hash_table
<temp_address_hasher
>::create_ggc (32);
1242 temp_slot_address_table
->empty ();
1245 /* Functions and data structures to keep track of the values hard regs
1246 had at the start of the function. */
1248 /* Private type used by get_hard_reg_initial_reg, get_hard_reg_initial_val,
1249 and has_hard_reg_initial_val.. */
1250 struct GTY(()) initial_value_pair
{
1254 /* ??? This could be a VEC but there is currently no way to define an
1255 opaque VEC type. This could be worked around by defining struct
1256 initial_value_pair in function.h. */
1257 struct GTY(()) initial_value_struct
{
1260 initial_value_pair
* GTY ((length ("%h.num_entries"))) entries
;
1263 /* If a pseudo represents an initial hard reg (or expression), return
1264 it, else return NULL_RTX. */
1267 get_hard_reg_initial_reg (rtx reg
)
1269 struct initial_value_struct
*ivs
= crtl
->hard_reg_initial_vals
;
1275 for (i
= 0; i
< ivs
->num_entries
; i
++)
1276 if (rtx_equal_p (ivs
->entries
[i
].pseudo
, reg
))
1277 return ivs
->entries
[i
].hard_reg
;
1282 /* Make sure that there's a pseudo register of mode MODE that stores the
1283 initial value of hard register REGNO. Return an rtx for such a pseudo. */
1286 get_hard_reg_initial_val (machine_mode mode
, unsigned int regno
)
1288 struct initial_value_struct
*ivs
;
1291 rv
= has_hard_reg_initial_val (mode
, regno
);
1295 ivs
= crtl
->hard_reg_initial_vals
;
1298 ivs
= ggc_alloc
<initial_value_struct
> ();
1299 ivs
->num_entries
= 0;
1300 ivs
->max_entries
= 5;
1301 ivs
->entries
= ggc_vec_alloc
<initial_value_pair
> (5);
1302 crtl
->hard_reg_initial_vals
= ivs
;
1305 if (ivs
->num_entries
>= ivs
->max_entries
)
1307 ivs
->max_entries
+= 5;
1308 ivs
->entries
= GGC_RESIZEVEC (initial_value_pair
, ivs
->entries
,
1312 ivs
->entries
[ivs
->num_entries
].hard_reg
= gen_rtx_REG (mode
, regno
);
1313 ivs
->entries
[ivs
->num_entries
].pseudo
= gen_reg_rtx (mode
);
1315 return ivs
->entries
[ivs
->num_entries
++].pseudo
;
1318 /* See if get_hard_reg_initial_val has been used to create a pseudo
1319 for the initial value of hard register REGNO in mode MODE. Return
1320 the associated pseudo if so, otherwise return NULL. */
1323 has_hard_reg_initial_val (machine_mode mode
, unsigned int regno
)
1325 struct initial_value_struct
*ivs
;
1328 ivs
= crtl
->hard_reg_initial_vals
;
1330 for (i
= 0; i
< ivs
->num_entries
; i
++)
1331 if (GET_MODE (ivs
->entries
[i
].hard_reg
) == mode
1332 && REGNO (ivs
->entries
[i
].hard_reg
) == regno
)
1333 return ivs
->entries
[i
].pseudo
;
1339 emit_initial_value_sets (void)
1341 struct initial_value_struct
*ivs
= crtl
->hard_reg_initial_vals
;
1349 for (i
= 0; i
< ivs
->num_entries
; i
++)
1350 emit_move_insn (ivs
->entries
[i
].pseudo
, ivs
->entries
[i
].hard_reg
);
1354 emit_insn_at_entry (seq
);
1358 /* Return the hardreg-pseudoreg initial values pair entry I and
1359 TRUE if I is a valid entry, or FALSE if I is not a valid entry. */
1361 initial_value_entry (int i
, rtx
*hreg
, rtx
*preg
)
1363 struct initial_value_struct
*ivs
= crtl
->hard_reg_initial_vals
;
1364 if (!ivs
|| i
>= ivs
->num_entries
)
1367 *hreg
= ivs
->entries
[i
].hard_reg
;
1368 *preg
= ivs
->entries
[i
].pseudo
;
1372 /* These routines are responsible for converting virtual register references
1373 to the actual hard register references once RTL generation is complete.
1375 The following four variables are used for communication between the
1376 routines. They contain the offsets of the virtual registers from their
1377 respective hard registers. */
1379 static poly_int64 in_arg_offset
;
1380 static poly_int64 var_offset
;
1381 static poly_int64 dynamic_offset
;
1382 static poly_int64 out_arg_offset
;
1383 static poly_int64 cfa_offset
;
1385 /* In most machines, the stack pointer register is equivalent to the bottom
1388 #ifndef STACK_POINTER_OFFSET
1389 #define STACK_POINTER_OFFSET 0
1392 #if defined (REG_PARM_STACK_SPACE) && !defined (INCOMING_REG_PARM_STACK_SPACE)
1393 #define INCOMING_REG_PARM_STACK_SPACE REG_PARM_STACK_SPACE
1396 /* If not defined, pick an appropriate default for the offset of dynamically
1397 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
1398 INCOMING_REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
1400 #ifndef STACK_DYNAMIC_OFFSET
1402 /* The bottom of the stack points to the actual arguments. If
1403 REG_PARM_STACK_SPACE is defined, this includes the space for the register
1404 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
1405 stack space for register parameters is not pushed by the caller, but
1406 rather part of the fixed stack areas and hence not included in
1407 `crtl->outgoing_args_size'. Nevertheless, we must allow
1408 for it when allocating stack dynamic objects. */
1410 #ifdef INCOMING_REG_PARM_STACK_SPACE
1411 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1412 ((ACCUMULATE_OUTGOING_ARGS \
1413 ? (crtl->outgoing_args_size \
1414 + (OUTGOING_REG_PARM_STACK_SPACE ((!(FNDECL) ? NULL_TREE : TREE_TYPE (FNDECL))) ? 0 \
1415 : INCOMING_REG_PARM_STACK_SPACE (FNDECL))) \
1416 : 0) + (STACK_POINTER_OFFSET))
1418 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1419 ((ACCUMULATE_OUTGOING_ARGS ? crtl->outgoing_args_size : poly_int64 (0)) \
1420 + (STACK_POINTER_OFFSET))
1425 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
1426 is a virtual register, return the equivalent hard register and set the
1427 offset indirectly through the pointer. Otherwise, return 0. */
1430 instantiate_new_reg (rtx x
, poly_int64_pod
*poffset
)
1435 if (x
== virtual_incoming_args_rtx
)
1437 if (stack_realign_drap
)
1439 /* Replace virtual_incoming_args_rtx with internal arg
1440 pointer if DRAP is used to realign stack. */
1441 new_rtx
= crtl
->args
.internal_arg_pointer
;
1445 new_rtx
= arg_pointer_rtx
, offset
= in_arg_offset
;
1447 else if (x
== virtual_stack_vars_rtx
)
1448 new_rtx
= frame_pointer_rtx
, offset
= var_offset
;
1449 else if (x
== virtual_stack_dynamic_rtx
)
1450 new_rtx
= stack_pointer_rtx
, offset
= dynamic_offset
;
1451 else if (x
== virtual_outgoing_args_rtx
)
1452 new_rtx
= stack_pointer_rtx
, offset
= out_arg_offset
;
1453 else if (x
== virtual_cfa_rtx
)
1455 #ifdef FRAME_POINTER_CFA_OFFSET
1456 new_rtx
= frame_pointer_rtx
;
1458 new_rtx
= arg_pointer_rtx
;
1460 offset
= cfa_offset
;
1462 else if (x
== virtual_preferred_stack_boundary_rtx
)
1464 new_rtx
= GEN_INT (crtl
->preferred_stack_boundary
/ BITS_PER_UNIT
);
1474 /* A subroutine of instantiate_virtual_regs. Instantiate any virtual
1475 registers present inside of *LOC. The expression is simplified,
1476 as much as possible, but is not to be considered "valid" in any sense
1477 implied by the target. Return true if any change is made. */
1480 instantiate_virtual_regs_in_rtx (rtx
*loc
)
1484 bool changed
= false;
1485 subrtx_ptr_iterator::array_type array
;
1486 FOR_EACH_SUBRTX_PTR (iter
, array
, loc
, NONCONST
)
1493 switch (GET_CODE (x
))
1496 new_rtx
= instantiate_new_reg (x
, &offset
);
1499 *loc
= plus_constant (GET_MODE (x
), new_rtx
, offset
);
1502 iter
.skip_subrtxes ();
1506 new_rtx
= instantiate_new_reg (XEXP (x
, 0), &offset
);
1509 XEXP (x
, 0) = new_rtx
;
1510 *loc
= plus_constant (GET_MODE (x
), x
, offset
, true);
1512 iter
.skip_subrtxes ();
1516 /* FIXME -- from old code */
1517 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
1518 we can commute the PLUS and SUBREG because pointers into the
1519 frame are well-behaved. */
1530 /* A subroutine of instantiate_virtual_regs_in_insn. Return true if X
1531 matches the predicate for insn CODE operand OPERAND. */
1534 safe_insn_predicate (int code
, int operand
, rtx x
)
1536 return code
< 0 || insn_operand_matches ((enum insn_code
) code
, operand
, x
);
1539 /* A subroutine of instantiate_virtual_regs. Instantiate any virtual
1540 registers present inside of insn. The result will be a valid insn. */
1543 instantiate_virtual_regs_in_insn (rtx_insn
*insn
)
1547 bool any_change
= false;
1548 rtx set
, new_rtx
, x
;
1551 /* There are some special cases to be handled first. */
1552 set
= single_set (insn
);
1555 /* We're allowed to assign to a virtual register. This is interpreted
1556 to mean that the underlying register gets assigned the inverse
1557 transformation. This is used, for example, in the handling of
1559 new_rtx
= instantiate_new_reg (SET_DEST (set
), &offset
);
1564 instantiate_virtual_regs_in_rtx (&SET_SRC (set
));
1565 x
= simplify_gen_binary (PLUS
, GET_MODE (new_rtx
), SET_SRC (set
),
1566 gen_int_mode (-offset
, GET_MODE (new_rtx
)));
1567 x
= force_operand (x
, new_rtx
);
1569 emit_move_insn (new_rtx
, x
);
1574 emit_insn_before (seq
, insn
);
1579 /* Handle a straight copy from a virtual register by generating a
1580 new add insn. The difference between this and falling through
1581 to the generic case is avoiding a new pseudo and eliminating a
1582 move insn in the initial rtl stream. */
1583 new_rtx
= instantiate_new_reg (SET_SRC (set
), &offset
);
1585 && maybe_ne (offset
, 0)
1586 && REG_P (SET_DEST (set
))
1587 && REGNO (SET_DEST (set
)) > LAST_VIRTUAL_REGISTER
)
1591 x
= expand_simple_binop (GET_MODE (SET_DEST (set
)), PLUS
, new_rtx
,
1592 gen_int_mode (offset
,
1593 GET_MODE (SET_DEST (set
))),
1594 SET_DEST (set
), 1, OPTAB_LIB_WIDEN
);
1595 if (x
!= SET_DEST (set
))
1596 emit_move_insn (SET_DEST (set
), x
);
1601 emit_insn_before (seq
, insn
);
1606 extract_insn (insn
);
1607 insn_code
= INSN_CODE (insn
);
1609 /* Handle a plus involving a virtual register by determining if the
1610 operands remain valid if they're modified in place. */
1612 if (GET_CODE (SET_SRC (set
)) == PLUS
1613 && recog_data
.n_operands
>= 3
1614 && recog_data
.operand_loc
[1] == &XEXP (SET_SRC (set
), 0)
1615 && recog_data
.operand_loc
[2] == &XEXP (SET_SRC (set
), 1)
1616 && poly_int_rtx_p (recog_data
.operand
[2], &delta
)
1617 && (new_rtx
= instantiate_new_reg (recog_data
.operand
[1], &offset
)))
1621 /* If the sum is zero, then replace with a plain move. */
1622 if (known_eq (offset
, 0)
1623 && REG_P (SET_DEST (set
))
1624 && REGNO (SET_DEST (set
)) > LAST_VIRTUAL_REGISTER
)
1627 emit_move_insn (SET_DEST (set
), new_rtx
);
1631 emit_insn_before (seq
, insn
);
1636 x
= gen_int_mode (offset
, recog_data
.operand_mode
[2]);
1638 /* Using validate_change and apply_change_group here leaves
1639 recog_data in an invalid state. Since we know exactly what
1640 we want to check, do those two by hand. */
1641 if (safe_insn_predicate (insn_code
, 1, new_rtx
)
1642 && safe_insn_predicate (insn_code
, 2, x
))
1644 *recog_data
.operand_loc
[1] = recog_data
.operand
[1] = new_rtx
;
1645 *recog_data
.operand_loc
[2] = recog_data
.operand
[2] = x
;
1648 /* Fall through into the regular operand fixup loop in
1649 order to take care of operands other than 1 and 2. */
1655 extract_insn (insn
);
1656 insn_code
= INSN_CODE (insn
);
1659 /* In the general case, we expect virtual registers to appear only in
1660 operands, and then only as either bare registers or inside memories. */
1661 for (i
= 0; i
< recog_data
.n_operands
; ++i
)
1663 x
= recog_data
.operand
[i
];
1664 switch (GET_CODE (x
))
1668 rtx addr
= XEXP (x
, 0);
1670 if (!instantiate_virtual_regs_in_rtx (&addr
))
1674 x
= replace_equiv_address (x
, addr
, true);
1675 /* It may happen that the address with the virtual reg
1676 was valid (e.g. based on the virtual stack reg, which might
1677 be acceptable to the predicates with all offsets), whereas
1678 the address now isn't anymore, for instance when the address
1679 is still offsetted, but the base reg isn't virtual-stack-reg
1680 anymore. Below we would do a force_reg on the whole operand,
1681 but this insn might actually only accept memory. Hence,
1682 before doing that last resort, try to reload the address into
1683 a register, so this operand stays a MEM. */
1684 if (!safe_insn_predicate (insn_code
, i
, x
))
1686 addr
= force_reg (GET_MODE (addr
), addr
);
1687 x
= replace_equiv_address (x
, addr
, true);
1692 emit_insn_before (seq
, insn
);
1697 new_rtx
= instantiate_new_reg (x
, &offset
);
1698 if (new_rtx
== NULL
)
1700 if (known_eq (offset
, 0))
1706 /* Careful, special mode predicates may have stuff in
1707 insn_data[insn_code].operand[i].mode that isn't useful
1708 to us for computing a new value. */
1709 /* ??? Recognize address_operand and/or "p" constraints
1710 to see if (plus new offset) is a valid before we put
1711 this through expand_simple_binop. */
1712 x
= expand_simple_binop (GET_MODE (x
), PLUS
, new_rtx
,
1713 gen_int_mode (offset
, GET_MODE (x
)),
1714 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
1717 emit_insn_before (seq
, insn
);
1722 new_rtx
= instantiate_new_reg (SUBREG_REG (x
), &offset
);
1723 if (new_rtx
== NULL
)
1725 if (maybe_ne (offset
, 0))
1728 new_rtx
= expand_simple_binop
1729 (GET_MODE (new_rtx
), PLUS
, new_rtx
,
1730 gen_int_mode (offset
, GET_MODE (new_rtx
)),
1731 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
1734 emit_insn_before (seq
, insn
);
1736 x
= simplify_gen_subreg (recog_data
.operand_mode
[i
], new_rtx
,
1737 GET_MODE (new_rtx
), SUBREG_BYTE (x
));
1745 /* At this point, X contains the new value for the operand.
1746 Validate the new value vs the insn predicate. Note that
1747 asm insns will have insn_code -1 here. */
1748 if (!safe_insn_predicate (insn_code
, i
, x
))
1753 gcc_assert (REGNO (x
) <= LAST_VIRTUAL_REGISTER
);
1754 x
= copy_to_reg (x
);
1757 x
= force_reg (insn_data
[insn_code
].operand
[i
].mode
, x
);
1761 emit_insn_before (seq
, insn
);
1764 *recog_data
.operand_loc
[i
] = recog_data
.operand
[i
] = x
;
1770 /* Propagate operand changes into the duplicates. */
1771 for (i
= 0; i
< recog_data
.n_dups
; ++i
)
1772 *recog_data
.dup_loc
[i
]
1773 = copy_rtx (recog_data
.operand
[(unsigned)recog_data
.dup_num
[i
]]);
1775 /* Force re-recognition of the instruction for validation. */
1776 INSN_CODE (insn
) = -1;
1779 if (asm_noperands (PATTERN (insn
)) >= 0)
1781 if (!check_asm_operands (PATTERN (insn
)))
1783 error_for_asm (insn
, "impossible constraint in %<asm%>");
1784 /* For asm goto, instead of fixing up all the edges
1785 just clear the template and clear input operands
1786 (asm goto doesn't have any output operands). */
1789 rtx asm_op
= extract_asm_operands (PATTERN (insn
));
1790 ASM_OPERANDS_TEMPLATE (asm_op
) = ggc_strdup ("");
1791 ASM_OPERANDS_INPUT_VEC (asm_op
) = rtvec_alloc (0);
1792 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (asm_op
) = rtvec_alloc (0);
1800 if (recog_memoized (insn
) < 0)
1801 fatal_insn_not_found (insn
);
1805 /* Subroutine of instantiate_decls. Given RTL representing a decl,
1806 do any instantiation required. */
1809 instantiate_decl_rtl (rtx x
)
1816 /* If this is a CONCAT, recurse for the pieces. */
1817 if (GET_CODE (x
) == CONCAT
)
1819 instantiate_decl_rtl (XEXP (x
, 0));
1820 instantiate_decl_rtl (XEXP (x
, 1));
1824 /* If this is not a MEM, no need to do anything. Similarly if the
1825 address is a constant or a register that is not a virtual register. */
1830 if (CONSTANT_P (addr
)
1832 && (REGNO (addr
) < FIRST_VIRTUAL_REGISTER
1833 || REGNO (addr
) > LAST_VIRTUAL_REGISTER
)))
1836 instantiate_virtual_regs_in_rtx (&XEXP (x
, 0));
1839 /* Helper for instantiate_decls called via walk_tree: Process all decls
1840 in the given DECL_VALUE_EXPR. */
1843 instantiate_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1851 if (DECL_RTL_SET_P (t
))
1852 instantiate_decl_rtl (DECL_RTL (t
));
1853 if (TREE_CODE (t
) == PARM_DECL
&& DECL_NAMELESS (t
)
1854 && DECL_INCOMING_RTL (t
))
1855 instantiate_decl_rtl (DECL_INCOMING_RTL (t
));
1856 if ((VAR_P (t
) || TREE_CODE (t
) == RESULT_DECL
)
1857 && DECL_HAS_VALUE_EXPR_P (t
))
1859 tree v
= DECL_VALUE_EXPR (t
);
1860 walk_tree (&v
, instantiate_expr
, NULL
, NULL
);
1867 /* Subroutine of instantiate_decls: Process all decls in the given
1868 BLOCK node and all its subblocks. */
1871 instantiate_decls_1 (tree let
)
1875 for (t
= BLOCK_VARS (let
); t
; t
= DECL_CHAIN (t
))
1877 if (DECL_RTL_SET_P (t
))
1878 instantiate_decl_rtl (DECL_RTL (t
));
1879 if (VAR_P (t
) && DECL_HAS_VALUE_EXPR_P (t
))
1881 tree v
= DECL_VALUE_EXPR (t
);
1882 walk_tree (&v
, instantiate_expr
, NULL
, NULL
);
1886 /* Process all subblocks. */
1887 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= BLOCK_CHAIN (t
))
1888 instantiate_decls_1 (t
);
1891 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
1892 all virtual registers in their DECL_RTL's. */
1895 instantiate_decls (tree fndecl
)
1900 /* Process all parameters of the function. */
1901 for (decl
= DECL_ARGUMENTS (fndecl
); decl
; decl
= DECL_CHAIN (decl
))
1903 instantiate_decl_rtl (DECL_RTL (decl
));
1904 instantiate_decl_rtl (DECL_INCOMING_RTL (decl
));
1905 if (DECL_HAS_VALUE_EXPR_P (decl
))
1907 tree v
= DECL_VALUE_EXPR (decl
);
1908 walk_tree (&v
, instantiate_expr
, NULL
, NULL
);
1912 if ((decl
= DECL_RESULT (fndecl
))
1913 && TREE_CODE (decl
) == RESULT_DECL
)
1915 if (DECL_RTL_SET_P (decl
))
1916 instantiate_decl_rtl (DECL_RTL (decl
));
1917 if (DECL_HAS_VALUE_EXPR_P (decl
))
1919 tree v
= DECL_VALUE_EXPR (decl
);
1920 walk_tree (&v
, instantiate_expr
, NULL
, NULL
);
1924 /* Process the saved static chain if it exists. */
1925 decl
= DECL_STRUCT_FUNCTION (fndecl
)->static_chain_decl
;
1926 if (decl
&& DECL_HAS_VALUE_EXPR_P (decl
))
1927 instantiate_decl_rtl (DECL_RTL (DECL_VALUE_EXPR (decl
)));
1929 /* Now process all variables defined in the function or its subblocks. */
1930 if (DECL_INITIAL (fndecl
))
1931 instantiate_decls_1 (DECL_INITIAL (fndecl
));
1933 FOR_EACH_LOCAL_DECL (cfun
, ix
, decl
)
1934 if (DECL_RTL_SET_P (decl
))
1935 instantiate_decl_rtl (DECL_RTL (decl
));
1936 vec_free (cfun
->local_decls
);
1939 /* Pass through the INSNS of function FNDECL and convert virtual register
1940 references to hard register references. */
1943 instantiate_virtual_regs (void)
1947 /* Compute the offsets to use for this function. */
1948 in_arg_offset
= FIRST_PARM_OFFSET (current_function_decl
);
1949 var_offset
= targetm
.starting_frame_offset ();
1950 dynamic_offset
= STACK_DYNAMIC_OFFSET (current_function_decl
);
1951 out_arg_offset
= STACK_POINTER_OFFSET
;
1952 #ifdef FRAME_POINTER_CFA_OFFSET
1953 cfa_offset
= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
1955 cfa_offset
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
1958 /* Initialize recognition, indicating that volatile is OK. */
1961 /* Scan through all the insns, instantiating every virtual register still
1963 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1966 /* These patterns in the instruction stream can never be recognized.
1967 Fortunately, they shouldn't contain virtual registers either. */
1968 if (GET_CODE (PATTERN (insn
)) == USE
1969 || GET_CODE (PATTERN (insn
)) == CLOBBER
1970 || GET_CODE (PATTERN (insn
)) == ASM_INPUT
1971 || DEBUG_MARKER_INSN_P (insn
))
1973 else if (DEBUG_BIND_INSN_P (insn
))
1974 instantiate_virtual_regs_in_rtx (INSN_VAR_LOCATION_PTR (insn
));
1976 instantiate_virtual_regs_in_insn (insn
);
1978 if (insn
->deleted ())
1981 instantiate_virtual_regs_in_rtx (®_NOTES (insn
));
1983 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
1985 instantiate_virtual_regs_in_rtx (&CALL_INSN_FUNCTION_USAGE (insn
));
1988 /* Instantiate the virtual registers in the DECLs for debugging purposes. */
1989 instantiate_decls (current_function_decl
);
1991 targetm
.instantiate_decls ();
1993 /* Indicate that, from now on, assign_stack_local should use
1994 frame_pointer_rtx. */
1995 virtuals_instantiated
= 1;
2002 const pass_data pass_data_instantiate_virtual_regs
=
2004 RTL_PASS
, /* type */
2006 OPTGROUP_NONE
, /* optinfo_flags */
2007 TV_NONE
, /* tv_id */
2008 0, /* properties_required */
2009 0, /* properties_provided */
2010 0, /* properties_destroyed */
2011 0, /* todo_flags_start */
2012 0, /* todo_flags_finish */
2015 class pass_instantiate_virtual_regs
: public rtl_opt_pass
2018 pass_instantiate_virtual_regs (gcc::context
*ctxt
)
2019 : rtl_opt_pass (pass_data_instantiate_virtual_regs
, ctxt
)
2022 /* opt_pass methods: */
2023 virtual unsigned int execute (function
*)
2025 return instantiate_virtual_regs ();
2028 }; // class pass_instantiate_virtual_regs
2033 make_pass_instantiate_virtual_regs (gcc::context
*ctxt
)
2035 return new pass_instantiate_virtual_regs (ctxt
);
2039 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
2040 This means a type for which function calls must pass an address to the
2041 function or get an address back from the function.
2042 EXP may be a type node or an expression (whose type is tested). */
2045 aggregate_value_p (const_tree exp
, const_tree fntype
)
2047 const_tree type
= (TYPE_P (exp
)) ? exp
: TREE_TYPE (exp
);
2048 int i
, regno
, nregs
;
2052 switch (TREE_CODE (fntype
))
2056 tree fndecl
= get_callee_fndecl (fntype
);
2058 fntype
= TREE_TYPE (fndecl
);
2059 else if (CALL_EXPR_FN (fntype
))
2060 fntype
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (fntype
)));
2062 /* For internal functions, assume nothing needs to be
2063 returned in memory. */
2068 fntype
= TREE_TYPE (fntype
);
2073 case IDENTIFIER_NODE
:
2077 /* We don't expect other tree types here. */
2081 if (VOID_TYPE_P (type
))
2084 /* If a record should be passed the same as its first (and only) member
2085 don't pass it as an aggregate. */
2086 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2087 return aggregate_value_p (first_field (type
), fntype
);
2089 /* If the front end has decided that this needs to be passed by
2090 reference, do so. */
2091 if ((TREE_CODE (exp
) == PARM_DECL
|| TREE_CODE (exp
) == RESULT_DECL
)
2092 && DECL_BY_REFERENCE (exp
))
2095 /* Function types that are TREE_ADDRESSABLE force return in memory. */
2096 if (fntype
&& TREE_ADDRESSABLE (fntype
))
2099 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
2100 and thus can't be returned in registers. */
2101 if (TREE_ADDRESSABLE (type
))
2104 if (TYPE_EMPTY_P (type
))
2107 if (flag_pcc_struct_return
&& AGGREGATE_TYPE_P (type
))
2110 if (targetm
.calls
.return_in_memory (type
, fntype
))
2113 /* Make sure we have suitable call-clobbered regs to return
2114 the value in; if not, we must return it in memory. */
2115 reg
= hard_function_value (type
, 0, fntype
, 0);
2117 /* If we have something other than a REG (e.g. a PARALLEL), then assume
2122 regno
= REGNO (reg
);
2123 nregs
= hard_regno_nregs (regno
, TYPE_MODE (type
));
2124 for (i
= 0; i
< nregs
; i
++)
2125 if (! call_used_regs
[regno
+ i
])
2131 /* Return true if we should assign DECL a pseudo register; false if it
2132 should live on the local stack. */
2135 use_register_for_decl (const_tree decl
)
2137 if (TREE_CODE (decl
) == SSA_NAME
)
2139 /* We often try to use the SSA_NAME, instead of its underlying
2140 decl, to get type information and guide decisions, to avoid
2141 differences of behavior between anonymous and named
2142 variables, but in this one case we have to go for the actual
2143 variable if there is one. The main reason is that, at least
2144 at -O0, we want to place user variables on the stack, but we
2145 don't mind using pseudos for anonymous or ignored temps.
2146 Should we take the SSA_NAME, we'd conclude all SSA_NAMEs
2147 should go in pseudos, whereas their corresponding variables
2148 might have to go on the stack. So, disregarding the decl
2149 here would negatively impact debug info at -O0, enable
2150 coalescing between SSA_NAMEs that ought to get different
2151 stack/pseudo assignments, and get the incoming argument
2152 processing thoroughly confused by PARM_DECLs expected to live
2153 in stack slots but assigned to pseudos. */
2154 if (!SSA_NAME_VAR (decl
))
2155 return TYPE_MODE (TREE_TYPE (decl
)) != BLKmode
2156 && !(flag_float_store
&& FLOAT_TYPE_P (TREE_TYPE (decl
)));
2158 decl
= SSA_NAME_VAR (decl
);
2161 /* Honor volatile. */
2162 if (TREE_SIDE_EFFECTS (decl
))
2165 /* Honor addressability. */
2166 if (TREE_ADDRESSABLE (decl
))
2169 /* RESULT_DECLs are a bit special in that they're assigned without
2170 regard to use_register_for_decl, but we generally only store in
2171 them. If we coalesce their SSA NAMEs, we'd better return a
2172 result that matches the assignment in expand_function_start. */
2173 if (TREE_CODE (decl
) == RESULT_DECL
)
2175 /* If it's not an aggregate, we're going to use a REG or a
2176 PARALLEL containing a REG. */
2177 if (!aggregate_value_p (decl
, current_function_decl
))
2180 /* If expand_function_start determines the return value, we'll
2181 use MEM if it's not by reference. */
2182 if (cfun
->returns_pcc_struct
2183 || (targetm
.calls
.struct_value_rtx
2184 (TREE_TYPE (current_function_decl
), 1)))
2185 return DECL_BY_REFERENCE (decl
);
2187 /* Otherwise, we're taking an extra all.function_result_decl
2188 argument. It's set up in assign_parms_augmented_arg_list,
2189 under the (negated) conditions above, and then it's used to
2190 set up the RESULT_DECL rtl in assign_params, after looping
2191 over all parameters. Now, if the RESULT_DECL is not by
2192 reference, we'll use a MEM either way. */
2193 if (!DECL_BY_REFERENCE (decl
))
2196 /* Otherwise, if RESULT_DECL is DECL_BY_REFERENCE, it will take
2197 the function_result_decl's assignment. Since it's a pointer,
2198 we can short-circuit a number of the tests below, and we must
2199 duplicat e them because we don't have the
2200 function_result_decl to test. */
2201 if (!targetm
.calls
.allocate_stack_slots_for_args ())
2203 /* We don't set DECL_IGNORED_P for the function_result_decl. */
2206 /* We don't set DECL_REGISTER for the function_result_decl. */
2210 /* Only register-like things go in registers. */
2211 if (DECL_MODE (decl
) == BLKmode
)
2214 /* If -ffloat-store specified, don't put explicit float variables
2216 /* ??? This should be checked after DECL_ARTIFICIAL, but tree-ssa
2217 propagates values across these stores, and it probably shouldn't. */
2218 if (flag_float_store
&& FLOAT_TYPE_P (TREE_TYPE (decl
)))
2221 if (!targetm
.calls
.allocate_stack_slots_for_args ())
2224 /* If we're not interested in tracking debugging information for
2225 this decl, then we can certainly put it in a register. */
2226 if (DECL_IGNORED_P (decl
))
2232 if (!DECL_REGISTER (decl
))
2235 /* When not optimizing, disregard register keyword for types that
2236 could have methods, otherwise the methods won't be callable from
2238 if (RECORD_OR_UNION_TYPE_P (TREE_TYPE (decl
)))
2244 /* Structures to communicate between the subroutines of assign_parms.
2245 The first holds data persistent across all parameters, the second
2246 is cleared out for each parameter. */
2248 struct assign_parm_data_all
2250 /* When INIT_CUMULATIVE_ARGS gets revamped, allocating CUMULATIVE_ARGS
2251 should become a job of the target or otherwise encapsulated. */
2252 CUMULATIVE_ARGS args_so_far_v
;
2253 cumulative_args_t args_so_far
;
2254 struct args_size stack_args_size
;
2255 tree function_result_decl
;
2257 rtx_insn
*first_conversion_insn
;
2258 rtx_insn
*last_conversion_insn
;
2259 HOST_WIDE_INT pretend_args_size
;
2260 HOST_WIDE_INT extra_pretend_bytes
;
2261 int reg_parm_stack_space
;
2264 struct assign_parm_data_one
2270 machine_mode nominal_mode
;
2271 machine_mode passed_mode
;
2272 machine_mode promoted_mode
;
2273 struct locate_and_pad_arg_data locate
;
2275 BOOL_BITFIELD named_arg
: 1;
2276 BOOL_BITFIELD passed_pointer
: 1;
2277 BOOL_BITFIELD on_stack
: 1;
2278 BOOL_BITFIELD loaded_in_reg
: 1;
2281 /* A subroutine of assign_parms. Initialize ALL. */
2284 assign_parms_initialize_all (struct assign_parm_data_all
*all
)
2286 tree fntype ATTRIBUTE_UNUSED
;
2288 memset (all
, 0, sizeof (*all
));
2290 fntype
= TREE_TYPE (current_function_decl
);
2292 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
2293 INIT_CUMULATIVE_INCOMING_ARGS (all
->args_so_far_v
, fntype
, NULL_RTX
);
2295 INIT_CUMULATIVE_ARGS (all
->args_so_far_v
, fntype
, NULL_RTX
,
2296 current_function_decl
, -1);
2298 all
->args_so_far
= pack_cumulative_args (&all
->args_so_far_v
);
2300 #ifdef INCOMING_REG_PARM_STACK_SPACE
2301 all
->reg_parm_stack_space
2302 = INCOMING_REG_PARM_STACK_SPACE (current_function_decl
);
2306 /* If ARGS contains entries with complex types, split the entry into two
2307 entries of the component type. Return a new list of substitutions are
2308 needed, else the old list. */
2311 split_complex_args (vec
<tree
> *args
)
2316 FOR_EACH_VEC_ELT (*args
, i
, p
)
2318 tree type
= TREE_TYPE (p
);
2319 if (TREE_CODE (type
) == COMPLEX_TYPE
2320 && targetm
.calls
.split_complex_arg (type
))
2323 tree subtype
= TREE_TYPE (type
);
2324 bool addressable
= TREE_ADDRESSABLE (p
);
2326 /* Rewrite the PARM_DECL's type with its component. */
2328 TREE_TYPE (p
) = subtype
;
2329 DECL_ARG_TYPE (p
) = TREE_TYPE (DECL_ARG_TYPE (p
));
2330 SET_DECL_MODE (p
, VOIDmode
);
2331 DECL_SIZE (p
) = NULL
;
2332 DECL_SIZE_UNIT (p
) = NULL
;
2333 /* If this arg must go in memory, put it in a pseudo here.
2334 We can't allow it to go in memory as per normal parms,
2335 because the usual place might not have the imag part
2336 adjacent to the real part. */
2337 DECL_ARTIFICIAL (p
) = addressable
;
2338 DECL_IGNORED_P (p
) = addressable
;
2339 TREE_ADDRESSABLE (p
) = 0;
2343 /* Build a second synthetic decl. */
2344 decl
= build_decl (EXPR_LOCATION (p
),
2345 PARM_DECL
, NULL_TREE
, subtype
);
2346 DECL_ARG_TYPE (decl
) = DECL_ARG_TYPE (p
);
2347 DECL_ARTIFICIAL (decl
) = addressable
;
2348 DECL_IGNORED_P (decl
) = addressable
;
2349 layout_decl (decl
, 0);
2350 args
->safe_insert (++i
, decl
);
2355 /* A subroutine of assign_parms. Adjust the parameter list to incorporate
2356 the hidden struct return argument, and (abi willing) complex args.
2357 Return the new parameter list. */
2360 assign_parms_augmented_arg_list (struct assign_parm_data_all
*all
)
2362 tree fndecl
= current_function_decl
;
2363 tree fntype
= TREE_TYPE (fndecl
);
2364 vec
<tree
> fnargs
= vNULL
;
2367 for (arg
= DECL_ARGUMENTS (fndecl
); arg
; arg
= DECL_CHAIN (arg
))
2368 fnargs
.safe_push (arg
);
2370 all
->orig_fnargs
= DECL_ARGUMENTS (fndecl
);
2372 /* If struct value address is treated as the first argument, make it so. */
2373 if (aggregate_value_p (DECL_RESULT (fndecl
), fndecl
)
2374 && ! cfun
->returns_pcc_struct
2375 && targetm
.calls
.struct_value_rtx (TREE_TYPE (fndecl
), 1) == 0)
2377 tree type
= build_pointer_type (TREE_TYPE (fntype
));
2380 decl
= build_decl (DECL_SOURCE_LOCATION (fndecl
),
2381 PARM_DECL
, get_identifier (".result_ptr"), type
);
2382 DECL_ARG_TYPE (decl
) = type
;
2383 DECL_ARTIFICIAL (decl
) = 1;
2384 DECL_NAMELESS (decl
) = 1;
2385 TREE_CONSTANT (decl
) = 1;
2386 /* We don't set DECL_IGNORED_P or DECL_REGISTER here. If this
2387 changes, the end of the RESULT_DECL handling block in
2388 use_register_for_decl must be adjusted to match. */
2390 DECL_CHAIN (decl
) = all
->orig_fnargs
;
2391 all
->orig_fnargs
= decl
;
2392 fnargs
.safe_insert (0, decl
);
2394 all
->function_result_decl
= decl
;
2397 /* If the target wants to split complex arguments into scalars, do so. */
2398 if (targetm
.calls
.split_complex_arg
)
2399 split_complex_args (&fnargs
);
2404 /* A subroutine of assign_parms. Examine PARM and pull out type and mode
2405 data for the parameter. Incorporate ABI specifics such as pass-by-
2406 reference and type promotion. */
2409 assign_parm_find_data_types (struct assign_parm_data_all
*all
, tree parm
,
2410 struct assign_parm_data_one
*data
)
2412 tree nominal_type
, passed_type
;
2413 machine_mode nominal_mode
, passed_mode
, promoted_mode
;
2416 memset (data
, 0, sizeof (*data
));
2418 /* NAMED_ARG is a misnomer. We really mean 'non-variadic'. */
2420 data
->named_arg
= 1; /* No variadic parms. */
2421 else if (DECL_CHAIN (parm
))
2422 data
->named_arg
= 1; /* Not the last non-variadic parm. */
2423 else if (targetm
.calls
.strict_argument_naming (all
->args_so_far
))
2424 data
->named_arg
= 1; /* Only variadic ones are unnamed. */
2426 data
->named_arg
= 0; /* Treat as variadic. */
2428 nominal_type
= TREE_TYPE (parm
);
2429 passed_type
= DECL_ARG_TYPE (parm
);
2431 /* Look out for errors propagating this far. Also, if the parameter's
2432 type is void then its value doesn't matter. */
2433 if (TREE_TYPE (parm
) == error_mark_node
2434 /* This can happen after weird syntax errors
2435 or if an enum type is defined among the parms. */
2436 || TREE_CODE (parm
) != PARM_DECL
2437 || passed_type
== NULL
2438 || VOID_TYPE_P (nominal_type
))
2440 nominal_type
= passed_type
= void_type_node
;
2441 nominal_mode
= passed_mode
= promoted_mode
= VOIDmode
;
2445 /* Find mode of arg as it is passed, and mode of arg as it should be
2446 during execution of this function. */
2447 passed_mode
= TYPE_MODE (passed_type
);
2448 nominal_mode
= TYPE_MODE (nominal_type
);
2450 /* If the parm is to be passed as a transparent union or record, use the
2451 type of the first field for the tests below. We have already verified
2452 that the modes are the same. */
2453 if ((TREE_CODE (passed_type
) == UNION_TYPE
2454 || TREE_CODE (passed_type
) == RECORD_TYPE
)
2455 && TYPE_TRANSPARENT_AGGR (passed_type
))
2456 passed_type
= TREE_TYPE (first_field (passed_type
));
2458 /* See if this arg was passed by invisible reference. */
2459 if (pass_by_reference (&all
->args_so_far_v
, passed_mode
,
2460 passed_type
, data
->named_arg
))
2462 passed_type
= nominal_type
= build_pointer_type (passed_type
);
2463 data
->passed_pointer
= true;
2464 passed_mode
= nominal_mode
= TYPE_MODE (nominal_type
);
2467 /* Find mode as it is passed by the ABI. */
2468 unsignedp
= TYPE_UNSIGNED (passed_type
);
2469 promoted_mode
= promote_function_mode (passed_type
, passed_mode
, &unsignedp
,
2470 TREE_TYPE (current_function_decl
), 0);
2473 data
->nominal_type
= nominal_type
;
2474 data
->passed_type
= passed_type
;
2475 data
->nominal_mode
= nominal_mode
;
2476 data
->passed_mode
= passed_mode
;
2477 data
->promoted_mode
= promoted_mode
;
2480 /* A subroutine of assign_parms. Invoke setup_incoming_varargs. */
2483 assign_parms_setup_varargs (struct assign_parm_data_all
*all
,
2484 struct assign_parm_data_one
*data
, bool no_rtl
)
2486 int varargs_pretend_bytes
= 0;
2488 targetm
.calls
.setup_incoming_varargs (all
->args_so_far
,
2489 data
->promoted_mode
,
2491 &varargs_pretend_bytes
, no_rtl
);
2493 /* If the back-end has requested extra stack space, record how much is
2494 needed. Do not change pretend_args_size otherwise since it may be
2495 nonzero from an earlier partial argument. */
2496 if (varargs_pretend_bytes
> 0)
2497 all
->pretend_args_size
= varargs_pretend_bytes
;
2500 /* A subroutine of assign_parms. Set DATA->ENTRY_PARM corresponding to
2501 the incoming location of the current parameter. */
2504 assign_parm_find_entry_rtl (struct assign_parm_data_all
*all
,
2505 struct assign_parm_data_one
*data
)
2507 HOST_WIDE_INT pretend_bytes
= 0;
2511 if (data
->promoted_mode
== VOIDmode
)
2513 data
->entry_parm
= data
->stack_parm
= const0_rtx
;
2517 targetm
.calls
.warn_parameter_passing_abi (all
->args_so_far
,
2520 entry_parm
= targetm
.calls
.function_incoming_arg (all
->args_so_far
,
2521 data
->promoted_mode
,
2525 if (entry_parm
== 0)
2526 data
->promoted_mode
= data
->passed_mode
;
2528 /* Determine parm's home in the stack, in case it arrives in the stack
2529 or we should pretend it did. Compute the stack position and rtx where
2530 the argument arrives and its size.
2532 There is one complexity here: If this was a parameter that would
2533 have been passed in registers, but wasn't only because it is
2534 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
2535 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
2536 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of 0
2537 as it was the previous time. */
2538 in_regs
= (entry_parm
!= 0);
2539 #ifdef STACK_PARMS_IN_REG_PARM_AREA
2542 if (!in_regs
&& !data
->named_arg
)
2544 if (targetm
.calls
.pretend_outgoing_varargs_named (all
->args_so_far
))
2547 tem
= targetm
.calls
.function_incoming_arg (all
->args_so_far
,
2548 data
->promoted_mode
,
2549 data
->passed_type
, true);
2550 in_regs
= tem
!= NULL
;
2554 /* If this parameter was passed both in registers and in the stack, use
2555 the copy on the stack. */
2556 if (targetm
.calls
.must_pass_in_stack (data
->promoted_mode
,
2564 partial
= targetm
.calls
.arg_partial_bytes (all
->args_so_far
,
2565 data
->promoted_mode
,
2568 data
->partial
= partial
;
2570 /* The caller might already have allocated stack space for the
2571 register parameters. */
2572 if (partial
!= 0 && all
->reg_parm_stack_space
== 0)
2574 /* Part of this argument is passed in registers and part
2575 is passed on the stack. Ask the prologue code to extend
2576 the stack part so that we can recreate the full value.
2578 PRETEND_BYTES is the size of the registers we need to store.
2579 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
2580 stack space that the prologue should allocate.
2582 Internally, gcc assumes that the argument pointer is aligned
2583 to STACK_BOUNDARY bits. This is used both for alignment
2584 optimizations (see init_emit) and to locate arguments that are
2585 aligned to more than PARM_BOUNDARY bits. We must preserve this
2586 invariant by rounding CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to
2587 a stack boundary. */
2589 /* We assume at most one partial arg, and it must be the first
2590 argument on the stack. */
2591 gcc_assert (!all
->extra_pretend_bytes
&& !all
->pretend_args_size
);
2593 pretend_bytes
= partial
;
2594 all
->pretend_args_size
= CEIL_ROUND (pretend_bytes
, STACK_BYTES
);
2596 /* We want to align relative to the actual stack pointer, so
2597 don't include this in the stack size until later. */
2598 all
->extra_pretend_bytes
= all
->pretend_args_size
;
2602 locate_and_pad_parm (data
->promoted_mode
, data
->passed_type
, in_regs
,
2603 all
->reg_parm_stack_space
,
2604 entry_parm
? data
->partial
: 0, current_function_decl
,
2605 &all
->stack_args_size
, &data
->locate
);
2607 /* Update parm_stack_boundary if this parameter is passed in the
2609 if (!in_regs
&& crtl
->parm_stack_boundary
< data
->locate
.boundary
)
2610 crtl
->parm_stack_boundary
= data
->locate
.boundary
;
2612 /* Adjust offsets to include the pretend args. */
2613 pretend_bytes
= all
->extra_pretend_bytes
- pretend_bytes
;
2614 data
->locate
.slot_offset
.constant
+= pretend_bytes
;
2615 data
->locate
.offset
.constant
+= pretend_bytes
;
2617 data
->entry_parm
= entry_parm
;
2620 /* A subroutine of assign_parms. If there is actually space on the stack
2621 for this parm, count it in stack_args_size and return true. */
2624 assign_parm_is_stack_parm (struct assign_parm_data_all
*all
,
2625 struct assign_parm_data_one
*data
)
2627 /* Trivially true if we've no incoming register. */
2628 if (data
->entry_parm
== NULL
)
2630 /* Also true if we're partially in registers and partially not,
2631 since we've arranged to drop the entire argument on the stack. */
2632 else if (data
->partial
!= 0)
2634 /* Also true if the target says that it's passed in both registers
2635 and on the stack. */
2636 else if (GET_CODE (data
->entry_parm
) == PARALLEL
2637 && XEXP (XVECEXP (data
->entry_parm
, 0, 0), 0) == NULL_RTX
)
2639 /* Also true if the target says that there's stack allocated for
2640 all register parameters. */
2641 else if (all
->reg_parm_stack_space
> 0)
2643 /* Otherwise, no, this parameter has no ABI defined stack slot. */
2647 all
->stack_args_size
.constant
+= data
->locate
.size
.constant
;
2648 if (data
->locate
.size
.var
)
2649 ADD_PARM_SIZE (all
->stack_args_size
, data
->locate
.size
.var
);
2654 /* A subroutine of assign_parms. Given that this parameter is allocated
2655 stack space by the ABI, find it. */
2658 assign_parm_find_stack_rtl (tree parm
, struct assign_parm_data_one
*data
)
2660 rtx offset_rtx
, stack_parm
;
2661 unsigned int align
, boundary
;
2663 /* If we're passing this arg using a reg, make its stack home the
2664 aligned stack slot. */
2665 if (data
->entry_parm
)
2666 offset_rtx
= ARGS_SIZE_RTX (data
->locate
.slot_offset
);
2668 offset_rtx
= ARGS_SIZE_RTX (data
->locate
.offset
);
2670 stack_parm
= crtl
->args
.internal_arg_pointer
;
2671 if (offset_rtx
!= const0_rtx
)
2672 stack_parm
= gen_rtx_PLUS (Pmode
, stack_parm
, offset_rtx
);
2673 stack_parm
= gen_rtx_MEM (data
->promoted_mode
, stack_parm
);
2675 if (!data
->passed_pointer
)
2677 set_mem_attributes (stack_parm
, parm
, 1);
2678 /* set_mem_attributes could set MEM_SIZE to the passed mode's size,
2679 while promoted mode's size is needed. */
2680 if (data
->promoted_mode
!= BLKmode
2681 && data
->promoted_mode
!= DECL_MODE (parm
))
2683 set_mem_size (stack_parm
, GET_MODE_SIZE (data
->promoted_mode
));
2684 if (MEM_EXPR (stack_parm
) && MEM_OFFSET_KNOWN_P (stack_parm
))
2686 poly_int64 offset
= subreg_lowpart_offset (DECL_MODE (parm
),
2687 data
->promoted_mode
);
2688 if (maybe_ne (offset
, 0))
2689 set_mem_offset (stack_parm
, MEM_OFFSET (stack_parm
) - offset
);
2694 boundary
= data
->locate
.boundary
;
2695 align
= BITS_PER_UNIT
;
2697 /* If we're padding upward, we know that the alignment of the slot
2698 is TARGET_FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
2699 intentionally forcing upward padding. Otherwise we have to come
2700 up with a guess at the alignment based on OFFSET_RTX. */
2702 if (data
->locate
.where_pad
!= PAD_DOWNWARD
|| data
->entry_parm
)
2704 else if (poly_int_rtx_p (offset_rtx
, &offset
))
2706 align
= least_bit_hwi (boundary
);
2707 unsigned int offset_align
= known_alignment (offset
) * BITS_PER_UNIT
;
2708 if (offset_align
!= 0)
2709 align
= MIN (align
, offset_align
);
2711 set_mem_align (stack_parm
, align
);
2713 if (data
->entry_parm
)
2714 set_reg_attrs_for_parm (data
->entry_parm
, stack_parm
);
2716 data
->stack_parm
= stack_parm
;
2719 /* A subroutine of assign_parms. Adjust DATA->ENTRY_RTL such that it's
2720 always valid and contiguous. */
2723 assign_parm_adjust_entry_rtl (struct assign_parm_data_one
*data
)
2725 rtx entry_parm
= data
->entry_parm
;
2726 rtx stack_parm
= data
->stack_parm
;
2728 /* If this parm was passed part in regs and part in memory, pretend it
2729 arrived entirely in memory by pushing the register-part onto the stack.
2730 In the special case of a DImode or DFmode that is split, we could put
2731 it together in a pseudoreg directly, but for now that's not worth
2733 if (data
->partial
!= 0)
2735 /* Handle calls that pass values in multiple non-contiguous
2736 locations. The Irix 6 ABI has examples of this. */
2737 if (GET_CODE (entry_parm
) == PARALLEL
)
2738 emit_group_store (validize_mem (copy_rtx (stack_parm
)), entry_parm
,
2740 int_size_in_bytes (data
->passed_type
));
2743 gcc_assert (data
->partial
% UNITS_PER_WORD
== 0);
2744 move_block_from_reg (REGNO (entry_parm
),
2745 validize_mem (copy_rtx (stack_parm
)),
2746 data
->partial
/ UNITS_PER_WORD
);
2749 entry_parm
= stack_parm
;
2752 /* If we didn't decide this parm came in a register, by default it came
2754 else if (entry_parm
== NULL
)
2755 entry_parm
= stack_parm
;
2757 /* When an argument is passed in multiple locations, we can't make use
2758 of this information, but we can save some copying if the whole argument
2759 is passed in a single register. */
2760 else if (GET_CODE (entry_parm
) == PARALLEL
2761 && data
->nominal_mode
!= BLKmode
2762 && data
->passed_mode
!= BLKmode
)
2764 size_t i
, len
= XVECLEN (entry_parm
, 0);
2766 for (i
= 0; i
< len
; i
++)
2767 if (XEXP (XVECEXP (entry_parm
, 0, i
), 0) != NULL_RTX
2768 && REG_P (XEXP (XVECEXP (entry_parm
, 0, i
), 0))
2769 && (GET_MODE (XEXP (XVECEXP (entry_parm
, 0, i
), 0))
2770 == data
->passed_mode
)
2771 && INTVAL (XEXP (XVECEXP (entry_parm
, 0, i
), 1)) == 0)
2773 entry_parm
= XEXP (XVECEXP (entry_parm
, 0, i
), 0);
2778 data
->entry_parm
= entry_parm
;
2781 /* A subroutine of assign_parms. Reconstitute any values which were
2782 passed in multiple registers and would fit in a single register. */
2785 assign_parm_remove_parallels (struct assign_parm_data_one
*data
)
2787 rtx entry_parm
= data
->entry_parm
;
2789 /* Convert the PARALLEL to a REG of the same mode as the parallel.
2790 This can be done with register operations rather than on the
2791 stack, even if we will store the reconstituted parameter on the
2793 if (GET_CODE (entry_parm
) == PARALLEL
&& GET_MODE (entry_parm
) != BLKmode
)
2795 rtx parmreg
= gen_reg_rtx (GET_MODE (entry_parm
));
2796 emit_group_store (parmreg
, entry_parm
, data
->passed_type
,
2797 GET_MODE_SIZE (GET_MODE (entry_parm
)));
2798 entry_parm
= parmreg
;
2801 data
->entry_parm
= entry_parm
;
2804 /* A subroutine of assign_parms. Adjust DATA->STACK_RTL such that it's
2805 always valid and properly aligned. */
2808 assign_parm_adjust_stack_rtl (struct assign_parm_data_one
*data
)
2810 rtx stack_parm
= data
->stack_parm
;
2812 /* If we can't trust the parm stack slot to be aligned enough for its
2813 ultimate type, don't use that slot after entry. We'll make another
2814 stack slot, if we need one. */
2816 && ((STRICT_ALIGNMENT
2817 && GET_MODE_ALIGNMENT (data
->nominal_mode
) > MEM_ALIGN (stack_parm
))
2818 || (data
->nominal_type
2819 && TYPE_ALIGN (data
->nominal_type
) > MEM_ALIGN (stack_parm
)
2820 && MEM_ALIGN (stack_parm
) < PREFERRED_STACK_BOUNDARY
)))
2823 /* If parm was passed in memory, and we need to convert it on entry,
2824 don't store it back in that same slot. */
2825 else if (data
->entry_parm
== stack_parm
2826 && data
->nominal_mode
!= BLKmode
2827 && data
->nominal_mode
!= data
->passed_mode
)
2830 /* If stack protection is in effect for this function, don't leave any
2831 pointers in their passed stack slots. */
2832 else if (crtl
->stack_protect_guard
2833 && (flag_stack_protect
== 2
2834 || data
->passed_pointer
2835 || POINTER_TYPE_P (data
->nominal_type
)))
2838 data
->stack_parm
= stack_parm
;
2841 /* A subroutine of assign_parms. Return true if the current parameter
2842 should be stored as a BLKmode in the current frame. */
2845 assign_parm_setup_block_p (struct assign_parm_data_one
*data
)
2847 if (data
->nominal_mode
== BLKmode
)
2849 if (GET_MODE (data
->entry_parm
) == BLKmode
)
2852 #ifdef BLOCK_REG_PADDING
2853 /* Only assign_parm_setup_block knows how to deal with register arguments
2854 that are padded at the least significant end. */
2855 if (REG_P (data
->entry_parm
)
2856 && known_lt (GET_MODE_SIZE (data
->promoted_mode
), UNITS_PER_WORD
)
2857 && (BLOCK_REG_PADDING (data
->passed_mode
, data
->passed_type
, 1)
2858 == (BYTES_BIG_ENDIAN
? PAD_UPWARD
: PAD_DOWNWARD
)))
2865 /* A subroutine of assign_parms. Arrange for the parameter to be
2866 present and valid in DATA->STACK_RTL. */
2869 assign_parm_setup_block (struct assign_parm_data_all
*all
,
2870 tree parm
, struct assign_parm_data_one
*data
)
2872 rtx entry_parm
= data
->entry_parm
;
2873 rtx stack_parm
= data
->stack_parm
;
2874 rtx target_reg
= NULL_RTX
;
2875 bool in_conversion_seq
= false;
2877 HOST_WIDE_INT size_stored
;
2879 if (GET_CODE (entry_parm
) == PARALLEL
)
2880 entry_parm
= emit_group_move_into_temps (entry_parm
);
2882 /* If we want the parameter in a pseudo, don't use a stack slot. */
2883 if (is_gimple_reg (parm
) && use_register_for_decl (parm
))
2885 tree def
= ssa_default_def (cfun
, parm
);
2887 machine_mode mode
= promote_ssa_mode (def
, NULL
);
2888 rtx reg
= gen_reg_rtx (mode
);
2889 if (GET_CODE (reg
) != CONCAT
)
2894 /* Avoid allocating a stack slot, if there isn't one
2895 preallocated by the ABI. It might seem like we should
2896 always prefer a pseudo, but converting between
2897 floating-point and integer modes goes through the stack
2898 on various machines, so it's better to use the reserved
2899 stack slot than to risk wasting it and allocating more
2900 for the conversion. */
2901 if (stack_parm
== NULL_RTX
)
2903 int save
= generating_concat_p
;
2904 generating_concat_p
= 0;
2905 stack_parm
= gen_reg_rtx (mode
);
2906 generating_concat_p
= save
;
2909 data
->stack_parm
= NULL
;
2912 size
= int_size_in_bytes (data
->passed_type
);
2913 size_stored
= CEIL_ROUND (size
, UNITS_PER_WORD
);
2914 if (stack_parm
== 0)
2916 HOST_WIDE_INT parm_align
2918 ? MAX (DECL_ALIGN (parm
), BITS_PER_WORD
) : DECL_ALIGN (parm
));
2920 SET_DECL_ALIGN (parm
, parm_align
);
2921 if (DECL_ALIGN (parm
) > MAX_SUPPORTED_STACK_ALIGNMENT
)
2923 rtx allocsize
= gen_int_mode (size_stored
, Pmode
);
2924 get_dynamic_stack_size (&allocsize
, 0, DECL_ALIGN (parm
), NULL
);
2925 stack_parm
= assign_stack_local (BLKmode
, UINTVAL (allocsize
),
2926 MAX_SUPPORTED_STACK_ALIGNMENT
);
2927 rtx addr
= align_dynamic_address (XEXP (stack_parm
, 0),
2929 mark_reg_pointer (addr
, DECL_ALIGN (parm
));
2930 stack_parm
= gen_rtx_MEM (GET_MODE (stack_parm
), addr
);
2931 MEM_NOTRAP_P (stack_parm
) = 1;
2934 stack_parm
= assign_stack_local (BLKmode
, size_stored
,
2936 if (known_eq (GET_MODE_SIZE (GET_MODE (entry_parm
)), size
))
2937 PUT_MODE (stack_parm
, GET_MODE (entry_parm
));
2938 set_mem_attributes (stack_parm
, parm
, 1);
2941 /* If a BLKmode arrives in registers, copy it to a stack slot. Handle
2942 calls that pass values in multiple non-contiguous locations. */
2943 if (REG_P (entry_parm
) || GET_CODE (entry_parm
) == PARALLEL
)
2947 /* Note that we will be storing an integral number of words.
2948 So we have to be careful to ensure that we allocate an
2949 integral number of words. We do this above when we call
2950 assign_stack_local if space was not allocated in the argument
2951 list. If it was, this will not work if PARM_BOUNDARY is not
2952 a multiple of BITS_PER_WORD. It isn't clear how to fix this
2953 if it becomes a problem. Exception is when BLKmode arrives
2954 with arguments not conforming to word_mode. */
2956 if (data
->stack_parm
== 0)
2958 else if (GET_CODE (entry_parm
) == PARALLEL
)
2961 gcc_assert (!size
|| !(PARM_BOUNDARY
% BITS_PER_WORD
));
2963 mem
= validize_mem (copy_rtx (stack_parm
));
2965 /* Handle values in multiple non-contiguous locations. */
2966 if (GET_CODE (entry_parm
) == PARALLEL
&& !MEM_P (mem
))
2967 emit_group_store (mem
, entry_parm
, data
->passed_type
, size
);
2968 else if (GET_CODE (entry_parm
) == PARALLEL
)
2970 push_to_sequence2 (all
->first_conversion_insn
,
2971 all
->last_conversion_insn
);
2972 emit_group_store (mem
, entry_parm
, data
->passed_type
, size
);
2973 all
->first_conversion_insn
= get_insns ();
2974 all
->last_conversion_insn
= get_last_insn ();
2976 in_conversion_seq
= true;
2982 /* If SIZE is that of a mode no bigger than a word, just use
2983 that mode's store operation. */
2984 else if (size
<= UNITS_PER_WORD
)
2986 unsigned int bits
= size
* BITS_PER_UNIT
;
2987 machine_mode mode
= int_mode_for_size (bits
, 0).else_blk ();
2990 #ifdef BLOCK_REG_PADDING
2991 && (size
== UNITS_PER_WORD
2992 || (BLOCK_REG_PADDING (mode
, data
->passed_type
, 1)
2993 != (BYTES_BIG_ENDIAN
? PAD_UPWARD
: PAD_DOWNWARD
)))
2999 /* We are really truncating a word_mode value containing
3000 SIZE bytes into a value of mode MODE. If such an
3001 operation requires no actual instructions, we can refer
3002 to the value directly in mode MODE, otherwise we must
3003 start with the register in word_mode and explicitly
3005 if (targetm
.truly_noop_truncation (size
* BITS_PER_UNIT
,
3007 reg
= gen_rtx_REG (mode
, REGNO (entry_parm
));
3010 reg
= gen_rtx_REG (word_mode
, REGNO (entry_parm
));
3011 reg
= convert_to_mode (mode
, copy_to_reg (reg
), 1);
3013 emit_move_insn (change_address (mem
, mode
, 0), reg
);
3016 #ifdef BLOCK_REG_PADDING
3017 /* Storing the register in memory as a full word, as
3018 move_block_from_reg below would do, and then using the
3019 MEM in a smaller mode, has the effect of shifting right
3020 if BYTES_BIG_ENDIAN. If we're bypassing memory, the
3021 shifting must be explicit. */
3022 else if (!MEM_P (mem
))
3026 /* If the assert below fails, we should have taken the
3027 mode != BLKmode path above, unless we have downward
3028 padding of smaller-than-word arguments on a machine
3029 with little-endian bytes, which would likely require
3030 additional changes to work correctly. */
3031 gcc_checking_assert (BYTES_BIG_ENDIAN
3032 && (BLOCK_REG_PADDING (mode
,
3033 data
->passed_type
, 1)
3036 int by
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
3038 x
= gen_rtx_REG (word_mode
, REGNO (entry_parm
));
3039 x
= expand_shift (RSHIFT_EXPR
, word_mode
, x
, by
,
3041 x
= force_reg (word_mode
, x
);
3042 x
= gen_lowpart_SUBREG (GET_MODE (mem
), x
);
3044 emit_move_insn (mem
, x
);
3048 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
3049 machine must be aligned to the left before storing
3050 to memory. Note that the previous test doesn't
3051 handle all cases (e.g. SIZE == 3). */
3052 else if (size
!= UNITS_PER_WORD
3053 #ifdef BLOCK_REG_PADDING
3054 && (BLOCK_REG_PADDING (mode
, data
->passed_type
, 1)
3062 int by
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
3063 rtx reg
= gen_rtx_REG (word_mode
, REGNO (entry_parm
));
3065 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, by
, NULL_RTX
, 1);
3066 tem
= change_address (mem
, word_mode
, 0);
3067 emit_move_insn (tem
, x
);
3070 move_block_from_reg (REGNO (entry_parm
), mem
,
3071 size_stored
/ UNITS_PER_WORD
);
3073 else if (!MEM_P (mem
))
3075 gcc_checking_assert (size
> UNITS_PER_WORD
);
3076 #ifdef BLOCK_REG_PADDING
3077 gcc_checking_assert (BLOCK_REG_PADDING (GET_MODE (mem
),
3078 data
->passed_type
, 0)
3081 emit_move_insn (mem
, entry_parm
);
3084 move_block_from_reg (REGNO (entry_parm
), mem
,
3085 size_stored
/ UNITS_PER_WORD
);
3087 else if (data
->stack_parm
== 0)
3089 push_to_sequence2 (all
->first_conversion_insn
, all
->last_conversion_insn
);
3090 emit_block_move (stack_parm
, data
->entry_parm
, GEN_INT (size
),
3092 all
->first_conversion_insn
= get_insns ();
3093 all
->last_conversion_insn
= get_last_insn ();
3095 in_conversion_seq
= true;
3100 if (!in_conversion_seq
)
3101 emit_move_insn (target_reg
, stack_parm
);
3104 push_to_sequence2 (all
->first_conversion_insn
,
3105 all
->last_conversion_insn
);
3106 emit_move_insn (target_reg
, stack_parm
);
3107 all
->first_conversion_insn
= get_insns ();
3108 all
->last_conversion_insn
= get_last_insn ();
3111 stack_parm
= target_reg
;
3114 data
->stack_parm
= stack_parm
;
3115 set_parm_rtl (parm
, stack_parm
);
3118 /* A subroutine of assign_parms. Allocate a pseudo to hold the current
3119 parameter. Get it there. Perform all ABI specified conversions. */
3122 assign_parm_setup_reg (struct assign_parm_data_all
*all
, tree parm
,
3123 struct assign_parm_data_one
*data
)
3125 rtx parmreg
, validated_mem
;
3126 rtx equiv_stack_parm
;
3127 machine_mode promoted_nominal_mode
;
3128 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (parm
));
3129 bool did_conversion
= false;
3130 bool need_conversion
, moved
;
3133 /* Store the parm in a pseudoregister during the function, but we may
3134 need to do it in a wider mode. Using 2 here makes the result
3135 consistent with promote_decl_mode and thus expand_expr_real_1. */
3136 promoted_nominal_mode
3137 = promote_function_mode (data
->nominal_type
, data
->nominal_mode
, &unsignedp
,
3138 TREE_TYPE (current_function_decl
), 2);
3140 parmreg
= gen_reg_rtx (promoted_nominal_mode
);
3141 if (!DECL_ARTIFICIAL (parm
))
3142 mark_user_reg (parmreg
);
3144 /* If this was an item that we received a pointer to,
3145 set rtl appropriately. */
3146 if (data
->passed_pointer
)
3148 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data
->passed_type
)), parmreg
);
3149 set_mem_attributes (rtl
, parm
, 1);
3154 assign_parm_remove_parallels (data
);
3156 /* Copy the value into the register, thus bridging between
3157 assign_parm_find_data_types and expand_expr_real_1. */
3159 equiv_stack_parm
= data
->stack_parm
;
3160 validated_mem
= validize_mem (copy_rtx (data
->entry_parm
));
3162 need_conversion
= (data
->nominal_mode
!= data
->passed_mode
3163 || promoted_nominal_mode
!= data
->promoted_mode
);
3167 && GET_MODE_CLASS (data
->nominal_mode
) == MODE_INT
3168 && data
->nominal_mode
== data
->passed_mode
3169 && data
->nominal_mode
== GET_MODE (data
->entry_parm
))
3171 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
3172 mode, by the caller. We now have to convert it to
3173 NOMINAL_MODE, if different. However, PARMREG may be in
3174 a different mode than NOMINAL_MODE if it is being stored
3177 If ENTRY_PARM is a hard register, it might be in a register
3178 not valid for operating in its mode (e.g., an odd-numbered
3179 register for a DFmode). In that case, moves are the only
3180 thing valid, so we can't do a convert from there. This
3181 occurs when the calling sequence allow such misaligned
3184 In addition, the conversion may involve a call, which could
3185 clobber parameters which haven't been copied to pseudo
3188 First, we try to emit an insn which performs the necessary
3189 conversion. We verify that this insn does not clobber any
3192 enum insn_code icode
;
3195 icode
= can_extend_p (promoted_nominal_mode
, data
->passed_mode
,
3199 op1
= validated_mem
;
3200 if (icode
!= CODE_FOR_nothing
3201 && insn_operand_matches (icode
, 0, op0
)
3202 && insn_operand_matches (icode
, 1, op1
))
3204 enum rtx_code code
= unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
;
3205 rtx_insn
*insn
, *insns
;
3207 HARD_REG_SET hardregs
;
3210 /* If op1 is a hard register that is likely spilled, first
3211 force it into a pseudo, otherwise combiner might extend
3212 its lifetime too much. */
3213 if (GET_CODE (t
) == SUBREG
)
3216 && HARD_REGISTER_P (t
)
3217 && ! TEST_HARD_REG_BIT (fixed_reg_set
, REGNO (t
))
3218 && targetm
.class_likely_spilled_p (REGNO_REG_CLASS (REGNO (t
))))
3220 t
= gen_reg_rtx (GET_MODE (op1
));
3221 emit_move_insn (t
, op1
);
3225 rtx_insn
*pat
= gen_extend_insn (op0
, t
, promoted_nominal_mode
,
3226 data
->passed_mode
, unsignedp
);
3228 insns
= get_insns ();
3231 CLEAR_HARD_REG_SET (hardregs
);
3232 for (insn
= insns
; insn
&& moved
; insn
= NEXT_INSN (insn
))
3235 note_stores (PATTERN (insn
), record_hard_reg_sets
,
3237 if (!hard_reg_set_empty_p (hardregs
))
3246 if (equiv_stack_parm
!= NULL_RTX
)
3247 equiv_stack_parm
= gen_rtx_fmt_e (code
, GET_MODE (parmreg
),
3254 /* Nothing to do. */
3256 else if (need_conversion
)
3258 /* We did not have an insn to convert directly, or the sequence
3259 generated appeared unsafe. We must first copy the parm to a
3260 pseudo reg, and save the conversion until after all
3261 parameters have been moved. */
3264 rtx tempreg
= gen_reg_rtx (GET_MODE (data
->entry_parm
));
3266 emit_move_insn (tempreg
, validated_mem
);
3268 push_to_sequence2 (all
->first_conversion_insn
, all
->last_conversion_insn
);
3269 tempreg
= convert_to_mode (data
->nominal_mode
, tempreg
, unsignedp
);
3271 if (partial_subreg_p (tempreg
)
3272 && GET_MODE (tempreg
) == data
->nominal_mode
3273 && REG_P (SUBREG_REG (tempreg
))
3274 && data
->nominal_mode
== data
->passed_mode
3275 && GET_MODE (SUBREG_REG (tempreg
)) == GET_MODE (data
->entry_parm
))
3277 /* The argument is already sign/zero extended, so note it
3279 SUBREG_PROMOTED_VAR_P (tempreg
) = 1;
3280 SUBREG_PROMOTED_SET (tempreg
, unsignedp
);
3283 /* TREE_USED gets set erroneously during expand_assignment. */
3284 save_tree_used
= TREE_USED (parm
);
3285 SET_DECL_RTL (parm
, rtl
);
3286 expand_assignment (parm
, make_tree (data
->nominal_type
, tempreg
), false);
3287 SET_DECL_RTL (parm
, NULL_RTX
);
3288 TREE_USED (parm
) = save_tree_used
;
3289 all
->first_conversion_insn
= get_insns ();
3290 all
->last_conversion_insn
= get_last_insn ();
3293 did_conversion
= true;
3296 emit_move_insn (parmreg
, validated_mem
);
3298 /* If we were passed a pointer but the actual value can safely live
3299 in a register, retrieve it and use it directly. */
3300 if (data
->passed_pointer
&& TYPE_MODE (TREE_TYPE (parm
)) != BLKmode
)
3302 /* We can't use nominal_mode, because it will have been set to
3303 Pmode above. We must use the actual mode of the parm. */
3304 if (use_register_for_decl (parm
))
3306 parmreg
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm
)));
3307 mark_user_reg (parmreg
);
3311 int align
= STACK_SLOT_ALIGNMENT (TREE_TYPE (parm
),
3312 TYPE_MODE (TREE_TYPE (parm
)),
3313 TYPE_ALIGN (TREE_TYPE (parm
)));
3315 = assign_stack_local (TYPE_MODE (TREE_TYPE (parm
)),
3316 GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (parm
))),
3318 set_mem_attributes (parmreg
, parm
, 1);
3321 /* We need to preserve an address based on VIRTUAL_STACK_VARS_REGNUM for
3322 the debug info in case it is not legitimate. */
3323 if (GET_MODE (parmreg
) != GET_MODE (rtl
))
3325 rtx tempreg
= gen_reg_rtx (GET_MODE (rtl
));
3326 int unsigned_p
= TYPE_UNSIGNED (TREE_TYPE (parm
));
3328 push_to_sequence2 (all
->first_conversion_insn
,
3329 all
->last_conversion_insn
);
3330 emit_move_insn (tempreg
, rtl
);
3331 tempreg
= convert_to_mode (GET_MODE (parmreg
), tempreg
, unsigned_p
);
3332 emit_move_insn (MEM_P (parmreg
) ? copy_rtx (parmreg
) : parmreg
,
3334 all
->first_conversion_insn
= get_insns ();
3335 all
->last_conversion_insn
= get_last_insn ();
3338 did_conversion
= true;
3341 emit_move_insn (MEM_P (parmreg
) ? copy_rtx (parmreg
) : parmreg
, rtl
);
3345 /* STACK_PARM is the pointer, not the parm, and PARMREG is
3347 data
->stack_parm
= NULL
;
3350 set_parm_rtl (parm
, rtl
);
3352 /* Mark the register as eliminable if we did no conversion and it was
3353 copied from memory at a fixed offset, and the arg pointer was not
3354 copied to a pseudo-reg. If the arg pointer is a pseudo reg or the
3355 offset formed an invalid address, such memory-equivalences as we
3356 make here would screw up life analysis for it. */
3357 if (data
->nominal_mode
== data
->passed_mode
3359 && data
->stack_parm
!= 0
3360 && MEM_P (data
->stack_parm
)
3361 && data
->locate
.offset
.var
== 0
3362 && reg_mentioned_p (virtual_incoming_args_rtx
,
3363 XEXP (data
->stack_parm
, 0)))
3365 rtx_insn
*linsn
= get_last_insn ();
3369 /* Mark complex types separately. */
3370 if (GET_CODE (parmreg
) == CONCAT
)
3372 scalar_mode submode
= GET_MODE_INNER (GET_MODE (parmreg
));
3373 int regnor
= REGNO (XEXP (parmreg
, 0));
3374 int regnoi
= REGNO (XEXP (parmreg
, 1));
3375 rtx stackr
= adjust_address_nv (data
->stack_parm
, submode
, 0);
3376 rtx stacki
= adjust_address_nv (data
->stack_parm
, submode
,
3377 GET_MODE_SIZE (submode
));
3379 /* Scan backwards for the set of the real and
3381 for (sinsn
= linsn
; sinsn
!= 0;
3382 sinsn
= prev_nonnote_insn (sinsn
))
3384 set
= single_set (sinsn
);
3388 if (SET_DEST (set
) == regno_reg_rtx
[regnoi
])
3389 set_unique_reg_note (sinsn
, REG_EQUIV
, stacki
);
3390 else if (SET_DEST (set
) == regno_reg_rtx
[regnor
])
3391 set_unique_reg_note (sinsn
, REG_EQUIV
, stackr
);
3395 set_dst_reg_note (linsn
, REG_EQUIV
, equiv_stack_parm
, parmreg
);
3398 /* For pointer data type, suggest pointer register. */
3399 if (POINTER_TYPE_P (TREE_TYPE (parm
)))
3400 mark_reg_pointer (parmreg
,
3401 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
))));
3404 /* A subroutine of assign_parms. Allocate stack space to hold the current
3405 parameter. Get it there. Perform all ABI specified conversions. */
3408 assign_parm_setup_stack (struct assign_parm_data_all
*all
, tree parm
,
3409 struct assign_parm_data_one
*data
)
3411 /* Value must be stored in the stack slot STACK_PARM during function
3413 bool to_conversion
= false;
3415 assign_parm_remove_parallels (data
);
3417 if (data
->promoted_mode
!= data
->nominal_mode
)
3419 /* Conversion is required. */
3420 rtx tempreg
= gen_reg_rtx (GET_MODE (data
->entry_parm
));
3422 emit_move_insn (tempreg
, validize_mem (copy_rtx (data
->entry_parm
)));
3424 push_to_sequence2 (all
->first_conversion_insn
, all
->last_conversion_insn
);
3425 to_conversion
= true;
3427 data
->entry_parm
= convert_to_mode (data
->nominal_mode
, tempreg
,
3428 TYPE_UNSIGNED (TREE_TYPE (parm
)));
3430 if (data
->stack_parm
)
3433 = subreg_lowpart_offset (data
->nominal_mode
,
3434 GET_MODE (data
->stack_parm
));
3435 /* ??? This may need a big-endian conversion on sparc64. */
3437 = adjust_address (data
->stack_parm
, data
->nominal_mode
, 0);
3438 if (maybe_ne (offset
, 0) && MEM_OFFSET_KNOWN_P (data
->stack_parm
))
3439 set_mem_offset (data
->stack_parm
,
3440 MEM_OFFSET (data
->stack_parm
) + offset
);
3444 if (data
->entry_parm
!= data
->stack_parm
)
3448 if (data
->stack_parm
== 0)
3450 int align
= STACK_SLOT_ALIGNMENT (data
->passed_type
,
3451 GET_MODE (data
->entry_parm
),
3452 TYPE_ALIGN (data
->passed_type
));
3454 = assign_stack_local (GET_MODE (data
->entry_parm
),
3455 GET_MODE_SIZE (GET_MODE (data
->entry_parm
)),
3457 set_mem_attributes (data
->stack_parm
, parm
, 1);
3460 dest
= validize_mem (copy_rtx (data
->stack_parm
));
3461 src
= validize_mem (copy_rtx (data
->entry_parm
));
3465 /* Use a block move to handle potentially misaligned entry_parm. */
3467 push_to_sequence2 (all
->first_conversion_insn
,
3468 all
->last_conversion_insn
);
3469 to_conversion
= true;
3471 emit_block_move (dest
, src
,
3472 GEN_INT (int_size_in_bytes (data
->passed_type
)),
3478 src
= force_reg (GET_MODE (src
), src
);
3479 emit_move_insn (dest
, src
);
3485 all
->first_conversion_insn
= get_insns ();
3486 all
->last_conversion_insn
= get_last_insn ();
3490 set_parm_rtl (parm
, data
->stack_parm
);
3493 /* A subroutine of assign_parms. If the ABI splits complex arguments, then
3494 undo the frobbing that we did in assign_parms_augmented_arg_list. */
3497 assign_parms_unsplit_complex (struct assign_parm_data_all
*all
,
3501 tree orig_fnargs
= all
->orig_fnargs
;
3504 for (parm
= orig_fnargs
; parm
; parm
= TREE_CHAIN (parm
), ++i
)
3506 if (TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
3507 && targetm
.calls
.split_complex_arg (TREE_TYPE (parm
)))
3509 rtx tmp
, real
, imag
;
3510 scalar_mode inner
= GET_MODE_INNER (DECL_MODE (parm
));
3512 real
= DECL_RTL (fnargs
[i
]);
3513 imag
= DECL_RTL (fnargs
[i
+ 1]);
3514 if (inner
!= GET_MODE (real
))
3516 real
= gen_lowpart_SUBREG (inner
, real
);
3517 imag
= gen_lowpart_SUBREG (inner
, imag
);
3520 if (TREE_ADDRESSABLE (parm
))
3523 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (parm
));
3524 int align
= STACK_SLOT_ALIGNMENT (TREE_TYPE (parm
),
3526 TYPE_ALIGN (TREE_TYPE (parm
)));
3528 /* split_complex_arg put the real and imag parts in
3529 pseudos. Move them to memory. */
3530 tmp
= assign_stack_local (DECL_MODE (parm
), size
, align
);
3531 set_mem_attributes (tmp
, parm
, 1);
3532 rmem
= adjust_address_nv (tmp
, inner
, 0);
3533 imem
= adjust_address_nv (tmp
, inner
, GET_MODE_SIZE (inner
));
3534 push_to_sequence2 (all
->first_conversion_insn
,
3535 all
->last_conversion_insn
);
3536 emit_move_insn (rmem
, real
);
3537 emit_move_insn (imem
, imag
);
3538 all
->first_conversion_insn
= get_insns ();
3539 all
->last_conversion_insn
= get_last_insn ();
3543 tmp
= gen_rtx_CONCAT (DECL_MODE (parm
), real
, imag
);
3544 set_parm_rtl (parm
, tmp
);
3546 real
= DECL_INCOMING_RTL (fnargs
[i
]);
3547 imag
= DECL_INCOMING_RTL (fnargs
[i
+ 1]);
3548 if (inner
!= GET_MODE (real
))
3550 real
= gen_lowpart_SUBREG (inner
, real
);
3551 imag
= gen_lowpart_SUBREG (inner
, imag
);
3553 tmp
= gen_rtx_CONCAT (DECL_MODE (parm
), real
, imag
);
3554 set_decl_incoming_rtl (parm
, tmp
, false);
3560 /* Assign RTL expressions to the function's parameters. This may involve
3561 copying them into registers and using those registers as the DECL_RTL. */
3564 assign_parms (tree fndecl
)
3566 struct assign_parm_data_all all
;
3571 crtl
->args
.internal_arg_pointer
3572 = targetm
.calls
.internal_arg_pointer ();
3574 assign_parms_initialize_all (&all
);
3575 fnargs
= assign_parms_augmented_arg_list (&all
);
3577 FOR_EACH_VEC_ELT (fnargs
, i
, parm
)
3579 struct assign_parm_data_one data
;
3581 /* Extract the type of PARM; adjust it according to ABI. */
3582 assign_parm_find_data_types (&all
, parm
, &data
);
3584 /* Early out for errors and void parameters. */
3585 if (data
.passed_mode
== VOIDmode
)
3587 SET_DECL_RTL (parm
, const0_rtx
);
3588 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
);
3592 /* Estimate stack alignment from parameter alignment. */
3593 if (SUPPORTS_STACK_ALIGNMENT
)
3596 = targetm
.calls
.function_arg_boundary (data
.promoted_mode
,
3598 align
= MINIMUM_ALIGNMENT (data
.passed_type
, data
.promoted_mode
,
3600 if (TYPE_ALIGN (data
.nominal_type
) > align
)
3601 align
= MINIMUM_ALIGNMENT (data
.nominal_type
,
3602 TYPE_MODE (data
.nominal_type
),
3603 TYPE_ALIGN (data
.nominal_type
));
3604 if (crtl
->stack_alignment_estimated
< align
)
3606 gcc_assert (!crtl
->stack_realign_processed
);
3607 crtl
->stack_alignment_estimated
= align
;
3611 /* Find out where the parameter arrives in this function. */
3612 assign_parm_find_entry_rtl (&all
, &data
);
3614 /* Find out where stack space for this parameter might be. */
3615 if (assign_parm_is_stack_parm (&all
, &data
))
3617 assign_parm_find_stack_rtl (parm
, &data
);
3618 assign_parm_adjust_entry_rtl (&data
);
3620 /* Record permanently how this parm was passed. */
3621 if (data
.passed_pointer
)
3624 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data
.passed_type
)),
3626 set_decl_incoming_rtl (parm
, incoming_rtl
, true);
3629 set_decl_incoming_rtl (parm
, data
.entry_parm
, false);
3631 assign_parm_adjust_stack_rtl (&data
);
3633 if (assign_parm_setup_block_p (&data
))
3634 assign_parm_setup_block (&all
, parm
, &data
);
3635 else if (data
.passed_pointer
|| use_register_for_decl (parm
))
3636 assign_parm_setup_reg (&all
, parm
, &data
);
3638 assign_parm_setup_stack (&all
, parm
, &data
);
3640 if (cfun
->stdarg
&& !DECL_CHAIN (parm
))
3641 assign_parms_setup_varargs (&all
, &data
, false);
3643 /* Update info on where next arg arrives in registers. */
3644 targetm
.calls
.function_arg_advance (all
.args_so_far
, data
.promoted_mode
,
3645 data
.passed_type
, data
.named_arg
);
3648 if (targetm
.calls
.split_complex_arg
)
3649 assign_parms_unsplit_complex (&all
, fnargs
);
3653 /* Output all parameter conversion instructions (possibly including calls)
3654 now that all parameters have been copied out of hard registers. */
3655 emit_insn (all
.first_conversion_insn
);
3657 /* Estimate reload stack alignment from scalar return mode. */
3658 if (SUPPORTS_STACK_ALIGNMENT
)
3660 if (DECL_RESULT (fndecl
))
3662 tree type
= TREE_TYPE (DECL_RESULT (fndecl
));
3663 machine_mode mode
= TYPE_MODE (type
);
3667 && !AGGREGATE_TYPE_P (type
))
3669 unsigned int align
= GET_MODE_ALIGNMENT (mode
);
3670 if (crtl
->stack_alignment_estimated
< align
)
3672 gcc_assert (!crtl
->stack_realign_processed
);
3673 crtl
->stack_alignment_estimated
= align
;
3679 /* If we are receiving a struct value address as the first argument, set up
3680 the RTL for the function result. As this might require code to convert
3681 the transmitted address to Pmode, we do this here to ensure that possible
3682 preliminary conversions of the address have been emitted already. */
3683 if (all
.function_result_decl
)
3685 tree result
= DECL_RESULT (current_function_decl
);
3686 rtx addr
= DECL_RTL (all
.function_result_decl
);
3689 if (DECL_BY_REFERENCE (result
))
3691 SET_DECL_VALUE_EXPR (result
, all
.function_result_decl
);
3696 SET_DECL_VALUE_EXPR (result
,
3697 build1 (INDIRECT_REF
, TREE_TYPE (result
),
3698 all
.function_result_decl
));
3699 addr
= convert_memory_address (Pmode
, addr
);
3700 x
= gen_rtx_MEM (DECL_MODE (result
), addr
);
3701 set_mem_attributes (x
, result
, 1);
3704 DECL_HAS_VALUE_EXPR_P (result
) = 1;
3706 set_parm_rtl (result
, x
);
3709 /* We have aligned all the args, so add space for the pretend args. */
3710 crtl
->args
.pretend_args_size
= all
.pretend_args_size
;
3711 all
.stack_args_size
.constant
+= all
.extra_pretend_bytes
;
3712 crtl
->args
.size
= all
.stack_args_size
.constant
;
3714 /* Adjust function incoming argument size for alignment and
3717 crtl
->args
.size
= upper_bound (crtl
->args
.size
, all
.reg_parm_stack_space
);
3718 crtl
->args
.size
= aligned_upper_bound (crtl
->args
.size
,
3719 PARM_BOUNDARY
/ BITS_PER_UNIT
);
3721 if (ARGS_GROW_DOWNWARD
)
3723 crtl
->args
.arg_offset_rtx
3724 = (all
.stack_args_size
.var
== 0
3725 ? gen_int_mode (-all
.stack_args_size
.constant
, Pmode
)
3726 : expand_expr (size_diffop (all
.stack_args_size
.var
,
3727 size_int (-all
.stack_args_size
.constant
)),
3728 NULL_RTX
, VOIDmode
, EXPAND_NORMAL
));
3731 crtl
->args
.arg_offset_rtx
= ARGS_SIZE_RTX (all
.stack_args_size
);
3733 /* See how many bytes, if any, of its args a function should try to pop
3736 crtl
->args
.pops_args
= targetm
.calls
.return_pops_args (fndecl
,
3740 /* For stdarg.h function, save info about
3741 regs and stack space used by the named args. */
3743 crtl
->args
.info
= all
.args_so_far_v
;
3745 /* Set the rtx used for the function return value. Put this in its
3746 own variable so any optimizers that need this information don't have
3747 to include tree.h. Do this here so it gets done when an inlined
3748 function gets output. */
3751 = (DECL_RTL_SET_P (DECL_RESULT (fndecl
))
3752 ? DECL_RTL (DECL_RESULT (fndecl
)) : NULL_RTX
);
3754 /* If scalar return value was computed in a pseudo-reg, or was a named
3755 return value that got dumped to the stack, copy that to the hard
3757 if (DECL_RTL_SET_P (DECL_RESULT (fndecl
)))
3759 tree decl_result
= DECL_RESULT (fndecl
);
3760 rtx decl_rtl
= DECL_RTL (decl_result
);
3762 if (REG_P (decl_rtl
)
3763 ? REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
3764 : DECL_REGISTER (decl_result
))
3768 real_decl_rtl
= targetm
.calls
.function_value (TREE_TYPE (decl_result
),
3770 REG_FUNCTION_VALUE_P (real_decl_rtl
) = 1;
3771 /* The delay slot scheduler assumes that crtl->return_rtx
3772 holds the hard register containing the return value, not a
3773 temporary pseudo. */
3774 crtl
->return_rtx
= real_decl_rtl
;
3779 /* A subroutine of gimplify_parameters, invoked via walk_tree.
3780 For all seen types, gimplify their sizes. */
3783 gimplify_parm_type (tree
*tp
, int *walk_subtrees
, void *data
)
3790 if (POINTER_TYPE_P (t
))
3792 else if (TYPE_SIZE (t
) && !TREE_CONSTANT (TYPE_SIZE (t
))
3793 && !TYPE_SIZES_GIMPLIFIED (t
))
3795 gimplify_type_sizes (t
, (gimple_seq
*) data
);
3803 /* Gimplify the parameter list for current_function_decl. This involves
3804 evaluating SAVE_EXPRs of variable sized parameters and generating code
3805 to implement callee-copies reference parameters. Returns a sequence of
3806 statements to add to the beginning of the function. */
3809 gimplify_parameters (gimple_seq
*cleanup
)
3811 struct assign_parm_data_all all
;
3813 gimple_seq stmts
= NULL
;
3817 assign_parms_initialize_all (&all
);
3818 fnargs
= assign_parms_augmented_arg_list (&all
);
3820 FOR_EACH_VEC_ELT (fnargs
, i
, parm
)
3822 struct assign_parm_data_one data
;
3824 /* Extract the type of PARM; adjust it according to ABI. */
3825 assign_parm_find_data_types (&all
, parm
, &data
);
3827 /* Early out for errors and void parameters. */
3828 if (data
.passed_mode
== VOIDmode
|| DECL_SIZE (parm
) == NULL
)
3831 /* Update info on where next arg arrives in registers. */
3832 targetm
.calls
.function_arg_advance (all
.args_so_far
, data
.promoted_mode
,
3833 data
.passed_type
, data
.named_arg
);
3835 /* ??? Once upon a time variable_size stuffed parameter list
3836 SAVE_EXPRs (amongst others) onto a pending sizes list. This
3837 turned out to be less than manageable in the gimple world.
3838 Now we have to hunt them down ourselves. */
3839 walk_tree_without_duplicates (&data
.passed_type
,
3840 gimplify_parm_type
, &stmts
);
3842 if (TREE_CODE (DECL_SIZE_UNIT (parm
)) != INTEGER_CST
)
3844 gimplify_one_sizepos (&DECL_SIZE (parm
), &stmts
);
3845 gimplify_one_sizepos (&DECL_SIZE_UNIT (parm
), &stmts
);
3848 if (data
.passed_pointer
)
3850 tree type
= TREE_TYPE (data
.passed_type
);
3851 if (reference_callee_copied (&all
.args_so_far_v
, TYPE_MODE (type
),
3852 type
, data
.named_arg
))
3856 /* For constant-sized objects, this is trivial; for
3857 variable-sized objects, we have to play games. */
3858 if (TREE_CODE (DECL_SIZE_UNIT (parm
)) == INTEGER_CST
3859 && !(flag_stack_check
== GENERIC_STACK_CHECK
3860 && compare_tree_int (DECL_SIZE_UNIT (parm
),
3861 STACK_CHECK_MAX_VAR_SIZE
) > 0))
3863 local
= create_tmp_var (type
, get_name (parm
));
3864 DECL_IGNORED_P (local
) = 0;
3865 /* If PARM was addressable, move that flag over
3866 to the local copy, as its address will be taken,
3867 not the PARMs. Keep the parms address taken
3868 as we'll query that flag during gimplification. */
3869 if (TREE_ADDRESSABLE (parm
))
3870 TREE_ADDRESSABLE (local
) = 1;
3871 else if (TREE_CODE (type
) == COMPLEX_TYPE
3872 || TREE_CODE (type
) == VECTOR_TYPE
)
3873 DECL_GIMPLE_REG_P (local
) = 1;
3875 if (!is_gimple_reg (local
)
3876 && flag_stack_reuse
!= SR_NONE
)
3878 tree clobber
= build_constructor (type
, NULL
);
3879 gimple
*clobber_stmt
;
3880 TREE_THIS_VOLATILE (clobber
) = 1;
3881 clobber_stmt
= gimple_build_assign (local
, clobber
);
3882 gimple_seq_add_stmt (cleanup
, clobber_stmt
);
3887 tree ptr_type
, addr
;
3889 ptr_type
= build_pointer_type (type
);
3890 addr
= create_tmp_reg (ptr_type
, get_name (parm
));
3891 DECL_IGNORED_P (addr
) = 0;
3892 local
= build_fold_indirect_ref (addr
);
3894 t
= build_alloca_call_expr (DECL_SIZE_UNIT (parm
),
3896 max_int_size_in_bytes (type
));
3897 /* The call has been built for a variable-sized object. */
3898 CALL_ALLOCA_FOR_VAR_P (t
) = 1;
3899 t
= fold_convert (ptr_type
, t
);
3900 t
= build2 (MODIFY_EXPR
, TREE_TYPE (addr
), addr
, t
);
3901 gimplify_and_add (t
, &stmts
);
3904 gimplify_assign (local
, parm
, &stmts
);
3906 SET_DECL_VALUE_EXPR (parm
, local
);
3907 DECL_HAS_VALUE_EXPR_P (parm
) = 1;
3917 /* Compute the size and offset from the start of the stacked arguments for a
3918 parm passed in mode PASSED_MODE and with type TYPE.
3920 INITIAL_OFFSET_PTR points to the current offset into the stacked
3923 The starting offset and size for this parm are returned in
3924 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
3925 nonzero, the offset is that of stack slot, which is returned in
3926 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
3927 padding required from the initial offset ptr to the stack slot.
3929 IN_REGS is nonzero if the argument will be passed in registers. It will
3930 never be set if REG_PARM_STACK_SPACE is not defined.
3932 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
3933 for arguments which are passed in registers.
3935 FNDECL is the function in which the argument was defined.
3937 There are two types of rounding that are done. The first, controlled by
3938 TARGET_FUNCTION_ARG_BOUNDARY, forces the offset from the start of the
3939 argument list to be aligned to the specific boundary (in bits). This
3940 rounding affects the initial and starting offsets, but not the argument
3943 The second, controlled by TARGET_FUNCTION_ARG_PADDING and PARM_BOUNDARY,
3944 optionally rounds the size of the parm to PARM_BOUNDARY. The
3945 initial offset is not affected by this rounding, while the size always
3946 is and the starting offset may be. */
3948 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
3949 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
3950 callers pass in the total size of args so far as
3951 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
3954 locate_and_pad_parm (machine_mode passed_mode
, tree type
, int in_regs
,
3955 int reg_parm_stack_space
, int partial
,
3956 tree fndecl ATTRIBUTE_UNUSED
,
3957 struct args_size
*initial_offset_ptr
,
3958 struct locate_and_pad_arg_data
*locate
)
3961 pad_direction where_pad
;
3962 unsigned int boundary
, round_boundary
;
3963 int part_size_in_regs
;
3965 /* If we have found a stack parm before we reach the end of the
3966 area reserved for registers, skip that area. */
3969 if (reg_parm_stack_space
> 0)
3971 if (initial_offset_ptr
->var
3972 || !ordered_p (initial_offset_ptr
->constant
,
3973 reg_parm_stack_space
))
3975 initial_offset_ptr
->var
3976 = size_binop (MAX_EXPR
, ARGS_SIZE_TREE (*initial_offset_ptr
),
3977 ssize_int (reg_parm_stack_space
));
3978 initial_offset_ptr
->constant
= 0;
3981 initial_offset_ptr
->constant
3982 = ordered_max (initial_offset_ptr
->constant
,
3983 reg_parm_stack_space
);
3987 part_size_in_regs
= (reg_parm_stack_space
== 0 ? partial
: 0);
3990 ? arg_size_in_bytes (type
)
3991 : size_int (GET_MODE_SIZE (passed_mode
)));
3992 where_pad
= targetm
.calls
.function_arg_padding (passed_mode
, type
);
3993 boundary
= targetm
.calls
.function_arg_boundary (passed_mode
, type
);
3994 round_boundary
= targetm
.calls
.function_arg_round_boundary (passed_mode
,
3996 locate
->where_pad
= where_pad
;
3998 /* Alignment can't exceed MAX_SUPPORTED_STACK_ALIGNMENT. */
3999 if (boundary
> MAX_SUPPORTED_STACK_ALIGNMENT
)
4000 boundary
= MAX_SUPPORTED_STACK_ALIGNMENT
;
4002 locate
->boundary
= boundary
;
4004 if (SUPPORTS_STACK_ALIGNMENT
)
4006 /* stack_alignment_estimated can't change after stack has been
4008 if (crtl
->stack_alignment_estimated
< boundary
)
4010 if (!crtl
->stack_realign_processed
)
4011 crtl
->stack_alignment_estimated
= boundary
;
4014 /* If stack is realigned and stack alignment value
4015 hasn't been finalized, it is OK not to increase
4016 stack_alignment_estimated. The bigger alignment
4017 requirement is recorded in stack_alignment_needed
4019 gcc_assert (!crtl
->stack_realign_finalized
4020 && crtl
->stack_realign_needed
);
4025 if (ARGS_GROW_DOWNWARD
)
4027 locate
->slot_offset
.constant
= -initial_offset_ptr
->constant
;
4028 if (initial_offset_ptr
->var
)
4029 locate
->slot_offset
.var
= size_binop (MINUS_EXPR
, ssize_int (0),
4030 initial_offset_ptr
->var
);
4034 if (where_pad
!= PAD_NONE
4035 && (!tree_fits_uhwi_p (sizetree
)
4036 || (tree_to_uhwi (sizetree
) * BITS_PER_UNIT
) % round_boundary
))
4037 s2
= round_up (s2
, round_boundary
/ BITS_PER_UNIT
);
4038 SUB_PARM_SIZE (locate
->slot_offset
, s2
);
4041 locate
->slot_offset
.constant
+= part_size_in_regs
;
4043 if (!in_regs
|| reg_parm_stack_space
> 0)
4044 pad_to_arg_alignment (&locate
->slot_offset
, boundary
,
4045 &locate
->alignment_pad
);
4047 locate
->size
.constant
= (-initial_offset_ptr
->constant
4048 - locate
->slot_offset
.constant
);
4049 if (initial_offset_ptr
->var
)
4050 locate
->size
.var
= size_binop (MINUS_EXPR
,
4051 size_binop (MINUS_EXPR
,
4053 initial_offset_ptr
->var
),
4054 locate
->slot_offset
.var
);
4056 /* Pad_below needs the pre-rounded size to know how much to pad
4058 locate
->offset
= locate
->slot_offset
;
4059 if (where_pad
== PAD_DOWNWARD
)
4060 pad_below (&locate
->offset
, passed_mode
, sizetree
);
4065 if (!in_regs
|| reg_parm_stack_space
> 0)
4066 pad_to_arg_alignment (initial_offset_ptr
, boundary
,
4067 &locate
->alignment_pad
);
4068 locate
->slot_offset
= *initial_offset_ptr
;
4070 #ifdef PUSH_ROUNDING
4071 if (passed_mode
!= BLKmode
)
4072 sizetree
= size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree
)));
4075 /* Pad_below needs the pre-rounded size to know how much to pad below
4076 so this must be done before rounding up. */
4077 locate
->offset
= locate
->slot_offset
;
4078 if (where_pad
== PAD_DOWNWARD
)
4079 pad_below (&locate
->offset
, passed_mode
, sizetree
);
4081 if (where_pad
!= PAD_NONE
4082 && (!tree_fits_uhwi_p (sizetree
)
4083 || (tree_to_uhwi (sizetree
) * BITS_PER_UNIT
) % round_boundary
))
4084 sizetree
= round_up (sizetree
, round_boundary
/ BITS_PER_UNIT
);
4086 ADD_PARM_SIZE (locate
->size
, sizetree
);
4088 locate
->size
.constant
-= part_size_in_regs
;
4091 locate
->offset
.constant
4092 += targetm
.calls
.function_arg_offset (passed_mode
, type
);
4095 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
4096 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
4099 pad_to_arg_alignment (struct args_size
*offset_ptr
, int boundary
,
4100 struct args_size
*alignment_pad
)
4102 tree save_var
= NULL_TREE
;
4103 poly_int64 save_constant
= 0;
4104 int boundary_in_bytes
= boundary
/ BITS_PER_UNIT
;
4105 poly_int64 sp_offset
= STACK_POINTER_OFFSET
;
4107 #ifdef SPARC_STACK_BOUNDARY_HACK
4108 /* ??? The SPARC port may claim a STACK_BOUNDARY higher than
4109 the real alignment of %sp. However, when it does this, the
4110 alignment of %sp+STACK_POINTER_OFFSET is STACK_BOUNDARY. */
4111 if (SPARC_STACK_BOUNDARY_HACK
)
4115 if (boundary
> PARM_BOUNDARY
)
4117 save_var
= offset_ptr
->var
;
4118 save_constant
= offset_ptr
->constant
;
4121 alignment_pad
->var
= NULL_TREE
;
4122 alignment_pad
->constant
= 0;
4124 if (boundary
> BITS_PER_UNIT
)
4128 || !known_misalignment (offset_ptr
->constant
+ sp_offset
,
4129 boundary_in_bytes
, &misalign
))
4131 tree sp_offset_tree
= ssize_int (sp_offset
);
4132 tree offset
= size_binop (PLUS_EXPR
,
4133 ARGS_SIZE_TREE (*offset_ptr
),
4136 if (ARGS_GROW_DOWNWARD
)
4137 rounded
= round_down (offset
, boundary
/ BITS_PER_UNIT
);
4139 rounded
= round_up (offset
, boundary
/ BITS_PER_UNIT
);
4141 offset_ptr
->var
= size_binop (MINUS_EXPR
, rounded
, sp_offset_tree
);
4142 /* ARGS_SIZE_TREE includes constant term. */
4143 offset_ptr
->constant
= 0;
4144 if (boundary
> PARM_BOUNDARY
)
4145 alignment_pad
->var
= size_binop (MINUS_EXPR
, offset_ptr
->var
,
4150 if (ARGS_GROW_DOWNWARD
)
4151 offset_ptr
->constant
-= misalign
;
4153 offset_ptr
->constant
+= -misalign
& (boundary_in_bytes
- 1);
4155 if (boundary
> PARM_BOUNDARY
)
4156 alignment_pad
->constant
= offset_ptr
->constant
- save_constant
;
4162 pad_below (struct args_size
*offset_ptr
, machine_mode passed_mode
, tree sizetree
)
4164 unsigned int align
= PARM_BOUNDARY
/ BITS_PER_UNIT
;
4166 if (passed_mode
!= BLKmode
4167 && known_misalignment (GET_MODE_SIZE (passed_mode
), align
, &misalign
))
4168 offset_ptr
->constant
+= -misalign
& (align
- 1);
4171 if (TREE_CODE (sizetree
) != INTEGER_CST
4172 || (TREE_INT_CST_LOW (sizetree
) & (align
- 1)) != 0)
4174 /* Round the size up to multiple of PARM_BOUNDARY bits. */
4175 tree s2
= round_up (sizetree
, align
);
4177 ADD_PARM_SIZE (*offset_ptr
, s2
);
4178 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
4184 /* True if register REGNO was alive at a place where `setjmp' was
4185 called and was set more than once or is an argument. Such regs may
4186 be clobbered by `longjmp'. */
4189 regno_clobbered_at_setjmp (bitmap setjmp_crosses
, int regno
)
4191 /* There appear to be cases where some local vars never reach the
4192 backend but have bogus regnos. */
4193 if (regno
>= max_reg_num ())
4196 return ((REG_N_SETS (regno
) > 1
4197 || REGNO_REG_SET_P (df_get_live_out (ENTRY_BLOCK_PTR_FOR_FN (cfun
)),
4199 && REGNO_REG_SET_P (setjmp_crosses
, regno
));
4202 /* Walk the tree of blocks describing the binding levels within a
4203 function and warn about variables the might be killed by setjmp or
4204 vfork. This is done after calling flow_analysis before register
4205 allocation since that will clobber the pseudo-regs to hard
4209 setjmp_vars_warning (bitmap setjmp_crosses
, tree block
)
4213 for (decl
= BLOCK_VARS (block
); decl
; decl
= DECL_CHAIN (decl
))
4216 && DECL_RTL_SET_P (decl
)
4217 && REG_P (DECL_RTL (decl
))
4218 && regno_clobbered_at_setjmp (setjmp_crosses
, REGNO (DECL_RTL (decl
))))
4219 warning (OPT_Wclobbered
, "variable %q+D might be clobbered by"
4220 " %<longjmp%> or %<vfork%>", decl
);
4223 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= BLOCK_CHAIN (sub
))
4224 setjmp_vars_warning (setjmp_crosses
, sub
);
4227 /* Do the appropriate part of setjmp_vars_warning
4228 but for arguments instead of local variables. */
4231 setjmp_args_warning (bitmap setjmp_crosses
)
4234 for (decl
= DECL_ARGUMENTS (current_function_decl
);
4235 decl
; decl
= DECL_CHAIN (decl
))
4236 if (DECL_RTL (decl
) != 0
4237 && REG_P (DECL_RTL (decl
))
4238 && regno_clobbered_at_setjmp (setjmp_crosses
, REGNO (DECL_RTL (decl
))))
4239 warning (OPT_Wclobbered
,
4240 "argument %q+D might be clobbered by %<longjmp%> or %<vfork%>",
4244 /* Generate warning messages for variables live across setjmp. */
4247 generate_setjmp_warnings (void)
4249 bitmap setjmp_crosses
= regstat_get_setjmp_crosses ();
4251 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
4252 || bitmap_empty_p (setjmp_crosses
))
4255 setjmp_vars_warning (setjmp_crosses
, DECL_INITIAL (current_function_decl
));
4256 setjmp_args_warning (setjmp_crosses
);
4260 /* Reverse the order of elements in the fragment chain T of blocks,
4261 and return the new head of the chain (old last element).
4262 In addition to that clear BLOCK_SAME_RANGE flags when needed
4263 and adjust BLOCK_SUPERCONTEXT from the super fragment to
4264 its super fragment origin. */
4267 block_fragments_nreverse (tree t
)
4269 tree prev
= 0, block
, next
, prev_super
= 0;
4270 tree super
= BLOCK_SUPERCONTEXT (t
);
4271 if (BLOCK_FRAGMENT_ORIGIN (super
))
4272 super
= BLOCK_FRAGMENT_ORIGIN (super
);
4273 for (block
= t
; block
; block
= next
)
4275 next
= BLOCK_FRAGMENT_CHAIN (block
);
4276 BLOCK_FRAGMENT_CHAIN (block
) = prev
;
4277 if ((prev
&& !BLOCK_SAME_RANGE (prev
))
4278 || (BLOCK_FRAGMENT_CHAIN (BLOCK_SUPERCONTEXT (block
))
4280 BLOCK_SAME_RANGE (block
) = 0;
4281 prev_super
= BLOCK_SUPERCONTEXT (block
);
4282 BLOCK_SUPERCONTEXT (block
) = super
;
4285 t
= BLOCK_FRAGMENT_ORIGIN (t
);
4286 if (BLOCK_FRAGMENT_CHAIN (BLOCK_SUPERCONTEXT (t
))
4288 BLOCK_SAME_RANGE (t
) = 0;
4289 BLOCK_SUPERCONTEXT (t
) = super
;
4293 /* Reverse the order of elements in the chain T of blocks,
4294 and return the new head of the chain (old last element).
4295 Also do the same on subblocks and reverse the order of elements
4296 in BLOCK_FRAGMENT_CHAIN as well. */
4299 blocks_nreverse_all (tree t
)
4301 tree prev
= 0, block
, next
;
4302 for (block
= t
; block
; block
= next
)
4304 next
= BLOCK_CHAIN (block
);
4305 BLOCK_CHAIN (block
) = prev
;
4306 if (BLOCK_FRAGMENT_CHAIN (block
)
4307 && BLOCK_FRAGMENT_ORIGIN (block
) == NULL_TREE
)
4309 BLOCK_FRAGMENT_CHAIN (block
)
4310 = block_fragments_nreverse (BLOCK_FRAGMENT_CHAIN (block
));
4311 if (!BLOCK_SAME_RANGE (BLOCK_FRAGMENT_CHAIN (block
)))
4312 BLOCK_SAME_RANGE (block
) = 0;
4314 BLOCK_SUBBLOCKS (block
) = blocks_nreverse_all (BLOCK_SUBBLOCKS (block
));
4321 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
4322 and create duplicate blocks. */
4323 /* ??? Need an option to either create block fragments or to create
4324 abstract origin duplicates of a source block. It really depends
4325 on what optimization has been performed. */
4328 reorder_blocks (void)
4330 tree block
= DECL_INITIAL (current_function_decl
);
4332 if (block
== NULL_TREE
)
4335 auto_vec
<tree
, 10> block_stack
;
4337 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
4338 clear_block_marks (block
);
4340 /* Prune the old trees away, so that they don't get in the way. */
4341 BLOCK_SUBBLOCKS (block
) = NULL_TREE
;
4342 BLOCK_CHAIN (block
) = NULL_TREE
;
4344 /* Recreate the block tree from the note nesting. */
4345 reorder_blocks_1 (get_insns (), block
, &block_stack
);
4346 BLOCK_SUBBLOCKS (block
) = blocks_nreverse_all (BLOCK_SUBBLOCKS (block
));
4349 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
4352 clear_block_marks (tree block
)
4356 TREE_ASM_WRITTEN (block
) = 0;
4357 clear_block_marks (BLOCK_SUBBLOCKS (block
));
4358 block
= BLOCK_CHAIN (block
);
4363 reorder_blocks_1 (rtx_insn
*insns
, tree current_block
,
4364 vec
<tree
> *p_block_stack
)
4367 tree prev_beg
= NULL_TREE
, prev_end
= NULL_TREE
;
4369 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
4373 if (NOTE_KIND (insn
) == NOTE_INSN_BLOCK_BEG
)
4375 tree block
= NOTE_BLOCK (insn
);
4378 gcc_assert (BLOCK_FRAGMENT_ORIGIN (block
) == NULL_TREE
);
4382 BLOCK_SAME_RANGE (prev_end
) = 0;
4383 prev_end
= NULL_TREE
;
4385 /* If we have seen this block before, that means it now
4386 spans multiple address regions. Create a new fragment. */
4387 if (TREE_ASM_WRITTEN (block
))
4389 tree new_block
= copy_node (block
);
4391 BLOCK_SAME_RANGE (new_block
) = 0;
4392 BLOCK_FRAGMENT_ORIGIN (new_block
) = origin
;
4393 BLOCK_FRAGMENT_CHAIN (new_block
)
4394 = BLOCK_FRAGMENT_CHAIN (origin
);
4395 BLOCK_FRAGMENT_CHAIN (origin
) = new_block
;
4397 NOTE_BLOCK (insn
) = new_block
;
4401 if (prev_beg
== current_block
&& prev_beg
)
4402 BLOCK_SAME_RANGE (block
) = 1;
4406 BLOCK_SUBBLOCKS (block
) = 0;
4407 TREE_ASM_WRITTEN (block
) = 1;
4408 /* When there's only one block for the entire function,
4409 current_block == block and we mustn't do this, it
4410 will cause infinite recursion. */
4411 if (block
!= current_block
)
4414 if (block
!= origin
)
4415 gcc_assert (BLOCK_SUPERCONTEXT (origin
) == current_block
4416 || BLOCK_FRAGMENT_ORIGIN (BLOCK_SUPERCONTEXT
4419 if (p_block_stack
->is_empty ())
4420 super
= current_block
;
4423 super
= p_block_stack
->last ();
4424 gcc_assert (super
== current_block
4425 || BLOCK_FRAGMENT_ORIGIN (super
)
4428 BLOCK_SUPERCONTEXT (block
) = super
;
4429 BLOCK_CHAIN (block
) = BLOCK_SUBBLOCKS (current_block
);
4430 BLOCK_SUBBLOCKS (current_block
) = block
;
4431 current_block
= origin
;
4433 p_block_stack
->safe_push (block
);
4435 else if (NOTE_KIND (insn
) == NOTE_INSN_BLOCK_END
)
4437 NOTE_BLOCK (insn
) = p_block_stack
->pop ();
4438 current_block
= BLOCK_SUPERCONTEXT (current_block
);
4439 if (BLOCK_FRAGMENT_ORIGIN (current_block
))
4440 current_block
= BLOCK_FRAGMENT_ORIGIN (current_block
);
4441 prev_beg
= NULL_TREE
;
4442 prev_end
= BLOCK_SAME_RANGE (NOTE_BLOCK (insn
))
4443 ? NOTE_BLOCK (insn
) : NULL_TREE
;
4448 prev_beg
= NULL_TREE
;
4450 BLOCK_SAME_RANGE (prev_end
) = 0;
4451 prev_end
= NULL_TREE
;
4456 /* Reverse the order of elements in the chain T of blocks,
4457 and return the new head of the chain (old last element). */
4460 blocks_nreverse (tree t
)
4462 tree prev
= 0, block
, next
;
4463 for (block
= t
; block
; block
= next
)
4465 next
= BLOCK_CHAIN (block
);
4466 BLOCK_CHAIN (block
) = prev
;
4472 /* Concatenate two chains of blocks (chained through BLOCK_CHAIN)
4473 by modifying the last node in chain 1 to point to chain 2. */
4476 block_chainon (tree op1
, tree op2
)
4485 for (t1
= op1
; BLOCK_CHAIN (t1
); t1
= BLOCK_CHAIN (t1
))
4487 BLOCK_CHAIN (t1
) = op2
;
4489 #ifdef ENABLE_TREE_CHECKING
4492 for (t2
= op2
; t2
; t2
= BLOCK_CHAIN (t2
))
4493 gcc_assert (t2
!= t1
);
4500 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
4501 non-NULL, list them all into VECTOR, in a depth-first preorder
4502 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
4506 all_blocks (tree block
, tree
*vector
)
4512 TREE_ASM_WRITTEN (block
) = 0;
4514 /* Record this block. */
4516 vector
[n_blocks
] = block
;
4520 /* Record the subblocks, and their subblocks... */
4521 n_blocks
+= all_blocks (BLOCK_SUBBLOCKS (block
),
4522 vector
? vector
+ n_blocks
: 0);
4523 block
= BLOCK_CHAIN (block
);
4529 /* Return a vector containing all the blocks rooted at BLOCK. The
4530 number of elements in the vector is stored in N_BLOCKS_P. The
4531 vector is dynamically allocated; it is the caller's responsibility
4532 to call `free' on the pointer returned. */
4535 get_block_vector (tree block
, int *n_blocks_p
)
4539 *n_blocks_p
= all_blocks (block
, NULL
);
4540 block_vector
= XNEWVEC (tree
, *n_blocks_p
);
4541 all_blocks (block
, block_vector
);
4543 return block_vector
;
4546 static GTY(()) int next_block_index
= 2;
4548 /* Set BLOCK_NUMBER for all the blocks in FN. */
4551 number_blocks (tree fn
)
4557 /* For XCOFF debugging output, we start numbering the blocks
4558 from 1 within each function, rather than keeping a running
4560 #if defined (XCOFF_DEBUGGING_INFO)
4561 if (write_symbols
== XCOFF_DEBUG
)
4562 next_block_index
= 1;
4565 block_vector
= get_block_vector (DECL_INITIAL (fn
), &n_blocks
);
4567 /* The top-level BLOCK isn't numbered at all. */
4568 for (i
= 1; i
< n_blocks
; ++i
)
4569 /* We number the blocks from two. */
4570 BLOCK_NUMBER (block_vector
[i
]) = next_block_index
++;
4572 free (block_vector
);
4577 /* If VAR is present in a subblock of BLOCK, return the subblock. */
4580 debug_find_var_in_block_tree (tree var
, tree block
)
4584 for (t
= BLOCK_VARS (block
); t
; t
= TREE_CHAIN (t
))
4588 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= TREE_CHAIN (t
))
4590 tree ret
= debug_find_var_in_block_tree (var
, t
);
4598 /* Keep track of whether we're in a dummy function context. If we are,
4599 we don't want to invoke the set_current_function hook, because we'll
4600 get into trouble if the hook calls target_reinit () recursively or
4601 when the initial initialization is not yet complete. */
4603 static bool in_dummy_function
;
4605 /* Invoke the target hook when setting cfun. Update the optimization options
4606 if the function uses different options than the default. */
4609 invoke_set_current_function_hook (tree fndecl
)
4611 if (!in_dummy_function
)
4613 tree opts
= ((fndecl
)
4614 ? DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
)
4615 : optimization_default_node
);
4618 opts
= optimization_default_node
;
4620 /* Change optimization options if needed. */
4621 if (optimization_current_node
!= opts
)
4623 optimization_current_node
= opts
;
4624 cl_optimization_restore (&global_options
, TREE_OPTIMIZATION (opts
));
4627 targetm
.set_current_function (fndecl
);
4628 this_fn_optabs
= this_target_optabs
;
4630 /* Initialize global alignment variables after op. */
4631 parse_alignment_opts ();
4633 if (opts
!= optimization_default_node
)
4635 init_tree_optimization_optabs (opts
);
4636 if (TREE_OPTIMIZATION_OPTABS (opts
))
4637 this_fn_optabs
= (struct target_optabs
*)
4638 TREE_OPTIMIZATION_OPTABS (opts
);
4643 /* cfun should never be set directly; use this function. */
4646 set_cfun (struct function
*new_cfun
, bool force
)
4648 if (cfun
!= new_cfun
|| force
)
4651 invoke_set_current_function_hook (new_cfun
? new_cfun
->decl
: NULL_TREE
);
4652 redirect_edge_var_map_empty ();
4656 /* Initialized with NOGC, making this poisonous to the garbage collector. */
4658 static vec
<function
*> cfun_stack
;
4660 /* Push the current cfun onto the stack, and set cfun to new_cfun. Also set
4661 current_function_decl accordingly. */
4664 push_cfun (struct function
*new_cfun
)
4666 gcc_assert ((!cfun
&& !current_function_decl
)
4667 || (cfun
&& current_function_decl
== cfun
->decl
));
4668 cfun_stack
.safe_push (cfun
);
4669 current_function_decl
= new_cfun
? new_cfun
->decl
: NULL_TREE
;
4670 set_cfun (new_cfun
);
4673 /* Pop cfun from the stack. Also set current_function_decl accordingly. */
4678 struct function
*new_cfun
= cfun_stack
.pop ();
4679 /* When in_dummy_function, we do have a cfun but current_function_decl is
4680 NULL. We also allow pushing NULL cfun and subsequently changing
4681 current_function_decl to something else and have both restored by
4683 gcc_checking_assert (in_dummy_function
4685 || current_function_decl
== cfun
->decl
);
4686 set_cfun (new_cfun
);
4687 current_function_decl
= new_cfun
? new_cfun
->decl
: NULL_TREE
;
4690 /* Return value of funcdef and increase it. */
4692 get_next_funcdef_no (void)
4694 return funcdef_no
++;
4697 /* Return value of funcdef. */
4699 get_last_funcdef_no (void)
4704 /* Allocate a function structure for FNDECL and set its contents
4705 to the defaults. Set cfun to the newly-allocated object.
4706 Some of the helper functions invoked during initialization assume
4707 that cfun has already been set. Therefore, assign the new object
4708 directly into cfun and invoke the back end hook explicitly at the
4709 very end, rather than initializing a temporary and calling set_cfun
4712 ABSTRACT_P is true if this is a function that will never be seen by
4713 the middle-end. Such functions are front-end concepts (like C++
4714 function templates) that do not correspond directly to functions
4715 placed in object files. */
4718 allocate_struct_function (tree fndecl
, bool abstract_p
)
4720 tree fntype
= fndecl
? TREE_TYPE (fndecl
) : NULL_TREE
;
4722 cfun
= ggc_cleared_alloc
<function
> ();
4724 init_eh_for_function ();
4726 if (init_machine_status
)
4727 cfun
->machine
= (*init_machine_status
) ();
4729 #ifdef OVERRIDE_ABI_FORMAT
4730 OVERRIDE_ABI_FORMAT (fndecl
);
4733 if (fndecl
!= NULL_TREE
)
4735 DECL_STRUCT_FUNCTION (fndecl
) = cfun
;
4736 cfun
->decl
= fndecl
;
4737 current_function_funcdef_no
= get_next_funcdef_no ();
4740 invoke_set_current_function_hook (fndecl
);
4742 if (fndecl
!= NULL_TREE
)
4744 tree result
= DECL_RESULT (fndecl
);
4748 /* Now that we have activated any function-specific attributes
4749 that might affect layout, particularly vector modes, relayout
4750 each of the parameters and the result. */
4751 relayout_decl (result
);
4752 for (tree parm
= DECL_ARGUMENTS (fndecl
); parm
;
4753 parm
= DECL_CHAIN (parm
))
4754 relayout_decl (parm
);
4756 /* Similarly relayout the function decl. */
4757 targetm
.target_option
.relayout_function (fndecl
);
4760 if (!abstract_p
&& aggregate_value_p (result
, fndecl
))
4762 #ifdef PCC_STATIC_STRUCT_RETURN
4763 cfun
->returns_pcc_struct
= 1;
4765 cfun
->returns_struct
= 1;
4768 cfun
->stdarg
= stdarg_p (fntype
);
4770 /* Assume all registers in stdarg functions need to be saved. */
4771 cfun
->va_list_gpr_size
= VA_LIST_MAX_GPR_SIZE
;
4772 cfun
->va_list_fpr_size
= VA_LIST_MAX_FPR_SIZE
;
4774 /* ??? This could be set on a per-function basis by the front-end
4775 but is this worth the hassle? */
4776 cfun
->can_throw_non_call_exceptions
= flag_non_call_exceptions
;
4777 cfun
->can_delete_dead_exceptions
= flag_delete_dead_exceptions
;
4779 if (!profile_flag
&& !flag_instrument_function_entry_exit
)
4780 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
) = 1;
4783 /* Don't enable begin stmt markers if var-tracking at assignments is
4784 disabled. The markers make little sense without the variable
4785 binding annotations among them. */
4786 cfun
->debug_nonbind_markers
= lang_hooks
.emits_begin_stmt
4787 && MAY_HAVE_DEBUG_MARKER_STMTS
;
4790 /* This is like allocate_struct_function, but pushes a new cfun for FNDECL
4791 instead of just setting it. */
4794 push_struct_function (tree fndecl
)
4796 /* When in_dummy_function we might be in the middle of a pop_cfun and
4797 current_function_decl and cfun may not match. */
4798 gcc_assert (in_dummy_function
4799 || (!cfun
&& !current_function_decl
)
4800 || (cfun
&& current_function_decl
== cfun
->decl
));
4801 cfun_stack
.safe_push (cfun
);
4802 current_function_decl
= fndecl
;
4803 allocate_struct_function (fndecl
, false);
4806 /* Reset crtl and other non-struct-function variables to defaults as
4807 appropriate for emitting rtl at the start of a function. */
4810 prepare_function_start (void)
4812 gcc_assert (!get_last_insn ());
4815 init_varasm_status ();
4817 default_rtl_profile ();
4819 if (flag_stack_usage_info
)
4821 cfun
->su
= ggc_cleared_alloc
<stack_usage
> ();
4822 cfun
->su
->static_stack_size
= -1;
4825 cse_not_expected
= ! optimize
;
4827 /* Caller save not needed yet. */
4828 caller_save_needed
= 0;
4830 /* We haven't done register allocation yet. */
4833 /* Indicate that we have not instantiated virtual registers yet. */
4834 virtuals_instantiated
= 0;
4836 /* Indicate that we want CONCATs now. */
4837 generating_concat_p
= 1;
4839 /* Indicate we have no need of a frame pointer yet. */
4840 frame_pointer_needed
= 0;
4844 push_dummy_function (bool with_decl
)
4846 tree fn_decl
, fn_type
, fn_result_decl
;
4848 gcc_assert (!in_dummy_function
);
4849 in_dummy_function
= true;
4853 fn_type
= build_function_type_list (void_type_node
, NULL_TREE
);
4854 fn_decl
= build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
, NULL_TREE
,
4856 fn_result_decl
= build_decl (UNKNOWN_LOCATION
, RESULT_DECL
,
4857 NULL_TREE
, void_type_node
);
4858 DECL_RESULT (fn_decl
) = fn_result_decl
;
4861 fn_decl
= NULL_TREE
;
4863 push_struct_function (fn_decl
);
4866 /* Initialize the rtl expansion mechanism so that we can do simple things
4867 like generate sequences. This is used to provide a context during global
4868 initialization of some passes. You must call expand_dummy_function_end
4869 to exit this context. */
4872 init_dummy_function_start (void)
4874 push_dummy_function (false);
4875 prepare_function_start ();
4878 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
4879 and initialize static variables for generating RTL for the statements
4883 init_function_start (tree subr
)
4885 /* Initialize backend, if needed. */
4888 prepare_function_start ();
4889 decide_function_section (subr
);
4891 /* Warn if this value is an aggregate type,
4892 regardless of which calling convention we are using for it. */
4893 if (AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr
))))
4894 warning (OPT_Waggregate_return
, "function returns an aggregate");
4897 /* Expand code to verify the stack_protect_guard. This is invoked at
4898 the end of a function to be protected. */
4901 stack_protect_epilogue (void)
4903 tree guard_decl
= crtl
->stack_protect_guard_decl
;
4904 rtx_code_label
*label
= gen_label_rtx ();
4906 rtx_insn
*seq
= NULL
;
4908 x
= expand_normal (crtl
->stack_protect_guard
);
4910 if (targetm
.have_stack_protect_combined_test () && guard_decl
)
4912 gcc_assert (DECL_P (guard_decl
));
4913 y
= DECL_RTL (guard_decl
);
4914 /* Allow the target to compute address of Y and compare it with X without
4915 leaking Y into a register. This combined address + compare pattern
4916 allows the target to prevent spilling of any intermediate results by
4917 splitting it after register allocator. */
4918 seq
= targetm
.gen_stack_protect_combined_test (x
, y
, label
);
4923 y
= expand_normal (guard_decl
);
4927 /* Allow the target to compare Y with X without leaking either into
4929 if (targetm
.have_stack_protect_test ())
4930 seq
= targetm
.gen_stack_protect_test (x
, y
, label
);
4936 emit_cmp_and_jump_insns (x
, y
, EQ
, NULL_RTX
, ptr_mode
, 1, label
);
4938 /* The noreturn predictor has been moved to the tree level. The rtl-level
4939 predictors estimate this branch about 20%, which isn't enough to get
4940 things moved out of line. Since this is the only extant case of adding
4941 a noreturn function at the rtl level, it doesn't seem worth doing ought
4942 except adding the prediction by hand. */
4943 rtx_insn
*tmp
= get_last_insn ();
4945 predict_insn_def (tmp
, PRED_NORETURN
, TAKEN
);
4947 expand_call (targetm
.stack_protect_fail (), NULL_RTX
, /*ignore=*/true);
4952 /* Start the RTL for a new function, and set variables used for
4954 SUBR is the FUNCTION_DECL node.
4955 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
4956 the function's parameters, which must be run at any return statement. */
4959 expand_function_start (tree subr
)
4961 /* Make sure volatile mem refs aren't considered
4962 valid operands of arithmetic insns. */
4963 init_recog_no_volatile ();
4967 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr
));
4970 = (stack_limit_rtx
!= NULL_RTX
&& ! DECL_NO_LIMIT_STACK (subr
));
4972 /* Make the label for return statements to jump to. Do not special
4973 case machines with special return instructions -- they will be
4974 handled later during jump, ifcvt, or epilogue creation. */
4975 return_label
= gen_label_rtx ();
4977 /* Initialize rtx used to return the value. */
4978 /* Do this before assign_parms so that we copy the struct value address
4979 before any library calls that assign parms might generate. */
4981 /* Decide whether to return the value in memory or in a register. */
4982 tree res
= DECL_RESULT (subr
);
4983 if (aggregate_value_p (res
, subr
))
4985 /* Returning something that won't go in a register. */
4986 rtx value_address
= 0;
4988 #ifdef PCC_STATIC_STRUCT_RETURN
4989 if (cfun
->returns_pcc_struct
)
4991 int size
= int_size_in_bytes (TREE_TYPE (res
));
4992 value_address
= assemble_static_space (size
);
4997 rtx sv
= targetm
.calls
.struct_value_rtx (TREE_TYPE (subr
), 2);
4998 /* Expect to be passed the address of a place to store the value.
4999 If it is passed as an argument, assign_parms will take care of
5003 value_address
= gen_reg_rtx (Pmode
);
5004 emit_move_insn (value_address
, sv
);
5009 rtx x
= value_address
;
5010 if (!DECL_BY_REFERENCE (res
))
5012 x
= gen_rtx_MEM (DECL_MODE (res
), x
);
5013 set_mem_attributes (x
, res
, 1);
5015 set_parm_rtl (res
, x
);
5018 else if (DECL_MODE (res
) == VOIDmode
)
5019 /* If return mode is void, this decl rtl should not be used. */
5020 set_parm_rtl (res
, NULL_RTX
);
5023 /* Compute the return values into a pseudo reg, which we will copy
5024 into the true return register after the cleanups are done. */
5025 tree return_type
= TREE_TYPE (res
);
5027 /* If we may coalesce this result, make sure it has the expected mode
5028 in case it was promoted. But we need not bother about BLKmode. */
5029 machine_mode promoted_mode
5030 = flag_tree_coalesce_vars
&& is_gimple_reg (res
)
5031 ? promote_ssa_mode (ssa_default_def (cfun
, res
), NULL
)
5034 if (promoted_mode
!= BLKmode
)
5035 set_parm_rtl (res
, gen_reg_rtx (promoted_mode
));
5036 else if (TYPE_MODE (return_type
) != BLKmode
5037 && targetm
.calls
.return_in_msb (return_type
))
5038 /* expand_function_end will insert the appropriate padding in
5039 this case. Use the return value's natural (unpadded) mode
5040 within the function proper. */
5041 set_parm_rtl (res
, gen_reg_rtx (TYPE_MODE (return_type
)));
5044 /* In order to figure out what mode to use for the pseudo, we
5045 figure out what the mode of the eventual return register will
5046 actually be, and use that. */
5047 rtx hard_reg
= hard_function_value (return_type
, subr
, 0, 1);
5049 /* Structures that are returned in registers are not
5050 aggregate_value_p, so we may see a PARALLEL or a REG. */
5051 if (REG_P (hard_reg
))
5052 set_parm_rtl (res
, gen_reg_rtx (GET_MODE (hard_reg
)));
5055 gcc_assert (GET_CODE (hard_reg
) == PARALLEL
);
5056 set_parm_rtl (res
, gen_group_rtx (hard_reg
));
5060 /* Set DECL_REGISTER flag so that expand_function_end will copy the
5061 result to the real return register(s). */
5062 DECL_REGISTER (res
) = 1;
5065 /* Initialize rtx for parameters and local variables.
5066 In some cases this requires emitting insns. */
5067 assign_parms (subr
);
5069 /* If function gets a static chain arg, store it. */
5070 if (cfun
->static_chain_decl
)
5072 tree parm
= cfun
->static_chain_decl
;
5077 local
= gen_reg_rtx (promote_decl_mode (parm
, &unsignedp
));
5078 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
5080 set_decl_incoming_rtl (parm
, chain
, false);
5081 set_parm_rtl (parm
, local
);
5082 mark_reg_pointer (local
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
))));
5084 if (GET_MODE (local
) != GET_MODE (chain
))
5086 convert_move (local
, chain
, unsignedp
);
5087 insn
= get_last_insn ();
5090 insn
= emit_move_insn (local
, chain
);
5092 /* Mark the register as eliminable, similar to parameters. */
5094 && reg_mentioned_p (arg_pointer_rtx
, XEXP (chain
, 0)))
5095 set_dst_reg_note (insn
, REG_EQUIV
, chain
, local
);
5097 /* If we aren't optimizing, save the static chain onto the stack. */
5100 tree saved_static_chain_decl
5101 = build_decl (DECL_SOURCE_LOCATION (parm
), VAR_DECL
,
5102 DECL_NAME (parm
), TREE_TYPE (parm
));
5103 rtx saved_static_chain_rtx
5104 = assign_stack_local (Pmode
, GET_MODE_SIZE (Pmode
), 0);
5105 SET_DECL_RTL (saved_static_chain_decl
, saved_static_chain_rtx
);
5106 emit_move_insn (saved_static_chain_rtx
, chain
);
5107 SET_DECL_VALUE_EXPR (parm
, saved_static_chain_decl
);
5108 DECL_HAS_VALUE_EXPR_P (parm
) = 1;
5112 /* The following was moved from init_function_start.
5113 The move was supposed to make sdb output more accurate. */
5114 /* Indicate the beginning of the function body,
5115 as opposed to parm setup. */
5116 emit_note (NOTE_INSN_FUNCTION_BEG
);
5118 gcc_assert (NOTE_P (get_last_insn ()));
5120 parm_birth_insn
= get_last_insn ();
5122 /* If the function receives a non-local goto, then store the
5123 bits we need to restore the frame pointer. */
5124 if (cfun
->nonlocal_goto_save_area
)
5129 tree var
= TREE_OPERAND (cfun
->nonlocal_goto_save_area
, 0);
5130 gcc_assert (DECL_RTL_SET_P (var
));
5132 t_save
= build4 (ARRAY_REF
,
5133 TREE_TYPE (TREE_TYPE (cfun
->nonlocal_goto_save_area
)),
5134 cfun
->nonlocal_goto_save_area
,
5135 integer_zero_node
, NULL_TREE
, NULL_TREE
);
5136 r_save
= expand_expr (t_save
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
5137 gcc_assert (GET_MODE (r_save
) == Pmode
);
5139 emit_move_insn (r_save
, hard_frame_pointer_rtx
);
5140 update_nonlocal_goto_save_area ();
5146 PROFILE_HOOK (current_function_funcdef_no
);
5150 /* If we are doing generic stack checking, the probe should go here. */
5151 if (flag_stack_check
== GENERIC_STACK_CHECK
)
5152 stack_check_probe_note
= emit_note (NOTE_INSN_DELETED
);
5156 pop_dummy_function (void)
5159 in_dummy_function
= false;
5162 /* Undo the effects of init_dummy_function_start. */
5164 expand_dummy_function_end (void)
5166 gcc_assert (in_dummy_function
);
5168 /* End any sequences that failed to be closed due to syntax errors. */
5169 while (in_sequence_p ())
5172 /* Outside function body, can't compute type's actual size
5173 until next function's body starts. */
5175 free_after_parsing (cfun
);
5176 free_after_compilation (cfun
);
5177 pop_dummy_function ();
5180 /* Helper for diddle_return_value. */
5183 diddle_return_value_1 (void (*doit
) (rtx
, void *), void *arg
, rtx outgoing
)
5188 if (REG_P (outgoing
))
5189 (*doit
) (outgoing
, arg
);
5190 else if (GET_CODE (outgoing
) == PARALLEL
)
5194 for (i
= 0; i
< XVECLEN (outgoing
, 0); i
++)
5196 rtx x
= XEXP (XVECEXP (outgoing
, 0, i
), 0);
5198 if (REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
)
5204 /* Call DOIT for each hard register used as a return value from
5205 the current function. */
5208 diddle_return_value (void (*doit
) (rtx
, void *), void *arg
)
5210 diddle_return_value_1 (doit
, arg
, crtl
->return_rtx
);
5214 do_clobber_return_reg (rtx reg
, void *arg ATTRIBUTE_UNUSED
)
5220 clobber_return_register (void)
5222 diddle_return_value (do_clobber_return_reg
, NULL
);
5224 /* In case we do use pseudo to return value, clobber it too. */
5225 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
5227 tree decl_result
= DECL_RESULT (current_function_decl
);
5228 rtx decl_rtl
= DECL_RTL (decl_result
);
5229 if (REG_P (decl_rtl
) && REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
)
5231 do_clobber_return_reg (decl_rtl
, NULL
);
5237 do_use_return_reg (rtx reg
, void *arg ATTRIBUTE_UNUSED
)
5243 use_return_register (void)
5245 diddle_return_value (do_use_return_reg
, NULL
);
5248 /* Generate RTL for the end of the current function. */
5251 expand_function_end (void)
5253 /* If arg_pointer_save_area was referenced only from a nested
5254 function, we will not have initialized it yet. Do that now. */
5255 if (arg_pointer_save_area
&& ! crtl
->arg_pointer_save_area_init
)
5256 get_arg_pointer_save_area ();
5258 /* If we are doing generic stack checking and this function makes calls,
5259 do a stack probe at the start of the function to ensure we have enough
5260 space for another stack frame. */
5261 if (flag_stack_check
== GENERIC_STACK_CHECK
)
5263 rtx_insn
*insn
, *seq
;
5265 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
5268 rtx max_frame_size
= GEN_INT (STACK_CHECK_MAX_FRAME_SIZE
);
5270 if (STACK_CHECK_MOVING_SP
)
5271 anti_adjust_stack_and_probe (max_frame_size
, true);
5273 probe_stack_range (STACK_OLD_CHECK_PROTECT
, max_frame_size
);
5276 set_insn_locations (seq
, prologue_location
);
5277 emit_insn_before (seq
, stack_check_probe_note
);
5282 /* End any sequences that failed to be closed due to syntax errors. */
5283 while (in_sequence_p ())
5286 clear_pending_stack_adjust ();
5287 do_pending_stack_adjust ();
5289 /* Output a linenumber for the end of the function.
5290 SDB depended on this. */
5291 set_curr_insn_location (input_location
);
5293 /* Before the return label (if any), clobber the return
5294 registers so that they are not propagated live to the rest of
5295 the function. This can only happen with functions that drop
5296 through; if there had been a return statement, there would
5297 have either been a return rtx, or a jump to the return label.
5299 We delay actual code generation after the current_function_value_rtx
5301 rtx_insn
*clobber_after
= get_last_insn ();
5303 /* Output the label for the actual return from the function. */
5304 emit_label (return_label
);
5306 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
5308 /* Let except.c know where it should emit the call to unregister
5309 the function context for sjlj exceptions. */
5310 if (flag_exceptions
)
5311 sjlj_emit_function_exit_after (get_last_insn ());
5314 /* If this is an implementation of throw, do what's necessary to
5315 communicate between __builtin_eh_return and the epilogue. */
5316 expand_eh_return ();
5318 /* If stack protection is enabled for this function, check the guard. */
5319 if (crtl
->stack_protect_guard
5320 && targetm
.stack_protect_runtime_enabled_p ()
5321 && naked_return_label
== NULL_RTX
)
5322 stack_protect_epilogue ();
5324 /* If scalar return value was computed in a pseudo-reg, or was a named
5325 return value that got dumped to the stack, copy that to the hard
5327 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
5329 tree decl_result
= DECL_RESULT (current_function_decl
);
5330 rtx decl_rtl
= DECL_RTL (decl_result
);
5332 if (REG_P (decl_rtl
)
5333 ? REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
5334 : DECL_REGISTER (decl_result
))
5336 rtx real_decl_rtl
= crtl
->return_rtx
;
5339 /* This should be set in assign_parms. */
5340 gcc_assert (REG_FUNCTION_VALUE_P (real_decl_rtl
));
5342 /* If this is a BLKmode structure being returned in registers,
5343 then use the mode computed in expand_return. Note that if
5344 decl_rtl is memory, then its mode may have been changed,
5345 but that crtl->return_rtx has not. */
5346 if (GET_MODE (real_decl_rtl
) == BLKmode
)
5347 PUT_MODE (real_decl_rtl
, GET_MODE (decl_rtl
));
5349 /* If a non-BLKmode return value should be padded at the least
5350 significant end of the register, shift it left by the appropriate
5351 amount. BLKmode results are handled using the group load/store
5353 if (TYPE_MODE (TREE_TYPE (decl_result
)) != BLKmode
5354 && REG_P (real_decl_rtl
)
5355 && targetm
.calls
.return_in_msb (TREE_TYPE (decl_result
)))
5357 emit_move_insn (gen_rtx_REG (GET_MODE (decl_rtl
),
5358 REGNO (real_decl_rtl
)),
5360 shift_return_value (GET_MODE (decl_rtl
), true, real_decl_rtl
);
5362 else if (GET_CODE (real_decl_rtl
) == PARALLEL
)
5364 /* If expand_function_start has created a PARALLEL for decl_rtl,
5365 move the result to the real return registers. Otherwise, do
5366 a group load from decl_rtl for a named return. */
5367 if (GET_CODE (decl_rtl
) == PARALLEL
)
5368 emit_group_move (real_decl_rtl
, decl_rtl
);
5370 emit_group_load (real_decl_rtl
, decl_rtl
,
5371 TREE_TYPE (decl_result
),
5372 int_size_in_bytes (TREE_TYPE (decl_result
)));
5374 /* In the case of complex integer modes smaller than a word, we'll
5375 need to generate some non-trivial bitfield insertions. Do that
5376 on a pseudo and not the hard register. */
5377 else if (GET_CODE (decl_rtl
) == CONCAT
5378 && is_complex_int_mode (GET_MODE (decl_rtl
), &cmode
)
5379 && GET_MODE_BITSIZE (cmode
) <= BITS_PER_WORD
)
5381 int old_generating_concat_p
;
5384 old_generating_concat_p
= generating_concat_p
;
5385 generating_concat_p
= 0;
5386 tmp
= gen_reg_rtx (GET_MODE (decl_rtl
));
5387 generating_concat_p
= old_generating_concat_p
;
5389 emit_move_insn (tmp
, decl_rtl
);
5390 emit_move_insn (real_decl_rtl
, tmp
);
5392 /* If a named return value dumped decl_return to memory, then
5393 we may need to re-do the PROMOTE_MODE signed/unsigned
5395 else if (GET_MODE (real_decl_rtl
) != GET_MODE (decl_rtl
))
5397 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (decl_result
));
5398 promote_function_mode (TREE_TYPE (decl_result
),
5399 GET_MODE (decl_rtl
), &unsignedp
,
5400 TREE_TYPE (current_function_decl
), 1);
5402 convert_move (real_decl_rtl
, decl_rtl
, unsignedp
);
5405 emit_move_insn (real_decl_rtl
, decl_rtl
);
5409 /* If returning a structure, arrange to return the address of the value
5410 in a place where debuggers expect to find it.
5412 If returning a structure PCC style,
5413 the caller also depends on this value.
5414 And cfun->returns_pcc_struct is not necessarily set. */
5415 if ((cfun
->returns_struct
|| cfun
->returns_pcc_struct
)
5416 && !targetm
.calls
.omit_struct_return_reg
)
5418 rtx value_address
= DECL_RTL (DECL_RESULT (current_function_decl
));
5419 tree type
= TREE_TYPE (DECL_RESULT (current_function_decl
));
5422 if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl
)))
5423 type
= TREE_TYPE (type
);
5425 value_address
= XEXP (value_address
, 0);
5427 outgoing
= targetm
.calls
.function_value (build_pointer_type (type
),
5428 current_function_decl
, true);
5430 /* Mark this as a function return value so integrate will delete the
5431 assignment and USE below when inlining this function. */
5432 REG_FUNCTION_VALUE_P (outgoing
) = 1;
5434 /* The address may be ptr_mode and OUTGOING may be Pmode. */
5435 scalar_int_mode mode
= as_a
<scalar_int_mode
> (GET_MODE (outgoing
));
5436 value_address
= convert_memory_address (mode
, value_address
);
5438 emit_move_insn (outgoing
, value_address
);
5440 /* Show return register used to hold result (in this case the address
5442 crtl
->return_rtx
= outgoing
;
5445 /* Emit the actual code to clobber return register. Don't emit
5446 it if clobber_after is a barrier, then the previous basic block
5447 certainly doesn't fall thru into the exit block. */
5448 if (!BARRIER_P (clobber_after
))
5451 clobber_return_register ();
5452 rtx_insn
*seq
= get_insns ();
5455 emit_insn_after (seq
, clobber_after
);
5458 /* Output the label for the naked return from the function. */
5459 if (naked_return_label
)
5460 emit_label (naked_return_label
);
5462 /* @@@ This is a kludge. We want to ensure that instructions that
5463 may trap are not moved into the epilogue by scheduling, because
5464 we don't always emit unwind information for the epilogue. */
5465 if (cfun
->can_throw_non_call_exceptions
5466 && targetm_common
.except_unwind_info (&global_options
) != UI_SJLJ
)
5467 emit_insn (gen_blockage ());
5469 /* If stack protection is enabled for this function, check the guard. */
5470 if (crtl
->stack_protect_guard
5471 && targetm
.stack_protect_runtime_enabled_p ()
5472 && naked_return_label
)
5473 stack_protect_epilogue ();
5475 /* If we had calls to alloca, and this machine needs
5476 an accurate stack pointer to exit the function,
5477 insert some code to save and restore the stack pointer. */
5478 if (! EXIT_IGNORE_STACK
5479 && cfun
->calls_alloca
)
5484 emit_stack_save (SAVE_FUNCTION
, &tem
);
5485 rtx_insn
*seq
= get_insns ();
5487 emit_insn_before (seq
, parm_birth_insn
);
5489 emit_stack_restore (SAVE_FUNCTION
, tem
);
5492 /* ??? This should no longer be necessary since stupid is no longer with
5493 us, but there are some parts of the compiler (eg reload_combine, and
5494 sh mach_dep_reorg) that still try and compute their own lifetime info
5495 instead of using the general framework. */
5496 use_return_register ();
5500 get_arg_pointer_save_area (void)
5502 rtx ret
= arg_pointer_save_area
;
5506 ret
= assign_stack_local (Pmode
, GET_MODE_SIZE (Pmode
), 0);
5507 arg_pointer_save_area
= ret
;
5510 if (! crtl
->arg_pointer_save_area_init
)
5512 /* Save the arg pointer at the beginning of the function. The
5513 generated stack slot may not be a valid memory address, so we
5514 have to check it and fix it if necessary. */
5516 emit_move_insn (validize_mem (copy_rtx (ret
)),
5517 crtl
->args
.internal_arg_pointer
);
5518 rtx_insn
*seq
= get_insns ();
5521 push_topmost_sequence ();
5522 emit_insn_after (seq
, entry_of_function ());
5523 pop_topmost_sequence ();
5525 crtl
->arg_pointer_save_area_init
= true;
5532 /* If debugging dumps are requested, dump information about how the
5533 target handled -fstack-check=clash for the prologue.
5535 PROBES describes what if any probes were emitted.
5537 RESIDUALS indicates if the prologue had any residual allocation
5538 (i.e. total allocation was not a multiple of PROBE_INTERVAL). */
5541 dump_stack_clash_frame_info (enum stack_clash_probes probes
, bool residuals
)
5548 case NO_PROBE_NO_FRAME
:
5550 "Stack clash no probe no stack adjustment in prologue.\n");
5552 case NO_PROBE_SMALL_FRAME
:
5554 "Stack clash no probe small stack adjustment in prologue.\n");
5557 fprintf (dump_file
, "Stack clash inline probes in prologue.\n");
5560 fprintf (dump_file
, "Stack clash probe loop in prologue.\n");
5565 fprintf (dump_file
, "Stack clash residual allocation in prologue.\n");
5567 fprintf (dump_file
, "Stack clash no residual allocation in prologue.\n");
5569 if (frame_pointer_needed
)
5570 fprintf (dump_file
, "Stack clash frame pointer needed.\n");
5572 fprintf (dump_file
, "Stack clash no frame pointer needed.\n");
5574 if (TREE_THIS_VOLATILE (cfun
->decl
))
5576 "Stack clash noreturn prologue, assuming no implicit"
5577 " probes in caller.\n");
5580 "Stack clash not noreturn prologue.\n");
5583 /* Add a list of INSNS to the hash HASHP, possibly allocating HASHP
5584 for the first time. */
5587 record_insns (rtx_insn
*insns
, rtx end
, hash_table
<insn_cache_hasher
> **hashp
)
5590 hash_table
<insn_cache_hasher
> *hash
= *hashp
;
5593 *hashp
= hash
= hash_table
<insn_cache_hasher
>::create_ggc (17);
5595 for (tmp
= insns
; tmp
!= end
; tmp
= NEXT_INSN (tmp
))
5597 rtx
*slot
= hash
->find_slot (tmp
, INSERT
);
5598 gcc_assert (*slot
== NULL
);
5603 /* INSN has been duplicated or replaced by as COPY, perhaps by duplicating a
5604 basic block, splitting or peepholes. If INSN is a prologue or epilogue
5605 insn, then record COPY as well. */
5608 maybe_copy_prologue_epilogue_insn (rtx insn
, rtx copy
)
5610 hash_table
<insn_cache_hasher
> *hash
;
5613 hash
= epilogue_insn_hash
;
5614 if (!hash
|| !hash
->find (insn
))
5616 hash
= prologue_insn_hash
;
5617 if (!hash
|| !hash
->find (insn
))
5621 slot
= hash
->find_slot (copy
, INSERT
);
5622 gcc_assert (*slot
== NULL
);
5626 /* Determine if any INSNs in HASH are, or are part of, INSN. Because
5627 we can be running after reorg, SEQUENCE rtl is possible. */
5630 contains (const rtx_insn
*insn
, hash_table
<insn_cache_hasher
> *hash
)
5635 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
5637 rtx_sequence
*seq
= as_a
<rtx_sequence
*> (PATTERN (insn
));
5639 for (i
= seq
->len () - 1; i
>= 0; i
--)
5640 if (hash
->find (seq
->element (i
)))
5645 return hash
->find (const_cast<rtx_insn
*> (insn
)) != NULL
;
5649 prologue_contains (const rtx_insn
*insn
)
5651 return contains (insn
, prologue_insn_hash
);
5655 epilogue_contains (const rtx_insn
*insn
)
5657 return contains (insn
, epilogue_insn_hash
);
5661 prologue_epilogue_contains (const rtx_insn
*insn
)
5663 if (contains (insn
, prologue_insn_hash
))
5665 if (contains (insn
, epilogue_insn_hash
))
5671 record_prologue_seq (rtx_insn
*seq
)
5673 record_insns (seq
, NULL
, &prologue_insn_hash
);
5677 record_epilogue_seq (rtx_insn
*seq
)
5679 record_insns (seq
, NULL
, &epilogue_insn_hash
);
5682 /* Set JUMP_LABEL for a return insn. */
5685 set_return_jump_label (rtx_insn
*returnjump
)
5687 rtx pat
= PATTERN (returnjump
);
5688 if (GET_CODE (pat
) == PARALLEL
)
5689 pat
= XVECEXP (pat
, 0, 0);
5690 if (ANY_RETURN_P (pat
))
5691 JUMP_LABEL (returnjump
) = pat
;
5693 JUMP_LABEL (returnjump
) = ret_rtx
;
5696 /* Return a sequence to be used as the split prologue for the current
5697 function, or NULL. */
5700 make_split_prologue_seq (void)
5702 if (!flag_split_stack
5703 || lookup_attribute ("no_split_stack", DECL_ATTRIBUTES (cfun
->decl
)))
5707 emit_insn (targetm
.gen_split_stack_prologue ());
5708 rtx_insn
*seq
= get_insns ();
5711 record_insns (seq
, NULL
, &prologue_insn_hash
);
5712 set_insn_locations (seq
, prologue_location
);
5717 /* Return a sequence to be used as the prologue for the current function,
5721 make_prologue_seq (void)
5723 if (!targetm
.have_prologue ())
5727 rtx_insn
*seq
= targetm
.gen_prologue ();
5730 /* Insert an explicit USE for the frame pointer
5731 if the profiling is on and the frame pointer is required. */
5732 if (crtl
->profile
&& frame_pointer_needed
)
5733 emit_use (hard_frame_pointer_rtx
);
5735 /* Retain a map of the prologue insns. */
5736 record_insns (seq
, NULL
, &prologue_insn_hash
);
5737 emit_note (NOTE_INSN_PROLOGUE_END
);
5739 /* Ensure that instructions are not moved into the prologue when
5740 profiling is on. The call to the profiling routine can be
5741 emitted within the live range of a call-clobbered register. */
5742 if (!targetm
.profile_before_prologue () && crtl
->profile
)
5743 emit_insn (gen_blockage ());
5747 set_insn_locations (seq
, prologue_location
);
5752 /* Return a sequence to be used as the epilogue for the current function,
5756 make_epilogue_seq (void)
5758 if (!targetm
.have_epilogue ())
5762 emit_note (NOTE_INSN_EPILOGUE_BEG
);
5763 rtx_insn
*seq
= targetm
.gen_epilogue ();
5765 emit_jump_insn (seq
);
5767 /* Retain a map of the epilogue insns. */
5768 record_insns (seq
, NULL
, &epilogue_insn_hash
);
5769 set_insn_locations (seq
, epilogue_location
);
5772 rtx_insn
*returnjump
= get_last_insn ();
5775 if (JUMP_P (returnjump
))
5776 set_return_jump_label (returnjump
);
5782 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
5783 this into place with notes indicating where the prologue ends and where
5784 the epilogue begins. Update the basic block information when possible.
5786 Notes on epilogue placement:
5787 There are several kinds of edges to the exit block:
5788 * a single fallthru edge from LAST_BB
5789 * possibly, edges from blocks containing sibcalls
5790 * possibly, fake edges from infinite loops
5792 The epilogue is always emitted on the fallthru edge from the last basic
5793 block in the function, LAST_BB, into the exit block.
5795 If LAST_BB is empty except for a label, it is the target of every
5796 other basic block in the function that ends in a return. If a
5797 target has a return or simple_return pattern (possibly with
5798 conditional variants), these basic blocks can be changed so that a
5799 return insn is emitted into them, and their target is adjusted to
5800 the real exit block.
5802 Notes on shrink wrapping: We implement a fairly conservative
5803 version of shrink-wrapping rather than the textbook one. We only
5804 generate a single prologue and a single epilogue. This is
5805 sufficient to catch a number of interesting cases involving early
5808 First, we identify the blocks that require the prologue to occur before
5809 them. These are the ones that modify a call-saved register, or reference
5810 any of the stack or frame pointer registers. To simplify things, we then
5811 mark everything reachable from these blocks as also requiring a prologue.
5812 This takes care of loops automatically, and avoids the need to examine
5813 whether MEMs reference the frame, since it is sufficient to check for
5814 occurrences of the stack or frame pointer.
5816 We then compute the set of blocks for which the need for a prologue
5817 is anticipatable (borrowing terminology from the shrink-wrapping
5818 description in Muchnick's book). These are the blocks which either
5819 require a prologue themselves, or those that have only successors
5820 where the prologue is anticipatable. The prologue needs to be
5821 inserted on all edges from BB1->BB2 where BB2 is in ANTIC and BB1
5822 is not. For the moment, we ensure that only one such edge exists.
5824 The epilogue is placed as described above, but we make a
5825 distinction between inserting return and simple_return patterns
5826 when modifying other blocks that end in a return. Blocks that end
5827 in a sibcall omit the sibcall_epilogue if the block is not in
5831 thread_prologue_and_epilogue_insns (void)
5835 /* Can't deal with multiple successors of the entry block at the
5836 moment. Function should always have at least one entry
5838 gcc_assert (single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5840 edge entry_edge
= single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
5841 edge orig_entry_edge
= entry_edge
;
5843 rtx_insn
*split_prologue_seq
= make_split_prologue_seq ();
5844 rtx_insn
*prologue_seq
= make_prologue_seq ();
5845 rtx_insn
*epilogue_seq
= make_epilogue_seq ();
5847 /* Try to perform a kind of shrink-wrapping, making sure the
5848 prologue/epilogue is emitted only around those parts of the
5849 function that require it. */
5850 try_shrink_wrapping (&entry_edge
, prologue_seq
);
5852 /* If the target can handle splitting the prologue/epilogue into separate
5853 components, try to shrink-wrap these components separately. */
5854 try_shrink_wrapping_separate (entry_edge
->dest
);
5856 /* If that did anything for any component we now need the generate the
5857 "main" prologue again. Because some targets require some of these
5858 to be called in a specific order (i386 requires the split prologue
5859 to be first, for example), we create all three sequences again here.
5860 If this does not work for some target, that target should not enable
5861 separate shrink-wrapping. */
5862 if (crtl
->shrink_wrapped_separate
)
5864 split_prologue_seq
= make_split_prologue_seq ();
5865 prologue_seq
= make_prologue_seq ();
5866 epilogue_seq
= make_epilogue_seq ();
5869 rtl_profile_for_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
));
5871 /* A small fib -- epilogue is not yet completed, but we wish to re-use
5872 this marker for the splits of EH_RETURN patterns, and nothing else
5873 uses the flag in the meantime. */
5874 epilogue_completed
= 1;
5876 /* Find non-fallthru edges that end with EH_RETURN instructions. On
5877 some targets, these get split to a special version of the epilogue
5878 code. In order to be able to properly annotate these with unwind
5879 info, try to split them now. If we get a valid split, drop an
5880 EPILOGUE_BEG note and mark the insns as epilogue insns. */
5883 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5885 rtx_insn
*prev
, *last
, *trial
;
5887 if (e
->flags
& EDGE_FALLTHRU
)
5889 last
= BB_END (e
->src
);
5890 if (!eh_returnjump_p (last
))
5893 prev
= PREV_INSN (last
);
5894 trial
= try_split (PATTERN (last
), last
, 1);
5898 record_insns (NEXT_INSN (prev
), NEXT_INSN (trial
), &epilogue_insn_hash
);
5899 emit_note_after (NOTE_INSN_EPILOGUE_BEG
, prev
);
5902 edge exit_fallthru_edge
= find_fallthru_edge (EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
);
5904 if (exit_fallthru_edge
)
5908 insert_insn_on_edge (epilogue_seq
, exit_fallthru_edge
);
5909 commit_edge_insertions ();
5911 /* The epilogue insns we inserted may cause the exit edge to no longer
5913 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5915 if (((e
->flags
& EDGE_FALLTHRU
) != 0)
5916 && returnjump_p (BB_END (e
->src
)))
5917 e
->flags
&= ~EDGE_FALLTHRU
;
5920 else if (next_active_insn (BB_END (exit_fallthru_edge
->src
)))
5922 /* We have a fall-through edge to the exit block, the source is not
5923 at the end of the function, and there will be an assembler epilogue
5924 at the end of the function.
5925 We can't use force_nonfallthru here, because that would try to
5926 use return. Inserting a jump 'by hand' is extremely messy, so
5927 we take advantage of cfg_layout_finalize using
5928 fixup_fallthru_exit_predecessor. */
5929 cfg_layout_initialize (0);
5931 FOR_EACH_BB_FN (cur_bb
, cfun
)
5932 if (cur_bb
->index
>= NUM_FIXED_BLOCKS
5933 && cur_bb
->next_bb
->index
>= NUM_FIXED_BLOCKS
)
5934 cur_bb
->aux
= cur_bb
->next_bb
;
5935 cfg_layout_finalize ();
5939 /* Insert the prologue. */
5941 rtl_profile_for_bb (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
5943 if (split_prologue_seq
|| prologue_seq
)
5945 rtx_insn
*split_prologue_insn
= split_prologue_seq
;
5946 if (split_prologue_seq
)
5948 while (split_prologue_insn
&& !NONDEBUG_INSN_P (split_prologue_insn
))
5949 split_prologue_insn
= NEXT_INSN (split_prologue_insn
);
5950 insert_insn_on_edge (split_prologue_seq
, orig_entry_edge
);
5953 rtx_insn
*prologue_insn
= prologue_seq
;
5956 while (prologue_insn
&& !NONDEBUG_INSN_P (prologue_insn
))
5957 prologue_insn
= NEXT_INSN (prologue_insn
);
5958 insert_insn_on_edge (prologue_seq
, entry_edge
);
5961 commit_edge_insertions ();
5963 /* Look for basic blocks within the prologue insns. */
5964 if (split_prologue_insn
5965 && BLOCK_FOR_INSN (split_prologue_insn
) == NULL
)
5966 split_prologue_insn
= NULL
;
5968 && BLOCK_FOR_INSN (prologue_insn
) == NULL
)
5969 prologue_insn
= NULL
;
5970 if (split_prologue_insn
|| prologue_insn
)
5972 auto_sbitmap
blocks (last_basic_block_for_fn (cfun
));
5973 bitmap_clear (blocks
);
5974 if (split_prologue_insn
)
5975 bitmap_set_bit (blocks
,
5976 BLOCK_FOR_INSN (split_prologue_insn
)->index
);
5978 bitmap_set_bit (blocks
, BLOCK_FOR_INSN (prologue_insn
)->index
);
5979 find_many_sub_basic_blocks (blocks
);
5983 default_rtl_profile ();
5985 /* Emit sibling epilogues before any sibling call sites. */
5986 for (ei
= ei_start (EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
);
5987 (e
= ei_safe_edge (ei
));
5990 /* Skip those already handled, the ones that run without prologue. */
5991 if (e
->flags
& EDGE_IGNORE
)
5993 e
->flags
&= ~EDGE_IGNORE
;
5997 rtx_insn
*insn
= BB_END (e
->src
);
5999 if (!(CALL_P (insn
) && SIBLING_CALL_P (insn
)))
6002 if (rtx_insn
*ep_seq
= targetm
.gen_sibcall_epilogue ())
6005 emit_note (NOTE_INSN_EPILOGUE_BEG
);
6007 rtx_insn
*seq
= get_insns ();
6010 /* Retain a map of the epilogue insns. Used in life analysis to
6011 avoid getting rid of sibcall epilogue insns. Do this before we
6012 actually emit the sequence. */
6013 record_insns (seq
, NULL
, &epilogue_insn_hash
);
6014 set_insn_locations (seq
, epilogue_location
);
6016 emit_insn_before (seq
, insn
);
6022 rtx_insn
*insn
, *next
;
6024 /* Similarly, move any line notes that appear after the epilogue.
6025 There is no need, however, to be quite so anal about the existence
6026 of such a note. Also possibly move
6027 NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
6029 for (insn
= epilogue_seq
; insn
; insn
= next
)
6031 next
= NEXT_INSN (insn
);
6033 && (NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
))
6034 reorder_insns (insn
, insn
, PREV_INSN (epilogue_seq
));
6038 /* Threading the prologue and epilogue changes the artificial refs
6039 in the entry and exit blocks. */
6040 epilogue_completed
= 1;
6041 df_update_entry_exit_and_calls ();
6044 /* Reposition the prologue-end and epilogue-begin notes after
6045 instruction scheduling. */
6048 reposition_prologue_and_epilogue_notes (void)
6050 if (!targetm
.have_prologue ()
6051 && !targetm
.have_epilogue ()
6052 && !targetm
.have_sibcall_epilogue ())
6055 /* Since the hash table is created on demand, the fact that it is
6056 non-null is a signal that it is non-empty. */
6057 if (prologue_insn_hash
!= NULL
)
6059 size_t len
= prologue_insn_hash
->elements ();
6060 rtx_insn
*insn
, *last
= NULL
, *note
= NULL
;
6062 /* Scan from the beginning until we reach the last prologue insn. */
6063 /* ??? While we do have the CFG intact, there are two problems:
6064 (1) The prologue can contain loops (typically probing the stack),
6065 which means that the end of the prologue isn't in the first bb.
6066 (2) Sometimes the PROLOGUE_END note gets pushed into the next bb. */
6067 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
6071 if (NOTE_KIND (insn
) == NOTE_INSN_PROLOGUE_END
)
6074 else if (contains (insn
, prologue_insn_hash
))
6086 /* Scan forward looking for the PROLOGUE_END note. It should
6087 be right at the beginning of the block, possibly with other
6088 insn notes that got moved there. */
6089 for (note
= NEXT_INSN (last
); ; note
= NEXT_INSN (note
))
6092 && NOTE_KIND (note
) == NOTE_INSN_PROLOGUE_END
)
6097 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
6099 last
= NEXT_INSN (last
);
6100 reorder_insns (note
, note
, last
);
6104 if (epilogue_insn_hash
!= NULL
)
6109 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
6111 rtx_insn
*insn
, *first
= NULL
, *note
= NULL
;
6112 basic_block bb
= e
->src
;
6114 /* Scan from the beginning until we reach the first epilogue insn. */
6115 FOR_BB_INSNS (bb
, insn
)
6119 if (NOTE_KIND (insn
) == NOTE_INSN_EPILOGUE_BEG
)
6126 else if (first
== NULL
&& contains (insn
, epilogue_insn_hash
))
6136 /* If the function has a single basic block, and no real
6137 epilogue insns (e.g. sibcall with no cleanup), the
6138 epilogue note can get scheduled before the prologue
6139 note. If we have frame related prologue insns, having
6140 them scanned during the epilogue will result in a crash.
6141 In this case re-order the epilogue note to just before
6142 the last insn in the block. */
6144 first
= BB_END (bb
);
6146 if (PREV_INSN (first
) != note
)
6147 reorder_insns (note
, note
, PREV_INSN (first
));
6153 /* Returns the name of function declared by FNDECL. */
6155 fndecl_name (tree fndecl
)
6159 return lang_hooks
.decl_printable_name (fndecl
, 1);
6162 /* Returns the name of function FN. */
6164 function_name (struct function
*fn
)
6166 tree fndecl
= (fn
== NULL
) ? NULL
: fn
->decl
;
6167 return fndecl_name (fndecl
);
6170 /* Returns the name of the current function. */
6172 current_function_name (void)
6174 return function_name (cfun
);
6179 rest_of_handle_check_leaf_regs (void)
6181 #ifdef LEAF_REGISTERS
6182 crtl
->uses_only_leaf_regs
6183 = optimize
> 0 && only_leaf_regs_used () && leaf_function_p ();
6188 /* Insert a TYPE into the used types hash table of CFUN. */
6191 used_types_insert_helper (tree type
, struct function
*func
)
6193 if (type
!= NULL
&& func
!= NULL
)
6195 if (func
->used_types_hash
== NULL
)
6196 func
->used_types_hash
= hash_set
<tree
>::create_ggc (37);
6198 func
->used_types_hash
->add (type
);
6202 /* Given a type, insert it into the used hash table in cfun. */
6204 used_types_insert (tree t
)
6206 while (POINTER_TYPE_P (t
) || TREE_CODE (t
) == ARRAY_TYPE
)
6211 if (TREE_CODE (t
) == ERROR_MARK
)
6213 if (TYPE_NAME (t
) == NULL_TREE
6214 || TYPE_NAME (t
) == TYPE_NAME (TYPE_MAIN_VARIANT (t
)))
6215 t
= TYPE_MAIN_VARIANT (t
);
6216 if (debug_info_level
> DINFO_LEVEL_NONE
)
6219 used_types_insert_helper (t
, cfun
);
6222 /* So this might be a type referenced by a global variable.
6223 Record that type so that we can later decide to emit its
6224 debug information. */
6225 vec_safe_push (types_used_by_cur_var_decl
, t
);
6230 /* Helper to Hash a struct types_used_by_vars_entry. */
6233 hash_types_used_by_vars_entry (const struct types_used_by_vars_entry
*entry
)
6235 gcc_assert (entry
&& entry
->var_decl
&& entry
->type
);
6237 return iterative_hash_object (entry
->type
,
6238 iterative_hash_object (entry
->var_decl
, 0));
6241 /* Hash function of the types_used_by_vars_entry hash table. */
6244 used_type_hasher::hash (types_used_by_vars_entry
*entry
)
6246 return hash_types_used_by_vars_entry (entry
);
6249 /*Equality function of the types_used_by_vars_entry hash table. */
6252 used_type_hasher::equal (types_used_by_vars_entry
*e1
,
6253 types_used_by_vars_entry
*e2
)
6255 return (e1
->var_decl
== e2
->var_decl
&& e1
->type
== e2
->type
);
6258 /* Inserts an entry into the types_used_by_vars_hash hash table. */
6261 types_used_by_var_decl_insert (tree type
, tree var_decl
)
6263 if (type
!= NULL
&& var_decl
!= NULL
)
6265 types_used_by_vars_entry
**slot
;
6266 struct types_used_by_vars_entry e
;
6267 e
.var_decl
= var_decl
;
6269 if (types_used_by_vars_hash
== NULL
)
6270 types_used_by_vars_hash
6271 = hash_table
<used_type_hasher
>::create_ggc (37);
6273 slot
= types_used_by_vars_hash
->find_slot (&e
, INSERT
);
6276 struct types_used_by_vars_entry
*entry
;
6277 entry
= ggc_alloc
<types_used_by_vars_entry
> ();
6279 entry
->var_decl
= var_decl
;
6287 const pass_data pass_data_leaf_regs
=
6289 RTL_PASS
, /* type */
6290 "*leaf_regs", /* name */
6291 OPTGROUP_NONE
, /* optinfo_flags */
6292 TV_NONE
, /* tv_id */
6293 0, /* properties_required */
6294 0, /* properties_provided */
6295 0, /* properties_destroyed */
6296 0, /* todo_flags_start */
6297 0, /* todo_flags_finish */
6300 class pass_leaf_regs
: public rtl_opt_pass
6303 pass_leaf_regs (gcc::context
*ctxt
)
6304 : rtl_opt_pass (pass_data_leaf_regs
, ctxt
)
6307 /* opt_pass methods: */
6308 virtual unsigned int execute (function
*)
6310 return rest_of_handle_check_leaf_regs ();
6313 }; // class pass_leaf_regs
6318 make_pass_leaf_regs (gcc::context
*ctxt
)
6320 return new pass_leaf_regs (ctxt
);
6324 rest_of_handle_thread_prologue_and_epilogue (void)
6326 /* prepare_shrink_wrap is sensitive to the block structure of the control
6327 flow graph, so clean it up first. */
6331 /* On some machines, the prologue and epilogue code, or parts thereof,
6332 can be represented as RTL. Doing so lets us schedule insns between
6333 it and the rest of the code and also allows delayed branch
6334 scheduling to operate in the epilogue. */
6335 thread_prologue_and_epilogue_insns ();
6337 /* Some non-cold blocks may now be only reachable from cold blocks.
6339 fixup_partitions ();
6341 /* Shrink-wrapping can result in unreachable edges in the epilogue,
6343 cleanup_cfg (optimize
? CLEANUP_EXPENSIVE
: 0);
6345 /* The stack usage info is finalized during prologue expansion. */
6346 if (flag_stack_usage_info
)
6347 output_stack_usage ();
6354 const pass_data pass_data_thread_prologue_and_epilogue
=
6356 RTL_PASS
, /* type */
6357 "pro_and_epilogue", /* name */
6358 OPTGROUP_NONE
, /* optinfo_flags */
6359 TV_THREAD_PROLOGUE_AND_EPILOGUE
, /* tv_id */
6360 0, /* properties_required */
6361 0, /* properties_provided */
6362 0, /* properties_destroyed */
6363 0, /* todo_flags_start */
6364 ( TODO_df_verify
| TODO_df_finish
), /* todo_flags_finish */
6367 class pass_thread_prologue_and_epilogue
: public rtl_opt_pass
6370 pass_thread_prologue_and_epilogue (gcc::context
*ctxt
)
6371 : rtl_opt_pass (pass_data_thread_prologue_and_epilogue
, ctxt
)
6374 /* opt_pass methods: */
6375 virtual unsigned int execute (function
*)
6377 return rest_of_handle_thread_prologue_and_epilogue ();
6380 }; // class pass_thread_prologue_and_epilogue
6385 make_pass_thread_prologue_and_epilogue (gcc::context
*ctxt
)
6387 return new pass_thread_prologue_and_epilogue (ctxt
);
6391 /* If CONSTRAINT is a matching constraint, then return its number.
6392 Otherwise, return -1. */
6395 matching_constraint_num (const char *constraint
)
6397 if (*constraint
== '%')
6400 if (IN_RANGE (*constraint
, '0', '9'))
6401 return strtoul (constraint
, NULL
, 10);
6406 /* This mini-pass fixes fall-out from SSA in asm statements that have
6407 in-out constraints. Say you start with
6410 asm ("": "+mr" (inout));
6413 which is transformed very early to use explicit output and match operands:
6416 asm ("": "=mr" (inout) : "0" (inout));
6419 Or, after SSA and copyprop,
6421 asm ("": "=mr" (inout_2) : "0" (inout_1));
6424 Clearly inout_2 and inout_1 can't be coalesced easily anymore, as
6425 they represent two separate values, so they will get different pseudo
6426 registers during expansion. Then, since the two operands need to match
6427 per the constraints, but use different pseudo registers, reload can
6428 only register a reload for these operands. But reloads can only be
6429 satisfied by hardregs, not by memory, so we need a register for this
6430 reload, just because we are presented with non-matching operands.
6431 So, even though we allow memory for this operand, no memory can be
6432 used for it, just because the two operands don't match. This can
6433 cause reload failures on register-starved targets.
6435 So it's a symptom of reload not being able to use memory for reloads
6436 or, alternatively it's also a symptom of both operands not coming into
6437 reload as matching (in which case the pseudo could go to memory just
6438 fine, as the alternative allows it, and no reload would be necessary).
6439 We fix the latter problem here, by transforming
6441 asm ("": "=mr" (inout_2) : "0" (inout_1));
6446 asm ("": "=mr" (inout_2) : "0" (inout_2)); */
6449 match_asm_constraints_1 (rtx_insn
*insn
, rtx
*p_sets
, int noutputs
)
6452 bool changed
= false;
6453 rtx op
= SET_SRC (p_sets
[0]);
6454 int ninputs
= ASM_OPERANDS_INPUT_LENGTH (op
);
6455 rtvec inputs
= ASM_OPERANDS_INPUT_VEC (op
);
6456 bool *output_matched
= XALLOCAVEC (bool, noutputs
);
6458 memset (output_matched
, 0, noutputs
* sizeof (bool));
6459 for (i
= 0; i
< ninputs
; i
++)
6463 const char *constraint
= ASM_OPERANDS_INPUT_CONSTRAINT (op
, i
);
6466 match
= matching_constraint_num (constraint
);
6470 gcc_assert (match
< noutputs
);
6471 output
= SET_DEST (p_sets
[match
]);
6472 input
= RTVEC_ELT (inputs
, i
);
6473 /* Only do the transformation for pseudos. */
6474 if (! REG_P (output
)
6475 || rtx_equal_p (output
, input
)
6476 || !(REG_P (input
) || SUBREG_P (input
)
6477 || MEM_P (input
) || CONSTANT_P (input
))
6478 || !general_operand (input
, GET_MODE (output
)))
6481 /* We can't do anything if the output is also used as input,
6482 as we're going to overwrite it. */
6483 for (j
= 0; j
< ninputs
; j
++)
6484 if (reg_overlap_mentioned_p (output
, RTVEC_ELT (inputs
, j
)))
6489 /* Avoid changing the same input several times. For
6490 asm ("" : "=mr" (out1), "=mr" (out2) : "0" (in), "1" (in));
6491 only change it once (to out1), rather than changing it
6492 first to out1 and afterwards to out2. */
6495 for (j
= 0; j
< noutputs
; j
++)
6496 if (output_matched
[j
] && input
== SET_DEST (p_sets
[j
]))
6501 output_matched
[match
] = true;
6504 emit_move_insn (output
, copy_rtx (input
));
6505 insns
= get_insns ();
6507 emit_insn_before (insns
, insn
);
6509 constraint
= ASM_OPERANDS_OUTPUT_CONSTRAINT(SET_SRC(p_sets
[match
]));
6510 bool early_clobber_p
= strchr (constraint
, '&') != NULL
;
6512 /* Now replace all mentions of the input with output. We can't
6513 just replace the occurrence in inputs[i], as the register might
6514 also be used in some other input (or even in an address of an
6515 output), which would mean possibly increasing the number of
6516 inputs by one (namely 'output' in addition), which might pose
6517 a too complicated problem for reload to solve. E.g. this situation:
6519 asm ("" : "=r" (output), "=m" (input) : "0" (input))
6521 Here 'input' is used in two occurrences as input (once for the
6522 input operand, once for the address in the second output operand).
6523 If we would replace only the occurrence of the input operand (to
6524 make the matching) we would be left with this:
6527 asm ("" : "=r" (output), "=m" (input) : "0" (output))
6529 Now we suddenly have two different input values (containing the same
6530 value, but different pseudos) where we formerly had only one.
6531 With more complicated asms this might lead to reload failures
6532 which wouldn't have happen without this pass. So, iterate over
6533 all operands and replace all occurrences of the register used.
6535 However, if one or more of the 'input' uses have a non-matching
6536 constraint and the matched output operand is an early clobber
6537 operand, then do not replace the input operand, since by definition
6538 it conflicts with the output operand and cannot share the same
6539 register. See PR89313 for details. */
6541 for (j
= 0; j
< noutputs
; j
++)
6542 if (!rtx_equal_p (SET_DEST (p_sets
[j
]), input
)
6543 && reg_overlap_mentioned_p (input
, SET_DEST (p_sets
[j
])))
6544 SET_DEST (p_sets
[j
]) = replace_rtx (SET_DEST (p_sets
[j
]),
6546 for (j
= 0; j
< ninputs
; j
++)
6547 if (reg_overlap_mentioned_p (input
, RTVEC_ELT (inputs
, j
)))
6549 if (!early_clobber_p
6550 || match
== matching_constraint_num
6551 (ASM_OPERANDS_INPUT_CONSTRAINT (op
, j
)))
6552 RTVEC_ELT (inputs
, j
) = replace_rtx (RTVEC_ELT (inputs
, j
),
6560 df_insn_rescan (insn
);
6563 /* Add the decl D to the local_decls list of FUN. */
6566 add_local_decl (struct function
*fun
, tree d
)
6568 gcc_assert (VAR_P (d
));
6569 vec_safe_push (fun
->local_decls
, d
);
6574 const pass_data pass_data_match_asm_constraints
=
6576 RTL_PASS
, /* type */
6577 "asmcons", /* name */
6578 OPTGROUP_NONE
, /* optinfo_flags */
6579 TV_NONE
, /* tv_id */
6580 0, /* properties_required */
6581 0, /* properties_provided */
6582 0, /* properties_destroyed */
6583 0, /* todo_flags_start */
6584 0, /* todo_flags_finish */
6587 class pass_match_asm_constraints
: public rtl_opt_pass
6590 pass_match_asm_constraints (gcc::context
*ctxt
)
6591 : rtl_opt_pass (pass_data_match_asm_constraints
, ctxt
)
6594 /* opt_pass methods: */
6595 virtual unsigned int execute (function
*);
6597 }; // class pass_match_asm_constraints
6600 pass_match_asm_constraints::execute (function
*fun
)
6607 if (!crtl
->has_asm_statement
)
6610 df_set_flags (DF_DEFER_INSN_RESCAN
);
6611 FOR_EACH_BB_FN (bb
, fun
)
6613 FOR_BB_INSNS (bb
, insn
)
6618 pat
= PATTERN (insn
);
6619 if (GET_CODE (pat
) == PARALLEL
)
6620 p_sets
= &XVECEXP (pat
, 0, 0), noutputs
= XVECLEN (pat
, 0);
6621 else if (GET_CODE (pat
) == SET
)
6622 p_sets
= &PATTERN (insn
), noutputs
= 1;
6626 if (GET_CODE (*p_sets
) == SET
6627 && GET_CODE (SET_SRC (*p_sets
)) == ASM_OPERANDS
)
6628 match_asm_constraints_1 (insn
, p_sets
, noutputs
);
6632 return TODO_df_finish
;
6638 make_pass_match_asm_constraints (gcc::context
*ctxt
)
6640 return new pass_match_asm_constraints (ctxt
);
6644 #include "gt-function.h"