1 /* Expands front end tree to back end RTL for GCC.
2 Copyright (C) 1987-2015 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"
38 #include "rtl-error.h"
42 #include "double-int.h"
49 #include "fold-const.h"
50 #include "stor-layout.h"
52 #include "stringpool.h"
56 #include "hard-reg-set.h"
59 #include "statistics.h"
61 #include "fixed-value.h"
62 #include "insn-config.h"
70 #include "insn-codes.h"
77 #include "langhooks.h"
79 #include "common/common-target.h"
80 #include "gimple-expr.h"
82 #include "tree-pass.h"
84 #include "dominance.h"
89 #include "cfgcleanup.h"
90 #include "basic-block.h"
93 #include "bb-reorder.h"
94 #include "shrink-wrap.h"
97 #include "tree-chkp.h"
100 /* So we can assign to cfun in this file. */
103 #ifndef STACK_ALIGNMENT_NEEDED
104 #define STACK_ALIGNMENT_NEEDED 1
107 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
109 /* Round a value to the lowest integer less than it that is a multiple of
110 the required alignment. Avoid using division in case the value is
111 negative. Assume the alignment is a power of two. */
112 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
114 /* Similar, but round to the next highest integer that meets the
116 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
118 /* Nonzero once virtual register instantiation has been done.
119 assign_stack_local uses frame_pointer_rtx when this is nonzero.
120 calls.c:emit_library_call_value_1 uses it to set up
121 post-instantiation libcalls. */
122 int virtuals_instantiated
;
124 /* Assign unique numbers to labels generated for profiling, debugging, etc. */
125 static GTY(()) int funcdef_no
;
127 /* These variables hold pointers to functions to create and destroy
128 target specific, per-function data structures. */
129 struct machine_function
* (*init_machine_status
) (void);
131 /* The currently compiled function. */
132 struct function
*cfun
= 0;
134 /* These hashes record the prologue and epilogue insns. */
136 struct insn_cache_hasher
: ggc_cache_hasher
<rtx
>
138 static hashval_t
hash (rtx x
) { return htab_hash_pointer (x
); }
139 static bool equal (rtx a
, rtx b
) { return a
== b
; }
143 hash_table
<insn_cache_hasher
> *prologue_insn_hash
;
145 hash_table
<insn_cache_hasher
> *epilogue_insn_hash
;
148 hash_table
<used_type_hasher
> *types_used_by_vars_hash
= NULL
;
149 vec
<tree
, va_gc
> *types_used_by_cur_var_decl
;
151 /* Forward declarations. */
153 static struct temp_slot
*find_temp_slot_from_address (rtx
);
154 static void pad_to_arg_alignment (struct args_size
*, int, struct args_size
*);
155 static void pad_below (struct args_size
*, machine_mode
, tree
);
156 static void reorder_blocks_1 (rtx_insn
*, tree
, vec
<tree
> *);
157 static int all_blocks (tree
, tree
*);
158 static tree
*get_block_vector (tree
, int *);
159 extern tree
debug_find_var_in_block_tree (tree
, tree
);
160 /* We always define `record_insns' even if it's not used so that we
161 can always export `prologue_epilogue_contains'. */
162 static void record_insns (rtx_insn
*, rtx
, hash_table
<insn_cache_hasher
> **)
164 static bool contains (const_rtx
, hash_table
<insn_cache_hasher
> *);
165 static void prepare_function_start (void);
166 static void do_clobber_return_reg (rtx
, void *);
167 static void do_use_return_reg (rtx
, void *);
169 /* Stack of nested functions. */
170 /* Keep track of the cfun stack. */
172 typedef struct function
*function_p
;
174 static vec
<function_p
> function_context_stack
;
176 /* Save the current context for compilation of a nested function.
177 This is called from language-specific code. */
180 push_function_context (void)
183 allocate_struct_function (NULL
, false);
185 function_context_stack
.safe_push (cfun
);
189 /* Restore the last saved context, at the end of a nested function.
190 This function is called from language-specific code. */
193 pop_function_context (void)
195 struct function
*p
= function_context_stack
.pop ();
197 current_function_decl
= p
->decl
;
199 /* Reset variables that have known state during rtx generation. */
200 virtuals_instantiated
= 0;
201 generating_concat_p
= 1;
204 /* Clear out all parts of the state in F that can safely be discarded
205 after the function has been parsed, but not compiled, to let
206 garbage collection reclaim the memory. */
209 free_after_parsing (struct function
*f
)
214 /* Clear out all parts of the state in F that can safely be discarded
215 after the function has been compiled, to let garbage collection
216 reclaim the memory. */
219 free_after_compilation (struct function
*f
)
221 prologue_insn_hash
= NULL
;
222 epilogue_insn_hash
= NULL
;
224 free (crtl
->emit
.regno_pointer_align
);
226 memset (crtl
, 0, sizeof (struct rtl_data
));
231 regno_reg_rtx
= NULL
;
234 /* Return size needed for stack frame based on slots so far allocated.
235 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
236 the caller may have to do that. */
239 get_frame_size (void)
241 if (FRAME_GROWS_DOWNWARD
)
242 return -frame_offset
;
247 /* Issue an error message and return TRUE if frame OFFSET overflows in
248 the signed target pointer arithmetics for function FUNC. Otherwise
252 frame_offset_overflow (HOST_WIDE_INT offset
, tree func
)
254 unsigned HOST_WIDE_INT size
= FRAME_GROWS_DOWNWARD
? -offset
: offset
;
256 if (size
> ((unsigned HOST_WIDE_INT
) 1 << (GET_MODE_BITSIZE (Pmode
) - 1))
257 /* Leave room for the fixed part of the frame. */
258 - 64 * UNITS_PER_WORD
)
260 error_at (DECL_SOURCE_LOCATION (func
),
261 "total size of local objects too large");
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 (HOST_WIDE_INT start
, HOST_WIDE_INT length
,
297 HOST_WIDE_INT size
, unsigned int alignment
,
298 HOST_WIDE_INT
*poffset
)
300 HOST_WIDE_INT 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
= 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 /* We must be careful here, since FRAME_OFFSET might be negative and
312 division with a negative dividend isn't as well defined as we might
313 like. So we instead assume that ALIGNMENT is a power of two and
314 use logical operations which are unambiguous. */
315 if (FRAME_GROWS_DOWNWARD
)
317 = (FLOOR_ROUND (start
+ length
- size
- frame_phase
,
318 (unsigned HOST_WIDE_INT
) alignment
)
322 = (CEIL_ROUND (start
- frame_phase
,
323 (unsigned HOST_WIDE_INT
) alignment
)
326 /* See if it fits. If this space is at the edge of the frame,
327 consider extending the frame to make it fit. Our caller relies on
328 this when allocating a new slot. */
329 if (frame_offset
== start
&& this_frame_offset
< frame_offset
)
330 frame_offset
= this_frame_offset
;
331 else if (this_frame_offset
< start
)
333 else if (start
+ length
== frame_offset
334 && this_frame_offset
+ size
> start
+ length
)
335 frame_offset
= this_frame_offset
+ size
;
336 else if (this_frame_offset
+ size
> start
+ length
)
339 *poffset
= this_frame_offset
;
343 /* Create a new frame_space structure describing free space in the stack
344 frame beginning at START and ending at END, and chain it into the
345 function's frame_space_list. */
348 add_frame_space (HOST_WIDE_INT start
, HOST_WIDE_INT end
)
350 struct frame_space
*space
= ggc_alloc
<frame_space
> ();
351 space
->next
= crtl
->frame_space_list
;
352 crtl
->frame_space_list
= space
;
353 space
->start
= start
;
354 space
->length
= end
- start
;
357 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
358 with machine mode MODE.
360 ALIGN controls the amount of alignment for the address of the slot:
361 0 means according to MODE,
362 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
363 -2 means use BITS_PER_UNIT,
364 positive specifies alignment boundary in bits.
366 KIND has ASLK_REDUCE_ALIGN bit set if it is OK to reduce
367 alignment and ASLK_RECORD_PAD bit set if we should remember
368 extra space we allocated for alignment purposes. When we are
369 called from assign_stack_temp_for_type, it is not set so we don't
370 track the same stack slot in two independent lists.
372 We do not round to stack_boundary here. */
375 assign_stack_local_1 (machine_mode mode
, HOST_WIDE_INT size
,
379 int bigend_correction
= 0;
380 HOST_WIDE_INT slot_offset
= 0, old_frame_offset
;
381 unsigned int alignment
, alignment_in_bits
;
385 alignment
= get_stack_local_alignment (NULL
, mode
);
386 alignment
/= BITS_PER_UNIT
;
388 else if (align
== -1)
390 alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
391 size
= CEIL_ROUND (size
, alignment
);
393 else if (align
== -2)
394 alignment
= 1; /* BITS_PER_UNIT / BITS_PER_UNIT */
396 alignment
= align
/ BITS_PER_UNIT
;
398 alignment_in_bits
= alignment
* BITS_PER_UNIT
;
400 /* Ignore alignment if it exceeds MAX_SUPPORTED_STACK_ALIGNMENT. */
401 if (alignment_in_bits
> MAX_SUPPORTED_STACK_ALIGNMENT
)
403 alignment_in_bits
= MAX_SUPPORTED_STACK_ALIGNMENT
;
404 alignment
= alignment_in_bits
/ BITS_PER_UNIT
;
407 if (SUPPORTS_STACK_ALIGNMENT
)
409 if (crtl
->stack_alignment_estimated
< alignment_in_bits
)
411 if (!crtl
->stack_realign_processed
)
412 crtl
->stack_alignment_estimated
= alignment_in_bits
;
415 /* If stack is realigned and stack alignment value
416 hasn't been finalized, it is OK not to increase
417 stack_alignment_estimated. The bigger alignment
418 requirement is recorded in stack_alignment_needed
420 gcc_assert (!crtl
->stack_realign_finalized
);
421 if (!crtl
->stack_realign_needed
)
423 /* It is OK to reduce the alignment as long as the
424 requested size is 0 or the estimated stack
425 alignment >= mode alignment. */
426 gcc_assert ((kind
& ASLK_REDUCE_ALIGN
)
428 || (crtl
->stack_alignment_estimated
429 >= GET_MODE_ALIGNMENT (mode
)));
430 alignment_in_bits
= crtl
->stack_alignment_estimated
;
431 alignment
= alignment_in_bits
/ BITS_PER_UNIT
;
437 if (crtl
->stack_alignment_needed
< alignment_in_bits
)
438 crtl
->stack_alignment_needed
= alignment_in_bits
;
439 if (crtl
->max_used_stack_slot_alignment
< alignment_in_bits
)
440 crtl
->max_used_stack_slot_alignment
= alignment_in_bits
;
442 if (mode
!= BLKmode
|| size
!= 0)
444 if (kind
& ASLK_RECORD_PAD
)
446 struct frame_space
**psp
;
448 for (psp
= &crtl
->frame_space_list
; *psp
; psp
= &(*psp
)->next
)
450 struct frame_space
*space
= *psp
;
451 if (!try_fit_stack_local (space
->start
, space
->length
, size
,
452 alignment
, &slot_offset
))
455 if (slot_offset
> space
->start
)
456 add_frame_space (space
->start
, slot_offset
);
457 if (slot_offset
+ size
< space
->start
+ space
->length
)
458 add_frame_space (slot_offset
+ size
,
459 space
->start
+ space
->length
);
464 else if (!STACK_ALIGNMENT_NEEDED
)
466 slot_offset
= frame_offset
;
470 old_frame_offset
= frame_offset
;
472 if (FRAME_GROWS_DOWNWARD
)
474 frame_offset
-= size
;
475 try_fit_stack_local (frame_offset
, size
, size
, alignment
, &slot_offset
);
477 if (kind
& ASLK_RECORD_PAD
)
479 if (slot_offset
> frame_offset
)
480 add_frame_space (frame_offset
, slot_offset
);
481 if (slot_offset
+ size
< old_frame_offset
)
482 add_frame_space (slot_offset
+ size
, old_frame_offset
);
487 frame_offset
+= size
;
488 try_fit_stack_local (old_frame_offset
, size
, size
, alignment
, &slot_offset
);
490 if (kind
& ASLK_RECORD_PAD
)
492 if (slot_offset
> old_frame_offset
)
493 add_frame_space (old_frame_offset
, slot_offset
);
494 if (slot_offset
+ size
< frame_offset
)
495 add_frame_space (slot_offset
+ size
, frame_offset
);
500 /* On a big-endian machine, if we are allocating more space than we will use,
501 use the least significant bytes of those that are allocated. */
502 if (BYTES_BIG_ENDIAN
&& mode
!= BLKmode
&& GET_MODE_SIZE (mode
) < size
)
503 bigend_correction
= size
- GET_MODE_SIZE (mode
);
505 /* If we have already instantiated virtual registers, return the actual
506 address relative to the frame pointer. */
507 if (virtuals_instantiated
)
508 addr
= plus_constant (Pmode
, frame_pointer_rtx
,
510 (slot_offset
+ bigend_correction
511 + STARTING_FRAME_OFFSET
, Pmode
));
513 addr
= plus_constant (Pmode
, virtual_stack_vars_rtx
,
515 (slot_offset
+ bigend_correction
,
518 x
= gen_rtx_MEM (mode
, addr
);
519 set_mem_align (x
, alignment_in_bits
);
520 MEM_NOTRAP_P (x
) = 1;
523 = gen_rtx_EXPR_LIST (VOIDmode
, x
, stack_slot_list
);
525 if (frame_offset_overflow (frame_offset
, current_function_decl
))
531 /* Wrap up assign_stack_local_1 with last parameter as false. */
534 assign_stack_local (machine_mode mode
, HOST_WIDE_INT size
, int align
)
536 return assign_stack_local_1 (mode
, size
, align
, ASLK_RECORD_PAD
);
539 /* In order to evaluate some expressions, such as function calls returning
540 structures in memory, we need to temporarily allocate stack locations.
541 We record each allocated temporary in the following structure.
543 Associated with each temporary slot is a nesting level. When we pop up
544 one level, all temporaries associated with the previous level are freed.
545 Normally, all temporaries are freed after the execution of the statement
546 in which they were created. However, if we are inside a ({...}) grouping,
547 the result may be in a temporary and hence must be preserved. If the
548 result could be in a temporary, we preserve it if we can determine which
549 one it is in. If we cannot determine which temporary may contain the
550 result, all temporaries are preserved. A temporary is preserved by
551 pretending it was allocated at the previous nesting level. */
553 struct GTY(()) temp_slot
{
554 /* Points to next temporary slot. */
555 struct temp_slot
*next
;
556 /* Points to previous temporary slot. */
557 struct temp_slot
*prev
;
558 /* The rtx to used to reference the slot. */
560 /* The size, in units, of the slot. */
562 /* The type of the object in the slot, or zero if it doesn't correspond
563 to a type. We use this to determine whether a slot can be reused.
564 It can be reused if objects of the type of the new slot will always
565 conflict with objects of the type of the old slot. */
567 /* The alignment (in bits) of the slot. */
569 /* Nonzero if this temporary is currently in use. */
571 /* Nesting level at which this slot is being used. */
573 /* The offset of the slot from the frame_pointer, including extra space
574 for alignment. This info is for combine_temp_slots. */
575 HOST_WIDE_INT base_offset
;
576 /* The size of the slot, including extra space for alignment. This
577 info is for combine_temp_slots. */
578 HOST_WIDE_INT full_size
;
581 /* Entry for the below hash table. */
582 struct GTY((for_user
)) temp_slot_address_entry
{
585 struct temp_slot
*temp_slot
;
588 struct temp_address_hasher
: ggc_hasher
<temp_slot_address_entry
*>
590 static hashval_t
hash (temp_slot_address_entry
*);
591 static bool equal (temp_slot_address_entry
*, temp_slot_address_entry
*);
594 /* A table of addresses that represent a stack slot. The table is a mapping
595 from address RTXen to a temp slot. */
596 static GTY(()) hash_table
<temp_address_hasher
> *temp_slot_address_table
;
597 static size_t n_temp_slots_in_use
;
599 /* Removes temporary slot TEMP from LIST. */
602 cut_slot_from_list (struct temp_slot
*temp
, struct temp_slot
**list
)
605 temp
->next
->prev
= temp
->prev
;
607 temp
->prev
->next
= temp
->next
;
611 temp
->prev
= temp
->next
= NULL
;
614 /* Inserts temporary slot TEMP to LIST. */
617 insert_slot_to_list (struct temp_slot
*temp
, struct temp_slot
**list
)
621 (*list
)->prev
= temp
;
626 /* Returns the list of used temp slots at LEVEL. */
628 static struct temp_slot
**
629 temp_slots_at_level (int level
)
631 if (level
>= (int) vec_safe_length (used_temp_slots
))
632 vec_safe_grow_cleared (used_temp_slots
, level
+ 1);
634 return &(*used_temp_slots
)[level
];
637 /* Returns the maximal temporary slot level. */
640 max_slot_level (void)
642 if (!used_temp_slots
)
645 return used_temp_slots
->length () - 1;
648 /* Moves temporary slot TEMP to LEVEL. */
651 move_slot_to_level (struct temp_slot
*temp
, int level
)
653 cut_slot_from_list (temp
, temp_slots_at_level (temp
->level
));
654 insert_slot_to_list (temp
, temp_slots_at_level (level
));
658 /* Make temporary slot TEMP available. */
661 make_slot_available (struct temp_slot
*temp
)
663 cut_slot_from_list (temp
, temp_slots_at_level (temp
->level
));
664 insert_slot_to_list (temp
, &avail_temp_slots
);
667 n_temp_slots_in_use
--;
670 /* Compute the hash value for an address -> temp slot mapping.
671 The value is cached on the mapping entry. */
673 temp_slot_address_compute_hash (struct temp_slot_address_entry
*t
)
675 int do_not_record
= 0;
676 return hash_rtx (t
->address
, GET_MODE (t
->address
),
677 &do_not_record
, NULL
, false);
680 /* Return the hash value for an address -> temp slot mapping. */
682 temp_address_hasher::hash (temp_slot_address_entry
*t
)
687 /* Compare two address -> temp slot mapping entries. */
689 temp_address_hasher::equal (temp_slot_address_entry
*t1
,
690 temp_slot_address_entry
*t2
)
692 return exp_equiv_p (t1
->address
, t2
->address
, 0, true);
695 /* Add ADDRESS as an alias of TEMP_SLOT to the addess -> temp slot mapping. */
697 insert_temp_slot_address (rtx address
, struct temp_slot
*temp_slot
)
699 struct temp_slot_address_entry
*t
= ggc_alloc
<temp_slot_address_entry
> ();
700 t
->address
= address
;
701 t
->temp_slot
= temp_slot
;
702 t
->hash
= temp_slot_address_compute_hash (t
);
703 *temp_slot_address_table
->find_slot_with_hash (t
, t
->hash
, INSERT
) = t
;
706 /* Remove an address -> temp slot mapping entry if the temp slot is
707 not in use anymore. Callback for remove_unused_temp_slot_addresses. */
709 remove_unused_temp_slot_addresses_1 (temp_slot_address_entry
**slot
, void *)
711 const struct temp_slot_address_entry
*t
= *slot
;
712 if (! t
->temp_slot
->in_use
)
713 temp_slot_address_table
->clear_slot (slot
);
717 /* Remove all mappings of addresses to unused temp slots. */
719 remove_unused_temp_slot_addresses (void)
721 /* Use quicker clearing if there aren't any active temp slots. */
722 if (n_temp_slots_in_use
)
723 temp_slot_address_table
->traverse
724 <void *, remove_unused_temp_slot_addresses_1
> (NULL
);
726 temp_slot_address_table
->empty ();
729 /* Find the temp slot corresponding to the object at address X. */
731 static struct temp_slot
*
732 find_temp_slot_from_address (rtx x
)
735 struct temp_slot_address_entry tmp
, *t
;
737 /* First try the easy way:
738 See if X exists in the address -> temp slot mapping. */
740 tmp
.temp_slot
= NULL
;
741 tmp
.hash
= temp_slot_address_compute_hash (&tmp
);
742 t
= temp_slot_address_table
->find_with_hash (&tmp
, tmp
.hash
);
746 /* If we have a sum involving a register, see if it points to a temp
748 if (GET_CODE (x
) == PLUS
&& REG_P (XEXP (x
, 0))
749 && (p
= find_temp_slot_from_address (XEXP (x
, 0))) != 0)
751 else if (GET_CODE (x
) == PLUS
&& REG_P (XEXP (x
, 1))
752 && (p
= find_temp_slot_from_address (XEXP (x
, 1))) != 0)
755 /* Last resort: Address is a virtual stack var address. */
756 if (GET_CODE (x
) == PLUS
757 && XEXP (x
, 0) == virtual_stack_vars_rtx
758 && CONST_INT_P (XEXP (x
, 1)))
761 for (i
= max_slot_level (); i
>= 0; i
--)
762 for (p
= *temp_slots_at_level (i
); p
; p
= p
->next
)
764 if (INTVAL (XEXP (x
, 1)) >= p
->base_offset
765 && INTVAL (XEXP (x
, 1)) < p
->base_offset
+ p
->full_size
)
773 /* Allocate a temporary stack slot and record it for possible later
776 MODE is the machine mode to be given to the returned rtx.
778 SIZE is the size in units of the space required. We do no rounding here
779 since assign_stack_local will do any required rounding.
781 TYPE is the type that will be used for the stack slot. */
784 assign_stack_temp_for_type (machine_mode mode
, HOST_WIDE_INT size
,
788 struct temp_slot
*p
, *best_p
= 0, *selected
= NULL
, **pp
;
791 /* If SIZE is -1 it means that somebody tried to allocate a temporary
792 of a variable size. */
793 gcc_assert (size
!= -1);
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
&& p
->size
>= size
809 && GET_MODE (p
->slot
) == mode
810 && objects_must_conflict_p (p
->type
, type
)
811 && (best_p
== 0 || best_p
->size
> p
->size
812 || (best_p
->size
== p
->size
&& best_p
->align
> p
->align
)))
814 if (p
->align
== align
&& p
->size
== size
)
817 cut_slot_from_list (selected
, &avail_temp_slots
);
826 /* Make our best, if any, the one to use. */
830 cut_slot_from_list (selected
, &avail_temp_slots
);
832 /* If there are enough aligned bytes left over, make them into a new
833 temp_slot so that the extra bytes don't get wasted. Do this only
834 for BLKmode slots, so that we can be sure of the alignment. */
835 if (GET_MODE (best_p
->slot
) == BLKmode
)
837 int alignment
= best_p
->align
/ BITS_PER_UNIT
;
838 HOST_WIDE_INT rounded_size
= CEIL_ROUND (size
, alignment
);
840 if (best_p
->size
- rounded_size
>= alignment
)
842 p
= ggc_alloc
<temp_slot
> ();
844 p
->size
= best_p
->size
- rounded_size
;
845 p
->base_offset
= best_p
->base_offset
+ rounded_size
;
846 p
->full_size
= best_p
->full_size
- rounded_size
;
847 p
->slot
= adjust_address_nv (best_p
->slot
, BLKmode
, rounded_size
);
848 p
->align
= best_p
->align
;
849 p
->type
= best_p
->type
;
850 insert_slot_to_list (p
, &avail_temp_slots
);
852 stack_slot_list
= gen_rtx_EXPR_LIST (VOIDmode
, p
->slot
,
855 best_p
->size
= rounded_size
;
856 best_p
->full_size
= rounded_size
;
861 /* If we still didn't find one, make a new temporary. */
864 HOST_WIDE_INT frame_offset_old
= frame_offset
;
866 p
= ggc_alloc
<temp_slot
> ();
868 /* We are passing an explicit alignment request to assign_stack_local.
869 One side effect of that is assign_stack_local will not round SIZE
870 to ensure the frame offset remains suitably aligned.
872 So for requests which depended on the rounding of SIZE, we go ahead
873 and round it now. We also make sure ALIGNMENT is at least
874 BIGGEST_ALIGNMENT. */
875 gcc_assert (mode
!= BLKmode
|| align
== BIGGEST_ALIGNMENT
);
876 p
->slot
= assign_stack_local_1 (mode
,
886 /* The following slot size computation is necessary because we don't
887 know the actual size of the temporary slot until assign_stack_local
888 has performed all the frame alignment and size rounding for the
889 requested temporary. Note that extra space added for alignment
890 can be either above or below this stack slot depending on which
891 way the frame grows. We include the extra space if and only if it
892 is above this slot. */
893 if (FRAME_GROWS_DOWNWARD
)
894 p
->size
= frame_offset_old
- frame_offset
;
898 /* Now define the fields used by combine_temp_slots. */
899 if (FRAME_GROWS_DOWNWARD
)
901 p
->base_offset
= frame_offset
;
902 p
->full_size
= frame_offset_old
- frame_offset
;
906 p
->base_offset
= frame_offset_old
;
907 p
->full_size
= frame_offset
- frame_offset_old
;
916 p
->level
= temp_slot_level
;
917 n_temp_slots_in_use
++;
919 pp
= temp_slots_at_level (p
->level
);
920 insert_slot_to_list (p
, pp
);
921 insert_temp_slot_address (XEXP (p
->slot
, 0), p
);
923 /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
924 slot
= gen_rtx_MEM (mode
, XEXP (p
->slot
, 0));
925 stack_slot_list
= gen_rtx_EXPR_LIST (VOIDmode
, slot
, stack_slot_list
);
927 /* If we know the alias set for the memory that will be used, use
928 it. If there's no TYPE, then we don't know anything about the
929 alias set for the memory. */
930 set_mem_alias_set (slot
, type
? get_alias_set (type
) : 0);
931 set_mem_align (slot
, align
);
933 /* If a type is specified, set the relevant flags. */
935 MEM_VOLATILE_P (slot
) = TYPE_VOLATILE (type
);
936 MEM_NOTRAP_P (slot
) = 1;
941 /* Allocate a temporary stack slot and record it for possible later
942 reuse. First two arguments are same as in preceding function. */
945 assign_stack_temp (machine_mode mode
, HOST_WIDE_INT size
)
947 return assign_stack_temp_for_type (mode
, size
, NULL_TREE
);
950 /* Assign a temporary.
951 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
952 and so that should be used in error messages. In either case, we
953 allocate of the given type.
954 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
955 it is 0 if a register is OK.
956 DONT_PROMOTE is 1 if we should not promote values in register
960 assign_temp (tree type_or_decl
, int memory_required
,
961 int dont_promote ATTRIBUTE_UNUSED
)
969 if (DECL_P (type_or_decl
))
970 decl
= type_or_decl
, type
= TREE_TYPE (decl
);
972 decl
= NULL
, type
= type_or_decl
;
974 mode
= TYPE_MODE (type
);
976 unsignedp
= TYPE_UNSIGNED (type
);
979 if (mode
== BLKmode
|| memory_required
)
981 HOST_WIDE_INT size
= int_size_in_bytes (type
);
984 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
985 problems with allocating the stack space. */
989 /* Unfortunately, we don't yet know how to allocate variable-sized
990 temporaries. However, sometimes we can find a fixed upper limit on
991 the size, so try that instead. */
993 size
= max_int_size_in_bytes (type
);
995 /* The size of the temporary may be too large to fit into an integer. */
996 /* ??? Not sure this should happen except for user silliness, so limit
997 this to things that aren't compiler-generated temporaries. The
998 rest of the time we'll die in assign_stack_temp_for_type. */
999 if (decl
&& size
== -1
1000 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
)
1002 error ("size of variable %q+D is too large", decl
);
1006 tmp
= assign_stack_temp_for_type (mode
, size
, type
);
1012 mode
= promote_mode (type
, mode
, &unsignedp
);
1015 return gen_reg_rtx (mode
);
1018 /* Combine temporary stack slots which are adjacent on the stack.
1020 This allows for better use of already allocated stack space. This is only
1021 done for BLKmode slots because we can be sure that we won't have alignment
1022 problems in this case. */
1025 combine_temp_slots (void)
1027 struct temp_slot
*p
, *q
, *next
, *next_q
;
1030 /* We can't combine slots, because the information about which slot
1031 is in which alias set will be lost. */
1032 if (flag_strict_aliasing
)
1035 /* If there are a lot of temp slots, don't do anything unless
1036 high levels of optimization. */
1037 if (! flag_expensive_optimizations
)
1038 for (p
= avail_temp_slots
, num_slots
= 0; p
; p
= p
->next
, num_slots
++)
1039 if (num_slots
> 100 || (num_slots
> 10 && optimize
== 0))
1042 for (p
= avail_temp_slots
; p
; p
= next
)
1048 if (GET_MODE (p
->slot
) != BLKmode
)
1051 for (q
= p
->next
; q
; q
= next_q
)
1057 if (GET_MODE (q
->slot
) != BLKmode
)
1060 if (p
->base_offset
+ p
->full_size
== q
->base_offset
)
1062 /* Q comes after P; combine Q into P. */
1064 p
->full_size
+= q
->full_size
;
1067 else if (q
->base_offset
+ q
->full_size
== p
->base_offset
)
1069 /* P comes after Q; combine P into Q. */
1071 q
->full_size
+= p
->full_size
;
1076 cut_slot_from_list (q
, &avail_temp_slots
);
1079 /* Either delete P or advance past it. */
1081 cut_slot_from_list (p
, &avail_temp_slots
);
1085 /* Indicate that NEW_RTX is an alternate way of referring to the temp
1086 slot that previously was known by OLD_RTX. */
1089 update_temp_slot_address (rtx old_rtx
, rtx new_rtx
)
1091 struct temp_slot
*p
;
1093 if (rtx_equal_p (old_rtx
, new_rtx
))
1096 p
= find_temp_slot_from_address (old_rtx
);
1098 /* If we didn't find one, see if both OLD_RTX is a PLUS. If so, and
1099 NEW_RTX is a register, see if one operand of the PLUS is a
1100 temporary location. If so, NEW_RTX points into it. Otherwise,
1101 if both OLD_RTX and NEW_RTX are a PLUS and if there is a register
1102 in common between them. If so, try a recursive call on those
1106 if (GET_CODE (old_rtx
) != PLUS
)
1109 if (REG_P (new_rtx
))
1111 update_temp_slot_address (XEXP (old_rtx
, 0), new_rtx
);
1112 update_temp_slot_address (XEXP (old_rtx
, 1), new_rtx
);
1115 else if (GET_CODE (new_rtx
) != PLUS
)
1118 if (rtx_equal_p (XEXP (old_rtx
, 0), XEXP (new_rtx
, 0)))
1119 update_temp_slot_address (XEXP (old_rtx
, 1), XEXP (new_rtx
, 1));
1120 else if (rtx_equal_p (XEXP (old_rtx
, 1), XEXP (new_rtx
, 0)))
1121 update_temp_slot_address (XEXP (old_rtx
, 0), XEXP (new_rtx
, 1));
1122 else if (rtx_equal_p (XEXP (old_rtx
, 0), XEXP (new_rtx
, 1)))
1123 update_temp_slot_address (XEXP (old_rtx
, 1), XEXP (new_rtx
, 0));
1124 else if (rtx_equal_p (XEXP (old_rtx
, 1), XEXP (new_rtx
, 1)))
1125 update_temp_slot_address (XEXP (old_rtx
, 0), XEXP (new_rtx
, 0));
1130 /* Otherwise add an alias for the temp's address. */
1131 insert_temp_slot_address (new_rtx
, p
);
1134 /* If X could be a reference to a temporary slot, mark that slot as
1135 belonging to the to one level higher than the current level. If X
1136 matched one of our slots, just mark that one. Otherwise, we can't
1137 easily predict which it is, so upgrade all of them.
1139 This is called when an ({...}) construct occurs and a statement
1140 returns a value in memory. */
1143 preserve_temp_slots (rtx x
)
1145 struct temp_slot
*p
= 0, *next
;
1150 /* If X is a register that is being used as a pointer, see if we have
1151 a temporary slot we know it points to. */
1152 if (REG_P (x
) && REG_POINTER (x
))
1153 p
= find_temp_slot_from_address (x
);
1155 /* If X is not in memory or is at a constant address, it cannot be in
1156 a temporary slot. */
1157 if (p
== 0 && (!MEM_P (x
) || CONSTANT_P (XEXP (x
, 0))))
1160 /* First see if we can find a match. */
1162 p
= find_temp_slot_from_address (XEXP (x
, 0));
1166 if (p
->level
== temp_slot_level
)
1167 move_slot_to_level (p
, temp_slot_level
- 1);
1171 /* Otherwise, preserve all non-kept slots at this level. */
1172 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1175 move_slot_to_level (p
, temp_slot_level
- 1);
1179 /* Free all temporaries used so far. This is normally called at the
1180 end of generating code for a statement. */
1183 free_temp_slots (void)
1185 struct temp_slot
*p
, *next
;
1186 bool some_available
= false;
1188 for (p
= *temp_slots_at_level (temp_slot_level
); p
; p
= next
)
1191 make_slot_available (p
);
1192 some_available
= true;
1197 remove_unused_temp_slot_addresses ();
1198 combine_temp_slots ();
1202 /* Push deeper into the nesting level for stack temporaries. */
1205 push_temp_slots (void)
1210 /* Pop a temporary nesting level. All slots in use in the current level
1214 pop_temp_slots (void)
1220 /* Initialize temporary slots. */
1223 init_temp_slots (void)
1225 /* We have not allocated any temporaries yet. */
1226 avail_temp_slots
= 0;
1227 vec_alloc (used_temp_slots
, 0);
1228 temp_slot_level
= 0;
1229 n_temp_slots_in_use
= 0;
1231 /* Set up the table to map addresses to temp slots. */
1232 if (! temp_slot_address_table
)
1233 temp_slot_address_table
= hash_table
<temp_address_hasher
>::create_ggc (32);
1235 temp_slot_address_table
->empty ();
1238 /* Functions and data structures to keep track of the values hard regs
1239 had at the start of the function. */
1241 /* Private type used by get_hard_reg_initial_reg, get_hard_reg_initial_val,
1242 and has_hard_reg_initial_val.. */
1243 typedef struct GTY(()) initial_value_pair
{
1246 } initial_value_pair
;
1247 /* ??? This could be a VEC but there is currently no way to define an
1248 opaque VEC type. This could be worked around by defining struct
1249 initial_value_pair in function.h. */
1250 typedef struct GTY(()) initial_value_struct
{
1253 initial_value_pair
* GTY ((length ("%h.num_entries"))) entries
;
1254 } initial_value_struct
;
1256 /* If a pseudo represents an initial hard reg (or expression), return
1257 it, else return NULL_RTX. */
1260 get_hard_reg_initial_reg (rtx reg
)
1262 struct initial_value_struct
*ivs
= crtl
->hard_reg_initial_vals
;
1268 for (i
= 0; i
< ivs
->num_entries
; i
++)
1269 if (rtx_equal_p (ivs
->entries
[i
].pseudo
, reg
))
1270 return ivs
->entries
[i
].hard_reg
;
1275 /* Make sure that there's a pseudo register of mode MODE that stores the
1276 initial value of hard register REGNO. Return an rtx for such a pseudo. */
1279 get_hard_reg_initial_val (machine_mode mode
, unsigned int regno
)
1281 struct initial_value_struct
*ivs
;
1284 rv
= has_hard_reg_initial_val (mode
, regno
);
1288 ivs
= crtl
->hard_reg_initial_vals
;
1291 ivs
= ggc_alloc
<initial_value_struct
> ();
1292 ivs
->num_entries
= 0;
1293 ivs
->max_entries
= 5;
1294 ivs
->entries
= ggc_vec_alloc
<initial_value_pair
> (5);
1295 crtl
->hard_reg_initial_vals
= ivs
;
1298 if (ivs
->num_entries
>= ivs
->max_entries
)
1300 ivs
->max_entries
+= 5;
1301 ivs
->entries
= GGC_RESIZEVEC (initial_value_pair
, ivs
->entries
,
1305 ivs
->entries
[ivs
->num_entries
].hard_reg
= gen_rtx_REG (mode
, regno
);
1306 ivs
->entries
[ivs
->num_entries
].pseudo
= gen_reg_rtx (mode
);
1308 return ivs
->entries
[ivs
->num_entries
++].pseudo
;
1311 /* See if get_hard_reg_initial_val has been used to create a pseudo
1312 for the initial value of hard register REGNO in mode MODE. Return
1313 the associated pseudo if so, otherwise return NULL. */
1316 has_hard_reg_initial_val (machine_mode mode
, unsigned int regno
)
1318 struct initial_value_struct
*ivs
;
1321 ivs
= crtl
->hard_reg_initial_vals
;
1323 for (i
= 0; i
< ivs
->num_entries
; i
++)
1324 if (GET_MODE (ivs
->entries
[i
].hard_reg
) == mode
1325 && REGNO (ivs
->entries
[i
].hard_reg
) == regno
)
1326 return ivs
->entries
[i
].pseudo
;
1332 emit_initial_value_sets (void)
1334 struct initial_value_struct
*ivs
= crtl
->hard_reg_initial_vals
;
1342 for (i
= 0; i
< ivs
->num_entries
; i
++)
1343 emit_move_insn (ivs
->entries
[i
].pseudo
, ivs
->entries
[i
].hard_reg
);
1347 emit_insn_at_entry (seq
);
1351 /* Return the hardreg-pseudoreg initial values pair entry I and
1352 TRUE if I is a valid entry, or FALSE if I is not a valid entry. */
1354 initial_value_entry (int i
, rtx
*hreg
, rtx
*preg
)
1356 struct initial_value_struct
*ivs
= crtl
->hard_reg_initial_vals
;
1357 if (!ivs
|| i
>= ivs
->num_entries
)
1360 *hreg
= ivs
->entries
[i
].hard_reg
;
1361 *preg
= ivs
->entries
[i
].pseudo
;
1365 /* These routines are responsible for converting virtual register references
1366 to the actual hard register references once RTL generation is complete.
1368 The following four variables are used for communication between the
1369 routines. They contain the offsets of the virtual registers from their
1370 respective hard registers. */
1372 static int in_arg_offset
;
1373 static int var_offset
;
1374 static int dynamic_offset
;
1375 static int out_arg_offset
;
1376 static int cfa_offset
;
1378 /* In most machines, the stack pointer register is equivalent to the bottom
1381 #ifndef STACK_POINTER_OFFSET
1382 #define STACK_POINTER_OFFSET 0
1385 #if defined (REG_PARM_STACK_SPACE) && !defined (INCOMING_REG_PARM_STACK_SPACE)
1386 #define INCOMING_REG_PARM_STACK_SPACE REG_PARM_STACK_SPACE
1389 /* If not defined, pick an appropriate default for the offset of dynamically
1390 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
1391 INCOMING_REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
1393 #ifndef STACK_DYNAMIC_OFFSET
1395 /* The bottom of the stack points to the actual arguments. If
1396 REG_PARM_STACK_SPACE is defined, this includes the space for the register
1397 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
1398 stack space for register parameters is not pushed by the caller, but
1399 rather part of the fixed stack areas and hence not included in
1400 `crtl->outgoing_args_size'. Nevertheless, we must allow
1401 for it when allocating stack dynamic objects. */
1403 #ifdef INCOMING_REG_PARM_STACK_SPACE
1404 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1405 ((ACCUMULATE_OUTGOING_ARGS \
1406 ? (crtl->outgoing_args_size \
1407 + (OUTGOING_REG_PARM_STACK_SPACE ((!(FNDECL) ? NULL_TREE : TREE_TYPE (FNDECL))) ? 0 \
1408 : INCOMING_REG_PARM_STACK_SPACE (FNDECL))) \
1409 : 0) + (STACK_POINTER_OFFSET))
1411 #define STACK_DYNAMIC_OFFSET(FNDECL) \
1412 ((ACCUMULATE_OUTGOING_ARGS ? crtl->outgoing_args_size : 0) \
1413 + (STACK_POINTER_OFFSET))
1418 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
1419 is a virtual register, return the equivalent hard register and set the
1420 offset indirectly through the pointer. Otherwise, return 0. */
1423 instantiate_new_reg (rtx x
, HOST_WIDE_INT
*poffset
)
1426 HOST_WIDE_INT offset
;
1428 if (x
== virtual_incoming_args_rtx
)
1430 if (stack_realign_drap
)
1432 /* Replace virtual_incoming_args_rtx with internal arg
1433 pointer if DRAP is used to realign stack. */
1434 new_rtx
= crtl
->args
.internal_arg_pointer
;
1438 new_rtx
= arg_pointer_rtx
, offset
= in_arg_offset
;
1440 else if (x
== virtual_stack_vars_rtx
)
1441 new_rtx
= frame_pointer_rtx
, offset
= var_offset
;
1442 else if (x
== virtual_stack_dynamic_rtx
)
1443 new_rtx
= stack_pointer_rtx
, offset
= dynamic_offset
;
1444 else if (x
== virtual_outgoing_args_rtx
)
1445 new_rtx
= stack_pointer_rtx
, offset
= out_arg_offset
;
1446 else if (x
== virtual_cfa_rtx
)
1448 #ifdef FRAME_POINTER_CFA_OFFSET
1449 new_rtx
= frame_pointer_rtx
;
1451 new_rtx
= arg_pointer_rtx
;
1453 offset
= cfa_offset
;
1455 else if (x
== virtual_preferred_stack_boundary_rtx
)
1457 new_rtx
= GEN_INT (crtl
->preferred_stack_boundary
/ BITS_PER_UNIT
);
1467 /* A subroutine of instantiate_virtual_regs. Instantiate any virtual
1468 registers present inside of *LOC. The expression is simplified,
1469 as much as possible, but is not to be considered "valid" in any sense
1470 implied by the target. Return true if any change is made. */
1473 instantiate_virtual_regs_in_rtx (rtx
*loc
)
1477 bool changed
= false;
1478 subrtx_ptr_iterator::array_type array
;
1479 FOR_EACH_SUBRTX_PTR (iter
, array
, loc
, NONCONST
)
1485 HOST_WIDE_INT offset
;
1486 switch (GET_CODE (x
))
1489 new_rtx
= instantiate_new_reg (x
, &offset
);
1492 *loc
= plus_constant (GET_MODE (x
), new_rtx
, offset
);
1495 iter
.skip_subrtxes ();
1499 new_rtx
= instantiate_new_reg (XEXP (x
, 0), &offset
);
1502 XEXP (x
, 0) = new_rtx
;
1503 *loc
= plus_constant (GET_MODE (x
), x
, offset
, true);
1505 iter
.skip_subrtxes ();
1509 /* FIXME -- from old code */
1510 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
1511 we can commute the PLUS and SUBREG because pointers into the
1512 frame are well-behaved. */
1523 /* A subroutine of instantiate_virtual_regs_in_insn. Return true if X
1524 matches the predicate for insn CODE operand OPERAND. */
1527 safe_insn_predicate (int code
, int operand
, rtx x
)
1529 return code
< 0 || insn_operand_matches ((enum insn_code
) code
, operand
, x
);
1532 /* A subroutine of instantiate_virtual_regs. Instantiate any virtual
1533 registers present inside of insn. The result will be a valid insn. */
1536 instantiate_virtual_regs_in_insn (rtx_insn
*insn
)
1538 HOST_WIDE_INT offset
;
1540 bool any_change
= false;
1541 rtx set
, new_rtx
, x
;
1544 /* There are some special cases to be handled first. */
1545 set
= single_set (insn
);
1548 /* We're allowed to assign to a virtual register. This is interpreted
1549 to mean that the underlying register gets assigned the inverse
1550 transformation. This is used, for example, in the handling of
1552 new_rtx
= instantiate_new_reg (SET_DEST (set
), &offset
);
1557 instantiate_virtual_regs_in_rtx (&SET_SRC (set
));
1558 x
= simplify_gen_binary (PLUS
, GET_MODE (new_rtx
), SET_SRC (set
),
1559 gen_int_mode (-offset
, GET_MODE (new_rtx
)));
1560 x
= force_operand (x
, new_rtx
);
1562 emit_move_insn (new_rtx
, x
);
1567 emit_insn_before (seq
, insn
);
1572 /* Handle a straight copy from a virtual register by generating a
1573 new add insn. The difference between this and falling through
1574 to the generic case is avoiding a new pseudo and eliminating a
1575 move insn in the initial rtl stream. */
1576 new_rtx
= instantiate_new_reg (SET_SRC (set
), &offset
);
1577 if (new_rtx
&& offset
!= 0
1578 && REG_P (SET_DEST (set
))
1579 && REGNO (SET_DEST (set
)) > LAST_VIRTUAL_REGISTER
)
1583 x
= expand_simple_binop (GET_MODE (SET_DEST (set
)), PLUS
, new_rtx
,
1584 gen_int_mode (offset
,
1585 GET_MODE (SET_DEST (set
))),
1586 SET_DEST (set
), 1, OPTAB_LIB_WIDEN
);
1587 if (x
!= SET_DEST (set
))
1588 emit_move_insn (SET_DEST (set
), x
);
1593 emit_insn_before (seq
, insn
);
1598 extract_insn (insn
);
1599 insn_code
= INSN_CODE (insn
);
1601 /* Handle a plus involving a virtual register by determining if the
1602 operands remain valid if they're modified in place. */
1603 if (GET_CODE (SET_SRC (set
)) == PLUS
1604 && recog_data
.n_operands
>= 3
1605 && recog_data
.operand_loc
[1] == &XEXP (SET_SRC (set
), 0)
1606 && recog_data
.operand_loc
[2] == &XEXP (SET_SRC (set
), 1)
1607 && CONST_INT_P (recog_data
.operand
[2])
1608 && (new_rtx
= instantiate_new_reg (recog_data
.operand
[1], &offset
)))
1610 offset
+= INTVAL (recog_data
.operand
[2]);
1612 /* If the sum is zero, then replace with a plain move. */
1614 && REG_P (SET_DEST (set
))
1615 && REGNO (SET_DEST (set
)) > LAST_VIRTUAL_REGISTER
)
1618 emit_move_insn (SET_DEST (set
), new_rtx
);
1622 emit_insn_before (seq
, insn
);
1627 x
= gen_int_mode (offset
, recog_data
.operand_mode
[2]);
1629 /* Using validate_change and apply_change_group here leaves
1630 recog_data in an invalid state. Since we know exactly what
1631 we want to check, do those two by hand. */
1632 if (safe_insn_predicate (insn_code
, 1, new_rtx
)
1633 && safe_insn_predicate (insn_code
, 2, x
))
1635 *recog_data
.operand_loc
[1] = recog_data
.operand
[1] = new_rtx
;
1636 *recog_data
.operand_loc
[2] = recog_data
.operand
[2] = x
;
1639 /* Fall through into the regular operand fixup loop in
1640 order to take care of operands other than 1 and 2. */
1646 extract_insn (insn
);
1647 insn_code
= INSN_CODE (insn
);
1650 /* In the general case, we expect virtual registers to appear only in
1651 operands, and then only as either bare registers or inside memories. */
1652 for (i
= 0; i
< recog_data
.n_operands
; ++i
)
1654 x
= recog_data
.operand
[i
];
1655 switch (GET_CODE (x
))
1659 rtx addr
= XEXP (x
, 0);
1661 if (!instantiate_virtual_regs_in_rtx (&addr
))
1665 x
= replace_equiv_address (x
, addr
, true);
1666 /* It may happen that the address with the virtual reg
1667 was valid (e.g. based on the virtual stack reg, which might
1668 be acceptable to the predicates with all offsets), whereas
1669 the address now isn't anymore, for instance when the address
1670 is still offsetted, but the base reg isn't virtual-stack-reg
1671 anymore. Below we would do a force_reg on the whole operand,
1672 but this insn might actually only accept memory. Hence,
1673 before doing that last resort, try to reload the address into
1674 a register, so this operand stays a MEM. */
1675 if (!safe_insn_predicate (insn_code
, i
, x
))
1677 addr
= force_reg (GET_MODE (addr
), addr
);
1678 x
= replace_equiv_address (x
, addr
, true);
1683 emit_insn_before (seq
, insn
);
1688 new_rtx
= instantiate_new_reg (x
, &offset
);
1689 if (new_rtx
== NULL
)
1697 /* Careful, special mode predicates may have stuff in
1698 insn_data[insn_code].operand[i].mode that isn't useful
1699 to us for computing a new value. */
1700 /* ??? Recognize address_operand and/or "p" constraints
1701 to see if (plus new offset) is a valid before we put
1702 this through expand_simple_binop. */
1703 x
= expand_simple_binop (GET_MODE (x
), PLUS
, new_rtx
,
1704 gen_int_mode (offset
, GET_MODE (x
)),
1705 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
1708 emit_insn_before (seq
, insn
);
1713 new_rtx
= instantiate_new_reg (SUBREG_REG (x
), &offset
);
1714 if (new_rtx
== NULL
)
1719 new_rtx
= expand_simple_binop
1720 (GET_MODE (new_rtx
), PLUS
, new_rtx
,
1721 gen_int_mode (offset
, GET_MODE (new_rtx
)),
1722 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
1725 emit_insn_before (seq
, insn
);
1727 x
= simplify_gen_subreg (recog_data
.operand_mode
[i
], new_rtx
,
1728 GET_MODE (new_rtx
), SUBREG_BYTE (x
));
1736 /* At this point, X contains the new value for the operand.
1737 Validate the new value vs the insn predicate. Note that
1738 asm insns will have insn_code -1 here. */
1739 if (!safe_insn_predicate (insn_code
, i
, x
))
1744 gcc_assert (REGNO (x
) <= LAST_VIRTUAL_REGISTER
);
1745 x
= copy_to_reg (x
);
1748 x
= force_reg (insn_data
[insn_code
].operand
[i
].mode
, x
);
1752 emit_insn_before (seq
, insn
);
1755 *recog_data
.operand_loc
[i
] = recog_data
.operand
[i
] = x
;
1761 /* Propagate operand changes into the duplicates. */
1762 for (i
= 0; i
< recog_data
.n_dups
; ++i
)
1763 *recog_data
.dup_loc
[i
]
1764 = copy_rtx (recog_data
.operand
[(unsigned)recog_data
.dup_num
[i
]]);
1766 /* Force re-recognition of the instruction for validation. */
1767 INSN_CODE (insn
) = -1;
1770 if (asm_noperands (PATTERN (insn
)) >= 0)
1772 if (!check_asm_operands (PATTERN (insn
)))
1774 error_for_asm (insn
, "impossible constraint in %<asm%>");
1775 /* For asm goto, instead of fixing up all the edges
1776 just clear the template and clear input operands
1777 (asm goto doesn't have any output operands). */
1780 rtx asm_op
= extract_asm_operands (PATTERN (insn
));
1781 ASM_OPERANDS_TEMPLATE (asm_op
) = ggc_strdup ("");
1782 ASM_OPERANDS_INPUT_VEC (asm_op
) = rtvec_alloc (0);
1783 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (asm_op
) = rtvec_alloc (0);
1791 if (recog_memoized (insn
) < 0)
1792 fatal_insn_not_found (insn
);
1796 /* Subroutine of instantiate_decls. Given RTL representing a decl,
1797 do any instantiation required. */
1800 instantiate_decl_rtl (rtx x
)
1807 /* If this is a CONCAT, recurse for the pieces. */
1808 if (GET_CODE (x
) == CONCAT
)
1810 instantiate_decl_rtl (XEXP (x
, 0));
1811 instantiate_decl_rtl (XEXP (x
, 1));
1815 /* If this is not a MEM, no need to do anything. Similarly if the
1816 address is a constant or a register that is not a virtual register. */
1821 if (CONSTANT_P (addr
)
1823 && (REGNO (addr
) < FIRST_VIRTUAL_REGISTER
1824 || REGNO (addr
) > LAST_VIRTUAL_REGISTER
)))
1827 instantiate_virtual_regs_in_rtx (&XEXP (x
, 0));
1830 /* Helper for instantiate_decls called via walk_tree: Process all decls
1831 in the given DECL_VALUE_EXPR. */
1834 instantiate_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1842 if (DECL_RTL_SET_P (t
))
1843 instantiate_decl_rtl (DECL_RTL (t
));
1844 if (TREE_CODE (t
) == PARM_DECL
&& DECL_NAMELESS (t
)
1845 && DECL_INCOMING_RTL (t
))
1846 instantiate_decl_rtl (DECL_INCOMING_RTL (t
));
1847 if ((TREE_CODE (t
) == VAR_DECL
1848 || TREE_CODE (t
) == RESULT_DECL
)
1849 && DECL_HAS_VALUE_EXPR_P (t
))
1851 tree v
= DECL_VALUE_EXPR (t
);
1852 walk_tree (&v
, instantiate_expr
, NULL
, NULL
);
1859 /* Subroutine of instantiate_decls: Process all decls in the given
1860 BLOCK node and all its subblocks. */
1863 instantiate_decls_1 (tree let
)
1867 for (t
= BLOCK_VARS (let
); t
; t
= DECL_CHAIN (t
))
1869 if (DECL_RTL_SET_P (t
))
1870 instantiate_decl_rtl (DECL_RTL (t
));
1871 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (t
))
1873 tree v
= DECL_VALUE_EXPR (t
);
1874 walk_tree (&v
, instantiate_expr
, NULL
, NULL
);
1878 /* Process all subblocks. */
1879 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= BLOCK_CHAIN (t
))
1880 instantiate_decls_1 (t
);
1883 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
1884 all virtual registers in their DECL_RTL's. */
1887 instantiate_decls (tree fndecl
)
1892 /* Process all parameters of the function. */
1893 for (decl
= DECL_ARGUMENTS (fndecl
); decl
; decl
= DECL_CHAIN (decl
))
1895 instantiate_decl_rtl (DECL_RTL (decl
));
1896 instantiate_decl_rtl (DECL_INCOMING_RTL (decl
));
1897 if (DECL_HAS_VALUE_EXPR_P (decl
))
1899 tree v
= DECL_VALUE_EXPR (decl
);
1900 walk_tree (&v
, instantiate_expr
, NULL
, NULL
);
1904 if ((decl
= DECL_RESULT (fndecl
))
1905 && TREE_CODE (decl
) == RESULT_DECL
)
1907 if (DECL_RTL_SET_P (decl
))
1908 instantiate_decl_rtl (DECL_RTL (decl
));
1909 if (DECL_HAS_VALUE_EXPR_P (decl
))
1911 tree v
= DECL_VALUE_EXPR (decl
);
1912 walk_tree (&v
, instantiate_expr
, NULL
, NULL
);
1916 /* Process the saved static chain if it exists. */
1917 decl
= DECL_STRUCT_FUNCTION (fndecl
)->static_chain_decl
;
1918 if (decl
&& DECL_HAS_VALUE_EXPR_P (decl
))
1919 instantiate_decl_rtl (DECL_RTL (DECL_VALUE_EXPR (decl
)));
1921 /* Now process all variables defined in the function or its subblocks. */
1922 instantiate_decls_1 (DECL_INITIAL (fndecl
));
1924 FOR_EACH_LOCAL_DECL (cfun
, ix
, decl
)
1925 if (DECL_RTL_SET_P (decl
))
1926 instantiate_decl_rtl (DECL_RTL (decl
));
1927 vec_free (cfun
->local_decls
);
1930 /* Pass through the INSNS of function FNDECL and convert virtual register
1931 references to hard register references. */
1934 instantiate_virtual_regs (void)
1938 /* Compute the offsets to use for this function. */
1939 in_arg_offset
= FIRST_PARM_OFFSET (current_function_decl
);
1940 var_offset
= STARTING_FRAME_OFFSET
;
1941 dynamic_offset
= STACK_DYNAMIC_OFFSET (current_function_decl
);
1942 out_arg_offset
= STACK_POINTER_OFFSET
;
1943 #ifdef FRAME_POINTER_CFA_OFFSET
1944 cfa_offset
= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
1946 cfa_offset
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
1949 /* Initialize recognition, indicating that volatile is OK. */
1952 /* Scan through all the insns, instantiating every virtual register still
1954 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1957 /* These patterns in the instruction stream can never be recognized.
1958 Fortunately, they shouldn't contain virtual registers either. */
1959 if (GET_CODE (PATTERN (insn
)) == USE
1960 || GET_CODE (PATTERN (insn
)) == CLOBBER
1961 || GET_CODE (PATTERN (insn
)) == ASM_INPUT
)
1963 else if (DEBUG_INSN_P (insn
))
1964 instantiate_virtual_regs_in_rtx (&INSN_VAR_LOCATION (insn
));
1966 instantiate_virtual_regs_in_insn (insn
);
1968 if (insn
->deleted ())
1971 instantiate_virtual_regs_in_rtx (®_NOTES (insn
));
1973 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
1975 instantiate_virtual_regs_in_rtx (&CALL_INSN_FUNCTION_USAGE (insn
));
1978 /* Instantiate the virtual registers in the DECLs for debugging purposes. */
1979 instantiate_decls (current_function_decl
);
1981 targetm
.instantiate_decls ();
1983 /* Indicate that, from now on, assign_stack_local should use
1984 frame_pointer_rtx. */
1985 virtuals_instantiated
= 1;
1992 const pass_data pass_data_instantiate_virtual_regs
=
1994 RTL_PASS
, /* type */
1996 OPTGROUP_NONE
, /* optinfo_flags */
1997 TV_NONE
, /* tv_id */
1998 0, /* properties_required */
1999 0, /* properties_provided */
2000 0, /* properties_destroyed */
2001 0, /* todo_flags_start */
2002 0, /* todo_flags_finish */
2005 class pass_instantiate_virtual_regs
: public rtl_opt_pass
2008 pass_instantiate_virtual_regs (gcc::context
*ctxt
)
2009 : rtl_opt_pass (pass_data_instantiate_virtual_regs
, ctxt
)
2012 /* opt_pass methods: */
2013 virtual unsigned int execute (function
*)
2015 return instantiate_virtual_regs ();
2018 }; // class pass_instantiate_virtual_regs
2023 make_pass_instantiate_virtual_regs (gcc::context
*ctxt
)
2025 return new pass_instantiate_virtual_regs (ctxt
);
2029 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
2030 This means a type for which function calls must pass an address to the
2031 function or get an address back from the function.
2032 EXP may be a type node or an expression (whose type is tested). */
2035 aggregate_value_p (const_tree exp
, const_tree fntype
)
2037 const_tree type
= (TYPE_P (exp
)) ? exp
: TREE_TYPE (exp
);
2038 int i
, regno
, nregs
;
2042 switch (TREE_CODE (fntype
))
2046 tree fndecl
= get_callee_fndecl (fntype
);
2048 fntype
= TREE_TYPE (fndecl
);
2049 else if (CALL_EXPR_FN (fntype
))
2050 fntype
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (fntype
)));
2052 /* For internal functions, assume nothing needs to be
2053 returned in memory. */
2058 fntype
= TREE_TYPE (fntype
);
2063 case IDENTIFIER_NODE
:
2067 /* We don't expect other tree types here. */
2071 if (VOID_TYPE_P (type
))
2074 /* If a record should be passed the same as its first (and only) member
2075 don't pass it as an aggregate. */
2076 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2077 return aggregate_value_p (first_field (type
), fntype
);
2079 /* If the front end has decided that this needs to be passed by
2080 reference, do so. */
2081 if ((TREE_CODE (exp
) == PARM_DECL
|| TREE_CODE (exp
) == RESULT_DECL
)
2082 && DECL_BY_REFERENCE (exp
))
2085 /* Function types that are TREE_ADDRESSABLE force return in memory. */
2086 if (fntype
&& TREE_ADDRESSABLE (fntype
))
2089 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
2090 and thus can't be returned in registers. */
2091 if (TREE_ADDRESSABLE (type
))
2094 if (flag_pcc_struct_return
&& AGGREGATE_TYPE_P (type
))
2097 if (targetm
.calls
.return_in_memory (type
, fntype
))
2100 /* Make sure we have suitable call-clobbered regs to return
2101 the value in; if not, we must return it in memory. */
2102 reg
= hard_function_value (type
, 0, fntype
, 0);
2104 /* If we have something other than a REG (e.g. a PARALLEL), then assume
2109 regno
= REGNO (reg
);
2110 nregs
= hard_regno_nregs
[regno
][TYPE_MODE (type
)];
2111 for (i
= 0; i
< nregs
; i
++)
2112 if (! call_used_regs
[regno
+ i
])
2118 /* Return true if we should assign DECL a pseudo register; false if it
2119 should live on the local stack. */
2122 use_register_for_decl (const_tree decl
)
2124 if (!targetm
.calls
.allocate_stack_slots_for_args ())
2127 /* Honor volatile. */
2128 if (TREE_SIDE_EFFECTS (decl
))
2131 /* Honor addressability. */
2132 if (TREE_ADDRESSABLE (decl
))
2135 /* Decl is implicitly addressible by bound stores and loads
2136 if it is an aggregate holding bounds. */
2137 if (chkp_function_instrumented_p (current_function_decl
)
2139 && !BOUNDED_P (decl
)
2140 && chkp_type_has_pointer (TREE_TYPE (decl
)))
2143 /* Only register-like things go in registers. */
2144 if (DECL_MODE (decl
) == BLKmode
)
2147 /* If -ffloat-store specified, don't put explicit float variables
2149 /* ??? This should be checked after DECL_ARTIFICIAL, but tree-ssa
2150 propagates values across these stores, and it probably shouldn't. */
2151 if (flag_float_store
&& FLOAT_TYPE_P (TREE_TYPE (decl
)))
2154 /* If we're not interested in tracking debugging information for
2155 this decl, then we can certainly put it in a register. */
2156 if (DECL_IGNORED_P (decl
))
2162 if (!DECL_REGISTER (decl
))
2165 switch (TREE_CODE (TREE_TYPE (decl
)))
2169 case QUAL_UNION_TYPE
:
2170 /* When not optimizing, disregard register keyword for variables with
2171 types containing methods, otherwise the methods won't be callable
2172 from the debugger. */
2173 if (TYPE_METHODS (TREE_TYPE (decl
)))
2183 /* Return true if TYPE should be passed by invisible reference. */
2186 pass_by_reference (CUMULATIVE_ARGS
*ca
, machine_mode mode
,
2187 tree type
, bool named_arg
)
2191 /* If this type contains non-trivial constructors, then it is
2192 forbidden for the middle-end to create any new copies. */
2193 if (TREE_ADDRESSABLE (type
))
2196 /* GCC post 3.4 passes *all* variable sized types by reference. */
2197 if (!TYPE_SIZE (type
) || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
2200 /* If a record type should be passed the same as its first (and only)
2201 member, use the type and mode of that member. */
2202 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2204 type
= TREE_TYPE (first_field (type
));
2205 mode
= TYPE_MODE (type
);
2209 return targetm
.calls
.pass_by_reference (pack_cumulative_args (ca
), mode
,
2213 /* Return true if TYPE, which is passed by reference, should be callee
2214 copied instead of caller copied. */
2217 reference_callee_copied (CUMULATIVE_ARGS
*ca
, machine_mode mode
,
2218 tree type
, bool named_arg
)
2220 if (type
&& TREE_ADDRESSABLE (type
))
2222 return targetm
.calls
.callee_copies (pack_cumulative_args (ca
), mode
, type
,
2226 /* Structures to communicate between the subroutines of assign_parms.
2227 The first holds data persistent across all parameters, the second
2228 is cleared out for each parameter. */
2230 struct assign_parm_data_all
2232 /* When INIT_CUMULATIVE_ARGS gets revamped, allocating CUMULATIVE_ARGS
2233 should become a job of the target or otherwise encapsulated. */
2234 CUMULATIVE_ARGS args_so_far_v
;
2235 cumulative_args_t args_so_far
;
2236 struct args_size stack_args_size
;
2237 tree function_result_decl
;
2239 rtx_insn
*first_conversion_insn
;
2240 rtx_insn
*last_conversion_insn
;
2241 HOST_WIDE_INT pretend_args_size
;
2242 HOST_WIDE_INT extra_pretend_bytes
;
2243 int reg_parm_stack_space
;
2246 struct assign_parm_data_one
2252 machine_mode nominal_mode
;
2253 machine_mode passed_mode
;
2254 machine_mode promoted_mode
;
2255 struct locate_and_pad_arg_data locate
;
2257 BOOL_BITFIELD named_arg
: 1;
2258 BOOL_BITFIELD passed_pointer
: 1;
2259 BOOL_BITFIELD on_stack
: 1;
2260 BOOL_BITFIELD loaded_in_reg
: 1;
2263 struct bounds_parm_data
2265 assign_parm_data_one parm_data
;
2272 /* A subroutine of assign_parms. Initialize ALL. */
2275 assign_parms_initialize_all (struct assign_parm_data_all
*all
)
2277 tree fntype ATTRIBUTE_UNUSED
;
2279 memset (all
, 0, sizeof (*all
));
2281 fntype
= TREE_TYPE (current_function_decl
);
2283 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
2284 INIT_CUMULATIVE_INCOMING_ARGS (all
->args_so_far_v
, fntype
, NULL_RTX
);
2286 INIT_CUMULATIVE_ARGS (all
->args_so_far_v
, fntype
, NULL_RTX
,
2287 current_function_decl
, -1);
2289 all
->args_so_far
= pack_cumulative_args (&all
->args_so_far_v
);
2291 #ifdef INCOMING_REG_PARM_STACK_SPACE
2292 all
->reg_parm_stack_space
2293 = INCOMING_REG_PARM_STACK_SPACE (current_function_decl
);
2297 /* If ARGS contains entries with complex types, split the entry into two
2298 entries of the component type. Return a new list of substitutions are
2299 needed, else the old list. */
2302 split_complex_args (vec
<tree
> *args
)
2307 FOR_EACH_VEC_ELT (*args
, i
, p
)
2309 tree type
= TREE_TYPE (p
);
2310 if (TREE_CODE (type
) == COMPLEX_TYPE
2311 && targetm
.calls
.split_complex_arg (type
))
2314 tree subtype
= TREE_TYPE (type
);
2315 bool addressable
= TREE_ADDRESSABLE (p
);
2317 /* Rewrite the PARM_DECL's type with its component. */
2319 TREE_TYPE (p
) = subtype
;
2320 DECL_ARG_TYPE (p
) = TREE_TYPE (DECL_ARG_TYPE (p
));
2321 DECL_MODE (p
) = VOIDmode
;
2322 DECL_SIZE (p
) = NULL
;
2323 DECL_SIZE_UNIT (p
) = NULL
;
2324 /* If this arg must go in memory, put it in a pseudo here.
2325 We can't allow it to go in memory as per normal parms,
2326 because the usual place might not have the imag part
2327 adjacent to the real part. */
2328 DECL_ARTIFICIAL (p
) = addressable
;
2329 DECL_IGNORED_P (p
) = addressable
;
2330 TREE_ADDRESSABLE (p
) = 0;
2334 /* Build a second synthetic decl. */
2335 decl
= build_decl (EXPR_LOCATION (p
),
2336 PARM_DECL
, NULL_TREE
, subtype
);
2337 DECL_ARG_TYPE (decl
) = DECL_ARG_TYPE (p
);
2338 DECL_ARTIFICIAL (decl
) = addressable
;
2339 DECL_IGNORED_P (decl
) = addressable
;
2340 layout_decl (decl
, 0);
2341 args
->safe_insert (++i
, decl
);
2346 /* A subroutine of assign_parms. Adjust the parameter list to incorporate
2347 the hidden struct return argument, and (abi willing) complex args.
2348 Return the new parameter list. */
2351 assign_parms_augmented_arg_list (struct assign_parm_data_all
*all
)
2353 tree fndecl
= current_function_decl
;
2354 tree fntype
= TREE_TYPE (fndecl
);
2355 vec
<tree
> fnargs
= vNULL
;
2358 for (arg
= DECL_ARGUMENTS (fndecl
); arg
; arg
= DECL_CHAIN (arg
))
2359 fnargs
.safe_push (arg
);
2361 all
->orig_fnargs
= DECL_ARGUMENTS (fndecl
);
2363 /* If struct value address is treated as the first argument, make it so. */
2364 if (aggregate_value_p (DECL_RESULT (fndecl
), fndecl
)
2365 && ! cfun
->returns_pcc_struct
2366 && targetm
.calls
.struct_value_rtx (TREE_TYPE (fndecl
), 1) == 0)
2368 tree type
= build_pointer_type (TREE_TYPE (fntype
));
2371 decl
= build_decl (DECL_SOURCE_LOCATION (fndecl
),
2372 PARM_DECL
, get_identifier (".result_ptr"), type
);
2373 DECL_ARG_TYPE (decl
) = type
;
2374 DECL_ARTIFICIAL (decl
) = 1;
2375 DECL_NAMELESS (decl
) = 1;
2376 TREE_CONSTANT (decl
) = 1;
2378 DECL_CHAIN (decl
) = all
->orig_fnargs
;
2379 all
->orig_fnargs
= decl
;
2380 fnargs
.safe_insert (0, decl
);
2382 all
->function_result_decl
= decl
;
2384 /* If function is instrumented then bounds of the
2385 passed structure address is the second argument. */
2386 if (chkp_function_instrumented_p (fndecl
))
2388 decl
= build_decl (DECL_SOURCE_LOCATION (fndecl
),
2389 PARM_DECL
, get_identifier (".result_bnd"),
2390 pointer_bounds_type_node
);
2391 DECL_ARG_TYPE (decl
) = pointer_bounds_type_node
;
2392 DECL_ARTIFICIAL (decl
) = 1;
2393 DECL_NAMELESS (decl
) = 1;
2394 TREE_CONSTANT (decl
) = 1;
2396 DECL_CHAIN (decl
) = DECL_CHAIN (all
->orig_fnargs
);
2397 DECL_CHAIN (all
->orig_fnargs
) = decl
;
2398 fnargs
.safe_insert (1, decl
);
2402 /* If the target wants to split complex arguments into scalars, do so. */
2403 if (targetm
.calls
.split_complex_arg
)
2404 split_complex_args (&fnargs
);
2409 /* A subroutine of assign_parms. Examine PARM and pull out type and mode
2410 data for the parameter. Incorporate ABI specifics such as pass-by-
2411 reference and type promotion. */
2414 assign_parm_find_data_types (struct assign_parm_data_all
*all
, tree parm
,
2415 struct assign_parm_data_one
*data
)
2417 tree nominal_type
, passed_type
;
2418 machine_mode nominal_mode
, passed_mode
, promoted_mode
;
2421 memset (data
, 0, sizeof (*data
));
2423 /* NAMED_ARG is a misnomer. We really mean 'non-variadic'. */
2425 data
->named_arg
= 1; /* No variadic parms. */
2426 else if (DECL_CHAIN (parm
))
2427 data
->named_arg
= 1; /* Not the last non-variadic parm. */
2428 else if (targetm
.calls
.strict_argument_naming (all
->args_so_far
))
2429 data
->named_arg
= 1; /* Only variadic ones are unnamed. */
2431 data
->named_arg
= 0; /* Treat as variadic. */
2433 nominal_type
= TREE_TYPE (parm
);
2434 passed_type
= DECL_ARG_TYPE (parm
);
2436 /* Look out for errors propagating this far. Also, if the parameter's
2437 type is void then its value doesn't matter. */
2438 if (TREE_TYPE (parm
) == error_mark_node
2439 /* This can happen after weird syntax errors
2440 or if an enum type is defined among the parms. */
2441 || TREE_CODE (parm
) != PARM_DECL
2442 || passed_type
== NULL
2443 || VOID_TYPE_P (nominal_type
))
2445 nominal_type
= passed_type
= void_type_node
;
2446 nominal_mode
= passed_mode
= promoted_mode
= VOIDmode
;
2450 /* Find mode of arg as it is passed, and mode of arg as it should be
2451 during execution of this function. */
2452 passed_mode
= TYPE_MODE (passed_type
);
2453 nominal_mode
= TYPE_MODE (nominal_type
);
2455 /* If the parm is to be passed as a transparent union or record, use the
2456 type of the first field for the tests below. We have already verified
2457 that the modes are the same. */
2458 if ((TREE_CODE (passed_type
) == UNION_TYPE
2459 || TREE_CODE (passed_type
) == RECORD_TYPE
)
2460 && TYPE_TRANSPARENT_AGGR (passed_type
))
2461 passed_type
= TREE_TYPE (first_field (passed_type
));
2463 /* See if this arg was passed by invisible reference. */
2464 if (pass_by_reference (&all
->args_so_far_v
, passed_mode
,
2465 passed_type
, data
->named_arg
))
2467 passed_type
= nominal_type
= build_pointer_type (passed_type
);
2468 data
->passed_pointer
= true;
2469 passed_mode
= nominal_mode
= TYPE_MODE (nominal_type
);
2472 /* Find mode as it is passed by the ABI. */
2473 unsignedp
= TYPE_UNSIGNED (passed_type
);
2474 promoted_mode
= promote_function_mode (passed_type
, passed_mode
, &unsignedp
,
2475 TREE_TYPE (current_function_decl
), 0);
2478 data
->nominal_type
= nominal_type
;
2479 data
->passed_type
= passed_type
;
2480 data
->nominal_mode
= nominal_mode
;
2481 data
->passed_mode
= passed_mode
;
2482 data
->promoted_mode
= promoted_mode
;
2485 /* A subroutine of assign_parms. Invoke setup_incoming_varargs. */
2488 assign_parms_setup_varargs (struct assign_parm_data_all
*all
,
2489 struct assign_parm_data_one
*data
, bool no_rtl
)
2491 int varargs_pretend_bytes
= 0;
2493 targetm
.calls
.setup_incoming_varargs (all
->args_so_far
,
2494 data
->promoted_mode
,
2496 &varargs_pretend_bytes
, no_rtl
);
2498 /* If the back-end has requested extra stack space, record how much is
2499 needed. Do not change pretend_args_size otherwise since it may be
2500 nonzero from an earlier partial argument. */
2501 if (varargs_pretend_bytes
> 0)
2502 all
->pretend_args_size
= varargs_pretend_bytes
;
2505 /* A subroutine of assign_parms. Set DATA->ENTRY_PARM corresponding to
2506 the incoming location of the current parameter. */
2509 assign_parm_find_entry_rtl (struct assign_parm_data_all
*all
,
2510 struct assign_parm_data_one
*data
)
2512 HOST_WIDE_INT pretend_bytes
= 0;
2516 if (data
->promoted_mode
== VOIDmode
)
2518 data
->entry_parm
= data
->stack_parm
= const0_rtx
;
2522 entry_parm
= targetm
.calls
.function_incoming_arg (all
->args_so_far
,
2523 data
->promoted_mode
,
2527 if (entry_parm
== 0)
2528 data
->promoted_mode
= data
->passed_mode
;
2530 /* Determine parm's home in the stack, in case it arrives in the stack
2531 or we should pretend it did. Compute the stack position and rtx where
2532 the argument arrives and its size.
2534 There is one complexity here: If this was a parameter that would
2535 have been passed in registers, but wasn't only because it is
2536 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
2537 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
2538 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of 0
2539 as it was the previous time. */
2540 in_regs
= (entry_parm
!= 0) || POINTER_BOUNDS_TYPE_P (data
->passed_type
);
2541 #ifdef STACK_PARMS_IN_REG_PARM_AREA
2544 if (!in_regs
&& !data
->named_arg
)
2546 if (targetm
.calls
.pretend_outgoing_varargs_named (all
->args_so_far
))
2549 tem
= targetm
.calls
.function_incoming_arg (all
->args_so_far
,
2550 data
->promoted_mode
,
2551 data
->passed_type
, true);
2552 in_regs
= tem
!= NULL
;
2556 /* If this parameter was passed both in registers and in the stack, use
2557 the copy on the stack. */
2558 if (targetm
.calls
.must_pass_in_stack (data
->promoted_mode
,
2566 partial
= targetm
.calls
.arg_partial_bytes (all
->args_so_far
,
2567 data
->promoted_mode
,
2570 data
->partial
= partial
;
2572 /* The caller might already have allocated stack space for the
2573 register parameters. */
2574 if (partial
!= 0 && all
->reg_parm_stack_space
== 0)
2576 /* Part of this argument is passed in registers and part
2577 is passed on the stack. Ask the prologue code to extend
2578 the stack part so that we can recreate the full value.
2580 PRETEND_BYTES is the size of the registers we need to store.
2581 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
2582 stack space that the prologue should allocate.
2584 Internally, gcc assumes that the argument pointer is aligned
2585 to STACK_BOUNDARY bits. This is used both for alignment
2586 optimizations (see init_emit) and to locate arguments that are
2587 aligned to more than PARM_BOUNDARY bits. We must preserve this
2588 invariant by rounding CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to
2589 a stack boundary. */
2591 /* We assume at most one partial arg, and it must be the first
2592 argument on the stack. */
2593 gcc_assert (!all
->extra_pretend_bytes
&& !all
->pretend_args_size
);
2595 pretend_bytes
= partial
;
2596 all
->pretend_args_size
= CEIL_ROUND (pretend_bytes
, STACK_BYTES
);
2598 /* We want to align relative to the actual stack pointer, so
2599 don't include this in the stack size until later. */
2600 all
->extra_pretend_bytes
= all
->pretend_args_size
;
2604 locate_and_pad_parm (data
->promoted_mode
, data
->passed_type
, in_regs
,
2605 all
->reg_parm_stack_space
,
2606 entry_parm
? data
->partial
: 0, current_function_decl
,
2607 &all
->stack_args_size
, &data
->locate
);
2609 /* Update parm_stack_boundary if this parameter is passed in the
2611 if (!in_regs
&& crtl
->parm_stack_boundary
< data
->locate
.boundary
)
2612 crtl
->parm_stack_boundary
= data
->locate
.boundary
;
2614 /* Adjust offsets to include the pretend args. */
2615 pretend_bytes
= all
->extra_pretend_bytes
- pretend_bytes
;
2616 data
->locate
.slot_offset
.constant
+= pretend_bytes
;
2617 data
->locate
.offset
.constant
+= pretend_bytes
;
2619 data
->entry_parm
= entry_parm
;
2622 /* A subroutine of assign_parms. If there is actually space on the stack
2623 for this parm, count it in stack_args_size and return true. */
2626 assign_parm_is_stack_parm (struct assign_parm_data_all
*all
,
2627 struct assign_parm_data_one
*data
)
2629 /* Bounds are never passed on the stack to keep compatibility
2630 with not instrumented code. */
2631 if (POINTER_BOUNDS_TYPE_P (data
->passed_type
))
2633 /* Trivially true if we've no incoming register. */
2634 else if (data
->entry_parm
== NULL
)
2636 /* Also true if we're partially in registers and partially not,
2637 since we've arranged to drop the entire argument on the stack. */
2638 else if (data
->partial
!= 0)
2640 /* Also true if the target says that it's passed in both registers
2641 and on the stack. */
2642 else if (GET_CODE (data
->entry_parm
) == PARALLEL
2643 && XEXP (XVECEXP (data
->entry_parm
, 0, 0), 0) == NULL_RTX
)
2645 /* Also true if the target says that there's stack allocated for
2646 all register parameters. */
2647 else if (all
->reg_parm_stack_space
> 0)
2649 /* Otherwise, no, this parameter has no ABI defined stack slot. */
2653 all
->stack_args_size
.constant
+= data
->locate
.size
.constant
;
2654 if (data
->locate
.size
.var
)
2655 ADD_PARM_SIZE (all
->stack_args_size
, data
->locate
.size
.var
);
2660 /* A subroutine of assign_parms. Given that this parameter is allocated
2661 stack space by the ABI, find it. */
2664 assign_parm_find_stack_rtl (tree parm
, struct assign_parm_data_one
*data
)
2666 rtx offset_rtx
, stack_parm
;
2667 unsigned int align
, boundary
;
2669 /* If we're passing this arg using a reg, make its stack home the
2670 aligned stack slot. */
2671 if (data
->entry_parm
)
2672 offset_rtx
= ARGS_SIZE_RTX (data
->locate
.slot_offset
);
2674 offset_rtx
= ARGS_SIZE_RTX (data
->locate
.offset
);
2676 stack_parm
= crtl
->args
.internal_arg_pointer
;
2677 if (offset_rtx
!= const0_rtx
)
2678 stack_parm
= gen_rtx_PLUS (Pmode
, stack_parm
, offset_rtx
);
2679 stack_parm
= gen_rtx_MEM (data
->promoted_mode
, stack_parm
);
2681 if (!data
->passed_pointer
)
2683 set_mem_attributes (stack_parm
, parm
, 1);
2684 /* set_mem_attributes could set MEM_SIZE to the passed mode's size,
2685 while promoted mode's size is needed. */
2686 if (data
->promoted_mode
!= BLKmode
2687 && data
->promoted_mode
!= DECL_MODE (parm
))
2689 set_mem_size (stack_parm
, GET_MODE_SIZE (data
->promoted_mode
));
2690 if (MEM_EXPR (stack_parm
) && MEM_OFFSET_KNOWN_P (stack_parm
))
2692 int offset
= subreg_lowpart_offset (DECL_MODE (parm
),
2693 data
->promoted_mode
);
2695 set_mem_offset (stack_parm
, MEM_OFFSET (stack_parm
) - offset
);
2700 boundary
= data
->locate
.boundary
;
2701 align
= BITS_PER_UNIT
;
2703 /* If we're padding upward, we know that the alignment of the slot
2704 is TARGET_FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
2705 intentionally forcing upward padding. Otherwise we have to come
2706 up with a guess at the alignment based on OFFSET_RTX. */
2707 if (data
->locate
.where_pad
!= downward
|| data
->entry_parm
)
2709 else if (CONST_INT_P (offset_rtx
))
2711 align
= INTVAL (offset_rtx
) * BITS_PER_UNIT
| boundary
;
2712 align
= align
& -align
;
2714 set_mem_align (stack_parm
, align
);
2716 if (data
->entry_parm
)
2717 set_reg_attrs_for_parm (data
->entry_parm
, stack_parm
);
2719 data
->stack_parm
= stack_parm
;
2722 /* A subroutine of assign_parms. Adjust DATA->ENTRY_RTL such that it's
2723 always valid and contiguous. */
2726 assign_parm_adjust_entry_rtl (struct assign_parm_data_one
*data
)
2728 rtx entry_parm
= data
->entry_parm
;
2729 rtx stack_parm
= data
->stack_parm
;
2731 /* If this parm was passed part in regs and part in memory, pretend it
2732 arrived entirely in memory by pushing the register-part onto the stack.
2733 In the special case of a DImode or DFmode that is split, we could put
2734 it together in a pseudoreg directly, but for now that's not worth
2736 if (data
->partial
!= 0)
2738 /* Handle calls that pass values in multiple non-contiguous
2739 locations. The Irix 6 ABI has examples of this. */
2740 if (GET_CODE (entry_parm
) == PARALLEL
)
2741 emit_group_store (validize_mem (copy_rtx (stack_parm
)), entry_parm
,
2743 int_size_in_bytes (data
->passed_type
));
2746 gcc_assert (data
->partial
% UNITS_PER_WORD
== 0);
2747 move_block_from_reg (REGNO (entry_parm
),
2748 validize_mem (copy_rtx (stack_parm
)),
2749 data
->partial
/ UNITS_PER_WORD
);
2752 entry_parm
= stack_parm
;
2755 /* If we didn't decide this parm came in a register, by default it came
2757 else if (entry_parm
== NULL
)
2758 entry_parm
= stack_parm
;
2760 /* When an argument is passed in multiple locations, we can't make use
2761 of this information, but we can save some copying if the whole argument
2762 is passed in a single register. */
2763 else if (GET_CODE (entry_parm
) == PARALLEL
2764 && data
->nominal_mode
!= BLKmode
2765 && data
->passed_mode
!= BLKmode
)
2767 size_t i
, len
= XVECLEN (entry_parm
, 0);
2769 for (i
= 0; i
< len
; i
++)
2770 if (XEXP (XVECEXP (entry_parm
, 0, i
), 0) != NULL_RTX
2771 && REG_P (XEXP (XVECEXP (entry_parm
, 0, i
), 0))
2772 && (GET_MODE (XEXP (XVECEXP (entry_parm
, 0, i
), 0))
2773 == data
->passed_mode
)
2774 && INTVAL (XEXP (XVECEXP (entry_parm
, 0, i
), 1)) == 0)
2776 entry_parm
= XEXP (XVECEXP (entry_parm
, 0, i
), 0);
2781 data
->entry_parm
= entry_parm
;
2784 /* A subroutine of assign_parms. Reconstitute any values which were
2785 passed in multiple registers and would fit in a single register. */
2788 assign_parm_remove_parallels (struct assign_parm_data_one
*data
)
2790 rtx entry_parm
= data
->entry_parm
;
2792 /* Convert the PARALLEL to a REG of the same mode as the parallel.
2793 This can be done with register operations rather than on the
2794 stack, even if we will store the reconstituted parameter on the
2796 if (GET_CODE (entry_parm
) == PARALLEL
&& GET_MODE (entry_parm
) != BLKmode
)
2798 rtx parmreg
= gen_reg_rtx (GET_MODE (entry_parm
));
2799 emit_group_store (parmreg
, entry_parm
, data
->passed_type
,
2800 GET_MODE_SIZE (GET_MODE (entry_parm
)));
2801 entry_parm
= parmreg
;
2804 data
->entry_parm
= entry_parm
;
2807 /* A subroutine of assign_parms. Adjust DATA->STACK_RTL such that it's
2808 always valid and properly aligned. */
2811 assign_parm_adjust_stack_rtl (struct assign_parm_data_one
*data
)
2813 rtx stack_parm
= data
->stack_parm
;
2815 /* If we can't trust the parm stack slot to be aligned enough for its
2816 ultimate type, don't use that slot after entry. We'll make another
2817 stack slot, if we need one. */
2819 && ((STRICT_ALIGNMENT
2820 && GET_MODE_ALIGNMENT (data
->nominal_mode
) > MEM_ALIGN (stack_parm
))
2821 || (data
->nominal_type
2822 && TYPE_ALIGN (data
->nominal_type
) > MEM_ALIGN (stack_parm
)
2823 && MEM_ALIGN (stack_parm
) < PREFERRED_STACK_BOUNDARY
)))
2826 /* If parm was passed in memory, and we need to convert it on entry,
2827 don't store it back in that same slot. */
2828 else if (data
->entry_parm
== stack_parm
2829 && data
->nominal_mode
!= BLKmode
2830 && data
->nominal_mode
!= data
->passed_mode
)
2833 /* If stack protection is in effect for this function, don't leave any
2834 pointers in their passed stack slots. */
2835 else if (crtl
->stack_protect_guard
2836 && (flag_stack_protect
== 2
2837 || data
->passed_pointer
2838 || POINTER_TYPE_P (data
->nominal_type
)))
2841 data
->stack_parm
= stack_parm
;
2844 /* A subroutine of assign_parms. Return true if the current parameter
2845 should be stored as a BLKmode in the current frame. */
2848 assign_parm_setup_block_p (struct assign_parm_data_one
*data
)
2850 if (data
->nominal_mode
== BLKmode
)
2852 if (GET_MODE (data
->entry_parm
) == BLKmode
)
2855 #ifdef BLOCK_REG_PADDING
2856 /* Only assign_parm_setup_block knows how to deal with register arguments
2857 that are padded at the least significant end. */
2858 if (REG_P (data
->entry_parm
)
2859 && GET_MODE_SIZE (data
->promoted_mode
) < UNITS_PER_WORD
2860 && (BLOCK_REG_PADDING (data
->passed_mode
, data
->passed_type
, 1)
2861 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
2868 /* A subroutine of assign_parms. Arrange for the parameter to be
2869 present and valid in DATA->STACK_RTL. */
2872 assign_parm_setup_block (struct assign_parm_data_all
*all
,
2873 tree parm
, struct assign_parm_data_one
*data
)
2875 rtx entry_parm
= data
->entry_parm
;
2876 rtx stack_parm
= data
->stack_parm
;
2878 HOST_WIDE_INT size_stored
;
2880 if (GET_CODE (entry_parm
) == PARALLEL
)
2881 entry_parm
= emit_group_move_into_temps (entry_parm
);
2883 size
= int_size_in_bytes (data
->passed_type
);
2884 size_stored
= CEIL_ROUND (size
, UNITS_PER_WORD
);
2885 if (stack_parm
== 0)
2887 DECL_ALIGN (parm
) = MAX (DECL_ALIGN (parm
), BITS_PER_WORD
);
2888 stack_parm
= assign_stack_local (BLKmode
, size_stored
,
2890 if (GET_MODE_SIZE (GET_MODE (entry_parm
)) == size
)
2891 PUT_MODE (stack_parm
, GET_MODE (entry_parm
));
2892 set_mem_attributes (stack_parm
, parm
, 1);
2895 /* If a BLKmode arrives in registers, copy it to a stack slot. Handle
2896 calls that pass values in multiple non-contiguous locations. */
2897 if (REG_P (entry_parm
) || GET_CODE (entry_parm
) == PARALLEL
)
2901 /* Note that we will be storing an integral number of words.
2902 So we have to be careful to ensure that we allocate an
2903 integral number of words. We do this above when we call
2904 assign_stack_local if space was not allocated in the argument
2905 list. If it was, this will not work if PARM_BOUNDARY is not
2906 a multiple of BITS_PER_WORD. It isn't clear how to fix this
2907 if it becomes a problem. Exception is when BLKmode arrives
2908 with arguments not conforming to word_mode. */
2910 if (data
->stack_parm
== 0)
2912 else if (GET_CODE (entry_parm
) == PARALLEL
)
2915 gcc_assert (!size
|| !(PARM_BOUNDARY
% BITS_PER_WORD
));
2917 mem
= validize_mem (copy_rtx (stack_parm
));
2919 /* Handle values in multiple non-contiguous locations. */
2920 if (GET_CODE (entry_parm
) == PARALLEL
)
2922 push_to_sequence2 (all
->first_conversion_insn
,
2923 all
->last_conversion_insn
);
2924 emit_group_store (mem
, entry_parm
, data
->passed_type
, size
);
2925 all
->first_conversion_insn
= get_insns ();
2926 all
->last_conversion_insn
= get_last_insn ();
2933 /* If SIZE is that of a mode no bigger than a word, just use
2934 that mode's store operation. */
2935 else if (size
<= UNITS_PER_WORD
)
2938 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
2941 #ifdef BLOCK_REG_PADDING
2942 && (size
== UNITS_PER_WORD
2943 || (BLOCK_REG_PADDING (mode
, data
->passed_type
, 1)
2944 != (BYTES_BIG_ENDIAN
? upward
: downward
)))
2950 /* We are really truncating a word_mode value containing
2951 SIZE bytes into a value of mode MODE. If such an
2952 operation requires no actual instructions, we can refer
2953 to the value directly in mode MODE, otherwise we must
2954 start with the register in word_mode and explicitly
2956 if (TRULY_NOOP_TRUNCATION (size
* BITS_PER_UNIT
, BITS_PER_WORD
))
2957 reg
= gen_rtx_REG (mode
, REGNO (entry_parm
));
2960 reg
= gen_rtx_REG (word_mode
, REGNO (entry_parm
));
2961 reg
= convert_to_mode (mode
, copy_to_reg (reg
), 1);
2963 emit_move_insn (change_address (mem
, mode
, 0), reg
);
2966 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
2967 machine must be aligned to the left before storing
2968 to memory. Note that the previous test doesn't
2969 handle all cases (e.g. SIZE == 3). */
2970 else if (size
!= UNITS_PER_WORD
2971 #ifdef BLOCK_REG_PADDING
2972 && (BLOCK_REG_PADDING (mode
, data
->passed_type
, 1)
2980 int by
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
2981 rtx reg
= gen_rtx_REG (word_mode
, REGNO (entry_parm
));
2983 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
, by
, NULL_RTX
, 1);
2984 tem
= change_address (mem
, word_mode
, 0);
2985 emit_move_insn (tem
, x
);
2988 move_block_from_reg (REGNO (entry_parm
), mem
,
2989 size_stored
/ UNITS_PER_WORD
);
2992 move_block_from_reg (REGNO (entry_parm
), mem
,
2993 size_stored
/ UNITS_PER_WORD
);
2995 else if (data
->stack_parm
== 0)
2997 push_to_sequence2 (all
->first_conversion_insn
, all
->last_conversion_insn
);
2998 emit_block_move (stack_parm
, data
->entry_parm
, GEN_INT (size
),
3000 all
->first_conversion_insn
= get_insns ();
3001 all
->last_conversion_insn
= get_last_insn ();
3005 data
->stack_parm
= stack_parm
;
3006 SET_DECL_RTL (parm
, stack_parm
);
3009 /* A subroutine of assign_parms. Allocate a pseudo to hold the current
3010 parameter. Get it there. Perform all ABI specified conversions. */
3013 assign_parm_setup_reg (struct assign_parm_data_all
*all
, tree parm
,
3014 struct assign_parm_data_one
*data
)
3016 rtx parmreg
, validated_mem
;
3017 rtx equiv_stack_parm
;
3018 machine_mode promoted_nominal_mode
;
3019 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (parm
));
3020 bool did_conversion
= false;
3021 bool need_conversion
, moved
;
3023 /* Store the parm in a pseudoregister during the function, but we may
3024 need to do it in a wider mode. Using 2 here makes the result
3025 consistent with promote_decl_mode and thus expand_expr_real_1. */
3026 promoted_nominal_mode
3027 = promote_function_mode (data
->nominal_type
, data
->nominal_mode
, &unsignedp
,
3028 TREE_TYPE (current_function_decl
), 2);
3030 parmreg
= gen_reg_rtx (promoted_nominal_mode
);
3032 if (!DECL_ARTIFICIAL (parm
))
3033 mark_user_reg (parmreg
);
3035 /* If this was an item that we received a pointer to,
3036 set DECL_RTL appropriately. */
3037 if (data
->passed_pointer
)
3039 rtx x
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data
->passed_type
)), parmreg
);
3040 set_mem_attributes (x
, parm
, 1);
3041 SET_DECL_RTL (parm
, x
);
3044 SET_DECL_RTL (parm
, parmreg
);
3046 assign_parm_remove_parallels (data
);
3048 /* Copy the value into the register, thus bridging between
3049 assign_parm_find_data_types and expand_expr_real_1. */
3051 equiv_stack_parm
= data
->stack_parm
;
3052 validated_mem
= validize_mem (copy_rtx (data
->entry_parm
));
3054 need_conversion
= (data
->nominal_mode
!= data
->passed_mode
3055 || promoted_nominal_mode
!= data
->promoted_mode
);
3059 && GET_MODE_CLASS (data
->nominal_mode
) == MODE_INT
3060 && data
->nominal_mode
== data
->passed_mode
3061 && data
->nominal_mode
== GET_MODE (data
->entry_parm
))
3063 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
3064 mode, by the caller. We now have to convert it to
3065 NOMINAL_MODE, if different. However, PARMREG may be in
3066 a different mode than NOMINAL_MODE if it is being stored
3069 If ENTRY_PARM is a hard register, it might be in a register
3070 not valid for operating in its mode (e.g., an odd-numbered
3071 register for a DFmode). In that case, moves are the only
3072 thing valid, so we can't do a convert from there. This
3073 occurs when the calling sequence allow such misaligned
3076 In addition, the conversion may involve a call, which could
3077 clobber parameters which haven't been copied to pseudo
3080 First, we try to emit an insn which performs the necessary
3081 conversion. We verify that this insn does not clobber any
3084 enum insn_code icode
;
3087 icode
= can_extend_p (promoted_nominal_mode
, data
->passed_mode
,
3091 op1
= validated_mem
;
3092 if (icode
!= CODE_FOR_nothing
3093 && insn_operand_matches (icode
, 0, op0
)
3094 && insn_operand_matches (icode
, 1, op1
))
3096 enum rtx_code code
= unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
;
3097 rtx_insn
*insn
, *insns
;
3099 HARD_REG_SET hardregs
;
3102 /* If op1 is a hard register that is likely spilled, first
3103 force it into a pseudo, otherwise combiner might extend
3104 its lifetime too much. */
3105 if (GET_CODE (t
) == SUBREG
)
3108 && HARD_REGISTER_P (t
)
3109 && ! TEST_HARD_REG_BIT (fixed_reg_set
, REGNO (t
))
3110 && targetm
.class_likely_spilled_p (REGNO_REG_CLASS (REGNO (t
))))
3112 t
= gen_reg_rtx (GET_MODE (op1
));
3113 emit_move_insn (t
, op1
);
3117 rtx pat
= gen_extend_insn (op0
, t
, promoted_nominal_mode
,
3118 data
->passed_mode
, unsignedp
);
3120 insns
= get_insns ();
3123 CLEAR_HARD_REG_SET (hardregs
);
3124 for (insn
= insns
; insn
&& moved
; insn
= NEXT_INSN (insn
))
3127 note_stores (PATTERN (insn
), record_hard_reg_sets
,
3129 if (!hard_reg_set_empty_p (hardregs
))
3138 if (equiv_stack_parm
!= NULL_RTX
)
3139 equiv_stack_parm
= gen_rtx_fmt_e (code
, GET_MODE (parmreg
),
3146 /* Nothing to do. */
3148 else if (need_conversion
)
3150 /* We did not have an insn to convert directly, or the sequence
3151 generated appeared unsafe. We must first copy the parm to a
3152 pseudo reg, and save the conversion until after all
3153 parameters have been moved. */
3156 rtx tempreg
= gen_reg_rtx (GET_MODE (data
->entry_parm
));
3158 emit_move_insn (tempreg
, validated_mem
);
3160 push_to_sequence2 (all
->first_conversion_insn
, all
->last_conversion_insn
);
3161 tempreg
= convert_to_mode (data
->nominal_mode
, tempreg
, unsignedp
);
3163 if (GET_CODE (tempreg
) == SUBREG
3164 && GET_MODE (tempreg
) == data
->nominal_mode
3165 && REG_P (SUBREG_REG (tempreg
))
3166 && data
->nominal_mode
== data
->passed_mode
3167 && GET_MODE (SUBREG_REG (tempreg
)) == GET_MODE (data
->entry_parm
)
3168 && GET_MODE_SIZE (GET_MODE (tempreg
))
3169 < GET_MODE_SIZE (GET_MODE (data
->entry_parm
)))
3171 /* The argument is already sign/zero extended, so note it
3173 SUBREG_PROMOTED_VAR_P (tempreg
) = 1;
3174 SUBREG_PROMOTED_SET (tempreg
, unsignedp
);
3177 /* TREE_USED gets set erroneously during expand_assignment. */
3178 save_tree_used
= TREE_USED (parm
);
3179 expand_assignment (parm
, make_tree (data
->nominal_type
, tempreg
), false);
3180 TREE_USED (parm
) = save_tree_used
;
3181 all
->first_conversion_insn
= get_insns ();
3182 all
->last_conversion_insn
= get_last_insn ();
3185 did_conversion
= true;
3188 emit_move_insn (parmreg
, validated_mem
);
3190 /* If we were passed a pointer but the actual value can safely live
3191 in a register, retrieve it and use it directly. */
3192 if (data
->passed_pointer
&& TYPE_MODE (TREE_TYPE (parm
)) != BLKmode
)
3194 /* We can't use nominal_mode, because it will have been set to
3195 Pmode above. We must use the actual mode of the parm. */
3196 if (use_register_for_decl (parm
))
3198 parmreg
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm
)));
3199 mark_user_reg (parmreg
);
3203 int align
= STACK_SLOT_ALIGNMENT (TREE_TYPE (parm
),
3204 TYPE_MODE (TREE_TYPE (parm
)),
3205 TYPE_ALIGN (TREE_TYPE (parm
)));
3207 = assign_stack_local (TYPE_MODE (TREE_TYPE (parm
)),
3208 GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (parm
))),
3210 set_mem_attributes (parmreg
, parm
, 1);
3213 if (GET_MODE (parmreg
) != GET_MODE (DECL_RTL (parm
)))
3215 rtx tempreg
= gen_reg_rtx (GET_MODE (DECL_RTL (parm
)));
3216 int unsigned_p
= TYPE_UNSIGNED (TREE_TYPE (parm
));
3218 push_to_sequence2 (all
->first_conversion_insn
,
3219 all
->last_conversion_insn
);
3220 emit_move_insn (tempreg
, DECL_RTL (parm
));
3221 tempreg
= convert_to_mode (GET_MODE (parmreg
), tempreg
, unsigned_p
);
3222 emit_move_insn (parmreg
, tempreg
);
3223 all
->first_conversion_insn
= get_insns ();
3224 all
->last_conversion_insn
= get_last_insn ();
3227 did_conversion
= true;
3230 emit_move_insn (parmreg
, DECL_RTL (parm
));
3232 SET_DECL_RTL (parm
, parmreg
);
3234 /* STACK_PARM is the pointer, not the parm, and PARMREG is
3236 data
->stack_parm
= NULL
;
3239 /* Mark the register as eliminable if we did no conversion and it was
3240 copied from memory at a fixed offset, and the arg pointer was not
3241 copied to a pseudo-reg. If the arg pointer is a pseudo reg or the
3242 offset formed an invalid address, such memory-equivalences as we
3243 make here would screw up life analysis for it. */
3244 if (data
->nominal_mode
== data
->passed_mode
3246 && data
->stack_parm
!= 0
3247 && MEM_P (data
->stack_parm
)
3248 && data
->locate
.offset
.var
== 0
3249 && reg_mentioned_p (virtual_incoming_args_rtx
,
3250 XEXP (data
->stack_parm
, 0)))
3252 rtx_insn
*linsn
= get_last_insn ();
3256 /* Mark complex types separately. */
3257 if (GET_CODE (parmreg
) == CONCAT
)
3259 machine_mode submode
3260 = GET_MODE_INNER (GET_MODE (parmreg
));
3261 int regnor
= REGNO (XEXP (parmreg
, 0));
3262 int regnoi
= REGNO (XEXP (parmreg
, 1));
3263 rtx stackr
= adjust_address_nv (data
->stack_parm
, submode
, 0);
3264 rtx stacki
= adjust_address_nv (data
->stack_parm
, submode
,
3265 GET_MODE_SIZE (submode
));
3267 /* Scan backwards for the set of the real and
3269 for (sinsn
= linsn
; sinsn
!= 0;
3270 sinsn
= prev_nonnote_insn (sinsn
))
3272 set
= single_set (sinsn
);
3276 if (SET_DEST (set
) == regno_reg_rtx
[regnoi
])
3277 set_unique_reg_note (sinsn
, REG_EQUIV
, stacki
);
3278 else if (SET_DEST (set
) == regno_reg_rtx
[regnor
])
3279 set_unique_reg_note (sinsn
, REG_EQUIV
, stackr
);
3283 set_dst_reg_note (linsn
, REG_EQUIV
, equiv_stack_parm
, parmreg
);
3286 /* For pointer data type, suggest pointer register. */
3287 if (POINTER_TYPE_P (TREE_TYPE (parm
)))
3288 mark_reg_pointer (parmreg
,
3289 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
))));
3292 /* A subroutine of assign_parms. Allocate stack space to hold the current
3293 parameter. Get it there. Perform all ABI specified conversions. */
3296 assign_parm_setup_stack (struct assign_parm_data_all
*all
, tree parm
,
3297 struct assign_parm_data_one
*data
)
3299 /* Value must be stored in the stack slot STACK_PARM during function
3301 bool to_conversion
= false;
3303 assign_parm_remove_parallels (data
);
3305 if (data
->promoted_mode
!= data
->nominal_mode
)
3307 /* Conversion is required. */
3308 rtx tempreg
= gen_reg_rtx (GET_MODE (data
->entry_parm
));
3310 emit_move_insn (tempreg
, validize_mem (copy_rtx (data
->entry_parm
)));
3312 push_to_sequence2 (all
->first_conversion_insn
, all
->last_conversion_insn
);
3313 to_conversion
= true;
3315 data
->entry_parm
= convert_to_mode (data
->nominal_mode
, tempreg
,
3316 TYPE_UNSIGNED (TREE_TYPE (parm
)));
3318 if (data
->stack_parm
)
3320 int offset
= subreg_lowpart_offset (data
->nominal_mode
,
3321 GET_MODE (data
->stack_parm
));
3322 /* ??? This may need a big-endian conversion on sparc64. */
3324 = adjust_address (data
->stack_parm
, data
->nominal_mode
, 0);
3325 if (offset
&& MEM_OFFSET_KNOWN_P (data
->stack_parm
))
3326 set_mem_offset (data
->stack_parm
,
3327 MEM_OFFSET (data
->stack_parm
) + offset
);
3331 if (data
->entry_parm
!= data
->stack_parm
)
3335 if (data
->stack_parm
== 0)
3337 int align
= STACK_SLOT_ALIGNMENT (data
->passed_type
,
3338 GET_MODE (data
->entry_parm
),
3339 TYPE_ALIGN (data
->passed_type
));
3341 = assign_stack_local (GET_MODE (data
->entry_parm
),
3342 GET_MODE_SIZE (GET_MODE (data
->entry_parm
)),
3344 set_mem_attributes (data
->stack_parm
, parm
, 1);
3347 dest
= validize_mem (copy_rtx (data
->stack_parm
));
3348 src
= validize_mem (copy_rtx (data
->entry_parm
));
3352 /* Use a block move to handle potentially misaligned entry_parm. */
3354 push_to_sequence2 (all
->first_conversion_insn
,
3355 all
->last_conversion_insn
);
3356 to_conversion
= true;
3358 emit_block_move (dest
, src
,
3359 GEN_INT (int_size_in_bytes (data
->passed_type
)),
3363 emit_move_insn (dest
, src
);
3368 all
->first_conversion_insn
= get_insns ();
3369 all
->last_conversion_insn
= get_last_insn ();
3373 SET_DECL_RTL (parm
, data
->stack_parm
);
3376 /* A subroutine of assign_parms. If the ABI splits complex arguments, then
3377 undo the frobbing that we did in assign_parms_augmented_arg_list. */
3380 assign_parms_unsplit_complex (struct assign_parm_data_all
*all
,
3384 tree orig_fnargs
= all
->orig_fnargs
;
3387 for (parm
= orig_fnargs
; parm
; parm
= TREE_CHAIN (parm
), ++i
)
3389 if (TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
3390 && targetm
.calls
.split_complex_arg (TREE_TYPE (parm
)))
3392 rtx tmp
, real
, imag
;
3393 machine_mode inner
= GET_MODE_INNER (DECL_MODE (parm
));
3395 real
= DECL_RTL (fnargs
[i
]);
3396 imag
= DECL_RTL (fnargs
[i
+ 1]);
3397 if (inner
!= GET_MODE (real
))
3399 real
= gen_lowpart_SUBREG (inner
, real
);
3400 imag
= gen_lowpart_SUBREG (inner
, imag
);
3403 if (TREE_ADDRESSABLE (parm
))
3406 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (parm
));
3407 int align
= STACK_SLOT_ALIGNMENT (TREE_TYPE (parm
),
3409 TYPE_ALIGN (TREE_TYPE (parm
)));
3411 /* split_complex_arg put the real and imag parts in
3412 pseudos. Move them to memory. */
3413 tmp
= assign_stack_local (DECL_MODE (parm
), size
, align
);
3414 set_mem_attributes (tmp
, parm
, 1);
3415 rmem
= adjust_address_nv (tmp
, inner
, 0);
3416 imem
= adjust_address_nv (tmp
, inner
, GET_MODE_SIZE (inner
));
3417 push_to_sequence2 (all
->first_conversion_insn
,
3418 all
->last_conversion_insn
);
3419 emit_move_insn (rmem
, real
);
3420 emit_move_insn (imem
, imag
);
3421 all
->first_conversion_insn
= get_insns ();
3422 all
->last_conversion_insn
= get_last_insn ();
3426 tmp
= gen_rtx_CONCAT (DECL_MODE (parm
), real
, imag
);
3427 SET_DECL_RTL (parm
, tmp
);
3429 real
= DECL_INCOMING_RTL (fnargs
[i
]);
3430 imag
= DECL_INCOMING_RTL (fnargs
[i
+ 1]);
3431 if (inner
!= GET_MODE (real
))
3433 real
= gen_lowpart_SUBREG (inner
, real
);
3434 imag
= gen_lowpart_SUBREG (inner
, imag
);
3436 tmp
= gen_rtx_CONCAT (DECL_MODE (parm
), real
, imag
);
3437 set_decl_incoming_rtl (parm
, tmp
, false);
3443 /* Load bounds of PARM from bounds table. */
3445 assign_parm_load_bounds (struct assign_parm_data_one
*data
,
3451 unsigned i
, offs
= 0;
3453 rtx slot
= NULL
, ptr
= NULL
;
3458 bitmap_obstack_initialize (NULL
);
3459 slots
= BITMAP_ALLOC (NULL
);
3460 chkp_find_bound_slots (TREE_TYPE (parm
), slots
);
3461 EXECUTE_IF_SET_IN_BITMAP (slots
, 0, i
, bi
)
3471 BITMAP_FREE (slots
);
3472 bitmap_obstack_release (NULL
);
3475 /* We may have bounds not associated with any pointer. */
3477 offs
= bnd_no
* POINTER_SIZE
/ BITS_PER_UNIT
;
3479 /* Find associated pointer. */
3482 /* If bounds are not associated with any bounds,
3483 then it is passed in a register or special slot. */
3484 gcc_assert (data
->entry_parm
);
3487 else if (MEM_P (entry
))
3488 slot
= adjust_address (entry
, Pmode
, offs
);
3489 else if (REG_P (entry
))
3490 ptr
= gen_rtx_REG (Pmode
, REGNO (entry
) + bnd_no
);
3491 else if (GET_CODE (entry
) == PARALLEL
)
3492 ptr
= chkp_get_value_with_offs (entry
, GEN_INT (offs
));
3495 data
->entry_parm
= targetm
.calls
.load_bounds_for_arg (slot
, ptr
,
3499 /* Assign RTL expressions to the function's bounds parameters BNDARGS. */
3502 assign_bounds (vec
<bounds_parm_data
> &bndargs
,
3503 struct assign_parm_data_all
&all
)
3505 unsigned i
, pass
, handled
= 0;
3506 bounds_parm_data
*pbdata
;
3508 if (!bndargs
.exists ())
3511 /* We make few passes to store input bounds. Firstly handle bounds
3512 passed in registers. After that we load bounds passed in special
3513 slots. Finally we load bounds from Bounds Table. */
3514 for (pass
= 0; pass
< 3; pass
++)
3515 FOR_EACH_VEC_ELT (bndargs
, i
, pbdata
)
3517 /* Pass 0 => regs only. */
3519 && (!pbdata
->parm_data
.entry_parm
3520 || GET_CODE (pbdata
->parm_data
.entry_parm
) != REG
))
3522 /* Pass 1 => slots only. */
3524 && (!pbdata
->parm_data
.entry_parm
3525 || GET_CODE (pbdata
->parm_data
.entry_parm
) == REG
))
3527 /* Pass 2 => BT only. */
3529 && pbdata
->parm_data
.entry_parm
)
3532 if (!pbdata
->parm_data
.entry_parm
3533 || GET_CODE (pbdata
->parm_data
.entry_parm
) != REG
)
3534 assign_parm_load_bounds (&pbdata
->parm_data
, pbdata
->ptr_parm
,
3535 pbdata
->ptr_entry
, pbdata
->bound_no
);
3537 set_decl_incoming_rtl (pbdata
->bounds_parm
,
3538 pbdata
->parm_data
.entry_parm
, false);
3540 if (assign_parm_setup_block_p (&pbdata
->parm_data
))
3541 assign_parm_setup_block (&all
, pbdata
->bounds_parm
,
3542 &pbdata
->parm_data
);
3543 else if (pbdata
->parm_data
.passed_pointer
3544 || use_register_for_decl (pbdata
->bounds_parm
))
3545 assign_parm_setup_reg (&all
, pbdata
->bounds_parm
,
3546 &pbdata
->parm_data
);
3548 assign_parm_setup_stack (&all
, pbdata
->bounds_parm
,
3549 &pbdata
->parm_data
);
3551 /* Count handled bounds to make sure we miss nothing. */
3555 gcc_assert (handled
== bndargs
.length ());
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
;
3569 unsigned i
, bound_no
= 0;
3570 tree last_arg
= NULL
;
3571 rtx last_arg_entry
= NULL
;
3572 vec
<bounds_parm_data
> bndargs
= vNULL
;
3573 bounds_parm_data bdata
;
3575 crtl
->args
.internal_arg_pointer
3576 = targetm
.calls
.internal_arg_pointer ();
3578 assign_parms_initialize_all (&all
);
3579 fnargs
= assign_parms_augmented_arg_list (&all
);
3581 FOR_EACH_VEC_ELT (fnargs
, i
, parm
)
3583 struct assign_parm_data_one data
;
3585 /* Extract the type of PARM; adjust it according to ABI. */
3586 assign_parm_find_data_types (&all
, parm
, &data
);
3588 /* Early out for errors and void parameters. */
3589 if (data
.passed_mode
== VOIDmode
)
3591 SET_DECL_RTL (parm
, const0_rtx
);
3592 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
);
3596 /* Estimate stack alignment from parameter alignment. */
3597 if (SUPPORTS_STACK_ALIGNMENT
)
3600 = targetm
.calls
.function_arg_boundary (data
.promoted_mode
,
3602 align
= MINIMUM_ALIGNMENT (data
.passed_type
, data
.promoted_mode
,
3604 if (TYPE_ALIGN (data
.nominal_type
) > align
)
3605 align
= MINIMUM_ALIGNMENT (data
.nominal_type
,
3606 TYPE_MODE (data
.nominal_type
),
3607 TYPE_ALIGN (data
.nominal_type
));
3608 if (crtl
->stack_alignment_estimated
< align
)
3610 gcc_assert (!crtl
->stack_realign_processed
);
3611 crtl
->stack_alignment_estimated
= align
;
3615 /* Find out where the parameter arrives in this function. */
3616 assign_parm_find_entry_rtl (&all
, &data
);
3618 /* Find out where stack space for this parameter might be. */
3619 if (assign_parm_is_stack_parm (&all
, &data
))
3621 assign_parm_find_stack_rtl (parm
, &data
);
3622 assign_parm_adjust_entry_rtl (&data
);
3624 if (!POINTER_BOUNDS_TYPE_P (data
.passed_type
))
3626 /* Remember where last non bounds arg was passed in case
3627 we have to load associated bounds for it from Bounds
3630 last_arg_entry
= data
.entry_parm
;
3633 /* Record permanently how this parm was passed. */
3634 if (data
.passed_pointer
)
3637 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data
.passed_type
)),
3639 set_decl_incoming_rtl (parm
, incoming_rtl
, true);
3642 set_decl_incoming_rtl (parm
, data
.entry_parm
, false);
3644 /* Boudns should be loaded in the particular order to
3645 have registers allocated correctly. Collect info about
3646 input bounds and load them later. */
3647 if (POINTER_BOUNDS_TYPE_P (data
.passed_type
))
3649 /* Expect bounds in instrumented functions only. */
3650 gcc_assert (chkp_function_instrumented_p (fndecl
));
3652 bdata
.parm_data
= data
;
3653 bdata
.bounds_parm
= parm
;
3654 bdata
.ptr_parm
= last_arg
;
3655 bdata
.ptr_entry
= last_arg_entry
;
3656 bdata
.bound_no
= bound_no
;
3657 bndargs
.safe_push (bdata
);
3661 assign_parm_adjust_stack_rtl (&data
);
3663 if (assign_parm_setup_block_p (&data
))
3664 assign_parm_setup_block (&all
, parm
, &data
);
3665 else if (data
.passed_pointer
|| use_register_for_decl (parm
))
3666 assign_parm_setup_reg (&all
, parm
, &data
);
3668 assign_parm_setup_stack (&all
, parm
, &data
);
3671 if (cfun
->stdarg
&& !DECL_CHAIN (parm
))
3673 int pretend_bytes
= 0;
3675 assign_parms_setup_varargs (&all
, &data
, false);
3677 if (chkp_function_instrumented_p (fndecl
))
3679 /* We expect this is the last parm. Otherwise it is wrong
3680 to assign bounds right now. */
3681 gcc_assert (i
== (fnargs
.length () - 1));
3682 assign_bounds (bndargs
, all
);
3683 targetm
.calls
.setup_incoming_vararg_bounds (all
.args_so_far
,
3691 /* Update info on where next arg arrives in registers. */
3692 targetm
.calls
.function_arg_advance (all
.args_so_far
, data
.promoted_mode
,
3693 data
.passed_type
, data
.named_arg
);
3695 if (POINTER_BOUNDS_TYPE_P (data
.passed_type
))
3699 assign_bounds (bndargs
, all
);
3701 if (targetm
.calls
.split_complex_arg
)
3702 assign_parms_unsplit_complex (&all
, fnargs
);
3706 /* Output all parameter conversion instructions (possibly including calls)
3707 now that all parameters have been copied out of hard registers. */
3708 emit_insn (all
.first_conversion_insn
);
3710 /* Estimate reload stack alignment from scalar return mode. */
3711 if (SUPPORTS_STACK_ALIGNMENT
)
3713 if (DECL_RESULT (fndecl
))
3715 tree type
= TREE_TYPE (DECL_RESULT (fndecl
));
3716 machine_mode mode
= TYPE_MODE (type
);
3720 && !AGGREGATE_TYPE_P (type
))
3722 unsigned int align
= GET_MODE_ALIGNMENT (mode
);
3723 if (crtl
->stack_alignment_estimated
< align
)
3725 gcc_assert (!crtl
->stack_realign_processed
);
3726 crtl
->stack_alignment_estimated
= align
;
3732 /* If we are receiving a struct value address as the first argument, set up
3733 the RTL for the function result. As this might require code to convert
3734 the transmitted address to Pmode, we do this here to ensure that possible
3735 preliminary conversions of the address have been emitted already. */
3736 if (all
.function_result_decl
)
3738 tree result
= DECL_RESULT (current_function_decl
);
3739 rtx addr
= DECL_RTL (all
.function_result_decl
);
3742 if (DECL_BY_REFERENCE (result
))
3744 SET_DECL_VALUE_EXPR (result
, all
.function_result_decl
);
3749 SET_DECL_VALUE_EXPR (result
,
3750 build1 (INDIRECT_REF
, TREE_TYPE (result
),
3751 all
.function_result_decl
));
3752 addr
= convert_memory_address (Pmode
, addr
);
3753 x
= gen_rtx_MEM (DECL_MODE (result
), addr
);
3754 set_mem_attributes (x
, result
, 1);
3757 DECL_HAS_VALUE_EXPR_P (result
) = 1;
3759 SET_DECL_RTL (result
, x
);
3762 /* We have aligned all the args, so add space for the pretend args. */
3763 crtl
->args
.pretend_args_size
= all
.pretend_args_size
;
3764 all
.stack_args_size
.constant
+= all
.extra_pretend_bytes
;
3765 crtl
->args
.size
= all
.stack_args_size
.constant
;
3767 /* Adjust function incoming argument size for alignment and
3770 crtl
->args
.size
= MAX (crtl
->args
.size
, all
.reg_parm_stack_space
);
3771 crtl
->args
.size
= CEIL_ROUND (crtl
->args
.size
,
3772 PARM_BOUNDARY
/ BITS_PER_UNIT
);
3774 if (ARGS_GROW_DOWNWARD
)
3776 crtl
->args
.arg_offset_rtx
3777 = (all
.stack_args_size
.var
== 0 ? GEN_INT (-all
.stack_args_size
.constant
)
3778 : expand_expr (size_diffop (all
.stack_args_size
.var
,
3779 size_int (-all
.stack_args_size
.constant
)),
3780 NULL_RTX
, VOIDmode
, EXPAND_NORMAL
));
3783 crtl
->args
.arg_offset_rtx
= ARGS_SIZE_RTX (all
.stack_args_size
);
3785 /* See how many bytes, if any, of its args a function should try to pop
3788 crtl
->args
.pops_args
= targetm
.calls
.return_pops_args (fndecl
,
3792 /* For stdarg.h function, save info about
3793 regs and stack space used by the named args. */
3795 crtl
->args
.info
= all
.args_so_far_v
;
3797 /* Set the rtx used for the function return value. Put this in its
3798 own variable so any optimizers that need this information don't have
3799 to include tree.h. Do this here so it gets done when an inlined
3800 function gets output. */
3803 = (DECL_RTL_SET_P (DECL_RESULT (fndecl
))
3804 ? DECL_RTL (DECL_RESULT (fndecl
)) : NULL_RTX
);
3806 /* If scalar return value was computed in a pseudo-reg, or was a named
3807 return value that got dumped to the stack, copy that to the hard
3809 if (DECL_RTL_SET_P (DECL_RESULT (fndecl
)))
3811 tree decl_result
= DECL_RESULT (fndecl
);
3812 rtx decl_rtl
= DECL_RTL (decl_result
);
3814 if (REG_P (decl_rtl
)
3815 ? REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
3816 : DECL_REGISTER (decl_result
))
3820 real_decl_rtl
= targetm
.calls
.function_value (TREE_TYPE (decl_result
),
3822 if (chkp_function_instrumented_p (fndecl
))
3824 = targetm
.calls
.chkp_function_value_bounds (TREE_TYPE (decl_result
),
3826 REG_FUNCTION_VALUE_P (real_decl_rtl
) = 1;
3827 /* The delay slot scheduler assumes that crtl->return_rtx
3828 holds the hard register containing the return value, not a
3829 temporary pseudo. */
3830 crtl
->return_rtx
= real_decl_rtl
;
3835 /* A subroutine of gimplify_parameters, invoked via walk_tree.
3836 For all seen types, gimplify their sizes. */
3839 gimplify_parm_type (tree
*tp
, int *walk_subtrees
, void *data
)
3846 if (POINTER_TYPE_P (t
))
3848 else if (TYPE_SIZE (t
) && !TREE_CONSTANT (TYPE_SIZE (t
))
3849 && !TYPE_SIZES_GIMPLIFIED (t
))
3851 gimplify_type_sizes (t
, (gimple_seq
*) data
);
3859 /* Gimplify the parameter list for current_function_decl. This involves
3860 evaluating SAVE_EXPRs of variable sized parameters and generating code
3861 to implement callee-copies reference parameters. Returns a sequence of
3862 statements to add to the beginning of the function. */
3865 gimplify_parameters (void)
3867 struct assign_parm_data_all all
;
3869 gimple_seq stmts
= NULL
;
3873 assign_parms_initialize_all (&all
);
3874 fnargs
= assign_parms_augmented_arg_list (&all
);
3876 FOR_EACH_VEC_ELT (fnargs
, i
, parm
)
3878 struct assign_parm_data_one data
;
3880 /* Extract the type of PARM; adjust it according to ABI. */
3881 assign_parm_find_data_types (&all
, parm
, &data
);
3883 /* Early out for errors and void parameters. */
3884 if (data
.passed_mode
== VOIDmode
|| DECL_SIZE (parm
) == NULL
)
3887 /* Update info on where next arg arrives in registers. */
3888 targetm
.calls
.function_arg_advance (all
.args_so_far
, data
.promoted_mode
,
3889 data
.passed_type
, data
.named_arg
);
3891 /* ??? Once upon a time variable_size stuffed parameter list
3892 SAVE_EXPRs (amongst others) onto a pending sizes list. This
3893 turned out to be less than manageable in the gimple world.
3894 Now we have to hunt them down ourselves. */
3895 walk_tree_without_duplicates (&data
.passed_type
,
3896 gimplify_parm_type
, &stmts
);
3898 if (TREE_CODE (DECL_SIZE_UNIT (parm
)) != INTEGER_CST
)
3900 gimplify_one_sizepos (&DECL_SIZE (parm
), &stmts
);
3901 gimplify_one_sizepos (&DECL_SIZE_UNIT (parm
), &stmts
);
3904 if (data
.passed_pointer
)
3906 tree type
= TREE_TYPE (data
.passed_type
);
3907 if (reference_callee_copied (&all
.args_so_far_v
, TYPE_MODE (type
),
3908 type
, data
.named_arg
))
3912 /* For constant-sized objects, this is trivial; for
3913 variable-sized objects, we have to play games. */
3914 if (TREE_CODE (DECL_SIZE_UNIT (parm
)) == INTEGER_CST
3915 && !(flag_stack_check
== GENERIC_STACK_CHECK
3916 && compare_tree_int (DECL_SIZE_UNIT (parm
),
3917 STACK_CHECK_MAX_VAR_SIZE
) > 0))
3919 local
= create_tmp_var (type
, get_name (parm
));
3920 DECL_IGNORED_P (local
) = 0;
3921 /* If PARM was addressable, move that flag over
3922 to the local copy, as its address will be taken,
3923 not the PARMs. Keep the parms address taken
3924 as we'll query that flag during gimplification. */
3925 if (TREE_ADDRESSABLE (parm
))
3926 TREE_ADDRESSABLE (local
) = 1;
3927 else if (TREE_CODE (type
) == COMPLEX_TYPE
3928 || TREE_CODE (type
) == VECTOR_TYPE
)
3929 DECL_GIMPLE_REG_P (local
) = 1;
3933 tree ptr_type
, addr
;
3935 ptr_type
= build_pointer_type (type
);
3936 addr
= create_tmp_reg (ptr_type
, get_name (parm
));
3937 DECL_IGNORED_P (addr
) = 0;
3938 local
= build_fold_indirect_ref (addr
);
3940 t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
3941 t
= build_call_expr (t
, 2, DECL_SIZE_UNIT (parm
),
3942 size_int (DECL_ALIGN (parm
)));
3944 /* The call has been built for a variable-sized object. */
3945 CALL_ALLOCA_FOR_VAR_P (t
) = 1;
3946 t
= fold_convert (ptr_type
, t
);
3947 t
= build2 (MODIFY_EXPR
, TREE_TYPE (addr
), addr
, t
);
3948 gimplify_and_add (t
, &stmts
);
3951 gimplify_assign (local
, parm
, &stmts
);
3953 SET_DECL_VALUE_EXPR (parm
, local
);
3954 DECL_HAS_VALUE_EXPR_P (parm
) = 1;
3964 /* Compute the size and offset from the start of the stacked arguments for a
3965 parm passed in mode PASSED_MODE and with type TYPE.
3967 INITIAL_OFFSET_PTR points to the current offset into the stacked
3970 The starting offset and size for this parm are returned in
3971 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
3972 nonzero, the offset is that of stack slot, which is returned in
3973 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
3974 padding required from the initial offset ptr to the stack slot.
3976 IN_REGS is nonzero if the argument will be passed in registers. It will
3977 never be set if REG_PARM_STACK_SPACE is not defined.
3979 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
3980 for arguments which are passed in registers.
3982 FNDECL is the function in which the argument was defined.
3984 There are two types of rounding that are done. The first, controlled by
3985 TARGET_FUNCTION_ARG_BOUNDARY, forces the offset from the start of the
3986 argument list to be aligned to the specific boundary (in bits). This
3987 rounding affects the initial and starting offsets, but not the argument
3990 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
3991 optionally rounds the size of the parm to PARM_BOUNDARY. The
3992 initial offset is not affected by this rounding, while the size always
3993 is and the starting offset may be. */
3995 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
3996 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
3997 callers pass in the total size of args so far as
3998 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
4001 locate_and_pad_parm (machine_mode passed_mode
, tree type
, int in_regs
,
4002 int reg_parm_stack_space
, int partial
,
4003 tree fndecl ATTRIBUTE_UNUSED
,
4004 struct args_size
*initial_offset_ptr
,
4005 struct locate_and_pad_arg_data
*locate
)
4008 enum direction where_pad
;
4009 unsigned int boundary
, round_boundary
;
4010 int part_size_in_regs
;
4012 /* If we have found a stack parm before we reach the end of the
4013 area reserved for registers, skip that area. */
4016 if (reg_parm_stack_space
> 0)
4018 if (initial_offset_ptr
->var
)
4020 initial_offset_ptr
->var
4021 = size_binop (MAX_EXPR
, ARGS_SIZE_TREE (*initial_offset_ptr
),
4022 ssize_int (reg_parm_stack_space
));
4023 initial_offset_ptr
->constant
= 0;
4025 else if (initial_offset_ptr
->constant
< reg_parm_stack_space
)
4026 initial_offset_ptr
->constant
= reg_parm_stack_space
;
4030 part_size_in_regs
= (reg_parm_stack_space
== 0 ? partial
: 0);
4033 = type
? size_in_bytes (type
) : size_int (GET_MODE_SIZE (passed_mode
));
4034 where_pad
= FUNCTION_ARG_PADDING (passed_mode
, type
);
4035 boundary
= targetm
.calls
.function_arg_boundary (passed_mode
, type
);
4036 round_boundary
= targetm
.calls
.function_arg_round_boundary (passed_mode
,
4038 locate
->where_pad
= where_pad
;
4040 /* Alignment can't exceed MAX_SUPPORTED_STACK_ALIGNMENT. */
4041 if (boundary
> MAX_SUPPORTED_STACK_ALIGNMENT
)
4042 boundary
= MAX_SUPPORTED_STACK_ALIGNMENT
;
4044 locate
->boundary
= boundary
;
4046 if (SUPPORTS_STACK_ALIGNMENT
)
4048 /* stack_alignment_estimated can't change after stack has been
4050 if (crtl
->stack_alignment_estimated
< boundary
)
4052 if (!crtl
->stack_realign_processed
)
4053 crtl
->stack_alignment_estimated
= boundary
;
4056 /* If stack is realigned and stack alignment value
4057 hasn't been finalized, it is OK not to increase
4058 stack_alignment_estimated. The bigger alignment
4059 requirement is recorded in stack_alignment_needed
4061 gcc_assert (!crtl
->stack_realign_finalized
4062 && crtl
->stack_realign_needed
);
4067 /* Remember if the outgoing parameter requires extra alignment on the
4068 calling function side. */
4069 if (crtl
->stack_alignment_needed
< boundary
)
4070 crtl
->stack_alignment_needed
= boundary
;
4071 if (crtl
->preferred_stack_boundary
< boundary
)
4072 crtl
->preferred_stack_boundary
= boundary
;
4074 if (ARGS_GROW_DOWNWARD
)
4076 locate
->slot_offset
.constant
= -initial_offset_ptr
->constant
;
4077 if (initial_offset_ptr
->var
)
4078 locate
->slot_offset
.var
= size_binop (MINUS_EXPR
, ssize_int (0),
4079 initial_offset_ptr
->var
);
4083 if (where_pad
!= none
4084 && (!tree_fits_uhwi_p (sizetree
)
4085 || (tree_to_uhwi (sizetree
) * BITS_PER_UNIT
) % round_boundary
))
4086 s2
= round_up (s2
, round_boundary
/ BITS_PER_UNIT
);
4087 SUB_PARM_SIZE (locate
->slot_offset
, s2
);
4090 locate
->slot_offset
.constant
+= part_size_in_regs
;
4092 if (!in_regs
|| reg_parm_stack_space
> 0)
4093 pad_to_arg_alignment (&locate
->slot_offset
, boundary
,
4094 &locate
->alignment_pad
);
4096 locate
->size
.constant
= (-initial_offset_ptr
->constant
4097 - locate
->slot_offset
.constant
);
4098 if (initial_offset_ptr
->var
)
4099 locate
->size
.var
= size_binop (MINUS_EXPR
,
4100 size_binop (MINUS_EXPR
,
4102 initial_offset_ptr
->var
),
4103 locate
->slot_offset
.var
);
4105 /* Pad_below needs the pre-rounded size to know how much to pad
4107 locate
->offset
= locate
->slot_offset
;
4108 if (where_pad
== downward
)
4109 pad_below (&locate
->offset
, passed_mode
, sizetree
);
4114 if (!in_regs
|| reg_parm_stack_space
> 0)
4115 pad_to_arg_alignment (initial_offset_ptr
, boundary
,
4116 &locate
->alignment_pad
);
4117 locate
->slot_offset
= *initial_offset_ptr
;
4119 #ifdef PUSH_ROUNDING
4120 if (passed_mode
!= BLKmode
)
4121 sizetree
= size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree
)));
4124 /* Pad_below needs the pre-rounded size to know how much to pad below
4125 so this must be done before rounding up. */
4126 locate
->offset
= locate
->slot_offset
;
4127 if (where_pad
== downward
)
4128 pad_below (&locate
->offset
, passed_mode
, sizetree
);
4130 if (where_pad
!= none
4131 && (!tree_fits_uhwi_p (sizetree
)
4132 || (tree_to_uhwi (sizetree
) * BITS_PER_UNIT
) % round_boundary
))
4133 sizetree
= round_up (sizetree
, round_boundary
/ BITS_PER_UNIT
);
4135 ADD_PARM_SIZE (locate
->size
, sizetree
);
4137 locate
->size
.constant
-= part_size_in_regs
;
4140 #ifdef FUNCTION_ARG_OFFSET
4141 locate
->offset
.constant
+= FUNCTION_ARG_OFFSET (passed_mode
, type
);
4145 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
4146 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
4149 pad_to_arg_alignment (struct args_size
*offset_ptr
, int boundary
,
4150 struct args_size
*alignment_pad
)
4152 tree save_var
= NULL_TREE
;
4153 HOST_WIDE_INT save_constant
= 0;
4154 int boundary_in_bytes
= boundary
/ BITS_PER_UNIT
;
4155 HOST_WIDE_INT sp_offset
= STACK_POINTER_OFFSET
;
4157 #ifdef SPARC_STACK_BOUNDARY_HACK
4158 /* ??? The SPARC port may claim a STACK_BOUNDARY higher than
4159 the real alignment of %sp. However, when it does this, the
4160 alignment of %sp+STACK_POINTER_OFFSET is STACK_BOUNDARY. */
4161 if (SPARC_STACK_BOUNDARY_HACK
)
4165 if (boundary
> PARM_BOUNDARY
)
4167 save_var
= offset_ptr
->var
;
4168 save_constant
= offset_ptr
->constant
;
4171 alignment_pad
->var
= NULL_TREE
;
4172 alignment_pad
->constant
= 0;
4174 if (boundary
> BITS_PER_UNIT
)
4176 if (offset_ptr
->var
)
4178 tree sp_offset_tree
= ssize_int (sp_offset
);
4179 tree offset
= size_binop (PLUS_EXPR
,
4180 ARGS_SIZE_TREE (*offset_ptr
),
4183 if (ARGS_GROW_DOWNWARD
)
4184 rounded
= round_down (offset
, boundary
/ BITS_PER_UNIT
);
4186 rounded
= round_up (offset
, boundary
/ BITS_PER_UNIT
);
4188 offset_ptr
->var
= size_binop (MINUS_EXPR
, rounded
, sp_offset_tree
);
4189 /* ARGS_SIZE_TREE includes constant term. */
4190 offset_ptr
->constant
= 0;
4191 if (boundary
> PARM_BOUNDARY
)
4192 alignment_pad
->var
= size_binop (MINUS_EXPR
, offset_ptr
->var
,
4197 offset_ptr
->constant
= -sp_offset
+
4199 ? FLOOR_ROUND (offset_ptr
->constant
+ sp_offset
, boundary_in_bytes
)
4200 : CEIL_ROUND (offset_ptr
->constant
+ sp_offset
, boundary_in_bytes
));
4202 if (boundary
> PARM_BOUNDARY
)
4203 alignment_pad
->constant
= offset_ptr
->constant
- save_constant
;
4209 pad_below (struct args_size
*offset_ptr
, machine_mode passed_mode
, tree sizetree
)
4211 if (passed_mode
!= BLKmode
)
4213 if (GET_MODE_BITSIZE (passed_mode
) % PARM_BOUNDARY
)
4214 offset_ptr
->constant
4215 += (((GET_MODE_BITSIZE (passed_mode
) + PARM_BOUNDARY
- 1)
4216 / PARM_BOUNDARY
* PARM_BOUNDARY
/ BITS_PER_UNIT
)
4217 - GET_MODE_SIZE (passed_mode
));
4221 if (TREE_CODE (sizetree
) != INTEGER_CST
4222 || (TREE_INT_CST_LOW (sizetree
) * BITS_PER_UNIT
) % PARM_BOUNDARY
)
4224 /* Round the size up to multiple of PARM_BOUNDARY bits. */
4225 tree s2
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
4227 ADD_PARM_SIZE (*offset_ptr
, s2
);
4228 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
4234 /* True if register REGNO was alive at a place where `setjmp' was
4235 called and was set more than once or is an argument. Such regs may
4236 be clobbered by `longjmp'. */
4239 regno_clobbered_at_setjmp (bitmap setjmp_crosses
, int regno
)
4241 /* There appear to be cases where some local vars never reach the
4242 backend but have bogus regnos. */
4243 if (regno
>= max_reg_num ())
4246 return ((REG_N_SETS (regno
) > 1
4247 || REGNO_REG_SET_P (df_get_live_out (ENTRY_BLOCK_PTR_FOR_FN (cfun
)),
4249 && REGNO_REG_SET_P (setjmp_crosses
, regno
));
4252 /* Walk the tree of blocks describing the binding levels within a
4253 function and warn about variables the might be killed by setjmp or
4254 vfork. This is done after calling flow_analysis before register
4255 allocation since that will clobber the pseudo-regs to hard
4259 setjmp_vars_warning (bitmap setjmp_crosses
, tree block
)
4263 for (decl
= BLOCK_VARS (block
); decl
; decl
= DECL_CHAIN (decl
))
4265 if (TREE_CODE (decl
) == VAR_DECL
4266 && DECL_RTL_SET_P (decl
)
4267 && REG_P (DECL_RTL (decl
))
4268 && regno_clobbered_at_setjmp (setjmp_crosses
, REGNO (DECL_RTL (decl
))))
4269 warning (OPT_Wclobbered
, "variable %q+D might be clobbered by"
4270 " %<longjmp%> or %<vfork%>", decl
);
4273 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= BLOCK_CHAIN (sub
))
4274 setjmp_vars_warning (setjmp_crosses
, sub
);
4277 /* Do the appropriate part of setjmp_vars_warning
4278 but for arguments instead of local variables. */
4281 setjmp_args_warning (bitmap setjmp_crosses
)
4284 for (decl
= DECL_ARGUMENTS (current_function_decl
);
4285 decl
; decl
= DECL_CHAIN (decl
))
4286 if (DECL_RTL (decl
) != 0
4287 && REG_P (DECL_RTL (decl
))
4288 && regno_clobbered_at_setjmp (setjmp_crosses
, REGNO (DECL_RTL (decl
))))
4289 warning (OPT_Wclobbered
,
4290 "argument %q+D might be clobbered by %<longjmp%> or %<vfork%>",
4294 /* Generate warning messages for variables live across setjmp. */
4297 generate_setjmp_warnings (void)
4299 bitmap setjmp_crosses
= regstat_get_setjmp_crosses ();
4301 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
4302 || bitmap_empty_p (setjmp_crosses
))
4305 setjmp_vars_warning (setjmp_crosses
, DECL_INITIAL (current_function_decl
));
4306 setjmp_args_warning (setjmp_crosses
);
4310 /* Reverse the order of elements in the fragment chain T of blocks,
4311 and return the new head of the chain (old last element).
4312 In addition to that clear BLOCK_SAME_RANGE flags when needed
4313 and adjust BLOCK_SUPERCONTEXT from the super fragment to
4314 its super fragment origin. */
4317 block_fragments_nreverse (tree t
)
4319 tree prev
= 0, block
, next
, prev_super
= 0;
4320 tree super
= BLOCK_SUPERCONTEXT (t
);
4321 if (BLOCK_FRAGMENT_ORIGIN (super
))
4322 super
= BLOCK_FRAGMENT_ORIGIN (super
);
4323 for (block
= t
; block
; block
= next
)
4325 next
= BLOCK_FRAGMENT_CHAIN (block
);
4326 BLOCK_FRAGMENT_CHAIN (block
) = prev
;
4327 if ((prev
&& !BLOCK_SAME_RANGE (prev
))
4328 || (BLOCK_FRAGMENT_CHAIN (BLOCK_SUPERCONTEXT (block
))
4330 BLOCK_SAME_RANGE (block
) = 0;
4331 prev_super
= BLOCK_SUPERCONTEXT (block
);
4332 BLOCK_SUPERCONTEXT (block
) = super
;
4335 t
= BLOCK_FRAGMENT_ORIGIN (t
);
4336 if (BLOCK_FRAGMENT_CHAIN (BLOCK_SUPERCONTEXT (t
))
4338 BLOCK_SAME_RANGE (t
) = 0;
4339 BLOCK_SUPERCONTEXT (t
) = super
;
4343 /* Reverse the order of elements in the chain T of blocks,
4344 and return the new head of the chain (old last element).
4345 Also do the same on subblocks and reverse the order of elements
4346 in BLOCK_FRAGMENT_CHAIN as well. */
4349 blocks_nreverse_all (tree t
)
4351 tree prev
= 0, block
, next
;
4352 for (block
= t
; block
; block
= next
)
4354 next
= BLOCK_CHAIN (block
);
4355 BLOCK_CHAIN (block
) = prev
;
4356 if (BLOCK_FRAGMENT_CHAIN (block
)
4357 && BLOCK_FRAGMENT_ORIGIN (block
) == NULL_TREE
)
4359 BLOCK_FRAGMENT_CHAIN (block
)
4360 = block_fragments_nreverse (BLOCK_FRAGMENT_CHAIN (block
));
4361 if (!BLOCK_SAME_RANGE (BLOCK_FRAGMENT_CHAIN (block
)))
4362 BLOCK_SAME_RANGE (block
) = 0;
4364 BLOCK_SUBBLOCKS (block
) = blocks_nreverse_all (BLOCK_SUBBLOCKS (block
));
4371 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
4372 and create duplicate blocks. */
4373 /* ??? Need an option to either create block fragments or to create
4374 abstract origin duplicates of a source block. It really depends
4375 on what optimization has been performed. */
4378 reorder_blocks (void)
4380 tree block
= DECL_INITIAL (current_function_decl
);
4382 if (block
== NULL_TREE
)
4385 auto_vec
<tree
, 10> block_stack
;
4387 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
4388 clear_block_marks (block
);
4390 /* Prune the old trees away, so that they don't get in the way. */
4391 BLOCK_SUBBLOCKS (block
) = NULL_TREE
;
4392 BLOCK_CHAIN (block
) = NULL_TREE
;
4394 /* Recreate the block tree from the note nesting. */
4395 reorder_blocks_1 (get_insns (), block
, &block_stack
);
4396 BLOCK_SUBBLOCKS (block
) = blocks_nreverse_all (BLOCK_SUBBLOCKS (block
));
4399 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
4402 clear_block_marks (tree block
)
4406 TREE_ASM_WRITTEN (block
) = 0;
4407 clear_block_marks (BLOCK_SUBBLOCKS (block
));
4408 block
= BLOCK_CHAIN (block
);
4413 reorder_blocks_1 (rtx_insn
*insns
, tree current_block
,
4414 vec
<tree
> *p_block_stack
)
4417 tree prev_beg
= NULL_TREE
, prev_end
= NULL_TREE
;
4419 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
4423 if (NOTE_KIND (insn
) == NOTE_INSN_BLOCK_BEG
)
4425 tree block
= NOTE_BLOCK (insn
);
4428 gcc_assert (BLOCK_FRAGMENT_ORIGIN (block
) == NULL_TREE
);
4432 BLOCK_SAME_RANGE (prev_end
) = 0;
4433 prev_end
= NULL_TREE
;
4435 /* If we have seen this block before, that means it now
4436 spans multiple address regions. Create a new fragment. */
4437 if (TREE_ASM_WRITTEN (block
))
4439 tree new_block
= copy_node (block
);
4441 BLOCK_SAME_RANGE (new_block
) = 0;
4442 BLOCK_FRAGMENT_ORIGIN (new_block
) = origin
;
4443 BLOCK_FRAGMENT_CHAIN (new_block
)
4444 = BLOCK_FRAGMENT_CHAIN (origin
);
4445 BLOCK_FRAGMENT_CHAIN (origin
) = new_block
;
4447 NOTE_BLOCK (insn
) = new_block
;
4451 if (prev_beg
== current_block
&& prev_beg
)
4452 BLOCK_SAME_RANGE (block
) = 1;
4456 BLOCK_SUBBLOCKS (block
) = 0;
4457 TREE_ASM_WRITTEN (block
) = 1;
4458 /* When there's only one block for the entire function,
4459 current_block == block and we mustn't do this, it
4460 will cause infinite recursion. */
4461 if (block
!= current_block
)
4464 if (block
!= origin
)
4465 gcc_assert (BLOCK_SUPERCONTEXT (origin
) == current_block
4466 || BLOCK_FRAGMENT_ORIGIN (BLOCK_SUPERCONTEXT
4469 if (p_block_stack
->is_empty ())
4470 super
= current_block
;
4473 super
= p_block_stack
->last ();
4474 gcc_assert (super
== current_block
4475 || BLOCK_FRAGMENT_ORIGIN (super
)
4478 BLOCK_SUPERCONTEXT (block
) = super
;
4479 BLOCK_CHAIN (block
) = BLOCK_SUBBLOCKS (current_block
);
4480 BLOCK_SUBBLOCKS (current_block
) = block
;
4481 current_block
= origin
;
4483 p_block_stack
->safe_push (block
);
4485 else if (NOTE_KIND (insn
) == NOTE_INSN_BLOCK_END
)
4487 NOTE_BLOCK (insn
) = p_block_stack
->pop ();
4488 current_block
= BLOCK_SUPERCONTEXT (current_block
);
4489 if (BLOCK_FRAGMENT_ORIGIN (current_block
))
4490 current_block
= BLOCK_FRAGMENT_ORIGIN (current_block
);
4491 prev_beg
= NULL_TREE
;
4492 prev_end
= BLOCK_SAME_RANGE (NOTE_BLOCK (insn
))
4493 ? NOTE_BLOCK (insn
) : NULL_TREE
;
4498 prev_beg
= NULL_TREE
;
4500 BLOCK_SAME_RANGE (prev_end
) = 0;
4501 prev_end
= NULL_TREE
;
4506 /* Reverse the order of elements in the chain T of blocks,
4507 and return the new head of the chain (old last element). */
4510 blocks_nreverse (tree t
)
4512 tree prev
= 0, block
, next
;
4513 for (block
= t
; block
; block
= next
)
4515 next
= BLOCK_CHAIN (block
);
4516 BLOCK_CHAIN (block
) = prev
;
4522 /* Concatenate two chains of blocks (chained through BLOCK_CHAIN)
4523 by modifying the last node in chain 1 to point to chain 2. */
4526 block_chainon (tree op1
, tree op2
)
4535 for (t1
= op1
; BLOCK_CHAIN (t1
); t1
= BLOCK_CHAIN (t1
))
4537 BLOCK_CHAIN (t1
) = op2
;
4539 #ifdef ENABLE_TREE_CHECKING
4542 for (t2
= op2
; t2
; t2
= BLOCK_CHAIN (t2
))
4543 gcc_assert (t2
!= t1
);
4550 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
4551 non-NULL, list them all into VECTOR, in a depth-first preorder
4552 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
4556 all_blocks (tree block
, tree
*vector
)
4562 TREE_ASM_WRITTEN (block
) = 0;
4564 /* Record this block. */
4566 vector
[n_blocks
] = block
;
4570 /* Record the subblocks, and their subblocks... */
4571 n_blocks
+= all_blocks (BLOCK_SUBBLOCKS (block
),
4572 vector
? vector
+ n_blocks
: 0);
4573 block
= BLOCK_CHAIN (block
);
4579 /* Return a vector containing all the blocks rooted at BLOCK. The
4580 number of elements in the vector is stored in N_BLOCKS_P. The
4581 vector is dynamically allocated; it is the caller's responsibility
4582 to call `free' on the pointer returned. */
4585 get_block_vector (tree block
, int *n_blocks_p
)
4589 *n_blocks_p
= all_blocks (block
, NULL
);
4590 block_vector
= XNEWVEC (tree
, *n_blocks_p
);
4591 all_blocks (block
, block_vector
);
4593 return block_vector
;
4596 static GTY(()) int next_block_index
= 2;
4598 /* Set BLOCK_NUMBER for all the blocks in FN. */
4601 number_blocks (tree fn
)
4607 /* For SDB and XCOFF debugging output, we start numbering the blocks
4608 from 1 within each function, rather than keeping a running
4610 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
4611 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
4612 next_block_index
= 1;
4615 block_vector
= get_block_vector (DECL_INITIAL (fn
), &n_blocks
);
4617 /* The top-level BLOCK isn't numbered at all. */
4618 for (i
= 1; i
< n_blocks
; ++i
)
4619 /* We number the blocks from two. */
4620 BLOCK_NUMBER (block_vector
[i
]) = next_block_index
++;
4622 free (block_vector
);
4627 /* If VAR is present in a subblock of BLOCK, return the subblock. */
4630 debug_find_var_in_block_tree (tree var
, tree block
)
4634 for (t
= BLOCK_VARS (block
); t
; t
= TREE_CHAIN (t
))
4638 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= TREE_CHAIN (t
))
4640 tree ret
= debug_find_var_in_block_tree (var
, t
);
4648 /* Keep track of whether we're in a dummy function context. If we are,
4649 we don't want to invoke the set_current_function hook, because we'll
4650 get into trouble if the hook calls target_reinit () recursively or
4651 when the initial initialization is not yet complete. */
4653 static bool in_dummy_function
;
4655 /* Invoke the target hook when setting cfun. Update the optimization options
4656 if the function uses different options than the default. */
4659 invoke_set_current_function_hook (tree fndecl
)
4661 if (!in_dummy_function
)
4663 tree opts
= ((fndecl
)
4664 ? DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
)
4665 : optimization_default_node
);
4668 opts
= optimization_default_node
;
4670 /* Change optimization options if needed. */
4671 if (optimization_current_node
!= opts
)
4673 optimization_current_node
= opts
;
4674 cl_optimization_restore (&global_options
, TREE_OPTIMIZATION (opts
));
4677 targetm
.set_current_function (fndecl
);
4678 this_fn_optabs
= this_target_optabs
;
4680 if (opts
!= optimization_default_node
)
4682 init_tree_optimization_optabs (opts
);
4683 if (TREE_OPTIMIZATION_OPTABS (opts
))
4684 this_fn_optabs
= (struct target_optabs
*)
4685 TREE_OPTIMIZATION_OPTABS (opts
);
4690 /* cfun should never be set directly; use this function. */
4693 set_cfun (struct function
*new_cfun
)
4695 if (cfun
!= new_cfun
)
4698 invoke_set_current_function_hook (new_cfun
? new_cfun
->decl
: NULL_TREE
);
4702 /* Initialized with NOGC, making this poisonous to the garbage collector. */
4704 static vec
<function_p
> cfun_stack
;
4706 /* Push the current cfun onto the stack, and set cfun to new_cfun. Also set
4707 current_function_decl accordingly. */
4710 push_cfun (struct function
*new_cfun
)
4712 gcc_assert ((!cfun
&& !current_function_decl
)
4713 || (cfun
&& current_function_decl
== cfun
->decl
));
4714 cfun_stack
.safe_push (cfun
);
4715 current_function_decl
= new_cfun
? new_cfun
->decl
: NULL_TREE
;
4716 set_cfun (new_cfun
);
4719 /* Pop cfun from the stack. Also set current_function_decl accordingly. */
4724 struct function
*new_cfun
= cfun_stack
.pop ();
4725 /* When in_dummy_function, we do have a cfun but current_function_decl is
4726 NULL. We also allow pushing NULL cfun and subsequently changing
4727 current_function_decl to something else and have both restored by
4729 gcc_checking_assert (in_dummy_function
4731 || current_function_decl
== cfun
->decl
);
4732 set_cfun (new_cfun
);
4733 current_function_decl
= new_cfun
? new_cfun
->decl
: NULL_TREE
;
4736 /* Return value of funcdef and increase it. */
4738 get_next_funcdef_no (void)
4740 return funcdef_no
++;
4743 /* Return value of funcdef. */
4745 get_last_funcdef_no (void)
4750 /* Allocate a function structure for FNDECL and set its contents
4751 to the defaults. Set cfun to the newly-allocated object.
4752 Some of the helper functions invoked during initialization assume
4753 that cfun has already been set. Therefore, assign the new object
4754 directly into cfun and invoke the back end hook explicitly at the
4755 very end, rather than initializing a temporary and calling set_cfun
4758 ABSTRACT_P is true if this is a function that will never be seen by
4759 the middle-end. Such functions are front-end concepts (like C++
4760 function templates) that do not correspond directly to functions
4761 placed in object files. */
4764 allocate_struct_function (tree fndecl
, bool abstract_p
)
4766 tree fntype
= fndecl
? TREE_TYPE (fndecl
) : NULL_TREE
;
4768 cfun
= ggc_cleared_alloc
<function
> ();
4770 init_eh_for_function ();
4772 if (init_machine_status
)
4773 cfun
->machine
= (*init_machine_status
) ();
4775 #ifdef OVERRIDE_ABI_FORMAT
4776 OVERRIDE_ABI_FORMAT (fndecl
);
4779 if (fndecl
!= NULL_TREE
)
4781 DECL_STRUCT_FUNCTION (fndecl
) = cfun
;
4782 cfun
->decl
= fndecl
;
4783 current_function_funcdef_no
= get_next_funcdef_no ();
4786 invoke_set_current_function_hook (fndecl
);
4788 if (fndecl
!= NULL_TREE
)
4790 tree result
= DECL_RESULT (fndecl
);
4791 if (!abstract_p
&& aggregate_value_p (result
, fndecl
))
4793 #ifdef PCC_STATIC_STRUCT_RETURN
4794 cfun
->returns_pcc_struct
= 1;
4796 cfun
->returns_struct
= 1;
4799 cfun
->stdarg
= stdarg_p (fntype
);
4801 /* Assume all registers in stdarg functions need to be saved. */
4802 cfun
->va_list_gpr_size
= VA_LIST_MAX_GPR_SIZE
;
4803 cfun
->va_list_fpr_size
= VA_LIST_MAX_FPR_SIZE
;
4805 /* ??? This could be set on a per-function basis by the front-end
4806 but is this worth the hassle? */
4807 cfun
->can_throw_non_call_exceptions
= flag_non_call_exceptions
;
4808 cfun
->can_delete_dead_exceptions
= flag_delete_dead_exceptions
;
4810 if (!profile_flag
&& !flag_instrument_function_entry_exit
)
4811 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
) = 1;
4815 /* This is like allocate_struct_function, but pushes a new cfun for FNDECL
4816 instead of just setting it. */
4819 push_struct_function (tree fndecl
)
4821 /* When in_dummy_function we might be in the middle of a pop_cfun and
4822 current_function_decl and cfun may not match. */
4823 gcc_assert (in_dummy_function
4824 || (!cfun
&& !current_function_decl
)
4825 || (cfun
&& current_function_decl
== cfun
->decl
));
4826 cfun_stack
.safe_push (cfun
);
4827 current_function_decl
= fndecl
;
4828 allocate_struct_function (fndecl
, false);
4831 /* Reset crtl and other non-struct-function variables to defaults as
4832 appropriate for emitting rtl at the start of a function. */
4835 prepare_function_start (void)
4837 gcc_assert (!get_last_insn ());
4840 init_varasm_status ();
4842 default_rtl_profile ();
4844 if (flag_stack_usage_info
)
4846 cfun
->su
= ggc_cleared_alloc
<stack_usage
> ();
4847 cfun
->su
->static_stack_size
= -1;
4850 cse_not_expected
= ! optimize
;
4852 /* Caller save not needed yet. */
4853 caller_save_needed
= 0;
4855 /* We haven't done register allocation yet. */
4858 /* Indicate that we have not instantiated virtual registers yet. */
4859 virtuals_instantiated
= 0;
4861 /* Indicate that we want CONCATs now. */
4862 generating_concat_p
= 1;
4864 /* Indicate we have no need of a frame pointer yet. */
4865 frame_pointer_needed
= 0;
4869 push_dummy_function (bool with_decl
)
4871 tree fn_decl
, fn_type
, fn_result_decl
;
4873 gcc_assert (!in_dummy_function
);
4874 in_dummy_function
= true;
4878 fn_type
= build_function_type_list (void_type_node
, NULL_TREE
);
4879 fn_decl
= build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
, NULL_TREE
,
4881 fn_result_decl
= build_decl (UNKNOWN_LOCATION
, RESULT_DECL
,
4882 NULL_TREE
, void_type_node
);
4883 DECL_RESULT (fn_decl
) = fn_result_decl
;
4886 fn_decl
= NULL_TREE
;
4888 push_struct_function (fn_decl
);
4891 /* Initialize the rtl expansion mechanism so that we can do simple things
4892 like generate sequences. This is used to provide a context during global
4893 initialization of some passes. You must call expand_dummy_function_end
4894 to exit this context. */
4897 init_dummy_function_start (void)
4899 push_dummy_function (false);
4900 prepare_function_start ();
4903 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
4904 and initialize static variables for generating RTL for the statements
4908 init_function_start (tree subr
)
4910 if (subr
&& DECL_STRUCT_FUNCTION (subr
))
4911 set_cfun (DECL_STRUCT_FUNCTION (subr
));
4913 allocate_struct_function (subr
, false);
4915 /* Initialize backend, if needed. */
4918 prepare_function_start ();
4919 decide_function_section (subr
);
4921 /* Warn if this value is an aggregate type,
4922 regardless of which calling convention we are using for it. */
4923 if (AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr
))))
4924 warning (OPT_Waggregate_return
, "function returns an aggregate");
4927 /* Expand code to verify the stack_protect_guard. This is invoked at
4928 the end of a function to be protected. */
4930 #ifndef HAVE_stack_protect_test
4931 # define HAVE_stack_protect_test 0
4932 # define gen_stack_protect_test(x, y, z) (gcc_unreachable (), NULL_RTX)
4936 stack_protect_epilogue (void)
4938 tree guard_decl
= targetm
.stack_protect_guard ();
4939 rtx_code_label
*label
= gen_label_rtx ();
4942 x
= expand_normal (crtl
->stack_protect_guard
);
4943 y
= expand_normal (guard_decl
);
4945 /* Allow the target to compare Y with X without leaking either into
4947 switch ((int) (HAVE_stack_protect_test
!= 0))
4950 tmp
= gen_stack_protect_test (x
, y
, label
);
4959 emit_cmp_and_jump_insns (x
, y
, EQ
, NULL_RTX
, ptr_mode
, 1, label
);
4963 /* The noreturn predictor has been moved to the tree level. The rtl-level
4964 predictors estimate this branch about 20%, which isn't enough to get
4965 things moved out of line. Since this is the only extant case of adding
4966 a noreturn function at the rtl level, it doesn't seem worth doing ought
4967 except adding the prediction by hand. */
4968 tmp
= get_last_insn ();
4970 predict_insn_def (as_a
<rtx_insn
*> (tmp
), PRED_NORETURN
, TAKEN
);
4972 expand_call (targetm
.stack_protect_fail (), NULL_RTX
, /*ignore=*/true);
4977 /* Start the RTL for a new function, and set variables used for
4979 SUBR is the FUNCTION_DECL node.
4980 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
4981 the function's parameters, which must be run at any return statement. */
4984 expand_function_start (tree subr
)
4986 /* Make sure volatile mem refs aren't considered
4987 valid operands of arithmetic insns. */
4988 init_recog_no_volatile ();
4992 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr
));
4995 = (stack_limit_rtx
!= NULL_RTX
&& ! DECL_NO_LIMIT_STACK (subr
));
4997 /* Make the label for return statements to jump to. Do not special
4998 case machines with special return instructions -- they will be
4999 handled later during jump, ifcvt, or epilogue creation. */
5000 return_label
= gen_label_rtx ();
5002 /* Initialize rtx used to return the value. */
5003 /* Do this before assign_parms so that we copy the struct value address
5004 before any library calls that assign parms might generate. */
5006 /* Decide whether to return the value in memory or in a register. */
5007 if (aggregate_value_p (DECL_RESULT (subr
), subr
))
5009 /* Returning something that won't go in a register. */
5010 rtx value_address
= 0;
5012 #ifdef PCC_STATIC_STRUCT_RETURN
5013 if (cfun
->returns_pcc_struct
)
5015 int size
= int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr
)));
5016 value_address
= assemble_static_space (size
);
5021 rtx sv
= targetm
.calls
.struct_value_rtx (TREE_TYPE (subr
), 2);
5022 /* Expect to be passed the address of a place to store the value.
5023 If it is passed as an argument, assign_parms will take care of
5027 value_address
= gen_reg_rtx (Pmode
);
5028 emit_move_insn (value_address
, sv
);
5033 rtx x
= value_address
;
5034 if (!DECL_BY_REFERENCE (DECL_RESULT (subr
)))
5036 x
= gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr
)), x
);
5037 set_mem_attributes (x
, DECL_RESULT (subr
), 1);
5039 SET_DECL_RTL (DECL_RESULT (subr
), x
);
5042 else if (DECL_MODE (DECL_RESULT (subr
)) == VOIDmode
)
5043 /* If return mode is void, this decl rtl should not be used. */
5044 SET_DECL_RTL (DECL_RESULT (subr
), NULL_RTX
);
5047 /* Compute the return values into a pseudo reg, which we will copy
5048 into the true return register after the cleanups are done. */
5049 tree return_type
= TREE_TYPE (DECL_RESULT (subr
));
5050 if (TYPE_MODE (return_type
) != BLKmode
5051 && targetm
.calls
.return_in_msb (return_type
))
5052 /* expand_function_end will insert the appropriate padding in
5053 this case. Use the return value's natural (unpadded) mode
5054 within the function proper. */
5055 SET_DECL_RTL (DECL_RESULT (subr
),
5056 gen_reg_rtx (TYPE_MODE (return_type
)));
5059 /* In order to figure out what mode to use for the pseudo, we
5060 figure out what the mode of the eventual return register will
5061 actually be, and use that. */
5062 rtx hard_reg
= hard_function_value (return_type
, subr
, 0, 1);
5064 /* Structures that are returned in registers are not
5065 aggregate_value_p, so we may see a PARALLEL or a REG. */
5066 if (REG_P (hard_reg
))
5067 SET_DECL_RTL (DECL_RESULT (subr
),
5068 gen_reg_rtx (GET_MODE (hard_reg
)));
5071 gcc_assert (GET_CODE (hard_reg
) == PARALLEL
);
5072 SET_DECL_RTL (DECL_RESULT (subr
), gen_group_rtx (hard_reg
));
5076 /* Set DECL_REGISTER flag so that expand_function_end will copy the
5077 result to the real return register(s). */
5078 DECL_REGISTER (DECL_RESULT (subr
)) = 1;
5080 if (chkp_function_instrumented_p (current_function_decl
))
5082 tree return_type
= TREE_TYPE (DECL_RESULT (subr
));
5083 rtx bounds
= targetm
.calls
.chkp_function_value_bounds (return_type
,
5085 SET_DECL_BOUNDS_RTL (DECL_RESULT (subr
), bounds
);
5089 /* Initialize rtx for parameters and local variables.
5090 In some cases this requires emitting insns. */
5091 assign_parms (subr
);
5093 /* If function gets a static chain arg, store it. */
5094 if (cfun
->static_chain_decl
)
5096 tree parm
= cfun
->static_chain_decl
;
5097 rtx local
, chain
, insn
;
5099 local
= gen_reg_rtx (Pmode
);
5100 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
5102 set_decl_incoming_rtl (parm
, chain
, false);
5103 SET_DECL_RTL (parm
, local
);
5104 mark_reg_pointer (local
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
))));
5106 insn
= emit_move_insn (local
, chain
);
5108 /* Mark the register as eliminable, similar to parameters. */
5110 && reg_mentioned_p (arg_pointer_rtx
, XEXP (chain
, 0)))
5111 set_dst_reg_note (insn
, REG_EQUIV
, chain
, local
);
5113 /* If we aren't optimizing, save the static chain onto the stack. */
5116 tree saved_static_chain_decl
5117 = build_decl (DECL_SOURCE_LOCATION (parm
), VAR_DECL
,
5118 DECL_NAME (parm
), TREE_TYPE (parm
));
5119 rtx saved_static_chain_rtx
5120 = assign_stack_local (Pmode
, GET_MODE_SIZE (Pmode
), 0);
5121 SET_DECL_RTL (saved_static_chain_decl
, saved_static_chain_rtx
);
5122 emit_move_insn (saved_static_chain_rtx
, chain
);
5123 SET_DECL_VALUE_EXPR (parm
, saved_static_chain_decl
);
5124 DECL_HAS_VALUE_EXPR_P (parm
) = 1;
5128 /* If the function receives a non-local goto, then store the
5129 bits we need to restore the frame pointer. */
5130 if (cfun
->nonlocal_goto_save_area
)
5135 tree var
= TREE_OPERAND (cfun
->nonlocal_goto_save_area
, 0);
5136 gcc_assert (DECL_RTL_SET_P (var
));
5138 t_save
= build4 (ARRAY_REF
,
5139 TREE_TYPE (TREE_TYPE (cfun
->nonlocal_goto_save_area
)),
5140 cfun
->nonlocal_goto_save_area
,
5141 integer_zero_node
, NULL_TREE
, NULL_TREE
);
5142 r_save
= expand_expr (t_save
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
5143 gcc_assert (GET_MODE (r_save
) == Pmode
);
5145 emit_move_insn (r_save
, targetm
.builtin_setjmp_frame_value ());
5146 update_nonlocal_goto_save_area ();
5149 /* The following was moved from init_function_start.
5150 The move is supposed to make sdb output more accurate. */
5151 /* Indicate the beginning of the function body,
5152 as opposed to parm setup. */
5153 emit_note (NOTE_INSN_FUNCTION_BEG
);
5155 gcc_assert (NOTE_P (get_last_insn ()));
5157 parm_birth_insn
= get_last_insn ();
5162 PROFILE_HOOK (current_function_funcdef_no
);
5166 /* If we are doing generic stack checking, the probe should go here. */
5167 if (flag_stack_check
== GENERIC_STACK_CHECK
)
5168 stack_check_probe_note
= emit_note (NOTE_INSN_DELETED
);
5172 pop_dummy_function (void)
5175 in_dummy_function
= false;
5178 /* Undo the effects of init_dummy_function_start. */
5180 expand_dummy_function_end (void)
5182 gcc_assert (in_dummy_function
);
5184 /* End any sequences that failed to be closed due to syntax errors. */
5185 while (in_sequence_p ())
5188 /* Outside function body, can't compute type's actual size
5189 until next function's body starts. */
5191 free_after_parsing (cfun
);
5192 free_after_compilation (cfun
);
5193 pop_dummy_function ();
5196 /* Helper for diddle_return_value. */
5199 diddle_return_value_1 (void (*doit
) (rtx
, void *), void *arg
, rtx outgoing
)
5204 if (REG_P (outgoing
))
5205 (*doit
) (outgoing
, arg
);
5206 else if (GET_CODE (outgoing
) == PARALLEL
)
5210 for (i
= 0; i
< XVECLEN (outgoing
, 0); i
++)
5212 rtx x
= XEXP (XVECEXP (outgoing
, 0, i
), 0);
5214 if (REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
)
5220 /* Call DOIT for each hard register used as a return value from
5221 the current function. */
5224 diddle_return_value (void (*doit
) (rtx
, void *), void *arg
)
5226 diddle_return_value_1 (doit
, arg
, crtl
->return_rtx
);
5227 diddle_return_value_1 (doit
, arg
, crtl
->return_bnd
);
5231 do_clobber_return_reg (rtx reg
, void *arg ATTRIBUTE_UNUSED
)
5237 clobber_return_register (void)
5239 diddle_return_value (do_clobber_return_reg
, NULL
);
5241 /* In case we do use pseudo to return value, clobber it too. */
5242 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
5244 tree decl_result
= DECL_RESULT (current_function_decl
);
5245 rtx decl_rtl
= DECL_RTL (decl_result
);
5246 if (REG_P (decl_rtl
) && REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
)
5248 do_clobber_return_reg (decl_rtl
, NULL
);
5254 do_use_return_reg (rtx reg
, void *arg ATTRIBUTE_UNUSED
)
5260 use_return_register (void)
5262 diddle_return_value (do_use_return_reg
, NULL
);
5265 /* Possibly warn about unused parameters. */
5267 do_warn_unused_parameter (tree fn
)
5271 for (decl
= DECL_ARGUMENTS (fn
);
5272 decl
; decl
= DECL_CHAIN (decl
))
5273 if (!TREE_USED (decl
) && TREE_CODE (decl
) == PARM_DECL
5274 && DECL_NAME (decl
) && !DECL_ARTIFICIAL (decl
)
5275 && !TREE_NO_WARNING (decl
))
5276 warning (OPT_Wunused_parameter
, "unused parameter %q+D", decl
);
5279 /* Set the location of the insn chain starting at INSN to LOC. */
5282 set_insn_locations (rtx_insn
*insn
, int loc
)
5284 while (insn
!= NULL
)
5287 INSN_LOCATION (insn
) = loc
;
5288 insn
= NEXT_INSN (insn
);
5292 /* Generate RTL for the end of the current function. */
5295 expand_function_end (void)
5299 /* If arg_pointer_save_area was referenced only from a nested
5300 function, we will not have initialized it yet. Do that now. */
5301 if (arg_pointer_save_area
&& ! crtl
->arg_pointer_save_area_init
)
5302 get_arg_pointer_save_area ();
5304 /* If we are doing generic stack checking and this function makes calls,
5305 do a stack probe at the start of the function to ensure we have enough
5306 space for another stack frame. */
5307 if (flag_stack_check
== GENERIC_STACK_CHECK
)
5309 rtx_insn
*insn
, *seq
;
5311 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
5314 rtx max_frame_size
= GEN_INT (STACK_CHECK_MAX_FRAME_SIZE
);
5316 if (STACK_CHECK_MOVING_SP
)
5317 anti_adjust_stack_and_probe (max_frame_size
, true);
5319 probe_stack_range (STACK_OLD_CHECK_PROTECT
, max_frame_size
);
5322 set_insn_locations (seq
, prologue_location
);
5323 emit_insn_before (seq
, stack_check_probe_note
);
5328 /* End any sequences that failed to be closed due to syntax errors. */
5329 while (in_sequence_p ())
5332 clear_pending_stack_adjust ();
5333 do_pending_stack_adjust ();
5335 /* Output a linenumber for the end of the function.
5336 SDB depends on this. */
5337 set_curr_insn_location (input_location
);
5339 /* Before the return label (if any), clobber the return
5340 registers so that they are not propagated live to the rest of
5341 the function. This can only happen with functions that drop
5342 through; if there had been a return statement, there would
5343 have either been a return rtx, or a jump to the return label.
5345 We delay actual code generation after the current_function_value_rtx
5347 clobber_after
= get_last_insn ();
5349 /* Output the label for the actual return from the function. */
5350 emit_label (return_label
);
5352 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
5354 /* Let except.c know where it should emit the call to unregister
5355 the function context for sjlj exceptions. */
5356 if (flag_exceptions
)
5357 sjlj_emit_function_exit_after (get_last_insn ());
5361 /* We want to ensure that instructions that may trap are not
5362 moved into the epilogue by scheduling, because we don't
5363 always emit unwind information for the epilogue. */
5364 if (cfun
->can_throw_non_call_exceptions
)
5365 emit_insn (gen_blockage ());
5368 /* If this is an implementation of throw, do what's necessary to
5369 communicate between __builtin_eh_return and the epilogue. */
5370 expand_eh_return ();
5372 /* If scalar return value was computed in a pseudo-reg, or was a named
5373 return value that got dumped to the stack, copy that to the hard
5375 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
5377 tree decl_result
= DECL_RESULT (current_function_decl
);
5378 rtx decl_rtl
= DECL_RTL (decl_result
);
5380 if (REG_P (decl_rtl
)
5381 ? REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
5382 : DECL_REGISTER (decl_result
))
5384 rtx real_decl_rtl
= crtl
->return_rtx
;
5386 /* This should be set in assign_parms. */
5387 gcc_assert (REG_FUNCTION_VALUE_P (real_decl_rtl
));
5389 /* If this is a BLKmode structure being returned in registers,
5390 then use the mode computed in expand_return. Note that if
5391 decl_rtl is memory, then its mode may have been changed,
5392 but that crtl->return_rtx has not. */
5393 if (GET_MODE (real_decl_rtl
) == BLKmode
)
5394 PUT_MODE (real_decl_rtl
, GET_MODE (decl_rtl
));
5396 /* If a non-BLKmode return value should be padded at the least
5397 significant end of the register, shift it left by the appropriate
5398 amount. BLKmode results are handled using the group load/store
5400 if (TYPE_MODE (TREE_TYPE (decl_result
)) != BLKmode
5401 && REG_P (real_decl_rtl
)
5402 && targetm
.calls
.return_in_msb (TREE_TYPE (decl_result
)))
5404 emit_move_insn (gen_rtx_REG (GET_MODE (decl_rtl
),
5405 REGNO (real_decl_rtl
)),
5407 shift_return_value (GET_MODE (decl_rtl
), true, real_decl_rtl
);
5409 /* If a named return value dumped decl_return to memory, then
5410 we may need to re-do the PROMOTE_MODE signed/unsigned
5412 else if (GET_MODE (real_decl_rtl
) != GET_MODE (decl_rtl
))
5414 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (decl_result
));
5415 promote_function_mode (TREE_TYPE (decl_result
),
5416 GET_MODE (decl_rtl
), &unsignedp
,
5417 TREE_TYPE (current_function_decl
), 1);
5419 convert_move (real_decl_rtl
, decl_rtl
, unsignedp
);
5421 else if (GET_CODE (real_decl_rtl
) == PARALLEL
)
5423 /* If expand_function_start has created a PARALLEL for decl_rtl,
5424 move the result to the real return registers. Otherwise, do
5425 a group load from decl_rtl for a named return. */
5426 if (GET_CODE (decl_rtl
) == PARALLEL
)
5427 emit_group_move (real_decl_rtl
, decl_rtl
);
5429 emit_group_load (real_decl_rtl
, decl_rtl
,
5430 TREE_TYPE (decl_result
),
5431 int_size_in_bytes (TREE_TYPE (decl_result
)));
5433 /* In the case of complex integer modes smaller than a word, we'll
5434 need to generate some non-trivial bitfield insertions. Do that
5435 on a pseudo and not the hard register. */
5436 else if (GET_CODE (decl_rtl
) == CONCAT
5437 && GET_MODE_CLASS (GET_MODE (decl_rtl
)) == MODE_COMPLEX_INT
5438 && GET_MODE_BITSIZE (GET_MODE (decl_rtl
)) <= BITS_PER_WORD
)
5440 int old_generating_concat_p
;
5443 old_generating_concat_p
= generating_concat_p
;
5444 generating_concat_p
= 0;
5445 tmp
= gen_reg_rtx (GET_MODE (decl_rtl
));
5446 generating_concat_p
= old_generating_concat_p
;
5448 emit_move_insn (tmp
, decl_rtl
);
5449 emit_move_insn (real_decl_rtl
, tmp
);
5452 emit_move_insn (real_decl_rtl
, decl_rtl
);
5456 /* If returning a structure, arrange to return the address of the value
5457 in a place where debuggers expect to find it.
5459 If returning a structure PCC style,
5460 the caller also depends on this value.
5461 And cfun->returns_pcc_struct is not necessarily set. */
5462 if ((cfun
->returns_struct
|| cfun
->returns_pcc_struct
)
5463 && !targetm
.calls
.omit_struct_return_reg
)
5465 rtx value_address
= DECL_RTL (DECL_RESULT (current_function_decl
));
5466 tree type
= TREE_TYPE (DECL_RESULT (current_function_decl
));
5469 if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl
)))
5470 type
= TREE_TYPE (type
);
5472 value_address
= XEXP (value_address
, 0);
5474 outgoing
= targetm
.calls
.function_value (build_pointer_type (type
),
5475 current_function_decl
, true);
5477 /* Mark this as a function return value so integrate will delete the
5478 assignment and USE below when inlining this function. */
5479 REG_FUNCTION_VALUE_P (outgoing
) = 1;
5481 /* The address may be ptr_mode and OUTGOING may be Pmode. */
5482 value_address
= convert_memory_address (GET_MODE (outgoing
),
5485 emit_move_insn (outgoing
, value_address
);
5487 /* Show return register used to hold result (in this case the address
5489 crtl
->return_rtx
= outgoing
;
5492 /* Emit the actual code to clobber return register. Don't emit
5493 it if clobber_after is a barrier, then the previous basic block
5494 certainly doesn't fall thru into the exit block. */
5495 if (!BARRIER_P (clobber_after
))
5500 clobber_return_register ();
5504 emit_insn_after (seq
, clobber_after
);
5507 /* Output the label for the naked return from the function. */
5508 if (naked_return_label
)
5509 emit_label (naked_return_label
);
5511 /* @@@ This is a kludge. We want to ensure that instructions that
5512 may trap are not moved into the epilogue by scheduling, because
5513 we don't always emit unwind information for the epilogue. */
5514 if (cfun
->can_throw_non_call_exceptions
5515 && targetm_common
.except_unwind_info (&global_options
) != UI_SJLJ
)
5516 emit_insn (gen_blockage ());
5518 /* If stack protection is enabled for this function, check the guard. */
5519 if (crtl
->stack_protect_guard
)
5520 stack_protect_epilogue ();
5522 /* If we had calls to alloca, and this machine needs
5523 an accurate stack pointer to exit the function,
5524 insert some code to save and restore the stack pointer. */
5525 if (! EXIT_IGNORE_STACK
5526 && cfun
->calls_alloca
)
5531 emit_stack_save (SAVE_FUNCTION
, &tem
);
5534 emit_insn_before (seq
, parm_birth_insn
);
5536 emit_stack_restore (SAVE_FUNCTION
, tem
);
5539 /* ??? This should no longer be necessary since stupid is no longer with
5540 us, but there are some parts of the compiler (eg reload_combine, and
5541 sh mach_dep_reorg) that still try and compute their own lifetime info
5542 instead of using the general framework. */
5543 use_return_register ();
5547 get_arg_pointer_save_area (void)
5549 rtx ret
= arg_pointer_save_area
;
5553 ret
= assign_stack_local (Pmode
, GET_MODE_SIZE (Pmode
), 0);
5554 arg_pointer_save_area
= ret
;
5557 if (! crtl
->arg_pointer_save_area_init
)
5561 /* Save the arg pointer at the beginning of the function. The
5562 generated stack slot may not be a valid memory address, so we
5563 have to check it and fix it if necessary. */
5565 emit_move_insn (validize_mem (copy_rtx (ret
)),
5566 crtl
->args
.internal_arg_pointer
);
5570 push_topmost_sequence ();
5571 emit_insn_after (seq
, entry_of_function ());
5572 pop_topmost_sequence ();
5574 crtl
->arg_pointer_save_area_init
= true;
5580 /* Add a list of INSNS to the hash HASHP, possibly allocating HASHP
5581 for the first time. */
5584 record_insns (rtx_insn
*insns
, rtx end
, hash_table
<insn_cache_hasher
> **hashp
)
5587 hash_table
<insn_cache_hasher
> *hash
= *hashp
;
5590 *hashp
= hash
= hash_table
<insn_cache_hasher
>::create_ggc (17);
5592 for (tmp
= insns
; tmp
!= end
; tmp
= NEXT_INSN (tmp
))
5594 rtx
*slot
= hash
->find_slot (tmp
, INSERT
);
5595 gcc_assert (*slot
== NULL
);
5600 /* INSN has been duplicated or replaced by as COPY, perhaps by duplicating a
5601 basic block, splitting or peepholes. If INSN is a prologue or epilogue
5602 insn, then record COPY as well. */
5605 maybe_copy_prologue_epilogue_insn (rtx insn
, rtx copy
)
5607 hash_table
<insn_cache_hasher
> *hash
;
5610 hash
= epilogue_insn_hash
;
5611 if (!hash
|| !hash
->find (insn
))
5613 hash
= prologue_insn_hash
;
5614 if (!hash
|| !hash
->find (insn
))
5618 slot
= hash
->find_slot (copy
, INSERT
);
5619 gcc_assert (*slot
== NULL
);
5623 /* Determine if any INSNs in HASH are, or are part of, INSN. Because
5624 we can be running after reorg, SEQUENCE rtl is possible. */
5627 contains (const_rtx insn
, hash_table
<insn_cache_hasher
> *hash
)
5632 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
5634 rtx_sequence
*seq
= as_a
<rtx_sequence
*> (PATTERN (insn
));
5636 for (i
= seq
->len () - 1; i
>= 0; i
--)
5637 if (hash
->find (seq
->element (i
)))
5642 return hash
->find (const_cast<rtx
> (insn
)) != NULL
;
5646 prologue_epilogue_contains (const_rtx insn
)
5648 if (contains (insn
, prologue_insn_hash
))
5650 if (contains (insn
, epilogue_insn_hash
))
5655 /* Insert use of return register before the end of BB. */
5658 emit_use_return_register_into_block (basic_block bb
)
5662 use_return_register ();
5666 if (HAVE_cc0
&& reg_mentioned_p (cc0_rtx
, PATTERN (insn
)))
5667 insn
= prev_cc0_setter (insn
);
5669 emit_insn_before (seq
, insn
);
5673 /* Create a return pattern, either simple_return or return, depending on
5677 gen_return_pattern (bool simple_p
)
5679 if (!HAVE_simple_return
)
5680 gcc_assert (!simple_p
);
5682 return simple_p
? gen_simple_return () : gen_return ();
5685 /* Insert an appropriate return pattern at the end of block BB. This
5686 also means updating block_for_insn appropriately. SIMPLE_P is
5687 the same as in gen_return_pattern and passed to it. */
5690 emit_return_into_block (bool simple_p
, basic_block bb
)
5693 jump
= emit_jump_insn_after (gen_return_pattern (simple_p
), BB_END (bb
));
5694 pat
= PATTERN (jump
);
5695 if (GET_CODE (pat
) == PARALLEL
)
5696 pat
= XVECEXP (pat
, 0, 0);
5697 gcc_assert (ANY_RETURN_P (pat
));
5698 JUMP_LABEL (jump
) = pat
;
5701 /* Set JUMP_LABEL for a return insn. */
5704 set_return_jump_label (rtx returnjump
)
5706 rtx pat
= PATTERN (returnjump
);
5707 if (GET_CODE (pat
) == PARALLEL
)
5708 pat
= XVECEXP (pat
, 0, 0);
5709 if (ANY_RETURN_P (pat
))
5710 JUMP_LABEL (returnjump
) = pat
;
5712 JUMP_LABEL (returnjump
) = ret_rtx
;
5715 /* Return true if there are any active insns between HEAD and TAIL. */
5717 active_insn_between (rtx_insn
*head
, rtx_insn
*tail
)
5721 if (active_insn_p (tail
))
5725 tail
= PREV_INSN (tail
);
5730 /* LAST_BB is a block that exits, and empty of active instructions.
5731 Examine its predecessors for jumps that can be converted to
5732 (conditional) returns. */
5734 convert_jumps_to_returns (basic_block last_bb
, bool simple_p
,
5735 vec
<edge
> unconverted ATTRIBUTE_UNUSED
)
5742 auto_vec
<basic_block
> src_bbs (EDGE_COUNT (last_bb
->preds
));
5744 FOR_EACH_EDGE (e
, ei
, last_bb
->preds
)
5745 if (e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
5746 src_bbs
.quick_push (e
->src
);
5748 label
= BB_HEAD (last_bb
);
5750 FOR_EACH_VEC_ELT (src_bbs
, i
, bb
)
5752 rtx_insn
*jump
= BB_END (bb
);
5754 if (!JUMP_P (jump
) || JUMP_LABEL (jump
) != label
)
5757 e
= find_edge (bb
, last_bb
);
5759 /* If we have an unconditional jump, we can replace that
5760 with a simple return instruction. */
5761 if (simplejump_p (jump
))
5763 /* The use of the return register might be present in the exit
5764 fallthru block. Either:
5765 - removing the use is safe, and we should remove the use in
5766 the exit fallthru block, or
5767 - removing the use is not safe, and we should add it here.
5768 For now, we conservatively choose the latter. Either of the
5769 2 helps in crossjumping. */
5770 emit_use_return_register_into_block (bb
);
5772 emit_return_into_block (simple_p
, bb
);
5776 /* If we have a conditional jump branching to the last
5777 block, we can try to replace that with a conditional
5778 return instruction. */
5779 else if (condjump_p (jump
))
5784 dest
= simple_return_rtx
;
5787 if (!redirect_jump (jump
, dest
, 0))
5789 if (HAVE_simple_return
&& simple_p
)
5793 "Failed to redirect bb %d branch.\n", bb
->index
);
5794 unconverted
.safe_push (e
);
5799 /* See comment in simplejump_p case above. */
5800 emit_use_return_register_into_block (bb
);
5802 /* If this block has only one successor, it both jumps
5803 and falls through to the fallthru block, so we can't
5805 if (single_succ_p (bb
))
5810 if (HAVE_simple_return
&& simple_p
)
5814 "Failed to redirect bb %d branch.\n", bb
->index
);
5815 unconverted
.safe_push (e
);
5820 /* Fix up the CFG for the successful change we just made. */
5821 redirect_edge_succ (e
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
5822 e
->flags
&= ~EDGE_CROSSING
;
5828 /* Emit a return insn for the exit fallthru block. */
5830 emit_return_for_exit (edge exit_fallthru_edge
, bool simple_p
)
5832 basic_block last_bb
= exit_fallthru_edge
->src
;
5834 if (JUMP_P (BB_END (last_bb
)))
5836 last_bb
= split_edge (exit_fallthru_edge
);
5837 exit_fallthru_edge
= single_succ_edge (last_bb
);
5839 emit_barrier_after (BB_END (last_bb
));
5840 emit_return_into_block (simple_p
, last_bb
);
5841 exit_fallthru_edge
->flags
&= ~EDGE_FALLTHRU
;
5846 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
5847 this into place with notes indicating where the prologue ends and where
5848 the epilogue begins. Update the basic block information when possible.
5850 Notes on epilogue placement:
5851 There are several kinds of edges to the exit block:
5852 * a single fallthru edge from LAST_BB
5853 * possibly, edges from blocks containing sibcalls
5854 * possibly, fake edges from infinite loops
5856 The epilogue is always emitted on the fallthru edge from the last basic
5857 block in the function, LAST_BB, into the exit block.
5859 If LAST_BB is empty except for a label, it is the target of every
5860 other basic block in the function that ends in a return. If a
5861 target has a return or simple_return pattern (possibly with
5862 conditional variants), these basic blocks can be changed so that a
5863 return insn is emitted into them, and their target is adjusted to
5864 the real exit block.
5866 Notes on shrink wrapping: We implement a fairly conservative
5867 version of shrink-wrapping rather than the textbook one. We only
5868 generate a single prologue and a single epilogue. This is
5869 sufficient to catch a number of interesting cases involving early
5872 First, we identify the blocks that require the prologue to occur before
5873 them. These are the ones that modify a call-saved register, or reference
5874 any of the stack or frame pointer registers. To simplify things, we then
5875 mark everything reachable from these blocks as also requiring a prologue.
5876 This takes care of loops automatically, and avoids the need to examine
5877 whether MEMs reference the frame, since it is sufficient to check for
5878 occurrences of the stack or frame pointer.
5880 We then compute the set of blocks for which the need for a prologue
5881 is anticipatable (borrowing terminology from the shrink-wrapping
5882 description in Muchnick's book). These are the blocks which either
5883 require a prologue themselves, or those that have only successors
5884 where the prologue is anticipatable. The prologue needs to be
5885 inserted on all edges from BB1->BB2 where BB2 is in ANTIC and BB1
5886 is not. For the moment, we ensure that only one such edge exists.
5888 The epilogue is placed as described above, but we make a
5889 distinction between inserting return and simple_return patterns
5890 when modifying other blocks that end in a return. Blocks that end
5891 in a sibcall omit the sibcall_epilogue if the block is not in
5895 thread_prologue_and_epilogue_insns (void)
5898 vec
<edge
> unconverted_simple_returns
= vNULL
;
5899 bitmap_head bb_flags
;
5900 rtx_insn
*returnjump
;
5901 rtx_insn
*epilogue_end ATTRIBUTE_UNUSED
;
5902 rtx_insn
*prologue_seq ATTRIBUTE_UNUSED
, *split_prologue_seq ATTRIBUTE_UNUSED
;
5903 edge e
, entry_edge
, orig_entry_edge
, exit_fallthru_edge
;
5908 rtl_profile_for_bb (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
5911 epilogue_end
= NULL
;
5914 /* Can't deal with multiple successors of the entry block at the
5915 moment. Function should always have at least one entry
5917 gcc_assert (single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
5918 entry_edge
= single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
5919 orig_entry_edge
= entry_edge
;
5921 split_prologue_seq
= NULL
;
5922 if (flag_split_stack
5923 && (lookup_attribute ("no_split_stack", DECL_ATTRIBUTES (cfun
->decl
))
5926 #ifndef HAVE_split_stack_prologue
5929 gcc_assert (HAVE_split_stack_prologue
);
5932 emit_insn (gen_split_stack_prologue ());
5933 split_prologue_seq
= get_insns ();
5936 record_insns (split_prologue_seq
, NULL
, &prologue_insn_hash
);
5937 set_insn_locations (split_prologue_seq
, prologue_location
);
5941 prologue_seq
= NULL
;
5942 #ifdef HAVE_prologue
5946 rtx_insn
*seq
= safe_as_a
<rtx_insn
*> (gen_prologue ());
5949 /* Insert an explicit USE for the frame pointer
5950 if the profiling is on and the frame pointer is required. */
5951 if (crtl
->profile
&& frame_pointer_needed
)
5952 emit_use (hard_frame_pointer_rtx
);
5954 /* Retain a map of the prologue insns. */
5955 record_insns (seq
, NULL
, &prologue_insn_hash
);
5956 emit_note (NOTE_INSN_PROLOGUE_END
);
5958 /* Ensure that instructions are not moved into the prologue when
5959 profiling is on. The call to the profiling routine can be
5960 emitted within the live range of a call-clobbered register. */
5961 if (!targetm
.profile_before_prologue () && crtl
->profile
)
5962 emit_insn (gen_blockage ());
5964 prologue_seq
= get_insns ();
5966 set_insn_locations (prologue_seq
, prologue_location
);
5970 bitmap_initialize (&bb_flags
, &bitmap_default_obstack
);
5972 /* Try to perform a kind of shrink-wrapping, making sure the
5973 prologue/epilogue is emitted only around those parts of the
5974 function that require it. */
5976 try_shrink_wrapping (&entry_edge
, orig_entry_edge
, &bb_flags
, prologue_seq
);
5978 if (split_prologue_seq
!= NULL_RTX
)
5980 insert_insn_on_edge (split_prologue_seq
, orig_entry_edge
);
5983 if (prologue_seq
!= NULL_RTX
)
5985 insert_insn_on_edge (prologue_seq
, entry_edge
);
5989 /* If the exit block has no non-fake predecessors, we don't need
5991 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5992 if ((e
->flags
& EDGE_FAKE
) == 0)
5997 rtl_profile_for_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
));
5999 exit_fallthru_edge
= find_fallthru_edge (EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
);
6001 if (HAVE_simple_return
&& entry_edge
!= orig_entry_edge
)
6003 = get_unconverted_simple_return (exit_fallthru_edge
, bb_flags
,
6004 &unconverted_simple_returns
,
6008 if (exit_fallthru_edge
== NULL
)
6013 basic_block last_bb
= exit_fallthru_edge
->src
;
6015 if (LABEL_P (BB_HEAD (last_bb
))
6016 && !active_insn_between (BB_HEAD (last_bb
), BB_END (last_bb
)))
6017 convert_jumps_to_returns (last_bb
, false, vNULL
);
6019 if (EDGE_COUNT (last_bb
->preds
) != 0
6020 && single_succ_p (last_bb
))
6022 last_bb
= emit_return_for_exit (exit_fallthru_edge
, false);
6023 epilogue_end
= returnjump
= BB_END (last_bb
);
6025 /* Emitting the return may add a basic block.
6026 Fix bb_flags for the added block. */
6027 if (HAVE_simple_return
&& last_bb
!= exit_fallthru_edge
->src
)
6028 bitmap_set_bit (&bb_flags
, last_bb
->index
);
6035 /* A small fib -- epilogue is not yet completed, but we wish to re-use
6036 this marker for the splits of EH_RETURN patterns, and nothing else
6037 uses the flag in the meantime. */
6038 epilogue_completed
= 1;
6040 #ifdef HAVE_eh_return
6041 /* Find non-fallthru edges that end with EH_RETURN instructions. On
6042 some targets, these get split to a special version of the epilogue
6043 code. In order to be able to properly annotate these with unwind
6044 info, try to split them now. If we get a valid split, drop an
6045 EPILOGUE_BEG note and mark the insns as epilogue insns. */
6046 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
6048 rtx_insn
*prev
, *last
, *trial
;
6050 if (e
->flags
& EDGE_FALLTHRU
)
6052 last
= BB_END (e
->src
);
6053 if (!eh_returnjump_p (last
))
6056 prev
= PREV_INSN (last
);
6057 trial
= try_split (PATTERN (last
), last
, 1);
6061 record_insns (NEXT_INSN (prev
), NEXT_INSN (trial
), &epilogue_insn_hash
);
6062 emit_note_after (NOTE_INSN_EPILOGUE_BEG
, prev
);
6066 /* If nothing falls through into the exit block, we don't need an
6069 if (exit_fallthru_edge
== NULL
)
6075 epilogue_end
= emit_note (NOTE_INSN_EPILOGUE_BEG
);
6076 rtx_insn
*seq
= as_a
<rtx_insn
*> (gen_epilogue ());
6078 emit_jump_insn (seq
);
6080 /* Retain a map of the epilogue insns. */
6081 record_insns (seq
, NULL
, &epilogue_insn_hash
);
6082 set_insn_locations (seq
, epilogue_location
);
6085 returnjump
= get_last_insn ();
6088 insert_insn_on_edge (seq
, exit_fallthru_edge
);
6091 if (JUMP_P (returnjump
))
6092 set_return_jump_label (returnjump
);
6098 if (! next_active_insn (BB_END (exit_fallthru_edge
->src
)))
6100 /* We have a fall-through edge to the exit block, the source is not
6101 at the end of the function, and there will be an assembler epilogue
6102 at the end of the function.
6103 We can't use force_nonfallthru here, because that would try to
6104 use return. Inserting a jump 'by hand' is extremely messy, so
6105 we take advantage of cfg_layout_finalize using
6106 fixup_fallthru_exit_predecessor. */
6107 cfg_layout_initialize (0);
6108 FOR_EACH_BB_FN (cur_bb
, cfun
)
6109 if (cur_bb
->index
>= NUM_FIXED_BLOCKS
6110 && cur_bb
->next_bb
->index
>= NUM_FIXED_BLOCKS
)
6111 cur_bb
->aux
= cur_bb
->next_bb
;
6112 cfg_layout_finalize ();
6117 default_rtl_profile ();
6123 commit_edge_insertions ();
6125 /* Look for basic blocks within the prologue insns. */
6126 blocks
= sbitmap_alloc (last_basic_block_for_fn (cfun
));
6127 bitmap_clear (blocks
);
6128 bitmap_set_bit (blocks
, entry_edge
->dest
->index
);
6129 bitmap_set_bit (blocks
, orig_entry_edge
->dest
->index
);
6130 find_many_sub_basic_blocks (blocks
);
6131 sbitmap_free (blocks
);
6133 /* The epilogue insns we inserted may cause the exit edge to no longer
6135 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
6137 if (((e
->flags
& EDGE_FALLTHRU
) != 0)
6138 && returnjump_p (BB_END (e
->src
)))
6139 e
->flags
&= ~EDGE_FALLTHRU
;
6143 if (HAVE_simple_return
)
6144 convert_to_simple_return (entry_edge
, orig_entry_edge
, bb_flags
,
6145 returnjump
, unconverted_simple_returns
);
6147 #ifdef HAVE_sibcall_epilogue
6148 /* Emit sibling epilogues before any sibling call sites. */
6149 for (ei
= ei_start (EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
); (e
=
6153 basic_block bb
= e
->src
;
6154 rtx_insn
*insn
= BB_END (bb
);
6158 || ! SIBLING_CALL_P (insn
)
6159 || (HAVE_simple_return
&& (entry_edge
!= orig_entry_edge
6160 && !bitmap_bit_p (&bb_flags
, bb
->index
))))
6166 ep_seq
= gen_sibcall_epilogue ();
6170 emit_note (NOTE_INSN_EPILOGUE_BEG
);
6172 rtx_insn
*seq
= get_insns ();
6175 /* Retain a map of the epilogue insns. Used in life analysis to
6176 avoid getting rid of sibcall epilogue insns. Do this before we
6177 actually emit the sequence. */
6178 record_insns (seq
, NULL
, &epilogue_insn_hash
);
6179 set_insn_locations (seq
, epilogue_location
);
6181 emit_insn_before (seq
, insn
);
6189 rtx_insn
*insn
, *next
;
6191 /* Similarly, move any line notes that appear after the epilogue.
6192 There is no need, however, to be quite so anal about the existence
6193 of such a note. Also possibly move
6194 NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
6196 for (insn
= epilogue_end
; insn
; insn
= next
)
6198 next
= NEXT_INSN (insn
);
6200 && (NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
))
6201 reorder_insns (insn
, insn
, PREV_INSN (epilogue_end
));
6205 bitmap_clear (&bb_flags
);
6207 /* Threading the prologue and epilogue changes the artificial refs
6208 in the entry and exit blocks. */
6209 epilogue_completed
= 1;
6210 df_update_entry_exit_and_calls ();
6213 /* Reposition the prologue-end and epilogue-begin notes after
6214 instruction scheduling. */
6217 reposition_prologue_and_epilogue_notes (void)
6219 #if ! defined (HAVE_prologue) && ! defined (HAVE_sibcall_epilogue)
6224 /* Since the hash table is created on demand, the fact that it is
6225 non-null is a signal that it is non-empty. */
6226 if (prologue_insn_hash
!= NULL
)
6228 size_t len
= prologue_insn_hash
->elements ();
6229 rtx_insn
*insn
, *last
= NULL
, *note
= NULL
;
6231 /* Scan from the beginning until we reach the last prologue insn. */
6232 /* ??? While we do have the CFG intact, there are two problems:
6233 (1) The prologue can contain loops (typically probing the stack),
6234 which means that the end of the prologue isn't in the first bb.
6235 (2) Sometimes the PROLOGUE_END note gets pushed into the next bb. */
6236 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
6240 if (NOTE_KIND (insn
) == NOTE_INSN_PROLOGUE_END
)
6243 else if (contains (insn
, prologue_insn_hash
))
6255 /* Scan forward looking for the PROLOGUE_END note. It should
6256 be right at the beginning of the block, possibly with other
6257 insn notes that got moved there. */
6258 for (note
= NEXT_INSN (last
); ; note
= NEXT_INSN (note
))
6261 && NOTE_KIND (note
) == NOTE_INSN_PROLOGUE_END
)
6266 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
6268 last
= NEXT_INSN (last
);
6269 reorder_insns (note
, note
, last
);
6273 if (epilogue_insn_hash
!= NULL
)
6278 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
6280 rtx_insn
*insn
, *first
= NULL
, *note
= NULL
;
6281 basic_block bb
= e
->src
;
6283 /* Scan from the beginning until we reach the first epilogue insn. */
6284 FOR_BB_INSNS (bb
, insn
)
6288 if (NOTE_KIND (insn
) == NOTE_INSN_EPILOGUE_BEG
)
6295 else if (first
== NULL
&& contains (insn
, epilogue_insn_hash
))
6305 /* If the function has a single basic block, and no real
6306 epilogue insns (e.g. sibcall with no cleanup), the
6307 epilogue note can get scheduled before the prologue
6308 note. If we have frame related prologue insns, having
6309 them scanned during the epilogue will result in a crash.
6310 In this case re-order the epilogue note to just before
6311 the last insn in the block. */
6313 first
= BB_END (bb
);
6315 if (PREV_INSN (first
) != note
)
6316 reorder_insns (note
, note
, PREV_INSN (first
));
6322 /* Returns the name of function declared by FNDECL. */
6324 fndecl_name (tree fndecl
)
6328 return lang_hooks
.decl_printable_name (fndecl
, 2);
6331 /* Returns the name of function FN. */
6333 function_name (struct function
*fn
)
6335 tree fndecl
= (fn
== NULL
) ? NULL
: fn
->decl
;
6336 return fndecl_name (fndecl
);
6339 /* Returns the name of the current function. */
6341 current_function_name (void)
6343 return function_name (cfun
);
6348 rest_of_handle_check_leaf_regs (void)
6350 #ifdef LEAF_REGISTERS
6351 crtl
->uses_only_leaf_regs
6352 = optimize
> 0 && only_leaf_regs_used () && leaf_function_p ();
6357 /* Insert a TYPE into the used types hash table of CFUN. */
6360 used_types_insert_helper (tree type
, struct function
*func
)
6362 if (type
!= NULL
&& func
!= NULL
)
6364 if (func
->used_types_hash
== NULL
)
6365 func
->used_types_hash
= hash_set
<tree
>::create_ggc (37);
6367 func
->used_types_hash
->add (type
);
6371 /* Given a type, insert it into the used hash table in cfun. */
6373 used_types_insert (tree t
)
6375 while (POINTER_TYPE_P (t
) || TREE_CODE (t
) == ARRAY_TYPE
)
6380 if (TREE_CODE (t
) == ERROR_MARK
)
6382 if (TYPE_NAME (t
) == NULL_TREE
6383 || TYPE_NAME (t
) == TYPE_NAME (TYPE_MAIN_VARIANT (t
)))
6384 t
= TYPE_MAIN_VARIANT (t
);
6385 if (debug_info_level
> DINFO_LEVEL_NONE
)
6388 used_types_insert_helper (t
, cfun
);
6391 /* So this might be a type referenced by a global variable.
6392 Record that type so that we can later decide to emit its
6393 debug information. */
6394 vec_safe_push (types_used_by_cur_var_decl
, t
);
6399 /* Helper to Hash a struct types_used_by_vars_entry. */
6402 hash_types_used_by_vars_entry (const struct types_used_by_vars_entry
*entry
)
6404 gcc_assert (entry
&& entry
->var_decl
&& entry
->type
);
6406 return iterative_hash_object (entry
->type
,
6407 iterative_hash_object (entry
->var_decl
, 0));
6410 /* Hash function of the types_used_by_vars_entry hash table. */
6413 used_type_hasher::hash (types_used_by_vars_entry
*entry
)
6415 return hash_types_used_by_vars_entry (entry
);
6418 /*Equality function of the types_used_by_vars_entry hash table. */
6421 used_type_hasher::equal (types_used_by_vars_entry
*e1
,
6422 types_used_by_vars_entry
*e2
)
6424 return (e1
->var_decl
== e2
->var_decl
&& e1
->type
== e2
->type
);
6427 /* Inserts an entry into the types_used_by_vars_hash hash table. */
6430 types_used_by_var_decl_insert (tree type
, tree var_decl
)
6432 if (type
!= NULL
&& var_decl
!= NULL
)
6434 types_used_by_vars_entry
**slot
;
6435 struct types_used_by_vars_entry e
;
6436 e
.var_decl
= var_decl
;
6438 if (types_used_by_vars_hash
== NULL
)
6439 types_used_by_vars_hash
6440 = hash_table
<used_type_hasher
>::create_ggc (37);
6442 slot
= types_used_by_vars_hash
->find_slot (&e
, INSERT
);
6445 struct types_used_by_vars_entry
*entry
;
6446 entry
= ggc_alloc
<types_used_by_vars_entry
> ();
6448 entry
->var_decl
= var_decl
;
6456 const pass_data pass_data_leaf_regs
=
6458 RTL_PASS
, /* type */
6459 "*leaf_regs", /* name */
6460 OPTGROUP_NONE
, /* optinfo_flags */
6461 TV_NONE
, /* tv_id */
6462 0, /* properties_required */
6463 0, /* properties_provided */
6464 0, /* properties_destroyed */
6465 0, /* todo_flags_start */
6466 0, /* todo_flags_finish */
6469 class pass_leaf_regs
: public rtl_opt_pass
6472 pass_leaf_regs (gcc::context
*ctxt
)
6473 : rtl_opt_pass (pass_data_leaf_regs
, ctxt
)
6476 /* opt_pass methods: */
6477 virtual unsigned int execute (function
*)
6479 return rest_of_handle_check_leaf_regs ();
6482 }; // class pass_leaf_regs
6487 make_pass_leaf_regs (gcc::context
*ctxt
)
6489 return new pass_leaf_regs (ctxt
);
6493 rest_of_handle_thread_prologue_and_epilogue (void)
6496 cleanup_cfg (CLEANUP_EXPENSIVE
);
6498 /* On some machines, the prologue and epilogue code, or parts thereof,
6499 can be represented as RTL. Doing so lets us schedule insns between
6500 it and the rest of the code and also allows delayed branch
6501 scheduling to operate in the epilogue. */
6502 thread_prologue_and_epilogue_insns ();
6504 /* Shrink-wrapping can result in unreachable edges in the epilogue,
6508 /* The stack usage info is finalized during prologue expansion. */
6509 if (flag_stack_usage_info
)
6510 output_stack_usage ();
6517 const pass_data pass_data_thread_prologue_and_epilogue
=
6519 RTL_PASS
, /* type */
6520 "pro_and_epilogue", /* name */
6521 OPTGROUP_NONE
, /* optinfo_flags */
6522 TV_THREAD_PROLOGUE_AND_EPILOGUE
, /* tv_id */
6523 0, /* properties_required */
6524 0, /* properties_provided */
6525 0, /* properties_destroyed */
6526 0, /* todo_flags_start */
6527 ( TODO_df_verify
| TODO_df_finish
), /* todo_flags_finish */
6530 class pass_thread_prologue_and_epilogue
: public rtl_opt_pass
6533 pass_thread_prologue_and_epilogue (gcc::context
*ctxt
)
6534 : rtl_opt_pass (pass_data_thread_prologue_and_epilogue
, ctxt
)
6537 /* opt_pass methods: */
6538 virtual unsigned int execute (function
*)
6540 return rest_of_handle_thread_prologue_and_epilogue ();
6543 }; // class pass_thread_prologue_and_epilogue
6548 make_pass_thread_prologue_and_epilogue (gcc::context
*ctxt
)
6550 return new pass_thread_prologue_and_epilogue (ctxt
);
6554 /* This mini-pass fixes fall-out from SSA in asm statements that have
6555 in-out constraints. Say you start with
6558 asm ("": "+mr" (inout));
6561 which is transformed very early to use explicit output and match operands:
6564 asm ("": "=mr" (inout) : "0" (inout));
6567 Or, after SSA and copyprop,
6569 asm ("": "=mr" (inout_2) : "0" (inout_1));
6572 Clearly inout_2 and inout_1 can't be coalesced easily anymore, as
6573 they represent two separate values, so they will get different pseudo
6574 registers during expansion. Then, since the two operands need to match
6575 per the constraints, but use different pseudo registers, reload can
6576 only register a reload for these operands. But reloads can only be
6577 satisfied by hardregs, not by memory, so we need a register for this
6578 reload, just because we are presented with non-matching operands.
6579 So, even though we allow memory for this operand, no memory can be
6580 used for it, just because the two operands don't match. This can
6581 cause reload failures on register-starved targets.
6583 So it's a symptom of reload not being able to use memory for reloads
6584 or, alternatively it's also a symptom of both operands not coming into
6585 reload as matching (in which case the pseudo could go to memory just
6586 fine, as the alternative allows it, and no reload would be necessary).
6587 We fix the latter problem here, by transforming
6589 asm ("": "=mr" (inout_2) : "0" (inout_1));
6594 asm ("": "=mr" (inout_2) : "0" (inout_2)); */
6597 match_asm_constraints_1 (rtx_insn
*insn
, rtx
*p_sets
, int noutputs
)
6600 bool changed
= false;
6601 rtx op
= SET_SRC (p_sets
[0]);
6602 int ninputs
= ASM_OPERANDS_INPUT_LENGTH (op
);
6603 rtvec inputs
= ASM_OPERANDS_INPUT_VEC (op
);
6604 bool *output_matched
= XALLOCAVEC (bool, noutputs
);
6606 memset (output_matched
, 0, noutputs
* sizeof (bool));
6607 for (i
= 0; i
< ninputs
; i
++)
6611 const char *constraint
= ASM_OPERANDS_INPUT_CONSTRAINT (op
, i
);
6615 if (*constraint
== '%')
6618 match
= strtoul (constraint
, &end
, 10);
6619 if (end
== constraint
)
6622 gcc_assert (match
< noutputs
);
6623 output
= SET_DEST (p_sets
[match
]);
6624 input
= RTVEC_ELT (inputs
, i
);
6625 /* Only do the transformation for pseudos. */
6626 if (! REG_P (output
)
6627 || rtx_equal_p (output
, input
)
6628 || (GET_MODE (input
) != VOIDmode
6629 && GET_MODE (input
) != GET_MODE (output
)))
6632 /* We can't do anything if the output is also used as input,
6633 as we're going to overwrite it. */
6634 for (j
= 0; j
< ninputs
; j
++)
6635 if (reg_overlap_mentioned_p (output
, RTVEC_ELT (inputs
, j
)))
6640 /* Avoid changing the same input several times. For
6641 asm ("" : "=mr" (out1), "=mr" (out2) : "0" (in), "1" (in));
6642 only change in once (to out1), rather than changing it
6643 first to out1 and afterwards to out2. */
6646 for (j
= 0; j
< noutputs
; j
++)
6647 if (output_matched
[j
] && input
== SET_DEST (p_sets
[j
]))
6652 output_matched
[match
] = true;
6655 emit_move_insn (output
, input
);
6656 insns
= get_insns ();
6658 emit_insn_before (insns
, insn
);
6660 /* Now replace all mentions of the input with output. We can't
6661 just replace the occurrence in inputs[i], as the register might
6662 also be used in some other input (or even in an address of an
6663 output), which would mean possibly increasing the number of
6664 inputs by one (namely 'output' in addition), which might pose
6665 a too complicated problem for reload to solve. E.g. this situation:
6667 asm ("" : "=r" (output), "=m" (input) : "0" (input))
6669 Here 'input' is used in two occurrences as input (once for the
6670 input operand, once for the address in the second output operand).
6671 If we would replace only the occurrence of the input operand (to
6672 make the matching) we would be left with this:
6675 asm ("" : "=r" (output), "=m" (input) : "0" (output))
6677 Now we suddenly have two different input values (containing the same
6678 value, but different pseudos) where we formerly had only one.
6679 With more complicated asms this might lead to reload failures
6680 which wouldn't have happen without this pass. So, iterate over
6681 all operands and replace all occurrences of the register used. */
6682 for (j
= 0; j
< noutputs
; j
++)
6683 if (!rtx_equal_p (SET_DEST (p_sets
[j
]), input
)
6684 && reg_overlap_mentioned_p (input
, SET_DEST (p_sets
[j
])))
6685 SET_DEST (p_sets
[j
]) = replace_rtx (SET_DEST (p_sets
[j
]),
6687 for (j
= 0; j
< ninputs
; j
++)
6688 if (reg_overlap_mentioned_p (input
, RTVEC_ELT (inputs
, j
)))
6689 RTVEC_ELT (inputs
, j
) = replace_rtx (RTVEC_ELT (inputs
, j
),
6696 df_insn_rescan (insn
);
6699 /* Add the decl D to the local_decls list of FUN. */
6702 add_local_decl (struct function
*fun
, tree d
)
6704 gcc_assert (TREE_CODE (d
) == VAR_DECL
);
6705 vec_safe_push (fun
->local_decls
, d
);
6710 const pass_data pass_data_match_asm_constraints
=
6712 RTL_PASS
, /* type */
6713 "asmcons", /* name */
6714 OPTGROUP_NONE
, /* optinfo_flags */
6715 TV_NONE
, /* tv_id */
6716 0, /* properties_required */
6717 0, /* properties_provided */
6718 0, /* properties_destroyed */
6719 0, /* todo_flags_start */
6720 0, /* todo_flags_finish */
6723 class pass_match_asm_constraints
: public rtl_opt_pass
6726 pass_match_asm_constraints (gcc::context
*ctxt
)
6727 : rtl_opt_pass (pass_data_match_asm_constraints
, ctxt
)
6730 /* opt_pass methods: */
6731 virtual unsigned int execute (function
*);
6733 }; // class pass_match_asm_constraints
6736 pass_match_asm_constraints::execute (function
*fun
)
6743 if (!crtl
->has_asm_statement
)
6746 df_set_flags (DF_DEFER_INSN_RESCAN
);
6747 FOR_EACH_BB_FN (bb
, fun
)
6749 FOR_BB_INSNS (bb
, insn
)
6754 pat
= PATTERN (insn
);
6755 if (GET_CODE (pat
) == PARALLEL
)
6756 p_sets
= &XVECEXP (pat
, 0, 0), noutputs
= XVECLEN (pat
, 0);
6757 else if (GET_CODE (pat
) == SET
)
6758 p_sets
= &PATTERN (insn
), noutputs
= 1;
6762 if (GET_CODE (*p_sets
) == SET
6763 && GET_CODE (SET_SRC (*p_sets
)) == ASM_OPERANDS
)
6764 match_asm_constraints_1 (insn
, p_sets
, noutputs
);
6768 return TODO_df_finish
;
6774 make_pass_match_asm_constraints (gcc::context
*ctxt
)
6776 return new pass_match_asm_constraints (ctxt
);
6780 #include "gt-function.h"