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, 2001 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
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. */
51 #include "hard-reg-set.h"
52 #include "insn-config.h"
55 #include "basic-block.h"
61 #include "integrate.h"
63 #ifndef TRAMPOLINE_ALIGNMENT
64 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
67 #ifndef LOCAL_ALIGNMENT
68 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
71 /* Some systems use __main in a way incompatible with its use in gcc, in these
72 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
73 give the same symbol without quotes for an alternative entry point. You
74 must define both, or neither. */
76 #define NAME__MAIN "__main"
77 #define SYMBOL__MAIN __main
80 /* Round a value to the lowest integer less than it that is a multiple of
81 the required alignment. Avoid using division in case the value is
82 negative. Assume the alignment is a power of two. */
83 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
85 /* Similar, but round to the next highest integer that meets the
87 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
89 /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
90 during rtl generation. If they are different register numbers, this is
91 always true. It may also be true if
92 FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
93 generation. See fix_lexical_addr for details. */
95 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
96 #define NEED_SEPARATE_AP
99 /* Nonzero if function being compiled doesn't contain any calls
100 (ignoring the prologue and epilogue). This is set prior to
101 local register allocation and is valid for the remaining
103 int current_function_is_leaf
;
105 /* Nonzero if function being compiled doesn't contain any instructions
106 that can throw an exception. This is set prior to final. */
108 int current_function_nothrow
;
110 /* Nonzero if function being compiled doesn't modify the stack pointer
111 (ignoring the prologue and epilogue). This is only valid after
112 life_analysis has run. */
113 int current_function_sp_is_unchanging
;
115 /* Nonzero if the function being compiled is a leaf function which only
116 uses leaf registers. This is valid after reload (specifically after
117 sched2) and is useful only if the port defines LEAF_REGISTERS. */
118 int current_function_uses_only_leaf_regs
;
120 /* Nonzero once virtual register instantiation has been done.
121 assign_stack_local uses frame_pointer_rtx when this is nonzero.
122 calls.c:emit_library_call_value_1 uses it to set up
123 post-instantiation libcalls. */
124 int virtuals_instantiated
;
126 /* These variables hold pointers to functions to create and destroy
127 target specific, per-function data structures. */
128 void (*init_machine_status
) PARAMS ((struct function
*));
129 void (*free_machine_status
) PARAMS ((struct function
*));
130 /* This variable holds a pointer to a function to register any
131 data items in the target specific, per-function data structure
132 that will need garbage collection. */
133 void (*mark_machine_status
) PARAMS ((struct function
*));
135 /* Likewise, but for language-specific data. */
136 void (*init_lang_status
) PARAMS ((struct function
*));
137 void (*save_lang_status
) PARAMS ((struct function
*));
138 void (*restore_lang_status
) PARAMS ((struct function
*));
139 void (*mark_lang_status
) PARAMS ((struct function
*));
140 void (*free_lang_status
) PARAMS ((struct function
*));
142 /* The FUNCTION_DECL for an inline function currently being expanded. */
143 tree inline_function_decl
;
145 /* The currently compiled function. */
146 struct function
*cfun
= 0;
148 /* Global list of all compiled functions. */
149 struct function
*all_functions
= 0;
151 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
152 static varray_type prologue
;
153 static varray_type epilogue
;
155 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
157 static varray_type sibcall_epilogue
;
159 /* In order to evaluate some expressions, such as function calls returning
160 structures in memory, we need to temporarily allocate stack locations.
161 We record each allocated temporary in the following structure.
163 Associated with each temporary slot is a nesting level. When we pop up
164 one level, all temporaries associated with the previous level are freed.
165 Normally, all temporaries are freed after the execution of the statement
166 in which they were created. However, if we are inside a ({...}) grouping,
167 the result may be in a temporary and hence must be preserved. If the
168 result could be in a temporary, we preserve it if we can determine which
169 one it is in. If we cannot determine which temporary may contain the
170 result, all temporaries are preserved. A temporary is preserved by
171 pretending it was allocated at the previous nesting level.
173 Automatic variables are also assigned temporary slots, at the nesting
174 level where they are defined. They are marked a "kept" so that
175 free_temp_slots will not free them. */
179 /* Points to next temporary slot. */
180 struct temp_slot
*next
;
181 /* The rtx to used to reference the slot. */
183 /* The rtx used to represent the address if not the address of the
184 slot above. May be an EXPR_LIST if multiple addresses exist. */
186 /* The alignment (in bits) of the slot. */
188 /* The size, in units, of the slot. */
190 /* The type of the object in the slot, or zero if it doesn't correspond
191 to a type. We use this to determine whether a slot can be reused.
192 It can be reused if objects of the type of the new slot will always
193 conflict with objects of the type of the old slot. */
195 /* The value of `sequence_rtl_expr' when this temporary is allocated. */
197 /* Non-zero if this temporary is currently in use. */
199 /* Non-zero if this temporary has its address taken. */
201 /* Nesting level at which this slot is being used. */
203 /* Non-zero if this should survive a call to free_temp_slots. */
205 /* The offset of the slot from the frame_pointer, including extra space
206 for alignment. This info is for combine_temp_slots. */
207 HOST_WIDE_INT base_offset
;
208 /* The size of the slot, including extra space for alignment. This
209 info is for combine_temp_slots. */
210 HOST_WIDE_INT full_size
;
213 /* This structure is used to record MEMs or pseudos used to replace VAR, any
214 SUBREGs of VAR, and any MEMs containing VAR as an address. We need to
215 maintain this list in case two operands of an insn were required to match;
216 in that case we must ensure we use the same replacement. */
218 struct fixup_replacement
222 struct fixup_replacement
*next
;
225 struct insns_for_mem_entry
{
226 /* The KEY in HE will be a MEM. */
227 struct hash_entry he
;
228 /* These are the INSNS which reference the MEM. */
232 /* Forward declarations. */
234 static rtx assign_stack_local_1
PARAMS ((enum machine_mode
, HOST_WIDE_INT
,
235 int, struct function
*));
236 static rtx assign_stack_temp_for_type
PARAMS ((enum machine_mode
,
237 HOST_WIDE_INT
, int, tree
));
238 static struct temp_slot
*find_temp_slot_from_address
PARAMS ((rtx
));
239 static void put_reg_into_stack
PARAMS ((struct function
*, rtx
, tree
,
240 enum machine_mode
, enum machine_mode
,
241 int, unsigned int, int,
242 struct hash_table
*));
243 static void schedule_fixup_var_refs
PARAMS ((struct function
*, rtx
, tree
,
245 struct hash_table
*));
246 static void fixup_var_refs
PARAMS ((rtx
, enum machine_mode
, int,
247 struct hash_table
*));
248 static struct fixup_replacement
249 *find_fixup_replacement
PARAMS ((struct fixup_replacement
**, rtx
));
250 static void fixup_var_refs_insns
PARAMS ((rtx
, rtx
, enum machine_mode
,
252 static void fixup_var_refs_insns_with_hash
253 PARAMS ((struct hash_table
*, rtx
,
254 enum machine_mode
, int));
255 static void fixup_var_refs_insn
PARAMS ((rtx
, rtx
, enum machine_mode
,
257 static void fixup_var_refs_1
PARAMS ((rtx
, enum machine_mode
, rtx
*, rtx
,
258 struct fixup_replacement
**));
259 static rtx fixup_memory_subreg
PARAMS ((rtx
, rtx
, int));
260 static rtx walk_fixup_memory_subreg
PARAMS ((rtx
, rtx
, int));
261 static rtx fixup_stack_1
PARAMS ((rtx
, rtx
));
262 static void optimize_bit_field
PARAMS ((rtx
, rtx
, rtx
*));
263 static void instantiate_decls
PARAMS ((tree
, int));
264 static void instantiate_decls_1
PARAMS ((tree
, int));
265 static void instantiate_decl
PARAMS ((rtx
, HOST_WIDE_INT
, int));
266 static rtx instantiate_new_reg
PARAMS ((rtx
, HOST_WIDE_INT
*));
267 static int instantiate_virtual_regs_1
PARAMS ((rtx
*, rtx
, int));
268 static void delete_handlers
PARAMS ((void));
269 static void pad_to_arg_alignment
PARAMS ((struct args_size
*, int,
270 struct args_size
*));
271 #ifndef ARGS_GROW_DOWNWARD
272 static void pad_below
PARAMS ((struct args_size
*, enum machine_mode
,
275 static rtx round_trampoline_addr
PARAMS ((rtx
));
276 static rtx adjust_trampoline_addr
PARAMS ((rtx
));
277 static tree
*identify_blocks_1
PARAMS ((rtx
, tree
*, tree
*, tree
*));
278 static void reorder_blocks_0
PARAMS ((tree
));
279 static void reorder_blocks_1
PARAMS ((rtx
, tree
, varray_type
*));
280 static void reorder_fix_fragments
PARAMS ((tree
));
281 static tree blocks_nreverse
PARAMS ((tree
));
282 static int all_blocks
PARAMS ((tree
, tree
*));
283 static tree
*get_block_vector
PARAMS ((tree
, int *));
284 /* We always define `record_insns' even if its not used so that we
285 can always export `prologue_epilogue_contains'. */
286 static void record_insns
PARAMS ((rtx
, varray_type
*)) ATTRIBUTE_UNUSED
;
287 static int contains
PARAMS ((rtx
, varray_type
));
289 static void emit_return_into_block
PARAMS ((basic_block
, rtx
));
291 static void put_addressof_into_stack
PARAMS ((rtx
, struct hash_table
*));
292 static bool purge_addressof_1
PARAMS ((rtx
*, rtx
, int, int,
293 struct hash_table
*));
294 static void purge_single_hard_subreg_set
PARAMS ((rtx
));
296 static void keep_stack_depressed
PARAMS ((rtx
));
298 static int is_addressof
PARAMS ((rtx
*, void *));
299 static struct hash_entry
*insns_for_mem_newfunc
PARAMS ((struct hash_entry
*,
302 static unsigned long insns_for_mem_hash
PARAMS ((hash_table_key
));
303 static bool insns_for_mem_comp
PARAMS ((hash_table_key
, hash_table_key
));
304 static int insns_for_mem_walk
PARAMS ((rtx
*, void *));
305 static void compute_insns_for_mem
PARAMS ((rtx
, rtx
, struct hash_table
*));
306 static void mark_temp_slot
PARAMS ((struct temp_slot
*));
307 static void mark_function_status
PARAMS ((struct function
*));
308 static void mark_function_chain
PARAMS ((void *));
309 static void prepare_function_start
PARAMS ((void));
310 static void do_clobber_return_reg
PARAMS ((rtx
, void *));
311 static void do_use_return_reg
PARAMS ((rtx
, void *));
313 /* Pointer to chain of `struct function' for containing functions. */
314 struct function
*outer_function_chain
;
316 /* Given a function decl for a containing function,
317 return the `struct function' for it. */
320 find_function_data (decl
)
325 for (p
= outer_function_chain
; p
; p
= p
->next
)
332 /* Save the current context for compilation of a nested function.
333 This is called from language-specific code. The caller should use
334 the save_lang_status callback to save any language-specific state,
335 since this function knows only about language-independent
339 push_function_context_to (context
)
342 struct function
*p
, *context_data
;
346 context_data
= (context
== current_function_decl
348 : find_function_data (context
));
349 context_data
->contains_functions
= 1;
353 init_dummy_function_start ();
356 p
->next
= outer_function_chain
;
357 outer_function_chain
= p
;
358 p
->fixup_var_refs_queue
= 0;
360 if (save_lang_status
)
361 (*save_lang_status
) (p
);
367 push_function_context ()
369 push_function_context_to (current_function_decl
);
372 /* Restore the last saved context, at the end of a nested function.
373 This function is called from language-specific code. */
376 pop_function_context_from (context
)
377 tree context ATTRIBUTE_UNUSED
;
379 struct function
*p
= outer_function_chain
;
380 struct var_refs_queue
*queue
;
381 struct var_refs_queue
*next
;
384 outer_function_chain
= p
->next
;
386 current_function_decl
= p
->decl
;
389 restore_emit_status (p
);
391 if (restore_lang_status
)
392 (*restore_lang_status
) (p
);
394 /* Finish doing put_var_into_stack for any of our variables
395 which became addressable during the nested function. */
396 for (queue
= p
->fixup_var_refs_queue
; queue
; queue
= next
)
399 fixup_var_refs (queue
->modified
, queue
->promoted_mode
,
400 queue
->unsignedp
, 0);
403 p
->fixup_var_refs_queue
= 0;
405 /* Reset variables that have known state during rtx generation. */
406 rtx_equal_function_value_matters
= 1;
407 virtuals_instantiated
= 0;
408 generating_concat_p
= 1;
412 pop_function_context ()
414 pop_function_context_from (current_function_decl
);
417 /* Clear out all parts of the state in F that can safely be discarded
418 after the function has been parsed, but not compiled, to let
419 garbage collection reclaim the memory. */
422 free_after_parsing (f
)
425 /* f->expr->forced_labels is used by code generation. */
426 /* f->emit->regno_reg_rtx is used by code generation. */
427 /* f->varasm is used by code generation. */
428 /* f->eh->eh_return_stub_label is used by code generation. */
430 if (free_lang_status
)
431 (*free_lang_status
) (f
);
432 free_stmt_status (f
);
435 /* Clear out all parts of the state in F that can safely be discarded
436 after the function has been compiled, to let garbage collection
437 reclaim the memory. */
440 free_after_compilation (f
)
443 struct temp_slot
*ts
;
444 struct temp_slot
*next
;
447 free_expr_status (f
);
448 free_emit_status (f
);
449 free_varasm_status (f
);
451 if (free_machine_status
)
452 (*free_machine_status
) (f
);
454 if (f
->x_parm_reg_stack_loc
)
455 free (f
->x_parm_reg_stack_loc
);
457 for (ts
= f
->x_temp_slots
; ts
; ts
= next
)
462 f
->x_temp_slots
= NULL
;
464 f
->arg_offset_rtx
= NULL
;
465 f
->return_rtx
= NULL
;
466 f
->internal_arg_pointer
= NULL
;
467 f
->x_nonlocal_labels
= NULL
;
468 f
->x_nonlocal_goto_handler_slots
= NULL
;
469 f
->x_nonlocal_goto_handler_labels
= NULL
;
470 f
->x_nonlocal_goto_stack_level
= NULL
;
471 f
->x_cleanup_label
= NULL
;
472 f
->x_return_label
= NULL
;
473 f
->x_save_expr_regs
= NULL
;
474 f
->x_stack_slot_list
= NULL
;
475 f
->x_rtl_expr_chain
= NULL
;
476 f
->x_tail_recursion_label
= NULL
;
477 f
->x_tail_recursion_reentry
= NULL
;
478 f
->x_arg_pointer_save_area
= NULL
;
479 f
->x_clobber_return_insn
= NULL
;
480 f
->x_context_display
= NULL
;
481 f
->x_trampoline_list
= NULL
;
482 f
->x_parm_birth_insn
= NULL
;
483 f
->x_last_parm_insn
= NULL
;
484 f
->x_parm_reg_stack_loc
= NULL
;
485 f
->fixup_var_refs_queue
= NULL
;
486 f
->original_arg_vector
= NULL
;
487 f
->original_decl_initial
= NULL
;
488 f
->inl_last_parm_insn
= NULL
;
489 f
->epilogue_delay_list
= NULL
;
492 /* Allocate fixed slots in the stack frame of the current function. */
494 /* Return size needed for stack frame based on slots so far allocated in
496 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
497 the caller may have to do that. */
500 get_func_frame_size (f
)
503 #ifdef FRAME_GROWS_DOWNWARD
504 return -f
->x_frame_offset
;
506 return f
->x_frame_offset
;
510 /* Return size needed for stack frame based on slots so far allocated.
511 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
512 the caller may have to do that. */
516 return get_func_frame_size (cfun
);
519 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
520 with machine mode MODE.
522 ALIGN controls the amount of alignment for the address of the slot:
523 0 means according to MODE,
524 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
525 positive specifies alignment boundary in bits.
527 We do not round to stack_boundary here.
529 FUNCTION specifies the function to allocate in. */
532 assign_stack_local_1 (mode
, size
, align
, function
)
533 enum machine_mode mode
;
536 struct function
*function
;
538 register rtx x
, addr
;
539 int bigend_correction
= 0;
547 alignment
= BIGGEST_ALIGNMENT
;
549 alignment
= GET_MODE_ALIGNMENT (mode
);
551 /* Allow the target to (possibly) increase the alignment of this
553 type
= type_for_mode (mode
, 0);
555 alignment
= LOCAL_ALIGNMENT (type
, alignment
);
557 alignment
/= BITS_PER_UNIT
;
559 else if (align
== -1)
561 alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
562 size
= CEIL_ROUND (size
, alignment
);
565 alignment
= align
/ BITS_PER_UNIT
;
567 #ifdef FRAME_GROWS_DOWNWARD
568 function
->x_frame_offset
-= size
;
571 /* Ignore alignment we can't do with expected alignment of the boundary. */
572 if (alignment
* BITS_PER_UNIT
> PREFERRED_STACK_BOUNDARY
)
573 alignment
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
575 if (function
->stack_alignment_needed
< alignment
* BITS_PER_UNIT
)
576 function
->stack_alignment_needed
= alignment
* BITS_PER_UNIT
;
578 /* Round frame offset to that alignment.
579 We must be careful here, since FRAME_OFFSET might be negative and
580 division with a negative dividend isn't as well defined as we might
581 like. So we instead assume that ALIGNMENT is a power of two and
582 use logical operations which are unambiguous. */
583 #ifdef FRAME_GROWS_DOWNWARD
584 function
->x_frame_offset
= FLOOR_ROUND (function
->x_frame_offset
, alignment
);
586 function
->x_frame_offset
= CEIL_ROUND (function
->x_frame_offset
, alignment
);
589 /* On a big-endian machine, if we are allocating more space than we will use,
590 use the least significant bytes of those that are allocated. */
591 if (BYTES_BIG_ENDIAN
&& mode
!= BLKmode
)
592 bigend_correction
= size
- GET_MODE_SIZE (mode
);
594 /* If we have already instantiated virtual registers, return the actual
595 address relative to the frame pointer. */
596 if (function
== cfun
&& virtuals_instantiated
)
597 addr
= plus_constant (frame_pointer_rtx
,
598 (frame_offset
+ bigend_correction
599 + STARTING_FRAME_OFFSET
));
601 addr
= plus_constant (virtual_stack_vars_rtx
,
602 function
->x_frame_offset
+ bigend_correction
);
604 #ifndef FRAME_GROWS_DOWNWARD
605 function
->x_frame_offset
+= size
;
608 x
= gen_rtx_MEM (mode
, addr
);
610 function
->x_stack_slot_list
611 = gen_rtx_EXPR_LIST (VOIDmode
, x
, function
->x_stack_slot_list
);
616 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
620 assign_stack_local (mode
, size
, align
)
621 enum machine_mode mode
;
625 return assign_stack_local_1 (mode
, size
, align
, cfun
);
628 /* Allocate a temporary stack slot and record it for possible later
631 MODE is the machine mode to be given to the returned rtx.
633 SIZE is the size in units of the space required. We do no rounding here
634 since assign_stack_local will do any required rounding.
636 KEEP is 1 if this slot is to be retained after a call to
637 free_temp_slots. Automatic variables for a block are allocated
638 with this flag. KEEP is 2 if we allocate a longer term temporary,
639 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
640 if we are to allocate something at an inner level to be treated as
641 a variable in the block (e.g., a SAVE_EXPR).
643 TYPE is the type that will be used for the stack slot. */
646 assign_stack_temp_for_type (mode
, size
, keep
, type
)
647 enum machine_mode mode
;
653 struct temp_slot
*p
, *best_p
= 0;
655 /* If SIZE is -1 it means that somebody tried to allocate a temporary
656 of a variable size. */
661 align
= BIGGEST_ALIGNMENT
;
663 align
= GET_MODE_ALIGNMENT (mode
);
666 type
= type_for_mode (mode
, 0);
669 align
= LOCAL_ALIGNMENT (type
, align
);
671 /* Try to find an available, already-allocated temporary of the proper
672 mode which meets the size and alignment requirements. Choose the
673 smallest one with the closest alignment. */
674 for (p
= temp_slots
; p
; p
= p
->next
)
675 if (p
->align
>= align
&& p
->size
>= size
&& GET_MODE (p
->slot
) == mode
677 && objects_must_conflict_p (p
->type
, type
)
678 && (best_p
== 0 || best_p
->size
> p
->size
679 || (best_p
->size
== p
->size
&& best_p
->align
> p
->align
)))
681 if (p
->align
== align
&& p
->size
== size
)
689 /* Make our best, if any, the one to use. */
692 /* If there are enough aligned bytes left over, make them into a new
693 temp_slot so that the extra bytes don't get wasted. Do this only
694 for BLKmode slots, so that we can be sure of the alignment. */
695 if (GET_MODE (best_p
->slot
) == BLKmode
)
697 int alignment
= best_p
->align
/ BITS_PER_UNIT
;
698 HOST_WIDE_INT rounded_size
= CEIL_ROUND (size
, alignment
);
700 if (best_p
->size
- rounded_size
>= alignment
)
702 p
= (struct temp_slot
*) xmalloc (sizeof (struct temp_slot
));
703 p
->in_use
= p
->addr_taken
= 0;
704 p
->size
= best_p
->size
- rounded_size
;
705 p
->base_offset
= best_p
->base_offset
+ rounded_size
;
706 p
->full_size
= best_p
->full_size
- rounded_size
;
707 p
->slot
= gen_rtx_MEM (BLKmode
,
708 plus_constant (XEXP (best_p
->slot
, 0),
710 p
->align
= best_p
->align
;
713 p
->type
= best_p
->type
;
714 p
->next
= temp_slots
;
717 stack_slot_list
= gen_rtx_EXPR_LIST (VOIDmode
, p
->slot
,
720 best_p
->size
= rounded_size
;
721 best_p
->full_size
= rounded_size
;
728 /* If we still didn't find one, make a new temporary. */
731 HOST_WIDE_INT frame_offset_old
= frame_offset
;
733 p
= (struct temp_slot
*) xmalloc (sizeof (struct temp_slot
));
735 /* We are passing an explicit alignment request to assign_stack_local.
736 One side effect of that is assign_stack_local will not round SIZE
737 to ensure the frame offset remains suitably aligned.
739 So for requests which depended on the rounding of SIZE, we go ahead
740 and round it now. We also make sure ALIGNMENT is at least
741 BIGGEST_ALIGNMENT. */
742 if (mode
== BLKmode
&& align
< BIGGEST_ALIGNMENT
)
744 p
->slot
= assign_stack_local (mode
,
746 ? CEIL_ROUND (size
, align
/ BITS_PER_UNIT
)
752 /* The following slot size computation is necessary because we don't
753 know the actual size of the temporary slot until assign_stack_local
754 has performed all the frame alignment and size rounding for the
755 requested temporary. Note that extra space added for alignment
756 can be either above or below this stack slot depending on which
757 way the frame grows. We include the extra space if and only if it
758 is above this slot. */
759 #ifdef FRAME_GROWS_DOWNWARD
760 p
->size
= frame_offset_old
- frame_offset
;
765 /* Now define the fields used by combine_temp_slots. */
766 #ifdef FRAME_GROWS_DOWNWARD
767 p
->base_offset
= frame_offset
;
768 p
->full_size
= frame_offset_old
- frame_offset
;
770 p
->base_offset
= frame_offset_old
;
771 p
->full_size
= frame_offset
- frame_offset_old
;
774 p
->next
= temp_slots
;
780 p
->rtl_expr
= seq_rtl_expr
;
785 p
->level
= target_temp_slot_level
;
790 p
->level
= var_temp_slot_level
;
795 p
->level
= temp_slot_level
;
799 /* We may be reusing an old slot, so clear any MEM flags that may have been
801 RTX_UNCHANGING_P (p
->slot
) = 0;
802 MEM_IN_STRUCT_P (p
->slot
) = 0;
803 MEM_SCALAR_P (p
->slot
) = 0;
804 MEM_VOLATILE_P (p
->slot
) = 0;
806 /* If we know the alias set for the memory that will be used, use
807 it. If there's no TYPE, then we don't know anything about the
808 alias set for the memory. */
809 set_mem_alias_set (p
->slot
, type
? get_alias_set (type
) : 0);
811 /* If a type is specified, set the relevant flags. */
814 RTX_UNCHANGING_P (p
->slot
) = TYPE_READONLY (type
);
815 MEM_VOLATILE_P (p
->slot
) = TYPE_VOLATILE (type
);
816 MEM_SET_IN_STRUCT_P (p
->slot
, AGGREGATE_TYPE_P (type
));
822 /* Allocate a temporary stack slot and record it for possible later
823 reuse. First three arguments are same as in preceding function. */
826 assign_stack_temp (mode
, size
, keep
)
827 enum machine_mode mode
;
831 return assign_stack_temp_for_type (mode
, size
, keep
, NULL_TREE
);
834 /* Assign a temporary of given TYPE.
835 KEEP is as for assign_stack_temp.
836 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
837 it is 0 if a register is OK.
838 DONT_PROMOTE is 1 if we should not promote values in register
842 assign_temp (type
, keep
, memory_required
, dont_promote
)
846 int dont_promote ATTRIBUTE_UNUSED
;
848 enum machine_mode mode
= TYPE_MODE (type
);
849 #ifndef PROMOTE_FOR_CALL_ONLY
850 int unsignedp
= TREE_UNSIGNED (type
);
853 if (mode
== BLKmode
|| memory_required
)
855 HOST_WIDE_INT size
= int_size_in_bytes (type
);
858 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
859 problems with allocating the stack space. */
863 /* Unfortunately, we don't yet know how to allocate variable-sized
864 temporaries. However, sometimes we have a fixed upper limit on
865 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
866 instead. This is the case for Chill variable-sized strings. */
867 if (size
== -1 && TREE_CODE (type
) == ARRAY_TYPE
868 && TYPE_ARRAY_MAX_SIZE (type
) != NULL_TREE
869 && host_integerp (TYPE_ARRAY_MAX_SIZE (type
), 1))
870 size
= tree_low_cst (TYPE_ARRAY_MAX_SIZE (type
), 1);
872 tmp
= assign_stack_temp_for_type (mode
, size
, keep
, type
);
876 #ifndef PROMOTE_FOR_CALL_ONLY
878 mode
= promote_mode (type
, mode
, &unsignedp
, 0);
881 return gen_reg_rtx (mode
);
884 /* Combine temporary stack slots which are adjacent on the stack.
886 This allows for better use of already allocated stack space. This is only
887 done for BLKmode slots because we can be sure that we won't have alignment
888 problems in this case. */
891 combine_temp_slots ()
893 struct temp_slot
*p
, *q
;
894 struct temp_slot
*prev_p
, *prev_q
;
897 /* We can't combine slots, because the information about which slot
898 is in which alias set will be lost. */
899 if (flag_strict_aliasing
)
902 /* If there are a lot of temp slots, don't do anything unless
903 high levels of optimizaton. */
904 if (! flag_expensive_optimizations
)
905 for (p
= temp_slots
, num_slots
= 0; p
; p
= p
->next
, num_slots
++)
906 if (num_slots
> 100 || (num_slots
> 10 && optimize
== 0))
909 for (p
= temp_slots
, prev_p
= 0; p
; p
= prev_p
? prev_p
->next
: temp_slots
)
913 if (! p
->in_use
&& GET_MODE (p
->slot
) == BLKmode
)
914 for (q
= p
->next
, prev_q
= p
; q
; q
= prev_q
->next
)
917 if (! q
->in_use
&& GET_MODE (q
->slot
) == BLKmode
)
919 if (p
->base_offset
+ p
->full_size
== q
->base_offset
)
921 /* Q comes after P; combine Q into P. */
923 p
->full_size
+= q
->full_size
;
926 else if (q
->base_offset
+ q
->full_size
== p
->base_offset
)
928 /* P comes after Q; combine P into Q. */
930 q
->full_size
+= p
->full_size
;
935 /* Either delete Q or advance past it. */
938 prev_q
->next
= q
->next
;
944 /* Either delete P or advance past it. */
948 prev_p
->next
= p
->next
;
950 temp_slots
= p
->next
;
957 /* Find the temp slot corresponding to the object at address X. */
959 static struct temp_slot
*
960 find_temp_slot_from_address (x
)
966 for (p
= temp_slots
; p
; p
= p
->next
)
971 else if (XEXP (p
->slot
, 0) == x
973 || (GET_CODE (x
) == PLUS
974 && XEXP (x
, 0) == virtual_stack_vars_rtx
975 && GET_CODE (XEXP (x
, 1)) == CONST_INT
976 && INTVAL (XEXP (x
, 1)) >= p
->base_offset
977 && INTVAL (XEXP (x
, 1)) < p
->base_offset
+ p
->full_size
))
980 else if (p
->address
!= 0 && GET_CODE (p
->address
) == EXPR_LIST
)
981 for (next
= p
->address
; next
; next
= XEXP (next
, 1))
982 if (XEXP (next
, 0) == x
)
986 /* If we have a sum involving a register, see if it points to a temp
988 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 0)) == REG
989 && (p
= find_temp_slot_from_address (XEXP (x
, 0))) != 0)
991 else if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == REG
992 && (p
= find_temp_slot_from_address (XEXP (x
, 1))) != 0)
998 /* Indicate that NEW is an alternate way of referring to the temp slot
999 that previously was known by OLD. */
1002 update_temp_slot_address (old
, new)
1005 struct temp_slot
*p
;
1007 if (rtx_equal_p (old
, new))
1010 p
= find_temp_slot_from_address (old
);
1012 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
1013 is a register, see if one operand of the PLUS is a temporary
1014 location. If so, NEW points into it. Otherwise, if both OLD and
1015 NEW are a PLUS and if there is a register in common between them.
1016 If so, try a recursive call on those values. */
1019 if (GET_CODE (old
) != PLUS
)
1022 if (GET_CODE (new) == REG
)
1024 update_temp_slot_address (XEXP (old
, 0), new);
1025 update_temp_slot_address (XEXP (old
, 1), new);
1028 else if (GET_CODE (new) != PLUS
)
1031 if (rtx_equal_p (XEXP (old
, 0), XEXP (new, 0)))
1032 update_temp_slot_address (XEXP (old
, 1), XEXP (new, 1));
1033 else if (rtx_equal_p (XEXP (old
, 1), XEXP (new, 0)))
1034 update_temp_slot_address (XEXP (old
, 0), XEXP (new, 1));
1035 else if (rtx_equal_p (XEXP (old
, 0), XEXP (new, 1)))
1036 update_temp_slot_address (XEXP (old
, 1), XEXP (new, 0));
1037 else if (rtx_equal_p (XEXP (old
, 1), XEXP (new, 1)))
1038 update_temp_slot_address (XEXP (old
, 0), XEXP (new, 0));
1043 /* Otherwise add an alias for the temp's address. */
1044 else if (p
->address
== 0)
1048 if (GET_CODE (p
->address
) != EXPR_LIST
)
1049 p
->address
= gen_rtx_EXPR_LIST (VOIDmode
, p
->address
, NULL_RTX
);
1051 p
->address
= gen_rtx_EXPR_LIST (VOIDmode
, new, p
->address
);
1055 /* If X could be a reference to a temporary slot, mark the fact that its
1056 address was taken. */
1059 mark_temp_addr_taken (x
)
1062 struct temp_slot
*p
;
1067 /* If X is not in memory or is at a constant address, it cannot be in
1068 a temporary slot. */
1069 if (GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0)))
1072 p
= find_temp_slot_from_address (XEXP (x
, 0));
1077 /* If X could be a reference to a temporary slot, mark that slot as
1078 belonging to the to one level higher than the current level. If X
1079 matched one of our slots, just mark that one. Otherwise, we can't
1080 easily predict which it is, so upgrade all of them. Kept slots
1081 need not be touched.
1083 This is called when an ({...}) construct occurs and a statement
1084 returns a value in memory. */
1087 preserve_temp_slots (x
)
1090 struct temp_slot
*p
= 0;
1092 /* If there is no result, we still might have some objects whose address
1093 were taken, so we need to make sure they stay around. */
1096 for (p
= temp_slots
; p
; p
= p
->next
)
1097 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->addr_taken
)
1103 /* If X is a register that is being used as a pointer, see if we have
1104 a temporary slot we know it points to. To be consistent with
1105 the code below, we really should preserve all non-kept slots
1106 if we can't find a match, but that seems to be much too costly. */
1107 if (GET_CODE (x
) == REG
&& REG_POINTER (x
))
1108 p
= find_temp_slot_from_address (x
);
1110 /* If X is not in memory or is at a constant address, it cannot be in
1111 a temporary slot, but it can contain something whose address was
1113 if (p
== 0 && (GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0))))
1115 for (p
= temp_slots
; p
; p
= p
->next
)
1116 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->addr_taken
)
1122 /* First see if we can find a match. */
1124 p
= find_temp_slot_from_address (XEXP (x
, 0));
1128 /* Move everything at our level whose address was taken to our new
1129 level in case we used its address. */
1130 struct temp_slot
*q
;
1132 if (p
->level
== temp_slot_level
)
1134 for (q
= temp_slots
; q
; q
= q
->next
)
1135 if (q
!= p
&& q
->addr_taken
&& q
->level
== p
->level
)
1144 /* Otherwise, preserve all non-kept slots at this level. */
1145 for (p
= temp_slots
; p
; p
= p
->next
)
1146 if (p
->in_use
&& p
->level
== temp_slot_level
&& ! p
->keep
)
1150 /* X is the result of an RTL_EXPR. If it is a temporary slot associated
1151 with that RTL_EXPR, promote it into a temporary slot at the present
1152 level so it will not be freed when we free slots made in the
1156 preserve_rtl_expr_result (x
)
1159 struct temp_slot
*p
;
1161 /* If X is not in memory or is at a constant address, it cannot be in
1162 a temporary slot. */
1163 if (x
== 0 || GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0)))
1166 /* If we can find a match, move it to our level unless it is already at
1168 p
= find_temp_slot_from_address (XEXP (x
, 0));
1171 p
->level
= MIN (p
->level
, temp_slot_level
);
1178 /* Free all temporaries used so far. This is normally called at the end
1179 of generating code for a statement. Don't free any temporaries
1180 currently in use for an RTL_EXPR that hasn't yet been emitted.
1181 We could eventually do better than this since it can be reused while
1182 generating the same RTL_EXPR, but this is complex and probably not
1188 struct temp_slot
*p
;
1190 for (p
= temp_slots
; p
; p
= p
->next
)
1191 if (p
->in_use
&& p
->level
== temp_slot_level
&& ! p
->keep
1192 && p
->rtl_expr
== 0)
1195 combine_temp_slots ();
1198 /* Free all temporary slots used in T, an RTL_EXPR node. */
1201 free_temps_for_rtl_expr (t
)
1204 struct temp_slot
*p
;
1206 for (p
= temp_slots
; p
; p
= p
->next
)
1207 if (p
->rtl_expr
== t
)
1209 /* If this slot is below the current TEMP_SLOT_LEVEL, then it
1210 needs to be preserved. This can happen if a temporary in
1211 the RTL_EXPR was addressed; preserve_temp_slots will move
1212 the temporary into a higher level. */
1213 if (temp_slot_level
<= p
->level
)
1216 p
->rtl_expr
= NULL_TREE
;
1219 combine_temp_slots ();
1222 /* Mark all temporaries ever allocated in this function as not suitable
1223 for reuse until the current level is exited. */
1226 mark_all_temps_used ()
1228 struct temp_slot
*p
;
1230 for (p
= temp_slots
; p
; p
= p
->next
)
1232 p
->in_use
= p
->keep
= 1;
1233 p
->level
= MIN (p
->level
, temp_slot_level
);
1237 /* Push deeper into the nesting level for stack temporaries. */
1245 /* Likewise, but save the new level as the place to allocate variables
1250 push_temp_slots_for_block ()
1254 var_temp_slot_level
= temp_slot_level
;
1257 /* Likewise, but save the new level as the place to allocate temporaries
1258 for TARGET_EXPRs. */
1261 push_temp_slots_for_target ()
1265 target_temp_slot_level
= temp_slot_level
;
1268 /* Set and get the value of target_temp_slot_level. The only
1269 permitted use of these functions is to save and restore this value. */
1272 get_target_temp_slot_level ()
1274 return target_temp_slot_level
;
1278 set_target_temp_slot_level (level
)
1281 target_temp_slot_level
= level
;
1285 /* Pop a temporary nesting level. All slots in use in the current level
1291 struct temp_slot
*p
;
1293 for (p
= temp_slots
; p
; p
= p
->next
)
1294 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->rtl_expr
== 0)
1297 combine_temp_slots ();
1302 /* Initialize temporary slots. */
1307 /* We have not allocated any temporaries yet. */
1309 temp_slot_level
= 0;
1310 var_temp_slot_level
= 0;
1311 target_temp_slot_level
= 0;
1314 /* Retroactively move an auto variable from a register to a stack slot.
1315 This is done when an address-reference to the variable is seen. */
1318 put_var_into_stack (decl
)
1322 enum machine_mode promoted_mode
, decl_mode
;
1323 struct function
*function
= 0;
1325 int can_use_addressof
;
1326 int volatilep
= TREE_CODE (decl
) != SAVE_EXPR
&& TREE_THIS_VOLATILE (decl
);
1327 int usedp
= (TREE_USED (decl
)
1328 || (TREE_CODE (decl
) != SAVE_EXPR
&& DECL_INITIAL (decl
) != 0));
1330 context
= decl_function_context (decl
);
1332 /* Get the current rtl used for this object and its original mode. */
1333 reg
= (TREE_CODE (decl
) == SAVE_EXPR
1334 ? SAVE_EXPR_RTL (decl
)
1335 : DECL_RTL_IF_SET (decl
));
1337 /* No need to do anything if decl has no rtx yet
1338 since in that case caller is setting TREE_ADDRESSABLE
1339 and a stack slot will be assigned when the rtl is made. */
1343 /* Get the declared mode for this object. */
1344 decl_mode
= (TREE_CODE (decl
) == SAVE_EXPR
? TYPE_MODE (TREE_TYPE (decl
))
1345 : DECL_MODE (decl
));
1346 /* Get the mode it's actually stored in. */
1347 promoted_mode
= GET_MODE (reg
);
1349 /* If this variable comes from an outer function,
1350 find that function's saved context. */
1351 if (context
!= current_function_decl
&& context
!= inline_function_decl
)
1352 for (function
= outer_function_chain
; function
; function
= function
->next
)
1353 if (function
->decl
== context
)
1356 /* If this is a variable-size object with a pseudo to address it,
1357 put that pseudo into the stack, if the var is nonlocal. */
1358 if (TREE_CODE (decl
) != SAVE_EXPR
&& DECL_NONLOCAL (decl
)
1359 && GET_CODE (reg
) == MEM
1360 && GET_CODE (XEXP (reg
, 0)) == REG
1361 && REGNO (XEXP (reg
, 0)) > LAST_VIRTUAL_REGISTER
)
1363 reg
= XEXP (reg
, 0);
1364 decl_mode
= promoted_mode
= GET_MODE (reg
);
1370 /* FIXME make it work for promoted modes too */
1371 && decl_mode
== promoted_mode
1372 #ifdef NON_SAVING_SETJMP
1373 && ! (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
1377 /* If we can't use ADDRESSOF, make sure we see through one we already
1379 if (! can_use_addressof
&& GET_CODE (reg
) == MEM
1380 && GET_CODE (XEXP (reg
, 0)) == ADDRESSOF
)
1381 reg
= XEXP (XEXP (reg
, 0), 0);
1383 /* Now we should have a value that resides in one or more pseudo regs. */
1385 if (GET_CODE (reg
) == REG
)
1387 /* If this variable lives in the current function and we don't need
1388 to put things in the stack for the sake of setjmp, try to keep it
1389 in a register until we know we actually need the address. */
1390 if (can_use_addressof
)
1391 gen_mem_addressof (reg
, decl
);
1393 put_reg_into_stack (function
, reg
, TREE_TYPE (decl
), promoted_mode
,
1394 decl_mode
, volatilep
, 0, usedp
, 0);
1396 else if (GET_CODE (reg
) == CONCAT
)
1398 /* A CONCAT contains two pseudos; put them both in the stack.
1399 We do it so they end up consecutive.
1400 We fixup references to the parts only after we fixup references
1401 to the whole CONCAT, lest we do double fixups for the latter
1403 enum machine_mode part_mode
= GET_MODE (XEXP (reg
, 0));
1404 tree part_type
= type_for_mode (part_mode
, 0);
1405 rtx lopart
= XEXP (reg
, 0);
1406 rtx hipart
= XEXP (reg
, 1);
1407 #ifdef FRAME_GROWS_DOWNWARD
1408 /* Since part 0 should have a lower address, do it second. */
1409 put_reg_into_stack (function
, hipart
, part_type
, part_mode
,
1410 part_mode
, volatilep
, 0, 0, 0);
1411 put_reg_into_stack (function
, lopart
, part_type
, part_mode
,
1412 part_mode
, volatilep
, 0, 0, 0);
1414 put_reg_into_stack (function
, lopart
, part_type
, part_mode
,
1415 part_mode
, volatilep
, 0, 0, 0);
1416 put_reg_into_stack (function
, hipart
, part_type
, part_mode
,
1417 part_mode
, volatilep
, 0, 0, 0);
1420 /* Change the CONCAT into a combined MEM for both parts. */
1421 PUT_CODE (reg
, MEM
);
1423 /* set_mem_attributes uses DECL_RTL to avoid re-generating of
1424 already computed alias sets. Here we want to re-generate. */
1426 SET_DECL_RTL (decl
, NULL
);
1427 set_mem_attributes (reg
, decl
, 1);
1429 SET_DECL_RTL (decl
, reg
);
1431 /* The two parts are in memory order already.
1432 Use the lower parts address as ours. */
1433 XEXP (reg
, 0) = XEXP (XEXP (reg
, 0), 0);
1434 /* Prevent sharing of rtl that might lose. */
1435 if (GET_CODE (XEXP (reg
, 0)) == PLUS
)
1436 XEXP (reg
, 0) = copy_rtx (XEXP (reg
, 0));
1439 schedule_fixup_var_refs (function
, reg
, TREE_TYPE (decl
),
1441 schedule_fixup_var_refs (function
, lopart
, part_type
, part_mode
, 0);
1442 schedule_fixup_var_refs (function
, hipart
, part_type
, part_mode
, 0);
1448 if (current_function_check_memory_usage
)
1449 emit_library_call (chkr_set_right_libfunc
, LCT_CONST_MAKE_BLOCK
, VOIDmode
,
1450 3, XEXP (reg
, 0), Pmode
,
1451 GEN_INT (GET_MODE_SIZE (GET_MODE (reg
))),
1452 TYPE_MODE (sizetype
),
1453 GEN_INT (MEMORY_USE_RW
),
1454 TYPE_MODE (integer_type_node
));
1457 /* Subroutine of put_var_into_stack. This puts a single pseudo reg REG
1458 into the stack frame of FUNCTION (0 means the current function).
1459 DECL_MODE is the machine mode of the user-level data type.
1460 PROMOTED_MODE is the machine mode of the register.
1461 VOLATILE_P is nonzero if this is for a "volatile" decl.
1462 USED_P is nonzero if this reg might have already been used in an insn. */
1465 put_reg_into_stack (function
, reg
, type
, promoted_mode
, decl_mode
, volatile_p
,
1466 original_regno
, used_p
, ht
)
1467 struct function
*function
;
1470 enum machine_mode promoted_mode
, decl_mode
;
1472 unsigned int original_regno
;
1474 struct hash_table
*ht
;
1476 struct function
*func
= function
? function
: cfun
;
1478 unsigned int regno
= original_regno
;
1481 regno
= REGNO (reg
);
1483 if (regno
< func
->x_max_parm_reg
)
1484 new = func
->x_parm_reg_stack_loc
[regno
];
1487 new = assign_stack_local_1 (decl_mode
, GET_MODE_SIZE (decl_mode
), 0, func
);
1489 PUT_CODE (reg
, MEM
);
1490 PUT_MODE (reg
, decl_mode
);
1491 XEXP (reg
, 0) = XEXP (new, 0);
1492 /* `volatil' bit means one thing for MEMs, another entirely for REGs. */
1493 MEM_VOLATILE_P (reg
) = volatile_p
;
1495 /* If this is a memory ref that contains aggregate components,
1496 mark it as such for cse and loop optimize. If we are reusing a
1497 previously generated stack slot, then we need to copy the bit in
1498 case it was set for other reasons. For instance, it is set for
1499 __builtin_va_alist. */
1502 MEM_SET_IN_STRUCT_P (reg
,
1503 AGGREGATE_TYPE_P (type
) || MEM_IN_STRUCT_P (new));
1504 set_mem_alias_set (reg
, get_alias_set (type
));
1507 schedule_fixup_var_refs (function
, reg
, type
, promoted_mode
, ht
);
1510 /* Make sure that all refs to the variable, previously made
1511 when it was a register, are fixed up to be valid again.
1512 See function above for meaning of arguments. */
1515 schedule_fixup_var_refs (function
, reg
, type
, promoted_mode
, ht
)
1516 struct function
*function
;
1519 enum machine_mode promoted_mode
;
1520 struct hash_table
*ht
;
1522 int unsigned_p
= type
? TREE_UNSIGNED (type
) : 0;
1526 struct var_refs_queue
*temp
;
1529 = (struct var_refs_queue
*) xmalloc (sizeof (struct var_refs_queue
));
1530 temp
->modified
= reg
;
1531 temp
->promoted_mode
= promoted_mode
;
1532 temp
->unsignedp
= unsigned_p
;
1533 temp
->next
= function
->fixup_var_refs_queue
;
1534 function
->fixup_var_refs_queue
= temp
;
1537 /* Variable is local; fix it up now. */
1538 fixup_var_refs (reg
, promoted_mode
, unsigned_p
, ht
);
1542 fixup_var_refs (var
, promoted_mode
, unsignedp
, ht
)
1544 enum machine_mode promoted_mode
;
1546 struct hash_table
*ht
;
1549 rtx first_insn
= get_insns ();
1550 struct sequence_stack
*stack
= seq_stack
;
1551 tree rtl_exps
= rtl_expr_chain
;
1553 /* If there's a hash table, it must record all uses of VAR. */
1558 fixup_var_refs_insns_with_hash (ht
, var
, promoted_mode
, unsignedp
);
1562 fixup_var_refs_insns (first_insn
, var
, promoted_mode
, unsignedp
,
1565 /* Scan all pending sequences too. */
1566 for (; stack
; stack
= stack
->next
)
1568 push_to_full_sequence (stack
->first
, stack
->last
);
1569 fixup_var_refs_insns (stack
->first
, var
, promoted_mode
, unsignedp
,
1571 /* Update remembered end of sequence
1572 in case we added an insn at the end. */
1573 stack
->last
= get_last_insn ();
1577 /* Scan all waiting RTL_EXPRs too. */
1578 for (pending
= rtl_exps
; pending
; pending
= TREE_CHAIN (pending
))
1580 rtx seq
= RTL_EXPR_SEQUENCE (TREE_VALUE (pending
));
1581 if (seq
!= const0_rtx
&& seq
!= 0)
1583 push_to_sequence (seq
);
1584 fixup_var_refs_insns (seq
, var
, promoted_mode
, unsignedp
, 0);
1590 /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is
1591 some part of an insn. Return a struct fixup_replacement whose OLD
1592 value is equal to X. Allocate a new structure if no such entry exists. */
1594 static struct fixup_replacement
*
1595 find_fixup_replacement (replacements
, x
)
1596 struct fixup_replacement
**replacements
;
1599 struct fixup_replacement
*p
;
1601 /* See if we have already replaced this. */
1602 for (p
= *replacements
; p
!= 0 && ! rtx_equal_p (p
->old
, x
); p
= p
->next
)
1607 p
= (struct fixup_replacement
*) xmalloc (sizeof (struct fixup_replacement
));
1610 p
->next
= *replacements
;
1617 /* Scan the insn-chain starting with INSN for refs to VAR
1618 and fix them up. TOPLEVEL is nonzero if this chain is the
1619 main chain of insns for the current function. */
1622 fixup_var_refs_insns (insn
, var
, promoted_mode
, unsignedp
, toplevel
)
1625 enum machine_mode promoted_mode
;
1631 /* fixup_var_refs_insn might modify insn, so save its next
1633 rtx next
= NEXT_INSN (insn
);
1635 /* CALL_PLACEHOLDERs are special; we have to switch into each of
1636 the three sequences they (potentially) contain, and process
1637 them recursively. The CALL_INSN itself is not interesting. */
1639 if (GET_CODE (insn
) == CALL_INSN
1640 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
1644 /* Look at the Normal call, sibling call and tail recursion
1645 sequences attached to the CALL_PLACEHOLDER. */
1646 for (i
= 0; i
< 3; i
++)
1648 rtx seq
= XEXP (PATTERN (insn
), i
);
1651 push_to_sequence (seq
);
1652 fixup_var_refs_insns (seq
, var
, promoted_mode
, unsignedp
, 0);
1653 XEXP (PATTERN (insn
), i
) = get_insns ();
1659 else if (INSN_P (insn
))
1660 fixup_var_refs_insn (insn
, var
, promoted_mode
, unsignedp
, toplevel
);
1666 /* Look up the insns which reference VAR in HT and fix them up. Other
1667 arguments are the same as fixup_var_refs_insns.
1669 N.B. No need for special processing of CALL_PLACEHOLDERs here,
1670 because the hash table will point straight to the interesting insn
1671 (inside the CALL_PLACEHOLDER). */
1673 fixup_var_refs_insns_with_hash (ht
, var
, promoted_mode
, unsignedp
)
1674 struct hash_table
*ht
;
1676 enum machine_mode promoted_mode
;
1679 struct insns_for_mem_entry
*ime
= (struct insns_for_mem_entry
*)
1680 hash_lookup (ht
, var
, /*create=*/0, /*copy=*/0);
1681 rtx insn_list
= ime
->insns
;
1685 rtx insn
= XEXP (insn_list
, 0);
1688 fixup_var_refs_insn (insn
, var
, promoted_mode
, unsignedp
, 1);
1690 insn_list
= XEXP (insn_list
, 1);
1695 /* Per-insn processing by fixup_var_refs_insns(_with_hash). INSN is
1696 the insn under examination, VAR is the variable to fix up
1697 references to, PROMOTED_MODE and UNSIGNEDP describe VAR, and
1698 TOPLEVEL is nonzero if this is the main insn chain for this
1701 fixup_var_refs_insn (insn
, var
, promoted_mode
, unsignedp
, toplevel
)
1704 enum machine_mode promoted_mode
;
1709 rtx set
, prev
, prev_set
;
1712 /* Remember the notes in case we delete the insn. */
1713 note
= REG_NOTES (insn
);
1715 /* If this is a CLOBBER of VAR, delete it.
1717 If it has a REG_LIBCALL note, delete the REG_LIBCALL
1718 and REG_RETVAL notes too. */
1719 if (GET_CODE (PATTERN (insn
)) == CLOBBER
1720 && (XEXP (PATTERN (insn
), 0) == var
1721 || (GET_CODE (XEXP (PATTERN (insn
), 0)) == CONCAT
1722 && (XEXP (XEXP (PATTERN (insn
), 0), 0) == var
1723 || XEXP (XEXP (PATTERN (insn
), 0), 1) == var
))))
1725 if ((note
= find_reg_note (insn
, REG_LIBCALL
, NULL_RTX
)) != 0)
1726 /* The REG_LIBCALL note will go away since we are going to
1727 turn INSN into a NOTE, so just delete the
1728 corresponding REG_RETVAL note. */
1729 remove_note (XEXP (note
, 0),
1730 find_reg_note (XEXP (note
, 0), REG_RETVAL
,
1733 /* In unoptimized compilation, we shouldn't call delete_insn
1734 except in jump.c doing warnings. */
1735 PUT_CODE (insn
, NOTE
);
1736 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1737 NOTE_SOURCE_FILE (insn
) = 0;
1740 /* The insn to load VAR from a home in the arglist
1741 is now a no-op. When we see it, just delete it.
1742 Similarly if this is storing VAR from a register from which
1743 it was loaded in the previous insn. This will occur
1744 when an ADDRESSOF was made for an arglist slot. */
1746 && (set
= single_set (insn
)) != 0
1747 && SET_DEST (set
) == var
1748 /* If this represents the result of an insn group,
1749 don't delete the insn. */
1750 && find_reg_note (insn
, REG_RETVAL
, NULL_RTX
) == 0
1751 && (rtx_equal_p (SET_SRC (set
), var
)
1752 || (GET_CODE (SET_SRC (set
)) == REG
1753 && (prev
= prev_nonnote_insn (insn
)) != 0
1754 && (prev_set
= single_set (prev
)) != 0
1755 && SET_DEST (prev_set
) == SET_SRC (set
)
1756 && rtx_equal_p (SET_SRC (prev_set
), var
))))
1758 /* In unoptimized compilation, we shouldn't call delete_insn
1759 except in jump.c doing warnings. */
1760 PUT_CODE (insn
, NOTE
);
1761 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1762 NOTE_SOURCE_FILE (insn
) = 0;
1766 struct fixup_replacement
*replacements
= 0;
1767 rtx next_insn
= NEXT_INSN (insn
);
1769 if (SMALL_REGISTER_CLASSES
)
1771 /* If the insn that copies the results of a CALL_INSN
1772 into a pseudo now references VAR, we have to use an
1773 intermediate pseudo since we want the life of the
1774 return value register to be only a single insn.
1776 If we don't use an intermediate pseudo, such things as
1777 address computations to make the address of VAR valid
1778 if it is not can be placed between the CALL_INSN and INSN.
1780 To make sure this doesn't happen, we record the destination
1781 of the CALL_INSN and see if the next insn uses both that
1784 if (call_dest
!= 0 && GET_CODE (insn
) == INSN
1785 && reg_mentioned_p (var
, PATTERN (insn
))
1786 && reg_mentioned_p (call_dest
, PATTERN (insn
)))
1788 rtx temp
= gen_reg_rtx (GET_MODE (call_dest
));
1790 emit_insn_before (gen_move_insn (temp
, call_dest
), insn
);
1792 PATTERN (insn
) = replace_rtx (PATTERN (insn
),
1796 if (GET_CODE (insn
) == CALL_INSN
1797 && GET_CODE (PATTERN (insn
)) == SET
)
1798 call_dest
= SET_DEST (PATTERN (insn
));
1799 else if (GET_CODE (insn
) == CALL_INSN
1800 && GET_CODE (PATTERN (insn
)) == PARALLEL
1801 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == SET
)
1802 call_dest
= SET_DEST (XVECEXP (PATTERN (insn
), 0, 0));
1807 /* See if we have to do anything to INSN now that VAR is in
1808 memory. If it needs to be loaded into a pseudo, use a single
1809 pseudo for the entire insn in case there is a MATCH_DUP
1810 between two operands. We pass a pointer to the head of
1811 a list of struct fixup_replacements. If fixup_var_refs_1
1812 needs to allocate pseudos or replacement MEMs (for SUBREGs),
1813 it will record them in this list.
1815 If it allocated a pseudo for any replacement, we copy into
1818 fixup_var_refs_1 (var
, promoted_mode
, &PATTERN (insn
), insn
,
1821 /* If this is last_parm_insn, and any instructions were output
1822 after it to fix it up, then we must set last_parm_insn to
1823 the last such instruction emitted. */
1824 if (insn
== last_parm_insn
)
1825 last_parm_insn
= PREV_INSN (next_insn
);
1827 while (replacements
)
1829 struct fixup_replacement
*next
;
1831 if (GET_CODE (replacements
->new) == REG
)
1836 /* OLD might be a (subreg (mem)). */
1837 if (GET_CODE (replacements
->old
) == SUBREG
)
1839 = fixup_memory_subreg (replacements
->old
, insn
, 0);
1842 = fixup_stack_1 (replacements
->old
, insn
);
1844 insert_before
= insn
;
1846 /* If we are changing the mode, do a conversion.
1847 This might be wasteful, but combine.c will
1848 eliminate much of the waste. */
1850 if (GET_MODE (replacements
->new)
1851 != GET_MODE (replacements
->old
))
1854 convert_move (replacements
->new,
1855 replacements
->old
, unsignedp
);
1856 seq
= gen_sequence ();
1860 seq
= gen_move_insn (replacements
->new,
1863 emit_insn_before (seq
, insert_before
);
1866 next
= replacements
->next
;
1867 free (replacements
);
1868 replacements
= next
;
1872 /* Also fix up any invalid exprs in the REG_NOTES of this insn.
1873 But don't touch other insns referred to by reg-notes;
1874 we will get them elsewhere. */
1877 if (GET_CODE (note
) != INSN_LIST
)
1879 = walk_fixup_memory_subreg (XEXP (note
, 0), insn
, 1);
1880 note
= XEXP (note
, 1);
1884 /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
1885 See if the rtx expression at *LOC in INSN needs to be changed.
1887 REPLACEMENTS is a pointer to a list head that starts out zero, but may
1888 contain a list of original rtx's and replacements. If we find that we need
1889 to modify this insn by replacing a memory reference with a pseudo or by
1890 making a new MEM to implement a SUBREG, we consult that list to see if
1891 we have already chosen a replacement. If none has already been allocated,
1892 we allocate it and update the list. fixup_var_refs_insn will copy VAR
1893 or the SUBREG, as appropriate, to the pseudo. */
1896 fixup_var_refs_1 (var
, promoted_mode
, loc
, insn
, replacements
)
1898 enum machine_mode promoted_mode
;
1901 struct fixup_replacement
**replacements
;
1904 register rtx x
= *loc
;
1905 RTX_CODE code
= GET_CODE (x
);
1906 register const char *fmt
;
1907 register rtx tem
, tem1
;
1908 struct fixup_replacement
*replacement
;
1913 if (XEXP (x
, 0) == var
)
1915 /* Prevent sharing of rtl that might lose. */
1916 rtx sub
= copy_rtx (XEXP (var
, 0));
1918 if (! validate_change (insn
, loc
, sub
, 0))
1920 rtx y
= gen_reg_rtx (GET_MODE (sub
));
1923 /* We should be able to replace with a register or all is lost.
1924 Note that we can't use validate_change to verify this, since
1925 we're not caring for replacing all dups simultaneously. */
1926 if (! validate_replace_rtx (*loc
, y
, insn
))
1929 /* Careful! First try to recognize a direct move of the
1930 value, mimicking how things are done in gen_reload wrt
1931 PLUS. Consider what happens when insn is a conditional
1932 move instruction and addsi3 clobbers flags. */
1935 new_insn
= emit_insn (gen_rtx_SET (VOIDmode
, y
, sub
));
1936 seq
= gen_sequence ();
1939 if (recog_memoized (new_insn
) < 0)
1941 /* That failed. Fall back on force_operand and hope. */
1944 sub
= force_operand (sub
, y
);
1946 emit_insn (gen_move_insn (y
, sub
));
1947 seq
= gen_sequence ();
1952 /* Don't separate setter from user. */
1953 if (PREV_INSN (insn
) && sets_cc0_p (PREV_INSN (insn
)))
1954 insn
= PREV_INSN (insn
);
1957 emit_insn_before (seq
, insn
);
1965 /* If we already have a replacement, use it. Otherwise,
1966 try to fix up this address in case it is invalid. */
1968 replacement
= find_fixup_replacement (replacements
, var
);
1969 if (replacement
->new)
1971 *loc
= replacement
->new;
1975 *loc
= replacement
->new = x
= fixup_stack_1 (x
, insn
);
1977 /* Unless we are forcing memory to register or we changed the mode,
1978 we can leave things the way they are if the insn is valid. */
1980 INSN_CODE (insn
) = -1;
1981 if (! flag_force_mem
&& GET_MODE (x
) == promoted_mode
1982 && recog_memoized (insn
) >= 0)
1985 *loc
= replacement
->new = gen_reg_rtx (promoted_mode
);
1989 /* If X contains VAR, we need to unshare it here so that we update
1990 each occurrence separately. But all identical MEMs in one insn
1991 must be replaced with the same rtx because of the possibility of
1994 if (reg_mentioned_p (var
, x
))
1996 replacement
= find_fixup_replacement (replacements
, x
);
1997 if (replacement
->new == 0)
1998 replacement
->new = copy_most_rtx (x
, var
);
2000 *loc
= x
= replacement
->new;
2001 code
= GET_CODE (x
);
2017 /* Note that in some cases those types of expressions are altered
2018 by optimize_bit_field, and do not survive to get here. */
2019 if (XEXP (x
, 0) == var
2020 || (GET_CODE (XEXP (x
, 0)) == SUBREG
2021 && SUBREG_REG (XEXP (x
, 0)) == var
))
2023 /* Get TEM as a valid MEM in the mode presently in the insn.
2025 We don't worry about the possibility of MATCH_DUP here; it
2026 is highly unlikely and would be tricky to handle. */
2029 if (GET_CODE (tem
) == SUBREG
)
2031 if (GET_MODE_BITSIZE (GET_MODE (tem
))
2032 > GET_MODE_BITSIZE (GET_MODE (var
)))
2034 replacement
= find_fixup_replacement (replacements
, var
);
2035 if (replacement
->new == 0)
2036 replacement
->new = gen_reg_rtx (GET_MODE (var
));
2037 SUBREG_REG (tem
) = replacement
->new;
2039 /* The following code works only if we have a MEM, so we
2040 need to handle the subreg here. We directly substitute
2041 it assuming that a subreg must be OK here. We already
2042 scheduled a replacement to copy the mem into the
2048 tem
= fixup_memory_subreg (tem
, insn
, 0);
2051 tem
= fixup_stack_1 (tem
, insn
);
2053 /* Unless we want to load from memory, get TEM into the proper mode
2054 for an extract from memory. This can only be done if the
2055 extract is at a constant position and length. */
2057 if (! flag_force_mem
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
2058 && GET_CODE (XEXP (x
, 2)) == CONST_INT
2059 && ! mode_dependent_address_p (XEXP (tem
, 0))
2060 && ! MEM_VOLATILE_P (tem
))
2062 enum machine_mode wanted_mode
= VOIDmode
;
2063 enum machine_mode is_mode
= GET_MODE (tem
);
2064 HOST_WIDE_INT pos
= INTVAL (XEXP (x
, 2));
2066 if (GET_CODE (x
) == ZERO_EXTRACT
)
2068 enum machine_mode new_mode
2069 = mode_for_extraction (EP_extzv
, 1);
2070 if (new_mode
!= MAX_MACHINE_MODE
)
2071 wanted_mode
= new_mode
;
2073 else if (GET_CODE (x
) == SIGN_EXTRACT
)
2075 enum machine_mode new_mode
2076 = mode_for_extraction (EP_extv
, 1);
2077 if (new_mode
!= MAX_MACHINE_MODE
)
2078 wanted_mode
= new_mode
;
2081 /* If we have a narrower mode, we can do something. */
2082 if (wanted_mode
!= VOIDmode
2083 && GET_MODE_SIZE (wanted_mode
) < GET_MODE_SIZE (is_mode
))
2085 HOST_WIDE_INT offset
= pos
/ BITS_PER_UNIT
;
2086 rtx old_pos
= XEXP (x
, 2);
2089 /* If the bytes and bits are counted differently, we
2090 must adjust the offset. */
2091 if (BYTES_BIG_ENDIAN
!= BITS_BIG_ENDIAN
)
2092 offset
= (GET_MODE_SIZE (is_mode
)
2093 - GET_MODE_SIZE (wanted_mode
) - offset
);
2095 pos
%= GET_MODE_BITSIZE (wanted_mode
);
2097 newmem
= adjust_address_nv (tem
, wanted_mode
, offset
);
2099 /* Make the change and see if the insn remains valid. */
2100 INSN_CODE (insn
) = -1;
2101 XEXP (x
, 0) = newmem
;
2102 XEXP (x
, 2) = GEN_INT (pos
);
2104 if (recog_memoized (insn
) >= 0)
2107 /* Otherwise, restore old position. XEXP (x, 0) will be
2109 XEXP (x
, 2) = old_pos
;
2113 /* If we get here, the bitfield extract insn can't accept a memory
2114 reference. Copy the input into a register. */
2116 tem1
= gen_reg_rtx (GET_MODE (tem
));
2117 emit_insn_before (gen_move_insn (tem1
, tem
), insn
);
2124 if (SUBREG_REG (x
) == var
)
2126 /* If this is a special SUBREG made because VAR was promoted
2127 from a wider mode, replace it with VAR and call ourself
2128 recursively, this time saying that the object previously
2129 had its current mode (by virtue of the SUBREG). */
2131 if (SUBREG_PROMOTED_VAR_P (x
))
2134 fixup_var_refs_1 (var
, GET_MODE (var
), loc
, insn
, replacements
);
2138 /* If this SUBREG makes VAR wider, it has become a paradoxical
2139 SUBREG with VAR in memory, but these aren't allowed at this
2140 stage of the compilation. So load VAR into a pseudo and take
2141 a SUBREG of that pseudo. */
2142 if (GET_MODE_SIZE (GET_MODE (x
)) > GET_MODE_SIZE (GET_MODE (var
)))
2144 replacement
= find_fixup_replacement (replacements
, var
);
2145 if (replacement
->new == 0)
2146 replacement
->new = gen_reg_rtx (promoted_mode
);
2147 SUBREG_REG (x
) = replacement
->new;
2151 /* See if we have already found a replacement for this SUBREG.
2152 If so, use it. Otherwise, make a MEM and see if the insn
2153 is recognized. If not, or if we should force MEM into a register,
2154 make a pseudo for this SUBREG. */
2155 replacement
= find_fixup_replacement (replacements
, x
);
2156 if (replacement
->new)
2158 *loc
= replacement
->new;
2162 replacement
->new = *loc
= fixup_memory_subreg (x
, insn
, 0);
2164 INSN_CODE (insn
) = -1;
2165 if (! flag_force_mem
&& recog_memoized (insn
) >= 0)
2168 *loc
= replacement
->new = gen_reg_rtx (GET_MODE (x
));
2174 /* First do special simplification of bit-field references. */
2175 if (GET_CODE (SET_DEST (x
)) == SIGN_EXTRACT
2176 || GET_CODE (SET_DEST (x
)) == ZERO_EXTRACT
)
2177 optimize_bit_field (x
, insn
, 0);
2178 if (GET_CODE (SET_SRC (x
)) == SIGN_EXTRACT
2179 || GET_CODE (SET_SRC (x
)) == ZERO_EXTRACT
)
2180 optimize_bit_field (x
, insn
, 0);
2182 /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object
2183 into a register and then store it back out. */
2184 if (GET_CODE (SET_DEST (x
)) == ZERO_EXTRACT
2185 && GET_CODE (XEXP (SET_DEST (x
), 0)) == SUBREG
2186 && SUBREG_REG (XEXP (SET_DEST (x
), 0)) == var
2187 && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x
), 0)))
2188 > GET_MODE_SIZE (GET_MODE (var
))))
2190 replacement
= find_fixup_replacement (replacements
, var
);
2191 if (replacement
->new == 0)
2192 replacement
->new = gen_reg_rtx (GET_MODE (var
));
2194 SUBREG_REG (XEXP (SET_DEST (x
), 0)) = replacement
->new;
2195 emit_insn_after (gen_move_insn (var
, replacement
->new), insn
);
2198 /* If SET_DEST is now a paradoxical SUBREG, put the result of this
2199 insn into a pseudo and store the low part of the pseudo into VAR. */
2200 if (GET_CODE (SET_DEST (x
)) == SUBREG
2201 && SUBREG_REG (SET_DEST (x
)) == var
2202 && (GET_MODE_SIZE (GET_MODE (SET_DEST (x
)))
2203 > GET_MODE_SIZE (GET_MODE (var
))))
2205 SET_DEST (x
) = tem
= gen_reg_rtx (GET_MODE (SET_DEST (x
)));
2206 emit_insn_after (gen_move_insn (var
, gen_lowpart (GET_MODE (var
),
2213 rtx dest
= SET_DEST (x
);
2214 rtx src
= SET_SRC (x
);
2215 rtx outerdest
= dest
;
2217 while (GET_CODE (dest
) == SUBREG
|| GET_CODE (dest
) == STRICT_LOW_PART
2218 || GET_CODE (dest
) == SIGN_EXTRACT
2219 || GET_CODE (dest
) == ZERO_EXTRACT
)
2220 dest
= XEXP (dest
, 0);
2222 if (GET_CODE (src
) == SUBREG
)
2223 src
= SUBREG_REG (src
);
2225 /* If VAR does not appear at the top level of the SET
2226 just scan the lower levels of the tree. */
2228 if (src
!= var
&& dest
!= var
)
2231 /* We will need to rerecognize this insn. */
2232 INSN_CODE (insn
) = -1;
2234 if (GET_CODE (outerdest
) == ZERO_EXTRACT
&& dest
== var
2235 && mode_for_extraction (EP_insv
, -1) != MAX_MACHINE_MODE
)
2237 /* Since this case will return, ensure we fixup all the
2239 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (outerdest
, 1),
2240 insn
, replacements
);
2241 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (outerdest
, 2),
2242 insn
, replacements
);
2243 fixup_var_refs_1 (var
, promoted_mode
, &SET_SRC (x
),
2244 insn
, replacements
);
2246 tem
= XEXP (outerdest
, 0);
2248 /* Clean up (SUBREG:SI (MEM:mode ...) 0)
2249 that may appear inside a ZERO_EXTRACT.
2250 This was legitimate when the MEM was a REG. */
2251 if (GET_CODE (tem
) == SUBREG
2252 && SUBREG_REG (tem
) == var
)
2253 tem
= fixup_memory_subreg (tem
, insn
, 0);
2255 tem
= fixup_stack_1 (tem
, insn
);
2257 if (GET_CODE (XEXP (outerdest
, 1)) == CONST_INT
2258 && GET_CODE (XEXP (outerdest
, 2)) == CONST_INT
2259 && ! mode_dependent_address_p (XEXP (tem
, 0))
2260 && ! MEM_VOLATILE_P (tem
))
2262 enum machine_mode wanted_mode
;
2263 enum machine_mode is_mode
= GET_MODE (tem
);
2264 HOST_WIDE_INT pos
= INTVAL (XEXP (outerdest
, 2));
2266 wanted_mode
= mode_for_extraction (EP_insv
, 0);
2268 /* If we have a narrower mode, we can do something. */
2269 if (GET_MODE_SIZE (wanted_mode
) < GET_MODE_SIZE (is_mode
))
2271 HOST_WIDE_INT offset
= pos
/ BITS_PER_UNIT
;
2272 rtx old_pos
= XEXP (outerdest
, 2);
2275 if (BYTES_BIG_ENDIAN
!= BITS_BIG_ENDIAN
)
2276 offset
= (GET_MODE_SIZE (is_mode
)
2277 - GET_MODE_SIZE (wanted_mode
) - offset
);
2279 pos
%= GET_MODE_BITSIZE (wanted_mode
);
2281 newmem
= adjust_address_nv (tem
, wanted_mode
, offset
);
2283 /* Make the change and see if the insn remains valid. */
2284 INSN_CODE (insn
) = -1;
2285 XEXP (outerdest
, 0) = newmem
;
2286 XEXP (outerdest
, 2) = GEN_INT (pos
);
2288 if (recog_memoized (insn
) >= 0)
2291 /* Otherwise, restore old position. XEXP (x, 0) will be
2293 XEXP (outerdest
, 2) = old_pos
;
2297 /* If we get here, the bit-field store doesn't allow memory
2298 or isn't located at a constant position. Load the value into
2299 a register, do the store, and put it back into memory. */
2301 tem1
= gen_reg_rtx (GET_MODE (tem
));
2302 emit_insn_before (gen_move_insn (tem1
, tem
), insn
);
2303 emit_insn_after (gen_move_insn (tem
, tem1
), insn
);
2304 XEXP (outerdest
, 0) = tem1
;
2308 /* STRICT_LOW_PART is a no-op on memory references
2309 and it can cause combinations to be unrecognizable,
2312 if (dest
== var
&& GET_CODE (SET_DEST (x
)) == STRICT_LOW_PART
)
2313 SET_DEST (x
) = XEXP (SET_DEST (x
), 0);
2315 /* A valid insn to copy VAR into or out of a register
2316 must be left alone, to avoid an infinite loop here.
2317 If the reference to VAR is by a subreg, fix that up,
2318 since SUBREG is not valid for a memref.
2319 Also fix up the address of the stack slot.
2321 Note that we must not try to recognize the insn until
2322 after we know that we have valid addresses and no
2323 (subreg (mem ...) ...) constructs, since these interfere
2324 with determining the validity of the insn. */
2326 if ((SET_SRC (x
) == var
2327 || (GET_CODE (SET_SRC (x
)) == SUBREG
2328 && SUBREG_REG (SET_SRC (x
)) == var
))
2329 && (GET_CODE (SET_DEST (x
)) == REG
2330 || (GET_CODE (SET_DEST (x
)) == SUBREG
2331 && GET_CODE (SUBREG_REG (SET_DEST (x
))) == REG
))
2332 && GET_MODE (var
) == promoted_mode
2333 && x
== single_set (insn
))
2337 replacement
= find_fixup_replacement (replacements
, SET_SRC (x
));
2338 if (replacement
->new)
2339 SET_SRC (x
) = replacement
->new;
2340 else if (GET_CODE (SET_SRC (x
)) == SUBREG
)
2341 SET_SRC (x
) = replacement
->new
2342 = fixup_memory_subreg (SET_SRC (x
), insn
, 0);
2344 SET_SRC (x
) = replacement
->new
2345 = fixup_stack_1 (SET_SRC (x
), insn
);
2347 if (recog_memoized (insn
) >= 0)
2350 /* INSN is not valid, but we know that we want to
2351 copy SET_SRC (x) to SET_DEST (x) in some way. So
2352 we generate the move and see whether it requires more
2353 than one insn. If it does, we emit those insns and
2354 delete INSN. Otherwise, we an just replace the pattern
2355 of INSN; we have already verified above that INSN has
2356 no other function that to do X. */
2358 pat
= gen_move_insn (SET_DEST (x
), SET_SRC (x
));
2359 if (GET_CODE (pat
) == SEQUENCE
)
2361 last
= emit_insn_before (pat
, insn
);
2363 /* INSN might have REG_RETVAL or other important notes, so
2364 we need to store the pattern of the last insn in the
2365 sequence into INSN similarly to the normal case. LAST
2366 should not have REG_NOTES, but we allow them if INSN has
2368 if (REG_NOTES (last
) && REG_NOTES (insn
))
2370 if (REG_NOTES (last
))
2371 REG_NOTES (insn
) = REG_NOTES (last
);
2372 PATTERN (insn
) = PATTERN (last
);
2374 PUT_CODE (last
, NOTE
);
2375 NOTE_LINE_NUMBER (last
) = NOTE_INSN_DELETED
;
2376 NOTE_SOURCE_FILE (last
) = 0;
2379 PATTERN (insn
) = pat
;
2384 if ((SET_DEST (x
) == var
2385 || (GET_CODE (SET_DEST (x
)) == SUBREG
2386 && SUBREG_REG (SET_DEST (x
)) == var
))
2387 && (GET_CODE (SET_SRC (x
)) == REG
2388 || (GET_CODE (SET_SRC (x
)) == SUBREG
2389 && GET_CODE (SUBREG_REG (SET_SRC (x
))) == REG
))
2390 && GET_MODE (var
) == promoted_mode
2391 && x
== single_set (insn
))
2395 if (GET_CODE (SET_DEST (x
)) == SUBREG
)
2396 SET_DEST (x
) = fixup_memory_subreg (SET_DEST (x
), insn
, 0);
2398 SET_DEST (x
) = fixup_stack_1 (SET_DEST (x
), insn
);
2400 if (recog_memoized (insn
) >= 0)
2403 pat
= gen_move_insn (SET_DEST (x
), SET_SRC (x
));
2404 if (GET_CODE (pat
) == SEQUENCE
)
2406 last
= emit_insn_before (pat
, insn
);
2408 /* INSN might have REG_RETVAL or other important notes, so
2409 we need to store the pattern of the last insn in the
2410 sequence into INSN similarly to the normal case. LAST
2411 should not have REG_NOTES, but we allow them if INSN has
2413 if (REG_NOTES (last
) && REG_NOTES (insn
))
2415 if (REG_NOTES (last
))
2416 REG_NOTES (insn
) = REG_NOTES (last
);
2417 PATTERN (insn
) = PATTERN (last
);
2419 PUT_CODE (last
, NOTE
);
2420 NOTE_LINE_NUMBER (last
) = NOTE_INSN_DELETED
;
2421 NOTE_SOURCE_FILE (last
) = 0;
2424 PATTERN (insn
) = pat
;
2429 /* Otherwise, storing into VAR must be handled specially
2430 by storing into a temporary and copying that into VAR
2431 with a new insn after this one. Note that this case
2432 will be used when storing into a promoted scalar since
2433 the insn will now have different modes on the input
2434 and output and hence will be invalid (except for the case
2435 of setting it to a constant, which does not need any
2436 change if it is valid). We generate extra code in that case,
2437 but combine.c will eliminate it. */
2442 rtx fixeddest
= SET_DEST (x
);
2444 /* STRICT_LOW_PART can be discarded, around a MEM. */
2445 if (GET_CODE (fixeddest
) == STRICT_LOW_PART
)
2446 fixeddest
= XEXP (fixeddest
, 0);
2447 /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */
2448 if (GET_CODE (fixeddest
) == SUBREG
)
2450 fixeddest
= fixup_memory_subreg (fixeddest
, insn
, 0);
2451 promoted_mode
= GET_MODE (fixeddest
);
2454 fixeddest
= fixup_stack_1 (fixeddest
, insn
);
2456 temp
= gen_reg_rtx (promoted_mode
);
2458 emit_insn_after (gen_move_insn (fixeddest
,
2459 gen_lowpart (GET_MODE (fixeddest
),
2463 SET_DEST (x
) = temp
;
2471 /* Nothing special about this RTX; fix its operands. */
2473 fmt
= GET_RTX_FORMAT (code
);
2474 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2477 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (x
, i
), insn
, replacements
);
2478 else if (fmt
[i
] == 'E')
2481 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2482 fixup_var_refs_1 (var
, promoted_mode
, &XVECEXP (x
, i
, j
),
2483 insn
, replacements
);
2488 /* Given X, an rtx of the form (SUBREG:m1 (MEM:m2 addr)),
2489 return an rtx (MEM:m1 newaddr) which is equivalent.
2490 If any insns must be emitted to compute NEWADDR, put them before INSN.
2492 UNCRITICAL nonzero means accept paradoxical subregs.
2493 This is used for subregs found inside REG_NOTES. */
2496 fixup_memory_subreg (x
, insn
, uncritical
)
2501 int offset
= SUBREG_BYTE (x
);
2502 rtx addr
= XEXP (SUBREG_REG (x
), 0);
2503 enum machine_mode mode
= GET_MODE (x
);
2506 /* Paradoxical SUBREGs are usually invalid during RTL generation. */
2507 if (GET_MODE_SIZE (mode
) > GET_MODE_SIZE (GET_MODE (SUBREG_REG (x
)))
2511 if (!flag_force_addr
2512 && memory_address_p (mode
, plus_constant (addr
, offset
)))
2513 /* Shortcut if no insns need be emitted. */
2514 return adjust_address (SUBREG_REG (x
), mode
, offset
);
2517 result
= adjust_address (SUBREG_REG (x
), mode
, offset
);
2518 emit_insn_before (gen_sequence (), insn
);
2523 /* Do fixup_memory_subreg on all (SUBREG (MEM ...) ...) contained in X.
2524 Replace subexpressions of X in place.
2525 If X itself is a (SUBREG (MEM ...) ...), return the replacement expression.
2526 Otherwise return X, with its contents possibly altered.
2528 If any insns must be emitted to compute NEWADDR, put them before INSN.
2530 UNCRITICAL is as in fixup_memory_subreg. */
2533 walk_fixup_memory_subreg (x
, insn
, uncritical
)
2538 register enum rtx_code code
;
2539 register const char *fmt
;
2545 code
= GET_CODE (x
);
2547 if (code
== SUBREG
&& GET_CODE (SUBREG_REG (x
)) == MEM
)
2548 return fixup_memory_subreg (x
, insn
, uncritical
);
2550 /* Nothing special about this RTX; fix its operands. */
2552 fmt
= GET_RTX_FORMAT (code
);
2553 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2556 XEXP (x
, i
) = walk_fixup_memory_subreg (XEXP (x
, i
), insn
, uncritical
);
2557 else if (fmt
[i
] == 'E')
2560 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2562 = walk_fixup_memory_subreg (XVECEXP (x
, i
, j
), insn
, uncritical
);
2568 /* For each memory ref within X, if it refers to a stack slot
2569 with an out of range displacement, put the address in a temp register
2570 (emitting new insns before INSN to load these registers)
2571 and alter the memory ref to use that register.
2572 Replace each such MEM rtx with a copy, to avoid clobberage. */
2575 fixup_stack_1 (x
, insn
)
2580 register RTX_CODE code
= GET_CODE (x
);
2581 register const char *fmt
;
2585 register rtx ad
= XEXP (x
, 0);
2586 /* If we have address of a stack slot but it's not valid
2587 (displacement is too large), compute the sum in a register. */
2588 if (GET_CODE (ad
) == PLUS
2589 && GET_CODE (XEXP (ad
, 0)) == REG
2590 && ((REGNO (XEXP (ad
, 0)) >= FIRST_VIRTUAL_REGISTER
2591 && REGNO (XEXP (ad
, 0)) <= LAST_VIRTUAL_REGISTER
)
2592 || REGNO (XEXP (ad
, 0)) == FRAME_POINTER_REGNUM
2593 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2594 || REGNO (XEXP (ad
, 0)) == HARD_FRAME_POINTER_REGNUM
2596 || REGNO (XEXP (ad
, 0)) == STACK_POINTER_REGNUM
2597 || REGNO (XEXP (ad
, 0)) == ARG_POINTER_REGNUM
2598 || XEXP (ad
, 0) == current_function_internal_arg_pointer
)
2599 && GET_CODE (XEXP (ad
, 1)) == CONST_INT
)
2602 if (memory_address_p (GET_MODE (x
), ad
))
2606 temp
= copy_to_reg (ad
);
2607 seq
= gen_sequence ();
2609 emit_insn_before (seq
, insn
);
2610 return replace_equiv_address (x
, temp
);
2615 fmt
= GET_RTX_FORMAT (code
);
2616 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2619 XEXP (x
, i
) = fixup_stack_1 (XEXP (x
, i
), insn
);
2620 else if (fmt
[i
] == 'E')
2623 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2624 XVECEXP (x
, i
, j
) = fixup_stack_1 (XVECEXP (x
, i
, j
), insn
);
2630 /* Optimization: a bit-field instruction whose field
2631 happens to be a byte or halfword in memory
2632 can be changed to a move instruction.
2634 We call here when INSN is an insn to examine or store into a bit-field.
2635 BODY is the SET-rtx to be altered.
2637 EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0.
2638 (Currently this is called only from function.c, and EQUIV_MEM
2642 optimize_bit_field (body
, insn
, equiv_mem
)
2647 register rtx bitfield
;
2650 enum machine_mode mode
;
2652 if (GET_CODE (SET_DEST (body
)) == SIGN_EXTRACT
2653 || GET_CODE (SET_DEST (body
)) == ZERO_EXTRACT
)
2654 bitfield
= SET_DEST (body
), destflag
= 1;
2656 bitfield
= SET_SRC (body
), destflag
= 0;
2658 /* First check that the field being stored has constant size and position
2659 and is in fact a byte or halfword suitably aligned. */
2661 if (GET_CODE (XEXP (bitfield
, 1)) == CONST_INT
2662 && GET_CODE (XEXP (bitfield
, 2)) == CONST_INT
2663 && ((mode
= mode_for_size (INTVAL (XEXP (bitfield
, 1)), MODE_INT
, 1))
2665 && INTVAL (XEXP (bitfield
, 2)) % INTVAL (XEXP (bitfield
, 1)) == 0)
2667 register rtx memref
= 0;
2669 /* Now check that the containing word is memory, not a register,
2670 and that it is safe to change the machine mode. */
2672 if (GET_CODE (XEXP (bitfield
, 0)) == MEM
)
2673 memref
= XEXP (bitfield
, 0);
2674 else if (GET_CODE (XEXP (bitfield
, 0)) == REG
2676 memref
= equiv_mem
[REGNO (XEXP (bitfield
, 0))];
2677 else if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
2678 && GET_CODE (SUBREG_REG (XEXP (bitfield
, 0))) == MEM
)
2679 memref
= SUBREG_REG (XEXP (bitfield
, 0));
2680 else if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
2682 && GET_CODE (SUBREG_REG (XEXP (bitfield
, 0))) == REG
)
2683 memref
= equiv_mem
[REGNO (SUBREG_REG (XEXP (bitfield
, 0)))];
2686 && ! mode_dependent_address_p (XEXP (memref
, 0))
2687 && ! MEM_VOLATILE_P (memref
))
2689 /* Now adjust the address, first for any subreg'ing
2690 that we are now getting rid of,
2691 and then for which byte of the word is wanted. */
2693 HOST_WIDE_INT offset
= INTVAL (XEXP (bitfield
, 2));
2696 /* Adjust OFFSET to count bits from low-address byte. */
2697 if (BITS_BIG_ENDIAN
!= BYTES_BIG_ENDIAN
)
2698 offset
= (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield
, 0)))
2699 - offset
- INTVAL (XEXP (bitfield
, 1)));
2701 /* Adjust OFFSET to count bytes from low-address byte. */
2702 offset
/= BITS_PER_UNIT
;
2703 if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
)
2705 offset
+= (SUBREG_BYTE (XEXP (bitfield
, 0))
2706 / UNITS_PER_WORD
) * UNITS_PER_WORD
;
2707 if (BYTES_BIG_ENDIAN
)
2708 offset
-= (MIN (UNITS_PER_WORD
,
2709 GET_MODE_SIZE (GET_MODE (XEXP (bitfield
, 0))))
2710 - MIN (UNITS_PER_WORD
,
2711 GET_MODE_SIZE (GET_MODE (memref
))));
2715 memref
= adjust_address (memref
, mode
, offset
);
2716 insns
= get_insns ();
2718 emit_insns_before (insns
, insn
);
2720 /* Store this memory reference where
2721 we found the bit field reference. */
2725 validate_change (insn
, &SET_DEST (body
), memref
, 1);
2726 if (! CONSTANT_ADDRESS_P (SET_SRC (body
)))
2728 rtx src
= SET_SRC (body
);
2729 while (GET_CODE (src
) == SUBREG
2730 && SUBREG_BYTE (src
) == 0)
2731 src
= SUBREG_REG (src
);
2732 if (GET_MODE (src
) != GET_MODE (memref
))
2733 src
= gen_lowpart (GET_MODE (memref
), SET_SRC (body
));
2734 validate_change (insn
, &SET_SRC (body
), src
, 1);
2736 else if (GET_MODE (SET_SRC (body
)) != VOIDmode
2737 && GET_MODE (SET_SRC (body
)) != GET_MODE (memref
))
2738 /* This shouldn't happen because anything that didn't have
2739 one of these modes should have got converted explicitly
2740 and then referenced through a subreg.
2741 This is so because the original bit-field was
2742 handled by agg_mode and so its tree structure had
2743 the same mode that memref now has. */
2748 rtx dest
= SET_DEST (body
);
2750 while (GET_CODE (dest
) == SUBREG
2751 && SUBREG_BYTE (dest
) == 0
2752 && (GET_MODE_CLASS (GET_MODE (dest
))
2753 == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest
))))
2754 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
)))
2756 dest
= SUBREG_REG (dest
);
2758 validate_change (insn
, &SET_DEST (body
), dest
, 1);
2760 if (GET_MODE (dest
) == GET_MODE (memref
))
2761 validate_change (insn
, &SET_SRC (body
), memref
, 1);
2764 /* Convert the mem ref to the destination mode. */
2765 rtx newreg
= gen_reg_rtx (GET_MODE (dest
));
2768 convert_move (newreg
, memref
,
2769 GET_CODE (SET_SRC (body
)) == ZERO_EXTRACT
);
2773 validate_change (insn
, &SET_SRC (body
), newreg
, 1);
2777 /* See if we can convert this extraction or insertion into
2778 a simple move insn. We might not be able to do so if this
2779 was, for example, part of a PARALLEL.
2781 If we succeed, write out any needed conversions. If we fail,
2782 it is hard to guess why we failed, so don't do anything
2783 special; just let the optimization be suppressed. */
2785 if (apply_change_group () && seq
)
2786 emit_insns_before (seq
, insn
);
2791 /* These routines are responsible for converting virtual register references
2792 to the actual hard register references once RTL generation is complete.
2794 The following four variables are used for communication between the
2795 routines. They contain the offsets of the virtual registers from their
2796 respective hard registers. */
2798 static int in_arg_offset
;
2799 static int var_offset
;
2800 static int dynamic_offset
;
2801 static int out_arg_offset
;
2802 static int cfa_offset
;
2804 /* In most machines, the stack pointer register is equivalent to the bottom
2807 #ifndef STACK_POINTER_OFFSET
2808 #define STACK_POINTER_OFFSET 0
2811 /* If not defined, pick an appropriate default for the offset of dynamically
2812 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
2813 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
2815 #ifndef STACK_DYNAMIC_OFFSET
2817 /* The bottom of the stack points to the actual arguments. If
2818 REG_PARM_STACK_SPACE is defined, this includes the space for the register
2819 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
2820 stack space for register parameters is not pushed by the caller, but
2821 rather part of the fixed stack areas and hence not included in
2822 `current_function_outgoing_args_size'. Nevertheless, we must allow
2823 for it when allocating stack dynamic objects. */
2825 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2826 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2827 ((ACCUMULATE_OUTGOING_ARGS \
2828 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
2829 + (STACK_POINTER_OFFSET)) \
2832 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2833 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
2834 + (STACK_POINTER_OFFSET))
2838 /* On most machines, the CFA coincides with the first incoming parm. */
2840 #ifndef ARG_POINTER_CFA_OFFSET
2841 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
2844 /* Build up a (MEM (ADDRESSOF (REG))) rtx for a register REG that just had
2845 its address taken. DECL is the decl for the object stored in the
2846 register, for later use if we do need to force REG into the stack.
2847 REG is overwritten by the MEM like in put_reg_into_stack. */
2850 gen_mem_addressof (reg
, decl
)
2854 rtx r
= gen_rtx_ADDRESSOF (Pmode
, gen_reg_rtx (GET_MODE (reg
)),
2857 /* Calculate this before we start messing with decl's RTL. */
2858 HOST_WIDE_INT set
= decl
? get_alias_set (decl
) : 0;
2860 /* If the original REG was a user-variable, then so is the REG whose
2861 address is being taken. Likewise for unchanging. */
2862 REG_USERVAR_P (XEXP (r
, 0)) = REG_USERVAR_P (reg
);
2863 RTX_UNCHANGING_P (XEXP (r
, 0)) = RTX_UNCHANGING_P (reg
);
2865 PUT_CODE (reg
, MEM
);
2869 tree type
= TREE_TYPE (decl
);
2870 enum machine_mode decl_mode
2871 = (TREE_CODE (decl
) == SAVE_EXPR
? TYPE_MODE (TREE_TYPE (decl
))
2872 : DECL_MODE (decl
));
2874 PUT_MODE (reg
, decl_mode
);
2875 MEM_VOLATILE_P (reg
) = TREE_SIDE_EFFECTS (decl
);
2876 MEM_SET_IN_STRUCT_P (reg
, AGGREGATE_TYPE_P (type
));
2877 set_mem_alias_set (reg
, set
);
2879 if (TREE_USED (decl
) || DECL_INITIAL (decl
) != 0)
2880 fixup_var_refs (reg
, GET_MODE (reg
), TREE_UNSIGNED (type
), 0);
2884 /* We have no alias information about this newly created MEM. */
2885 set_mem_alias_set (reg
, 0);
2887 fixup_var_refs (reg
, GET_MODE (reg
), 0, 0);
2893 /* If DECL has an RTL that is an ADDRESSOF rtx, put it into the stack. */
2896 flush_addressof (decl
)
2899 if ((TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == VAR_DECL
)
2900 && DECL_RTL (decl
) != 0
2901 && GET_CODE (DECL_RTL (decl
)) == MEM
2902 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == ADDRESSOF
2903 && GET_CODE (XEXP (XEXP (DECL_RTL (decl
), 0), 0)) == REG
)
2904 put_addressof_into_stack (XEXP (DECL_RTL (decl
), 0), 0);
2907 /* Force the register pointed to by R, an ADDRESSOF rtx, into the stack. */
2910 put_addressof_into_stack (r
, ht
)
2912 struct hash_table
*ht
;
2915 int volatile_p
, used_p
;
2917 rtx reg
= XEXP (r
, 0);
2919 if (GET_CODE (reg
) != REG
)
2922 decl
= ADDRESSOF_DECL (r
);
2925 type
= TREE_TYPE (decl
);
2926 volatile_p
= (TREE_CODE (decl
) != SAVE_EXPR
2927 && TREE_THIS_VOLATILE (decl
));
2928 used_p
= (TREE_USED (decl
)
2929 || (TREE_CODE (decl
) != SAVE_EXPR
2930 && DECL_INITIAL (decl
) != 0));
2939 put_reg_into_stack (0, reg
, type
, GET_MODE (reg
), GET_MODE (reg
),
2940 volatile_p
, ADDRESSOF_REGNO (r
), used_p
, ht
);
2943 /* List of replacements made below in purge_addressof_1 when creating
2944 bitfield insertions. */
2945 static rtx purge_bitfield_addressof_replacements
;
2947 /* List of replacements made below in purge_addressof_1 for patterns
2948 (MEM (ADDRESSOF (REG ...))). The key of the list entry is the
2949 corresponding (ADDRESSOF (REG ...)) and value is a substitution for
2950 the all pattern. List PURGE_BITFIELD_ADDRESSOF_REPLACEMENTS is not
2951 enough in complex cases, e.g. when some field values can be
2952 extracted by usage MEM with narrower mode. */
2953 static rtx purge_addressof_replacements
;
2955 /* Helper function for purge_addressof. See if the rtx expression at *LOC
2956 in INSN needs to be changed. If FORCE, always put any ADDRESSOFs into
2957 the stack. If the function returns FALSE then the replacement could not
2961 purge_addressof_1 (loc
, insn
, force
, store
, ht
)
2965 struct hash_table
*ht
;
2973 /* Re-start here to avoid recursion in common cases. */
2980 code
= GET_CODE (x
);
2982 /* If we don't return in any of the cases below, we will recurse inside
2983 the RTX, which will normally result in any ADDRESSOF being forced into
2987 result
= purge_addressof_1 (&SET_DEST (x
), insn
, force
, 1, ht
);
2988 result
&= purge_addressof_1 (&SET_SRC (x
), insn
, force
, 0, ht
);
2991 else if (code
== ADDRESSOF
)
2995 if (GET_CODE (XEXP (x
, 0)) != MEM
)
2997 put_addressof_into_stack (x
, ht
);
3001 /* We must create a copy of the rtx because it was created by
3002 overwriting a REG rtx which is always shared. */
3003 sub
= copy_rtx (XEXP (XEXP (x
, 0), 0));
3004 if (validate_change (insn
, loc
, sub
, 0)
3005 || validate_replace_rtx (x
, sub
, insn
))
3009 sub
= force_operand (sub
, NULL_RTX
);
3010 if (! validate_change (insn
, loc
, sub
, 0)
3011 && ! validate_replace_rtx (x
, sub
, insn
))
3014 insns
= gen_sequence ();
3016 emit_insn_before (insns
, insn
);
3020 else if (code
== MEM
&& GET_CODE (XEXP (x
, 0)) == ADDRESSOF
&& ! force
)
3022 rtx sub
= XEXP (XEXP (x
, 0), 0);
3024 if (GET_CODE (sub
) == MEM
)
3025 sub
= adjust_address_nv (sub
, GET_MODE (x
), 0);
3026 else if (GET_CODE (sub
) == REG
3027 && (MEM_VOLATILE_P (x
) || GET_MODE (x
) == BLKmode
))
3029 else if (GET_CODE (sub
) == REG
&& GET_MODE (x
) != GET_MODE (sub
))
3031 int size_x
, size_sub
;
3035 /* When processing REG_NOTES look at the list of
3036 replacements done on the insn to find the register that X
3040 for (tem
= purge_bitfield_addressof_replacements
;
3042 tem
= XEXP (XEXP (tem
, 1), 1))
3043 if (rtx_equal_p (x
, XEXP (tem
, 0)))
3045 *loc
= XEXP (XEXP (tem
, 1), 0);
3049 /* See comment for purge_addressof_replacements. */
3050 for (tem
= purge_addressof_replacements
;
3052 tem
= XEXP (XEXP (tem
, 1), 1))
3053 if (rtx_equal_p (XEXP (x
, 0), XEXP (tem
, 0)))
3055 rtx z
= XEXP (XEXP (tem
, 1), 0);
3057 if (GET_MODE (x
) == GET_MODE (z
)
3058 || (GET_CODE (XEXP (XEXP (tem
, 1), 0)) != REG
3059 && GET_CODE (XEXP (XEXP (tem
, 1), 0)) != SUBREG
))
3062 /* It can happen that the note may speak of things
3063 in a wider (or just different) mode than the
3064 code did. This is especially true of
3067 if (GET_CODE (z
) == SUBREG
&& SUBREG_BYTE (z
) == 0)
3070 if (GET_MODE_SIZE (GET_MODE (x
)) > UNITS_PER_WORD
3071 && (GET_MODE_SIZE (GET_MODE (x
))
3072 > GET_MODE_SIZE (GET_MODE (z
))))
3074 /* This can occur as a result in invalid
3075 pointer casts, e.g. float f; ...
3076 *(long long int *)&f.
3077 ??? We could emit a warning here, but
3078 without a line number that wouldn't be
3080 z
= gen_rtx_SUBREG (GET_MODE (x
), z
, 0);
3083 z
= gen_lowpart (GET_MODE (x
), z
);
3089 /* Sometimes we may not be able to find the replacement. For
3090 example when the original insn was a MEM in a wider mode,
3091 and the note is part of a sign extension of a narrowed
3092 version of that MEM. Gcc testcase compile/990829-1.c can
3093 generate an example of this siutation. Rather than complain
3094 we return false, which will prompt our caller to remove the
3099 size_x
= GET_MODE_BITSIZE (GET_MODE (x
));
3100 size_sub
= GET_MODE_BITSIZE (GET_MODE (sub
));
3102 /* Don't even consider working with paradoxical subregs,
3103 or the moral equivalent seen here. */
3104 if (size_x
<= size_sub
3105 && int_mode_for_mode (GET_MODE (sub
)) != BLKmode
)
3107 /* Do a bitfield insertion to mirror what would happen
3114 rtx p
= PREV_INSN (insn
);
3117 val
= gen_reg_rtx (GET_MODE (x
));
3118 if (! validate_change (insn
, loc
, val
, 0))
3120 /* Discard the current sequence and put the
3121 ADDRESSOF on stack. */
3125 seq
= gen_sequence ();
3127 emit_insn_before (seq
, insn
);
3128 compute_insns_for_mem (p
? NEXT_INSN (p
) : get_insns (),
3132 store_bit_field (sub
, size_x
, 0, GET_MODE (x
),
3133 val
, GET_MODE_SIZE (GET_MODE (sub
)),
3134 GET_MODE_ALIGNMENT (GET_MODE (sub
)));
3136 /* Make sure to unshare any shared rtl that store_bit_field
3137 might have created. */
3138 unshare_all_rtl_again (get_insns ());
3140 seq
= gen_sequence ();
3142 p
= emit_insn_after (seq
, insn
);
3143 if (NEXT_INSN (insn
))
3144 compute_insns_for_mem (NEXT_INSN (insn
),
3145 p
? NEXT_INSN (p
) : NULL_RTX
,
3150 rtx p
= PREV_INSN (insn
);
3153 val
= extract_bit_field (sub
, size_x
, 0, 1, NULL_RTX
,
3154 GET_MODE (x
), GET_MODE (x
),
3155 GET_MODE_SIZE (GET_MODE (sub
)),
3156 GET_MODE_SIZE (GET_MODE (sub
)));
3158 if (! validate_change (insn
, loc
, val
, 0))
3160 /* Discard the current sequence and put the
3161 ADDRESSOF on stack. */
3166 seq
= gen_sequence ();
3168 emit_insn_before (seq
, insn
);
3169 compute_insns_for_mem (p
? NEXT_INSN (p
) : get_insns (),
3173 /* Remember the replacement so that the same one can be done
3174 on the REG_NOTES. */
3175 purge_bitfield_addressof_replacements
3176 = gen_rtx_EXPR_LIST (VOIDmode
, x
,
3179 purge_bitfield_addressof_replacements
));
3181 /* We replaced with a reg -- all done. */
3186 else if (validate_change (insn
, loc
, sub
, 0))
3188 /* Remember the replacement so that the same one can be done
3189 on the REG_NOTES. */
3190 if (GET_CODE (sub
) == REG
|| GET_CODE (sub
) == SUBREG
)
3194 for (tem
= purge_addressof_replacements
;
3196 tem
= XEXP (XEXP (tem
, 1), 1))
3197 if (rtx_equal_p (XEXP (x
, 0), XEXP (tem
, 0)))
3199 XEXP (XEXP (tem
, 1), 0) = sub
;
3202 purge_addressof_replacements
3203 = gen_rtx (EXPR_LIST
, VOIDmode
, XEXP (x
, 0),
3204 gen_rtx_EXPR_LIST (VOIDmode
, sub
,
3205 purge_addressof_replacements
));
3213 /* Scan all subexpressions. */
3214 fmt
= GET_RTX_FORMAT (code
);
3215 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
3218 result
&= purge_addressof_1 (&XEXP (x
, i
), insn
, force
, 0, ht
);
3219 else if (*fmt
== 'E')
3220 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3221 result
&= purge_addressof_1 (&XVECEXP (x
, i
, j
), insn
, force
, 0, ht
);
3227 /* Return a new hash table entry in HT. */
3229 static struct hash_entry
*
3230 insns_for_mem_newfunc (he
, ht
, k
)
3231 struct hash_entry
*he
;
3232 struct hash_table
*ht
;
3233 hash_table_key k ATTRIBUTE_UNUSED
;
3235 struct insns_for_mem_entry
*ifmhe
;
3239 ifmhe
= ((struct insns_for_mem_entry
*)
3240 hash_allocate (ht
, sizeof (struct insns_for_mem_entry
)));
3241 ifmhe
->insns
= NULL_RTX
;
3246 /* Return a hash value for K, a REG. */
3248 static unsigned long
3249 insns_for_mem_hash (k
)
3252 /* K is really a RTX. Just use the address as the hash value. */
3253 return (unsigned long) k
;
3256 /* Return non-zero if K1 and K2 (two REGs) are the same. */
3259 insns_for_mem_comp (k1
, k2
)
3266 struct insns_for_mem_walk_info
{
3267 /* The hash table that we are using to record which INSNs use which
3269 struct hash_table
*ht
;
3271 /* The INSN we are currently proessing. */
3274 /* Zero if we are walking to find ADDRESSOFs, one if we are walking
3275 to find the insns that use the REGs in the ADDRESSOFs. */
3279 /* Called from compute_insns_for_mem via for_each_rtx. If R is a REG
3280 that might be used in an ADDRESSOF expression, record this INSN in
3281 the hash table given by DATA (which is really a pointer to an
3282 insns_for_mem_walk_info structure). */
3285 insns_for_mem_walk (r
, data
)
3289 struct insns_for_mem_walk_info
*ifmwi
3290 = (struct insns_for_mem_walk_info
*) data
;
3292 if (ifmwi
->pass
== 0 && *r
&& GET_CODE (*r
) == ADDRESSOF
3293 && GET_CODE (XEXP (*r
, 0)) == REG
)
3294 hash_lookup (ifmwi
->ht
, XEXP (*r
, 0), /*create=*/1, /*copy=*/0);
3295 else if (ifmwi
->pass
== 1 && *r
&& GET_CODE (*r
) == REG
)
3297 /* Lookup this MEM in the hashtable, creating it if necessary. */
3298 struct insns_for_mem_entry
*ifme
3299 = (struct insns_for_mem_entry
*) hash_lookup (ifmwi
->ht
,
3304 /* If we have not already recorded this INSN, do so now. Since
3305 we process the INSNs in order, we know that if we have
3306 recorded it it must be at the front of the list. */
3307 if (ifme
&& (!ifme
->insns
|| XEXP (ifme
->insns
, 0) != ifmwi
->insn
))
3308 ifme
->insns
= gen_rtx_EXPR_LIST (VOIDmode
, ifmwi
->insn
,
3315 /* Walk the INSNS, until we reach LAST_INSN, recording which INSNs use
3316 which REGs in HT. */
3319 compute_insns_for_mem (insns
, last_insn
, ht
)
3322 struct hash_table
*ht
;
3325 struct insns_for_mem_walk_info ifmwi
;
3328 for (ifmwi
.pass
= 0; ifmwi
.pass
< 2; ++ifmwi
.pass
)
3329 for (insn
= insns
; insn
!= last_insn
; insn
= NEXT_INSN (insn
))
3333 for_each_rtx (&insn
, insns_for_mem_walk
, &ifmwi
);
3337 /* Helper function for purge_addressof called through for_each_rtx.
3338 Returns true iff the rtl is an ADDRESSOF. */
3341 is_addressof (rtl
, data
)
3343 void *data ATTRIBUTE_UNUSED
;
3345 return GET_CODE (*rtl
) == ADDRESSOF
;
3348 /* Eliminate all occurrences of ADDRESSOF from INSNS. Elide any remaining
3349 (MEM (ADDRESSOF)) patterns, and force any needed registers into the
3353 purge_addressof (insns
)
3357 struct hash_table ht
;
3359 /* When we actually purge ADDRESSOFs, we turn REGs into MEMs. That
3360 requires a fixup pass over the instruction stream to correct
3361 INSNs that depended on the REG being a REG, and not a MEM. But,
3362 these fixup passes are slow. Furthermore, most MEMs are not
3363 mentioned in very many instructions. So, we speed up the process
3364 by pre-calculating which REGs occur in which INSNs; that allows
3365 us to perform the fixup passes much more quickly. */
3366 hash_table_init (&ht
,
3367 insns_for_mem_newfunc
,
3369 insns_for_mem_comp
);
3370 compute_insns_for_mem (insns
, NULL_RTX
, &ht
);
3372 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
3373 if (GET_CODE (insn
) == INSN
|| GET_CODE (insn
) == JUMP_INSN
3374 || GET_CODE (insn
) == CALL_INSN
)
3376 if (! purge_addressof_1 (&PATTERN (insn
), insn
,
3377 asm_noperands (PATTERN (insn
)) > 0, 0, &ht
))
3378 /* If we could not replace the ADDRESSOFs in the insn,
3379 something is wrong. */
3382 if (! purge_addressof_1 (®_NOTES (insn
), NULL_RTX
, 0, 0, &ht
))
3384 /* If we could not replace the ADDRESSOFs in the insn's notes,
3385 we can just remove the offending notes instead. */
3388 for (note
= REG_NOTES (insn
); note
; note
= XEXP (note
, 1))
3390 /* If we find a REG_RETVAL note then the insn is a libcall.
3391 Such insns must have REG_EQUAL notes as well, in order
3392 for later passes of the compiler to work. So it is not
3393 safe to delete the notes here, and instead we abort. */
3394 if (REG_NOTE_KIND (note
) == REG_RETVAL
)
3396 if (for_each_rtx (¬e
, is_addressof
, NULL
))
3397 remove_note (insn
, note
);
3403 hash_table_free (&ht
);
3404 purge_bitfield_addressof_replacements
= 0;
3405 purge_addressof_replacements
= 0;
3407 /* REGs are shared. purge_addressof will destructively replace a REG
3408 with a MEM, which creates shared MEMs.
3410 Unfortunately, the children of put_reg_into_stack assume that MEMs
3411 referring to the same stack slot are shared (fixup_var_refs and
3412 the associated hash table code).
3414 So, we have to do another unsharing pass after we have flushed any
3415 REGs that had their address taken into the stack.
3417 It may be worth tracking whether or not we converted any REGs into
3418 MEMs to avoid this overhead when it is not needed. */
3419 unshare_all_rtl_again (get_insns ());
3422 /* Convert a SET of a hard subreg to a set of the appropriet hard
3423 register. A subroutine of purge_hard_subreg_sets. */
3426 purge_single_hard_subreg_set (pattern
)
3429 rtx reg
= SET_DEST (pattern
);
3430 enum machine_mode mode
= GET_MODE (SET_DEST (pattern
));
3433 if (GET_CODE (reg
) == SUBREG
&& GET_CODE (SUBREG_REG (reg
)) == REG
3434 && REGNO (SUBREG_REG (reg
)) < FIRST_PSEUDO_REGISTER
)
3436 offset
= subreg_regno_offset (REGNO (SUBREG_REG (reg
)),
3437 GET_MODE (SUBREG_REG (reg
)),
3440 reg
= SUBREG_REG (reg
);
3444 if (GET_CODE (reg
) == REG
&& REGNO (reg
) < FIRST_PSEUDO_REGISTER
)
3446 reg
= gen_rtx_REG (mode
, REGNO (reg
) + offset
);
3447 SET_DEST (pattern
) = reg
;
3451 /* Eliminate all occurrences of SETs of hard subregs from INSNS. The
3452 only such SETs that we expect to see are those left in because
3453 integrate can't handle sets of parts of a return value register.
3455 We don't use alter_subreg because we only want to eliminate subregs
3456 of hard registers. */
3459 purge_hard_subreg_sets (insn
)
3462 for (; insn
; insn
= NEXT_INSN (insn
))
3466 rtx pattern
= PATTERN (insn
);
3467 switch (GET_CODE (pattern
))
3470 if (GET_CODE (SET_DEST (pattern
)) == SUBREG
)
3471 purge_single_hard_subreg_set (pattern
);
3476 for (j
= XVECLEN (pattern
, 0) - 1; j
>= 0; j
--)
3478 rtx inner_pattern
= XVECEXP (pattern
, 0, j
);
3479 if (GET_CODE (inner_pattern
) == SET
3480 && GET_CODE (SET_DEST (inner_pattern
)) == SUBREG
)
3481 purge_single_hard_subreg_set (inner_pattern
);
3492 /* Pass through the INSNS of function FNDECL and convert virtual register
3493 references to hard register references. */
3496 instantiate_virtual_regs (fndecl
, insns
)
3503 /* Compute the offsets to use for this function. */
3504 in_arg_offset
= FIRST_PARM_OFFSET (fndecl
);
3505 var_offset
= STARTING_FRAME_OFFSET
;
3506 dynamic_offset
= STACK_DYNAMIC_OFFSET (fndecl
);
3507 out_arg_offset
= STACK_POINTER_OFFSET
;
3508 cfa_offset
= ARG_POINTER_CFA_OFFSET (fndecl
);
3510 /* Scan all variables and parameters of this function. For each that is
3511 in memory, instantiate all virtual registers if the result is a valid
3512 address. If not, we do it later. That will handle most uses of virtual
3513 regs on many machines. */
3514 instantiate_decls (fndecl
, 1);
3516 /* Initialize recognition, indicating that volatile is OK. */
3519 /* Scan through all the insns, instantiating every virtual register still
3521 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
3522 if (GET_CODE (insn
) == INSN
|| GET_CODE (insn
) == JUMP_INSN
3523 || GET_CODE (insn
) == CALL_INSN
)
3525 instantiate_virtual_regs_1 (&PATTERN (insn
), insn
, 1);
3526 instantiate_virtual_regs_1 (®_NOTES (insn
), NULL_RTX
, 0);
3527 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
3528 if (GET_CODE (insn
) == CALL_INSN
)
3529 instantiate_virtual_regs_1 (&CALL_INSN_FUNCTION_USAGE (insn
),
3533 /* Instantiate the stack slots for the parm registers, for later use in
3534 addressof elimination. */
3535 for (i
= 0; i
< max_parm_reg
; ++i
)
3536 if (parm_reg_stack_loc
[i
])
3537 instantiate_virtual_regs_1 (&parm_reg_stack_loc
[i
], NULL_RTX
, 0);
3539 /* Now instantiate the remaining register equivalences for debugging info.
3540 These will not be valid addresses. */
3541 instantiate_decls (fndecl
, 0);
3543 /* Indicate that, from now on, assign_stack_local should use
3544 frame_pointer_rtx. */
3545 virtuals_instantiated
= 1;
3548 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
3549 all virtual registers in their DECL_RTL's.
3551 If VALID_ONLY, do this only if the resulting address is still valid.
3552 Otherwise, always do it. */
3555 instantiate_decls (fndecl
, valid_only
)
3561 /* Process all parameters of the function. */
3562 for (decl
= DECL_ARGUMENTS (fndecl
); decl
; decl
= TREE_CHAIN (decl
))
3564 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (decl
));
3565 HOST_WIDE_INT size_rtl
;
3567 instantiate_decl (DECL_RTL (decl
), size
, valid_only
);
3569 /* If the parameter was promoted, then the incoming RTL mode may be
3570 larger than the declared type size. We must use the larger of
3572 size_rtl
= GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl
)));
3573 size
= MAX (size_rtl
, size
);
3574 instantiate_decl (DECL_INCOMING_RTL (decl
), size
, valid_only
);
3577 /* Now process all variables defined in the function or its subblocks. */
3578 instantiate_decls_1 (DECL_INITIAL (fndecl
), valid_only
);
3581 /* Subroutine of instantiate_decls: Process all decls in the given
3582 BLOCK node and all its subblocks. */
3585 instantiate_decls_1 (let
, valid_only
)
3591 for (t
= BLOCK_VARS (let
); t
; t
= TREE_CHAIN (t
))
3592 if (DECL_RTL_SET_P (t
))
3593 instantiate_decl (DECL_RTL (t
),
3594 int_size_in_bytes (TREE_TYPE (t
)),
3597 /* Process all subblocks. */
3598 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= TREE_CHAIN (t
))
3599 instantiate_decls_1 (t
, valid_only
);
3602 /* Subroutine of the preceding procedures: Given RTL representing a
3603 decl and the size of the object, do any instantiation required.
3605 If VALID_ONLY is non-zero, it means that the RTL should only be
3606 changed if the new address is valid. */
3609 instantiate_decl (x
, size
, valid_only
)
3614 enum machine_mode mode
;
3617 /* If this is not a MEM, no need to do anything. Similarly if the
3618 address is a constant or a register that is not a virtual register. */
3620 if (x
== 0 || GET_CODE (x
) != MEM
)
3624 if (CONSTANT_P (addr
)
3625 || (GET_CODE (addr
) == ADDRESSOF
&& GET_CODE (XEXP (addr
, 0)) == REG
)
3626 || (GET_CODE (addr
) == REG
3627 && (REGNO (addr
) < FIRST_VIRTUAL_REGISTER
3628 || REGNO (addr
) > LAST_VIRTUAL_REGISTER
)))
3631 /* If we should only do this if the address is valid, copy the address.
3632 We need to do this so we can undo any changes that might make the
3633 address invalid. This copy is unfortunate, but probably can't be
3637 addr
= copy_rtx (addr
);
3639 instantiate_virtual_regs_1 (&addr
, NULL_RTX
, 0);
3641 if (valid_only
&& size
>= 0)
3643 unsigned HOST_WIDE_INT decl_size
= size
;
3645 /* Now verify that the resulting address is valid for every integer or
3646 floating-point mode up to and including SIZE bytes long. We do this
3647 since the object might be accessed in any mode and frame addresses
3650 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
3651 mode
!= VOIDmode
&& GET_MODE_SIZE (mode
) <= decl_size
;
3652 mode
= GET_MODE_WIDER_MODE (mode
))
3653 if (! memory_address_p (mode
, addr
))
3656 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
);
3657 mode
!= VOIDmode
&& GET_MODE_SIZE (mode
) <= decl_size
;
3658 mode
= GET_MODE_WIDER_MODE (mode
))
3659 if (! memory_address_p (mode
, addr
))
3663 /* Put back the address now that we have updated it and we either know
3664 it is valid or we don't care whether it is valid. */
3669 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
3670 is a virtual register, return the requivalent hard register and set the
3671 offset indirectly through the pointer. Otherwise, return 0. */
3674 instantiate_new_reg (x
, poffset
)
3676 HOST_WIDE_INT
*poffset
;
3679 HOST_WIDE_INT offset
;
3681 if (x
== virtual_incoming_args_rtx
)
3682 new = arg_pointer_rtx
, offset
= in_arg_offset
;
3683 else if (x
== virtual_stack_vars_rtx
)
3684 new = frame_pointer_rtx
, offset
= var_offset
;
3685 else if (x
== virtual_stack_dynamic_rtx
)
3686 new = stack_pointer_rtx
, offset
= dynamic_offset
;
3687 else if (x
== virtual_outgoing_args_rtx
)
3688 new = stack_pointer_rtx
, offset
= out_arg_offset
;
3689 else if (x
== virtual_cfa_rtx
)
3690 new = arg_pointer_rtx
, offset
= cfa_offset
;
3698 /* Given a pointer to a piece of rtx and an optional pointer to the
3699 containing object, instantiate any virtual registers present in it.
3701 If EXTRA_INSNS, we always do the replacement and generate
3702 any extra insns before OBJECT. If it zero, we do nothing if replacement
3705 Return 1 if we either had nothing to do or if we were able to do the
3706 needed replacement. Return 0 otherwise; we only return zero if
3707 EXTRA_INSNS is zero.
3709 We first try some simple transformations to avoid the creation of extra
3713 instantiate_virtual_regs_1 (loc
, object
, extra_insns
)
3721 HOST_WIDE_INT offset
= 0;
3727 /* Re-start here to avoid recursion in common cases. */
3734 code
= GET_CODE (x
);
3736 /* Check for some special cases. */
3753 /* We are allowed to set the virtual registers. This means that
3754 the actual register should receive the source minus the
3755 appropriate offset. This is used, for example, in the handling
3756 of non-local gotos. */
3757 if ((new = instantiate_new_reg (SET_DEST (x
), &offset
)) != 0)
3759 rtx src
= SET_SRC (x
);
3761 /* We are setting the register, not using it, so the relevant
3762 offset is the negative of the offset to use were we using
3765 instantiate_virtual_regs_1 (&src
, NULL_RTX
, 0);
3767 /* The only valid sources here are PLUS or REG. Just do
3768 the simplest possible thing to handle them. */
3769 if (GET_CODE (src
) != REG
&& GET_CODE (src
) != PLUS
)
3773 if (GET_CODE (src
) != REG
)
3774 temp
= force_operand (src
, NULL_RTX
);
3777 temp
= force_operand (plus_constant (temp
, offset
), NULL_RTX
);
3781 emit_insns_before (seq
, object
);
3784 if (! validate_change (object
, &SET_SRC (x
), temp
, 0)
3791 instantiate_virtual_regs_1 (&SET_DEST (x
), object
, extra_insns
);
3796 /* Handle special case of virtual register plus constant. */
3797 if (CONSTANT_P (XEXP (x
, 1)))
3799 rtx old
, new_offset
;
3801 /* Check for (plus (plus VIRT foo) (const_int)) first. */
3802 if (GET_CODE (XEXP (x
, 0)) == PLUS
)
3804 if ((new = instantiate_new_reg (XEXP (XEXP (x
, 0), 0), &offset
)))
3806 instantiate_virtual_regs_1 (&XEXP (XEXP (x
, 0), 1), object
,
3808 new = gen_rtx_PLUS (Pmode
, new, XEXP (XEXP (x
, 0), 1));
3817 #ifdef POINTERS_EXTEND_UNSIGNED
3818 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
3819 we can commute the PLUS and SUBREG because pointers into the
3820 frame are well-behaved. */
3821 else if (GET_CODE (XEXP (x
, 0)) == SUBREG
&& GET_MODE (x
) == ptr_mode
3822 && GET_CODE (XEXP (x
, 1)) == CONST_INT
3824 = instantiate_new_reg (SUBREG_REG (XEXP (x
, 0)),
3826 && validate_change (object
, loc
,
3827 plus_constant (gen_lowpart (ptr_mode
,
3830 + INTVAL (XEXP (x
, 1))),
3834 else if ((new = instantiate_new_reg (XEXP (x
, 0), &offset
)) == 0)
3836 /* We know the second operand is a constant. Unless the
3837 first operand is a REG (which has been already checked),
3838 it needs to be checked. */
3839 if (GET_CODE (XEXP (x
, 0)) != REG
)
3847 new_offset
= plus_constant (XEXP (x
, 1), offset
);
3849 /* If the new constant is zero, try to replace the sum with just
3851 if (new_offset
== const0_rtx
3852 && validate_change (object
, loc
, new, 0))
3855 /* Next try to replace the register and new offset.
3856 There are two changes to validate here and we can't assume that
3857 in the case of old offset equals new just changing the register
3858 will yield a valid insn. In the interests of a little efficiency,
3859 however, we only call validate change once (we don't queue up the
3860 changes and then call apply_change_group). */
3864 ? ! validate_change (object
, &XEXP (x
, 0), new, 0)
3865 : (XEXP (x
, 0) = new,
3866 ! validate_change (object
, &XEXP (x
, 1), new_offset
, 0)))
3874 /* Otherwise copy the new constant into a register and replace
3875 constant with that register. */
3876 temp
= gen_reg_rtx (Pmode
);
3878 if (validate_change (object
, &XEXP (x
, 1), temp
, 0))
3879 emit_insn_before (gen_move_insn (temp
, new_offset
), object
);
3882 /* If that didn't work, replace this expression with a
3883 register containing the sum. */
3886 new = gen_rtx_PLUS (Pmode
, new, new_offset
);
3889 temp
= force_operand (new, NULL_RTX
);
3893 emit_insns_before (seq
, object
);
3894 if (! validate_change (object
, loc
, temp
, 0)
3895 && ! validate_replace_rtx (x
, temp
, object
))
3903 /* Fall through to generic two-operand expression case. */
3909 case DIV
: case UDIV
:
3910 case MOD
: case UMOD
:
3911 case AND
: case IOR
: case XOR
:
3912 case ROTATERT
: case ROTATE
:
3913 case ASHIFTRT
: case LSHIFTRT
: case ASHIFT
:
3915 case GE
: case GT
: case GEU
: case GTU
:
3916 case LE
: case LT
: case LEU
: case LTU
:
3917 if (XEXP (x
, 1) && ! CONSTANT_P (XEXP (x
, 1)))
3918 instantiate_virtual_regs_1 (&XEXP (x
, 1), object
, extra_insns
);
3923 /* Most cases of MEM that convert to valid addresses have already been
3924 handled by our scan of decls. The only special handling we
3925 need here is to make a copy of the rtx to ensure it isn't being
3926 shared if we have to change it to a pseudo.
3928 If the rtx is a simple reference to an address via a virtual register,
3929 it can potentially be shared. In such cases, first try to make it
3930 a valid address, which can also be shared. Otherwise, copy it and
3933 First check for common cases that need no processing. These are
3934 usually due to instantiation already being done on a previous instance
3938 if (CONSTANT_ADDRESS_P (temp
)
3939 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3940 || temp
== arg_pointer_rtx
3942 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3943 || temp
== hard_frame_pointer_rtx
3945 || temp
== frame_pointer_rtx
)
3948 if (GET_CODE (temp
) == PLUS
3949 && CONSTANT_ADDRESS_P (XEXP (temp
, 1))
3950 && (XEXP (temp
, 0) == frame_pointer_rtx
3951 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3952 || XEXP (temp
, 0) == hard_frame_pointer_rtx
3954 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3955 || XEXP (temp
, 0) == arg_pointer_rtx
3960 if (temp
== virtual_stack_vars_rtx
3961 || temp
== virtual_incoming_args_rtx
3962 || (GET_CODE (temp
) == PLUS
3963 && CONSTANT_ADDRESS_P (XEXP (temp
, 1))
3964 && (XEXP (temp
, 0) == virtual_stack_vars_rtx
3965 || XEXP (temp
, 0) == virtual_incoming_args_rtx
)))
3967 /* This MEM may be shared. If the substitution can be done without
3968 the need to generate new pseudos, we want to do it in place
3969 so all copies of the shared rtx benefit. The call below will
3970 only make substitutions if the resulting address is still
3973 Note that we cannot pass X as the object in the recursive call
3974 since the insn being processed may not allow all valid
3975 addresses. However, if we were not passed on object, we can
3976 only modify X without copying it if X will have a valid
3979 ??? Also note that this can still lose if OBJECT is an insn that
3980 has less restrictions on an address that some other insn.
3981 In that case, we will modify the shared address. This case
3982 doesn't seem very likely, though. One case where this could
3983 happen is in the case of a USE or CLOBBER reference, but we
3984 take care of that below. */
3986 if (instantiate_virtual_regs_1 (&XEXP (x
, 0),
3987 object
? object
: x
, 0))
3990 /* Otherwise make a copy and process that copy. We copy the entire
3991 RTL expression since it might be a PLUS which could also be
3993 *loc
= x
= copy_rtx (x
);
3996 /* Fall through to generic unary operation case. */
3998 case STRICT_LOW_PART
:
4000 case PRE_DEC
: case PRE_INC
: case POST_DEC
: case POST_INC
:
4001 case SIGN_EXTEND
: case ZERO_EXTEND
:
4002 case TRUNCATE
: case FLOAT_EXTEND
: case FLOAT_TRUNCATE
:
4003 case FLOAT
: case FIX
:
4004 case UNSIGNED_FIX
: case UNSIGNED_FLOAT
:
4008 /* These case either have just one operand or we know that we need not
4009 check the rest of the operands. */
4015 /* If the operand is a MEM, see if the change is a valid MEM. If not,
4016 go ahead and make the invalid one, but do it to a copy. For a REG,
4017 just make the recursive call, since there's no chance of a problem. */
4019 if ((GET_CODE (XEXP (x
, 0)) == MEM
4020 && instantiate_virtual_regs_1 (&XEXP (XEXP (x
, 0), 0), XEXP (x
, 0),
4022 || (GET_CODE (XEXP (x
, 0)) == REG
4023 && instantiate_virtual_regs_1 (&XEXP (x
, 0), object
, 0)))
4026 XEXP (x
, 0) = copy_rtx (XEXP (x
, 0));
4031 /* Try to replace with a PLUS. If that doesn't work, compute the sum
4032 in front of this insn and substitute the temporary. */
4033 if ((new = instantiate_new_reg (x
, &offset
)) != 0)
4035 temp
= plus_constant (new, offset
);
4036 if (!validate_change (object
, loc
, temp
, 0))
4042 temp
= force_operand (temp
, NULL_RTX
);
4046 emit_insns_before (seq
, object
);
4047 if (! validate_change (object
, loc
, temp
, 0)
4048 && ! validate_replace_rtx (x
, temp
, object
))
4056 if (GET_CODE (XEXP (x
, 0)) == REG
)
4059 else if (GET_CODE (XEXP (x
, 0)) == MEM
)
4061 /* If we have a (addressof (mem ..)), do any instantiation inside
4062 since we know we'll be making the inside valid when we finally
4063 remove the ADDRESSOF. */
4064 instantiate_virtual_regs_1 (&XEXP (XEXP (x
, 0), 0), NULL_RTX
, 0);
4073 /* Scan all subexpressions. */
4074 fmt
= GET_RTX_FORMAT (code
);
4075 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
4078 if (!instantiate_virtual_regs_1 (&XEXP (x
, i
), object
, extra_insns
))
4081 else if (*fmt
== 'E')
4082 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
4083 if (! instantiate_virtual_regs_1 (&XVECEXP (x
, i
, j
), object
,
4090 /* Optimization: assuming this function does not receive nonlocal gotos,
4091 delete the handlers for such, as well as the insns to establish
4092 and disestablish them. */
4098 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4100 /* Delete the handler by turning off the flag that would
4101 prevent jump_optimize from deleting it.
4102 Also permit deletion of the nonlocal labels themselves
4103 if nothing local refers to them. */
4104 if (GET_CODE (insn
) == CODE_LABEL
)
4108 LABEL_PRESERVE_P (insn
) = 0;
4110 /* Remove it from the nonlocal_label list, to avoid confusing
4112 for (t
= nonlocal_labels
, last_t
= 0; t
;
4113 last_t
= t
, t
= TREE_CHAIN (t
))
4114 if (DECL_RTL (TREE_VALUE (t
)) == insn
)
4119 nonlocal_labels
= TREE_CHAIN (nonlocal_labels
);
4121 TREE_CHAIN (last_t
) = TREE_CHAIN (t
);
4124 if (GET_CODE (insn
) == INSN
)
4128 for (t
= nonlocal_goto_handler_slots
; t
!= 0; t
= XEXP (t
, 1))
4129 if (reg_mentioned_p (t
, PATTERN (insn
)))
4135 || (nonlocal_goto_stack_level
!= 0
4136 && reg_mentioned_p (nonlocal_goto_stack_level
,
4146 return max_parm_reg
;
4149 /* Return the first insn following those generated by `assign_parms'. */
4152 get_first_nonparm_insn ()
4155 return NEXT_INSN (last_parm_insn
);
4156 return get_insns ();
4159 /* Return the first NOTE_INSN_BLOCK_BEG note in the function.
4160 Crash if there is none. */
4163 get_first_block_beg ()
4165 register rtx searcher
;
4166 register rtx insn
= get_first_nonparm_insn ();
4168 for (searcher
= insn
; searcher
; searcher
= NEXT_INSN (searcher
))
4169 if (GET_CODE (searcher
) == NOTE
4170 && NOTE_LINE_NUMBER (searcher
) == NOTE_INSN_BLOCK_BEG
)
4173 abort (); /* Invalid call to this function. (See comments above.) */
4177 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
4178 This means a type for which function calls must pass an address to the
4179 function or get an address back from the function.
4180 EXP may be a type node or an expression (whose type is tested). */
4183 aggregate_value_p (exp
)
4186 int i
, regno
, nregs
;
4189 tree type
= (TYPE_P (exp
)) ? exp
: TREE_TYPE (exp
);
4191 if (TREE_CODE (type
) == VOID_TYPE
)
4193 if (RETURN_IN_MEMORY (type
))
4195 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
4196 and thus can't be returned in registers. */
4197 if (TREE_ADDRESSABLE (type
))
4199 if (flag_pcc_struct_return
&& AGGREGATE_TYPE_P (type
))
4201 /* Make sure we have suitable call-clobbered regs to return
4202 the value in; if not, we must return it in memory. */
4203 reg
= hard_function_value (type
, 0, 0);
4205 /* If we have something other than a REG (e.g. a PARALLEL), then assume
4207 if (GET_CODE (reg
) != REG
)
4210 regno
= REGNO (reg
);
4211 nregs
= HARD_REGNO_NREGS (regno
, TYPE_MODE (type
));
4212 for (i
= 0; i
< nregs
; i
++)
4213 if (! call_used_regs
[regno
+ i
])
4218 /* Assign RTL expressions to the function's parameters.
4219 This may involve copying them into registers and using
4220 those registers as the RTL for them. */
4223 assign_parms (fndecl
)
4227 register rtx entry_parm
= 0;
4228 register rtx stack_parm
= 0;
4229 CUMULATIVE_ARGS args_so_far
;
4230 enum machine_mode promoted_mode
, passed_mode
;
4231 enum machine_mode nominal_mode
, promoted_nominal_mode
;
4233 /* Total space needed so far for args on the stack,
4234 given as a constant and a tree-expression. */
4235 struct args_size stack_args_size
;
4236 tree fntype
= TREE_TYPE (fndecl
);
4237 tree fnargs
= DECL_ARGUMENTS (fndecl
);
4238 /* This is used for the arg pointer when referring to stack args. */
4239 rtx internal_arg_pointer
;
4240 /* This is a dummy PARM_DECL that we used for the function result if
4241 the function returns a structure. */
4242 tree function_result_decl
= 0;
4243 #ifdef SETUP_INCOMING_VARARGS
4244 int varargs_setup
= 0;
4246 rtx conversion_insns
= 0;
4247 struct args_size alignment_pad
;
4249 /* Nonzero if the last arg is named `__builtin_va_alist',
4250 which is used on some machines for old-fashioned non-ANSI varargs.h;
4251 this should be stuck onto the stack as if it had arrived there. */
4253 = (current_function_varargs
4255 && (parm
= tree_last (fnargs
)) != 0
4257 && (! strcmp (IDENTIFIER_POINTER (DECL_NAME (parm
)),
4258 "__builtin_va_alist")));
4260 /* Nonzero if function takes extra anonymous args.
4261 This means the last named arg must be on the stack
4262 right before the anonymous ones. */
4264 = (TYPE_ARG_TYPES (fntype
) != 0
4265 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype
)))
4266 != void_type_node
));
4268 current_function_stdarg
= stdarg
;
4270 /* If the reg that the virtual arg pointer will be translated into is
4271 not a fixed reg or is the stack pointer, make a copy of the virtual
4272 arg pointer, and address parms via the copy. The frame pointer is
4273 considered fixed even though it is not marked as such.
4275 The second time through, simply use ap to avoid generating rtx. */
4277 if ((ARG_POINTER_REGNUM
== STACK_POINTER_REGNUM
4278 || ! (fixed_regs
[ARG_POINTER_REGNUM
]
4279 || ARG_POINTER_REGNUM
== FRAME_POINTER_REGNUM
)))
4280 internal_arg_pointer
= copy_to_reg (virtual_incoming_args_rtx
);
4282 internal_arg_pointer
= virtual_incoming_args_rtx
;
4283 current_function_internal_arg_pointer
= internal_arg_pointer
;
4285 stack_args_size
.constant
= 0;
4286 stack_args_size
.var
= 0;
4288 /* If struct value address is treated as the first argument, make it so. */
4289 if (aggregate_value_p (DECL_RESULT (fndecl
))
4290 && ! current_function_returns_pcc_struct
4291 && struct_value_incoming_rtx
== 0)
4293 tree type
= build_pointer_type (TREE_TYPE (fntype
));
4295 function_result_decl
= build_decl (PARM_DECL
, NULL_TREE
, type
);
4297 DECL_ARG_TYPE (function_result_decl
) = type
;
4298 TREE_CHAIN (function_result_decl
) = fnargs
;
4299 fnargs
= function_result_decl
;
4302 max_parm_reg
= LAST_VIRTUAL_REGISTER
+ 1;
4303 parm_reg_stack_loc
= (rtx
*) xcalloc (max_parm_reg
, sizeof (rtx
));
4305 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
4306 INIT_CUMULATIVE_INCOMING_ARGS (args_so_far
, fntype
, NULL_RTX
);
4308 INIT_CUMULATIVE_ARGS (args_so_far
, fntype
, NULL_RTX
, 0);
4311 /* We haven't yet found an argument that we must push and pretend the
4313 current_function_pretend_args_size
= 0;
4315 for (parm
= fnargs
; parm
; parm
= TREE_CHAIN (parm
))
4317 struct args_size stack_offset
;
4318 struct args_size arg_size
;
4319 int passed_pointer
= 0;
4320 int did_conversion
= 0;
4321 tree passed_type
= DECL_ARG_TYPE (parm
);
4322 tree nominal_type
= TREE_TYPE (parm
);
4325 /* Set LAST_NAMED if this is last named arg before some
4327 int last_named
= ((TREE_CHAIN (parm
) == 0
4328 || DECL_NAME (TREE_CHAIN (parm
)) == 0)
4329 && (stdarg
|| current_function_varargs
));
4330 /* Set NAMED_ARG if this arg should be treated as a named arg. For
4331 most machines, if this is a varargs/stdarg function, then we treat
4332 the last named arg as if it were anonymous too. */
4333 int named_arg
= STRICT_ARGUMENT_NAMING
? 1 : ! last_named
;
4335 if (TREE_TYPE (parm
) == error_mark_node
4336 /* This can happen after weird syntax errors
4337 or if an enum type is defined among the parms. */
4338 || TREE_CODE (parm
) != PARM_DECL
4339 || passed_type
== NULL
)
4341 SET_DECL_RTL (parm
, gen_rtx_MEM (BLKmode
, const0_rtx
));
4342 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
);
4343 TREE_USED (parm
) = 1;
4347 /* For varargs.h function, save info about regs and stack space
4348 used by the individual args, not including the va_alist arg. */
4349 if (hide_last_arg
&& last_named
)
4350 current_function_args_info
= args_so_far
;
4352 /* Find mode of arg as it is passed, and mode of arg
4353 as it should be during execution of this function. */
4354 passed_mode
= TYPE_MODE (passed_type
);
4355 nominal_mode
= TYPE_MODE (nominal_type
);
4357 /* If the parm's mode is VOID, its value doesn't matter,
4358 and avoid the usual things like emit_move_insn that could crash. */
4359 if (nominal_mode
== VOIDmode
)
4361 SET_DECL_RTL (parm
, const0_rtx
);
4362 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
);
4366 /* If the parm is to be passed as a transparent union, use the
4367 type of the first field for the tests below. We have already
4368 verified that the modes are the same. */
4369 if (DECL_TRANSPARENT_UNION (parm
)
4370 || (TREE_CODE (passed_type
) == UNION_TYPE
4371 && TYPE_TRANSPARENT_UNION (passed_type
)))
4372 passed_type
= TREE_TYPE (TYPE_FIELDS (passed_type
));
4374 /* See if this arg was passed by invisible reference. It is if
4375 it is an object whose size depends on the contents of the
4376 object itself or if the machine requires these objects be passed
4379 if ((TREE_CODE (TYPE_SIZE (passed_type
)) != INTEGER_CST
4380 && contains_placeholder_p (TYPE_SIZE (passed_type
)))
4381 || TREE_ADDRESSABLE (passed_type
)
4382 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
4383 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, passed_mode
,
4384 passed_type
, named_arg
)
4388 passed_type
= nominal_type
= build_pointer_type (passed_type
);
4390 passed_mode
= nominal_mode
= Pmode
;
4393 promoted_mode
= passed_mode
;
4395 #ifdef PROMOTE_FUNCTION_ARGS
4396 /* Compute the mode in which the arg is actually extended to. */
4397 unsignedp
= TREE_UNSIGNED (passed_type
);
4398 promoted_mode
= promote_mode (passed_type
, promoted_mode
, &unsignedp
, 1);
4401 /* Let machine desc say which reg (if any) the parm arrives in.
4402 0 means it arrives on the stack. */
4403 #ifdef FUNCTION_INCOMING_ARG
4404 entry_parm
= FUNCTION_INCOMING_ARG (args_so_far
, promoted_mode
,
4405 passed_type
, named_arg
);
4407 entry_parm
= FUNCTION_ARG (args_so_far
, promoted_mode
,
4408 passed_type
, named_arg
);
4411 if (entry_parm
== 0)
4412 promoted_mode
= passed_mode
;
4414 #ifdef SETUP_INCOMING_VARARGS
4415 /* If this is the last named parameter, do any required setup for
4416 varargs or stdargs. We need to know about the case of this being an
4417 addressable type, in which case we skip the registers it
4418 would have arrived in.
4420 For stdargs, LAST_NAMED will be set for two parameters, the one that
4421 is actually the last named, and the dummy parameter. We only
4422 want to do this action once.
4424 Also, indicate when RTL generation is to be suppressed. */
4425 if (last_named
&& !varargs_setup
)
4427 SETUP_INCOMING_VARARGS (args_so_far
, promoted_mode
, passed_type
,
4428 current_function_pretend_args_size
, 0);
4433 /* Determine parm's home in the stack,
4434 in case it arrives in the stack or we should pretend it did.
4436 Compute the stack position and rtx where the argument arrives
4439 There is one complexity here: If this was a parameter that would
4440 have been passed in registers, but wasn't only because it is
4441 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
4442 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
4443 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
4444 0 as it was the previous time. */
4446 pretend_named
= named_arg
|| PRETEND_OUTGOING_VARARGS_NAMED
;
4447 locate_and_pad_parm (promoted_mode
, passed_type
,
4448 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4451 #ifdef FUNCTION_INCOMING_ARG
4452 FUNCTION_INCOMING_ARG (args_so_far
, promoted_mode
,
4454 pretend_named
) != 0,
4456 FUNCTION_ARG (args_so_far
, promoted_mode
,
4458 pretend_named
) != 0,
4461 fndecl
, &stack_args_size
, &stack_offset
, &arg_size
,
4465 rtx offset_rtx
= ARGS_SIZE_RTX (stack_offset
);
4467 if (offset_rtx
== const0_rtx
)
4468 stack_parm
= gen_rtx_MEM (promoted_mode
, internal_arg_pointer
);
4470 stack_parm
= gen_rtx_MEM (promoted_mode
,
4471 gen_rtx_PLUS (Pmode
,
4472 internal_arg_pointer
,
4475 set_mem_attributes (stack_parm
, parm
, 1);
4478 /* If this parameter was passed both in registers and in the stack,
4479 use the copy on the stack. */
4480 if (MUST_PASS_IN_STACK (promoted_mode
, passed_type
))
4483 #ifdef FUNCTION_ARG_PARTIAL_NREGS
4484 /* If this parm was passed part in regs and part in memory,
4485 pretend it arrived entirely in memory
4486 by pushing the register-part onto the stack.
4488 In the special case of a DImode or DFmode that is split,
4489 we could put it together in a pseudoreg directly,
4490 but for now that's not worth bothering with. */
4494 int nregs
= FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, promoted_mode
,
4495 passed_type
, named_arg
);
4499 current_function_pretend_args_size
4500 = (((nregs
* UNITS_PER_WORD
) + (PARM_BOUNDARY
/ BITS_PER_UNIT
) - 1)
4501 / (PARM_BOUNDARY
/ BITS_PER_UNIT
)
4502 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
4504 /* Handle calls that pass values in multiple non-contiguous
4505 locations. The Irix 6 ABI has examples of this. */
4506 if (GET_CODE (entry_parm
) == PARALLEL
)
4507 emit_group_store (validize_mem (stack_parm
), entry_parm
,
4508 int_size_in_bytes (TREE_TYPE (parm
)),
4509 TYPE_ALIGN (TREE_TYPE (parm
)));
4512 move_block_from_reg (REGNO (entry_parm
),
4513 validize_mem (stack_parm
), nregs
,
4514 int_size_in_bytes (TREE_TYPE (parm
)));
4516 entry_parm
= stack_parm
;
4521 /* If we didn't decide this parm came in a register,
4522 by default it came on the stack. */
4523 if (entry_parm
== 0)
4524 entry_parm
= stack_parm
;
4526 /* Record permanently how this parm was passed. */
4527 DECL_INCOMING_RTL (parm
) = entry_parm
;
4529 /* If there is actually space on the stack for this parm,
4530 count it in stack_args_size; otherwise set stack_parm to 0
4531 to indicate there is no preallocated stack slot for the parm. */
4533 if (entry_parm
== stack_parm
4534 || (GET_CODE (entry_parm
) == PARALLEL
4535 && XEXP (XVECEXP (entry_parm
, 0, 0), 0) == NULL_RTX
)
4536 #if defined (REG_PARM_STACK_SPACE) && ! defined (MAYBE_REG_PARM_STACK_SPACE)
4537 /* On some machines, even if a parm value arrives in a register
4538 there is still an (uninitialized) stack slot allocated for it.
4540 ??? When MAYBE_REG_PARM_STACK_SPACE is defined, we can't tell
4541 whether this parameter already has a stack slot allocated,
4542 because an arg block exists only if current_function_args_size
4543 is larger than some threshold, and we haven't calculated that
4544 yet. So, for now, we just assume that stack slots never exist
4546 || REG_PARM_STACK_SPACE (fndecl
) > 0
4550 stack_args_size
.constant
+= arg_size
.constant
;
4552 ADD_PARM_SIZE (stack_args_size
, arg_size
.var
);
4555 /* No stack slot was pushed for this parm. */
4558 /* Update info on where next arg arrives in registers. */
4560 FUNCTION_ARG_ADVANCE (args_so_far
, promoted_mode
,
4561 passed_type
, named_arg
);
4563 /* If we can't trust the parm stack slot to be aligned enough
4564 for its ultimate type, don't use that slot after entry.
4565 We'll make another stack slot, if we need one. */
4567 unsigned int thisparm_boundary
4568 = FUNCTION_ARG_BOUNDARY (promoted_mode
, passed_type
);
4570 if (GET_MODE_ALIGNMENT (nominal_mode
) > thisparm_boundary
)
4574 /* If parm was passed in memory, and we need to convert it on entry,
4575 don't store it back in that same slot. */
4577 && nominal_mode
!= BLKmode
&& nominal_mode
!= passed_mode
)
4580 /* When an argument is passed in multiple locations, we can't
4581 make use of this information, but we can save some copying if
4582 the whole argument is passed in a single register. */
4583 if (GET_CODE (entry_parm
) == PARALLEL
4584 && nominal_mode
!= BLKmode
&& passed_mode
!= BLKmode
)
4586 int i
, len
= XVECLEN (entry_parm
, 0);
4588 for (i
= 0; i
< len
; i
++)
4589 if (XEXP (XVECEXP (entry_parm
, 0, i
), 0) != NULL_RTX
4590 && GET_CODE (XEXP (XVECEXP (entry_parm
, 0, i
), 0)) == REG
4591 && (GET_MODE (XEXP (XVECEXP (entry_parm
, 0, i
), 0))
4593 && INTVAL (XEXP (XVECEXP (entry_parm
, 0, i
), 1)) == 0)
4595 entry_parm
= XEXP (XVECEXP (entry_parm
, 0, i
), 0);
4596 DECL_INCOMING_RTL (parm
) = entry_parm
;
4601 /* ENTRY_PARM is an RTX for the parameter as it arrives,
4602 in the mode in which it arrives.
4603 STACK_PARM is an RTX for a stack slot where the parameter can live
4604 during the function (in case we want to put it there).
4605 STACK_PARM is 0 if no stack slot was pushed for it.
4607 Now output code if necessary to convert ENTRY_PARM to
4608 the type in which this function declares it,
4609 and store that result in an appropriate place,
4610 which may be a pseudo reg, may be STACK_PARM,
4611 or may be a local stack slot if STACK_PARM is 0.
4613 Set DECL_RTL to that place. */
4615 if (nominal_mode
== BLKmode
|| GET_CODE (entry_parm
) == PARALLEL
)
4617 /* If a BLKmode arrives in registers, copy it to a stack slot.
4618 Handle calls that pass values in multiple non-contiguous
4619 locations. The Irix 6 ABI has examples of this. */
4620 if (GET_CODE (entry_parm
) == REG
4621 || GET_CODE (entry_parm
) == PARALLEL
)
4624 = CEIL_ROUND (int_size_in_bytes (TREE_TYPE (parm
)),
4627 /* Note that we will be storing an integral number of words.
4628 So we have to be careful to ensure that we allocate an
4629 integral number of words. We do this below in the
4630 assign_stack_local if space was not allocated in the argument
4631 list. If it was, this will not work if PARM_BOUNDARY is not
4632 a multiple of BITS_PER_WORD. It isn't clear how to fix this
4633 if it becomes a problem. */
4635 if (stack_parm
== 0)
4638 = assign_stack_local (GET_MODE (entry_parm
),
4640 set_mem_attributes (stack_parm
, parm
, 1);
4643 else if (PARM_BOUNDARY
% BITS_PER_WORD
!= 0)
4646 /* Handle calls that pass values in multiple non-contiguous
4647 locations. The Irix 6 ABI has examples of this. */
4648 if (GET_CODE (entry_parm
) == PARALLEL
)
4649 emit_group_store (validize_mem (stack_parm
), entry_parm
,
4650 int_size_in_bytes (TREE_TYPE (parm
)),
4651 TYPE_ALIGN (TREE_TYPE (parm
)));
4653 move_block_from_reg (REGNO (entry_parm
),
4654 validize_mem (stack_parm
),
4655 size_stored
/ UNITS_PER_WORD
,
4656 int_size_in_bytes (TREE_TYPE (parm
)));
4658 SET_DECL_RTL (parm
, stack_parm
);
4660 else if (! ((! optimize
4661 && ! DECL_REGISTER (parm
)
4662 && ! DECL_INLINE (fndecl
))
4663 || TREE_SIDE_EFFECTS (parm
)
4664 /* If -ffloat-store specified, don't put explicit
4665 float variables into registers. */
4666 || (flag_float_store
4667 && TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
))
4668 /* Always assign pseudo to structure return or item passed
4669 by invisible reference. */
4670 || passed_pointer
|| parm
== function_result_decl
)
4672 /* Store the parm in a pseudoregister during the function, but we
4673 may need to do it in a wider mode. */
4675 register rtx parmreg
;
4676 unsigned int regno
, regnoi
= 0, regnor
= 0;
4678 unsignedp
= TREE_UNSIGNED (TREE_TYPE (parm
));
4680 promoted_nominal_mode
4681 = promote_mode (TREE_TYPE (parm
), nominal_mode
, &unsignedp
, 0);
4683 parmreg
= gen_reg_rtx (promoted_nominal_mode
);
4684 mark_user_reg (parmreg
);
4686 /* If this was an item that we received a pointer to, set DECL_RTL
4690 rtx x
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type
)),
4692 set_mem_attributes (x
, parm
, 1);
4693 SET_DECL_RTL (parm
, x
);
4697 SET_DECL_RTL (parm
, parmreg
);
4698 maybe_set_unchanging (DECL_RTL (parm
), parm
);
4701 /* Copy the value into the register. */
4702 if (nominal_mode
!= passed_mode
4703 || promoted_nominal_mode
!= promoted_mode
)
4706 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
4707 mode, by the caller. We now have to convert it to
4708 NOMINAL_MODE, if different. However, PARMREG may be in
4709 a different mode than NOMINAL_MODE if it is being stored
4712 If ENTRY_PARM is a hard register, it might be in a register
4713 not valid for operating in its mode (e.g., an odd-numbered
4714 register for a DFmode). In that case, moves are the only
4715 thing valid, so we can't do a convert from there. This
4716 occurs when the calling sequence allow such misaligned
4719 In addition, the conversion may involve a call, which could
4720 clobber parameters which haven't been copied to pseudo
4721 registers yet. Therefore, we must first copy the parm to
4722 a pseudo reg here, and save the conversion until after all
4723 parameters have been moved. */
4725 rtx tempreg
= gen_reg_rtx (GET_MODE (entry_parm
));
4727 emit_move_insn (tempreg
, validize_mem (entry_parm
));
4729 push_to_sequence (conversion_insns
);
4730 tempreg
= convert_to_mode (nominal_mode
, tempreg
, unsignedp
);
4732 if (GET_CODE (tempreg
) == SUBREG
4733 && GET_MODE (tempreg
) == nominal_mode
4734 && GET_CODE (SUBREG_REG (tempreg
)) == REG
4735 && nominal_mode
== passed_mode
4736 && GET_MODE (SUBREG_REG (tempreg
)) == GET_MODE (entry_parm
)
4737 && GET_MODE_SIZE (GET_MODE (tempreg
))
4738 < GET_MODE_SIZE (GET_MODE (entry_parm
)))
4740 /* The argument is already sign/zero extended, so note it
4742 SUBREG_PROMOTED_VAR_P (tempreg
) = 1;
4743 SUBREG_PROMOTED_UNSIGNED_P (tempreg
) = unsignedp
;
4746 /* TREE_USED gets set erroneously during expand_assignment. */
4747 save_tree_used
= TREE_USED (parm
);
4748 expand_assignment (parm
,
4749 make_tree (nominal_type
, tempreg
), 0, 0);
4750 TREE_USED (parm
) = save_tree_used
;
4751 conversion_insns
= get_insns ();
4756 emit_move_insn (parmreg
, validize_mem (entry_parm
));
4758 /* If we were passed a pointer but the actual value
4759 can safely live in a register, put it in one. */
4760 if (passed_pointer
&& TYPE_MODE (TREE_TYPE (parm
)) != BLKmode
4762 && ! DECL_REGISTER (parm
)
4763 && ! DECL_INLINE (fndecl
))
4764 || TREE_SIDE_EFFECTS (parm
)
4765 /* If -ffloat-store specified, don't put explicit
4766 float variables into registers. */
4767 || (flag_float_store
4768 && TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
)))
4770 /* We can't use nominal_mode, because it will have been set to
4771 Pmode above. We must use the actual mode of the parm. */
4772 parmreg
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm
)));
4773 mark_user_reg (parmreg
);
4774 if (GET_MODE (parmreg
) != GET_MODE (DECL_RTL (parm
)))
4776 rtx tempreg
= gen_reg_rtx (GET_MODE (DECL_RTL (parm
)));
4777 int unsigned_p
= TREE_UNSIGNED (TREE_TYPE (parm
));
4778 push_to_sequence (conversion_insns
);
4779 emit_move_insn (tempreg
, DECL_RTL (parm
));
4781 convert_to_mode (GET_MODE (parmreg
),
4784 emit_move_insn (parmreg
, DECL_RTL (parm
));
4785 conversion_insns
= get_insns();
4790 emit_move_insn (parmreg
, DECL_RTL (parm
));
4791 SET_DECL_RTL (parm
, parmreg
);
4792 /* STACK_PARM is the pointer, not the parm, and PARMREG is
4796 #ifdef FUNCTION_ARG_CALLEE_COPIES
4797 /* If we are passed an arg by reference and it is our responsibility
4798 to make a copy, do it now.
4799 PASSED_TYPE and PASSED mode now refer to the pointer, not the
4800 original argument, so we must recreate them in the call to
4801 FUNCTION_ARG_CALLEE_COPIES. */
4802 /* ??? Later add code to handle the case that if the argument isn't
4803 modified, don't do the copy. */
4805 else if (passed_pointer
4806 && FUNCTION_ARG_CALLEE_COPIES (args_so_far
,
4807 TYPE_MODE (DECL_ARG_TYPE (parm
)),
4808 DECL_ARG_TYPE (parm
),
4810 && ! TREE_ADDRESSABLE (DECL_ARG_TYPE (parm
)))
4813 tree type
= DECL_ARG_TYPE (parm
);
4815 /* This sequence may involve a library call perhaps clobbering
4816 registers that haven't been copied to pseudos yet. */
4818 push_to_sequence (conversion_insns
);
4820 if (!COMPLETE_TYPE_P (type
)
4821 || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4822 /* This is a variable sized object. */
4823 copy
= gen_rtx_MEM (BLKmode
,
4824 allocate_dynamic_stack_space
4825 (expr_size (parm
), NULL_RTX
,
4826 TYPE_ALIGN (type
)));
4828 copy
= assign_stack_temp (TYPE_MODE (type
),
4829 int_size_in_bytes (type
), 1);
4830 set_mem_attributes (copy
, parm
, 1);
4832 store_expr (parm
, copy
, 0);
4833 emit_move_insn (parmreg
, XEXP (copy
, 0));
4834 if (current_function_check_memory_usage
)
4835 emit_library_call (chkr_set_right_libfunc
,
4836 LCT_CONST_MAKE_BLOCK
, VOIDmode
, 3,
4837 XEXP (copy
, 0), Pmode
,
4838 GEN_INT (int_size_in_bytes (type
)),
4839 TYPE_MODE (sizetype
),
4840 GEN_INT (MEMORY_USE_RW
),
4841 TYPE_MODE (integer_type_node
));
4842 conversion_insns
= get_insns ();
4846 #endif /* FUNCTION_ARG_CALLEE_COPIES */
4848 /* In any case, record the parm's desired stack location
4849 in case we later discover it must live in the stack.
4851 If it is a COMPLEX value, store the stack location for both
4854 if (GET_CODE (parmreg
) == CONCAT
)
4855 regno
= MAX (REGNO (XEXP (parmreg
, 0)), REGNO (XEXP (parmreg
, 1)));
4857 regno
= REGNO (parmreg
);
4859 if (regno
>= max_parm_reg
)
4862 int old_max_parm_reg
= max_parm_reg
;
4864 /* It's slow to expand this one register at a time,
4865 but it's also rare and we need max_parm_reg to be
4866 precisely correct. */
4867 max_parm_reg
= regno
+ 1;
4868 new = (rtx
*) xrealloc (parm_reg_stack_loc
,
4869 max_parm_reg
* sizeof (rtx
));
4870 memset ((char *) (new + old_max_parm_reg
), 0,
4871 (max_parm_reg
- old_max_parm_reg
) * sizeof (rtx
));
4872 parm_reg_stack_loc
= new;
4875 if (GET_CODE (parmreg
) == CONCAT
)
4877 enum machine_mode submode
= GET_MODE (XEXP (parmreg
, 0));
4879 regnor
= REGNO (gen_realpart (submode
, parmreg
));
4880 regnoi
= REGNO (gen_imagpart (submode
, parmreg
));
4882 if (stack_parm
!= 0)
4884 parm_reg_stack_loc
[regnor
]
4885 = gen_realpart (submode
, stack_parm
);
4886 parm_reg_stack_loc
[regnoi
]
4887 = gen_imagpart (submode
, stack_parm
);
4891 parm_reg_stack_loc
[regnor
] = 0;
4892 parm_reg_stack_loc
[regnoi
] = 0;
4896 parm_reg_stack_loc
[REGNO (parmreg
)] = stack_parm
;
4898 /* Mark the register as eliminable if we did no conversion
4899 and it was copied from memory at a fixed offset,
4900 and the arg pointer was not copied to a pseudo-reg.
4901 If the arg pointer is a pseudo reg or the offset formed
4902 an invalid address, such memory-equivalences
4903 as we make here would screw up life analysis for it. */
4904 if (nominal_mode
== passed_mode
4907 && GET_CODE (stack_parm
) == MEM
4908 && stack_offset
.var
== 0
4909 && reg_mentioned_p (virtual_incoming_args_rtx
,
4910 XEXP (stack_parm
, 0)))
4912 rtx linsn
= get_last_insn ();
4915 /* Mark complex types separately. */
4916 if (GET_CODE (parmreg
) == CONCAT
)
4917 /* Scan backwards for the set of the real and
4919 for (sinsn
= linsn
; sinsn
!= 0;
4920 sinsn
= prev_nonnote_insn (sinsn
))
4922 set
= single_set (sinsn
);
4924 && SET_DEST (set
) == regno_reg_rtx
[regnoi
])
4926 = gen_rtx_EXPR_LIST (REG_EQUIV
,
4927 parm_reg_stack_loc
[regnoi
],
4930 && SET_DEST (set
) == regno_reg_rtx
[regnor
])
4932 = gen_rtx_EXPR_LIST (REG_EQUIV
,
4933 parm_reg_stack_loc
[regnor
],
4936 else if ((set
= single_set (linsn
)) != 0
4937 && SET_DEST (set
) == parmreg
)
4939 = gen_rtx_EXPR_LIST (REG_EQUIV
,
4940 stack_parm
, REG_NOTES (linsn
));
4943 /* For pointer data type, suggest pointer register. */
4944 if (POINTER_TYPE_P (TREE_TYPE (parm
)))
4945 mark_reg_pointer (parmreg
,
4946 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
))));
4948 /* If something wants our address, try to use ADDRESSOF. */
4949 if (TREE_ADDRESSABLE (parm
))
4951 /* If we end up putting something into the stack,
4952 fixup_var_refs_insns will need to make a pass over
4953 all the instructions. It looks throughs the pending
4954 sequences -- but it can't see the ones in the
4955 CONVERSION_INSNS, if they're not on the sequence
4956 stack. So, we go back to that sequence, just so that
4957 the fixups will happen. */
4958 push_to_sequence (conversion_insns
);
4959 put_var_into_stack (parm
);
4960 conversion_insns
= get_insns ();
4966 /* Value must be stored in the stack slot STACK_PARM
4967 during function execution. */
4969 if (promoted_mode
!= nominal_mode
)
4971 /* Conversion is required. */
4972 rtx tempreg
= gen_reg_rtx (GET_MODE (entry_parm
));
4974 emit_move_insn (tempreg
, validize_mem (entry_parm
));
4976 push_to_sequence (conversion_insns
);
4977 entry_parm
= convert_to_mode (nominal_mode
, tempreg
,
4978 TREE_UNSIGNED (TREE_TYPE (parm
)));
4980 /* ??? This may need a big-endian conversion on sparc64. */
4981 stack_parm
= adjust_address (stack_parm
, nominal_mode
, 0);
4983 conversion_insns
= get_insns ();
4988 if (entry_parm
!= stack_parm
)
4990 if (stack_parm
== 0)
4993 = assign_stack_local (GET_MODE (entry_parm
),
4994 GET_MODE_SIZE (GET_MODE (entry_parm
)), 0);
4995 set_mem_attributes (stack_parm
, parm
, 1);
4998 if (promoted_mode
!= nominal_mode
)
5000 push_to_sequence (conversion_insns
);
5001 emit_move_insn (validize_mem (stack_parm
),
5002 validize_mem (entry_parm
));
5003 conversion_insns
= get_insns ();
5007 emit_move_insn (validize_mem (stack_parm
),
5008 validize_mem (entry_parm
));
5010 if (current_function_check_memory_usage
)
5012 push_to_sequence (conversion_insns
);
5013 emit_library_call (chkr_set_right_libfunc
, LCT_CONST_MAKE_BLOCK
,
5014 VOIDmode
, 3, XEXP (stack_parm
, 0), Pmode
,
5015 GEN_INT (GET_MODE_SIZE (GET_MODE
5017 TYPE_MODE (sizetype
),
5018 GEN_INT (MEMORY_USE_RW
),
5019 TYPE_MODE (integer_type_node
));
5021 conversion_insns
= get_insns ();
5024 SET_DECL_RTL (parm
, stack_parm
);
5027 /* If this "parameter" was the place where we are receiving the
5028 function's incoming structure pointer, set up the result. */
5029 if (parm
== function_result_decl
)
5031 tree result
= DECL_RESULT (fndecl
);
5032 rtx x
= gen_rtx_MEM (DECL_MODE (result
), DECL_RTL (parm
));
5034 set_mem_attributes (x
, result
, 1);
5035 SET_DECL_RTL (result
, x
);
5039 /* Output all parameter conversion instructions (possibly including calls)
5040 now that all parameters have been copied out of hard registers. */
5041 emit_insns (conversion_insns
);
5043 last_parm_insn
= get_last_insn ();
5045 current_function_args_size
= stack_args_size
.constant
;
5047 /* Adjust function incoming argument size for alignment and
5050 #ifdef REG_PARM_STACK_SPACE
5051 #ifndef MAYBE_REG_PARM_STACK_SPACE
5052 current_function_args_size
= MAX (current_function_args_size
,
5053 REG_PARM_STACK_SPACE (fndecl
));
5057 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
5059 current_function_args_size
5060 = ((current_function_args_size
+ STACK_BYTES
- 1)
5061 / STACK_BYTES
) * STACK_BYTES
;
5063 #ifdef ARGS_GROW_DOWNWARD
5064 current_function_arg_offset_rtx
5065 = (stack_args_size
.var
== 0 ? GEN_INT (-stack_args_size
.constant
)
5066 : expand_expr (size_diffop (stack_args_size
.var
,
5067 size_int (-stack_args_size
.constant
)),
5068 NULL_RTX
, VOIDmode
, EXPAND_MEMORY_USE_BAD
));
5070 current_function_arg_offset_rtx
= ARGS_SIZE_RTX (stack_args_size
);
5073 /* See how many bytes, if any, of its args a function should try to pop
5076 current_function_pops_args
= RETURN_POPS_ARGS (fndecl
, TREE_TYPE (fndecl
),
5077 current_function_args_size
);
5079 /* For stdarg.h function, save info about
5080 regs and stack space used by the named args. */
5083 current_function_args_info
= args_so_far
;
5085 /* Set the rtx used for the function return value. Put this in its
5086 own variable so any optimizers that need this information don't have
5087 to include tree.h. Do this here so it gets done when an inlined
5088 function gets output. */
5090 current_function_return_rtx
5091 = (DECL_RTL_SET_P (DECL_RESULT (fndecl
))
5092 ? DECL_RTL (DECL_RESULT (fndecl
)) : NULL_RTX
);
5095 /* Indicate whether REGNO is an incoming argument to the current function
5096 that was promoted to a wider mode. If so, return the RTX for the
5097 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
5098 that REGNO is promoted from and whether the promotion was signed or
5101 #ifdef PROMOTE_FUNCTION_ARGS
5104 promoted_input_arg (regno
, pmode
, punsignedp
)
5106 enum machine_mode
*pmode
;
5111 for (arg
= DECL_ARGUMENTS (current_function_decl
); arg
;
5112 arg
= TREE_CHAIN (arg
))
5113 if (GET_CODE (DECL_INCOMING_RTL (arg
)) == REG
5114 && REGNO (DECL_INCOMING_RTL (arg
)) == regno
5115 && TYPE_MODE (DECL_ARG_TYPE (arg
)) == TYPE_MODE (TREE_TYPE (arg
)))
5117 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (arg
));
5118 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (arg
));
5120 mode
= promote_mode (TREE_TYPE (arg
), mode
, &unsignedp
, 1);
5121 if (mode
== GET_MODE (DECL_INCOMING_RTL (arg
))
5122 && mode
!= DECL_MODE (arg
))
5124 *pmode
= DECL_MODE (arg
);
5125 *punsignedp
= unsignedp
;
5126 return DECL_INCOMING_RTL (arg
);
5135 /* Compute the size and offset from the start of the stacked arguments for a
5136 parm passed in mode PASSED_MODE and with type TYPE.
5138 INITIAL_OFFSET_PTR points to the current offset into the stacked
5141 The starting offset and size for this parm are returned in *OFFSET_PTR
5142 and *ARG_SIZE_PTR, respectively.
5144 IN_REGS is non-zero if the argument will be passed in registers. It will
5145 never be set if REG_PARM_STACK_SPACE is not defined.
5147 FNDECL is the function in which the argument was defined.
5149 There are two types of rounding that are done. The first, controlled by
5150 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
5151 list to be aligned to the specific boundary (in bits). This rounding
5152 affects the initial and starting offsets, but not the argument size.
5154 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
5155 optionally rounds the size of the parm to PARM_BOUNDARY. The
5156 initial offset is not affected by this rounding, while the size always
5157 is and the starting offset may be. */
5159 /* offset_ptr will be negative for ARGS_GROW_DOWNWARD case;
5160 initial_offset_ptr is positive because locate_and_pad_parm's
5161 callers pass in the total size of args so far as
5162 initial_offset_ptr. arg_size_ptr is always positive.*/
5165 locate_and_pad_parm (passed_mode
, type
, in_regs
, fndecl
,
5166 initial_offset_ptr
, offset_ptr
, arg_size_ptr
,
5168 enum machine_mode passed_mode
;
5170 int in_regs ATTRIBUTE_UNUSED
;
5171 tree fndecl ATTRIBUTE_UNUSED
;
5172 struct args_size
*initial_offset_ptr
;
5173 struct args_size
*offset_ptr
;
5174 struct args_size
*arg_size_ptr
;
5175 struct args_size
*alignment_pad
;
5179 = type
? size_in_bytes (type
) : size_int (GET_MODE_SIZE (passed_mode
));
5180 enum direction where_pad
= FUNCTION_ARG_PADDING (passed_mode
, type
);
5181 int boundary
= FUNCTION_ARG_BOUNDARY (passed_mode
, type
);
5183 #ifdef REG_PARM_STACK_SPACE
5184 /* If we have found a stack parm before we reach the end of the
5185 area reserved for registers, skip that area. */
5188 int reg_parm_stack_space
= 0;
5190 #ifdef MAYBE_REG_PARM_STACK_SPACE
5191 reg_parm_stack_space
= MAYBE_REG_PARM_STACK_SPACE
;
5193 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
5195 if (reg_parm_stack_space
> 0)
5197 if (initial_offset_ptr
->var
)
5199 initial_offset_ptr
->var
5200 = size_binop (MAX_EXPR
, ARGS_SIZE_TREE (*initial_offset_ptr
),
5201 ssize_int (reg_parm_stack_space
));
5202 initial_offset_ptr
->constant
= 0;
5204 else if (initial_offset_ptr
->constant
< reg_parm_stack_space
)
5205 initial_offset_ptr
->constant
= reg_parm_stack_space
;
5208 #endif /* REG_PARM_STACK_SPACE */
5210 arg_size_ptr
->var
= 0;
5211 arg_size_ptr
->constant
= 0;
5212 alignment_pad
->var
= 0;
5213 alignment_pad
->constant
= 0;
5215 #ifdef ARGS_GROW_DOWNWARD
5216 if (initial_offset_ptr
->var
)
5218 offset_ptr
->constant
= 0;
5219 offset_ptr
->var
= size_binop (MINUS_EXPR
, ssize_int (0),
5220 initial_offset_ptr
->var
);
5224 offset_ptr
->constant
= -initial_offset_ptr
->constant
;
5225 offset_ptr
->var
= 0;
5227 if (where_pad
!= none
5228 && (!host_integerp (sizetree
, 1)
5229 || (tree_low_cst (sizetree
, 1) * BITS_PER_UNIT
) % PARM_BOUNDARY
))
5230 sizetree
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
5231 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
5232 if (where_pad
!= downward
)
5233 pad_to_arg_alignment (offset_ptr
, boundary
, alignment_pad
);
5234 if (initial_offset_ptr
->var
)
5235 arg_size_ptr
->var
= size_binop (MINUS_EXPR
,
5236 size_binop (MINUS_EXPR
,
5238 initial_offset_ptr
->var
),
5242 arg_size_ptr
->constant
= (-initial_offset_ptr
->constant
5243 - offset_ptr
->constant
);
5245 #else /* !ARGS_GROW_DOWNWARD */
5247 #ifdef REG_PARM_STACK_SPACE
5248 || REG_PARM_STACK_SPACE (fndecl
) > 0
5251 pad_to_arg_alignment (initial_offset_ptr
, boundary
, alignment_pad
);
5252 *offset_ptr
= *initial_offset_ptr
;
5254 #ifdef PUSH_ROUNDING
5255 if (passed_mode
!= BLKmode
)
5256 sizetree
= size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree
)));
5259 /* Pad_below needs the pre-rounded size to know how much to pad below
5260 so this must be done before rounding up. */
5261 if (where_pad
== downward
5262 /* However, BLKmode args passed in regs have their padding done elsewhere.
5263 The stack slot must be able to hold the entire register. */
5264 && !(in_regs
&& passed_mode
== BLKmode
))
5265 pad_below (offset_ptr
, passed_mode
, sizetree
);
5267 if (where_pad
!= none
5268 && (!host_integerp (sizetree
, 1)
5269 || (tree_low_cst (sizetree
, 1) * BITS_PER_UNIT
) % PARM_BOUNDARY
))
5270 sizetree
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
5272 ADD_PARM_SIZE (*arg_size_ptr
, sizetree
);
5273 #endif /* ARGS_GROW_DOWNWARD */
5276 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
5277 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
5280 pad_to_arg_alignment (offset_ptr
, boundary
, alignment_pad
)
5281 struct args_size
*offset_ptr
;
5283 struct args_size
*alignment_pad
;
5285 tree save_var
= NULL_TREE
;
5286 HOST_WIDE_INT save_constant
= 0;
5288 int boundary_in_bytes
= boundary
/ BITS_PER_UNIT
;
5290 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
5292 save_var
= offset_ptr
->var
;
5293 save_constant
= offset_ptr
->constant
;
5296 alignment_pad
->var
= NULL_TREE
;
5297 alignment_pad
->constant
= 0;
5299 if (boundary
> BITS_PER_UNIT
)
5301 if (offset_ptr
->var
)
5304 #ifdef ARGS_GROW_DOWNWARD
5309 (ARGS_SIZE_TREE (*offset_ptr
),
5310 boundary
/ BITS_PER_UNIT
);
5311 offset_ptr
->constant
= 0; /*?*/
5312 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
5313 alignment_pad
->var
= size_binop (MINUS_EXPR
, offset_ptr
->var
,
5318 offset_ptr
->constant
=
5319 #ifdef ARGS_GROW_DOWNWARD
5320 FLOOR_ROUND (offset_ptr
->constant
, boundary_in_bytes
);
5322 CEIL_ROUND (offset_ptr
->constant
, boundary_in_bytes
);
5324 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
5325 alignment_pad
->constant
= offset_ptr
->constant
- save_constant
;
5330 #ifndef ARGS_GROW_DOWNWARD
5332 pad_below (offset_ptr
, passed_mode
, sizetree
)
5333 struct args_size
*offset_ptr
;
5334 enum machine_mode passed_mode
;
5337 if (passed_mode
!= BLKmode
)
5339 if (GET_MODE_BITSIZE (passed_mode
) % PARM_BOUNDARY
)
5340 offset_ptr
->constant
5341 += (((GET_MODE_BITSIZE (passed_mode
) + PARM_BOUNDARY
- 1)
5342 / PARM_BOUNDARY
* PARM_BOUNDARY
/ BITS_PER_UNIT
)
5343 - GET_MODE_SIZE (passed_mode
));
5347 if (TREE_CODE (sizetree
) != INTEGER_CST
5348 || (TREE_INT_CST_LOW (sizetree
) * BITS_PER_UNIT
) % PARM_BOUNDARY
)
5350 /* Round the size up to multiple of PARM_BOUNDARY bits. */
5351 tree s2
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
5353 ADD_PARM_SIZE (*offset_ptr
, s2
);
5354 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
5360 /* Walk the tree of blocks describing the binding levels within a function
5361 and warn about uninitialized variables.
5362 This is done after calling flow_analysis and before global_alloc
5363 clobbers the pseudo-regs to hard regs. */
5366 uninitialized_vars_warning (block
)
5369 register tree decl
, sub
;
5370 for (decl
= BLOCK_VARS (block
); decl
; decl
= TREE_CHAIN (decl
))
5372 if (warn_uninitialized
5373 && TREE_CODE (decl
) == VAR_DECL
5374 /* These warnings are unreliable for and aggregates
5375 because assigning the fields one by one can fail to convince
5376 flow.c that the entire aggregate was initialized.
5377 Unions are troublesome because members may be shorter. */
5378 && ! AGGREGATE_TYPE_P (TREE_TYPE (decl
))
5379 && DECL_RTL (decl
) != 0
5380 && GET_CODE (DECL_RTL (decl
)) == REG
5381 /* Global optimizations can make it difficult to determine if a
5382 particular variable has been initialized. However, a VAR_DECL
5383 with a nonzero DECL_INITIAL had an initializer, so do not
5384 claim it is potentially uninitialized.
5386 We do not care about the actual value in DECL_INITIAL, so we do
5387 not worry that it may be a dangling pointer. */
5388 && DECL_INITIAL (decl
) == NULL_TREE
5389 && regno_uninitialized (REGNO (DECL_RTL (decl
))))
5390 warning_with_decl (decl
,
5391 "`%s' might be used uninitialized in this function");
5393 && TREE_CODE (decl
) == VAR_DECL
5394 && DECL_RTL (decl
) != 0
5395 && GET_CODE (DECL_RTL (decl
)) == REG
5396 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl
))))
5397 warning_with_decl (decl
,
5398 "variable `%s' might be clobbered by `longjmp' or `vfork'");
5400 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= TREE_CHAIN (sub
))
5401 uninitialized_vars_warning (sub
);
5404 /* Do the appropriate part of uninitialized_vars_warning
5405 but for arguments instead of local variables. */
5408 setjmp_args_warning ()
5411 for (decl
= DECL_ARGUMENTS (current_function_decl
);
5412 decl
; decl
= TREE_CHAIN (decl
))
5413 if (DECL_RTL (decl
) != 0
5414 && GET_CODE (DECL_RTL (decl
)) == REG
5415 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl
))))
5416 warning_with_decl (decl
,
5417 "argument `%s' might be clobbered by `longjmp' or `vfork'");
5420 /* If this function call setjmp, put all vars into the stack
5421 unless they were declared `register'. */
5424 setjmp_protect (block
)
5427 register tree decl
, sub
;
5428 for (decl
= BLOCK_VARS (block
); decl
; decl
= TREE_CHAIN (decl
))
5429 if ((TREE_CODE (decl
) == VAR_DECL
5430 || TREE_CODE (decl
) == PARM_DECL
)
5431 && DECL_RTL (decl
) != 0
5432 && (GET_CODE (DECL_RTL (decl
)) == REG
5433 || (GET_CODE (DECL_RTL (decl
)) == MEM
5434 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == ADDRESSOF
))
5435 /* If this variable came from an inline function, it must be
5436 that its life doesn't overlap the setjmp. If there was a
5437 setjmp in the function, it would already be in memory. We
5438 must exclude such variable because their DECL_RTL might be
5439 set to strange things such as virtual_stack_vars_rtx. */
5440 && ! DECL_FROM_INLINE (decl
)
5442 #ifdef NON_SAVING_SETJMP
5443 /* If longjmp doesn't restore the registers,
5444 don't put anything in them. */
5448 ! DECL_REGISTER (decl
)))
5449 put_var_into_stack (decl
);
5450 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= TREE_CHAIN (sub
))
5451 setjmp_protect (sub
);
5454 /* Like the previous function, but for args instead of local variables. */
5457 setjmp_protect_args ()
5460 for (decl
= DECL_ARGUMENTS (current_function_decl
);
5461 decl
; decl
= TREE_CHAIN (decl
))
5462 if ((TREE_CODE (decl
) == VAR_DECL
5463 || TREE_CODE (decl
) == PARM_DECL
)
5464 && DECL_RTL (decl
) != 0
5465 && (GET_CODE (DECL_RTL (decl
)) == REG
5466 || (GET_CODE (DECL_RTL (decl
)) == MEM
5467 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == ADDRESSOF
))
5469 /* If longjmp doesn't restore the registers,
5470 don't put anything in them. */
5471 #ifdef NON_SAVING_SETJMP
5475 ! DECL_REGISTER (decl
)))
5476 put_var_into_stack (decl
);
5479 /* Return the context-pointer register corresponding to DECL,
5480 or 0 if it does not need one. */
5483 lookup_static_chain (decl
)
5486 tree context
= decl_function_context (decl
);
5490 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_NO_STATIC_CHAIN (decl
)))
5493 /* We treat inline_function_decl as an alias for the current function
5494 because that is the inline function whose vars, types, etc.
5495 are being merged into the current function.
5496 See expand_inline_function. */
5497 if (context
== current_function_decl
|| context
== inline_function_decl
)
5498 return virtual_stack_vars_rtx
;
5500 for (link
= context_display
; link
; link
= TREE_CHAIN (link
))
5501 if (TREE_PURPOSE (link
) == context
)
5502 return RTL_EXPR_RTL (TREE_VALUE (link
));
5507 /* Convert a stack slot address ADDR for variable VAR
5508 (from a containing function)
5509 into an address valid in this function (using a static chain). */
5512 fix_lexical_addr (addr
, var
)
5517 HOST_WIDE_INT displacement
;
5518 tree context
= decl_function_context (var
);
5519 struct function
*fp
;
5522 /* If this is the present function, we need not do anything. */
5523 if (context
== current_function_decl
|| context
== inline_function_decl
)
5526 for (fp
= outer_function_chain
; fp
; fp
= fp
->next
)
5527 if (fp
->decl
== context
)
5533 if (GET_CODE (addr
) == ADDRESSOF
&& GET_CODE (XEXP (addr
, 0)) == MEM
)
5534 addr
= XEXP (XEXP (addr
, 0), 0);
5536 /* Decode given address as base reg plus displacement. */
5537 if (GET_CODE (addr
) == REG
)
5538 basereg
= addr
, displacement
= 0;
5539 else if (GET_CODE (addr
) == PLUS
&& GET_CODE (XEXP (addr
, 1)) == CONST_INT
)
5540 basereg
= XEXP (addr
, 0), displacement
= INTVAL (XEXP (addr
, 1));
5544 /* We accept vars reached via the containing function's
5545 incoming arg pointer and via its stack variables pointer. */
5546 if (basereg
== fp
->internal_arg_pointer
)
5548 /* If reached via arg pointer, get the arg pointer value
5549 out of that function's stack frame.
5551 There are two cases: If a separate ap is needed, allocate a
5552 slot in the outer function for it and dereference it that way.
5553 This is correct even if the real ap is actually a pseudo.
5554 Otherwise, just adjust the offset from the frame pointer to
5557 #ifdef NEED_SEPARATE_AP
5560 if (fp
->x_arg_pointer_save_area
== 0)
5561 fp
->x_arg_pointer_save_area
5562 = assign_stack_local_1 (Pmode
, GET_MODE_SIZE (Pmode
), 0, fp
);
5564 addr
= fix_lexical_addr (XEXP (fp
->x_arg_pointer_save_area
, 0), var
);
5565 addr
= memory_address (Pmode
, addr
);
5567 base
= gen_rtx_MEM (Pmode
, addr
);
5568 MEM_ALIAS_SET (base
) = get_frame_alias_set ();
5569 base
= copy_to_reg (base
);
5571 displacement
+= (FIRST_PARM_OFFSET (context
) - STARTING_FRAME_OFFSET
);
5572 base
= lookup_static_chain (var
);
5576 else if (basereg
== virtual_stack_vars_rtx
)
5578 /* This is the same code as lookup_static_chain, duplicated here to
5579 avoid an extra call to decl_function_context. */
5582 for (link
= context_display
; link
; link
= TREE_CHAIN (link
))
5583 if (TREE_PURPOSE (link
) == context
)
5585 base
= RTL_EXPR_RTL (TREE_VALUE (link
));
5593 /* Use same offset, relative to appropriate static chain or argument
5595 return plus_constant (base
, displacement
);
5598 /* Return the address of the trampoline for entering nested fn FUNCTION.
5599 If necessary, allocate a trampoline (in the stack frame)
5600 and emit rtl to initialize its contents (at entry to this function). */
5603 trampoline_address (function
)
5609 struct function
*fp
;
5612 /* Find an existing trampoline and return it. */
5613 for (link
= trampoline_list
; link
; link
= TREE_CHAIN (link
))
5614 if (TREE_PURPOSE (link
) == function
)
5616 adjust_trampoline_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link
)), 0));
5618 for (fp
= outer_function_chain
; fp
; fp
= fp
->next
)
5619 for (link
= fp
->x_trampoline_list
; link
; link
= TREE_CHAIN (link
))
5620 if (TREE_PURPOSE (link
) == function
)
5622 tramp
= fix_lexical_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link
)), 0),
5624 return adjust_trampoline_addr (tramp
);
5627 /* None exists; we must make one. */
5629 /* Find the `struct function' for the function containing FUNCTION. */
5631 fn_context
= decl_function_context (function
);
5632 if (fn_context
!= current_function_decl
5633 && fn_context
!= inline_function_decl
)
5634 for (fp
= outer_function_chain
; fp
; fp
= fp
->next
)
5635 if (fp
->decl
== fn_context
)
5638 /* Allocate run-time space for this trampoline
5639 (usually in the defining function's stack frame). */
5640 #ifdef ALLOCATE_TRAMPOLINE
5641 tramp
= ALLOCATE_TRAMPOLINE (fp
);
5643 /* If rounding needed, allocate extra space
5644 to ensure we have TRAMPOLINE_SIZE bytes left after rounding up. */
5645 #ifdef TRAMPOLINE_ALIGNMENT
5646 #define TRAMPOLINE_REAL_SIZE \
5647 (TRAMPOLINE_SIZE + (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT) - 1)
5649 #define TRAMPOLINE_REAL_SIZE (TRAMPOLINE_SIZE)
5651 tramp
= assign_stack_local_1 (BLKmode
, TRAMPOLINE_REAL_SIZE
, 0,
5655 /* Record the trampoline for reuse and note it for later initialization
5656 by expand_function_end. */
5659 rtlexp
= make_node (RTL_EXPR
);
5660 RTL_EXPR_RTL (rtlexp
) = tramp
;
5661 fp
->x_trampoline_list
= tree_cons (function
, rtlexp
,
5662 fp
->x_trampoline_list
);
5666 /* Make the RTL_EXPR node temporary, not momentary, so that the
5667 trampoline_list doesn't become garbage. */
5668 rtlexp
= make_node (RTL_EXPR
);
5670 RTL_EXPR_RTL (rtlexp
) = tramp
;
5671 trampoline_list
= tree_cons (function
, rtlexp
, trampoline_list
);
5674 tramp
= fix_lexical_addr (XEXP (tramp
, 0), function
);
5675 return adjust_trampoline_addr (tramp
);
5678 /* Given a trampoline address,
5679 round it to multiple of TRAMPOLINE_ALIGNMENT. */
5682 round_trampoline_addr (tramp
)
5685 #ifdef TRAMPOLINE_ALIGNMENT
5686 /* Round address up to desired boundary. */
5687 rtx temp
= gen_reg_rtx (Pmode
);
5688 rtx addend
= GEN_INT (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
- 1);
5689 rtx mask
= GEN_INT (-TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
5691 temp
= expand_simple_binop (Pmode
, PLUS
, tramp
, addend
,
5692 temp
, 0, OPTAB_LIB_WIDEN
);
5693 tramp
= expand_simple_binop (Pmode
, AND
, temp
, mask
,
5694 temp
, 0, OPTAB_LIB_WIDEN
);
5699 /* Given a trampoline address, round it then apply any
5700 platform-specific adjustments so that the result can be used for a
5704 adjust_trampoline_addr (tramp
)
5707 tramp
= round_trampoline_addr (tramp
);
5708 #ifdef TRAMPOLINE_ADJUST_ADDRESS
5709 TRAMPOLINE_ADJUST_ADDRESS (tramp
);
5714 /* Put all this function's BLOCK nodes including those that are chained
5715 onto the first block into a vector, and return it.
5716 Also store in each NOTE for the beginning or end of a block
5717 the index of that block in the vector.
5718 The arguments are BLOCK, the chain of top-level blocks of the function,
5719 and INSNS, the insn chain of the function. */
5725 tree
*block_vector
, *last_block_vector
;
5727 tree block
= DECL_INITIAL (current_function_decl
);
5732 /* Fill the BLOCK_VECTOR with all of the BLOCKs in this function, in
5733 depth-first order. */
5734 block_vector
= get_block_vector (block
, &n_blocks
);
5735 block_stack
= (tree
*) xmalloc (n_blocks
* sizeof (tree
));
5737 last_block_vector
= identify_blocks_1 (get_insns (),
5739 block_vector
+ n_blocks
,
5742 /* If we didn't use all of the subblocks, we've misplaced block notes. */
5743 /* ??? This appears to happen all the time. Latent bugs elsewhere? */
5744 if (0 && last_block_vector
!= block_vector
+ n_blocks
)
5747 free (block_vector
);
5751 /* Subroutine of identify_blocks. Do the block substitution on the
5752 insn chain beginning with INSNS. Recurse for CALL_PLACEHOLDER chains.
5754 BLOCK_STACK is pushed and popped for each BLOCK_BEGIN/BLOCK_END pair.
5755 BLOCK_VECTOR is incremented for each block seen. */
5758 identify_blocks_1 (insns
, block_vector
, end_block_vector
, orig_block_stack
)
5761 tree
*end_block_vector
;
5762 tree
*orig_block_stack
;
5765 tree
*block_stack
= orig_block_stack
;
5767 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
5769 if (GET_CODE (insn
) == NOTE
)
5771 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
)
5775 /* If there are more block notes than BLOCKs, something
5777 if (block_vector
== end_block_vector
)
5780 b
= *block_vector
++;
5781 NOTE_BLOCK (insn
) = b
;
5784 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
)
5786 /* If there are more NOTE_INSN_BLOCK_ENDs than
5787 NOTE_INSN_BLOCK_BEGs, something is badly wrong. */
5788 if (block_stack
== orig_block_stack
)
5791 NOTE_BLOCK (insn
) = *--block_stack
;
5794 else if (GET_CODE (insn
) == CALL_INSN
5795 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
5797 rtx cp
= PATTERN (insn
);
5799 block_vector
= identify_blocks_1 (XEXP (cp
, 0), block_vector
,
5800 end_block_vector
, block_stack
);
5802 block_vector
= identify_blocks_1 (XEXP (cp
, 1), block_vector
,
5803 end_block_vector
, block_stack
);
5805 block_vector
= identify_blocks_1 (XEXP (cp
, 2), block_vector
,
5806 end_block_vector
, block_stack
);
5810 /* If there are more NOTE_INSN_BLOCK_BEGINs than NOTE_INSN_BLOCK_ENDs,
5811 something is badly wrong. */
5812 if (block_stack
!= orig_block_stack
)
5815 return block_vector
;
5818 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
5819 and create duplicate blocks. */
5820 /* ??? Need an option to either create block fragments or to create
5821 abstract origin duplicates of a source block. It really depends
5822 on what optimization has been performed. */
5827 tree block
= DECL_INITIAL (current_function_decl
);
5828 varray_type block_stack
;
5830 if (block
== NULL_TREE
)
5833 VARRAY_TREE_INIT (block_stack
, 10, "block_stack");
5835 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
5836 reorder_blocks_0 (block
);
5838 /* Prune the old trees away, so that they don't get in the way. */
5839 BLOCK_SUBBLOCKS (block
) = NULL_TREE
;
5840 BLOCK_CHAIN (block
) = NULL_TREE
;
5842 /* Recreate the block tree from the note nesting. */
5843 reorder_blocks_1 (get_insns (), block
, &block_stack
);
5844 BLOCK_SUBBLOCKS (block
) = blocks_nreverse (BLOCK_SUBBLOCKS (block
));
5846 /* Remove deleted blocks from the block fragment chains. */
5847 reorder_fix_fragments (block
);
5849 VARRAY_FREE (block_stack
);
5852 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
5855 reorder_blocks_0 (block
)
5860 TREE_ASM_WRITTEN (block
) = 0;
5861 reorder_blocks_0 (BLOCK_SUBBLOCKS (block
));
5862 block
= BLOCK_CHAIN (block
);
5867 reorder_blocks_1 (insns
, current_block
, p_block_stack
)
5870 varray_type
*p_block_stack
;
5874 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
5876 if (GET_CODE (insn
) == NOTE
)
5878 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
)
5880 tree block
= NOTE_BLOCK (insn
);
5882 /* If we have seen this block before, that means it now
5883 spans multiple address regions. Create a new fragment. */
5884 if (TREE_ASM_WRITTEN (block
))
5886 tree new_block
= copy_node (block
);
5889 origin
= (BLOCK_FRAGMENT_ORIGIN (block
)
5890 ? BLOCK_FRAGMENT_ORIGIN (block
)
5892 BLOCK_FRAGMENT_ORIGIN (new_block
) = origin
;
5893 BLOCK_FRAGMENT_CHAIN (new_block
)
5894 = BLOCK_FRAGMENT_CHAIN (origin
);
5895 BLOCK_FRAGMENT_CHAIN (origin
) = new_block
;
5897 NOTE_BLOCK (insn
) = new_block
;
5901 BLOCK_SUBBLOCKS (block
) = 0;
5902 TREE_ASM_WRITTEN (block
) = 1;
5903 BLOCK_SUPERCONTEXT (block
) = current_block
;
5904 BLOCK_CHAIN (block
) = BLOCK_SUBBLOCKS (current_block
);
5905 BLOCK_SUBBLOCKS (current_block
) = block
;
5906 current_block
= block
;
5907 VARRAY_PUSH_TREE (*p_block_stack
, block
);
5909 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
)
5911 NOTE_BLOCK (insn
) = VARRAY_TOP_TREE (*p_block_stack
);
5912 VARRAY_POP (*p_block_stack
);
5913 BLOCK_SUBBLOCKS (current_block
)
5914 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block
));
5915 current_block
= BLOCK_SUPERCONTEXT (current_block
);
5918 else if (GET_CODE (insn
) == CALL_INSN
5919 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
5921 rtx cp
= PATTERN (insn
);
5922 reorder_blocks_1 (XEXP (cp
, 0), current_block
, p_block_stack
);
5924 reorder_blocks_1 (XEXP (cp
, 1), current_block
, p_block_stack
);
5926 reorder_blocks_1 (XEXP (cp
, 2), current_block
, p_block_stack
);
5931 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
5932 appears in the block tree, select one of the fragments to become
5933 the new origin block. */
5936 reorder_fix_fragments (block
)
5941 tree dup_origin
= BLOCK_FRAGMENT_ORIGIN (block
);
5942 tree new_origin
= NULL_TREE
;
5946 if (! TREE_ASM_WRITTEN (dup_origin
))
5948 new_origin
= BLOCK_FRAGMENT_CHAIN (dup_origin
);
5950 /* Find the first of the remaining fragments. There must
5951 be at least one -- the current block. */
5952 while (! TREE_ASM_WRITTEN (new_origin
))
5953 new_origin
= BLOCK_FRAGMENT_CHAIN (new_origin
);
5954 BLOCK_FRAGMENT_ORIGIN (new_origin
) = NULL_TREE
;
5957 else if (! dup_origin
)
5960 /* Re-root the rest of the fragments to the new origin. In the
5961 case that DUP_ORIGIN was null, that means BLOCK was the origin
5962 of a chain of fragments and we want to remove those fragments
5963 that didn't make it to the output. */
5966 tree
*pp
= &BLOCK_FRAGMENT_CHAIN (new_origin
);
5971 if (TREE_ASM_WRITTEN (chain
))
5973 BLOCK_FRAGMENT_ORIGIN (chain
) = new_origin
;
5975 pp
= &BLOCK_FRAGMENT_CHAIN (chain
);
5977 chain
= BLOCK_FRAGMENT_CHAIN (chain
);
5982 reorder_fix_fragments (BLOCK_SUBBLOCKS (block
));
5983 block
= BLOCK_CHAIN (block
);
5987 /* Reverse the order of elements in the chain T of blocks,
5988 and return the new head of the chain (old last element). */
5994 register tree prev
= 0, decl
, next
;
5995 for (decl
= t
; decl
; decl
= next
)
5997 next
= BLOCK_CHAIN (decl
);
5998 BLOCK_CHAIN (decl
) = prev
;
6004 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
6005 non-NULL, list them all into VECTOR, in a depth-first preorder
6006 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
6010 all_blocks (block
, vector
)
6018 TREE_ASM_WRITTEN (block
) = 0;
6020 /* Record this block. */
6022 vector
[n_blocks
] = block
;
6026 /* Record the subblocks, and their subblocks... */
6027 n_blocks
+= all_blocks (BLOCK_SUBBLOCKS (block
),
6028 vector
? vector
+ n_blocks
: 0);
6029 block
= BLOCK_CHAIN (block
);
6035 /* Return a vector containing all the blocks rooted at BLOCK. The
6036 number of elements in the vector is stored in N_BLOCKS_P. The
6037 vector is dynamically allocated; it is the caller's responsibility
6038 to call `free' on the pointer returned. */
6041 get_block_vector (block
, n_blocks_p
)
6047 *n_blocks_p
= all_blocks (block
, NULL
);
6048 block_vector
= (tree
*) xmalloc (*n_blocks_p
* sizeof (tree
));
6049 all_blocks (block
, block_vector
);
6051 return block_vector
;
6054 static int next_block_index
= 2;
6056 /* Set BLOCK_NUMBER for all the blocks in FN. */
6066 /* For SDB and XCOFF debugging output, we start numbering the blocks
6067 from 1 within each function, rather than keeping a running
6069 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
6070 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
6071 next_block_index
= 1;
6074 block_vector
= get_block_vector (DECL_INITIAL (fn
), &n_blocks
);
6076 /* The top-level BLOCK isn't numbered at all. */
6077 for (i
= 1; i
< n_blocks
; ++i
)
6078 /* We number the blocks from two. */
6079 BLOCK_NUMBER (block_vector
[i
]) = next_block_index
++;
6081 free (block_vector
);
6086 /* Allocate a function structure and reset its contents to the defaults. */
6088 prepare_function_start ()
6090 cfun
= (struct function
*) xcalloc (1, sizeof (struct function
));
6092 init_stmt_for_function ();
6093 init_eh_for_function ();
6095 cse_not_expected
= ! optimize
;
6097 /* Caller save not needed yet. */
6098 caller_save_needed
= 0;
6100 /* No stack slots have been made yet. */
6101 stack_slot_list
= 0;
6103 current_function_has_nonlocal_label
= 0;
6104 current_function_has_nonlocal_goto
= 0;
6106 /* There is no stack slot for handling nonlocal gotos. */
6107 nonlocal_goto_handler_slots
= 0;
6108 nonlocal_goto_stack_level
= 0;
6110 /* No labels have been declared for nonlocal use. */
6111 nonlocal_labels
= 0;
6112 nonlocal_goto_handler_labels
= 0;
6114 /* No function calls so far in this function. */
6115 function_call_count
= 0;
6117 /* No parm regs have been allocated.
6118 (This is important for output_inline_function.) */
6119 max_parm_reg
= LAST_VIRTUAL_REGISTER
+ 1;
6121 /* Initialize the RTL mechanism. */
6124 /* Initialize the queue of pending postincrement and postdecrements,
6125 and some other info in expr.c. */
6128 /* We haven't done register allocation yet. */
6131 init_varasm_status (cfun
);
6133 /* Clear out data used for inlining. */
6134 cfun
->inlinable
= 0;
6135 cfun
->original_decl_initial
= 0;
6136 cfun
->original_arg_vector
= 0;
6138 cfun
->stack_alignment_needed
= STACK_BOUNDARY
;
6139 cfun
->preferred_stack_boundary
= STACK_BOUNDARY
;
6141 /* Set if a call to setjmp is seen. */
6142 current_function_calls_setjmp
= 0;
6144 /* Set if a call to longjmp is seen. */
6145 current_function_calls_longjmp
= 0;
6147 current_function_calls_alloca
= 0;
6148 current_function_contains_functions
= 0;
6149 current_function_is_leaf
= 0;
6150 current_function_nothrow
= 0;
6151 current_function_sp_is_unchanging
= 0;
6152 current_function_uses_only_leaf_regs
= 0;
6153 current_function_has_computed_jump
= 0;
6154 current_function_is_thunk
= 0;
6156 current_function_returns_pcc_struct
= 0;
6157 current_function_returns_struct
= 0;
6158 current_function_epilogue_delay_list
= 0;
6159 current_function_uses_const_pool
= 0;
6160 current_function_uses_pic_offset_table
= 0;
6161 current_function_cannot_inline
= 0;
6163 /* We have not yet needed to make a label to jump to for tail-recursion. */
6164 tail_recursion_label
= 0;
6166 /* We haven't had a need to make a save area for ap yet. */
6167 arg_pointer_save_area
= 0;
6169 /* No stack slots allocated yet. */
6172 /* No SAVE_EXPRs in this function yet. */
6175 /* No RTL_EXPRs in this function yet. */
6178 /* Set up to allocate temporaries. */
6181 /* Indicate that we need to distinguish between the return value of the
6182 present function and the return value of a function being called. */
6183 rtx_equal_function_value_matters
= 1;
6185 /* Indicate that we have not instantiated virtual registers yet. */
6186 virtuals_instantiated
= 0;
6188 /* Indicate that we want CONCATs now. */
6189 generating_concat_p
= 1;
6191 /* Indicate we have no need of a frame pointer yet. */
6192 frame_pointer_needed
= 0;
6194 /* By default assume not varargs or stdarg. */
6195 current_function_varargs
= 0;
6196 current_function_stdarg
= 0;
6198 /* We haven't made any trampolines for this function yet. */
6199 trampoline_list
= 0;
6201 init_pending_stack_adjust ();
6202 inhibit_defer_pop
= 0;
6204 current_function_outgoing_args_size
= 0;
6206 if (init_lang_status
)
6207 (*init_lang_status
) (cfun
);
6208 if (init_machine_status
)
6209 (*init_machine_status
) (cfun
);
6212 /* Initialize the rtl expansion mechanism so that we can do simple things
6213 like generate sequences. This is used to provide a context during global
6214 initialization of some passes. */
6216 init_dummy_function_start ()
6218 prepare_function_start ();
6221 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
6222 and initialize static variables for generating RTL for the statements
6226 init_function_start (subr
, filename
, line
)
6228 const char *filename
;
6231 prepare_function_start ();
6233 /* Remember this function for later. */
6234 cfun
->next_global
= all_functions
;
6235 all_functions
= cfun
;
6237 current_function_name
= (*decl_printable_name
) (subr
, 2);
6240 /* Nonzero if this is a nested function that uses a static chain. */
6242 current_function_needs_context
6243 = (decl_function_context (current_function_decl
) != 0
6244 && ! DECL_NO_STATIC_CHAIN (current_function_decl
));
6246 /* Within function body, compute a type's size as soon it is laid out. */
6247 immediate_size_expand
++;
6249 /* Prevent ever trying to delete the first instruction of a function.
6250 Also tell final how to output a linenum before the function prologue.
6251 Note linenums could be missing, e.g. when compiling a Java .class file. */
6253 emit_line_note (filename
, line
);
6255 /* Make sure first insn is a note even if we don't want linenums.
6256 This makes sure the first insn will never be deleted.
6257 Also, final expects a note to appear there. */
6258 emit_note (NULL
, NOTE_INSN_DELETED
);
6260 /* Set flags used by final.c. */
6261 if (aggregate_value_p (DECL_RESULT (subr
)))
6263 #ifdef PCC_STATIC_STRUCT_RETURN
6264 current_function_returns_pcc_struct
= 1;
6266 current_function_returns_struct
= 1;
6269 /* Warn if this value is an aggregate type,
6270 regardless of which calling convention we are using for it. */
6271 if (warn_aggregate_return
6272 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr
))))
6273 warning ("function returns an aggregate");
6275 current_function_returns_pointer
6276 = POINTER_TYPE_P (TREE_TYPE (DECL_RESULT (subr
)));
6279 /* Make sure all values used by the optimization passes have sane
6282 init_function_for_compilation ()
6286 /* No prologue/epilogue insns yet. */
6287 VARRAY_GROW (prologue
, 0);
6288 VARRAY_GROW (epilogue
, 0);
6289 VARRAY_GROW (sibcall_epilogue
, 0);
6292 /* Indicate that the current function uses extra args
6293 not explicitly mentioned in the argument list in any fashion. */
6298 current_function_varargs
= 1;
6301 /* Expand a call to __main at the beginning of a possible main function. */
6303 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
6304 #undef HAS_INIT_SECTION
6305 #define HAS_INIT_SECTION
6309 expand_main_function ()
6311 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
6312 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
)
6314 int align
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
6317 /* Forcibly align the stack. */
6318 #ifdef STACK_GROWS_DOWNWARD
6319 tmp
= expand_simple_binop (Pmode
, AND
, stack_pointer_rtx
, GEN_INT(-align
),
6320 stack_pointer_rtx
, 1, OPTAB_WIDEN
);
6322 tmp
= expand_simple_binop (Pmode
, PLUS
, stack_pointer_rtx
,
6323 GEN_INT (align
- 1), NULL_RTX
, 1, OPTAB_WIDEN
);
6324 tmp
= expand_simple_binop (Pmode
, AND
, tmp
, GEN_INT (-align
),
6325 stack_pointer_rtx
, 1, OPTAB_WIDEN
);
6327 if (tmp
!= stack_pointer_rtx
)
6328 emit_move_insn (stack_pointer_rtx
, tmp
);
6330 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
6331 tmp
= force_reg (Pmode
, const0_rtx
);
6332 allocate_dynamic_stack_space (tmp
, NULL_RTX
, BIGGEST_ALIGNMENT
);
6336 #ifndef HAS_INIT_SECTION
6337 emit_library_call (gen_rtx_SYMBOL_REF (Pmode
, NAME__MAIN
), 0,
6342 extern struct obstack permanent_obstack
;
6344 /* The PENDING_SIZES represent the sizes of variable-sized types.
6345 Create RTL for the various sizes now (using temporary variables),
6346 so that we can refer to the sizes from the RTL we are generating
6347 for the current function. The PENDING_SIZES are a TREE_LIST. The
6348 TREE_VALUE of each node is a SAVE_EXPR. */
6351 expand_pending_sizes (pending_sizes
)
6356 /* Evaluate now the sizes of any types declared among the arguments. */
6357 for (tem
= pending_sizes
; tem
; tem
= TREE_CHAIN (tem
))
6359 expand_expr (TREE_VALUE (tem
), const0_rtx
, VOIDmode
,
6360 EXPAND_MEMORY_USE_BAD
);
6361 /* Flush the queue in case this parameter declaration has
6367 /* Start the RTL for a new function, and set variables used for
6369 SUBR is the FUNCTION_DECL node.
6370 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
6371 the function's parameters, which must be run at any return statement. */
6374 expand_function_start (subr
, parms_have_cleanups
)
6376 int parms_have_cleanups
;
6379 rtx last_ptr
= NULL_RTX
;
6381 /* Make sure volatile mem refs aren't considered
6382 valid operands of arithmetic insns. */
6383 init_recog_no_volatile ();
6385 /* Set this before generating any memory accesses. */
6386 current_function_check_memory_usage
6387 = (flag_check_memory_usage
6388 && ! DECL_NO_CHECK_MEMORY_USAGE (current_function_decl
));
6390 current_function_instrument_entry_exit
6391 = (flag_instrument_function_entry_exit
6392 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr
));
6394 current_function_limit_stack
6395 = (stack_limit_rtx
!= NULL_RTX
&& ! DECL_NO_LIMIT_STACK (subr
));
6397 /* If function gets a static chain arg, store it in the stack frame.
6398 Do this first, so it gets the first stack slot offset. */
6399 if (current_function_needs_context
)
6401 last_ptr
= assign_stack_local (Pmode
, GET_MODE_SIZE (Pmode
), 0);
6403 /* Delay copying static chain if it is not a register to avoid
6404 conflicts with regs used for parameters. */
6405 if (! SMALL_REGISTER_CLASSES
6406 || GET_CODE (static_chain_incoming_rtx
) == REG
)
6407 emit_move_insn (last_ptr
, static_chain_incoming_rtx
);
6410 /* If the parameters of this function need cleaning up, get a label
6411 for the beginning of the code which executes those cleanups. This must
6412 be done before doing anything with return_label. */
6413 if (parms_have_cleanups
)
6414 cleanup_label
= gen_label_rtx ();
6418 /* Make the label for return statements to jump to. Do not special
6419 case machines with special return instructions -- they will be
6420 handled later during jump, ifcvt, or epilogue creation. */
6421 return_label
= gen_label_rtx ();
6423 /* Initialize rtx used to return the value. */
6424 /* Do this before assign_parms so that we copy the struct value address
6425 before any library calls that assign parms might generate. */
6427 /* Decide whether to return the value in memory or in a register. */
6428 if (aggregate_value_p (DECL_RESULT (subr
)))
6430 /* Returning something that won't go in a register. */
6431 register rtx value_address
= 0;
6433 #ifdef PCC_STATIC_STRUCT_RETURN
6434 if (current_function_returns_pcc_struct
)
6436 int size
= int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr
)));
6437 value_address
= assemble_static_space (size
);
6442 /* Expect to be passed the address of a place to store the value.
6443 If it is passed as an argument, assign_parms will take care of
6445 if (struct_value_incoming_rtx
)
6447 value_address
= gen_reg_rtx (Pmode
);
6448 emit_move_insn (value_address
, struct_value_incoming_rtx
);
6453 rtx x
= gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr
)), value_address
);
6454 set_mem_attributes (x
, DECL_RESULT (subr
), 1);
6455 SET_DECL_RTL (DECL_RESULT (subr
), x
);
6458 else if (DECL_MODE (DECL_RESULT (subr
)) == VOIDmode
)
6459 /* If return mode is void, this decl rtl should not be used. */
6460 SET_DECL_RTL (DECL_RESULT (subr
), NULL_RTX
);
6463 /* Compute the return values into a pseudo reg, which we will copy
6464 into the true return register after the cleanups are done. */
6466 /* In order to figure out what mode to use for the pseudo, we
6467 figure out what the mode of the eventual return register will
6468 actually be, and use that. */
6470 = hard_function_value (TREE_TYPE (DECL_RESULT (subr
)),
6473 /* Structures that are returned in registers are not aggregate_value_p,
6474 so we may see a PARALLEL. Don't play pseudo games with this. */
6475 if (! REG_P (hard_reg
))
6476 SET_DECL_RTL (DECL_RESULT (subr
), hard_reg
);
6479 /* Create the pseudo. */
6480 SET_DECL_RTL (DECL_RESULT (subr
), gen_reg_rtx (GET_MODE (hard_reg
)));
6482 /* Needed because we may need to move this to memory
6483 in case it's a named return value whose address is taken. */
6484 DECL_REGISTER (DECL_RESULT (subr
)) = 1;
6488 /* Initialize rtx for parameters and local variables.
6489 In some cases this requires emitting insns. */
6491 assign_parms (subr
);
6493 /* Copy the static chain now if it wasn't a register. The delay is to
6494 avoid conflicts with the parameter passing registers. */
6496 if (SMALL_REGISTER_CLASSES
&& current_function_needs_context
)
6497 if (GET_CODE (static_chain_incoming_rtx
) != REG
)
6498 emit_move_insn (last_ptr
, static_chain_incoming_rtx
);
6500 /* The following was moved from init_function_start.
6501 The move is supposed to make sdb output more accurate. */
6502 /* Indicate the beginning of the function body,
6503 as opposed to parm setup. */
6504 emit_note (NULL
, NOTE_INSN_FUNCTION_BEG
);
6506 if (GET_CODE (get_last_insn ()) != NOTE
)
6507 emit_note (NULL
, NOTE_INSN_DELETED
);
6508 parm_birth_insn
= get_last_insn ();
6510 context_display
= 0;
6511 if (current_function_needs_context
)
6513 /* Fetch static chain values for containing functions. */
6514 tem
= decl_function_context (current_function_decl
);
6515 /* Copy the static chain pointer into a pseudo. If we have
6516 small register classes, copy the value from memory if
6517 static_chain_incoming_rtx is a REG. */
6520 /* If the static chain originally came in a register, put it back
6521 there, then move it out in the next insn. The reason for
6522 this peculiar code is to satisfy function integration. */
6523 if (SMALL_REGISTER_CLASSES
6524 && GET_CODE (static_chain_incoming_rtx
) == REG
)
6525 emit_move_insn (static_chain_incoming_rtx
, last_ptr
);
6526 last_ptr
= copy_to_reg (static_chain_incoming_rtx
);
6531 tree rtlexp
= make_node (RTL_EXPR
);
6533 RTL_EXPR_RTL (rtlexp
) = last_ptr
;
6534 context_display
= tree_cons (tem
, rtlexp
, context_display
);
6535 tem
= decl_function_context (tem
);
6538 /* Chain thru stack frames, assuming pointer to next lexical frame
6539 is found at the place we always store it. */
6540 #ifdef FRAME_GROWS_DOWNWARD
6541 last_ptr
= plus_constant (last_ptr
,
6542 -(HOST_WIDE_INT
) GET_MODE_SIZE (Pmode
));
6544 last_ptr
= gen_rtx_MEM (Pmode
, memory_address (Pmode
, last_ptr
));
6545 MEM_ALIAS_SET (last_ptr
) = get_frame_alias_set ();
6546 last_ptr
= copy_to_reg (last_ptr
);
6548 /* If we are not optimizing, ensure that we know that this
6549 piece of context is live over the entire function. */
6551 save_expr_regs
= gen_rtx_EXPR_LIST (VOIDmode
, last_ptr
,
6556 if (current_function_instrument_entry_exit
)
6558 rtx fun
= DECL_RTL (current_function_decl
);
6559 if (GET_CODE (fun
) == MEM
)
6560 fun
= XEXP (fun
, 0);
6563 emit_library_call (profile_function_entry_libfunc
, 0, VOIDmode
, 2,
6565 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS
,
6567 hard_frame_pointer_rtx
),
6573 PROFILE_HOOK (profile_label_no
);
6576 /* After the display initializations is where the tail-recursion label
6577 should go, if we end up needing one. Ensure we have a NOTE here
6578 since some things (like trampolines) get placed before this. */
6579 tail_recursion_reentry
= emit_note (NULL
, NOTE_INSN_DELETED
);
6581 /* Evaluate now the sizes of any types declared among the arguments. */
6582 expand_pending_sizes (nreverse (get_pending_sizes ()));
6584 /* Make sure there is a line number after the function entry setup code. */
6585 force_next_line_note ();
6588 /* Undo the effects of init_dummy_function_start. */
6590 expand_dummy_function_end ()
6592 /* End any sequences that failed to be closed due to syntax errors. */
6593 while (in_sequence_p ())
6596 /* Outside function body, can't compute type's actual size
6597 until next function's body starts. */
6599 free_after_parsing (cfun
);
6600 free_after_compilation (cfun
);
6605 /* Call DOIT for each hard register used as a return value from
6606 the current function. */
6609 diddle_return_value (doit
, arg
)
6610 void (*doit
) PARAMS ((rtx
, void *));
6613 rtx outgoing
= current_function_return_rtx
;
6618 if (GET_CODE (outgoing
) == REG
)
6619 (*doit
) (outgoing
, arg
);
6620 else if (GET_CODE (outgoing
) == PARALLEL
)
6624 for (i
= 0; i
< XVECLEN (outgoing
, 0); i
++)
6626 rtx x
= XEXP (XVECEXP (outgoing
, 0, i
), 0);
6628 if (GET_CODE (x
) == REG
&& REGNO (x
) < FIRST_PSEUDO_REGISTER
)
6635 do_clobber_return_reg (reg
, arg
)
6637 void *arg ATTRIBUTE_UNUSED
;
6639 emit_insn (gen_rtx_CLOBBER (VOIDmode
, reg
));
6643 clobber_return_register ()
6645 diddle_return_value (do_clobber_return_reg
, NULL
);
6647 /* In case we do use pseudo to return value, clobber it too. */
6648 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
6650 tree decl_result
= DECL_RESULT (current_function_decl
);
6651 rtx decl_rtl
= DECL_RTL (decl_result
);
6652 if (REG_P (decl_rtl
) && REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
)
6654 do_clobber_return_reg (decl_rtl
, NULL
);
6660 do_use_return_reg (reg
, arg
)
6662 void *arg ATTRIBUTE_UNUSED
;
6664 emit_insn (gen_rtx_USE (VOIDmode
, reg
));
6668 use_return_register ()
6670 diddle_return_value (do_use_return_reg
, NULL
);
6673 /* Generate RTL for the end of the current function.
6674 FILENAME and LINE are the current position in the source file.
6676 It is up to language-specific callers to do cleanups for parameters--
6677 or else, supply 1 for END_BINDINGS and we will call expand_end_bindings. */
6680 expand_function_end (filename
, line
, end_bindings
)
6681 const char *filename
;
6688 #ifdef TRAMPOLINE_TEMPLATE
6689 static rtx initial_trampoline
;
6692 finish_expr_for_function ();
6694 #ifdef NON_SAVING_SETJMP
6695 /* Don't put any variables in registers if we call setjmp
6696 on a machine that fails to restore the registers. */
6697 if (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
6699 if (DECL_INITIAL (current_function_decl
) != error_mark_node
)
6700 setjmp_protect (DECL_INITIAL (current_function_decl
));
6702 setjmp_protect_args ();
6706 /* Save the argument pointer if a save area was made for it. */
6707 if (arg_pointer_save_area
)
6709 /* arg_pointer_save_area may not be a valid memory address, so we
6710 have to check it and fix it if necessary. */
6713 emit_move_insn (validize_mem (arg_pointer_save_area
),
6714 virtual_incoming_args_rtx
);
6715 seq
= gen_sequence ();
6717 emit_insn_before (seq
, tail_recursion_reentry
);
6720 /* Initialize any trampolines required by this function. */
6721 for (link
= trampoline_list
; link
; link
= TREE_CHAIN (link
))
6723 tree function
= TREE_PURPOSE (link
);
6724 rtx context ATTRIBUTE_UNUSED
= lookup_static_chain (function
);
6725 rtx tramp
= RTL_EXPR_RTL (TREE_VALUE (link
));
6726 #ifdef TRAMPOLINE_TEMPLATE
6731 #ifdef TRAMPOLINE_TEMPLATE
6732 /* First make sure this compilation has a template for
6733 initializing trampolines. */
6734 if (initial_trampoline
== 0)
6737 = gen_rtx_MEM (BLKmode
, assemble_trampoline_template ());
6739 ggc_add_rtx_root (&initial_trampoline
, 1);
6743 /* Generate insns to initialize the trampoline. */
6745 tramp
= round_trampoline_addr (XEXP (tramp
, 0));
6746 #ifdef TRAMPOLINE_TEMPLATE
6747 blktramp
= change_address (initial_trampoline
, BLKmode
, tramp
);
6748 emit_block_move (blktramp
, initial_trampoline
,
6749 GEN_INT (TRAMPOLINE_SIZE
),
6750 TRAMPOLINE_ALIGNMENT
);
6752 INITIALIZE_TRAMPOLINE (tramp
, XEXP (DECL_RTL (function
), 0), context
);
6756 /* Put those insns at entry to the containing function (this one). */
6757 emit_insns_before (seq
, tail_recursion_reentry
);
6760 /* If we are doing stack checking and this function makes calls,
6761 do a stack probe at the start of the function to ensure we have enough
6762 space for another stack frame. */
6763 if (flag_stack_check
&& ! STACK_CHECK_BUILTIN
)
6767 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
6768 if (GET_CODE (insn
) == CALL_INSN
)
6771 probe_stack_range (STACK_CHECK_PROTECT
,
6772 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE
));
6775 emit_insns_before (seq
, tail_recursion_reentry
);
6780 /* Warn about unused parms if extra warnings were specified. */
6781 /* Either ``-W -Wunused'' or ``-Wunused-parameter'' enables this
6782 warning. WARN_UNUSED_PARAMETER is negative when set by
6784 if (warn_unused_parameter
> 0
6785 || (warn_unused_parameter
< 0 && extra_warnings
))
6789 for (decl
= DECL_ARGUMENTS (current_function_decl
);
6790 decl
; decl
= TREE_CHAIN (decl
))
6791 if (! TREE_USED (decl
) && TREE_CODE (decl
) == PARM_DECL
6792 && DECL_NAME (decl
) && ! DECL_ARTIFICIAL (decl
))
6793 warning_with_decl (decl
, "unused parameter `%s'");
6796 /* Delete handlers for nonlocal gotos if nothing uses them. */
6797 if (nonlocal_goto_handler_slots
!= 0
6798 && ! current_function_has_nonlocal_label
)
6801 /* End any sequences that failed to be closed due to syntax errors. */
6802 while (in_sequence_p ())
6805 /* Outside function body, can't compute type's actual size
6806 until next function's body starts. */
6807 immediate_size_expand
--;
6809 clear_pending_stack_adjust ();
6810 do_pending_stack_adjust ();
6812 /* Mark the end of the function body.
6813 If control reaches this insn, the function can drop through
6814 without returning a value. */
6815 emit_note (NULL
, NOTE_INSN_FUNCTION_END
);
6817 /* Must mark the last line number note in the function, so that the test
6818 coverage code can avoid counting the last line twice. This just tells
6819 the code to ignore the immediately following line note, since there
6820 already exists a copy of this note somewhere above. This line number
6821 note is still needed for debugging though, so we can't delete it. */
6822 if (flag_test_coverage
)
6823 emit_note (NULL
, NOTE_INSN_REPEATED_LINE_NUMBER
);
6825 /* Output a linenumber for the end of the function.
6826 SDB depends on this. */
6827 emit_line_note_force (filename
, line
);
6829 /* Before the return label (if any), clobber the return
6830 registers so that they are not propogated live to the rest of
6831 the function. This can only happen with functions that drop
6832 through; if there had been a return statement, there would
6833 have either been a return rtx, or a jump to the return label.
6835 We delay actual code generation after the current_function_value_rtx
6837 clobber_after
= get_last_insn ();
6839 /* Output the label for the actual return from the function,
6840 if one is expected. This happens either because a function epilogue
6841 is used instead of a return instruction, or because a return was done
6842 with a goto in order to run local cleanups, or because of pcc-style
6843 structure returning. */
6845 emit_label (return_label
);
6847 /* C++ uses this. */
6849 expand_end_bindings (0, 0, 0);
6851 if (current_function_instrument_entry_exit
)
6853 rtx fun
= DECL_RTL (current_function_decl
);
6854 if (GET_CODE (fun
) == MEM
)
6855 fun
= XEXP (fun
, 0);
6858 emit_library_call (profile_function_exit_libfunc
, 0, VOIDmode
, 2,
6860 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS
,
6862 hard_frame_pointer_rtx
),
6866 /* Let except.c know where it should emit the call to unregister
6867 the function context for sjlj exceptions. */
6868 if (flag_exceptions
&& USING_SJLJ_EXCEPTIONS
)
6869 sjlj_emit_function_exit_after (get_last_insn ());
6871 /* If we had calls to alloca, and this machine needs
6872 an accurate stack pointer to exit the function,
6873 insert some code to save and restore the stack pointer. */
6874 #ifdef EXIT_IGNORE_STACK
6875 if (! EXIT_IGNORE_STACK
)
6877 if (current_function_calls_alloca
)
6881 emit_stack_save (SAVE_FUNCTION
, &tem
, parm_birth_insn
);
6882 emit_stack_restore (SAVE_FUNCTION
, tem
, NULL_RTX
);
6885 /* If scalar return value was computed in a pseudo-reg, or was a named
6886 return value that got dumped to the stack, copy that to the hard
6888 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
6890 tree decl_result
= DECL_RESULT (current_function_decl
);
6891 rtx decl_rtl
= DECL_RTL (decl_result
);
6893 if (REG_P (decl_rtl
)
6894 ? REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
6895 : DECL_REGISTER (decl_result
))
6899 #ifdef FUNCTION_OUTGOING_VALUE
6900 real_decl_rtl
= FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result
),
6901 current_function_decl
);
6903 real_decl_rtl
= FUNCTION_VALUE (TREE_TYPE (decl_result
),
6904 current_function_decl
);
6906 REG_FUNCTION_VALUE_P (real_decl_rtl
) = 1;
6908 /* If this is a BLKmode structure being returned in registers,
6909 then use the mode computed in expand_return. Note that if
6910 decl_rtl is memory, then its mode may have been changed,
6911 but that current_function_return_rtx has not. */
6912 if (GET_MODE (real_decl_rtl
) == BLKmode
)
6913 PUT_MODE (real_decl_rtl
, GET_MODE (current_function_return_rtx
));
6915 /* If a named return value dumped decl_return to memory, then
6916 we may need to re-do the PROMOTE_MODE signed/unsigned
6918 if (GET_MODE (real_decl_rtl
) != GET_MODE (decl_rtl
))
6920 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (decl_result
));
6922 #ifdef PROMOTE_FUNCTION_RETURN
6923 promote_mode (TREE_TYPE (decl_result
), GET_MODE (decl_rtl
),
6927 convert_move (real_decl_rtl
, decl_rtl
, unsignedp
);
6929 else if (GET_CODE (real_decl_rtl
) == PARALLEL
)
6930 emit_group_load (real_decl_rtl
, decl_rtl
,
6931 int_size_in_bytes (TREE_TYPE (decl_result
)),
6932 TYPE_ALIGN (TREE_TYPE (decl_result
)));
6934 emit_move_insn (real_decl_rtl
, decl_rtl
);
6936 /* The delay slot scheduler assumes that current_function_return_rtx
6937 holds the hard register containing the return value, not a
6938 temporary pseudo. */
6939 current_function_return_rtx
= real_decl_rtl
;
6943 /* If returning a structure, arrange to return the address of the value
6944 in a place where debuggers expect to find it.
6946 If returning a structure PCC style,
6947 the caller also depends on this value.
6948 And current_function_returns_pcc_struct is not necessarily set. */
6949 if (current_function_returns_struct
6950 || current_function_returns_pcc_struct
)
6953 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl
)), 0);
6954 tree type
= TREE_TYPE (DECL_RESULT (current_function_decl
));
6955 #ifdef FUNCTION_OUTGOING_VALUE
6957 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type
),
6958 current_function_decl
);
6961 = FUNCTION_VALUE (build_pointer_type (type
), current_function_decl
);
6964 /* Mark this as a function return value so integrate will delete the
6965 assignment and USE below when inlining this function. */
6966 REG_FUNCTION_VALUE_P (outgoing
) = 1;
6968 #ifdef POINTERS_EXTEND_UNSIGNED
6969 /* The address may be ptr_mode and OUTGOING may be Pmode. */
6970 if (GET_MODE (outgoing
) != GET_MODE (value_address
))
6971 value_address
= convert_memory_address (GET_MODE (outgoing
),
6975 emit_move_insn (outgoing
, value_address
);
6977 /* Show return register used to hold result (in this case the address
6979 current_function_return_rtx
= outgoing
;
6982 /* If this is an implementation of throw, do what's necessary to
6983 communicate between __builtin_eh_return and the epilogue. */
6984 expand_eh_return ();
6986 /* Emit the actual code to clobber return register. */
6991 clobber_return_register ();
6992 seq
= gen_sequence ();
6995 after
= emit_insn_after (seq
, clobber_after
);
6997 if (clobber_after
!= after
)
6998 cfun
->x_clobber_return_insn
= after
;
7001 /* ??? This should no longer be necessary since stupid is no longer with
7002 us, but there are some parts of the compiler (eg reload_combine, and
7003 sh mach_dep_reorg) that still try and compute their own lifetime info
7004 instead of using the general framework. */
7005 use_return_register ();
7007 /* Fix up any gotos that jumped out to the outermost
7008 binding level of the function.
7009 Must follow emitting RETURN_LABEL. */
7011 /* If you have any cleanups to do at this point,
7012 and they need to create temporary variables,
7013 then you will lose. */
7014 expand_fixups (get_insns ());
7017 /* Extend a vector that records the INSN_UIDs of INSNS (either a
7018 sequence or a single insn). */
7021 record_insns (insns
, vecp
)
7025 if (GET_CODE (insns
) == SEQUENCE
)
7027 int len
= XVECLEN (insns
, 0);
7028 int i
= VARRAY_SIZE (*vecp
);
7030 VARRAY_GROW (*vecp
, i
+ len
);
7033 VARRAY_INT (*vecp
, i
) = INSN_UID (XVECEXP (insns
, 0, len
));
7039 int i
= VARRAY_SIZE (*vecp
);
7040 VARRAY_GROW (*vecp
, i
+ 1);
7041 VARRAY_INT (*vecp
, i
) = INSN_UID (insns
);
7045 /* Determine how many INSN_UIDs in VEC are part of INSN. */
7048 contains (insn
, vec
)
7054 if (GET_CODE (insn
) == INSN
7055 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
7058 for (i
= XVECLEN (PATTERN (insn
), 0) - 1; i
>= 0; i
--)
7059 for (j
= VARRAY_SIZE (vec
) - 1; j
>= 0; --j
)
7060 if (INSN_UID (XVECEXP (PATTERN (insn
), 0, i
)) == VARRAY_INT (vec
, j
))
7066 for (j
= VARRAY_SIZE (vec
) - 1; j
>= 0; --j
)
7067 if (INSN_UID (insn
) == VARRAY_INT (vec
, j
))
7074 prologue_epilogue_contains (insn
)
7077 if (contains (insn
, prologue
))
7079 if (contains (insn
, epilogue
))
7085 sibcall_epilogue_contains (insn
)
7088 if (sibcall_epilogue
)
7089 return contains (insn
, sibcall_epilogue
);
7094 /* Insert gen_return at the end of block BB. This also means updating
7095 block_for_insn appropriately. */
7098 emit_return_into_block (bb
, line_note
)
7104 p
= NEXT_INSN (bb
->end
);
7105 end
= emit_jump_insn_after (gen_return (), bb
->end
);
7107 emit_line_note_after (NOTE_SOURCE_FILE (line_note
),
7108 NOTE_LINE_NUMBER (line_note
), bb
->end
);
7112 set_block_for_insn (p
, bb
);
7119 #endif /* HAVE_return */
7121 #ifdef HAVE_epilogue
7123 /* Modify SEQ, a SEQUENCE that is part of the epilogue, to no modifications
7124 to the stack pointer. */
7127 keep_stack_depressed (seq
)
7131 rtx sp_from_reg
= 0;
7132 int sp_modified_unknown
= 0;
7134 /* If the epilogue is just a single instruction, it's OK as is */
7136 if (GET_CODE (seq
) != SEQUENCE
)
7139 /* Scan all insns in SEQ looking for ones that modified the stack
7140 pointer. Record if it modified the stack pointer by copying it
7141 from the frame pointer or if it modified it in some other way.
7142 Then modify any subsequent stack pointer references to take that
7143 into account. We start by only allowing SP to be copied from a
7144 register (presumably FP) and then be subsequently referenced. */
7146 for (i
= 0; i
< XVECLEN (seq
, 0); i
++)
7148 rtx insn
= XVECEXP (seq
, 0, i
);
7150 if (GET_RTX_CLASS (GET_CODE (insn
)) != 'i')
7153 if (reg_set_p (stack_pointer_rtx
, insn
))
7155 rtx set
= single_set (insn
);
7157 /* If SP is set as a side-effect, we can't support this. */
7161 if (GET_CODE (SET_SRC (set
)) == REG
)
7162 sp_from_reg
= SET_SRC (set
);
7164 sp_modified_unknown
= 1;
7166 /* Don't allow the SP modification to happen. */
7167 PUT_CODE (insn
, NOTE
);
7168 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
7169 NOTE_SOURCE_FILE (insn
) = 0;
7171 else if (reg_referenced_p (stack_pointer_rtx
, PATTERN (insn
)))
7173 if (sp_modified_unknown
)
7176 else if (sp_from_reg
!= 0)
7178 = replace_rtx (PATTERN (insn
), stack_pointer_rtx
, sp_from_reg
);
7184 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
7185 this into place with notes indicating where the prologue ends and where
7186 the epilogue begins. Update the basic block information when possible. */
7189 thread_prologue_and_epilogue_insns (f
)
7190 rtx f ATTRIBUTE_UNUSED
;
7195 #ifdef HAVE_prologue
7196 rtx prologue_end
= NULL_RTX
;
7198 #if defined (HAVE_epilogue) || defined(HAVE_return)
7199 rtx epilogue_end
= NULL_RTX
;
7202 #ifdef HAVE_prologue
7206 seq
= gen_prologue ();
7209 /* Retain a map of the prologue insns. */
7210 if (GET_CODE (seq
) != SEQUENCE
)
7212 record_insns (seq
, &prologue
);
7213 prologue_end
= emit_note (NULL
, NOTE_INSN_PROLOGUE_END
);
7215 seq
= gen_sequence ();
7218 /* Can't deal with multiple successsors of the entry block
7219 at the moment. Function should always have at least one
7221 if (!ENTRY_BLOCK_PTR
->succ
|| ENTRY_BLOCK_PTR
->succ
->succ_next
)
7224 insert_insn_on_edge (seq
, ENTRY_BLOCK_PTR
->succ
);
7229 /* If the exit block has no non-fake predecessors, we don't need
7231 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
7232 if ((e
->flags
& EDGE_FAKE
) == 0)
7238 if (optimize
&& HAVE_return
)
7240 /* If we're allowed to generate a simple return instruction,
7241 then by definition we don't need a full epilogue. Examine
7242 the block that falls through to EXIT. If it does not
7243 contain any code, examine its predecessors and try to
7244 emit (conditional) return instructions. */
7250 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
7251 if (e
->flags
& EDGE_FALLTHRU
)
7257 /* Verify that there are no active instructions in the last block. */
7259 while (label
&& GET_CODE (label
) != CODE_LABEL
)
7261 if (active_insn_p (label
))
7263 label
= PREV_INSN (label
);
7266 if (last
->head
== label
&& GET_CODE (label
) == CODE_LABEL
)
7268 rtx epilogue_line_note
= NULL_RTX
;
7270 /* Locate the line number associated with the closing brace,
7271 if we can find one. */
7272 for (seq
= get_last_insn ();
7273 seq
&& ! active_insn_p (seq
);
7274 seq
= PREV_INSN (seq
))
7275 if (GET_CODE (seq
) == NOTE
&& NOTE_LINE_NUMBER (seq
) > 0)
7277 epilogue_line_note
= seq
;
7281 for (e
= last
->pred
; e
; e
= e_next
)
7283 basic_block bb
= e
->src
;
7286 e_next
= e
->pred_next
;
7287 if (bb
== ENTRY_BLOCK_PTR
)
7291 if ((GET_CODE (jump
) != JUMP_INSN
) || JUMP_LABEL (jump
) != label
)
7294 /* If we have an unconditional jump, we can replace that
7295 with a simple return instruction. */
7296 if (simplejump_p (jump
))
7298 emit_return_into_block (bb
, epilogue_line_note
);
7299 flow_delete_insn (jump
);
7302 /* If we have a conditional jump, we can try to replace
7303 that with a conditional return instruction. */
7304 else if (condjump_p (jump
))
7308 ret
= SET_SRC (PATTERN (jump
));
7309 if (GET_CODE (XEXP (ret
, 1)) == LABEL_REF
)
7310 loc
= &XEXP (ret
, 1);
7312 loc
= &XEXP (ret
, 2);
7313 ret
= gen_rtx_RETURN (VOIDmode
);
7315 if (! validate_change (jump
, loc
, ret
, 0))
7317 if (JUMP_LABEL (jump
))
7318 LABEL_NUSES (JUMP_LABEL (jump
))--;
7320 /* If this block has only one successor, it both jumps
7321 and falls through to the fallthru block, so we can't
7323 if (bb
->succ
->succ_next
== NULL
)
7329 /* Fix up the CFG for the successful change we just made. */
7330 redirect_edge_succ (e
, EXIT_BLOCK_PTR
);
7333 /* Emit a return insn for the exit fallthru block. Whether
7334 this is still reachable will be determined later. */
7336 emit_barrier_after (last
->end
);
7337 emit_return_into_block (last
, epilogue_line_note
);
7338 epilogue_end
= last
->end
;
7343 #ifdef HAVE_epilogue
7346 /* Find the edge that falls through to EXIT. Other edges may exist
7347 due to RETURN instructions, but those don't need epilogues.
7348 There really shouldn't be a mixture -- either all should have
7349 been converted or none, however... */
7351 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
7352 if (e
->flags
& EDGE_FALLTHRU
)
7358 epilogue_end
= emit_note (NULL
, NOTE_INSN_EPILOGUE_BEG
);
7360 seq
= gen_epilogue ();
7362 /* If this function returns with the stack depressed, massage
7363 the epilogue to actually do that. */
7364 if (TREE_CODE (TREE_TYPE (current_function_decl
)) == FUNCTION_TYPE
7365 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl
)))
7366 keep_stack_depressed (seq
);
7368 emit_jump_insn (seq
);
7370 /* Retain a map of the epilogue insns. */
7371 if (GET_CODE (seq
) != SEQUENCE
)
7373 record_insns (seq
, &epilogue
);
7375 seq
= gen_sequence ();
7378 insert_insn_on_edge (seq
, e
);
7385 commit_edge_insertions ();
7387 #ifdef HAVE_sibcall_epilogue
7388 /* Emit sibling epilogues before any sibling call sites. */
7389 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
7391 basic_block bb
= e
->src
;
7396 if (GET_CODE (insn
) != CALL_INSN
7397 || ! SIBLING_CALL_P (insn
))
7401 seq
= gen_sibcall_epilogue ();
7404 i
= PREV_INSN (insn
);
7405 newinsn
= emit_insn_before (seq
, insn
);
7407 /* Update the UID to basic block map. */
7408 for (i
= NEXT_INSN (i
); i
!= insn
; i
= NEXT_INSN (i
))
7409 set_block_for_insn (i
, bb
);
7411 /* Retain a map of the epilogue insns. Used in life analysis to
7412 avoid getting rid of sibcall epilogue insns. */
7413 record_insns (GET_CODE (seq
) == SEQUENCE
7414 ? seq
: newinsn
, &sibcall_epilogue
);
7418 #ifdef HAVE_prologue
7423 /* GDB handles `break f' by setting a breakpoint on the first
7424 line note after the prologue. Which means (1) that if
7425 there are line number notes before where we inserted the
7426 prologue we should move them, and (2) we should generate a
7427 note before the end of the first basic block, if there isn't
7430 ??? This behaviour is completely broken when dealing with
7431 multiple entry functions. We simply place the note always
7432 into first basic block and let alternate entry points
7436 for (insn
= prologue_end
; insn
; insn
= prev
)
7438 prev
= PREV_INSN (insn
);
7439 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7441 /* Note that we cannot reorder the first insn in the
7442 chain, since rest_of_compilation relies on that
7443 remaining constant. */
7446 reorder_insns (insn
, insn
, prologue_end
);
7450 /* Find the last line number note in the first block. */
7451 for (insn
= BASIC_BLOCK (0)->end
;
7452 insn
!= prologue_end
&& insn
;
7453 insn
= PREV_INSN (insn
))
7454 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7457 /* If we didn't find one, make a copy of the first line number
7461 for (insn
= next_active_insn (prologue_end
);
7463 insn
= PREV_INSN (insn
))
7464 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7466 emit_line_note_after (NOTE_SOURCE_FILE (insn
),
7467 NOTE_LINE_NUMBER (insn
),
7474 #ifdef HAVE_epilogue
7479 /* Similarly, move any line notes that appear after the epilogue.
7480 There is no need, however, to be quite so anal about the existance
7482 for (insn
= epilogue_end
; insn
; insn
= next
)
7484 next
= NEXT_INSN (insn
);
7485 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7486 reorder_insns (insn
, insn
, PREV_INSN (epilogue_end
));
7492 /* Reposition the prologue-end and epilogue-begin notes after instruction
7493 scheduling and delayed branch scheduling. */
7496 reposition_prologue_and_epilogue_notes (f
)
7497 rtx f ATTRIBUTE_UNUSED
;
7499 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
7502 if ((len
= VARRAY_SIZE (prologue
)) > 0)
7504 register rtx insn
, note
= 0;
7506 /* Scan from the beginning until we reach the last prologue insn.
7507 We apparently can't depend on basic_block_{head,end} after
7509 for (insn
= f
; len
&& insn
; insn
= NEXT_INSN (insn
))
7511 if (GET_CODE (insn
) == NOTE
)
7513 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
7516 else if ((len
-= contains (insn
, prologue
)) == 0)
7519 /* Find the prologue-end note if we haven't already, and
7520 move it to just after the last prologue insn. */
7523 for (note
= insn
; (note
= NEXT_INSN (note
));)
7524 if (GET_CODE (note
) == NOTE
7525 && NOTE_LINE_NUMBER (note
) == NOTE_INSN_PROLOGUE_END
)
7529 next
= NEXT_INSN (note
);
7531 /* Whether or not we can depend on BLOCK_HEAD,
7532 attempt to keep it up-to-date. */
7533 if (BLOCK_HEAD (0) == note
)
7534 BLOCK_HEAD (0) = next
;
7537 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
7538 if (GET_CODE (insn
) == CODE_LABEL
)
7539 insn
= NEXT_INSN (insn
);
7540 add_insn_after (note
, insn
);
7545 if ((len
= VARRAY_SIZE (epilogue
)) > 0)
7547 register rtx insn
, note
= 0;
7549 /* Scan from the end until we reach the first epilogue insn.
7550 We apparently can't depend on basic_block_{head,end} after
7552 for (insn
= get_last_insn (); len
&& insn
; insn
= PREV_INSN (insn
))
7554 if (GET_CODE (insn
) == NOTE
)
7556 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EPILOGUE_BEG
)
7559 else if ((len
-= contains (insn
, epilogue
)) == 0)
7561 /* Find the epilogue-begin note if we haven't already, and
7562 move it to just before the first epilogue insn. */
7565 for (note
= insn
; (note
= PREV_INSN (note
));)
7566 if (GET_CODE (note
) == NOTE
7567 && NOTE_LINE_NUMBER (note
) == NOTE_INSN_EPILOGUE_BEG
)
7571 /* Whether or not we can depend on BLOCK_HEAD,
7572 attempt to keep it up-to-date. */
7574 && BLOCK_HEAD (n_basic_blocks
-1) == insn
)
7575 BLOCK_HEAD (n_basic_blocks
-1) = note
;
7578 add_insn_before (note
, insn
);
7582 #endif /* HAVE_prologue or HAVE_epilogue */
7585 /* Mark T for GC. */
7589 struct temp_slot
*t
;
7593 ggc_mark_rtx (t
->slot
);
7594 ggc_mark_rtx (t
->address
);
7595 ggc_mark_tree (t
->rtl_expr
);
7596 ggc_mark_tree (t
->type
);
7602 /* Mark P for GC. */
7605 mark_function_status (p
)
7614 ggc_mark_rtx (p
->arg_offset_rtx
);
7616 if (p
->x_parm_reg_stack_loc
)
7617 for (i
= p
->x_max_parm_reg
, r
= p
->x_parm_reg_stack_loc
;
7621 ggc_mark_rtx (p
->return_rtx
);
7622 ggc_mark_rtx (p
->x_cleanup_label
);
7623 ggc_mark_rtx (p
->x_return_label
);
7624 ggc_mark_rtx (p
->x_save_expr_regs
);
7625 ggc_mark_rtx (p
->x_stack_slot_list
);
7626 ggc_mark_rtx (p
->x_parm_birth_insn
);
7627 ggc_mark_rtx (p
->x_tail_recursion_label
);
7628 ggc_mark_rtx (p
->x_tail_recursion_reentry
);
7629 ggc_mark_rtx (p
->internal_arg_pointer
);
7630 ggc_mark_rtx (p
->x_arg_pointer_save_area
);
7631 ggc_mark_tree (p
->x_rtl_expr_chain
);
7632 ggc_mark_rtx (p
->x_last_parm_insn
);
7633 ggc_mark_tree (p
->x_context_display
);
7634 ggc_mark_tree (p
->x_trampoline_list
);
7635 ggc_mark_rtx (p
->epilogue_delay_list
);
7636 ggc_mark_rtx (p
->x_clobber_return_insn
);
7638 mark_temp_slot (p
->x_temp_slots
);
7641 struct var_refs_queue
*q
= p
->fixup_var_refs_queue
;
7644 ggc_mark_rtx (q
->modified
);
7649 ggc_mark_rtx (p
->x_nonlocal_goto_handler_slots
);
7650 ggc_mark_rtx (p
->x_nonlocal_goto_handler_labels
);
7651 ggc_mark_rtx (p
->x_nonlocal_goto_stack_level
);
7652 ggc_mark_tree (p
->x_nonlocal_labels
);
7654 mark_hard_reg_initial_vals (p
);
7657 /* Mark the function chain ARG (which is really a struct function **)
7661 mark_function_chain (arg
)
7664 struct function
*f
= *(struct function
**) arg
;
7666 for (; f
; f
= f
->next_global
)
7668 ggc_mark_tree (f
->decl
);
7670 mark_function_status (f
);
7671 mark_eh_status (f
->eh
);
7672 mark_stmt_status (f
->stmt
);
7673 mark_expr_status (f
->expr
);
7674 mark_emit_status (f
->emit
);
7675 mark_varasm_status (f
->varasm
);
7677 if (mark_machine_status
)
7678 (*mark_machine_status
) (f
);
7679 if (mark_lang_status
)
7680 (*mark_lang_status
) (f
);
7682 if (f
->original_arg_vector
)
7683 ggc_mark_rtvec ((rtvec
) f
->original_arg_vector
);
7684 if (f
->original_decl_initial
)
7685 ggc_mark_tree (f
->original_decl_initial
);
7689 /* Called once, at initialization, to initialize function.c. */
7692 init_function_once ()
7694 ggc_add_root (&all_functions
, 1, sizeof all_functions
,
7695 mark_function_chain
);
7697 VARRAY_INT_INIT (prologue
, 0, "prologue");
7698 VARRAY_INT_INIT (epilogue
, 0, "epilogue");
7699 VARRAY_INT_INIT (sibcall_epilogue
, 0, "sibcall_epilogue");