1 /* Expands front end tree to back end RTL for GNU C-Compiler
2 Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
22 /* This file handles the generation of rtl code from tree structure
23 at the level of the function as a whole.
24 It creates the rtl expressions for parameters and auto variables
25 and has full responsibility for allocating stack slots.
27 `expand_function_start' is called at the beginning of a function,
28 before the function body is parsed, and `expand_function_end' is
29 called after parsing the body.
31 Call `assign_stack_local' to allocate a stack slot for a local variable.
32 This is usually done during the RTL generation for the function body,
33 but it can also be done in the reload pass when a pseudo-register does
34 not get a hard register.
36 Call `put_var_into_stack' when you learn, belatedly, that a variable
37 previously given a pseudo-register must in fact go in the stack.
38 This function changes the DECL_RTL to be a stack slot instead of a reg
39 then scans all the RTL instructions so far generated to correct them. */
48 #include "insn-flags.h"
50 #include "insn-codes.h"
52 #include "hard-reg-set.h"
53 #include "insn-config.h"
56 #include "basic-block.h"
63 #ifndef ACCUMULATE_OUTGOING_ARGS
64 #define ACCUMULATE_OUTGOING_ARGS 0
67 #ifndef TRAMPOLINE_ALIGNMENT
68 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
71 #ifndef LOCAL_ALIGNMENT
72 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
75 #if !defined (PREFERRED_STACK_BOUNDARY) && defined (STACK_BOUNDARY)
76 #define PREFERRED_STACK_BOUNDARY STACK_BOUNDARY
79 /* Some systems use __main in a way incompatible with its use in gcc, in these
80 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
81 give the same symbol without quotes for an alternative entry point. You
82 must define both, or neither. */
84 #define NAME__MAIN "__main"
85 #define SYMBOL__MAIN __main
88 /* Round a value to the lowest integer less than it that is a multiple of
89 the required alignment. Avoid using division in case the value is
90 negative. Assume the alignment is a power of two. */
91 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
93 /* Similar, but round to the next highest integer that meets the
95 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
97 /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
98 during rtl generation. If they are different register numbers, this is
99 always true. It may also be true if
100 FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
101 generation. See fix_lexical_addr for details. */
103 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
104 #define NEED_SEPARATE_AP
107 /* Nonzero if function being compiled doesn't contain any calls
108 (ignoring the prologue and epilogue). This is set prior to
109 local register allocation and is valid for the remaining
111 int current_function_is_leaf
;
113 /* Nonzero if function being compiled doesn't contain any instructions
114 that can throw an exception. This is set prior to final. */
116 int current_function_nothrow
;
118 /* Nonzero if function being compiled doesn't modify the stack pointer
119 (ignoring the prologue and epilogue). This is only valid after
120 life_analysis has run. */
121 int current_function_sp_is_unchanging
;
123 /* Nonzero if the function being compiled is a leaf function which only
124 uses leaf registers. This is valid after reload (specifically after
125 sched2) and is useful only if the port defines LEAF_REGISTERS. */
126 int current_function_uses_only_leaf_regs
;
128 /* Nonzero once virtual register instantiation has been done.
129 assign_stack_local uses frame_pointer_rtx when this is nonzero. */
130 static int virtuals_instantiated
;
132 /* These variables hold pointers to functions to
133 save and restore machine-specific data,
134 in push_function_context and pop_function_context. */
135 void (*init_machine_status
) PARAMS ((struct function
*));
136 void (*save_machine_status
) PARAMS ((struct function
*));
137 void (*restore_machine_status
) PARAMS ((struct function
*));
138 void (*mark_machine_status
) PARAMS ((struct function
*));
139 void (*free_machine_status
) PARAMS ((struct function
*));
141 /* Likewise, but for language-specific data. */
142 void (*init_lang_status
) PARAMS ((struct function
*));
143 void (*save_lang_status
) PARAMS ((struct function
*));
144 void (*restore_lang_status
) PARAMS ((struct function
*));
145 void (*mark_lang_status
) PARAMS ((struct function
*));
146 void (*free_lang_status
) PARAMS ((struct function
*));
148 /* The FUNCTION_DECL for an inline function currently being expanded. */
149 tree inline_function_decl
;
151 /* The currently compiled function. */
152 struct function
*cfun
= 0;
154 /* Global list of all compiled functions. */
155 struct function
*all_functions
= 0;
157 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
158 static varray_type prologue
;
159 static varray_type epilogue
;
161 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
163 static varray_type sibcall_epilogue
;
165 /* In order to evaluate some expressions, such as function calls returning
166 structures in memory, we need to temporarily allocate stack locations.
167 We record each allocated temporary in the following structure.
169 Associated with each temporary slot is a nesting level. When we pop up
170 one level, all temporaries associated with the previous level are freed.
171 Normally, all temporaries are freed after the execution of the statement
172 in which they were created. However, if we are inside a ({...}) grouping,
173 the result may be in a temporary and hence must be preserved. If the
174 result could be in a temporary, we preserve it if we can determine which
175 one it is in. If we cannot determine which temporary may contain the
176 result, all temporaries are preserved. A temporary is preserved by
177 pretending it was allocated at the previous nesting level.
179 Automatic variables are also assigned temporary slots, at the nesting
180 level where they are defined. They are marked a "kept" so that
181 free_temp_slots will not free them. */
185 /* Points to next temporary slot. */
186 struct temp_slot
*next
;
187 /* The rtx to used to reference the slot. */
189 /* The rtx used to represent the address if not the address of the
190 slot above. May be an EXPR_LIST if multiple addresses exist. */
192 /* The alignment (in bits) of the slot. */
194 /* The size, in units, of the slot. */
196 /* The alias set for the slot. If the alias set is zero, we don't
197 know anything about the alias set of the slot. We must only
198 reuse a slot if it is assigned an object of the same alias set.
199 Otherwise, the rest of the compiler may assume that the new use
200 of the slot cannot alias the old use of the slot, which is
201 false. If the slot has alias set zero, then we can't reuse the
202 slot at all, since we have no idea what alias set may have been
203 imposed on the memory. For example, if the stack slot is the
204 call frame for an inline functioned, we have no idea what alias
205 sets will be assigned to various pieces of the call frame. */
206 HOST_WIDE_INT alias_set
;
207 /* The value of `sequence_rtl_expr' when this temporary is allocated. */
209 /* Non-zero if this temporary is currently in use. */
211 /* Non-zero if this temporary has its address taken. */
213 /* Nesting level at which this slot is being used. */
215 /* Non-zero if this should survive a call to free_temp_slots. */
217 /* The offset of the slot from the frame_pointer, including extra space
218 for alignment. This info is for combine_temp_slots. */
219 HOST_WIDE_INT base_offset
;
220 /* The size of the slot, including extra space for alignment. This
221 info is for combine_temp_slots. */
222 HOST_WIDE_INT full_size
;
225 /* This structure is used to record MEMs or pseudos used to replace VAR, any
226 SUBREGs of VAR, and any MEMs containing VAR as an address. We need to
227 maintain this list in case two operands of an insn were required to match;
228 in that case we must ensure we use the same replacement. */
230 struct fixup_replacement
234 struct fixup_replacement
*next
;
237 struct insns_for_mem_entry
{
238 /* The KEY in HE will be a MEM. */
239 struct hash_entry he
;
240 /* These are the INSNS which reference the MEM. */
244 /* Forward declarations. */
246 static rtx assign_stack_local_1
PARAMS ((enum machine_mode
, HOST_WIDE_INT
,
247 int, struct function
*));
248 static rtx assign_stack_temp_for_type
PARAMS ((enum machine_mode
,
249 HOST_WIDE_INT
, int, tree
));
250 static struct temp_slot
*find_temp_slot_from_address
PARAMS ((rtx
));
251 static void put_reg_into_stack
PARAMS ((struct function
*, rtx
, tree
,
252 enum machine_mode
, enum machine_mode
,
253 int, unsigned int, int,
254 struct hash_table
*));
255 static void schedule_fixup_var_refs
PARAMS ((struct function
*, rtx
, tree
,
257 struct hash_table
*));
258 static void fixup_var_refs
PARAMS ((rtx
, enum machine_mode
, int,
259 struct hash_table
*));
260 static struct fixup_replacement
261 *find_fixup_replacement
PARAMS ((struct fixup_replacement
**, rtx
));
262 static void fixup_var_refs_insns
PARAMS ((rtx
, enum machine_mode
, int,
263 rtx
, int, struct hash_table
*));
264 static void fixup_var_refs_1
PARAMS ((rtx
, enum machine_mode
, rtx
*, rtx
,
265 struct fixup_replacement
**));
266 static rtx fixup_memory_subreg
PARAMS ((rtx
, rtx
, int));
267 static rtx walk_fixup_memory_subreg
PARAMS ((rtx
, rtx
, int));
268 static rtx fixup_stack_1
PARAMS ((rtx
, rtx
));
269 static void optimize_bit_field
PARAMS ((rtx
, rtx
, rtx
*));
270 static void instantiate_decls
PARAMS ((tree
, int));
271 static void instantiate_decls_1
PARAMS ((tree
, int));
272 static void instantiate_decl
PARAMS ((rtx
, HOST_WIDE_INT
, int));
273 static int instantiate_virtual_regs_1
PARAMS ((rtx
*, rtx
, int));
274 static void delete_handlers
PARAMS ((void));
275 static void pad_to_arg_alignment
PARAMS ((struct args_size
*, int,
276 struct args_size
*));
277 #ifndef ARGS_GROW_DOWNWARD
278 static void pad_below
PARAMS ((struct args_size
*, enum machine_mode
,
281 static rtx round_trampoline_addr
PARAMS ((rtx
));
282 static tree
*identify_blocks_1
PARAMS ((rtx
, tree
*, tree
*, tree
*));
283 static void reorder_blocks_1
PARAMS ((rtx
, tree
, varray_type
*));
284 static tree blocks_nreverse
PARAMS ((tree
));
285 static int all_blocks
PARAMS ((tree
, tree
*));
286 static tree
*get_block_vector
PARAMS ((tree
, int *));
287 /* We always define `record_insns' even if its not used so that we
288 can always export `prologue_epilogue_contains'. */
289 static void record_insns
PARAMS ((rtx
, varray_type
*)) ATTRIBUTE_UNUSED
;
290 static int contains
PARAMS ((rtx
, varray_type
));
292 static void emit_return_into_block
PARAMS ((basic_block
, rtx
));
294 static void put_addressof_into_stack
PARAMS ((rtx
, struct hash_table
*));
295 static boolean purge_addressof_1
PARAMS ((rtx
*, rtx
, int, int,
296 struct hash_table
*));
298 static void keep_stack_depressed
PARAMS ((rtx
));
300 static int is_addressof
PARAMS ((rtx
*, void *));
301 static struct hash_entry
*insns_for_mem_newfunc
PARAMS ((struct hash_entry
*,
304 static unsigned long insns_for_mem_hash
PARAMS ((hash_table_key
));
305 static boolean insns_for_mem_comp
PARAMS ((hash_table_key
, hash_table_key
));
306 static int insns_for_mem_walk
PARAMS ((rtx
*, void *));
307 static void compute_insns_for_mem
PARAMS ((rtx
, rtx
, struct hash_table
*));
308 static void mark_temp_slot
PARAMS ((struct temp_slot
*));
309 static void mark_function_status
PARAMS ((struct function
*));
310 static void mark_function_chain
PARAMS ((void *));
311 static void prepare_function_start
PARAMS ((void));
312 static void do_clobber_return_reg
PARAMS ((rtx
, void *));
313 static void do_use_return_reg
PARAMS ((rtx
, void *));
315 /* Pointer to chain of `struct function' for containing functions. */
316 struct function
*outer_function_chain
;
318 /* Given a function decl for a containing function,
319 return the `struct function' for it. */
322 find_function_data (decl
)
327 for (p
= outer_function_chain
; p
; p
= p
->next
)
334 /* Save the current context for compilation of a nested function.
335 This is called from language-specific code. The caller should use
336 the save_lang_status callback to save any language-specific state,
337 since this function knows only about language-independent
341 push_function_context_to (context
)
344 struct function
*p
, *context_data
;
348 context_data
= (context
== current_function_decl
350 : find_function_data (context
));
351 context_data
->contains_functions
= 1;
355 init_dummy_function_start ();
358 p
->next
= outer_function_chain
;
359 outer_function_chain
= p
;
360 p
->fixup_var_refs_queue
= 0;
362 save_tree_status (p
);
363 if (save_lang_status
)
364 (*save_lang_status
) (p
);
365 if (save_machine_status
)
366 (*save_machine_status
) (p
);
372 push_function_context ()
374 push_function_context_to (current_function_decl
);
377 /* Restore the last saved context, at the end of a nested function.
378 This function is called from language-specific code. */
381 pop_function_context_from (context
)
382 tree context ATTRIBUTE_UNUSED
;
384 struct function
*p
= outer_function_chain
;
385 struct var_refs_queue
*queue
;
386 struct var_refs_queue
*next
;
389 outer_function_chain
= p
->next
;
391 current_function_decl
= p
->decl
;
394 restore_tree_status (p
);
395 restore_emit_status (p
);
397 if (restore_machine_status
)
398 (*restore_machine_status
) (p
);
399 if (restore_lang_status
)
400 (*restore_lang_status
) (p
);
402 /* Finish doing put_var_into_stack for any of our variables
403 which became addressable during the nested function. */
404 for (queue
= p
->fixup_var_refs_queue
; queue
; queue
= next
)
407 fixup_var_refs (queue
->modified
, queue
->promoted_mode
,
408 queue
->unsignedp
, 0);
411 p
->fixup_var_refs_queue
= 0;
413 /* Reset variables that have known state during rtx generation. */
414 rtx_equal_function_value_matters
= 1;
415 virtuals_instantiated
= 0;
416 generating_concat_p
= 1;
420 pop_function_context ()
422 pop_function_context_from (current_function_decl
);
425 /* Clear out all parts of the state in F that can safely be discarded
426 after the function has been parsed, but not compiled, to let
427 garbage collection reclaim the memory. */
430 free_after_parsing (f
)
433 /* f->expr->forced_labels is used by code generation. */
434 /* f->emit->regno_reg_rtx is used by code generation. */
435 /* f->varasm is used by code generation. */
436 /* f->eh->eh_return_stub_label is used by code generation. */
438 if (free_lang_status
)
439 (*free_lang_status
) (f
);
440 free_stmt_status (f
);
443 /* Clear out all parts of the state in F that can safely be discarded
444 after the function has been compiled, to let garbage collection
445 reclaim the memory. */
448 free_after_compilation (f
)
451 struct temp_slot
*ts
;
452 struct temp_slot
*next
;
455 free_expr_status (f
);
456 free_emit_status (f
);
457 free_varasm_status (f
);
459 if (free_machine_status
)
460 (*free_machine_status
) (f
);
462 if (f
->x_parm_reg_stack_loc
)
463 free (f
->x_parm_reg_stack_loc
);
465 for (ts
= f
->x_temp_slots
; ts
; ts
= next
)
470 f
->x_temp_slots
= NULL
;
472 f
->arg_offset_rtx
= NULL
;
473 f
->return_rtx
= NULL
;
474 f
->internal_arg_pointer
= NULL
;
475 f
->x_nonlocal_labels
= NULL
;
476 f
->x_nonlocal_goto_handler_slots
= NULL
;
477 f
->x_nonlocal_goto_handler_labels
= NULL
;
478 f
->x_nonlocal_goto_stack_level
= NULL
;
479 f
->x_cleanup_label
= NULL
;
480 f
->x_return_label
= NULL
;
481 f
->x_save_expr_regs
= NULL
;
482 f
->x_stack_slot_list
= NULL
;
483 f
->x_rtl_expr_chain
= NULL
;
484 f
->x_tail_recursion_label
= NULL
;
485 f
->x_tail_recursion_reentry
= NULL
;
486 f
->x_arg_pointer_save_area
= NULL
;
487 f
->x_context_display
= NULL
;
488 f
->x_trampoline_list
= NULL
;
489 f
->x_parm_birth_insn
= NULL
;
490 f
->x_last_parm_insn
= NULL
;
491 f
->x_parm_reg_stack_loc
= NULL
;
492 f
->fixup_var_refs_queue
= NULL
;
493 f
->original_arg_vector
= NULL
;
494 f
->original_decl_initial
= NULL
;
495 f
->inl_last_parm_insn
= NULL
;
496 f
->epilogue_delay_list
= NULL
;
499 /* Allocate fixed slots in the stack frame of the current function. */
501 /* Return size needed for stack frame based on slots so far allocated in
503 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
504 the caller may have to do that. */
507 get_func_frame_size (f
)
510 #ifdef FRAME_GROWS_DOWNWARD
511 return -f
->x_frame_offset
;
513 return f
->x_frame_offset
;
517 /* Return size needed for stack frame based on slots so far allocated.
518 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
519 the caller may have to do that. */
523 return get_func_frame_size (cfun
);
526 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
527 with machine mode MODE.
529 ALIGN controls the amount of alignment for the address of the slot:
530 0 means according to MODE,
531 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
532 positive specifies alignment boundary in bits.
534 We do not round to stack_boundary here.
536 FUNCTION specifies the function to allocate in. */
539 assign_stack_local_1 (mode
, size
, align
, function
)
540 enum machine_mode mode
;
543 struct function
*function
;
545 register rtx x
, addr
;
546 int bigend_correction
= 0;
549 /* Allocate in the memory associated with the function in whose frame
551 if (function
!= cfun
)
552 push_obstacks (function
->function_obstack
,
553 function
->function_maybepermanent_obstack
);
560 alignment
= BIGGEST_ALIGNMENT
;
562 alignment
= GET_MODE_ALIGNMENT (mode
);
564 /* Allow the target to (possibly) increase the alignment of this
566 type
= type_for_mode (mode
, 0);
568 alignment
= LOCAL_ALIGNMENT (type
, alignment
);
570 alignment
/= BITS_PER_UNIT
;
572 else if (align
== -1)
574 alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
575 size
= CEIL_ROUND (size
, alignment
);
578 alignment
= align
/ BITS_PER_UNIT
;
580 #ifdef FRAME_GROWS_DOWNWARD
581 function
->x_frame_offset
-= size
;
584 /* Ignore alignment we can't do with expected alignment of the boundary. */
585 if (alignment
* BITS_PER_UNIT
> PREFERRED_STACK_BOUNDARY
)
586 alignment
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
588 if (function
->stack_alignment_needed
< alignment
* BITS_PER_UNIT
)
589 function
->stack_alignment_needed
= alignment
* BITS_PER_UNIT
;
591 /* Round frame offset to that alignment.
592 We must be careful here, since FRAME_OFFSET might be negative and
593 division with a negative dividend isn't as well defined as we might
594 like. So we instead assume that ALIGNMENT is a power of two and
595 use logical operations which are unambiguous. */
596 #ifdef FRAME_GROWS_DOWNWARD
597 function
->x_frame_offset
= FLOOR_ROUND (function
->x_frame_offset
, alignment
);
599 function
->x_frame_offset
= CEIL_ROUND (function
->x_frame_offset
, alignment
);
602 /* On a big-endian machine, if we are allocating more space than we will use,
603 use the least significant bytes of those that are allocated. */
604 if (BYTES_BIG_ENDIAN
&& mode
!= BLKmode
)
605 bigend_correction
= size
- GET_MODE_SIZE (mode
);
607 /* If we have already instantiated virtual registers, return the actual
608 address relative to the frame pointer. */
609 if (function
== cfun
&& virtuals_instantiated
)
610 addr
= plus_constant (frame_pointer_rtx
,
611 (frame_offset
+ bigend_correction
612 + STARTING_FRAME_OFFSET
));
614 addr
= plus_constant (virtual_stack_vars_rtx
,
615 function
->x_frame_offset
+ bigend_correction
);
617 #ifndef FRAME_GROWS_DOWNWARD
618 function
->x_frame_offset
+= size
;
621 x
= gen_rtx_MEM (mode
, addr
);
623 function
->x_stack_slot_list
624 = gen_rtx_EXPR_LIST (VOIDmode
, x
, function
->x_stack_slot_list
);
626 if (function
!= cfun
)
632 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
636 assign_stack_local (mode
, size
, align
)
637 enum machine_mode mode
;
641 return assign_stack_local_1 (mode
, size
, align
, cfun
);
644 /* Allocate a temporary stack slot and record it for possible later
647 MODE is the machine mode to be given to the returned rtx.
649 SIZE is the size in units of the space required. We do no rounding here
650 since assign_stack_local will do any required rounding.
652 KEEP is 1 if this slot is to be retained after a call to
653 free_temp_slots. Automatic variables for a block are allocated
654 with this flag. KEEP is 2 if we allocate a longer term temporary,
655 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
656 if we are to allocate something at an inner level to be treated as
657 a variable in the block (e.g., a SAVE_EXPR).
659 TYPE is the type that will be used for the stack slot. */
662 assign_stack_temp_for_type (mode
, size
, keep
, type
)
663 enum machine_mode mode
;
669 HOST_WIDE_INT alias_set
;
670 struct temp_slot
*p
, *best_p
= 0;
672 /* If SIZE is -1 it means that somebody tried to allocate a temporary
673 of a variable size. */
677 /* If we know the alias set for the memory that will be used, use
678 it. If there's no TYPE, then we don't know anything about the
679 alias set for the memory. */
681 alias_set
= get_alias_set (type
);
686 align
= BIGGEST_ALIGNMENT
;
688 align
= GET_MODE_ALIGNMENT (mode
);
691 type
= type_for_mode (mode
, 0);
694 align
= LOCAL_ALIGNMENT (type
, align
);
696 /* Try to find an available, already-allocated temporary of the proper
697 mode which meets the size and alignment requirements. Choose the
698 smallest one with the closest alignment. */
699 for (p
= temp_slots
; p
; p
= p
->next
)
700 if (p
->align
>= align
&& p
->size
>= size
&& GET_MODE (p
->slot
) == mode
702 && (! flag_strict_aliasing
703 || (alias_set
&& p
->alias_set
== alias_set
))
704 && (best_p
== 0 || best_p
->size
> p
->size
705 || (best_p
->size
== p
->size
&& best_p
->align
> p
->align
)))
707 if (p
->align
== align
&& p
->size
== size
)
715 /* Make our best, if any, the one to use. */
718 /* If there are enough aligned bytes left over, make them into a new
719 temp_slot so that the extra bytes don't get wasted. Do this only
720 for BLKmode slots, so that we can be sure of the alignment. */
721 if (GET_MODE (best_p
->slot
) == BLKmode
)
723 int alignment
= best_p
->align
/ BITS_PER_UNIT
;
724 HOST_WIDE_INT rounded_size
= CEIL_ROUND (size
, alignment
);
726 if (best_p
->size
- rounded_size
>= alignment
)
728 p
= (struct temp_slot
*) xmalloc (sizeof (struct temp_slot
));
729 p
->in_use
= p
->addr_taken
= 0;
730 p
->size
= best_p
->size
- rounded_size
;
731 p
->base_offset
= best_p
->base_offset
+ rounded_size
;
732 p
->full_size
= best_p
->full_size
- rounded_size
;
733 p
->slot
= gen_rtx_MEM (BLKmode
,
734 plus_constant (XEXP (best_p
->slot
, 0),
736 p
->align
= best_p
->align
;
739 p
->alias_set
= best_p
->alias_set
;
740 p
->next
= temp_slots
;
743 stack_slot_list
= gen_rtx_EXPR_LIST (VOIDmode
, p
->slot
,
746 best_p
->size
= rounded_size
;
747 best_p
->full_size
= rounded_size
;
754 /* If we still didn't find one, make a new temporary. */
757 HOST_WIDE_INT frame_offset_old
= frame_offset
;
759 p
= (struct temp_slot
*) xmalloc (sizeof (struct temp_slot
));
761 /* We are passing an explicit alignment request to assign_stack_local.
762 One side effect of that is assign_stack_local will not round SIZE
763 to ensure the frame offset remains suitably aligned.
765 So for requests which depended on the rounding of SIZE, we go ahead
766 and round it now. We also make sure ALIGNMENT is at least
767 BIGGEST_ALIGNMENT. */
768 if (mode
== BLKmode
&& align
< BIGGEST_ALIGNMENT
)
770 p
->slot
= assign_stack_local (mode
,
772 ? CEIL_ROUND (size
, align
/ BITS_PER_UNIT
)
777 p
->alias_set
= alias_set
;
779 /* The following slot size computation is necessary because we don't
780 know the actual size of the temporary slot until assign_stack_local
781 has performed all the frame alignment and size rounding for the
782 requested temporary. Note that extra space added for alignment
783 can be either above or below this stack slot depending on which
784 way the frame grows. We include the extra space if and only if it
785 is above this slot. */
786 #ifdef FRAME_GROWS_DOWNWARD
787 p
->size
= frame_offset_old
- frame_offset
;
792 /* Now define the fields used by combine_temp_slots. */
793 #ifdef FRAME_GROWS_DOWNWARD
794 p
->base_offset
= frame_offset
;
795 p
->full_size
= frame_offset_old
- frame_offset
;
797 p
->base_offset
= frame_offset_old
;
798 p
->full_size
= frame_offset
- frame_offset_old
;
801 p
->next
= temp_slots
;
807 p
->rtl_expr
= seq_rtl_expr
;
811 p
->level
= target_temp_slot_level
;
816 p
->level
= var_temp_slot_level
;
821 p
->level
= temp_slot_level
;
825 /* We may be reusing an old slot, so clear any MEM flags that may have been
827 RTX_UNCHANGING_P (p
->slot
) = 0;
828 MEM_IN_STRUCT_P (p
->slot
) = 0;
829 MEM_SCALAR_P (p
->slot
) = 0;
830 MEM_ALIAS_SET (p
->slot
) = alias_set
;
833 MEM_SET_IN_STRUCT_P (p
->slot
, AGGREGATE_TYPE_P (type
));
838 /* Allocate a temporary stack slot and record it for possible later
839 reuse. First three arguments are same as in preceding function. */
842 assign_stack_temp (mode
, size
, keep
)
843 enum machine_mode mode
;
847 return assign_stack_temp_for_type (mode
, size
, keep
, NULL_TREE
);
850 /* Assign a temporary of given TYPE.
851 KEEP is as for assign_stack_temp.
852 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
853 it is 0 if a register is OK.
854 DONT_PROMOTE is 1 if we should not promote values in register
858 assign_temp (type
, keep
, memory_required
, dont_promote
)
862 int dont_promote ATTRIBUTE_UNUSED
;
864 enum machine_mode mode
= TYPE_MODE (type
);
865 #ifndef PROMOTE_FOR_CALL_ONLY
866 int unsignedp
= TREE_UNSIGNED (type
);
869 if (mode
== BLKmode
|| memory_required
)
871 HOST_WIDE_INT size
= int_size_in_bytes (type
);
874 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
875 problems with allocating the stack space. */
879 /* Unfortunately, we don't yet know how to allocate variable-sized
880 temporaries. However, sometimes we have a fixed upper limit on
881 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
882 instead. This is the case for Chill variable-sized strings. */
883 if (size
== -1 && TREE_CODE (type
) == ARRAY_TYPE
884 && TYPE_ARRAY_MAX_SIZE (type
) != NULL_TREE
885 && host_integerp (TYPE_ARRAY_MAX_SIZE (type
), 1))
886 size
= tree_low_cst (TYPE_ARRAY_MAX_SIZE (type
), 1);
888 tmp
= assign_stack_temp_for_type (mode
, size
, keep
, type
);
892 #ifndef PROMOTE_FOR_CALL_ONLY
894 mode
= promote_mode (type
, mode
, &unsignedp
, 0);
897 return gen_reg_rtx (mode
);
900 /* Combine temporary stack slots which are adjacent on the stack.
902 This allows for better use of already allocated stack space. This is only
903 done for BLKmode slots because we can be sure that we won't have alignment
904 problems in this case. */
907 combine_temp_slots ()
909 struct temp_slot
*p
, *q
;
910 struct temp_slot
*prev_p
, *prev_q
;
913 /* We can't combine slots, because the information about which slot
914 is in which alias set will be lost. */
915 if (flag_strict_aliasing
)
918 /* If there are a lot of temp slots, don't do anything unless
919 high levels of optimizaton. */
920 if (! flag_expensive_optimizations
)
921 for (p
= temp_slots
, num_slots
= 0; p
; p
= p
->next
, num_slots
++)
922 if (num_slots
> 100 || (num_slots
> 10 && optimize
== 0))
925 for (p
= temp_slots
, prev_p
= 0; p
; p
= prev_p
? prev_p
->next
: temp_slots
)
929 if (! p
->in_use
&& GET_MODE (p
->slot
) == BLKmode
)
930 for (q
= p
->next
, prev_q
= p
; q
; q
= prev_q
->next
)
933 if (! q
->in_use
&& GET_MODE (q
->slot
) == BLKmode
)
935 if (p
->base_offset
+ p
->full_size
== q
->base_offset
)
937 /* Q comes after P; combine Q into P. */
939 p
->full_size
+= q
->full_size
;
942 else if (q
->base_offset
+ q
->full_size
== p
->base_offset
)
944 /* P comes after Q; combine P into Q. */
946 q
->full_size
+= p
->full_size
;
951 /* Either delete Q or advance past it. */
954 prev_q
->next
= q
->next
;
960 /* Either delete P or advance past it. */
964 prev_p
->next
= p
->next
;
966 temp_slots
= p
->next
;
973 /* Find the temp slot corresponding to the object at address X. */
975 static struct temp_slot
*
976 find_temp_slot_from_address (x
)
982 for (p
= temp_slots
; p
; p
= p
->next
)
987 else if (XEXP (p
->slot
, 0) == x
989 || (GET_CODE (x
) == PLUS
990 && XEXP (x
, 0) == virtual_stack_vars_rtx
991 && GET_CODE (XEXP (x
, 1)) == CONST_INT
992 && INTVAL (XEXP (x
, 1)) >= p
->base_offset
993 && INTVAL (XEXP (x
, 1)) < p
->base_offset
+ p
->full_size
))
996 else if (p
->address
!= 0 && GET_CODE (p
->address
) == EXPR_LIST
)
997 for (next
= p
->address
; next
; next
= XEXP (next
, 1))
998 if (XEXP (next
, 0) == x
)
1002 /* If we have a sum involving a register, see if it points to a temp
1004 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 0)) == REG
1005 && (p
= find_temp_slot_from_address (XEXP (x
, 0))) != 0)
1007 else if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == REG
1008 && (p
= find_temp_slot_from_address (XEXP (x
, 1))) != 0)
1014 /* Indicate that NEW is an alternate way of referring to the temp slot
1015 that previously was known by OLD. */
1018 update_temp_slot_address (old
, new)
1021 struct temp_slot
*p
;
1023 if (rtx_equal_p (old
, new))
1026 p
= find_temp_slot_from_address (old
);
1028 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
1029 is a register, see if one operand of the PLUS is a temporary
1030 location. If so, NEW points into it. Otherwise, if both OLD and
1031 NEW are a PLUS and if there is a register in common between them.
1032 If so, try a recursive call on those values. */
1035 if (GET_CODE (old
) != PLUS
)
1038 if (GET_CODE (new) == REG
)
1040 update_temp_slot_address (XEXP (old
, 0), new);
1041 update_temp_slot_address (XEXP (old
, 1), new);
1044 else if (GET_CODE (new) != PLUS
)
1047 if (rtx_equal_p (XEXP (old
, 0), XEXP (new, 0)))
1048 update_temp_slot_address (XEXP (old
, 1), XEXP (new, 1));
1049 else if (rtx_equal_p (XEXP (old
, 1), XEXP (new, 0)))
1050 update_temp_slot_address (XEXP (old
, 0), XEXP (new, 1));
1051 else if (rtx_equal_p (XEXP (old
, 0), XEXP (new, 1)))
1052 update_temp_slot_address (XEXP (old
, 1), XEXP (new, 0));
1053 else if (rtx_equal_p (XEXP (old
, 1), XEXP (new, 1)))
1054 update_temp_slot_address (XEXP (old
, 0), XEXP (new, 0));
1059 /* Otherwise add an alias for the temp's address. */
1060 else if (p
->address
== 0)
1064 if (GET_CODE (p
->address
) != EXPR_LIST
)
1065 p
->address
= gen_rtx_EXPR_LIST (VOIDmode
, p
->address
, NULL_RTX
);
1067 p
->address
= gen_rtx_EXPR_LIST (VOIDmode
, new, p
->address
);
1071 /* If X could be a reference to a temporary slot, mark the fact that its
1072 address was taken. */
1075 mark_temp_addr_taken (x
)
1078 struct temp_slot
*p
;
1083 /* If X is not in memory or is at a constant address, it cannot be in
1084 a temporary slot. */
1085 if (GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0)))
1088 p
= find_temp_slot_from_address (XEXP (x
, 0));
1093 /* If X could be a reference to a temporary slot, mark that slot as
1094 belonging to the to one level higher than the current level. If X
1095 matched one of our slots, just mark that one. Otherwise, we can't
1096 easily predict which it is, so upgrade all of them. Kept slots
1097 need not be touched.
1099 This is called when an ({...}) construct occurs and a statement
1100 returns a value in memory. */
1103 preserve_temp_slots (x
)
1106 struct temp_slot
*p
= 0;
1108 /* If there is no result, we still might have some objects whose address
1109 were taken, so we need to make sure they stay around. */
1112 for (p
= temp_slots
; p
; p
= p
->next
)
1113 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->addr_taken
)
1119 /* If X is a register that is being used as a pointer, see if we have
1120 a temporary slot we know it points to. To be consistent with
1121 the code below, we really should preserve all non-kept slots
1122 if we can't find a match, but that seems to be much too costly. */
1123 if (GET_CODE (x
) == REG
&& REGNO_POINTER_FLAG (REGNO (x
)))
1124 p
= find_temp_slot_from_address (x
);
1126 /* If X is not in memory or is at a constant address, it cannot be in
1127 a temporary slot, but it can contain something whose address was
1129 if (p
== 0 && (GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0))))
1131 for (p
= temp_slots
; p
; p
= p
->next
)
1132 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->addr_taken
)
1138 /* First see if we can find a match. */
1140 p
= find_temp_slot_from_address (XEXP (x
, 0));
1144 /* Move everything at our level whose address was taken to our new
1145 level in case we used its address. */
1146 struct temp_slot
*q
;
1148 if (p
->level
== temp_slot_level
)
1150 for (q
= temp_slots
; q
; q
= q
->next
)
1151 if (q
!= p
&& q
->addr_taken
&& q
->level
== p
->level
)
1160 /* Otherwise, preserve all non-kept slots at this level. */
1161 for (p
= temp_slots
; p
; p
= p
->next
)
1162 if (p
->in_use
&& p
->level
== temp_slot_level
&& ! p
->keep
)
1166 /* X is the result of an RTL_EXPR. If it is a temporary slot associated
1167 with that RTL_EXPR, promote it into a temporary slot at the present
1168 level so it will not be freed when we free slots made in the
1172 preserve_rtl_expr_result (x
)
1175 struct temp_slot
*p
;
1177 /* If X is not in memory or is at a constant address, it cannot be in
1178 a temporary slot. */
1179 if (x
== 0 || GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0)))
1182 /* If we can find a match, move it to our level unless it is already at
1184 p
= find_temp_slot_from_address (XEXP (x
, 0));
1187 p
->level
= MIN (p
->level
, temp_slot_level
);
1194 /* Free all temporaries used so far. This is normally called at the end
1195 of generating code for a statement. Don't free any temporaries
1196 currently in use for an RTL_EXPR that hasn't yet been emitted.
1197 We could eventually do better than this since it can be reused while
1198 generating the same RTL_EXPR, but this is complex and probably not
1204 struct temp_slot
*p
;
1206 for (p
= temp_slots
; p
; p
= p
->next
)
1207 if (p
->in_use
&& p
->level
== temp_slot_level
&& ! p
->keep
1208 && p
->rtl_expr
== 0)
1211 combine_temp_slots ();
1214 /* Free all temporary slots used in T, an RTL_EXPR node. */
1217 free_temps_for_rtl_expr (t
)
1220 struct temp_slot
*p
;
1222 for (p
= temp_slots
; p
; p
= p
->next
)
1223 if (p
->rtl_expr
== t
)
1225 /* If this slot is below the current TEMP_SLOT_LEVEL, then it
1226 needs to be preserved. This can happen if a temporary in
1227 the RTL_EXPR was addressed; preserve_temp_slots will move
1228 the temporary into a higher level. */
1229 if (temp_slot_level
<= p
->level
)
1232 p
->rtl_expr
= NULL_TREE
;
1235 combine_temp_slots ();
1238 /* Mark all temporaries ever allocated in this function as not suitable
1239 for reuse until the current level is exited. */
1242 mark_all_temps_used ()
1244 struct temp_slot
*p
;
1246 for (p
= temp_slots
; p
; p
= p
->next
)
1248 p
->in_use
= p
->keep
= 1;
1249 p
->level
= MIN (p
->level
, temp_slot_level
);
1253 /* Push deeper into the nesting level for stack temporaries. */
1261 /* Likewise, but save the new level as the place to allocate variables
1266 push_temp_slots_for_block ()
1270 var_temp_slot_level
= temp_slot_level
;
1273 /* Likewise, but save the new level as the place to allocate temporaries
1274 for TARGET_EXPRs. */
1277 push_temp_slots_for_target ()
1281 target_temp_slot_level
= temp_slot_level
;
1284 /* Set and get the value of target_temp_slot_level. The only
1285 permitted use of these functions is to save and restore this value. */
1288 get_target_temp_slot_level ()
1290 return target_temp_slot_level
;
1294 set_target_temp_slot_level (level
)
1297 target_temp_slot_level
= level
;
1301 /* Pop a temporary nesting level. All slots in use in the current level
1307 struct temp_slot
*p
;
1309 for (p
= temp_slots
; p
; p
= p
->next
)
1310 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->rtl_expr
== 0)
1313 combine_temp_slots ();
1318 /* Initialize temporary slots. */
1323 /* We have not allocated any temporaries yet. */
1325 temp_slot_level
= 0;
1326 var_temp_slot_level
= 0;
1327 target_temp_slot_level
= 0;
1330 /* Retroactively move an auto variable from a register to a stack slot.
1331 This is done when an address-reference to the variable is seen. */
1334 put_var_into_stack (decl
)
1338 enum machine_mode promoted_mode
, decl_mode
;
1339 struct function
*function
= 0;
1341 int can_use_addressof
;
1342 int volatilep
= TREE_CODE (decl
) != SAVE_EXPR
&& TREE_THIS_VOLATILE (decl
);
1343 int usedp
= (TREE_USED (decl
)
1344 || (TREE_CODE (decl
) != SAVE_EXPR
&& DECL_INITIAL (decl
) != 0));
1346 context
= decl_function_context (decl
);
1348 /* Get the current rtl used for this object and its original mode. */
1349 reg
= TREE_CODE (decl
) == SAVE_EXPR
? SAVE_EXPR_RTL (decl
) : DECL_RTL (decl
);
1351 /* No need to do anything if decl has no rtx yet
1352 since in that case caller is setting TREE_ADDRESSABLE
1353 and a stack slot will be assigned when the rtl is made. */
1357 /* Get the declared mode for this object. */
1358 decl_mode
= (TREE_CODE (decl
) == SAVE_EXPR
? TYPE_MODE (TREE_TYPE (decl
))
1359 : DECL_MODE (decl
));
1360 /* Get the mode it's actually stored in. */
1361 promoted_mode
= GET_MODE (reg
);
1363 /* If this variable comes from an outer function,
1364 find that function's saved context. */
1365 if (context
!= current_function_decl
&& context
!= inline_function_decl
)
1366 for (function
= outer_function_chain
; function
; function
= function
->next
)
1367 if (function
->decl
== context
)
1370 /* If this is a variable-size object with a pseudo to address it,
1371 put that pseudo into the stack, if the var is nonlocal. */
1372 if (TREE_CODE (decl
) != SAVE_EXPR
&& DECL_NONLOCAL (decl
)
1373 && GET_CODE (reg
) == MEM
1374 && GET_CODE (XEXP (reg
, 0)) == REG
1375 && REGNO (XEXP (reg
, 0)) > LAST_VIRTUAL_REGISTER
)
1377 reg
= XEXP (reg
, 0);
1378 decl_mode
= promoted_mode
= GET_MODE (reg
);
1384 /* FIXME make it work for promoted modes too */
1385 && decl_mode
== promoted_mode
1386 #ifdef NON_SAVING_SETJMP
1387 && ! (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
1391 /* If we can't use ADDRESSOF, make sure we see through one we already
1393 if (! can_use_addressof
&& GET_CODE (reg
) == MEM
1394 && GET_CODE (XEXP (reg
, 0)) == ADDRESSOF
)
1395 reg
= XEXP (XEXP (reg
, 0), 0);
1397 /* Now we should have a value that resides in one or more pseudo regs. */
1399 if (GET_CODE (reg
) == REG
)
1401 /* If this variable lives in the current function and we don't need
1402 to put things in the stack for the sake of setjmp, try to keep it
1403 in a register until we know we actually need the address. */
1404 if (can_use_addressof
)
1405 gen_mem_addressof (reg
, decl
);
1407 put_reg_into_stack (function
, reg
, TREE_TYPE (decl
), promoted_mode
,
1408 decl_mode
, volatilep
, 0, usedp
, 0);
1410 else if (GET_CODE (reg
) == CONCAT
)
1412 /* A CONCAT contains two pseudos; put them both in the stack.
1413 We do it so they end up consecutive.
1414 We fixup references to the parts only after we fixup references
1415 to the whole CONCAT, lest we do double fixups for the latter
1417 enum machine_mode part_mode
= GET_MODE (XEXP (reg
, 0));
1418 tree part_type
= type_for_mode (part_mode
, 0);
1419 rtx lopart
= XEXP (reg
, 0);
1420 rtx hipart
= XEXP (reg
, 1);
1421 #ifdef FRAME_GROWS_DOWNWARD
1422 /* Since part 0 should have a lower address, do it second. */
1423 put_reg_into_stack (function
, hipart
, part_type
, part_mode
,
1424 part_mode
, volatilep
, 0, 0, 0);
1425 put_reg_into_stack (function
, lopart
, part_type
, part_mode
,
1426 part_mode
, volatilep
, 0, 0, 0);
1428 put_reg_into_stack (function
, lopart
, part_type
, part_mode
,
1429 part_mode
, volatilep
, 0, 0, 0);
1430 put_reg_into_stack (function
, hipart
, part_type
, part_mode
,
1431 part_mode
, volatilep
, 0, 0, 0);
1434 /* Change the CONCAT into a combined MEM for both parts. */
1435 PUT_CODE (reg
, MEM
);
1436 set_mem_attributes (reg
, decl
, 1);
1438 /* The two parts are in memory order already.
1439 Use the lower parts address as ours. */
1440 XEXP (reg
, 0) = XEXP (XEXP (reg
, 0), 0);
1441 /* Prevent sharing of rtl that might lose. */
1442 if (GET_CODE (XEXP (reg
, 0)) == PLUS
)
1443 XEXP (reg
, 0) = copy_rtx (XEXP (reg
, 0));
1446 schedule_fixup_var_refs (function
, reg
, TREE_TYPE (decl
),
1448 schedule_fixup_var_refs (function
, lopart
, part_type
, part_mode
, 0);
1449 schedule_fixup_var_refs (function
, hipart
, part_type
, part_mode
, 0);
1455 if (current_function_check_memory_usage
)
1456 emit_library_call (chkr_set_right_libfunc
, 1, VOIDmode
, 3,
1457 XEXP (reg
, 0), Pmode
,
1458 GEN_INT (GET_MODE_SIZE (GET_MODE (reg
))),
1459 TYPE_MODE (sizetype
),
1460 GEN_INT (MEMORY_USE_RW
),
1461 TYPE_MODE (integer_type_node
));
1464 /* Subroutine of put_var_into_stack. This puts a single pseudo reg REG
1465 into the stack frame of FUNCTION (0 means the current function).
1466 DECL_MODE is the machine mode of the user-level data type.
1467 PROMOTED_MODE is the machine mode of the register.
1468 VOLATILE_P is nonzero if this is for a "volatile" decl.
1469 USED_P is nonzero if this reg might have already been used in an insn. */
1472 put_reg_into_stack (function
, reg
, type
, promoted_mode
, decl_mode
, volatile_p
,
1473 original_regno
, used_p
, ht
)
1474 struct function
*function
;
1477 enum machine_mode promoted_mode
, decl_mode
;
1479 unsigned int original_regno
;
1481 struct hash_table
*ht
;
1483 struct function
*func
= function
? function
: cfun
;
1485 unsigned int regno
= original_regno
;
1488 regno
= REGNO (reg
);
1490 if (regno
< func
->x_max_parm_reg
)
1491 new = func
->x_parm_reg_stack_loc
[regno
];
1494 new = assign_stack_local_1 (decl_mode
, GET_MODE_SIZE (decl_mode
), 0, func
);
1496 PUT_CODE (reg
, MEM
);
1497 PUT_MODE (reg
, decl_mode
);
1498 XEXP (reg
, 0) = XEXP (new, 0);
1499 /* `volatil' bit means one thing for MEMs, another entirely for REGs. */
1500 MEM_VOLATILE_P (reg
) = volatile_p
;
1502 /* If this is a memory ref that contains aggregate components,
1503 mark it as such for cse and loop optimize. If we are reusing a
1504 previously generated stack slot, then we need to copy the bit in
1505 case it was set for other reasons. For instance, it is set for
1506 __builtin_va_alist. */
1509 MEM_SET_IN_STRUCT_P (reg
,
1510 AGGREGATE_TYPE_P (type
) || MEM_IN_STRUCT_P (new));
1511 MEM_ALIAS_SET (reg
) = get_alias_set (type
);
1514 schedule_fixup_var_refs (function
, reg
, type
, promoted_mode
, ht
);
1517 /* Make sure that all refs to the variable, previously made
1518 when it was a register, are fixed up to be valid again.
1519 See function above for meaning of arguments. */
1521 schedule_fixup_var_refs (function
, reg
, type
, promoted_mode
, ht
)
1522 struct function
*function
;
1525 enum machine_mode promoted_mode
;
1526 struct hash_table
*ht
;
1528 int unsigned_p
= type
? TREE_UNSIGNED (type
) : 0;
1532 struct var_refs_queue
*temp
;
1535 = (struct var_refs_queue
*) xmalloc (sizeof (struct var_refs_queue
));
1536 temp
->modified
= reg
;
1537 temp
->promoted_mode
= promoted_mode
;
1538 temp
->unsignedp
= unsigned_p
;
1539 temp
->next
= function
->fixup_var_refs_queue
;
1540 function
->fixup_var_refs_queue
= temp
;
1543 /* Variable is local; fix it up now. */
1544 fixup_var_refs (reg
, promoted_mode
, unsigned_p
, ht
);
1548 fixup_var_refs (var
, promoted_mode
, unsignedp
, ht
)
1550 enum machine_mode promoted_mode
;
1552 struct hash_table
*ht
;
1555 rtx first_insn
= get_insns ();
1556 struct sequence_stack
*stack
= seq_stack
;
1557 tree rtl_exps
= rtl_expr_chain
;
1560 /* Must scan all insns for stack-refs that exceed the limit. */
1561 fixup_var_refs_insns (var
, promoted_mode
, unsignedp
, first_insn
,
1563 /* If there's a hash table, it must record all uses of VAR. */
1567 /* Scan all pending sequences too. */
1568 for (; stack
; stack
= stack
->next
)
1570 push_to_sequence (stack
->first
);
1571 fixup_var_refs_insns (var
, promoted_mode
, unsignedp
,
1572 stack
->first
, stack
->next
!= 0, 0);
1573 /* Update remembered end of sequence
1574 in case we added an insn at the end. */
1575 stack
->last
= get_last_insn ();
1579 /* Scan all waiting RTL_EXPRs too. */
1580 for (pending
= rtl_exps
; pending
; pending
= TREE_CHAIN (pending
))
1582 rtx seq
= RTL_EXPR_SEQUENCE (TREE_VALUE (pending
));
1583 if (seq
!= const0_rtx
&& seq
!= 0)
1585 push_to_sequence (seq
);
1586 fixup_var_refs_insns (var
, promoted_mode
, unsignedp
, seq
, 0, 0);
1591 /* Scan the catch clauses for exception handling too. */
1592 push_to_full_sequence (catch_clauses
, catch_clauses_last
);
1593 fixup_var_refs_insns (var
, promoted_mode
, unsignedp
, catch_clauses
, 0, 0);
1594 end_full_sequence (&catch_clauses
, &catch_clauses_last
);
1596 /* Scan sequences saved in CALL_PLACEHOLDERS too. */
1597 for (insn
= first_insn
; insn
; insn
= NEXT_INSN (insn
))
1599 if (GET_CODE (insn
) == CALL_INSN
1600 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
1604 /* Look at the Normal call, sibling call and tail recursion
1605 sequences attached to the CALL_PLACEHOLDER. */
1606 for (i
= 0; i
< 3; i
++)
1608 rtx seq
= XEXP (PATTERN (insn
), i
);
1611 push_to_sequence (seq
);
1612 fixup_var_refs_insns (var
, promoted_mode
, unsignedp
,
1614 XEXP (PATTERN (insn
), i
) = get_insns ();
1622 /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is
1623 some part of an insn. Return a struct fixup_replacement whose OLD
1624 value is equal to X. Allocate a new structure if no such entry exists. */
1626 static struct fixup_replacement
*
1627 find_fixup_replacement (replacements
, x
)
1628 struct fixup_replacement
**replacements
;
1631 struct fixup_replacement
*p
;
1633 /* See if we have already replaced this. */
1634 for (p
= *replacements
; p
!= 0 && ! rtx_equal_p (p
->old
, x
); p
= p
->next
)
1639 p
= (struct fixup_replacement
*) oballoc (sizeof (struct fixup_replacement
));
1642 p
->next
= *replacements
;
1649 /* Scan the insn-chain starting with INSN for refs to VAR
1650 and fix them up. TOPLEVEL is nonzero if this chain is the
1651 main chain of insns for the current function. */
1654 fixup_var_refs_insns (var
, promoted_mode
, unsignedp
, insn
, toplevel
, ht
)
1656 enum machine_mode promoted_mode
;
1660 struct hash_table
*ht
;
1663 rtx insn_list
= NULL_RTX
;
1665 /* If we already know which INSNs reference VAR there's no need
1666 to walk the entire instruction chain. */
1669 insn_list
= ((struct insns_for_mem_entry
*)
1670 hash_lookup (ht
, var
, /*create=*/0, /*copy=*/0))->insns
;
1671 insn
= insn_list
? XEXP (insn_list
, 0) : NULL_RTX
;
1672 insn_list
= XEXP (insn_list
, 1);
1677 rtx next
= NEXT_INSN (insn
);
1678 rtx set
, prev
, prev_set
;
1683 /* Remember the notes in case we delete the insn. */
1684 note
= REG_NOTES (insn
);
1686 /* If this is a CLOBBER of VAR, delete it.
1688 If it has a REG_LIBCALL note, delete the REG_LIBCALL
1689 and REG_RETVAL notes too. */
1690 if (GET_CODE (PATTERN (insn
)) == CLOBBER
1691 && (XEXP (PATTERN (insn
), 0) == var
1692 || (GET_CODE (XEXP (PATTERN (insn
), 0)) == CONCAT
1693 && (XEXP (XEXP (PATTERN (insn
), 0), 0) == var
1694 || XEXP (XEXP (PATTERN (insn
), 0), 1) == var
))))
1696 if ((note
= find_reg_note (insn
, REG_LIBCALL
, NULL_RTX
)) != 0)
1697 /* The REG_LIBCALL note will go away since we are going to
1698 turn INSN into a NOTE, so just delete the
1699 corresponding REG_RETVAL note. */
1700 remove_note (XEXP (note
, 0),
1701 find_reg_note (XEXP (note
, 0), REG_RETVAL
,
1704 /* In unoptimized compilation, we shouldn't call delete_insn
1705 except in jump.c doing warnings. */
1706 PUT_CODE (insn
, NOTE
);
1707 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1708 NOTE_SOURCE_FILE (insn
) = 0;
1711 /* The insn to load VAR from a home in the arglist
1712 is now a no-op. When we see it, just delete it.
1713 Similarly if this is storing VAR from a register from which
1714 it was loaded in the previous insn. This will occur
1715 when an ADDRESSOF was made for an arglist slot. */
1717 && (set
= single_set (insn
)) != 0
1718 && SET_DEST (set
) == var
1719 /* If this represents the result of an insn group,
1720 don't delete the insn. */
1721 && find_reg_note (insn
, REG_RETVAL
, NULL_RTX
) == 0
1722 && (rtx_equal_p (SET_SRC (set
), var
)
1723 || (GET_CODE (SET_SRC (set
)) == REG
1724 && (prev
= prev_nonnote_insn (insn
)) != 0
1725 && (prev_set
= single_set (prev
)) != 0
1726 && SET_DEST (prev_set
) == SET_SRC (set
)
1727 && rtx_equal_p (SET_SRC (prev_set
), var
))))
1729 /* In unoptimized compilation, we shouldn't call delete_insn
1730 except in jump.c doing warnings. */
1731 PUT_CODE (insn
, NOTE
);
1732 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1733 NOTE_SOURCE_FILE (insn
) = 0;
1734 if (insn
== last_parm_insn
)
1735 last_parm_insn
= PREV_INSN (next
);
1739 struct fixup_replacement
*replacements
= 0;
1740 rtx next_insn
= NEXT_INSN (insn
);
1742 if (SMALL_REGISTER_CLASSES
)
1744 /* If the insn that copies the results of a CALL_INSN
1745 into a pseudo now references VAR, we have to use an
1746 intermediate pseudo since we want the life of the
1747 return value register to be only a single insn.
1749 If we don't use an intermediate pseudo, such things as
1750 address computations to make the address of VAR valid
1751 if it is not can be placed between the CALL_INSN and INSN.
1753 To make sure this doesn't happen, we record the destination
1754 of the CALL_INSN and see if the next insn uses both that
1757 if (call_dest
!= 0 && GET_CODE (insn
) == INSN
1758 && reg_mentioned_p (var
, PATTERN (insn
))
1759 && reg_mentioned_p (call_dest
, PATTERN (insn
)))
1761 rtx temp
= gen_reg_rtx (GET_MODE (call_dest
));
1763 emit_insn_before (gen_move_insn (temp
, call_dest
), insn
);
1765 PATTERN (insn
) = replace_rtx (PATTERN (insn
),
1769 if (GET_CODE (insn
) == CALL_INSN
1770 && GET_CODE (PATTERN (insn
)) == SET
)
1771 call_dest
= SET_DEST (PATTERN (insn
));
1772 else if (GET_CODE (insn
) == CALL_INSN
1773 && GET_CODE (PATTERN (insn
)) == PARALLEL
1774 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == SET
)
1775 call_dest
= SET_DEST (XVECEXP (PATTERN (insn
), 0, 0));
1780 /* See if we have to do anything to INSN now that VAR is in
1781 memory. If it needs to be loaded into a pseudo, use a single
1782 pseudo for the entire insn in case there is a MATCH_DUP
1783 between two operands. We pass a pointer to the head of
1784 a list of struct fixup_replacements. If fixup_var_refs_1
1785 needs to allocate pseudos or replacement MEMs (for SUBREGs),
1786 it will record them in this list.
1788 If it allocated a pseudo for any replacement, we copy into
1791 fixup_var_refs_1 (var
, promoted_mode
, &PATTERN (insn
), insn
,
1794 /* If this is last_parm_insn, and any instructions were output
1795 after it to fix it up, then we must set last_parm_insn to
1796 the last such instruction emitted. */
1797 if (insn
== last_parm_insn
)
1798 last_parm_insn
= PREV_INSN (next_insn
);
1800 while (replacements
)
1802 if (GET_CODE (replacements
->new) == REG
)
1807 /* OLD might be a (subreg (mem)). */
1808 if (GET_CODE (replacements
->old
) == SUBREG
)
1810 = fixup_memory_subreg (replacements
->old
, insn
, 0);
1813 = fixup_stack_1 (replacements
->old
, insn
);
1815 insert_before
= insn
;
1817 /* If we are changing the mode, do a conversion.
1818 This might be wasteful, but combine.c will
1819 eliminate much of the waste. */
1821 if (GET_MODE (replacements
->new)
1822 != GET_MODE (replacements
->old
))
1825 convert_move (replacements
->new,
1826 replacements
->old
, unsignedp
);
1827 seq
= gen_sequence ();
1831 seq
= gen_move_insn (replacements
->new,
1834 emit_insn_before (seq
, insert_before
);
1837 replacements
= replacements
->next
;
1841 /* Also fix up any invalid exprs in the REG_NOTES of this insn.
1842 But don't touch other insns referred to by reg-notes;
1843 we will get them elsewhere. */
1846 if (GET_CODE (note
) != INSN_LIST
)
1848 = walk_fixup_memory_subreg (XEXP (note
, 0), insn
, 1);
1849 note
= XEXP (note
, 1);
1857 insn
= XEXP (insn_list
, 0);
1858 insn_list
= XEXP (insn_list
, 1);
1865 /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
1866 See if the rtx expression at *LOC in INSN needs to be changed.
1868 REPLACEMENTS is a pointer to a list head that starts out zero, but may
1869 contain a list of original rtx's and replacements. If we find that we need
1870 to modify this insn by replacing a memory reference with a pseudo or by
1871 making a new MEM to implement a SUBREG, we consult that list to see if
1872 we have already chosen a replacement. If none has already been allocated,
1873 we allocate it and update the list. fixup_var_refs_insns will copy VAR
1874 or the SUBREG, as appropriate, to the pseudo. */
1877 fixup_var_refs_1 (var
, promoted_mode
, loc
, insn
, replacements
)
1879 enum machine_mode promoted_mode
;
1882 struct fixup_replacement
**replacements
;
1885 register rtx x
= *loc
;
1886 RTX_CODE code
= GET_CODE (x
);
1887 register const char *fmt
;
1888 register rtx tem
, tem1
;
1889 struct fixup_replacement
*replacement
;
1894 if (XEXP (x
, 0) == var
)
1896 /* Prevent sharing of rtl that might lose. */
1897 rtx sub
= copy_rtx (XEXP (var
, 0));
1899 if (! validate_change (insn
, loc
, sub
, 0))
1901 rtx y
= gen_reg_rtx (GET_MODE (sub
));
1904 /* We should be able to replace with a register or all is lost.
1905 Note that we can't use validate_change to verify this, since
1906 we're not caring for replacing all dups simultaneously. */
1907 if (! validate_replace_rtx (*loc
, y
, insn
))
1910 /* Careful! First try to recognize a direct move of the
1911 value, mimicking how things are done in gen_reload wrt
1912 PLUS. Consider what happens when insn is a conditional
1913 move instruction and addsi3 clobbers flags. */
1916 new_insn
= emit_insn (gen_rtx_SET (VOIDmode
, y
, sub
));
1917 seq
= gen_sequence ();
1920 if (recog_memoized (new_insn
) < 0)
1922 /* That failed. Fall back on force_operand and hope. */
1925 force_operand (sub
, y
);
1926 seq
= gen_sequence ();
1931 /* Don't separate setter from user. */
1932 if (PREV_INSN (insn
) && sets_cc0_p (PREV_INSN (insn
)))
1933 insn
= PREV_INSN (insn
);
1936 emit_insn_before (seq
, insn
);
1944 /* If we already have a replacement, use it. Otherwise,
1945 try to fix up this address in case it is invalid. */
1947 replacement
= find_fixup_replacement (replacements
, var
);
1948 if (replacement
->new)
1950 *loc
= replacement
->new;
1954 *loc
= replacement
->new = x
= fixup_stack_1 (x
, insn
);
1956 /* Unless we are forcing memory to register or we changed the mode,
1957 we can leave things the way they are if the insn is valid. */
1959 INSN_CODE (insn
) = -1;
1960 if (! flag_force_mem
&& GET_MODE (x
) == promoted_mode
1961 && recog_memoized (insn
) >= 0)
1964 *loc
= replacement
->new = gen_reg_rtx (promoted_mode
);
1968 /* If X contains VAR, we need to unshare it here so that we update
1969 each occurrence separately. But all identical MEMs in one insn
1970 must be replaced with the same rtx because of the possibility of
1973 if (reg_mentioned_p (var
, x
))
1975 replacement
= find_fixup_replacement (replacements
, x
);
1976 if (replacement
->new == 0)
1977 replacement
->new = copy_most_rtx (x
, var
);
1979 *loc
= x
= replacement
->new;
1980 code
= GET_CODE (x
);
1996 /* Note that in some cases those types of expressions are altered
1997 by optimize_bit_field, and do not survive to get here. */
1998 if (XEXP (x
, 0) == var
1999 || (GET_CODE (XEXP (x
, 0)) == SUBREG
2000 && SUBREG_REG (XEXP (x
, 0)) == var
))
2002 /* Get TEM as a valid MEM in the mode presently in the insn.
2004 We don't worry about the possibility of MATCH_DUP here; it
2005 is highly unlikely and would be tricky to handle. */
2008 if (GET_CODE (tem
) == SUBREG
)
2010 if (GET_MODE_BITSIZE (GET_MODE (tem
))
2011 > GET_MODE_BITSIZE (GET_MODE (var
)))
2013 replacement
= find_fixup_replacement (replacements
, var
);
2014 if (replacement
->new == 0)
2015 replacement
->new = gen_reg_rtx (GET_MODE (var
));
2016 SUBREG_REG (tem
) = replacement
->new;
2019 tem
= fixup_memory_subreg (tem
, insn
, 0);
2022 tem
= fixup_stack_1 (tem
, insn
);
2024 /* Unless we want to load from memory, get TEM into the proper mode
2025 for an extract from memory. This can only be done if the
2026 extract is at a constant position and length. */
2028 if (! flag_force_mem
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
2029 && GET_CODE (XEXP (x
, 2)) == CONST_INT
2030 && ! mode_dependent_address_p (XEXP (tem
, 0))
2031 && ! MEM_VOLATILE_P (tem
))
2033 enum machine_mode wanted_mode
= VOIDmode
;
2034 enum machine_mode is_mode
= GET_MODE (tem
);
2035 HOST_WIDE_INT pos
= INTVAL (XEXP (x
, 2));
2038 if (GET_CODE (x
) == ZERO_EXTRACT
)
2041 = insn_data
[(int) CODE_FOR_extzv
].operand
[1].mode
;
2042 if (wanted_mode
== VOIDmode
)
2043 wanted_mode
= word_mode
;
2047 if (GET_CODE (x
) == SIGN_EXTRACT
)
2049 wanted_mode
= insn_data
[(int) CODE_FOR_extv
].operand
[1].mode
;
2050 if (wanted_mode
== VOIDmode
)
2051 wanted_mode
= word_mode
;
2054 /* If we have a narrower mode, we can do something. */
2055 if (wanted_mode
!= VOIDmode
2056 && GET_MODE_SIZE (wanted_mode
) < GET_MODE_SIZE (is_mode
))
2058 HOST_WIDE_INT offset
= pos
/ BITS_PER_UNIT
;
2059 rtx old_pos
= XEXP (x
, 2);
2062 /* If the bytes and bits are counted differently, we
2063 must adjust the offset. */
2064 if (BYTES_BIG_ENDIAN
!= BITS_BIG_ENDIAN
)
2065 offset
= (GET_MODE_SIZE (is_mode
)
2066 - GET_MODE_SIZE (wanted_mode
) - offset
);
2068 pos
%= GET_MODE_BITSIZE (wanted_mode
);
2070 newmem
= gen_rtx_MEM (wanted_mode
,
2071 plus_constant (XEXP (tem
, 0), offset
));
2072 MEM_COPY_ATTRIBUTES (newmem
, tem
);
2074 /* Make the change and see if the insn remains valid. */
2075 INSN_CODE (insn
) = -1;
2076 XEXP (x
, 0) = newmem
;
2077 XEXP (x
, 2) = GEN_INT (pos
);
2079 if (recog_memoized (insn
) >= 0)
2082 /* Otherwise, restore old position. XEXP (x, 0) will be
2084 XEXP (x
, 2) = old_pos
;
2088 /* If we get here, the bitfield extract insn can't accept a memory
2089 reference. Copy the input into a register. */
2091 tem1
= gen_reg_rtx (GET_MODE (tem
));
2092 emit_insn_before (gen_move_insn (tem1
, tem
), insn
);
2099 if (SUBREG_REG (x
) == var
)
2101 /* If this is a special SUBREG made because VAR was promoted
2102 from a wider mode, replace it with VAR and call ourself
2103 recursively, this time saying that the object previously
2104 had its current mode (by virtue of the SUBREG). */
2106 if (SUBREG_PROMOTED_VAR_P (x
))
2109 fixup_var_refs_1 (var
, GET_MODE (var
), loc
, insn
, replacements
);
2113 /* If this SUBREG makes VAR wider, it has become a paradoxical
2114 SUBREG with VAR in memory, but these aren't allowed at this
2115 stage of the compilation. So load VAR into a pseudo and take
2116 a SUBREG of that pseudo. */
2117 if (GET_MODE_SIZE (GET_MODE (x
)) > GET_MODE_SIZE (GET_MODE (var
)))
2119 replacement
= find_fixup_replacement (replacements
, var
);
2120 if (replacement
->new == 0)
2121 replacement
->new = gen_reg_rtx (GET_MODE (var
));
2122 SUBREG_REG (x
) = replacement
->new;
2126 /* See if we have already found a replacement for this SUBREG.
2127 If so, use it. Otherwise, make a MEM and see if the insn
2128 is recognized. If not, or if we should force MEM into a register,
2129 make a pseudo for this SUBREG. */
2130 replacement
= find_fixup_replacement (replacements
, x
);
2131 if (replacement
->new)
2133 *loc
= replacement
->new;
2137 replacement
->new = *loc
= fixup_memory_subreg (x
, insn
, 0);
2139 INSN_CODE (insn
) = -1;
2140 if (! flag_force_mem
&& recog_memoized (insn
) >= 0)
2143 *loc
= replacement
->new = gen_reg_rtx (GET_MODE (x
));
2149 /* First do special simplification of bit-field references. */
2150 if (GET_CODE (SET_DEST (x
)) == SIGN_EXTRACT
2151 || GET_CODE (SET_DEST (x
)) == ZERO_EXTRACT
)
2152 optimize_bit_field (x
, insn
, 0);
2153 if (GET_CODE (SET_SRC (x
)) == SIGN_EXTRACT
2154 || GET_CODE (SET_SRC (x
)) == ZERO_EXTRACT
)
2155 optimize_bit_field (x
, insn
, NULL_PTR
);
2157 /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object
2158 into a register and then store it back out. */
2159 if (GET_CODE (SET_DEST (x
)) == ZERO_EXTRACT
2160 && GET_CODE (XEXP (SET_DEST (x
), 0)) == SUBREG
2161 && SUBREG_REG (XEXP (SET_DEST (x
), 0)) == var
2162 && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x
), 0)))
2163 > GET_MODE_SIZE (GET_MODE (var
))))
2165 replacement
= find_fixup_replacement (replacements
, var
);
2166 if (replacement
->new == 0)
2167 replacement
->new = gen_reg_rtx (GET_MODE (var
));
2169 SUBREG_REG (XEXP (SET_DEST (x
), 0)) = replacement
->new;
2170 emit_insn_after (gen_move_insn (var
, replacement
->new), insn
);
2173 /* If SET_DEST is now a paradoxical SUBREG, put the result of this
2174 insn into a pseudo and store the low part of the pseudo into VAR. */
2175 if (GET_CODE (SET_DEST (x
)) == SUBREG
2176 && SUBREG_REG (SET_DEST (x
)) == var
2177 && (GET_MODE_SIZE (GET_MODE (SET_DEST (x
)))
2178 > GET_MODE_SIZE (GET_MODE (var
))))
2180 SET_DEST (x
) = tem
= gen_reg_rtx (GET_MODE (SET_DEST (x
)));
2181 emit_insn_after (gen_move_insn (var
, gen_lowpart (GET_MODE (var
),
2188 rtx dest
= SET_DEST (x
);
2189 rtx src
= SET_SRC (x
);
2191 rtx outerdest
= dest
;
2194 while (GET_CODE (dest
) == SUBREG
|| GET_CODE (dest
) == STRICT_LOW_PART
2195 || GET_CODE (dest
) == SIGN_EXTRACT
2196 || GET_CODE (dest
) == ZERO_EXTRACT
)
2197 dest
= XEXP (dest
, 0);
2199 if (GET_CODE (src
) == SUBREG
)
2200 src
= XEXP (src
, 0);
2202 /* If VAR does not appear at the top level of the SET
2203 just scan the lower levels of the tree. */
2205 if (src
!= var
&& dest
!= var
)
2208 /* We will need to rerecognize this insn. */
2209 INSN_CODE (insn
) = -1;
2212 if (GET_CODE (outerdest
) == ZERO_EXTRACT
&& dest
== var
)
2214 /* Since this case will return, ensure we fixup all the
2216 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (outerdest
, 1),
2217 insn
, replacements
);
2218 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (outerdest
, 2),
2219 insn
, replacements
);
2220 fixup_var_refs_1 (var
, promoted_mode
, &SET_SRC (x
),
2221 insn
, replacements
);
2223 tem
= XEXP (outerdest
, 0);
2225 /* Clean up (SUBREG:SI (MEM:mode ...) 0)
2226 that may appear inside a ZERO_EXTRACT.
2227 This was legitimate when the MEM was a REG. */
2228 if (GET_CODE (tem
) == SUBREG
2229 && SUBREG_REG (tem
) == var
)
2230 tem
= fixup_memory_subreg (tem
, insn
, 0);
2232 tem
= fixup_stack_1 (tem
, insn
);
2234 if (GET_CODE (XEXP (outerdest
, 1)) == CONST_INT
2235 && GET_CODE (XEXP (outerdest
, 2)) == CONST_INT
2236 && ! mode_dependent_address_p (XEXP (tem
, 0))
2237 && ! MEM_VOLATILE_P (tem
))
2239 enum machine_mode wanted_mode
;
2240 enum machine_mode is_mode
= GET_MODE (tem
);
2241 HOST_WIDE_INT pos
= INTVAL (XEXP (outerdest
, 2));
2243 wanted_mode
= insn_data
[(int) CODE_FOR_insv
].operand
[0].mode
;
2244 if (wanted_mode
== VOIDmode
)
2245 wanted_mode
= word_mode
;
2247 /* If we have a narrower mode, we can do something. */
2248 if (GET_MODE_SIZE (wanted_mode
) < GET_MODE_SIZE (is_mode
))
2250 HOST_WIDE_INT offset
= pos
/ BITS_PER_UNIT
;
2251 rtx old_pos
= XEXP (outerdest
, 2);
2254 if (BYTES_BIG_ENDIAN
!= BITS_BIG_ENDIAN
)
2255 offset
= (GET_MODE_SIZE (is_mode
)
2256 - GET_MODE_SIZE (wanted_mode
) - offset
);
2258 pos
%= GET_MODE_BITSIZE (wanted_mode
);
2260 newmem
= gen_rtx_MEM (wanted_mode
,
2261 plus_constant (XEXP (tem
, 0),
2263 MEM_COPY_ATTRIBUTES (newmem
, tem
);
2265 /* Make the change and see if the insn remains valid. */
2266 INSN_CODE (insn
) = -1;
2267 XEXP (outerdest
, 0) = newmem
;
2268 XEXP (outerdest
, 2) = GEN_INT (pos
);
2270 if (recog_memoized (insn
) >= 0)
2273 /* Otherwise, restore old position. XEXP (x, 0) will be
2275 XEXP (outerdest
, 2) = old_pos
;
2279 /* If we get here, the bit-field store doesn't allow memory
2280 or isn't located at a constant position. Load the value into
2281 a register, do the store, and put it back into memory. */
2283 tem1
= gen_reg_rtx (GET_MODE (tem
));
2284 emit_insn_before (gen_move_insn (tem1
, tem
), insn
);
2285 emit_insn_after (gen_move_insn (tem
, tem1
), insn
);
2286 XEXP (outerdest
, 0) = tem1
;
2291 /* STRICT_LOW_PART is a no-op on memory references
2292 and it can cause combinations to be unrecognizable,
2295 if (dest
== var
&& GET_CODE (SET_DEST (x
)) == STRICT_LOW_PART
)
2296 SET_DEST (x
) = XEXP (SET_DEST (x
), 0);
2298 /* A valid insn to copy VAR into or out of a register
2299 must be left alone, to avoid an infinite loop here.
2300 If the reference to VAR is by a subreg, fix that up,
2301 since SUBREG is not valid for a memref.
2302 Also fix up the address of the stack slot.
2304 Note that we must not try to recognize the insn until
2305 after we know that we have valid addresses and no
2306 (subreg (mem ...) ...) constructs, since these interfere
2307 with determining the validity of the insn. */
2309 if ((SET_SRC (x
) == var
2310 || (GET_CODE (SET_SRC (x
)) == SUBREG
2311 && SUBREG_REG (SET_SRC (x
)) == var
))
2312 && (GET_CODE (SET_DEST (x
)) == REG
2313 || (GET_CODE (SET_DEST (x
)) == SUBREG
2314 && GET_CODE (SUBREG_REG (SET_DEST (x
))) == REG
))
2315 && GET_MODE (var
) == promoted_mode
2316 && x
== single_set (insn
))
2320 replacement
= find_fixup_replacement (replacements
, SET_SRC (x
));
2321 if (replacement
->new)
2322 SET_SRC (x
) = replacement
->new;
2323 else if (GET_CODE (SET_SRC (x
)) == SUBREG
)
2324 SET_SRC (x
) = replacement
->new
2325 = fixup_memory_subreg (SET_SRC (x
), insn
, 0);
2327 SET_SRC (x
) = replacement
->new
2328 = fixup_stack_1 (SET_SRC (x
), insn
);
2330 if (recog_memoized (insn
) >= 0)
2333 /* INSN is not valid, but we know that we want to
2334 copy SET_SRC (x) to SET_DEST (x) in some way. So
2335 we generate the move and see whether it requires more
2336 than one insn. If it does, we emit those insns and
2337 delete INSN. Otherwise, we an just replace the pattern
2338 of INSN; we have already verified above that INSN has
2339 no other function that to do X. */
2341 pat
= gen_move_insn (SET_DEST (x
), SET_SRC (x
));
2342 if (GET_CODE (pat
) == SEQUENCE
)
2344 emit_insn_after (pat
, insn
);
2345 PUT_CODE (insn
, NOTE
);
2346 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2347 NOTE_SOURCE_FILE (insn
) = 0;
2350 PATTERN (insn
) = pat
;
2355 if ((SET_DEST (x
) == var
2356 || (GET_CODE (SET_DEST (x
)) == SUBREG
2357 && SUBREG_REG (SET_DEST (x
)) == var
))
2358 && (GET_CODE (SET_SRC (x
)) == REG
2359 || (GET_CODE (SET_SRC (x
)) == SUBREG
2360 && GET_CODE (SUBREG_REG (SET_SRC (x
))) == REG
))
2361 && GET_MODE (var
) == promoted_mode
2362 && x
== single_set (insn
))
2366 if (GET_CODE (SET_DEST (x
)) == SUBREG
)
2367 SET_DEST (x
) = fixup_memory_subreg (SET_DEST (x
), insn
, 0);
2369 SET_DEST (x
) = fixup_stack_1 (SET_DEST (x
), insn
);
2371 if (recog_memoized (insn
) >= 0)
2374 pat
= gen_move_insn (SET_DEST (x
), SET_SRC (x
));
2375 if (GET_CODE (pat
) == SEQUENCE
)
2377 emit_insn_after (pat
, insn
);
2378 PUT_CODE (insn
, NOTE
);
2379 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2380 NOTE_SOURCE_FILE (insn
) = 0;
2383 PATTERN (insn
) = pat
;
2388 /* Otherwise, storing into VAR must be handled specially
2389 by storing into a temporary and copying that into VAR
2390 with a new insn after this one. Note that this case
2391 will be used when storing into a promoted scalar since
2392 the insn will now have different modes on the input
2393 and output and hence will be invalid (except for the case
2394 of setting it to a constant, which does not need any
2395 change if it is valid). We generate extra code in that case,
2396 but combine.c will eliminate it. */
2401 rtx fixeddest
= SET_DEST (x
);
2403 /* STRICT_LOW_PART can be discarded, around a MEM. */
2404 if (GET_CODE (fixeddest
) == STRICT_LOW_PART
)
2405 fixeddest
= XEXP (fixeddest
, 0);
2406 /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */
2407 if (GET_CODE (fixeddest
) == SUBREG
)
2409 fixeddest
= fixup_memory_subreg (fixeddest
, insn
, 0);
2410 promoted_mode
= GET_MODE (fixeddest
);
2413 fixeddest
= fixup_stack_1 (fixeddest
, insn
);
2415 temp
= gen_reg_rtx (promoted_mode
);
2417 emit_insn_after (gen_move_insn (fixeddest
,
2418 gen_lowpart (GET_MODE (fixeddest
),
2422 SET_DEST (x
) = temp
;
2430 /* Nothing special about this RTX; fix its operands. */
2432 fmt
= GET_RTX_FORMAT (code
);
2433 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2436 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (x
, i
), insn
, replacements
);
2437 else if (fmt
[i
] == 'E')
2440 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2441 fixup_var_refs_1 (var
, promoted_mode
, &XVECEXP (x
, i
, j
),
2442 insn
, replacements
);
2447 /* Given X, an rtx of the form (SUBREG:m1 (MEM:m2 addr)),
2448 return an rtx (MEM:m1 newaddr) which is equivalent.
2449 If any insns must be emitted to compute NEWADDR, put them before INSN.
2451 UNCRITICAL nonzero means accept paradoxical subregs.
2452 This is used for subregs found inside REG_NOTES. */
2455 fixup_memory_subreg (x
, insn
, uncritical
)
2460 int offset
= SUBREG_WORD (x
) * UNITS_PER_WORD
;
2461 rtx addr
= XEXP (SUBREG_REG (x
), 0);
2462 enum machine_mode mode
= GET_MODE (x
);
2465 /* Paradoxical SUBREGs are usually invalid during RTL generation. */
2466 if (GET_MODE_SIZE (mode
) > GET_MODE_SIZE (GET_MODE (SUBREG_REG (x
)))
2470 if (BYTES_BIG_ENDIAN
)
2471 offset
+= (MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (SUBREG_REG (x
))))
2472 - MIN (UNITS_PER_WORD
, GET_MODE_SIZE (mode
)));
2473 addr
= plus_constant (addr
, offset
);
2474 if (!flag_force_addr
&& memory_address_p (mode
, addr
))
2475 /* Shortcut if no insns need be emitted. */
2476 return change_address (SUBREG_REG (x
), mode
, addr
);
2478 result
= change_address (SUBREG_REG (x
), mode
, addr
);
2479 emit_insn_before (gen_sequence (), insn
);
2484 /* Do fixup_memory_subreg on all (SUBREG (MEM ...) ...) contained in X.
2485 Replace subexpressions of X in place.
2486 If X itself is a (SUBREG (MEM ...) ...), return the replacement expression.
2487 Otherwise return X, with its contents possibly altered.
2489 If any insns must be emitted to compute NEWADDR, put them before INSN.
2491 UNCRITICAL is as in fixup_memory_subreg. */
2494 walk_fixup_memory_subreg (x
, insn
, uncritical
)
2499 register enum rtx_code code
;
2500 register const char *fmt
;
2506 code
= GET_CODE (x
);
2508 if (code
== SUBREG
&& GET_CODE (SUBREG_REG (x
)) == MEM
)
2509 return fixup_memory_subreg (x
, insn
, uncritical
);
2511 /* Nothing special about this RTX; fix its operands. */
2513 fmt
= GET_RTX_FORMAT (code
);
2514 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2517 XEXP (x
, i
) = walk_fixup_memory_subreg (XEXP (x
, i
), insn
, uncritical
);
2518 else if (fmt
[i
] == 'E')
2521 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2523 = walk_fixup_memory_subreg (XVECEXP (x
, i
, j
), insn
, uncritical
);
2529 /* For each memory ref within X, if it refers to a stack slot
2530 with an out of range displacement, put the address in a temp register
2531 (emitting new insns before INSN to load these registers)
2532 and alter the memory ref to use that register.
2533 Replace each such MEM rtx with a copy, to avoid clobberage. */
2536 fixup_stack_1 (x
, insn
)
2541 register RTX_CODE code
= GET_CODE (x
);
2542 register const char *fmt
;
2546 register rtx ad
= XEXP (x
, 0);
2547 /* If we have address of a stack slot but it's not valid
2548 (displacement is too large), compute the sum in a register. */
2549 if (GET_CODE (ad
) == PLUS
2550 && GET_CODE (XEXP (ad
, 0)) == REG
2551 && ((REGNO (XEXP (ad
, 0)) >= FIRST_VIRTUAL_REGISTER
2552 && REGNO (XEXP (ad
, 0)) <= LAST_VIRTUAL_REGISTER
)
2553 || REGNO (XEXP (ad
, 0)) == FRAME_POINTER_REGNUM
2554 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2555 || REGNO (XEXP (ad
, 0)) == HARD_FRAME_POINTER_REGNUM
2557 || REGNO (XEXP (ad
, 0)) == STACK_POINTER_REGNUM
2558 || REGNO (XEXP (ad
, 0)) == ARG_POINTER_REGNUM
2559 || XEXP (ad
, 0) == current_function_internal_arg_pointer
)
2560 && GET_CODE (XEXP (ad
, 1)) == CONST_INT
)
2563 if (memory_address_p (GET_MODE (x
), ad
))
2567 temp
= copy_to_reg (ad
);
2568 seq
= gen_sequence ();
2570 emit_insn_before (seq
, insn
);
2571 return change_address (x
, VOIDmode
, temp
);
2576 fmt
= GET_RTX_FORMAT (code
);
2577 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2580 XEXP (x
, i
) = fixup_stack_1 (XEXP (x
, i
), insn
);
2581 else if (fmt
[i
] == 'E')
2584 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2585 XVECEXP (x
, i
, j
) = fixup_stack_1 (XVECEXP (x
, i
, j
), insn
);
2591 /* Optimization: a bit-field instruction whose field
2592 happens to be a byte or halfword in memory
2593 can be changed to a move instruction.
2595 We call here when INSN is an insn to examine or store into a bit-field.
2596 BODY is the SET-rtx to be altered.
2598 EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0.
2599 (Currently this is called only from function.c, and EQUIV_MEM
2603 optimize_bit_field (body
, insn
, equiv_mem
)
2608 register rtx bitfield
;
2611 enum machine_mode mode
;
2613 if (GET_CODE (SET_DEST (body
)) == SIGN_EXTRACT
2614 || GET_CODE (SET_DEST (body
)) == ZERO_EXTRACT
)
2615 bitfield
= SET_DEST (body
), destflag
= 1;
2617 bitfield
= SET_SRC (body
), destflag
= 0;
2619 /* First check that the field being stored has constant size and position
2620 and is in fact a byte or halfword suitably aligned. */
2622 if (GET_CODE (XEXP (bitfield
, 1)) == CONST_INT
2623 && GET_CODE (XEXP (bitfield
, 2)) == CONST_INT
2624 && ((mode
= mode_for_size (INTVAL (XEXP (bitfield
, 1)), MODE_INT
, 1))
2626 && INTVAL (XEXP (bitfield
, 2)) % INTVAL (XEXP (bitfield
, 1)) == 0)
2628 register rtx memref
= 0;
2630 /* Now check that the containing word is memory, not a register,
2631 and that it is safe to change the machine mode. */
2633 if (GET_CODE (XEXP (bitfield
, 0)) == MEM
)
2634 memref
= XEXP (bitfield
, 0);
2635 else if (GET_CODE (XEXP (bitfield
, 0)) == REG
2637 memref
= equiv_mem
[REGNO (XEXP (bitfield
, 0))];
2638 else if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
2639 && GET_CODE (SUBREG_REG (XEXP (bitfield
, 0))) == MEM
)
2640 memref
= SUBREG_REG (XEXP (bitfield
, 0));
2641 else if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
2643 && GET_CODE (SUBREG_REG (XEXP (bitfield
, 0))) == REG
)
2644 memref
= equiv_mem
[REGNO (SUBREG_REG (XEXP (bitfield
, 0)))];
2647 && ! mode_dependent_address_p (XEXP (memref
, 0))
2648 && ! MEM_VOLATILE_P (memref
))
2650 /* Now adjust the address, first for any subreg'ing
2651 that we are now getting rid of,
2652 and then for which byte of the word is wanted. */
2654 HOST_WIDE_INT offset
= INTVAL (XEXP (bitfield
, 2));
2657 /* Adjust OFFSET to count bits from low-address byte. */
2658 if (BITS_BIG_ENDIAN
!= BYTES_BIG_ENDIAN
)
2659 offset
= (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield
, 0)))
2660 - offset
- INTVAL (XEXP (bitfield
, 1)));
2662 /* Adjust OFFSET to count bytes from low-address byte. */
2663 offset
/= BITS_PER_UNIT
;
2664 if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
)
2666 offset
+= SUBREG_WORD (XEXP (bitfield
, 0)) * UNITS_PER_WORD
;
2667 if (BYTES_BIG_ENDIAN
)
2668 offset
-= (MIN (UNITS_PER_WORD
,
2669 GET_MODE_SIZE (GET_MODE (XEXP (bitfield
, 0))))
2670 - MIN (UNITS_PER_WORD
,
2671 GET_MODE_SIZE (GET_MODE (memref
))));
2675 memref
= change_address (memref
, mode
,
2676 plus_constant (XEXP (memref
, 0), offset
));
2677 insns
= get_insns ();
2679 emit_insns_before (insns
, insn
);
2681 /* Store this memory reference where
2682 we found the bit field reference. */
2686 validate_change (insn
, &SET_DEST (body
), memref
, 1);
2687 if (! CONSTANT_ADDRESS_P (SET_SRC (body
)))
2689 rtx src
= SET_SRC (body
);
2690 while (GET_CODE (src
) == SUBREG
2691 && SUBREG_WORD (src
) == 0)
2692 src
= SUBREG_REG (src
);
2693 if (GET_MODE (src
) != GET_MODE (memref
))
2694 src
= gen_lowpart (GET_MODE (memref
), SET_SRC (body
));
2695 validate_change (insn
, &SET_SRC (body
), src
, 1);
2697 else if (GET_MODE (SET_SRC (body
)) != VOIDmode
2698 && GET_MODE (SET_SRC (body
)) != GET_MODE (memref
))
2699 /* This shouldn't happen because anything that didn't have
2700 one of these modes should have got converted explicitly
2701 and then referenced through a subreg.
2702 This is so because the original bit-field was
2703 handled by agg_mode and so its tree structure had
2704 the same mode that memref now has. */
2709 rtx dest
= SET_DEST (body
);
2711 while (GET_CODE (dest
) == SUBREG
2712 && SUBREG_WORD (dest
) == 0
2713 && (GET_MODE_CLASS (GET_MODE (dest
))
2714 == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest
))))
2715 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
)))
2717 dest
= SUBREG_REG (dest
);
2719 validate_change (insn
, &SET_DEST (body
), dest
, 1);
2721 if (GET_MODE (dest
) == GET_MODE (memref
))
2722 validate_change (insn
, &SET_SRC (body
), memref
, 1);
2725 /* Convert the mem ref to the destination mode. */
2726 rtx newreg
= gen_reg_rtx (GET_MODE (dest
));
2729 convert_move (newreg
, memref
,
2730 GET_CODE (SET_SRC (body
)) == ZERO_EXTRACT
);
2734 validate_change (insn
, &SET_SRC (body
), newreg
, 1);
2738 /* See if we can convert this extraction or insertion into
2739 a simple move insn. We might not be able to do so if this
2740 was, for example, part of a PARALLEL.
2742 If we succeed, write out any needed conversions. If we fail,
2743 it is hard to guess why we failed, so don't do anything
2744 special; just let the optimization be suppressed. */
2746 if (apply_change_group () && seq
)
2747 emit_insns_before (seq
, insn
);
2752 /* These routines are responsible for converting virtual register references
2753 to the actual hard register references once RTL generation is complete.
2755 The following four variables are used for communication between the
2756 routines. They contain the offsets of the virtual registers from their
2757 respective hard registers. */
2759 static int in_arg_offset
;
2760 static int var_offset
;
2761 static int dynamic_offset
;
2762 static int out_arg_offset
;
2763 static int cfa_offset
;
2765 /* In most machines, the stack pointer register is equivalent to the bottom
2768 #ifndef STACK_POINTER_OFFSET
2769 #define STACK_POINTER_OFFSET 0
2772 /* If not defined, pick an appropriate default for the offset of dynamically
2773 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
2774 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
2776 #ifndef STACK_DYNAMIC_OFFSET
2778 /* The bottom of the stack points to the actual arguments. If
2779 REG_PARM_STACK_SPACE is defined, this includes the space for the register
2780 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
2781 stack space for register parameters is not pushed by the caller, but
2782 rather part of the fixed stack areas and hence not included in
2783 `current_function_outgoing_args_size'. Nevertheless, we must allow
2784 for it when allocating stack dynamic objects. */
2786 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2787 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2788 ((ACCUMULATE_OUTGOING_ARGS \
2789 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
2790 + (STACK_POINTER_OFFSET)) \
2793 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2794 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
2795 + (STACK_POINTER_OFFSET))
2799 /* On most machines, the CFA coincides with the first incoming parm. */
2801 #ifndef ARG_POINTER_CFA_OFFSET
2802 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
2805 /* Build up a (MEM (ADDRESSOF (REG))) rtx for a register REG that just had
2806 its address taken. DECL is the decl for the object stored in the
2807 register, for later use if we do need to force REG into the stack.
2808 REG is overwritten by the MEM like in put_reg_into_stack. */
2811 gen_mem_addressof (reg
, decl
)
2815 rtx r
= gen_rtx_ADDRESSOF (Pmode
, gen_reg_rtx (GET_MODE (reg
)),
2818 /* If the original REG was a user-variable, then so is the REG whose
2819 address is being taken. Likewise for unchanging. */
2820 REG_USERVAR_P (XEXP (r
, 0)) = REG_USERVAR_P (reg
);
2821 RTX_UNCHANGING_P (XEXP (r
, 0)) = RTX_UNCHANGING_P (reg
);
2823 PUT_CODE (reg
, MEM
);
2827 tree type
= TREE_TYPE (decl
);
2829 PUT_MODE (reg
, DECL_MODE (decl
));
2830 MEM_VOLATILE_P (reg
) = TREE_SIDE_EFFECTS (decl
);
2831 MEM_SET_IN_STRUCT_P (reg
, AGGREGATE_TYPE_P (type
));
2832 MEM_ALIAS_SET (reg
) = get_alias_set (decl
);
2834 if (TREE_USED (decl
) || DECL_INITIAL (decl
) != 0)
2835 fixup_var_refs (reg
, GET_MODE (reg
), TREE_UNSIGNED (type
), 0);
2839 /* We have no alias information about this newly created MEM. */
2840 MEM_ALIAS_SET (reg
) = 0;
2842 fixup_var_refs (reg
, GET_MODE (reg
), 0, 0);
2848 /* If DECL has an RTL that is an ADDRESSOF rtx, put it into the stack. */
2851 flush_addressof (decl
)
2854 if ((TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == VAR_DECL
)
2855 && DECL_RTL (decl
) != 0
2856 && GET_CODE (DECL_RTL (decl
)) == MEM
2857 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == ADDRESSOF
2858 && GET_CODE (XEXP (XEXP (DECL_RTL (decl
), 0), 0)) == REG
)
2859 put_addressof_into_stack (XEXP (DECL_RTL (decl
), 0), 0);
2862 /* Force the register pointed to by R, an ADDRESSOF rtx, into the stack. */
2865 put_addressof_into_stack (r
, ht
)
2867 struct hash_table
*ht
;
2870 int volatile_p
, used_p
;
2872 rtx reg
= XEXP (r
, 0);
2874 if (GET_CODE (reg
) != REG
)
2877 decl
= ADDRESSOF_DECL (r
);
2880 type
= TREE_TYPE (decl
);
2881 volatile_p
= (TREE_CODE (decl
) != SAVE_EXPR
2882 && TREE_THIS_VOLATILE (decl
));
2883 used_p
= (TREE_USED (decl
)
2884 || (TREE_CODE (decl
) != SAVE_EXPR
2885 && DECL_INITIAL (decl
) != 0));
2894 put_reg_into_stack (0, reg
, type
, GET_MODE (reg
), GET_MODE (reg
),
2895 volatile_p
, ADDRESSOF_REGNO (r
), used_p
, ht
);
2898 /* List of replacements made below in purge_addressof_1 when creating
2899 bitfield insertions. */
2900 static rtx purge_bitfield_addressof_replacements
;
2902 /* List of replacements made below in purge_addressof_1 for patterns
2903 (MEM (ADDRESSOF (REG ...))). The key of the list entry is the
2904 corresponding (ADDRESSOF (REG ...)) and value is a substitution for
2905 the all pattern. List PURGE_BITFIELD_ADDRESSOF_REPLACEMENTS is not
2906 enough in complex cases, e.g. when some field values can be
2907 extracted by usage MEM with narrower mode. */
2908 static rtx purge_addressof_replacements
;
2910 /* Helper function for purge_addressof. See if the rtx expression at *LOC
2911 in INSN needs to be changed. If FORCE, always put any ADDRESSOFs into
2912 the stack. If the function returns FALSE then the replacement could not
2916 purge_addressof_1 (loc
, insn
, force
, store
, ht
)
2920 struct hash_table
*ht
;
2926 boolean result
= true;
2928 /* Re-start here to avoid recursion in common cases. */
2935 code
= GET_CODE (x
);
2937 /* If we don't return in any of the cases below, we will recurse inside
2938 the RTX, which will normally result in any ADDRESSOF being forced into
2942 result
= purge_addressof_1 (&SET_DEST (x
), insn
, force
, 1, ht
);
2943 result
&= purge_addressof_1 (&SET_SRC (x
), insn
, force
, 0, ht
);
2947 else if (code
== ADDRESSOF
&& GET_CODE (XEXP (x
, 0)) == MEM
)
2949 /* We must create a copy of the rtx because it was created by
2950 overwriting a REG rtx which is always shared. */
2951 rtx sub
= copy_rtx (XEXP (XEXP (x
, 0), 0));
2954 if (validate_change (insn
, loc
, sub
, 0)
2955 || validate_replace_rtx (x
, sub
, insn
))
2959 sub
= force_operand (sub
, NULL_RTX
);
2960 if (! validate_change (insn
, loc
, sub
, 0)
2961 && ! validate_replace_rtx (x
, sub
, insn
))
2964 insns
= gen_sequence ();
2966 emit_insn_before (insns
, insn
);
2970 else if (code
== MEM
&& GET_CODE (XEXP (x
, 0)) == ADDRESSOF
&& ! force
)
2972 rtx sub
= XEXP (XEXP (x
, 0), 0);
2975 if (GET_CODE (sub
) == MEM
)
2977 sub2
= gen_rtx_MEM (GET_MODE (x
), copy_rtx (XEXP (sub
, 0)));
2978 MEM_COPY_ATTRIBUTES (sub2
, sub
);
2981 else if (GET_CODE (sub
) == REG
2982 && (MEM_VOLATILE_P (x
) || GET_MODE (x
) == BLKmode
))
2984 else if (GET_CODE (sub
) == REG
&& GET_MODE (x
) != GET_MODE (sub
))
2986 int size_x
, size_sub
;
2990 /* When processing REG_NOTES look at the list of
2991 replacements done on the insn to find the register that X
2995 for (tem
= purge_bitfield_addressof_replacements
;
2997 tem
= XEXP (XEXP (tem
, 1), 1))
2998 if (rtx_equal_p (x
, XEXP (tem
, 0)))
3000 *loc
= XEXP (XEXP (tem
, 1), 0);
3004 /* See comment for purge_addressof_replacements. */
3005 for (tem
= purge_addressof_replacements
;
3007 tem
= XEXP (XEXP (tem
, 1), 1))
3008 if (rtx_equal_p (XEXP (x
, 0), XEXP (tem
, 0)))
3010 rtx z
= XEXP (XEXP (tem
, 1), 0);
3012 if (GET_MODE (x
) == GET_MODE (z
)
3013 || (GET_CODE (XEXP (XEXP (tem
, 1), 0)) != REG
3014 && GET_CODE (XEXP (XEXP (tem
, 1), 0)) != SUBREG
))
3017 /* It can happen that the note may speak of things
3018 in a wider (or just different) mode than the
3019 code did. This is especially true of
3022 if (GET_CODE (z
) == SUBREG
&& SUBREG_WORD (z
) == 0)
3025 if (GET_MODE_SIZE (GET_MODE (x
)) > UNITS_PER_WORD
3026 && (GET_MODE_SIZE (GET_MODE (x
))
3027 > GET_MODE_SIZE (GET_MODE (z
))))
3029 /* This can occur as a result in invalid
3030 pointer casts, e.g. float f; ...
3031 *(long long int *)&f.
3032 ??? We could emit a warning here, but
3033 without a line number that wouldn't be
3035 z
= gen_rtx_SUBREG (GET_MODE (x
), z
, 0);
3038 z
= gen_lowpart (GET_MODE (x
), z
);
3044 /* Sometimes we may not be able to find the replacement. For
3045 example when the original insn was a MEM in a wider mode,
3046 and the note is part of a sign extension of a narrowed
3047 version of that MEM. Gcc testcase compile/990829-1.c can
3048 generate an example of this siutation. Rather than complain
3049 we return false, which will prompt our caller to remove the
3054 size_x
= GET_MODE_BITSIZE (GET_MODE (x
));
3055 size_sub
= GET_MODE_BITSIZE (GET_MODE (sub
));
3057 /* Don't even consider working with paradoxical subregs,
3058 or the moral equivalent seen here. */
3059 if (size_x
<= size_sub
3060 && int_mode_for_mode (GET_MODE (sub
)) != BLKmode
)
3062 /* Do a bitfield insertion to mirror what would happen
3069 rtx p
= PREV_INSN (insn
);
3072 val
= gen_reg_rtx (GET_MODE (x
));
3073 if (! validate_change (insn
, loc
, val
, 0))
3075 /* Discard the current sequence and put the
3076 ADDRESSOF on stack. */
3080 seq
= gen_sequence ();
3082 emit_insn_before (seq
, insn
);
3083 compute_insns_for_mem (p
? NEXT_INSN (p
) : get_insns (),
3087 store_bit_field (sub
, size_x
, 0, GET_MODE (x
),
3088 val
, GET_MODE_SIZE (GET_MODE (sub
)),
3089 GET_MODE_ALIGNMENT (GET_MODE (sub
)));
3091 /* Make sure to unshare any shared rtl that store_bit_field
3092 might have created. */
3093 unshare_all_rtl_again (get_insns ());
3095 seq
= gen_sequence ();
3097 p
= emit_insn_after (seq
, insn
);
3098 if (NEXT_INSN (insn
))
3099 compute_insns_for_mem (NEXT_INSN (insn
),
3100 p
? NEXT_INSN (p
) : NULL_RTX
,
3105 rtx p
= PREV_INSN (insn
);
3108 val
= extract_bit_field (sub
, size_x
, 0, 1, NULL_RTX
,
3109 GET_MODE (x
), GET_MODE (x
),
3110 GET_MODE_SIZE (GET_MODE (sub
)),
3111 GET_MODE_SIZE (GET_MODE (sub
)));
3113 if (! validate_change (insn
, loc
, val
, 0))
3115 /* Discard the current sequence and put the
3116 ADDRESSOF on stack. */
3121 seq
= gen_sequence ();
3123 emit_insn_before (seq
, insn
);
3124 compute_insns_for_mem (p
? NEXT_INSN (p
) : get_insns (),
3128 /* Remember the replacement so that the same one can be done
3129 on the REG_NOTES. */
3130 purge_bitfield_addressof_replacements
3131 = gen_rtx_EXPR_LIST (VOIDmode
, x
,
3134 purge_bitfield_addressof_replacements
));
3136 /* We replaced with a reg -- all done. */
3141 else if (validate_change (insn
, loc
, sub
, 0))
3143 /* Remember the replacement so that the same one can be done
3144 on the REG_NOTES. */
3145 if (GET_CODE (sub
) == REG
|| GET_CODE (sub
) == SUBREG
)
3149 for (tem
= purge_addressof_replacements
;
3151 tem
= XEXP (XEXP (tem
, 1), 1))
3152 if (rtx_equal_p (XEXP (x
, 0), XEXP (tem
, 0)))
3154 XEXP (XEXP (tem
, 1), 0) = sub
;
3157 purge_addressof_replacements
3158 = gen_rtx (EXPR_LIST
, VOIDmode
, XEXP (x
, 0),
3159 gen_rtx_EXPR_LIST (VOIDmode
, sub
,
3160 purge_addressof_replacements
));
3166 /* else give up and put it into the stack */
3169 else if (code
== ADDRESSOF
)
3171 put_addressof_into_stack (x
, ht
);
3174 else if (code
== SET
)
3176 result
= purge_addressof_1 (&SET_DEST (x
), insn
, force
, 1, ht
);
3177 result
&= purge_addressof_1 (&SET_SRC (x
), insn
, force
, 0, ht
);
3181 /* Scan all subexpressions. */
3182 fmt
= GET_RTX_FORMAT (code
);
3183 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
3186 result
&= purge_addressof_1 (&XEXP (x
, i
), insn
, force
, 0, ht
);
3187 else if (*fmt
== 'E')
3188 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3189 result
&= purge_addressof_1 (&XVECEXP (x
, i
, j
), insn
, force
, 0, ht
);
3195 /* Return a new hash table entry in HT. */
3197 static struct hash_entry
*
3198 insns_for_mem_newfunc (he
, ht
, k
)
3199 struct hash_entry
*he
;
3200 struct hash_table
*ht
;
3201 hash_table_key k ATTRIBUTE_UNUSED
;
3203 struct insns_for_mem_entry
*ifmhe
;
3207 ifmhe
= ((struct insns_for_mem_entry
*)
3208 hash_allocate (ht
, sizeof (struct insns_for_mem_entry
)));
3209 ifmhe
->insns
= NULL_RTX
;
3214 /* Return a hash value for K, a REG. */
3216 static unsigned long
3217 insns_for_mem_hash (k
)
3220 /* K is really a RTX. Just use the address as the hash value. */
3221 return (unsigned long) k
;
3224 /* Return non-zero if K1 and K2 (two REGs) are the same. */
3227 insns_for_mem_comp (k1
, k2
)
3234 struct insns_for_mem_walk_info
{
3235 /* The hash table that we are using to record which INSNs use which
3237 struct hash_table
*ht
;
3239 /* The INSN we are currently proessing. */
3242 /* Zero if we are walking to find ADDRESSOFs, one if we are walking
3243 to find the insns that use the REGs in the ADDRESSOFs. */
3247 /* Called from compute_insns_for_mem via for_each_rtx. If R is a REG
3248 that might be used in an ADDRESSOF expression, record this INSN in
3249 the hash table given by DATA (which is really a pointer to an
3250 insns_for_mem_walk_info structure). */
3253 insns_for_mem_walk (r
, data
)
3257 struct insns_for_mem_walk_info
*ifmwi
3258 = (struct insns_for_mem_walk_info
*) data
;
3260 if (ifmwi
->pass
== 0 && *r
&& GET_CODE (*r
) == ADDRESSOF
3261 && GET_CODE (XEXP (*r
, 0)) == REG
)
3262 hash_lookup (ifmwi
->ht
, XEXP (*r
, 0), /*create=*/1, /*copy=*/0);
3263 else if (ifmwi
->pass
== 1 && *r
&& GET_CODE (*r
) == REG
)
3265 /* Lookup this MEM in the hashtable, creating it if necessary. */
3266 struct insns_for_mem_entry
*ifme
3267 = (struct insns_for_mem_entry
*) hash_lookup (ifmwi
->ht
,
3272 /* If we have not already recorded this INSN, do so now. Since
3273 we process the INSNs in order, we know that if we have
3274 recorded it it must be at the front of the list. */
3275 if (ifme
&& (!ifme
->insns
|| XEXP (ifme
->insns
, 0) != ifmwi
->insn
))
3277 /* We do the allocation on the same obstack as is used for
3278 the hash table since this memory will not be used once
3279 the hash table is deallocated. */
3280 push_obstacks (&ifmwi
->ht
->memory
, &ifmwi
->ht
->memory
);
3281 ifme
->insns
= gen_rtx_EXPR_LIST (VOIDmode
, ifmwi
->insn
,
3290 /* Walk the INSNS, until we reach LAST_INSN, recording which INSNs use
3291 which REGs in HT. */
3294 compute_insns_for_mem (insns
, last_insn
, ht
)
3297 struct hash_table
*ht
;
3300 struct insns_for_mem_walk_info ifmwi
;
3303 for (ifmwi
.pass
= 0; ifmwi
.pass
< 2; ++ifmwi
.pass
)
3304 for (insn
= insns
; insn
!= last_insn
; insn
= NEXT_INSN (insn
))
3308 for_each_rtx (&insn
, insns_for_mem_walk
, &ifmwi
);
3312 /* Helper function for purge_addressof called through for_each_rtx.
3313 Returns true iff the rtl is an ADDRESSOF. */
3315 is_addressof (rtl
, data
)
3317 void *data ATTRIBUTE_UNUSED
;
3319 return GET_CODE (*rtl
) == ADDRESSOF
;
3322 /* Eliminate all occurrences of ADDRESSOF from INSNS. Elide any remaining
3323 (MEM (ADDRESSOF)) patterns, and force any needed registers into the
3327 purge_addressof (insns
)
3331 struct hash_table ht
;
3333 /* When we actually purge ADDRESSOFs, we turn REGs into MEMs. That
3334 requires a fixup pass over the instruction stream to correct
3335 INSNs that depended on the REG being a REG, and not a MEM. But,
3336 these fixup passes are slow. Furthermore, most MEMs are not
3337 mentioned in very many instructions. So, we speed up the process
3338 by pre-calculating which REGs occur in which INSNs; that allows
3339 us to perform the fixup passes much more quickly. */
3340 hash_table_init (&ht
,
3341 insns_for_mem_newfunc
,
3343 insns_for_mem_comp
);
3344 compute_insns_for_mem (insns
, NULL_RTX
, &ht
);
3346 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
3347 if (GET_CODE (insn
) == INSN
|| GET_CODE (insn
) == JUMP_INSN
3348 || GET_CODE (insn
) == CALL_INSN
)
3350 if (! purge_addressof_1 (&PATTERN (insn
), insn
,
3351 asm_noperands (PATTERN (insn
)) > 0, 0, &ht
))
3352 /* If we could not replace the ADDRESSOFs in the insn,
3353 something is wrong. */
3356 if (! purge_addressof_1 (®_NOTES (insn
), NULL_RTX
, 0, 0, &ht
))
3358 /* If we could not replace the ADDRESSOFs in the insn's notes,
3359 we can just remove the offending notes instead. */
3362 for (note
= REG_NOTES (insn
); note
; note
= XEXP (note
, 1))
3364 /* If we find a REG_RETVAL note then the insn is a libcall.
3365 Such insns must have REG_EQUAL notes as well, in order
3366 for later passes of the compiler to work. So it is not
3367 safe to delete the notes here, and instead we abort. */
3368 if (REG_NOTE_KIND (note
) == REG_RETVAL
)
3370 if (for_each_rtx (¬e
, is_addressof
, NULL
))
3371 remove_note (insn
, note
);
3377 hash_table_free (&ht
);
3378 purge_bitfield_addressof_replacements
= 0;
3379 purge_addressof_replacements
= 0;
3381 /* REGs are shared. purge_addressof will destructively replace a REG
3382 with a MEM, which creates shared MEMs.
3384 Unfortunately, the children of put_reg_into_stack assume that MEMs
3385 referring to the same stack slot are shared (fixup_var_refs and
3386 the associated hash table code).
3388 So, we have to do another unsharing pass after we have flushed any
3389 REGs that had their address taken into the stack.
3391 It may be worth tracking whether or not we converted any REGs into
3392 MEMs to avoid this overhead when it is not needed. */
3393 unshare_all_rtl_again (get_insns ());
3396 /* Pass through the INSNS of function FNDECL and convert virtual register
3397 references to hard register references. */
3400 instantiate_virtual_regs (fndecl
, insns
)
3407 /* Compute the offsets to use for this function. */
3408 in_arg_offset
= FIRST_PARM_OFFSET (fndecl
);
3409 var_offset
= STARTING_FRAME_OFFSET
;
3410 dynamic_offset
= STACK_DYNAMIC_OFFSET (fndecl
);
3411 out_arg_offset
= STACK_POINTER_OFFSET
;
3412 cfa_offset
= ARG_POINTER_CFA_OFFSET (fndecl
);
3414 /* Scan all variables and parameters of this function. For each that is
3415 in memory, instantiate all virtual registers if the result is a valid
3416 address. If not, we do it later. That will handle most uses of virtual
3417 regs on many machines. */
3418 instantiate_decls (fndecl
, 1);
3420 /* Initialize recognition, indicating that volatile is OK. */
3423 /* Scan through all the insns, instantiating every virtual register still
3425 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
3426 if (GET_CODE (insn
) == INSN
|| GET_CODE (insn
) == JUMP_INSN
3427 || GET_CODE (insn
) == CALL_INSN
)
3429 instantiate_virtual_regs_1 (&PATTERN (insn
), insn
, 1);
3430 instantiate_virtual_regs_1 (®_NOTES (insn
), NULL_RTX
, 0);
3433 /* Instantiate the stack slots for the parm registers, for later use in
3434 addressof elimination. */
3435 for (i
= 0; i
< max_parm_reg
; ++i
)
3436 if (parm_reg_stack_loc
[i
])
3437 instantiate_virtual_regs_1 (&parm_reg_stack_loc
[i
], NULL_RTX
, 0);
3439 /* Now instantiate the remaining register equivalences for debugging info.
3440 These will not be valid addresses. */
3441 instantiate_decls (fndecl
, 0);
3443 /* Indicate that, from now on, assign_stack_local should use
3444 frame_pointer_rtx. */
3445 virtuals_instantiated
= 1;
3448 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
3449 all virtual registers in their DECL_RTL's.
3451 If VALID_ONLY, do this only if the resulting address is still valid.
3452 Otherwise, always do it. */
3455 instantiate_decls (fndecl
, valid_only
)
3461 if (DECL_SAVED_INSNS (fndecl
))
3462 /* When compiling an inline function, the obstack used for
3463 rtl allocation is the maybepermanent_obstack. Calling
3464 `resume_temporary_allocation' switches us back to that
3465 obstack while we process this function's parameters. */
3466 resume_temporary_allocation ();
3468 /* Process all parameters of the function. */
3469 for (decl
= DECL_ARGUMENTS (fndecl
); decl
; decl
= TREE_CHAIN (decl
))
3471 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (decl
));
3473 instantiate_decl (DECL_RTL (decl
), size
, valid_only
);
3475 /* If the parameter was promoted, then the incoming RTL mode may be
3476 larger than the declared type size. We must use the larger of
3478 size
= MAX (GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl
))), size
);
3479 instantiate_decl (DECL_INCOMING_RTL (decl
), size
, valid_only
);
3482 /* Now process all variables defined in the function or its subblocks. */
3483 instantiate_decls_1 (DECL_INITIAL (fndecl
), valid_only
);
3485 if (DECL_INLINE (fndecl
) || DECL_DEFER_OUTPUT (fndecl
))
3487 /* Save all rtl allocated for this function by raising the
3488 high-water mark on the maybepermanent_obstack. */
3490 /* All further rtl allocation is now done in the current_obstack. */
3491 rtl_in_current_obstack ();
3495 /* Subroutine of instantiate_decls: Process all decls in the given
3496 BLOCK node and all its subblocks. */
3499 instantiate_decls_1 (let
, valid_only
)
3505 for (t
= BLOCK_VARS (let
); t
; t
= TREE_CHAIN (t
))
3506 instantiate_decl (DECL_RTL (t
), int_size_in_bytes (TREE_TYPE (t
)),
3509 /* Process all subblocks. */
3510 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= TREE_CHAIN (t
))
3511 instantiate_decls_1 (t
, valid_only
);
3514 /* Subroutine of the preceding procedures: Given RTL representing a
3515 decl and the size of the object, do any instantiation required.
3517 If VALID_ONLY is non-zero, it means that the RTL should only be
3518 changed if the new address is valid. */
3521 instantiate_decl (x
, size
, valid_only
)
3526 enum machine_mode mode
;
3529 /* If this is not a MEM, no need to do anything. Similarly if the
3530 address is a constant or a register that is not a virtual register. */
3532 if (x
== 0 || GET_CODE (x
) != MEM
)
3536 if (CONSTANT_P (addr
)
3537 || (GET_CODE (addr
) == ADDRESSOF
&& GET_CODE (XEXP (addr
, 0)) == REG
)
3538 || (GET_CODE (addr
) == REG
3539 && (REGNO (addr
) < FIRST_VIRTUAL_REGISTER
3540 || REGNO (addr
) > LAST_VIRTUAL_REGISTER
)))
3543 /* If we should only do this if the address is valid, copy the address.
3544 We need to do this so we can undo any changes that might make the
3545 address invalid. This copy is unfortunate, but probably can't be
3549 addr
= copy_rtx (addr
);
3551 instantiate_virtual_regs_1 (&addr
, NULL_RTX
, 0);
3553 if (valid_only
&& size
>= 0)
3555 unsigned HOST_WIDE_INT decl_size
= size
;
3557 /* Now verify that the resulting address is valid for every integer or
3558 floating-point mode up to and including SIZE bytes long. We do this
3559 since the object might be accessed in any mode and frame addresses
3562 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
3563 mode
!= VOIDmode
&& GET_MODE_SIZE (mode
) <= decl_size
;
3564 mode
= GET_MODE_WIDER_MODE (mode
))
3565 if (! memory_address_p (mode
, addr
))
3568 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
);
3569 mode
!= VOIDmode
&& GET_MODE_SIZE (mode
) <= decl_size
;
3570 mode
= GET_MODE_WIDER_MODE (mode
))
3571 if (! memory_address_p (mode
, addr
))
3575 /* Put back the address now that we have updated it and we either know
3576 it is valid or we don't care whether it is valid. */
3581 /* Given a pointer to a piece of rtx and an optional pointer to the
3582 containing object, instantiate any virtual registers present in it.
3584 If EXTRA_INSNS, we always do the replacement and generate
3585 any extra insns before OBJECT. If it zero, we do nothing if replacement
3588 Return 1 if we either had nothing to do or if we were able to do the
3589 needed replacement. Return 0 otherwise; we only return zero if
3590 EXTRA_INSNS is zero.
3592 We first try some simple transformations to avoid the creation of extra
3596 instantiate_virtual_regs_1 (loc
, object
, extra_insns
)
3604 HOST_WIDE_INT offset
= 0;
3610 /* Re-start here to avoid recursion in common cases. */
3617 code
= GET_CODE (x
);
3619 /* Check for some special cases. */
3636 /* We are allowed to set the virtual registers. This means that
3637 the actual register should receive the source minus the
3638 appropriate offset. This is used, for example, in the handling
3639 of non-local gotos. */
3640 if (SET_DEST (x
) == virtual_incoming_args_rtx
)
3641 new = arg_pointer_rtx
, offset
= -in_arg_offset
;
3642 else if (SET_DEST (x
) == virtual_stack_vars_rtx
)
3643 new = frame_pointer_rtx
, offset
= -var_offset
;
3644 else if (SET_DEST (x
) == virtual_stack_dynamic_rtx
)
3645 new = stack_pointer_rtx
, offset
= -dynamic_offset
;
3646 else if (SET_DEST (x
) == virtual_outgoing_args_rtx
)
3647 new = stack_pointer_rtx
, offset
= -out_arg_offset
;
3648 else if (SET_DEST (x
) == virtual_cfa_rtx
)
3649 new = arg_pointer_rtx
, offset
= -cfa_offset
;
3653 rtx src
= SET_SRC (x
);
3655 instantiate_virtual_regs_1 (&src
, NULL_RTX
, 0);
3657 /* The only valid sources here are PLUS or REG. Just do
3658 the simplest possible thing to handle them. */
3659 if (GET_CODE (src
) != REG
&& GET_CODE (src
) != PLUS
)
3663 if (GET_CODE (src
) != REG
)
3664 temp
= force_operand (src
, NULL_RTX
);
3667 temp
= force_operand (plus_constant (temp
, offset
), NULL_RTX
);
3671 emit_insns_before (seq
, object
);
3674 if (! validate_change (object
, &SET_SRC (x
), temp
, 0)
3681 instantiate_virtual_regs_1 (&SET_DEST (x
), object
, extra_insns
);
3686 /* Handle special case of virtual register plus constant. */
3687 if (CONSTANT_P (XEXP (x
, 1)))
3689 rtx old
, new_offset
;
3691 /* Check for (plus (plus VIRT foo) (const_int)) first. */
3692 if (GET_CODE (XEXP (x
, 0)) == PLUS
)
3694 rtx inner
= XEXP (XEXP (x
, 0), 0);
3696 if (inner
== virtual_incoming_args_rtx
)
3697 new = arg_pointer_rtx
, offset
= in_arg_offset
;
3698 else if (inner
== virtual_stack_vars_rtx
)
3699 new = frame_pointer_rtx
, offset
= var_offset
;
3700 else if (inner
== virtual_stack_dynamic_rtx
)
3701 new = stack_pointer_rtx
, offset
= dynamic_offset
;
3702 else if (inner
== virtual_outgoing_args_rtx
)
3703 new = stack_pointer_rtx
, offset
= out_arg_offset
;
3704 else if (inner
== virtual_cfa_rtx
)
3705 new = arg_pointer_rtx
, offset
= cfa_offset
;
3712 instantiate_virtual_regs_1 (&XEXP (XEXP (x
, 0), 1), object
,
3714 new = gen_rtx_PLUS (Pmode
, new, XEXP (XEXP (x
, 0), 1));
3717 else if (XEXP (x
, 0) == virtual_incoming_args_rtx
)
3718 new = arg_pointer_rtx
, offset
= in_arg_offset
;
3719 else if (XEXP (x
, 0) == virtual_stack_vars_rtx
)
3720 new = frame_pointer_rtx
, offset
= var_offset
;
3721 else if (XEXP (x
, 0) == virtual_stack_dynamic_rtx
)
3722 new = stack_pointer_rtx
, offset
= dynamic_offset
;
3723 else if (XEXP (x
, 0) == virtual_outgoing_args_rtx
)
3724 new = stack_pointer_rtx
, offset
= out_arg_offset
;
3725 else if (XEXP (x
, 0) == virtual_cfa_rtx
)
3726 new = arg_pointer_rtx
, offset
= cfa_offset
;
3729 /* We know the second operand is a constant. Unless the
3730 first operand is a REG (which has been already checked),
3731 it needs to be checked. */
3732 if (GET_CODE (XEXP (x
, 0)) != REG
)
3740 new_offset
= plus_constant (XEXP (x
, 1), offset
);
3742 /* If the new constant is zero, try to replace the sum with just
3744 if (new_offset
== const0_rtx
3745 && validate_change (object
, loc
, new, 0))
3748 /* Next try to replace the register and new offset.
3749 There are two changes to validate here and we can't assume that
3750 in the case of old offset equals new just changing the register
3751 will yield a valid insn. In the interests of a little efficiency,
3752 however, we only call validate change once (we don't queue up the
3753 changes and then call apply_change_group). */
3757 ? ! validate_change (object
, &XEXP (x
, 0), new, 0)
3758 : (XEXP (x
, 0) = new,
3759 ! validate_change (object
, &XEXP (x
, 1), new_offset
, 0)))
3767 /* Otherwise copy the new constant into a register and replace
3768 constant with that register. */
3769 temp
= gen_reg_rtx (Pmode
);
3771 if (validate_change (object
, &XEXP (x
, 1), temp
, 0))
3772 emit_insn_before (gen_move_insn (temp
, new_offset
), object
);
3775 /* If that didn't work, replace this expression with a
3776 register containing the sum. */
3779 new = gen_rtx_PLUS (Pmode
, new, new_offset
);
3782 temp
= force_operand (new, NULL_RTX
);
3786 emit_insns_before (seq
, object
);
3787 if (! validate_change (object
, loc
, temp
, 0)
3788 && ! validate_replace_rtx (x
, temp
, object
))
3796 /* Fall through to generic two-operand expression case. */
3802 case DIV
: case UDIV
:
3803 case MOD
: case UMOD
:
3804 case AND
: case IOR
: case XOR
:
3805 case ROTATERT
: case ROTATE
:
3806 case ASHIFTRT
: case LSHIFTRT
: case ASHIFT
:
3808 case GE
: case GT
: case GEU
: case GTU
:
3809 case LE
: case LT
: case LEU
: case LTU
:
3810 if (XEXP (x
, 1) && ! CONSTANT_P (XEXP (x
, 1)))
3811 instantiate_virtual_regs_1 (&XEXP (x
, 1), object
, extra_insns
);
3816 /* Most cases of MEM that convert to valid addresses have already been
3817 handled by our scan of decls. The only special handling we
3818 need here is to make a copy of the rtx to ensure it isn't being
3819 shared if we have to change it to a pseudo.
3821 If the rtx is a simple reference to an address via a virtual register,
3822 it can potentially be shared. In such cases, first try to make it
3823 a valid address, which can also be shared. Otherwise, copy it and
3826 First check for common cases that need no processing. These are
3827 usually due to instantiation already being done on a previous instance
3831 if (CONSTANT_ADDRESS_P (temp
)
3832 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3833 || temp
== arg_pointer_rtx
3835 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3836 || temp
== hard_frame_pointer_rtx
3838 || temp
== frame_pointer_rtx
)
3841 if (GET_CODE (temp
) == PLUS
3842 && CONSTANT_ADDRESS_P (XEXP (temp
, 1))
3843 && (XEXP (temp
, 0) == frame_pointer_rtx
3844 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3845 || XEXP (temp
, 0) == hard_frame_pointer_rtx
3847 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3848 || XEXP (temp
, 0) == arg_pointer_rtx
3853 if (temp
== virtual_stack_vars_rtx
3854 || temp
== virtual_incoming_args_rtx
3855 || (GET_CODE (temp
) == PLUS
3856 && CONSTANT_ADDRESS_P (XEXP (temp
, 1))
3857 && (XEXP (temp
, 0) == virtual_stack_vars_rtx
3858 || XEXP (temp
, 0) == virtual_incoming_args_rtx
)))
3860 /* This MEM may be shared. If the substitution can be done without
3861 the need to generate new pseudos, we want to do it in place
3862 so all copies of the shared rtx benefit. The call below will
3863 only make substitutions if the resulting address is still
3866 Note that we cannot pass X as the object in the recursive call
3867 since the insn being processed may not allow all valid
3868 addresses. However, if we were not passed on object, we can
3869 only modify X without copying it if X will have a valid
3872 ??? Also note that this can still lose if OBJECT is an insn that
3873 has less restrictions on an address that some other insn.
3874 In that case, we will modify the shared address. This case
3875 doesn't seem very likely, though. One case where this could
3876 happen is in the case of a USE or CLOBBER reference, but we
3877 take care of that below. */
3879 if (instantiate_virtual_regs_1 (&XEXP (x
, 0),
3880 object
? object
: x
, 0))
3883 /* Otherwise make a copy and process that copy. We copy the entire
3884 RTL expression since it might be a PLUS which could also be
3886 *loc
= x
= copy_rtx (x
);
3889 /* Fall through to generic unary operation case. */
3891 case STRICT_LOW_PART
:
3893 case PRE_DEC
: case PRE_INC
: case POST_DEC
: case POST_INC
:
3894 case SIGN_EXTEND
: case ZERO_EXTEND
:
3895 case TRUNCATE
: case FLOAT_EXTEND
: case FLOAT_TRUNCATE
:
3896 case FLOAT
: case FIX
:
3897 case UNSIGNED_FIX
: case UNSIGNED_FLOAT
:
3901 /* These case either have just one operand or we know that we need not
3902 check the rest of the operands. */
3908 /* If the operand is a MEM, see if the change is a valid MEM. If not,
3909 go ahead and make the invalid one, but do it to a copy. For a REG,
3910 just make the recursive call, since there's no chance of a problem. */
3912 if ((GET_CODE (XEXP (x
, 0)) == MEM
3913 && instantiate_virtual_regs_1 (&XEXP (XEXP (x
, 0), 0), XEXP (x
, 0),
3915 || (GET_CODE (XEXP (x
, 0)) == REG
3916 && instantiate_virtual_regs_1 (&XEXP (x
, 0), object
, 0)))
3919 XEXP (x
, 0) = copy_rtx (XEXP (x
, 0));
3924 /* Try to replace with a PLUS. If that doesn't work, compute the sum
3925 in front of this insn and substitute the temporary. */
3926 if (x
== virtual_incoming_args_rtx
)
3927 new = arg_pointer_rtx
, offset
= in_arg_offset
;
3928 else if (x
== virtual_stack_vars_rtx
)
3929 new = frame_pointer_rtx
, offset
= var_offset
;
3930 else if (x
== virtual_stack_dynamic_rtx
)
3931 new = stack_pointer_rtx
, offset
= dynamic_offset
;
3932 else if (x
== virtual_outgoing_args_rtx
)
3933 new = stack_pointer_rtx
, offset
= out_arg_offset
;
3934 else if (x
== virtual_cfa_rtx
)
3935 new = arg_pointer_rtx
, offset
= cfa_offset
;
3939 temp
= plus_constant (new, offset
);
3940 if (!validate_change (object
, loc
, temp
, 0))
3946 temp
= force_operand (temp
, NULL_RTX
);
3950 emit_insns_before (seq
, object
);
3951 if (! validate_change (object
, loc
, temp
, 0)
3952 && ! validate_replace_rtx (x
, temp
, object
))
3960 if (GET_CODE (XEXP (x
, 0)) == REG
)
3963 else if (GET_CODE (XEXP (x
, 0)) == MEM
)
3965 /* If we have a (addressof (mem ..)), do any instantiation inside
3966 since we know we'll be making the inside valid when we finally
3967 remove the ADDRESSOF. */
3968 instantiate_virtual_regs_1 (&XEXP (XEXP (x
, 0), 0), NULL_RTX
, 0);
3977 /* Scan all subexpressions. */
3978 fmt
= GET_RTX_FORMAT (code
);
3979 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
3982 if (!instantiate_virtual_regs_1 (&XEXP (x
, i
), object
, extra_insns
))
3985 else if (*fmt
== 'E')
3986 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3987 if (! instantiate_virtual_regs_1 (&XVECEXP (x
, i
, j
), object
,
3994 /* Optimization: assuming this function does not receive nonlocal gotos,
3995 delete the handlers for such, as well as the insns to establish
3996 and disestablish them. */
4002 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4004 /* Delete the handler by turning off the flag that would
4005 prevent jump_optimize from deleting it.
4006 Also permit deletion of the nonlocal labels themselves
4007 if nothing local refers to them. */
4008 if (GET_CODE (insn
) == CODE_LABEL
)
4012 LABEL_PRESERVE_P (insn
) = 0;
4014 /* Remove it from the nonlocal_label list, to avoid confusing
4016 for (t
= nonlocal_labels
, last_t
= 0; t
;
4017 last_t
= t
, t
= TREE_CHAIN (t
))
4018 if (DECL_RTL (TREE_VALUE (t
)) == insn
)
4023 nonlocal_labels
= TREE_CHAIN (nonlocal_labels
);
4025 TREE_CHAIN (last_t
) = TREE_CHAIN (t
);
4028 if (GET_CODE (insn
) == INSN
)
4032 for (t
= nonlocal_goto_handler_slots
; t
!= 0; t
= XEXP (t
, 1))
4033 if (reg_mentioned_p (t
, PATTERN (insn
)))
4039 || (nonlocal_goto_stack_level
!= 0
4040 && reg_mentioned_p (nonlocal_goto_stack_level
,
4050 return max_parm_reg
;
4053 /* Return the first insn following those generated by `assign_parms'. */
4056 get_first_nonparm_insn ()
4059 return NEXT_INSN (last_parm_insn
);
4060 return get_insns ();
4063 /* Return the first NOTE_INSN_BLOCK_BEG note in the function.
4064 Crash if there is none. */
4067 get_first_block_beg ()
4069 register rtx searcher
;
4070 register rtx insn
= get_first_nonparm_insn ();
4072 for (searcher
= insn
; searcher
; searcher
= NEXT_INSN (searcher
))
4073 if (GET_CODE (searcher
) == NOTE
4074 && NOTE_LINE_NUMBER (searcher
) == NOTE_INSN_BLOCK_BEG
)
4077 abort (); /* Invalid call to this function. (See comments above.) */
4081 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
4082 This means a type for which function calls must pass an address to the
4083 function or get an address back from the function.
4084 EXP may be a type node or an expression (whose type is tested). */
4087 aggregate_value_p (exp
)
4090 int i
, regno
, nregs
;
4093 tree type
= (TYPE_P (exp
)) ? exp
: TREE_TYPE (exp
);
4095 if (TREE_CODE (type
) == VOID_TYPE
)
4097 if (RETURN_IN_MEMORY (type
))
4099 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
4100 and thus can't be returned in registers. */
4101 if (TREE_ADDRESSABLE (type
))
4103 if (flag_pcc_struct_return
&& AGGREGATE_TYPE_P (type
))
4105 /* Make sure we have suitable call-clobbered regs to return
4106 the value in; if not, we must return it in memory. */
4107 reg
= hard_function_value (type
, 0, 0);
4109 /* If we have something other than a REG (e.g. a PARALLEL), then assume
4111 if (GET_CODE (reg
) != REG
)
4114 regno
= REGNO (reg
);
4115 nregs
= HARD_REGNO_NREGS (regno
, TYPE_MODE (type
));
4116 for (i
= 0; i
< nregs
; i
++)
4117 if (! call_used_regs
[regno
+ i
])
4122 /* Assign RTL expressions to the function's parameters.
4123 This may involve copying them into registers and using
4124 those registers as the RTL for them. */
4127 assign_parms (fndecl
)
4131 register rtx entry_parm
= 0;
4132 register rtx stack_parm
= 0;
4133 CUMULATIVE_ARGS args_so_far
;
4134 enum machine_mode promoted_mode
, passed_mode
;
4135 enum machine_mode nominal_mode
, promoted_nominal_mode
;
4137 /* Total space needed so far for args on the stack,
4138 given as a constant and a tree-expression. */
4139 struct args_size stack_args_size
;
4140 tree fntype
= TREE_TYPE (fndecl
);
4141 tree fnargs
= DECL_ARGUMENTS (fndecl
);
4142 /* This is used for the arg pointer when referring to stack args. */
4143 rtx internal_arg_pointer
;
4144 /* This is a dummy PARM_DECL that we used for the function result if
4145 the function returns a structure. */
4146 tree function_result_decl
= 0;
4147 #ifdef SETUP_INCOMING_VARARGS
4148 int varargs_setup
= 0;
4150 rtx conversion_insns
= 0;
4151 struct args_size alignment_pad
;
4153 /* Nonzero if the last arg is named `__builtin_va_alist',
4154 which is used on some machines for old-fashioned non-ANSI varargs.h;
4155 this should be stuck onto the stack as if it had arrived there. */
4157 = (current_function_varargs
4159 && (parm
= tree_last (fnargs
)) != 0
4161 && (! strcmp (IDENTIFIER_POINTER (DECL_NAME (parm
)),
4162 "__builtin_va_alist")));
4164 /* Nonzero if function takes extra anonymous args.
4165 This means the last named arg must be on the stack
4166 right before the anonymous ones. */
4168 = (TYPE_ARG_TYPES (fntype
) != 0
4169 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype
)))
4170 != void_type_node
));
4172 current_function_stdarg
= stdarg
;
4174 /* If the reg that the virtual arg pointer will be translated into is
4175 not a fixed reg or is the stack pointer, make a copy of the virtual
4176 arg pointer, and address parms via the copy. The frame pointer is
4177 considered fixed even though it is not marked as such.
4179 The second time through, simply use ap to avoid generating rtx. */
4181 if ((ARG_POINTER_REGNUM
== STACK_POINTER_REGNUM
4182 || ! (fixed_regs
[ARG_POINTER_REGNUM
]
4183 || ARG_POINTER_REGNUM
== FRAME_POINTER_REGNUM
)))
4184 internal_arg_pointer
= copy_to_reg (virtual_incoming_args_rtx
);
4186 internal_arg_pointer
= virtual_incoming_args_rtx
;
4187 current_function_internal_arg_pointer
= internal_arg_pointer
;
4189 stack_args_size
.constant
= 0;
4190 stack_args_size
.var
= 0;
4192 /* If struct value address is treated as the first argument, make it so. */
4193 if (aggregate_value_p (DECL_RESULT (fndecl
))
4194 && ! current_function_returns_pcc_struct
4195 && struct_value_incoming_rtx
== 0)
4197 tree type
= build_pointer_type (TREE_TYPE (fntype
));
4199 function_result_decl
= build_decl (PARM_DECL
, NULL_TREE
, type
);
4201 DECL_ARG_TYPE (function_result_decl
) = type
;
4202 TREE_CHAIN (function_result_decl
) = fnargs
;
4203 fnargs
= function_result_decl
;
4206 max_parm_reg
= LAST_VIRTUAL_REGISTER
+ 1;
4207 parm_reg_stack_loc
= (rtx
*) xcalloc (max_parm_reg
, sizeof (rtx
));
4209 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
4210 INIT_CUMULATIVE_INCOMING_ARGS (args_so_far
, fntype
, NULL_RTX
);
4212 INIT_CUMULATIVE_ARGS (args_so_far
, fntype
, NULL_RTX
, 0);
4215 /* We haven't yet found an argument that we must push and pretend the
4217 current_function_pretend_args_size
= 0;
4219 for (parm
= fnargs
; parm
; parm
= TREE_CHAIN (parm
))
4221 struct args_size stack_offset
;
4222 struct args_size arg_size
;
4223 int passed_pointer
= 0;
4224 int did_conversion
= 0;
4225 tree passed_type
= DECL_ARG_TYPE (parm
);
4226 tree nominal_type
= TREE_TYPE (parm
);
4229 /* Set LAST_NAMED if this is last named arg before some
4231 int last_named
= ((TREE_CHAIN (parm
) == 0
4232 || DECL_NAME (TREE_CHAIN (parm
)) == 0)
4233 && (stdarg
|| current_function_varargs
));
4234 /* Set NAMED_ARG if this arg should be treated as a named arg. For
4235 most machines, if this is a varargs/stdarg function, then we treat
4236 the last named arg as if it were anonymous too. */
4237 int named_arg
= STRICT_ARGUMENT_NAMING
? 1 : ! last_named
;
4239 if (TREE_TYPE (parm
) == error_mark_node
4240 /* This can happen after weird syntax errors
4241 or if an enum type is defined among the parms. */
4242 || TREE_CODE (parm
) != PARM_DECL
4243 || passed_type
== NULL
)
4245 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
)
4246 = gen_rtx_MEM (BLKmode
, const0_rtx
);
4247 TREE_USED (parm
) = 1;
4251 /* For varargs.h function, save info about regs and stack space
4252 used by the individual args, not including the va_alist arg. */
4253 if (hide_last_arg
&& last_named
)
4254 current_function_args_info
= args_so_far
;
4256 /* Find mode of arg as it is passed, and mode of arg
4257 as it should be during execution of this function. */
4258 passed_mode
= TYPE_MODE (passed_type
);
4259 nominal_mode
= TYPE_MODE (nominal_type
);
4261 /* If the parm's mode is VOID, its value doesn't matter,
4262 and avoid the usual things like emit_move_insn that could crash. */
4263 if (nominal_mode
== VOIDmode
)
4265 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
) = const0_rtx
;
4269 /* If the parm is to be passed as a transparent union, use the
4270 type of the first field for the tests below. We have already
4271 verified that the modes are the same. */
4272 if (DECL_TRANSPARENT_UNION (parm
)
4273 || (TREE_CODE (passed_type
) == UNION_TYPE
4274 && TYPE_TRANSPARENT_UNION (passed_type
)))
4275 passed_type
= TREE_TYPE (TYPE_FIELDS (passed_type
));
4277 /* See if this arg was passed by invisible reference. It is if
4278 it is an object whose size depends on the contents of the
4279 object itself or if the machine requires these objects be passed
4282 if ((TREE_CODE (TYPE_SIZE (passed_type
)) != INTEGER_CST
4283 && contains_placeholder_p (TYPE_SIZE (passed_type
)))
4284 || TREE_ADDRESSABLE (passed_type
)
4285 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
4286 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, passed_mode
,
4287 passed_type
, named_arg
)
4291 passed_type
= nominal_type
= build_pointer_type (passed_type
);
4293 passed_mode
= nominal_mode
= Pmode
;
4296 promoted_mode
= passed_mode
;
4298 #ifdef PROMOTE_FUNCTION_ARGS
4299 /* Compute the mode in which the arg is actually extended to. */
4300 unsignedp
= TREE_UNSIGNED (passed_type
);
4301 promoted_mode
= promote_mode (passed_type
, promoted_mode
, &unsignedp
, 1);
4304 /* Let machine desc say which reg (if any) the parm arrives in.
4305 0 means it arrives on the stack. */
4306 #ifdef FUNCTION_INCOMING_ARG
4307 entry_parm
= FUNCTION_INCOMING_ARG (args_so_far
, promoted_mode
,
4308 passed_type
, named_arg
);
4310 entry_parm
= FUNCTION_ARG (args_so_far
, promoted_mode
,
4311 passed_type
, named_arg
);
4314 if (entry_parm
== 0)
4315 promoted_mode
= passed_mode
;
4317 #ifdef SETUP_INCOMING_VARARGS
4318 /* If this is the last named parameter, do any required setup for
4319 varargs or stdargs. We need to know about the case of this being an
4320 addressable type, in which case we skip the registers it
4321 would have arrived in.
4323 For stdargs, LAST_NAMED will be set for two parameters, the one that
4324 is actually the last named, and the dummy parameter. We only
4325 want to do this action once.
4327 Also, indicate when RTL generation is to be suppressed. */
4328 if (last_named
&& !varargs_setup
)
4330 SETUP_INCOMING_VARARGS (args_so_far
, promoted_mode
, passed_type
,
4331 current_function_pretend_args_size
, 0);
4336 /* Determine parm's home in the stack,
4337 in case it arrives in the stack or we should pretend it did.
4339 Compute the stack position and rtx where the argument arrives
4342 There is one complexity here: If this was a parameter that would
4343 have been passed in registers, but wasn't only because it is
4344 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
4345 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
4346 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
4347 0 as it was the previous time. */
4349 pretend_named
= named_arg
|| PRETEND_OUTGOING_VARARGS_NAMED
;
4350 locate_and_pad_parm (promoted_mode
, passed_type
,
4351 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4354 #ifdef FUNCTION_INCOMING_ARG
4355 FUNCTION_INCOMING_ARG (args_so_far
, promoted_mode
,
4357 pretend_named
) != 0,
4359 FUNCTION_ARG (args_so_far
, promoted_mode
,
4361 pretend_named
) != 0,
4364 fndecl
, &stack_args_size
, &stack_offset
, &arg_size
,
4368 rtx offset_rtx
= ARGS_SIZE_RTX (stack_offset
);
4370 if (offset_rtx
== const0_rtx
)
4371 stack_parm
= gen_rtx_MEM (promoted_mode
, internal_arg_pointer
);
4373 stack_parm
= gen_rtx_MEM (promoted_mode
,
4374 gen_rtx_PLUS (Pmode
,
4375 internal_arg_pointer
,
4378 set_mem_attributes (stack_parm
, parm
, 1);
4381 /* If this parameter was passed both in registers and in the stack,
4382 use the copy on the stack. */
4383 if (MUST_PASS_IN_STACK (promoted_mode
, passed_type
))
4386 #ifdef FUNCTION_ARG_PARTIAL_NREGS
4387 /* If this parm was passed part in regs and part in memory,
4388 pretend it arrived entirely in memory
4389 by pushing the register-part onto the stack.
4391 In the special case of a DImode or DFmode that is split,
4392 we could put it together in a pseudoreg directly,
4393 but for now that's not worth bothering with. */
4397 int nregs
= FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, promoted_mode
,
4398 passed_type
, named_arg
);
4402 current_function_pretend_args_size
4403 = (((nregs
* UNITS_PER_WORD
) + (PARM_BOUNDARY
/ BITS_PER_UNIT
) - 1)
4404 / (PARM_BOUNDARY
/ BITS_PER_UNIT
)
4405 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
4407 /* Handle calls that pass values in multiple non-contiguous
4408 locations. The Irix 6 ABI has examples of this. */
4409 if (GET_CODE (entry_parm
) == PARALLEL
)
4410 emit_group_store (validize_mem (stack_parm
), entry_parm
,
4411 int_size_in_bytes (TREE_TYPE (parm
)),
4412 TYPE_ALIGN (TREE_TYPE (parm
)));
4415 move_block_from_reg (REGNO (entry_parm
),
4416 validize_mem (stack_parm
), nregs
,
4417 int_size_in_bytes (TREE_TYPE (parm
)));
4419 entry_parm
= stack_parm
;
4424 /* If we didn't decide this parm came in a register,
4425 by default it came on the stack. */
4426 if (entry_parm
== 0)
4427 entry_parm
= stack_parm
;
4429 /* Record permanently how this parm was passed. */
4430 DECL_INCOMING_RTL (parm
) = entry_parm
;
4432 /* If there is actually space on the stack for this parm,
4433 count it in stack_args_size; otherwise set stack_parm to 0
4434 to indicate there is no preallocated stack slot for the parm. */
4436 if (entry_parm
== stack_parm
4437 || (GET_CODE (entry_parm
) == PARALLEL
4438 && XEXP (XVECEXP (entry_parm
, 0, 0), 0) == NULL_RTX
)
4439 #if defined (REG_PARM_STACK_SPACE) && ! defined (MAYBE_REG_PARM_STACK_SPACE)
4440 /* On some machines, even if a parm value arrives in a register
4441 there is still an (uninitialized) stack slot allocated for it.
4443 ??? When MAYBE_REG_PARM_STACK_SPACE is defined, we can't tell
4444 whether this parameter already has a stack slot allocated,
4445 because an arg block exists only if current_function_args_size
4446 is larger than some threshold, and we haven't calculated that
4447 yet. So, for now, we just assume that stack slots never exist
4449 || REG_PARM_STACK_SPACE (fndecl
) > 0
4453 stack_args_size
.constant
+= arg_size
.constant
;
4455 ADD_PARM_SIZE (stack_args_size
, arg_size
.var
);
4458 /* No stack slot was pushed for this parm. */
4461 /* Update info on where next arg arrives in registers. */
4463 FUNCTION_ARG_ADVANCE (args_so_far
, promoted_mode
,
4464 passed_type
, named_arg
);
4466 /* If we can't trust the parm stack slot to be aligned enough
4467 for its ultimate type, don't use that slot after entry.
4468 We'll make another stack slot, if we need one. */
4470 unsigned int thisparm_boundary
4471 = FUNCTION_ARG_BOUNDARY (promoted_mode
, passed_type
);
4473 if (GET_MODE_ALIGNMENT (nominal_mode
) > thisparm_boundary
)
4477 /* If parm was passed in memory, and we need to convert it on entry,
4478 don't store it back in that same slot. */
4480 && nominal_mode
!= BLKmode
&& nominal_mode
!= passed_mode
)
4483 /* ENTRY_PARM is an RTX for the parameter as it arrives,
4484 in the mode in which it arrives.
4485 STACK_PARM is an RTX for a stack slot where the parameter can live
4486 during the function (in case we want to put it there).
4487 STACK_PARM is 0 if no stack slot was pushed for it.
4489 Now output code if necessary to convert ENTRY_PARM to
4490 the type in which this function declares it,
4491 and store that result in an appropriate place,
4492 which may be a pseudo reg, may be STACK_PARM,
4493 or may be a local stack slot if STACK_PARM is 0.
4495 Set DECL_RTL to that place. */
4497 if (nominal_mode
== BLKmode
|| GET_CODE (entry_parm
) == PARALLEL
)
4499 /* If a BLKmode arrives in registers, copy it to a stack slot.
4500 Handle calls that pass values in multiple non-contiguous
4501 locations. The Irix 6 ABI has examples of this. */
4502 if (GET_CODE (entry_parm
) == REG
4503 || GET_CODE (entry_parm
) == PARALLEL
)
4506 = CEIL_ROUND (int_size_in_bytes (TREE_TYPE (parm
)),
4509 /* Note that we will be storing an integral number of words.
4510 So we have to be careful to ensure that we allocate an
4511 integral number of words. We do this below in the
4512 assign_stack_local if space was not allocated in the argument
4513 list. If it was, this will not work if PARM_BOUNDARY is not
4514 a multiple of BITS_PER_WORD. It isn't clear how to fix this
4515 if it becomes a problem. */
4517 if (stack_parm
== 0)
4520 = assign_stack_local (GET_MODE (entry_parm
),
4522 set_mem_attributes (stack_parm
, parm
, 1);
4525 else if (PARM_BOUNDARY
% BITS_PER_WORD
!= 0)
4528 /* Handle calls that pass values in multiple non-contiguous
4529 locations. The Irix 6 ABI has examples of this. */
4530 if (GET_CODE (entry_parm
) == PARALLEL
)
4531 emit_group_store (validize_mem (stack_parm
), entry_parm
,
4532 int_size_in_bytes (TREE_TYPE (parm
)),
4533 TYPE_ALIGN (TREE_TYPE (parm
)));
4535 move_block_from_reg (REGNO (entry_parm
),
4536 validize_mem (stack_parm
),
4537 size_stored
/ UNITS_PER_WORD
,
4538 int_size_in_bytes (TREE_TYPE (parm
)));
4540 DECL_RTL (parm
) = stack_parm
;
4542 else if (! ((! optimize
4543 && ! DECL_REGISTER (parm
)
4544 && ! DECL_INLINE (fndecl
))
4545 /* layout_decl may set this. */
4546 || TREE_ADDRESSABLE (parm
)
4547 || TREE_SIDE_EFFECTS (parm
)
4548 /* If -ffloat-store specified, don't put explicit
4549 float variables into registers. */
4550 || (flag_float_store
4551 && TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
))
4552 /* Always assign pseudo to structure return or item passed
4553 by invisible reference. */
4554 || passed_pointer
|| parm
== function_result_decl
)
4556 /* Store the parm in a pseudoregister during the function, but we
4557 may need to do it in a wider mode. */
4559 register rtx parmreg
;
4560 unsigned int regno
, regnoi
= 0, regnor
= 0;
4562 unsignedp
= TREE_UNSIGNED (TREE_TYPE (parm
));
4564 promoted_nominal_mode
4565 = promote_mode (TREE_TYPE (parm
), nominal_mode
, &unsignedp
, 0);
4567 parmreg
= gen_reg_rtx (promoted_nominal_mode
);
4568 mark_user_reg (parmreg
);
4570 /* If this was an item that we received a pointer to, set DECL_RTL
4575 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type
)), parmreg
);
4576 set_mem_attributes (DECL_RTL (parm
), parm
, 1);
4579 DECL_RTL (parm
) = parmreg
;
4581 /* Copy the value into the register. */
4582 if (nominal_mode
!= passed_mode
4583 || promoted_nominal_mode
!= promoted_mode
)
4586 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
4587 mode, by the caller. We now have to convert it to
4588 NOMINAL_MODE, if different. However, PARMREG may be in
4589 a different mode than NOMINAL_MODE if it is being stored
4592 If ENTRY_PARM is a hard register, it might be in a register
4593 not valid for operating in its mode (e.g., an odd-numbered
4594 register for a DFmode). In that case, moves are the only
4595 thing valid, so we can't do a convert from there. This
4596 occurs when the calling sequence allow such misaligned
4599 In addition, the conversion may involve a call, which could
4600 clobber parameters which haven't been copied to pseudo
4601 registers yet. Therefore, we must first copy the parm to
4602 a pseudo reg here, and save the conversion until after all
4603 parameters have been moved. */
4605 rtx tempreg
= gen_reg_rtx (GET_MODE (entry_parm
));
4607 emit_move_insn (tempreg
, validize_mem (entry_parm
));
4609 push_to_sequence (conversion_insns
);
4610 tempreg
= convert_to_mode (nominal_mode
, tempreg
, unsignedp
);
4612 /* TREE_USED gets set erroneously during expand_assignment. */
4613 save_tree_used
= TREE_USED (parm
);
4614 expand_assignment (parm
,
4615 make_tree (nominal_type
, tempreg
), 0, 0);
4616 TREE_USED (parm
) = save_tree_used
;
4617 conversion_insns
= get_insns ();
4622 emit_move_insn (parmreg
, validize_mem (entry_parm
));
4624 /* If we were passed a pointer but the actual value
4625 can safely live in a register, put it in one. */
4626 if (passed_pointer
&& TYPE_MODE (TREE_TYPE (parm
)) != BLKmode
4628 && ! DECL_REGISTER (parm
)
4629 && ! DECL_INLINE (fndecl
))
4630 /* layout_decl may set this. */
4631 || TREE_ADDRESSABLE (parm
)
4632 || TREE_SIDE_EFFECTS (parm
)
4633 /* If -ffloat-store specified, don't put explicit
4634 float variables into registers. */
4635 || (flag_float_store
4636 && TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
)))
4638 /* We can't use nominal_mode, because it will have been set to
4639 Pmode above. We must use the actual mode of the parm. */
4640 parmreg
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm
)));
4641 mark_user_reg (parmreg
);
4642 emit_move_insn (parmreg
, DECL_RTL (parm
));
4643 DECL_RTL (parm
) = parmreg
;
4644 /* STACK_PARM is the pointer, not the parm, and PARMREG is
4648 #ifdef FUNCTION_ARG_CALLEE_COPIES
4649 /* If we are passed an arg by reference and it is our responsibility
4650 to make a copy, do it now.
4651 PASSED_TYPE and PASSED mode now refer to the pointer, not the
4652 original argument, so we must recreate them in the call to
4653 FUNCTION_ARG_CALLEE_COPIES. */
4654 /* ??? Later add code to handle the case that if the argument isn't
4655 modified, don't do the copy. */
4657 else if (passed_pointer
4658 && FUNCTION_ARG_CALLEE_COPIES (args_so_far
,
4659 TYPE_MODE (DECL_ARG_TYPE (parm
)),
4660 DECL_ARG_TYPE (parm
),
4662 && ! TREE_ADDRESSABLE (DECL_ARG_TYPE (parm
)))
4665 tree type
= DECL_ARG_TYPE (parm
);
4667 /* This sequence may involve a library call perhaps clobbering
4668 registers that haven't been copied to pseudos yet. */
4670 push_to_sequence (conversion_insns
);
4672 if (!COMPLETE_TYPE_P (type
)
4673 || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4674 /* This is a variable sized object. */
4675 copy
= gen_rtx_MEM (BLKmode
,
4676 allocate_dynamic_stack_space
4677 (expr_size (parm
), NULL_RTX
,
4678 TYPE_ALIGN (type
)));
4680 copy
= assign_stack_temp (TYPE_MODE (type
),
4681 int_size_in_bytes (type
), 1);
4682 set_mem_attributes (copy
, parm
, 1);
4684 store_expr (parm
, copy
, 0);
4685 emit_move_insn (parmreg
, XEXP (copy
, 0));
4686 if (current_function_check_memory_usage
)
4687 emit_library_call (chkr_set_right_libfunc
, 1, VOIDmode
, 3,
4688 XEXP (copy
, 0), Pmode
,
4689 GEN_INT (int_size_in_bytes (type
)),
4690 TYPE_MODE (sizetype
),
4691 GEN_INT (MEMORY_USE_RW
),
4692 TYPE_MODE (integer_type_node
));
4693 conversion_insns
= get_insns ();
4697 #endif /* FUNCTION_ARG_CALLEE_COPIES */
4699 /* In any case, record the parm's desired stack location
4700 in case we later discover it must live in the stack.
4702 If it is a COMPLEX value, store the stack location for both
4705 if (GET_CODE (parmreg
) == CONCAT
)
4706 regno
= MAX (REGNO (XEXP (parmreg
, 0)), REGNO (XEXP (parmreg
, 1)));
4708 regno
= REGNO (parmreg
);
4710 if (regno
>= max_parm_reg
)
4713 int old_max_parm_reg
= max_parm_reg
;
4715 /* It's slow to expand this one register at a time,
4716 but it's also rare and we need max_parm_reg to be
4717 precisely correct. */
4718 max_parm_reg
= regno
+ 1;
4719 new = (rtx
*) xrealloc (parm_reg_stack_loc
,
4720 max_parm_reg
* sizeof (rtx
));
4721 bzero ((char *) (new + old_max_parm_reg
),
4722 (max_parm_reg
- old_max_parm_reg
) * sizeof (rtx
));
4723 parm_reg_stack_loc
= new;
4726 if (GET_CODE (parmreg
) == CONCAT
)
4728 enum machine_mode submode
= GET_MODE (XEXP (parmreg
, 0));
4730 regnor
= REGNO (gen_realpart (submode
, parmreg
));
4731 regnoi
= REGNO (gen_imagpart (submode
, parmreg
));
4733 if (stack_parm
!= 0)
4735 parm_reg_stack_loc
[regnor
]
4736 = gen_realpart (submode
, stack_parm
);
4737 parm_reg_stack_loc
[regnoi
]
4738 = gen_imagpart (submode
, stack_parm
);
4742 parm_reg_stack_loc
[regnor
] = 0;
4743 parm_reg_stack_loc
[regnoi
] = 0;
4747 parm_reg_stack_loc
[REGNO (parmreg
)] = stack_parm
;
4749 /* Mark the register as eliminable if we did no conversion
4750 and it was copied from memory at a fixed offset,
4751 and the arg pointer was not copied to a pseudo-reg.
4752 If the arg pointer is a pseudo reg or the offset formed
4753 an invalid address, such memory-equivalences
4754 as we make here would screw up life analysis for it. */
4755 if (nominal_mode
== passed_mode
4758 && GET_CODE (stack_parm
) == MEM
4759 && stack_offset
.var
== 0
4760 && reg_mentioned_p (virtual_incoming_args_rtx
,
4761 XEXP (stack_parm
, 0)))
4763 rtx linsn
= get_last_insn ();
4766 /* Mark complex types separately. */
4767 if (GET_CODE (parmreg
) == CONCAT
)
4768 /* Scan backwards for the set of the real and
4770 for (sinsn
= linsn
; sinsn
!= 0;
4771 sinsn
= prev_nonnote_insn (sinsn
))
4773 set
= single_set (sinsn
);
4775 && SET_DEST (set
) == regno_reg_rtx
[regnoi
])
4777 = gen_rtx_EXPR_LIST (REG_EQUIV
,
4778 parm_reg_stack_loc
[regnoi
],
4781 && SET_DEST (set
) == regno_reg_rtx
[regnor
])
4783 = gen_rtx_EXPR_LIST (REG_EQUIV
,
4784 parm_reg_stack_loc
[regnor
],
4787 else if ((set
= single_set (linsn
)) != 0
4788 && SET_DEST (set
) == parmreg
)
4790 = gen_rtx_EXPR_LIST (REG_EQUIV
,
4791 stack_parm
, REG_NOTES (linsn
));
4794 /* For pointer data type, suggest pointer register. */
4795 if (POINTER_TYPE_P (TREE_TYPE (parm
)))
4796 mark_reg_pointer (parmreg
,
4797 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
))));
4802 /* Value must be stored in the stack slot STACK_PARM
4803 during function execution. */
4805 if (promoted_mode
!= nominal_mode
)
4807 /* Conversion is required. */
4808 rtx tempreg
= gen_reg_rtx (GET_MODE (entry_parm
));
4810 emit_move_insn (tempreg
, validize_mem (entry_parm
));
4812 push_to_sequence (conversion_insns
);
4813 entry_parm
= convert_to_mode (nominal_mode
, tempreg
,
4814 TREE_UNSIGNED (TREE_TYPE (parm
)));
4817 /* ??? This may need a big-endian conversion on sparc64. */
4818 stack_parm
= change_address (stack_parm
, nominal_mode
,
4821 conversion_insns
= get_insns ();
4826 if (entry_parm
!= stack_parm
)
4828 if (stack_parm
== 0)
4831 = assign_stack_local (GET_MODE (entry_parm
),
4832 GET_MODE_SIZE (GET_MODE (entry_parm
)), 0);
4833 set_mem_attributes (stack_parm
, parm
, 1);
4836 if (promoted_mode
!= nominal_mode
)
4838 push_to_sequence (conversion_insns
);
4839 emit_move_insn (validize_mem (stack_parm
),
4840 validize_mem (entry_parm
));
4841 conversion_insns
= get_insns ();
4845 emit_move_insn (validize_mem (stack_parm
),
4846 validize_mem (entry_parm
));
4848 if (current_function_check_memory_usage
)
4850 push_to_sequence (conversion_insns
);
4851 emit_library_call (chkr_set_right_libfunc
, 1, VOIDmode
, 3,
4852 XEXP (stack_parm
, 0), Pmode
,
4853 GEN_INT (GET_MODE_SIZE (GET_MODE
4855 TYPE_MODE (sizetype
),
4856 GEN_INT (MEMORY_USE_RW
),
4857 TYPE_MODE (integer_type_node
));
4859 conversion_insns
= get_insns ();
4862 DECL_RTL (parm
) = stack_parm
;
4865 /* If this "parameter" was the place where we are receiving the
4866 function's incoming structure pointer, set up the result. */
4867 if (parm
== function_result_decl
)
4869 tree result
= DECL_RESULT (fndecl
);
4872 = gen_rtx_MEM (DECL_MODE (result
), DECL_RTL (parm
));
4874 set_mem_attributes (DECL_RTL (result
), result
, 1);
4878 /* Output all parameter conversion instructions (possibly including calls)
4879 now that all parameters have been copied out of hard registers. */
4880 emit_insns (conversion_insns
);
4882 last_parm_insn
= get_last_insn ();
4884 current_function_args_size
= stack_args_size
.constant
;
4886 /* Adjust function incoming argument size for alignment and
4889 #ifdef REG_PARM_STACK_SPACE
4890 #ifndef MAYBE_REG_PARM_STACK_SPACE
4891 current_function_args_size
= MAX (current_function_args_size
,
4892 REG_PARM_STACK_SPACE (fndecl
));
4896 #ifdef STACK_BOUNDARY
4897 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
4899 current_function_args_size
4900 = ((current_function_args_size
+ STACK_BYTES
- 1)
4901 / STACK_BYTES
) * STACK_BYTES
;
4904 #ifdef ARGS_GROW_DOWNWARD
4905 current_function_arg_offset_rtx
4906 = (stack_args_size
.var
== 0 ? GEN_INT (-stack_args_size
.constant
)
4907 : expand_expr (size_diffop (stack_args_size
.var
,
4908 size_int (-stack_args_size
.constant
)),
4909 NULL_RTX
, VOIDmode
, EXPAND_MEMORY_USE_BAD
));
4911 current_function_arg_offset_rtx
= ARGS_SIZE_RTX (stack_args_size
);
4914 /* See how many bytes, if any, of its args a function should try to pop
4917 current_function_pops_args
= RETURN_POPS_ARGS (fndecl
, TREE_TYPE (fndecl
),
4918 current_function_args_size
);
4920 /* For stdarg.h function, save info about
4921 regs and stack space used by the named args. */
4924 current_function_args_info
= args_so_far
;
4926 /* Set the rtx used for the function return value. Put this in its
4927 own variable so any optimizers that need this information don't have
4928 to include tree.h. Do this here so it gets done when an inlined
4929 function gets output. */
4931 current_function_return_rtx
= DECL_RTL (DECL_RESULT (fndecl
));
4934 /* Indicate whether REGNO is an incoming argument to the current function
4935 that was promoted to a wider mode. If so, return the RTX for the
4936 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
4937 that REGNO is promoted from and whether the promotion was signed or
4940 #ifdef PROMOTE_FUNCTION_ARGS
4943 promoted_input_arg (regno
, pmode
, punsignedp
)
4945 enum machine_mode
*pmode
;
4950 for (arg
= DECL_ARGUMENTS (current_function_decl
); arg
;
4951 arg
= TREE_CHAIN (arg
))
4952 if (GET_CODE (DECL_INCOMING_RTL (arg
)) == REG
4953 && REGNO (DECL_INCOMING_RTL (arg
)) == regno
4954 && TYPE_MODE (DECL_ARG_TYPE (arg
)) == TYPE_MODE (TREE_TYPE (arg
)))
4956 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (arg
));
4957 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (arg
));
4959 mode
= promote_mode (TREE_TYPE (arg
), mode
, &unsignedp
, 1);
4960 if (mode
== GET_MODE (DECL_INCOMING_RTL (arg
))
4961 && mode
!= DECL_MODE (arg
))
4963 *pmode
= DECL_MODE (arg
);
4964 *punsignedp
= unsignedp
;
4965 return DECL_INCOMING_RTL (arg
);
4974 /* Compute the size and offset from the start of the stacked arguments for a
4975 parm passed in mode PASSED_MODE and with type TYPE.
4977 INITIAL_OFFSET_PTR points to the current offset into the stacked
4980 The starting offset and size for this parm are returned in *OFFSET_PTR
4981 and *ARG_SIZE_PTR, respectively.
4983 IN_REGS is non-zero if the argument will be passed in registers. It will
4984 never be set if REG_PARM_STACK_SPACE is not defined.
4986 FNDECL is the function in which the argument was defined.
4988 There are two types of rounding that are done. The first, controlled by
4989 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
4990 list to be aligned to the specific boundary (in bits). This rounding
4991 affects the initial and starting offsets, but not the argument size.
4993 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
4994 optionally rounds the size of the parm to PARM_BOUNDARY. The
4995 initial offset is not affected by this rounding, while the size always
4996 is and the starting offset may be. */
4998 /* offset_ptr will be negative for ARGS_GROW_DOWNWARD case;
4999 initial_offset_ptr is positive because locate_and_pad_parm's
5000 callers pass in the total size of args so far as
5001 initial_offset_ptr. arg_size_ptr is always positive.*/
5004 locate_and_pad_parm (passed_mode
, type
, in_regs
, fndecl
,
5005 initial_offset_ptr
, offset_ptr
, arg_size_ptr
,
5007 enum machine_mode passed_mode
;
5009 int in_regs ATTRIBUTE_UNUSED
;
5010 tree fndecl ATTRIBUTE_UNUSED
;
5011 struct args_size
*initial_offset_ptr
;
5012 struct args_size
*offset_ptr
;
5013 struct args_size
*arg_size_ptr
;
5014 struct args_size
*alignment_pad
;
5018 = type
? size_in_bytes (type
) : size_int (GET_MODE_SIZE (passed_mode
));
5019 enum direction where_pad
= FUNCTION_ARG_PADDING (passed_mode
, type
);
5020 int boundary
= FUNCTION_ARG_BOUNDARY (passed_mode
, type
);
5022 #ifdef REG_PARM_STACK_SPACE
5023 /* If we have found a stack parm before we reach the end of the
5024 area reserved for registers, skip that area. */
5027 int reg_parm_stack_space
= 0;
5029 #ifdef MAYBE_REG_PARM_STACK_SPACE
5030 reg_parm_stack_space
= MAYBE_REG_PARM_STACK_SPACE
;
5032 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
5034 if (reg_parm_stack_space
> 0)
5036 if (initial_offset_ptr
->var
)
5038 initial_offset_ptr
->var
5039 = size_binop (MAX_EXPR
, ARGS_SIZE_TREE (*initial_offset_ptr
),
5040 ssize_int (reg_parm_stack_space
));
5041 initial_offset_ptr
->constant
= 0;
5043 else if (initial_offset_ptr
->constant
< reg_parm_stack_space
)
5044 initial_offset_ptr
->constant
= reg_parm_stack_space
;
5047 #endif /* REG_PARM_STACK_SPACE */
5049 arg_size_ptr
->var
= 0;
5050 arg_size_ptr
->constant
= 0;
5052 #ifdef ARGS_GROW_DOWNWARD
5053 if (initial_offset_ptr
->var
)
5055 offset_ptr
->constant
= 0;
5056 offset_ptr
->var
= size_binop (MINUS_EXPR
, ssize_int (0),
5057 initial_offset_ptr
->var
);
5061 offset_ptr
->constant
= -initial_offset_ptr
->constant
;
5062 offset_ptr
->var
= 0;
5064 if (where_pad
!= none
5065 && (TREE_CODE (sizetree
) != INTEGER_CST
5066 || ((TREE_INT_CST_LOW (sizetree
) * BITS_PER_UNIT
) % PARM_BOUNDARY
)))
5067 sizetree
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
5068 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
5069 if (where_pad
!= downward
)
5070 pad_to_arg_alignment (offset_ptr
, boundary
, alignment_pad
);
5071 if (initial_offset_ptr
->var
)
5072 arg_size_ptr
->var
= size_binop (MINUS_EXPR
,
5073 size_binop (MINUS_EXPR
,
5075 initial_offset_ptr
->var
),
5079 arg_size_ptr
->constant
= (-initial_offset_ptr
->constant
5080 - offset_ptr
->constant
);
5082 #else /* !ARGS_GROW_DOWNWARD */
5083 pad_to_arg_alignment (initial_offset_ptr
, boundary
, alignment_pad
);
5084 *offset_ptr
= *initial_offset_ptr
;
5086 #ifdef PUSH_ROUNDING
5087 if (passed_mode
!= BLKmode
)
5088 sizetree
= size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree
)));
5091 /* Pad_below needs the pre-rounded size to know how much to pad below
5092 so this must be done before rounding up. */
5093 if (where_pad
== downward
5094 /* However, BLKmode args passed in regs have their padding done elsewhere.
5095 The stack slot must be able to hold the entire register. */
5096 && !(in_regs
&& passed_mode
== BLKmode
))
5097 pad_below (offset_ptr
, passed_mode
, sizetree
);
5099 if (where_pad
!= none
5100 && (TREE_CODE (sizetree
) != INTEGER_CST
5101 || ((TREE_INT_CST_LOW (sizetree
) * BITS_PER_UNIT
) % PARM_BOUNDARY
)))
5102 sizetree
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
5104 ADD_PARM_SIZE (*arg_size_ptr
, sizetree
);
5105 #endif /* ARGS_GROW_DOWNWARD */
5108 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
5109 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
5112 pad_to_arg_alignment (offset_ptr
, boundary
, alignment_pad
)
5113 struct args_size
*offset_ptr
;
5115 struct args_size
*alignment_pad
;
5117 tree save_var
= NULL_TREE
;
5118 HOST_WIDE_INT save_constant
= 0;
5120 int boundary_in_bytes
= boundary
/ BITS_PER_UNIT
;
5122 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
5124 save_var
= offset_ptr
->var
;
5125 save_constant
= offset_ptr
->constant
;
5128 alignment_pad
->var
= NULL_TREE
;
5129 alignment_pad
->constant
= 0;
5131 if (boundary
> BITS_PER_UNIT
)
5133 if (offset_ptr
->var
)
5136 #ifdef ARGS_GROW_DOWNWARD
5141 (ARGS_SIZE_TREE (*offset_ptr
),
5142 boundary
/ BITS_PER_UNIT
);
5143 offset_ptr
->constant
= 0; /*?*/
5144 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
5145 alignment_pad
->var
= size_binop (MINUS_EXPR
, offset_ptr
->var
,
5150 offset_ptr
->constant
=
5151 #ifdef ARGS_GROW_DOWNWARD
5152 FLOOR_ROUND (offset_ptr
->constant
, boundary_in_bytes
);
5154 CEIL_ROUND (offset_ptr
->constant
, boundary_in_bytes
);
5156 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
5157 alignment_pad
->constant
= offset_ptr
->constant
- save_constant
;
5162 #ifndef ARGS_GROW_DOWNWARD
5164 pad_below (offset_ptr
, passed_mode
, sizetree
)
5165 struct args_size
*offset_ptr
;
5166 enum machine_mode passed_mode
;
5169 if (passed_mode
!= BLKmode
)
5171 if (GET_MODE_BITSIZE (passed_mode
) % PARM_BOUNDARY
)
5172 offset_ptr
->constant
5173 += (((GET_MODE_BITSIZE (passed_mode
) + PARM_BOUNDARY
- 1)
5174 / PARM_BOUNDARY
* PARM_BOUNDARY
/ BITS_PER_UNIT
)
5175 - GET_MODE_SIZE (passed_mode
));
5179 if (TREE_CODE (sizetree
) != INTEGER_CST
5180 || (TREE_INT_CST_LOW (sizetree
) * BITS_PER_UNIT
) % PARM_BOUNDARY
)
5182 /* Round the size up to multiple of PARM_BOUNDARY bits. */
5183 tree s2
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
5185 ADD_PARM_SIZE (*offset_ptr
, s2
);
5186 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
5192 /* Walk the tree of blocks describing the binding levels within a function
5193 and warn about uninitialized variables.
5194 This is done after calling flow_analysis and before global_alloc
5195 clobbers the pseudo-regs to hard regs. */
5198 uninitialized_vars_warning (block
)
5201 register tree decl
, sub
;
5202 for (decl
= BLOCK_VARS (block
); decl
; decl
= TREE_CHAIN (decl
))
5204 if (warn_uninitialized
5205 && TREE_CODE (decl
) == VAR_DECL
5206 /* These warnings are unreliable for and aggregates
5207 because assigning the fields one by one can fail to convince
5208 flow.c that the entire aggregate was initialized.
5209 Unions are troublesome because members may be shorter. */
5210 && ! AGGREGATE_TYPE_P (TREE_TYPE (decl
))
5211 && DECL_RTL (decl
) != 0
5212 && GET_CODE (DECL_RTL (decl
)) == REG
5213 /* Global optimizations can make it difficult to determine if a
5214 particular variable has been initialized. However, a VAR_DECL
5215 with a nonzero DECL_INITIAL had an initializer, so do not
5216 claim it is potentially uninitialized.
5218 We do not care about the actual value in DECL_INITIAL, so we do
5219 not worry that it may be a dangling pointer. */
5220 && DECL_INITIAL (decl
) == NULL_TREE
5221 && regno_uninitialized (REGNO (DECL_RTL (decl
))))
5222 warning_with_decl (decl
,
5223 "`%s' might be used uninitialized in this function");
5225 && TREE_CODE (decl
) == VAR_DECL
5226 && DECL_RTL (decl
) != 0
5227 && GET_CODE (DECL_RTL (decl
)) == REG
5228 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl
))))
5229 warning_with_decl (decl
,
5230 "variable `%s' might be clobbered by `longjmp' or `vfork'");
5232 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= TREE_CHAIN (sub
))
5233 uninitialized_vars_warning (sub
);
5236 /* Do the appropriate part of uninitialized_vars_warning
5237 but for arguments instead of local variables. */
5240 setjmp_args_warning ()
5243 for (decl
= DECL_ARGUMENTS (current_function_decl
);
5244 decl
; decl
= TREE_CHAIN (decl
))
5245 if (DECL_RTL (decl
) != 0
5246 && GET_CODE (DECL_RTL (decl
)) == REG
5247 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl
))))
5248 warning_with_decl (decl
,
5249 "argument `%s' might be clobbered by `longjmp' or `vfork'");
5252 /* If this function call setjmp, put all vars into the stack
5253 unless they were declared `register'. */
5256 setjmp_protect (block
)
5259 register tree decl
, sub
;
5260 for (decl
= BLOCK_VARS (block
); decl
; decl
= TREE_CHAIN (decl
))
5261 if ((TREE_CODE (decl
) == VAR_DECL
5262 || TREE_CODE (decl
) == PARM_DECL
)
5263 && DECL_RTL (decl
) != 0
5264 && (GET_CODE (DECL_RTL (decl
)) == REG
5265 || (GET_CODE (DECL_RTL (decl
)) == MEM
5266 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == ADDRESSOF
))
5267 /* If this variable came from an inline function, it must be
5268 that its life doesn't overlap the setjmp. If there was a
5269 setjmp in the function, it would already be in memory. We
5270 must exclude such variable because their DECL_RTL might be
5271 set to strange things such as virtual_stack_vars_rtx. */
5272 && ! DECL_FROM_INLINE (decl
)
5274 #ifdef NON_SAVING_SETJMP
5275 /* If longjmp doesn't restore the registers,
5276 don't put anything in them. */
5280 ! DECL_REGISTER (decl
)))
5281 put_var_into_stack (decl
);
5282 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= TREE_CHAIN (sub
))
5283 setjmp_protect (sub
);
5286 /* Like the previous function, but for args instead of local variables. */
5289 setjmp_protect_args ()
5292 for (decl
= DECL_ARGUMENTS (current_function_decl
);
5293 decl
; decl
= TREE_CHAIN (decl
))
5294 if ((TREE_CODE (decl
) == VAR_DECL
5295 || TREE_CODE (decl
) == PARM_DECL
)
5296 && DECL_RTL (decl
) != 0
5297 && (GET_CODE (DECL_RTL (decl
)) == REG
5298 || (GET_CODE (DECL_RTL (decl
)) == MEM
5299 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == ADDRESSOF
))
5301 /* If longjmp doesn't restore the registers,
5302 don't put anything in them. */
5303 #ifdef NON_SAVING_SETJMP
5307 ! DECL_REGISTER (decl
)))
5308 put_var_into_stack (decl
);
5311 /* Return the context-pointer register corresponding to DECL,
5312 or 0 if it does not need one. */
5315 lookup_static_chain (decl
)
5318 tree context
= decl_function_context (decl
);
5322 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_NO_STATIC_CHAIN (decl
)))
5325 /* We treat inline_function_decl as an alias for the current function
5326 because that is the inline function whose vars, types, etc.
5327 are being merged into the current function.
5328 See expand_inline_function. */
5329 if (context
== current_function_decl
|| context
== inline_function_decl
)
5330 return virtual_stack_vars_rtx
;
5332 for (link
= context_display
; link
; link
= TREE_CHAIN (link
))
5333 if (TREE_PURPOSE (link
) == context
)
5334 return RTL_EXPR_RTL (TREE_VALUE (link
));
5339 /* Convert a stack slot address ADDR for variable VAR
5340 (from a containing function)
5341 into an address valid in this function (using a static chain). */
5344 fix_lexical_addr (addr
, var
)
5349 HOST_WIDE_INT displacement
;
5350 tree context
= decl_function_context (var
);
5351 struct function
*fp
;
5354 /* If this is the present function, we need not do anything. */
5355 if (context
== current_function_decl
|| context
== inline_function_decl
)
5358 for (fp
= outer_function_chain
; fp
; fp
= fp
->next
)
5359 if (fp
->decl
== context
)
5365 if (GET_CODE (addr
) == ADDRESSOF
&& GET_CODE (XEXP (addr
, 0)) == MEM
)
5366 addr
= XEXP (XEXP (addr
, 0), 0);
5368 /* Decode given address as base reg plus displacement. */
5369 if (GET_CODE (addr
) == REG
)
5370 basereg
= addr
, displacement
= 0;
5371 else if (GET_CODE (addr
) == PLUS
&& GET_CODE (XEXP (addr
, 1)) == CONST_INT
)
5372 basereg
= XEXP (addr
, 0), displacement
= INTVAL (XEXP (addr
, 1));
5376 /* We accept vars reached via the containing function's
5377 incoming arg pointer and via its stack variables pointer. */
5378 if (basereg
== fp
->internal_arg_pointer
)
5380 /* If reached via arg pointer, get the arg pointer value
5381 out of that function's stack frame.
5383 There are two cases: If a separate ap is needed, allocate a
5384 slot in the outer function for it and dereference it that way.
5385 This is correct even if the real ap is actually a pseudo.
5386 Otherwise, just adjust the offset from the frame pointer to
5389 #ifdef NEED_SEPARATE_AP
5392 if (fp
->x_arg_pointer_save_area
== 0)
5393 fp
->x_arg_pointer_save_area
5394 = assign_stack_local_1 (Pmode
, GET_MODE_SIZE (Pmode
), 0, fp
);
5396 addr
= fix_lexical_addr (XEXP (fp
->x_arg_pointer_save_area
, 0), var
);
5397 addr
= memory_address (Pmode
, addr
);
5399 base
= gen_rtx_MEM (Pmode
, addr
);
5400 MEM_ALIAS_SET (base
) = get_frame_alias_set ();
5401 base
= copy_to_reg (base
);
5403 displacement
+= (FIRST_PARM_OFFSET (context
) - STARTING_FRAME_OFFSET
);
5404 base
= lookup_static_chain (var
);
5408 else if (basereg
== virtual_stack_vars_rtx
)
5410 /* This is the same code as lookup_static_chain, duplicated here to
5411 avoid an extra call to decl_function_context. */
5414 for (link
= context_display
; link
; link
= TREE_CHAIN (link
))
5415 if (TREE_PURPOSE (link
) == context
)
5417 base
= RTL_EXPR_RTL (TREE_VALUE (link
));
5425 /* Use same offset, relative to appropriate static chain or argument
5427 return plus_constant (base
, displacement
);
5430 /* Return the address of the trampoline for entering nested fn FUNCTION.
5431 If necessary, allocate a trampoline (in the stack frame)
5432 and emit rtl to initialize its contents (at entry to this function). */
5435 trampoline_address (function
)
5441 struct function
*fp
;
5444 /* Find an existing trampoline and return it. */
5445 for (link
= trampoline_list
; link
; link
= TREE_CHAIN (link
))
5446 if (TREE_PURPOSE (link
) == function
)
5448 round_trampoline_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link
)), 0));
5450 for (fp
= outer_function_chain
; fp
; fp
= fp
->next
)
5451 for (link
= fp
->x_trampoline_list
; link
; link
= TREE_CHAIN (link
))
5452 if (TREE_PURPOSE (link
) == function
)
5454 tramp
= fix_lexical_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link
)), 0),
5456 return round_trampoline_addr (tramp
);
5459 /* None exists; we must make one. */
5461 /* Find the `struct function' for the function containing FUNCTION. */
5463 fn_context
= decl_function_context (function
);
5464 if (fn_context
!= current_function_decl
5465 && fn_context
!= inline_function_decl
)
5466 for (fp
= outer_function_chain
; fp
; fp
= fp
->next
)
5467 if (fp
->decl
== fn_context
)
5470 /* Allocate run-time space for this trampoline
5471 (usually in the defining function's stack frame). */
5472 #ifdef ALLOCATE_TRAMPOLINE
5473 tramp
= ALLOCATE_TRAMPOLINE (fp
);
5475 /* If rounding needed, allocate extra space
5476 to ensure we have TRAMPOLINE_SIZE bytes left after rounding up. */
5477 #ifdef TRAMPOLINE_ALIGNMENT
5478 #define TRAMPOLINE_REAL_SIZE \
5479 (TRAMPOLINE_SIZE + (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT) - 1)
5481 #define TRAMPOLINE_REAL_SIZE (TRAMPOLINE_SIZE)
5483 tramp
= assign_stack_local_1 (BLKmode
, TRAMPOLINE_REAL_SIZE
, 0,
5487 /* Record the trampoline for reuse and note it for later initialization
5488 by expand_function_end. */
5491 push_obstacks (fp
->function_maybepermanent_obstack
,
5492 fp
->function_maybepermanent_obstack
);
5493 rtlexp
= make_node (RTL_EXPR
);
5494 RTL_EXPR_RTL (rtlexp
) = tramp
;
5495 fp
->x_trampoline_list
= tree_cons (function
, rtlexp
,
5496 fp
->x_trampoline_list
);
5501 /* Make the RTL_EXPR node temporary, not momentary, so that the
5502 trampoline_list doesn't become garbage. */
5503 int momentary
= suspend_momentary ();
5504 rtlexp
= make_node (RTL_EXPR
);
5505 resume_momentary (momentary
);
5507 RTL_EXPR_RTL (rtlexp
) = tramp
;
5508 trampoline_list
= tree_cons (function
, rtlexp
, trampoline_list
);
5511 tramp
= fix_lexical_addr (XEXP (tramp
, 0), function
);
5512 return round_trampoline_addr (tramp
);
5515 /* Given a trampoline address,
5516 round it to multiple of TRAMPOLINE_ALIGNMENT. */
5519 round_trampoline_addr (tramp
)
5522 #ifdef TRAMPOLINE_ALIGNMENT
5523 /* Round address up to desired boundary. */
5524 rtx temp
= gen_reg_rtx (Pmode
);
5525 temp
= expand_binop (Pmode
, add_optab
, tramp
,
5526 GEN_INT (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
- 1),
5527 temp
, 0, OPTAB_LIB_WIDEN
);
5528 tramp
= expand_binop (Pmode
, and_optab
, temp
,
5529 GEN_INT (-TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
),
5530 temp
, 0, OPTAB_LIB_WIDEN
);
5535 /* Put all this function's BLOCK nodes including those that are chained
5536 onto the first block into a vector, and return it.
5537 Also store in each NOTE for the beginning or end of a block
5538 the index of that block in the vector.
5539 The arguments are BLOCK, the chain of top-level blocks of the function,
5540 and INSNS, the insn chain of the function. */
5546 tree
*block_vector
, *last_block_vector
;
5548 tree block
= DECL_INITIAL (current_function_decl
);
5553 /* Fill the BLOCK_VECTOR with all of the BLOCKs in this function, in
5554 depth-first order. */
5555 block_vector
= get_block_vector (block
, &n_blocks
);
5556 block_stack
= (tree
*) xmalloc (n_blocks
* sizeof (tree
));
5558 last_block_vector
= identify_blocks_1 (get_insns (),
5560 block_vector
+ n_blocks
,
5563 /* If we didn't use all of the subblocks, we've misplaced block notes. */
5564 /* ??? This appears to happen all the time. Latent bugs elsewhere? */
5565 if (0 && last_block_vector
!= block_vector
+ n_blocks
)
5568 free (block_vector
);
5572 /* Subroutine of identify_blocks. Do the block substitution on the
5573 insn chain beginning with INSNS. Recurse for CALL_PLACEHOLDER chains.
5575 BLOCK_STACK is pushed and popped for each BLOCK_BEGIN/BLOCK_END pair.
5576 BLOCK_VECTOR is incremented for each block seen. */
5579 identify_blocks_1 (insns
, block_vector
, end_block_vector
, orig_block_stack
)
5582 tree
*end_block_vector
;
5583 tree
*orig_block_stack
;
5586 tree
*block_stack
= orig_block_stack
;
5588 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
5590 if (GET_CODE (insn
) == NOTE
)
5592 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
)
5596 /* If there are more block notes than BLOCKs, something
5598 if (block_vector
== end_block_vector
)
5601 b
= *block_vector
++;
5602 NOTE_BLOCK (insn
) = b
;
5605 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
)
5607 /* If there are more NOTE_INSN_BLOCK_ENDs than
5608 NOTE_INSN_BLOCK_BEGs, something is badly wrong. */
5609 if (block_stack
== orig_block_stack
)
5612 NOTE_BLOCK (insn
) = *--block_stack
;
5615 else if (GET_CODE (insn
) == CALL_INSN
5616 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
5618 rtx cp
= PATTERN (insn
);
5620 block_vector
= identify_blocks_1 (XEXP (cp
, 0), block_vector
,
5621 end_block_vector
, block_stack
);
5623 block_vector
= identify_blocks_1 (XEXP (cp
, 1), block_vector
,
5624 end_block_vector
, block_stack
);
5626 block_vector
= identify_blocks_1 (XEXP (cp
, 2), block_vector
,
5627 end_block_vector
, block_stack
);
5631 /* If there are more NOTE_INSN_BLOCK_BEGINs than NOTE_INSN_BLOCK_ENDs,
5632 something is badly wrong. */
5633 if (block_stack
!= orig_block_stack
)
5636 return block_vector
;
5639 /* Identify BLOCKs referenced by more than one
5640 NOTE_INSN_BLOCK_{BEG,END}, and create duplicate blocks. */
5645 tree block
= DECL_INITIAL (current_function_decl
);
5646 varray_type block_stack
;
5648 if (block
== NULL_TREE
)
5651 VARRAY_TREE_INIT (block_stack
, 10, "block_stack");
5653 /* Prune the old trees away, so that they don't get in the way. */
5654 BLOCK_SUBBLOCKS (block
) = NULL_TREE
;
5655 BLOCK_CHAIN (block
) = NULL_TREE
;
5657 reorder_blocks_1 (get_insns (), block
, &block_stack
);
5659 BLOCK_SUBBLOCKS (block
) = blocks_nreverse (BLOCK_SUBBLOCKS (block
));
5661 VARRAY_FREE (block_stack
);
5664 /* Helper function for reorder_blocks. Process the insn chain beginning
5665 at INSNS. Recurse for CALL_PLACEHOLDER insns. */
5668 reorder_blocks_1 (insns
, current_block
, p_block_stack
)
5671 varray_type
*p_block_stack
;
5675 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
5677 if (GET_CODE (insn
) == NOTE
)
5679 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
)
5681 tree block
= NOTE_BLOCK (insn
);
5682 /* If we have seen this block before, copy it. */
5683 if (TREE_ASM_WRITTEN (block
))
5685 block
= copy_node (block
);
5686 NOTE_BLOCK (insn
) = block
;
5688 BLOCK_SUBBLOCKS (block
) = 0;
5689 TREE_ASM_WRITTEN (block
) = 1;
5690 BLOCK_SUPERCONTEXT (block
) = current_block
;
5691 BLOCK_CHAIN (block
) = BLOCK_SUBBLOCKS (current_block
);
5692 BLOCK_SUBBLOCKS (current_block
) = block
;
5693 current_block
= block
;
5694 VARRAY_PUSH_TREE (*p_block_stack
, block
);
5696 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
)
5698 NOTE_BLOCK (insn
) = VARRAY_TOP_TREE (*p_block_stack
);
5699 VARRAY_POP (*p_block_stack
);
5700 BLOCK_SUBBLOCKS (current_block
)
5701 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block
));
5702 current_block
= BLOCK_SUPERCONTEXT (current_block
);
5705 else if (GET_CODE (insn
) == CALL_INSN
5706 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
5708 rtx cp
= PATTERN (insn
);
5709 reorder_blocks_1 (XEXP (cp
, 0), current_block
, p_block_stack
);
5711 reorder_blocks_1 (XEXP (cp
, 1), current_block
, p_block_stack
);
5713 reorder_blocks_1 (XEXP (cp
, 2), current_block
, p_block_stack
);
5718 /* Reverse the order of elements in the chain T of blocks,
5719 and return the new head of the chain (old last element). */
5725 register tree prev
= 0, decl
, next
;
5726 for (decl
= t
; decl
; decl
= next
)
5728 next
= BLOCK_CHAIN (decl
);
5729 BLOCK_CHAIN (decl
) = prev
;
5735 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
5736 non-NULL, list them all into VECTOR, in a depth-first preorder
5737 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
5741 all_blocks (block
, vector
)
5749 TREE_ASM_WRITTEN (block
) = 0;
5751 /* Record this block. */
5753 vector
[n_blocks
] = block
;
5757 /* Record the subblocks, and their subblocks... */
5758 n_blocks
+= all_blocks (BLOCK_SUBBLOCKS (block
),
5759 vector
? vector
+ n_blocks
: 0);
5760 block
= BLOCK_CHAIN (block
);
5766 /* Return a vector containing all the blocks rooted at BLOCK. The
5767 number of elements in the vector is stored in N_BLOCKS_P. The
5768 vector is dynamically allocated; it is the caller's responsibility
5769 to call `free' on the pointer returned. */
5772 get_block_vector (block
, n_blocks_p
)
5778 *n_blocks_p
= all_blocks (block
, NULL
);
5779 block_vector
= (tree
*) xmalloc (*n_blocks_p
* sizeof (tree
));
5780 all_blocks (block
, block_vector
);
5782 return block_vector
;
5785 static int next_block_index
= 2;
5787 /* Set BLOCK_NUMBER for all the blocks in FN. */
5797 /* For SDB and XCOFF debugging output, we start numbering the blocks
5798 from 1 within each function, rather than keeping a running
5800 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
5801 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
5802 next_block_index
= 1;
5805 block_vector
= get_block_vector (DECL_INITIAL (fn
), &n_blocks
);
5807 /* The top-level BLOCK isn't numbered at all. */
5808 for (i
= 1; i
< n_blocks
; ++i
)
5809 /* We number the blocks from two. */
5810 BLOCK_NUMBER (block_vector
[i
]) = next_block_index
++;
5812 free (block_vector
);
5817 /* Allocate a function structure and reset its contents to the defaults. */
5819 prepare_function_start ()
5821 cfun
= (struct function
*) xcalloc (1, sizeof (struct function
));
5823 init_stmt_for_function ();
5824 init_eh_for_function ();
5826 cse_not_expected
= ! optimize
;
5828 /* Caller save not needed yet. */
5829 caller_save_needed
= 0;
5831 /* No stack slots have been made yet. */
5832 stack_slot_list
= 0;
5834 current_function_has_nonlocal_label
= 0;
5835 current_function_has_nonlocal_goto
= 0;
5837 /* There is no stack slot for handling nonlocal gotos. */
5838 nonlocal_goto_handler_slots
= 0;
5839 nonlocal_goto_stack_level
= 0;
5841 /* No labels have been declared for nonlocal use. */
5842 nonlocal_labels
= 0;
5843 nonlocal_goto_handler_labels
= 0;
5845 /* No function calls so far in this function. */
5846 function_call_count
= 0;
5848 /* No parm regs have been allocated.
5849 (This is important for output_inline_function.) */
5850 max_parm_reg
= LAST_VIRTUAL_REGISTER
+ 1;
5852 /* Initialize the RTL mechanism. */
5855 /* Initialize the queue of pending postincrement and postdecrements,
5856 and some other info in expr.c. */
5859 /* We haven't done register allocation yet. */
5862 init_varasm_status (cfun
);
5864 /* Clear out data used for inlining. */
5865 cfun
->inlinable
= 0;
5866 cfun
->original_decl_initial
= 0;
5867 cfun
->original_arg_vector
= 0;
5869 #ifdef STACK_BOUNDARY
5870 cfun
->stack_alignment_needed
= STACK_BOUNDARY
;
5871 cfun
->preferred_stack_boundary
= STACK_BOUNDARY
;
5873 cfun
->stack_alignment_needed
= 0;
5874 cfun
->preferred_stack_boundary
= 0;
5877 /* Set if a call to setjmp is seen. */
5878 current_function_calls_setjmp
= 0;
5880 /* Set if a call to longjmp is seen. */
5881 current_function_calls_longjmp
= 0;
5883 current_function_calls_alloca
= 0;
5884 current_function_contains_functions
= 0;
5885 current_function_is_leaf
= 0;
5886 current_function_nothrow
= 0;
5887 current_function_sp_is_unchanging
= 0;
5888 current_function_uses_only_leaf_regs
= 0;
5889 current_function_has_computed_jump
= 0;
5890 current_function_is_thunk
= 0;
5892 current_function_returns_pcc_struct
= 0;
5893 current_function_returns_struct
= 0;
5894 current_function_epilogue_delay_list
= 0;
5895 current_function_uses_const_pool
= 0;
5896 current_function_uses_pic_offset_table
= 0;
5897 current_function_cannot_inline
= 0;
5899 /* We have not yet needed to make a label to jump to for tail-recursion. */
5900 tail_recursion_label
= 0;
5902 /* We haven't had a need to make a save area for ap yet. */
5903 arg_pointer_save_area
= 0;
5905 /* No stack slots allocated yet. */
5908 /* No SAVE_EXPRs in this function yet. */
5911 /* No RTL_EXPRs in this function yet. */
5914 /* Set up to allocate temporaries. */
5917 /* Indicate that we need to distinguish between the return value of the
5918 present function and the return value of a function being called. */
5919 rtx_equal_function_value_matters
= 1;
5921 /* Indicate that we have not instantiated virtual registers yet. */
5922 virtuals_instantiated
= 0;
5924 /* Indicate that we want CONCATs now. */
5925 generating_concat_p
= 1;
5927 /* Indicate we have no need of a frame pointer yet. */
5928 frame_pointer_needed
= 0;
5930 /* By default assume not varargs or stdarg. */
5931 current_function_varargs
= 0;
5932 current_function_stdarg
= 0;
5934 /* We haven't made any trampolines for this function yet. */
5935 trampoline_list
= 0;
5937 init_pending_stack_adjust ();
5938 inhibit_defer_pop
= 0;
5940 current_function_outgoing_args_size
= 0;
5942 if (init_lang_status
)
5943 (*init_lang_status
) (cfun
);
5944 if (init_machine_status
)
5945 (*init_machine_status
) (cfun
);
5948 /* Initialize the rtl expansion mechanism so that we can do simple things
5949 like generate sequences. This is used to provide a context during global
5950 initialization of some passes. */
5952 init_dummy_function_start ()
5954 prepare_function_start ();
5957 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
5958 and initialize static variables for generating RTL for the statements
5962 init_function_start (subr
, filename
, line
)
5964 const char *filename
;
5967 prepare_function_start ();
5969 /* Remember this function for later. */
5970 cfun
->next_global
= all_functions
;
5971 all_functions
= cfun
;
5973 current_function_name
= (*decl_printable_name
) (subr
, 2);
5976 /* Nonzero if this is a nested function that uses a static chain. */
5978 current_function_needs_context
5979 = (decl_function_context (current_function_decl
) != 0
5980 && ! DECL_NO_STATIC_CHAIN (current_function_decl
));
5982 /* Within function body, compute a type's size as soon it is laid out. */
5983 immediate_size_expand
++;
5985 /* Prevent ever trying to delete the first instruction of a function.
5986 Also tell final how to output a linenum before the function prologue.
5987 Note linenums could be missing, e.g. when compiling a Java .class file. */
5989 emit_line_note (filename
, line
);
5991 /* Make sure first insn is a note even if we don't want linenums.
5992 This makes sure the first insn will never be deleted.
5993 Also, final expects a note to appear there. */
5994 emit_note (NULL_PTR
, NOTE_INSN_DELETED
);
5996 /* Set flags used by final.c. */
5997 if (aggregate_value_p (DECL_RESULT (subr
)))
5999 #ifdef PCC_STATIC_STRUCT_RETURN
6000 current_function_returns_pcc_struct
= 1;
6002 current_function_returns_struct
= 1;
6005 /* Warn if this value is an aggregate type,
6006 regardless of which calling convention we are using for it. */
6007 if (warn_aggregate_return
6008 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr
))))
6009 warning ("function returns an aggregate");
6011 current_function_returns_pointer
6012 = POINTER_TYPE_P (TREE_TYPE (DECL_RESULT (subr
)));
6015 /* Make sure all values used by the optimization passes have sane
6018 init_function_for_compilation ()
6022 /* No prologue/epilogue insns yet. */
6023 VARRAY_GROW (prologue
, 0);
6024 VARRAY_GROW (epilogue
, 0);
6025 VARRAY_GROW (sibcall_epilogue
, 0);
6028 /* Indicate that the current function uses extra args
6029 not explicitly mentioned in the argument list in any fashion. */
6034 current_function_varargs
= 1;
6037 /* Expand a call to __main at the beginning of a possible main function. */
6039 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
6040 #undef HAS_INIT_SECTION
6041 #define HAS_INIT_SECTION
6045 expand_main_function ()
6047 #if !defined (HAS_INIT_SECTION)
6048 emit_library_call (gen_rtx_SYMBOL_REF (Pmode
, NAME__MAIN
), 0,
6050 #endif /* not HAS_INIT_SECTION */
6053 extern struct obstack permanent_obstack
;
6055 /* Start the RTL for a new function, and set variables used for
6057 SUBR is the FUNCTION_DECL node.
6058 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
6059 the function's parameters, which must be run at any return statement. */
6062 expand_function_start (subr
, parms_have_cleanups
)
6064 int parms_have_cleanups
;
6067 rtx last_ptr
= NULL_RTX
;
6069 /* Make sure volatile mem refs aren't considered
6070 valid operands of arithmetic insns. */
6071 init_recog_no_volatile ();
6073 /* Set this before generating any memory accesses. */
6074 current_function_check_memory_usage
6075 = (flag_check_memory_usage
6076 && ! DECL_NO_CHECK_MEMORY_USAGE (current_function_decl
));
6078 current_function_instrument_entry_exit
6079 = (flag_instrument_function_entry_exit
6080 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr
));
6082 current_function_limit_stack
6083 = (stack_limit_rtx
!= NULL_RTX
&& ! DECL_NO_LIMIT_STACK (subr
));
6085 /* If function gets a static chain arg, store it in the stack frame.
6086 Do this first, so it gets the first stack slot offset. */
6087 if (current_function_needs_context
)
6089 last_ptr
= assign_stack_local (Pmode
, GET_MODE_SIZE (Pmode
), 0);
6091 /* Delay copying static chain if it is not a register to avoid
6092 conflicts with regs used for parameters. */
6093 if (! SMALL_REGISTER_CLASSES
6094 || GET_CODE (static_chain_incoming_rtx
) == REG
)
6095 emit_move_insn (last_ptr
, static_chain_incoming_rtx
);
6098 /* If the parameters of this function need cleaning up, get a label
6099 for the beginning of the code which executes those cleanups. This must
6100 be done before doing anything with return_label. */
6101 if (parms_have_cleanups
)
6102 cleanup_label
= gen_label_rtx ();
6106 /* Make the label for return statements to jump to, if this machine
6107 does not have a one-instruction return and uses an epilogue,
6108 or if it returns a structure, or if it has parm cleanups. */
6110 if (cleanup_label
== 0 && HAVE_return
6111 && ! current_function_instrument_entry_exit
6112 && ! current_function_returns_pcc_struct
6113 && ! (current_function_returns_struct
&& ! optimize
))
6116 return_label
= gen_label_rtx ();
6118 return_label
= gen_label_rtx ();
6121 /* Initialize rtx used to return the value. */
6122 /* Do this before assign_parms so that we copy the struct value address
6123 before any library calls that assign parms might generate. */
6125 /* Decide whether to return the value in memory or in a register. */
6126 if (aggregate_value_p (DECL_RESULT (subr
)))
6128 /* Returning something that won't go in a register. */
6129 register rtx value_address
= 0;
6131 #ifdef PCC_STATIC_STRUCT_RETURN
6132 if (current_function_returns_pcc_struct
)
6134 int size
= int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr
)));
6135 value_address
= assemble_static_space (size
);
6140 /* Expect to be passed the address of a place to store the value.
6141 If it is passed as an argument, assign_parms will take care of
6143 if (struct_value_incoming_rtx
)
6145 value_address
= gen_reg_rtx (Pmode
);
6146 emit_move_insn (value_address
, struct_value_incoming_rtx
);
6151 DECL_RTL (DECL_RESULT (subr
))
6152 = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr
)), value_address
);
6153 set_mem_attributes (DECL_RTL (DECL_RESULT (subr
)),
6154 DECL_RESULT (subr
), 1);
6157 else if (DECL_MODE (DECL_RESULT (subr
)) == VOIDmode
)
6158 /* If return mode is void, this decl rtl should not be used. */
6159 DECL_RTL (DECL_RESULT (subr
)) = 0;
6160 else if (parms_have_cleanups
|| current_function_instrument_entry_exit
)
6162 /* If function will end with cleanup code for parms,
6163 compute the return values into a pseudo reg,
6164 which we will copy into the true return register
6165 after the cleanups are done. */
6167 enum machine_mode mode
= DECL_MODE (DECL_RESULT (subr
));
6169 #ifdef PROMOTE_FUNCTION_RETURN
6170 tree type
= TREE_TYPE (DECL_RESULT (subr
));
6171 int unsignedp
= TREE_UNSIGNED (type
);
6173 mode
= promote_mode (type
, mode
, &unsignedp
, 1);
6176 DECL_RTL (DECL_RESULT (subr
)) = gen_reg_rtx (mode
);
6179 /* Scalar, returned in a register. */
6181 DECL_RTL (DECL_RESULT (subr
))
6182 = hard_function_value (TREE_TYPE (DECL_RESULT (subr
)), subr
, 1);
6184 /* Mark this reg as the function's return value. */
6185 if (GET_CODE (DECL_RTL (DECL_RESULT (subr
))) == REG
)
6187 REG_FUNCTION_VALUE_P (DECL_RTL (DECL_RESULT (subr
))) = 1;
6188 /* Needed because we may need to move this to memory
6189 in case it's a named return value whose address is taken. */
6190 DECL_REGISTER (DECL_RESULT (subr
)) = 1;
6194 /* Initialize rtx for parameters and local variables.
6195 In some cases this requires emitting insns. */
6197 assign_parms (subr
);
6199 /* Copy the static chain now if it wasn't a register. The delay is to
6200 avoid conflicts with the parameter passing registers. */
6202 if (SMALL_REGISTER_CLASSES
&& current_function_needs_context
)
6203 if (GET_CODE (static_chain_incoming_rtx
) != REG
)
6204 emit_move_insn (last_ptr
, static_chain_incoming_rtx
);
6206 /* The following was moved from init_function_start.
6207 The move is supposed to make sdb output more accurate. */
6208 /* Indicate the beginning of the function body,
6209 as opposed to parm setup. */
6210 emit_note (NULL_PTR
, NOTE_INSN_FUNCTION_BEG
);
6212 if (GET_CODE (get_last_insn ()) != NOTE
)
6213 emit_note (NULL_PTR
, NOTE_INSN_DELETED
);
6214 parm_birth_insn
= get_last_insn ();
6216 context_display
= 0;
6217 if (current_function_needs_context
)
6219 /* Fetch static chain values for containing functions. */
6220 tem
= decl_function_context (current_function_decl
);
6221 /* Copy the static chain pointer into a pseudo. If we have
6222 small register classes, copy the value from memory if
6223 static_chain_incoming_rtx is a REG. */
6226 /* If the static chain originally came in a register, put it back
6227 there, then move it out in the next insn. The reason for
6228 this peculiar code is to satisfy function integration. */
6229 if (SMALL_REGISTER_CLASSES
6230 && GET_CODE (static_chain_incoming_rtx
) == REG
)
6231 emit_move_insn (static_chain_incoming_rtx
, last_ptr
);
6232 last_ptr
= copy_to_reg (static_chain_incoming_rtx
);
6237 tree rtlexp
= make_node (RTL_EXPR
);
6239 RTL_EXPR_RTL (rtlexp
) = last_ptr
;
6240 context_display
= tree_cons (tem
, rtlexp
, context_display
);
6241 tem
= decl_function_context (tem
);
6244 /* Chain thru stack frames, assuming pointer to next lexical frame
6245 is found at the place we always store it. */
6246 #ifdef FRAME_GROWS_DOWNWARD
6247 last_ptr
= plus_constant (last_ptr
, -GET_MODE_SIZE (Pmode
));
6249 last_ptr
= gen_rtx_MEM (Pmode
, memory_address (Pmode
, last_ptr
));
6250 MEM_ALIAS_SET (last_ptr
) = get_frame_alias_set ();
6251 last_ptr
= copy_to_reg (last_ptr
);
6253 /* If we are not optimizing, ensure that we know that this
6254 piece of context is live over the entire function. */
6256 save_expr_regs
= gen_rtx_EXPR_LIST (VOIDmode
, last_ptr
,
6261 if (current_function_instrument_entry_exit
)
6263 rtx fun
= DECL_RTL (current_function_decl
);
6264 if (GET_CODE (fun
) == MEM
)
6265 fun
= XEXP (fun
, 0);
6268 emit_library_call (profile_function_entry_libfunc
, 0, VOIDmode
, 2,
6270 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS
,
6272 hard_frame_pointer_rtx
),
6276 /* After the display initializations is where the tail-recursion label
6277 should go, if we end up needing one. Ensure we have a NOTE here
6278 since some things (like trampolines) get placed before this. */
6279 tail_recursion_reentry
= emit_note (NULL_PTR
, NOTE_INSN_DELETED
);
6281 /* Evaluate now the sizes of any types declared among the arguments. */
6282 for (tem
= nreverse (get_pending_sizes ()); tem
; tem
= TREE_CHAIN (tem
))
6284 expand_expr (TREE_VALUE (tem
), const0_rtx
, VOIDmode
,
6285 EXPAND_MEMORY_USE_BAD
);
6286 /* Flush the queue in case this parameter declaration has
6291 /* Make sure there is a line number after the function entry setup code. */
6292 force_next_line_note ();
6295 /* Undo the effects of init_dummy_function_start. */
6297 expand_dummy_function_end ()
6299 /* End any sequences that failed to be closed due to syntax errors. */
6300 while (in_sequence_p ())
6303 /* Outside function body, can't compute type's actual size
6304 until next function's body starts. */
6306 free_after_parsing (cfun
);
6307 free_after_compilation (cfun
);
6312 /* Call DOIT for each hard register used as a return value from
6313 the current function. */
6316 diddle_return_value (doit
, arg
)
6317 void (*doit
) PARAMS ((rtx
, void *));
6320 rtx outgoing
= current_function_return_rtx
;
6326 pcc
= (current_function_returns_struct
6327 || current_function_returns_pcc_struct
);
6329 if ((GET_CODE (outgoing
) == REG
6330 && REGNO (outgoing
) >= FIRST_PSEUDO_REGISTER
)
6333 tree type
= TREE_TYPE (DECL_RESULT (current_function_decl
));
6335 /* A PCC-style return returns a pointer to the memory in which
6336 the structure is stored. */
6338 type
= build_pointer_type (type
);
6340 #ifdef FUNCTION_OUTGOING_VALUE
6341 outgoing
= FUNCTION_OUTGOING_VALUE (type
, current_function_decl
);
6343 outgoing
= FUNCTION_VALUE (type
, current_function_decl
);
6345 /* If this is a BLKmode structure being returned in registers, then use
6346 the mode computed in expand_return. */
6347 if (GET_MODE (outgoing
) == BLKmode
)
6349 GET_MODE (DECL_RTL (DECL_RESULT (current_function_decl
))));
6350 REG_FUNCTION_VALUE_P (outgoing
) = 1;
6353 if (GET_CODE (outgoing
) == REG
)
6354 (*doit
) (outgoing
, arg
);
6355 else if (GET_CODE (outgoing
) == PARALLEL
)
6359 for (i
= 0; i
< XVECLEN (outgoing
, 0); i
++)
6361 rtx x
= XEXP (XVECEXP (outgoing
, 0, i
), 0);
6363 if (GET_CODE (x
) == REG
&& REGNO (x
) < FIRST_PSEUDO_REGISTER
)
6370 do_clobber_return_reg (reg
, arg
)
6372 void *arg ATTRIBUTE_UNUSED
;
6374 emit_insn (gen_rtx_CLOBBER (VOIDmode
, reg
));
6378 clobber_return_register ()
6380 diddle_return_value (do_clobber_return_reg
, NULL
);
6384 do_use_return_reg (reg
, arg
)
6386 void *arg ATTRIBUTE_UNUSED
;
6388 emit_insn (gen_rtx_USE (VOIDmode
, reg
));
6392 use_return_register ()
6394 diddle_return_value (do_use_return_reg
, NULL
);
6397 /* Generate RTL for the end of the current function.
6398 FILENAME and LINE are the current position in the source file.
6400 It is up to language-specific callers to do cleanups for parameters--
6401 or else, supply 1 for END_BINDINGS and we will call expand_end_bindings. */
6404 expand_function_end (filename
, line
, end_bindings
)
6405 const char *filename
;
6411 #ifdef TRAMPOLINE_TEMPLATE
6412 static rtx initial_trampoline
;
6415 finish_expr_for_function ();
6417 #ifdef NON_SAVING_SETJMP
6418 /* Don't put any variables in registers if we call setjmp
6419 on a machine that fails to restore the registers. */
6420 if (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
6422 if (DECL_INITIAL (current_function_decl
) != error_mark_node
)
6423 setjmp_protect (DECL_INITIAL (current_function_decl
));
6425 setjmp_protect_args ();
6429 /* Save the argument pointer if a save area was made for it. */
6430 if (arg_pointer_save_area
)
6432 /* arg_pointer_save_area may not be a valid memory address, so we
6433 have to check it and fix it if necessary. */
6436 emit_move_insn (validize_mem (arg_pointer_save_area
),
6437 virtual_incoming_args_rtx
);
6438 seq
= gen_sequence ();
6440 emit_insn_before (seq
, tail_recursion_reentry
);
6443 /* Initialize any trampolines required by this function. */
6444 for (link
= trampoline_list
; link
; link
= TREE_CHAIN (link
))
6446 tree function
= TREE_PURPOSE (link
);
6447 rtx context ATTRIBUTE_UNUSED
= lookup_static_chain (function
);
6448 rtx tramp
= RTL_EXPR_RTL (TREE_VALUE (link
));
6449 #ifdef TRAMPOLINE_TEMPLATE
6454 #ifdef TRAMPOLINE_TEMPLATE
6455 /* First make sure this compilation has a template for
6456 initializing trampolines. */
6457 if (initial_trampoline
== 0)
6459 end_temporary_allocation ();
6461 = gen_rtx_MEM (BLKmode
, assemble_trampoline_template ());
6462 resume_temporary_allocation ();
6464 ggc_add_rtx_root (&initial_trampoline
, 1);
6468 /* Generate insns to initialize the trampoline. */
6470 tramp
= round_trampoline_addr (XEXP (tramp
, 0));
6471 #ifdef TRAMPOLINE_TEMPLATE
6472 blktramp
= change_address (initial_trampoline
, BLKmode
, tramp
);
6473 emit_block_move (blktramp
, initial_trampoline
,
6474 GEN_INT (TRAMPOLINE_SIZE
),
6475 TRAMPOLINE_ALIGNMENT
);
6477 INITIALIZE_TRAMPOLINE (tramp
, XEXP (DECL_RTL (function
), 0), context
);
6481 /* Put those insns at entry to the containing function (this one). */
6482 emit_insns_before (seq
, tail_recursion_reentry
);
6485 /* If we are doing stack checking and this function makes calls,
6486 do a stack probe at the start of the function to ensure we have enough
6487 space for another stack frame. */
6488 if (flag_stack_check
&& ! STACK_CHECK_BUILTIN
)
6492 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
6493 if (GET_CODE (insn
) == CALL_INSN
)
6496 probe_stack_range (STACK_CHECK_PROTECT
,
6497 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE
));
6500 emit_insns_before (seq
, tail_recursion_reentry
);
6505 /* Warn about unused parms if extra warnings were specified. */
6506 /* Either ``-W -Wunused'' or ``-Wunused-parameter'' enables this
6507 warning. WARN_UNUSED_PARAMETER is negative when set by
6509 if (warn_unused_parameter
> 0
6510 || (warn_unused_parameter
< 0 && extra_warnings
))
6514 for (decl
= DECL_ARGUMENTS (current_function_decl
);
6515 decl
; decl
= TREE_CHAIN (decl
))
6516 if (! TREE_USED (decl
) && TREE_CODE (decl
) == PARM_DECL
6517 && DECL_NAME (decl
) && ! DECL_ARTIFICIAL (decl
))
6518 warning_with_decl (decl
, "unused parameter `%s'");
6521 /* Delete handlers for nonlocal gotos if nothing uses them. */
6522 if (nonlocal_goto_handler_slots
!= 0
6523 && ! current_function_has_nonlocal_label
)
6526 /* End any sequences that failed to be closed due to syntax errors. */
6527 while (in_sequence_p ())
6530 /* Outside function body, can't compute type's actual size
6531 until next function's body starts. */
6532 immediate_size_expand
--;
6534 clear_pending_stack_adjust ();
6535 do_pending_stack_adjust ();
6537 /* Mark the end of the function body.
6538 If control reaches this insn, the function can drop through
6539 without returning a value. */
6540 emit_note (NULL_PTR
, NOTE_INSN_FUNCTION_END
);
6542 /* Must mark the last line number note in the function, so that the test
6543 coverage code can avoid counting the last line twice. This just tells
6544 the code to ignore the immediately following line note, since there
6545 already exists a copy of this note somewhere above. This line number
6546 note is still needed for debugging though, so we can't delete it. */
6547 if (flag_test_coverage
)
6548 emit_note (NULL_PTR
, NOTE_INSN_REPEATED_LINE_NUMBER
);
6550 /* Output a linenumber for the end of the function.
6551 SDB depends on this. */
6552 emit_line_note_force (filename
, line
);
6554 /* Output the label for the actual return from the function,
6555 if one is expected. This happens either because a function epilogue
6556 is used instead of a return instruction, or because a return was done
6557 with a goto in order to run local cleanups, or because of pcc-style
6558 structure returning. */
6562 /* Before the return label, clobber the return registers so that
6563 they are not propogated live to the rest of the function. This
6564 can only happen with functions that drop through; if there had
6565 been a return statement, there would have either been a return
6566 rtx, or a jump to the return label. */
6567 clobber_return_register ();
6569 emit_label (return_label
);
6572 /* C++ uses this. */
6574 expand_end_bindings (0, 0, 0);
6576 /* Now handle any leftover exception regions that may have been
6577 created for the parameters. */
6579 rtx last
= get_last_insn ();
6582 expand_leftover_cleanups ();
6584 /* If there are any catch_clauses remaining, output them now. */
6585 emit_insns (catch_clauses
);
6586 catch_clauses
= catch_clauses_last
= NULL_RTX
;
6587 /* If the above emitted any code, may sure we jump around it. */
6588 if (last
!= get_last_insn ())
6590 label
= gen_label_rtx ();
6591 last
= emit_jump_insn_after (gen_jump (label
), last
);
6592 last
= emit_barrier_after (last
);
6597 if (current_function_instrument_entry_exit
)
6599 rtx fun
= DECL_RTL (current_function_decl
);
6600 if (GET_CODE (fun
) == MEM
)
6601 fun
= XEXP (fun
, 0);
6604 emit_library_call (profile_function_exit_libfunc
, 0, VOIDmode
, 2,
6606 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS
,
6608 hard_frame_pointer_rtx
),
6612 /* If we had calls to alloca, and this machine needs
6613 an accurate stack pointer to exit the function,
6614 insert some code to save and restore the stack pointer. */
6615 #ifdef EXIT_IGNORE_STACK
6616 if (! EXIT_IGNORE_STACK
)
6618 if (current_function_calls_alloca
)
6622 emit_stack_save (SAVE_FUNCTION
, &tem
, parm_birth_insn
);
6623 emit_stack_restore (SAVE_FUNCTION
, tem
, NULL_RTX
);
6626 /* If scalar return value was computed in a pseudo-reg,
6627 copy that to the hard return register. */
6628 if (DECL_RTL (DECL_RESULT (current_function_decl
)) != 0
6629 && GET_CODE (DECL_RTL (DECL_RESULT (current_function_decl
))) == REG
6630 && (REGNO (DECL_RTL (DECL_RESULT (current_function_decl
)))
6631 >= FIRST_PSEUDO_REGISTER
))
6633 rtx real_decl_result
;
6635 #ifdef FUNCTION_OUTGOING_VALUE
6637 = FUNCTION_OUTGOING_VALUE (TREE_TYPE (DECL_RESULT (current_function_decl
)),
6638 current_function_decl
);
6641 = FUNCTION_VALUE (TREE_TYPE (DECL_RESULT (current_function_decl
)),
6642 current_function_decl
);
6644 REG_FUNCTION_VALUE_P (real_decl_result
) = 1;
6645 /* If this is a BLKmode structure being returned in registers, then use
6646 the mode computed in expand_return. */
6647 if (GET_MODE (real_decl_result
) == BLKmode
)
6648 PUT_MODE (real_decl_result
,
6649 GET_MODE (DECL_RTL (DECL_RESULT (current_function_decl
))));
6650 emit_move_insn (real_decl_result
,
6651 DECL_RTL (DECL_RESULT (current_function_decl
)));
6653 /* The delay slot scheduler assumes that current_function_return_rtx
6654 holds the hard register containing the return value, not a temporary
6656 current_function_return_rtx
= real_decl_result
;
6659 /* If returning a structure, arrange to return the address of the value
6660 in a place where debuggers expect to find it.
6662 If returning a structure PCC style,
6663 the caller also depends on this value.
6664 And current_function_returns_pcc_struct is not necessarily set. */
6665 if (current_function_returns_struct
6666 || current_function_returns_pcc_struct
)
6669 XEXP (DECL_RTL (DECL_RESULT (current_function_decl
)), 0);
6670 tree type
= TREE_TYPE (DECL_RESULT (current_function_decl
));
6671 #ifdef FUNCTION_OUTGOING_VALUE
6673 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type
),
6674 current_function_decl
);
6677 = FUNCTION_VALUE (build_pointer_type (type
),
6678 current_function_decl
);
6681 /* Mark this as a function return value so integrate will delete the
6682 assignment and USE below when inlining this function. */
6683 REG_FUNCTION_VALUE_P (outgoing
) = 1;
6685 emit_move_insn (outgoing
, value_address
);
6688 /* ??? This should no longer be necessary since stupid is no longer with
6689 us, but there are some parts of the compiler (eg reload_combine, and
6690 sh mach_dep_reorg) that still try and compute their own lifetime info
6691 instead of using the general framework. */
6692 use_return_register ();
6694 /* If this is an implementation of __throw, do what's necessary to
6695 communicate between __builtin_eh_return and the epilogue. */
6696 expand_eh_return ();
6698 /* Output a return insn if we are using one.
6699 Otherwise, let the rtl chain end here, to drop through
6700 into the epilogue. */
6705 emit_jump_insn (gen_return ());
6710 /* Fix up any gotos that jumped out to the outermost
6711 binding level of the function.
6712 Must follow emitting RETURN_LABEL. */
6714 /* If you have any cleanups to do at this point,
6715 and they need to create temporary variables,
6716 then you will lose. */
6717 expand_fixups (get_insns ());
6720 /* Extend a vector that records the INSN_UIDs of INSNS (either a
6721 sequence or a single insn). */
6724 record_insns (insns
, vecp
)
6728 if (GET_CODE (insns
) == SEQUENCE
)
6730 int len
= XVECLEN (insns
, 0);
6731 int i
= VARRAY_SIZE (*vecp
);
6733 VARRAY_GROW (*vecp
, i
+ len
);
6736 VARRAY_INT (*vecp
, i
) = INSN_UID (XVECEXP (insns
, 0, len
));
6742 int i
= VARRAY_SIZE (*vecp
);
6743 VARRAY_GROW (*vecp
, i
+ 1);
6744 VARRAY_INT (*vecp
, i
) = INSN_UID (insns
);
6748 /* Determine how many INSN_UIDs in VEC are part of INSN. */
6751 contains (insn
, vec
)
6757 if (GET_CODE (insn
) == INSN
6758 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
6761 for (i
= XVECLEN (PATTERN (insn
), 0) - 1; i
>= 0; i
--)
6762 for (j
= VARRAY_SIZE (vec
) - 1; j
>= 0; --j
)
6763 if (INSN_UID (XVECEXP (PATTERN (insn
), 0, i
)) == VARRAY_INT (vec
, j
))
6769 for (j
= VARRAY_SIZE (vec
) - 1; j
>= 0; --j
)
6770 if (INSN_UID (insn
) == VARRAY_INT (vec
, j
))
6777 prologue_epilogue_contains (insn
)
6780 if (contains (insn
, prologue
))
6782 if (contains (insn
, epilogue
))
6788 sibcall_epilogue_contains (insn
)
6791 if (sibcall_epilogue
)
6792 return contains (insn
, sibcall_epilogue
);
6797 /* Insert gen_return at the end of block BB. This also means updating
6798 block_for_insn appropriately. */
6801 emit_return_into_block (bb
, line_note
)
6807 p
= NEXT_INSN (bb
->end
);
6808 end
= emit_jump_insn_after (gen_return (), bb
->end
);
6810 emit_line_note_after (NOTE_SOURCE_FILE (line_note
),
6811 NOTE_LINE_NUMBER (line_note
), bb
->end
);
6815 set_block_for_insn (p
, bb
);
6822 #endif /* HAVE_return */
6824 #ifdef HAVE_epilogue
6826 /* Modify SEQ, a SEQUENCE that is part of the epilogue, to no modifications
6827 to the stack pointer. */
6830 keep_stack_depressed (seq
)
6834 rtx sp_from_reg
= 0;
6835 int sp_modified_unknown
= 0;
6837 /* If the epilogue is just a single instruction, it's OK as is */
6839 if (GET_CODE (seq
) != SEQUENCE
) return;
6841 /* Scan all insns in SEQ looking for ones that modified the stack
6842 pointer. Record if it modified the stack pointer by copying it
6843 from the frame pointer or if it modified it in some other way.
6844 Then modify any subsequent stack pointer references to take that
6845 into account. We start by only allowing SP to be copied from a
6846 register (presumably FP) and then be subsequently referenced. */
6848 for (i
= 0; i
< XVECLEN (seq
, 0); i
++)
6850 rtx insn
= XVECEXP (seq
, 0, i
);
6852 if (GET_RTX_CLASS (GET_CODE (insn
)) != 'i')
6855 if (reg_set_p (stack_pointer_rtx
, insn
))
6857 rtx set
= single_set (insn
);
6859 /* If SP is set as a side-effect, we can't support this. */
6863 if (GET_CODE (SET_SRC (set
)) == REG
)
6864 sp_from_reg
= SET_SRC (set
);
6866 sp_modified_unknown
= 1;
6868 /* Don't allow the SP modification to happen. */
6869 PUT_CODE (insn
, NOTE
);
6870 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
6871 NOTE_SOURCE_FILE (insn
) = 0;
6873 else if (reg_referenced_p (stack_pointer_rtx
, PATTERN (insn
)))
6875 if (sp_modified_unknown
)
6878 else if (sp_from_reg
!= 0)
6880 = replace_rtx (PATTERN (insn
), stack_pointer_rtx
, sp_from_reg
);
6886 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
6887 this into place with notes indicating where the prologue ends and where
6888 the epilogue begins. Update the basic block information when possible. */
6891 thread_prologue_and_epilogue_insns (f
)
6892 rtx f ATTRIBUTE_UNUSED
;
6897 #ifdef HAVE_prologue
6898 rtx prologue_end
= NULL_RTX
;
6900 #if defined (HAVE_epilogue) || defined(HAVE_return)
6901 rtx epilogue_end
= NULL_RTX
;
6904 #ifdef HAVE_prologue
6908 seq
= gen_prologue ();
6911 /* Retain a map of the prologue insns. */
6912 if (GET_CODE (seq
) != SEQUENCE
)
6914 record_insns (seq
, &prologue
);
6915 prologue_end
= emit_note (NULL
, NOTE_INSN_PROLOGUE_END
);
6917 seq
= gen_sequence ();
6920 /* If optimization is off, and perhaps in an empty function,
6921 the entry block will have no successors. */
6922 if (ENTRY_BLOCK_PTR
->succ
)
6924 /* Can't deal with multiple successsors of the entry block. */
6925 if (ENTRY_BLOCK_PTR
->succ
->succ_next
)
6928 insert_insn_on_edge (seq
, ENTRY_BLOCK_PTR
->succ
);
6932 emit_insn_after (seq
, f
);
6936 /* If the exit block has no non-fake predecessors, we don't need
6938 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
6939 if ((e
->flags
& EDGE_FAKE
) == 0)
6945 if (optimize
&& HAVE_return
)
6947 /* If we're allowed to generate a simple return instruction,
6948 then by definition we don't need a full epilogue. Examine
6949 the block that falls through to EXIT. If it does not
6950 contain any code, examine its predecessors and try to
6951 emit (conditional) return instructions. */
6957 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
6958 if (e
->flags
& EDGE_FALLTHRU
)
6964 /* Verify that there are no active instructions in the last block. */
6966 while (label
&& GET_CODE (label
) != CODE_LABEL
)
6968 if (active_insn_p (label
))
6970 label
= PREV_INSN (label
);
6973 if (last
->head
== label
&& GET_CODE (label
) == CODE_LABEL
)
6975 rtx epilogue_line_note
= NULL_RTX
;
6977 /* Locate the line number associated with the closing brace,
6978 if we can find one. */
6979 for (seq
= get_last_insn ();
6980 seq
&& ! active_insn_p (seq
);
6981 seq
= PREV_INSN (seq
))
6982 if (GET_CODE (seq
) == NOTE
&& NOTE_LINE_NUMBER (seq
) > 0)
6984 epilogue_line_note
= seq
;
6988 for (e
= last
->pred
; e
; e
= e_next
)
6990 basic_block bb
= e
->src
;
6993 e_next
= e
->pred_next
;
6994 if (bb
== ENTRY_BLOCK_PTR
)
6998 if ((GET_CODE (jump
) != JUMP_INSN
) || JUMP_LABEL (jump
) != label
)
7001 /* If we have an unconditional jump, we can replace that
7002 with a simple return instruction. */
7003 if (simplejump_p (jump
))
7005 emit_return_into_block (bb
, epilogue_line_note
);
7006 flow_delete_insn (jump
);
7009 /* If we have a conditional jump, we can try to replace
7010 that with a conditional return instruction. */
7011 else if (condjump_p (jump
))
7015 ret
= SET_SRC (PATTERN (jump
));
7016 if (GET_CODE (XEXP (ret
, 1)) == LABEL_REF
)
7017 loc
= &XEXP (ret
, 1);
7019 loc
= &XEXP (ret
, 2);
7020 ret
= gen_rtx_RETURN (VOIDmode
);
7022 if (! validate_change (jump
, loc
, ret
, 0))
7024 if (JUMP_LABEL (jump
))
7025 LABEL_NUSES (JUMP_LABEL (jump
))--;
7027 /* If this block has only one successor, it both jumps
7028 and falls through to the fallthru block, so we can't
7030 if (bb
->succ
->succ_next
== NULL
)
7036 /* Fix up the CFG for the successful change we just made. */
7037 redirect_edge_succ (e
, EXIT_BLOCK_PTR
);
7040 /* Emit a return insn for the exit fallthru block. Whether
7041 this is still reachable will be determined later. */
7043 emit_barrier_after (last
->end
);
7044 emit_return_into_block (last
, epilogue_line_note
);
7045 epilogue_end
= last
->end
;
7050 #ifdef HAVE_epilogue
7053 /* Find the edge that falls through to EXIT. Other edges may exist
7054 due to RETURN instructions, but those don't need epilogues.
7055 There really shouldn't be a mixture -- either all should have
7056 been converted or none, however... */
7058 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
7059 if (e
->flags
& EDGE_FALLTHRU
)
7065 epilogue_end
= emit_note (NULL
, NOTE_INSN_EPILOGUE_BEG
);
7067 seq
= gen_epilogue ();
7069 /* If this function returns with the stack depressed, massage
7070 the epilogue to actually do that. */
7071 if (TREE_CODE (TREE_TYPE (current_function_decl
)) == FUNCTION_TYPE
7072 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl
)))
7073 keep_stack_depressed (seq
);
7075 emit_jump_insn (seq
);
7077 /* Retain a map of the epilogue insns. */
7078 if (GET_CODE (seq
) != SEQUENCE
)
7080 record_insns (seq
, &epilogue
);
7082 seq
= gen_sequence ();
7085 insert_insn_on_edge (seq
, e
);
7092 commit_edge_insertions ();
7094 #ifdef HAVE_sibcall_epilogue
7095 /* Emit sibling epilogues before any sibling call sites. */
7096 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
7098 basic_block bb
= e
->src
;
7103 if (GET_CODE (insn
) != CALL_INSN
7104 || ! SIBLING_CALL_P (insn
))
7108 seq
= gen_sibcall_epilogue ();
7111 i
= PREV_INSN (insn
);
7112 newinsn
= emit_insn_before (seq
, insn
);
7114 /* Update the UID to basic block map. */
7115 for (i
= NEXT_INSN (i
); i
!= insn
; i
= NEXT_INSN (i
))
7116 set_block_for_insn (i
, bb
);
7118 /* Retain a map of the epilogue insns. Used in life analysis to
7119 avoid getting rid of sibcall epilogue insns. */
7120 record_insns (GET_CODE (seq
) == SEQUENCE
7121 ? seq
: newinsn
, &sibcall_epilogue
);
7125 #ifdef HAVE_prologue
7130 /* GDB handles `break f' by setting a breakpoint on the first
7131 line note after the prologue. Which means (1) that if
7132 there are line number notes before where we inserted the
7133 prologue we should move them, and (2) we should generate a
7134 note before the end of the first basic block, if there isn't
7135 one already there. */
7137 for (insn
= prologue_end
; insn
; insn
= prev
)
7139 prev
= PREV_INSN (insn
);
7140 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7142 /* Note that we cannot reorder the first insn in the
7143 chain, since rest_of_compilation relies on that
7144 remaining constant. */
7147 reorder_insns (insn
, insn
, prologue_end
);
7151 /* Find the last line number note in the first block. */
7152 for (insn
= BASIC_BLOCK (0)->end
;
7153 insn
!= prologue_end
;
7154 insn
= PREV_INSN (insn
))
7155 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7158 /* If we didn't find one, make a copy of the first line number
7162 for (insn
= next_active_insn (prologue_end
);
7164 insn
= PREV_INSN (insn
))
7165 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7167 emit_line_note_after (NOTE_SOURCE_FILE (insn
),
7168 NOTE_LINE_NUMBER (insn
),
7175 #ifdef HAVE_epilogue
7180 /* Similarly, move any line notes that appear after the epilogue.
7181 There is no need, however, to be quite so anal about the existance
7183 for (insn
= epilogue_end
; insn
; insn
= next
)
7185 next
= NEXT_INSN (insn
);
7186 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7187 reorder_insns (insn
, insn
, PREV_INSN (epilogue_end
));
7193 /* Reposition the prologue-end and epilogue-begin notes after instruction
7194 scheduling and delayed branch scheduling. */
7197 reposition_prologue_and_epilogue_notes (f
)
7198 rtx f ATTRIBUTE_UNUSED
;
7200 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
7203 if ((len
= VARRAY_SIZE (prologue
)) > 0)
7205 register rtx insn
, note
= 0;
7207 /* Scan from the beginning until we reach the last prologue insn.
7208 We apparently can't depend on basic_block_{head,end} after
7210 for (insn
= f
; len
&& insn
; insn
= NEXT_INSN (insn
))
7212 if (GET_CODE (insn
) == NOTE
)
7214 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
7217 else if ((len
-= contains (insn
, prologue
)) == 0)
7220 /* Find the prologue-end note if we haven't already, and
7221 move it to just after the last prologue insn. */
7224 for (note
= insn
; (note
= NEXT_INSN (note
));)
7225 if (GET_CODE (note
) == NOTE
7226 && NOTE_LINE_NUMBER (note
) == NOTE_INSN_PROLOGUE_END
)
7230 next
= NEXT_INSN (note
);
7232 /* Whether or not we can depend on BLOCK_HEAD,
7233 attempt to keep it up-to-date. */
7234 if (BLOCK_HEAD (0) == note
)
7235 BLOCK_HEAD (0) = next
;
7238 add_insn_after (note
, insn
);
7243 if ((len
= VARRAY_SIZE (epilogue
)) > 0)
7245 register rtx insn
, note
= 0;
7247 /* Scan from the end until we reach the first epilogue insn.
7248 We apparently can't depend on basic_block_{head,end} after
7250 for (insn
= get_last_insn (); len
&& insn
; insn
= PREV_INSN (insn
))
7252 if (GET_CODE (insn
) == NOTE
)
7254 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EPILOGUE_BEG
)
7257 else if ((len
-= contains (insn
, epilogue
)) == 0)
7259 /* Find the epilogue-begin note if we haven't already, and
7260 move it to just before the first epilogue insn. */
7263 for (note
= insn
; (note
= PREV_INSN (note
));)
7264 if (GET_CODE (note
) == NOTE
7265 && NOTE_LINE_NUMBER (note
) == NOTE_INSN_EPILOGUE_BEG
)
7269 /* Whether or not we can depend on BLOCK_HEAD,
7270 attempt to keep it up-to-date. */
7272 && BLOCK_HEAD (n_basic_blocks
-1) == insn
)
7273 BLOCK_HEAD (n_basic_blocks
-1) = note
;
7276 add_insn_before (note
, insn
);
7280 #endif /* HAVE_prologue or HAVE_epilogue */
7283 /* Mark T for GC. */
7287 struct temp_slot
*t
;
7291 ggc_mark_rtx (t
->slot
);
7292 ggc_mark_rtx (t
->address
);
7293 ggc_mark_tree (t
->rtl_expr
);
7299 /* Mark P for GC. */
7302 mark_function_status (p
)
7311 ggc_mark_rtx (p
->arg_offset_rtx
);
7313 if (p
->x_parm_reg_stack_loc
)
7314 for (i
= p
->x_max_parm_reg
, r
= p
->x_parm_reg_stack_loc
;
7318 ggc_mark_rtx (p
->return_rtx
);
7319 ggc_mark_rtx (p
->x_cleanup_label
);
7320 ggc_mark_rtx (p
->x_return_label
);
7321 ggc_mark_rtx (p
->x_save_expr_regs
);
7322 ggc_mark_rtx (p
->x_stack_slot_list
);
7323 ggc_mark_rtx (p
->x_parm_birth_insn
);
7324 ggc_mark_rtx (p
->x_tail_recursion_label
);
7325 ggc_mark_rtx (p
->x_tail_recursion_reentry
);
7326 ggc_mark_rtx (p
->internal_arg_pointer
);
7327 ggc_mark_rtx (p
->x_arg_pointer_save_area
);
7328 ggc_mark_tree (p
->x_rtl_expr_chain
);
7329 ggc_mark_rtx (p
->x_last_parm_insn
);
7330 ggc_mark_tree (p
->x_context_display
);
7331 ggc_mark_tree (p
->x_trampoline_list
);
7332 ggc_mark_rtx (p
->epilogue_delay_list
);
7334 mark_temp_slot (p
->x_temp_slots
);
7337 struct var_refs_queue
*q
= p
->fixup_var_refs_queue
;
7340 ggc_mark_rtx (q
->modified
);
7345 ggc_mark_rtx (p
->x_nonlocal_goto_handler_slots
);
7346 ggc_mark_rtx (p
->x_nonlocal_goto_handler_labels
);
7347 ggc_mark_rtx (p
->x_nonlocal_goto_stack_level
);
7348 ggc_mark_tree (p
->x_nonlocal_labels
);
7351 /* Mark the function chain ARG (which is really a struct function **)
7355 mark_function_chain (arg
)
7358 struct function
*f
= *(struct function
**) arg
;
7360 for (; f
; f
= f
->next_global
)
7362 ggc_mark_tree (f
->decl
);
7364 mark_function_status (f
);
7365 mark_eh_status (f
->eh
);
7366 mark_stmt_status (f
->stmt
);
7367 mark_expr_status (f
->expr
);
7368 mark_emit_status (f
->emit
);
7369 mark_varasm_status (f
->varasm
);
7371 if (mark_machine_status
)
7372 (*mark_machine_status
) (f
);
7373 if (mark_lang_status
)
7374 (*mark_lang_status
) (f
);
7376 if (f
->original_arg_vector
)
7377 ggc_mark_rtvec ((rtvec
) f
->original_arg_vector
);
7378 if (f
->original_decl_initial
)
7379 ggc_mark_tree (f
->original_decl_initial
);
7383 /* Called once, at initialization, to initialize function.c. */
7386 init_function_once ()
7388 ggc_add_root (&all_functions
, 1, sizeof all_functions
,
7389 mark_function_chain
);
7391 VARRAY_INT_INIT (prologue
, 0, "prologue");
7392 VARRAY_INT_INIT (epilogue
, 0, "epilogue");
7393 VARRAY_INT_INIT (sibcall_epilogue
, 0, "sibcall_epilogue");