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, 2002 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"
62 #include "langhooks.h"
64 #ifndef TRAMPOLINE_ALIGNMENT
65 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
68 #ifndef LOCAL_ALIGNMENT
69 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
72 /* Some systems use __main in a way incompatible with its use in gcc, in these
73 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
74 give the same symbol without quotes for an alternative entry point. You
75 must define both, or neither. */
77 #define NAME__MAIN "__main"
78 #define SYMBOL__MAIN __main
81 /* Round a value to the lowest integer less than it that is a multiple of
82 the required alignment. Avoid using division in case the value is
83 negative. Assume the alignment is a power of two. */
84 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
86 /* Similar, but round to the next highest integer that meets the
88 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
90 /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
91 during rtl generation. If they are different register numbers, this is
92 always true. It may also be true if
93 FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
94 generation. See fix_lexical_addr for details. */
96 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
97 #define NEED_SEPARATE_AP
100 /* Nonzero if function being compiled doesn't contain any calls
101 (ignoring the prologue and epilogue). This is set prior to
102 local register allocation and is valid for the remaining
104 int current_function_is_leaf
;
106 /* Nonzero if function being compiled doesn't contain any instructions
107 that can throw an exception. This is set prior to final. */
109 int current_function_nothrow
;
111 /* Nonzero if function being compiled doesn't modify the stack pointer
112 (ignoring the prologue and epilogue). This is only valid after
113 life_analysis has run. */
114 int current_function_sp_is_unchanging
;
116 /* Nonzero if the function being compiled is a leaf function which only
117 uses leaf registers. This is valid after reload (specifically after
118 sched2) and is useful only if the port defines LEAF_REGISTERS. */
119 int current_function_uses_only_leaf_regs
;
121 /* Nonzero once virtual register instantiation has been done.
122 assign_stack_local uses frame_pointer_rtx when this is nonzero.
123 calls.c:emit_library_call_value_1 uses it to set up
124 post-instantiation libcalls. */
125 int virtuals_instantiated
;
127 /* Assign unique numbers to labels generated for profiling, debugging, etc. */
128 static int funcdef_no
;
130 /* These variables hold pointers to functions to create and destroy
131 target specific, per-function data structures. */
132 struct machine_function
* (*init_machine_status
) PARAMS ((void));
134 /* The FUNCTION_DECL for an inline function currently being expanded. */
135 tree inline_function_decl
;
137 /* The currently compiled function. */
138 struct function
*cfun
= 0;
140 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
141 static GTY(()) varray_type prologue
;
142 static GTY(()) varray_type epilogue
;
144 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
146 static GTY(()) varray_type sibcall_epilogue
;
148 /* In order to evaluate some expressions, such as function calls returning
149 structures in memory, we need to temporarily allocate stack locations.
150 We record each allocated temporary in the following structure.
152 Associated with each temporary slot is a nesting level. When we pop up
153 one level, all temporaries associated with the previous level are freed.
154 Normally, all temporaries are freed after the execution of the statement
155 in which they were created. However, if we are inside a ({...}) grouping,
156 the result may be in a temporary and hence must be preserved. If the
157 result could be in a temporary, we preserve it if we can determine which
158 one it is in. If we cannot determine which temporary may contain the
159 result, all temporaries are preserved. A temporary is preserved by
160 pretending it was allocated at the previous nesting level.
162 Automatic variables are also assigned temporary slots, at the nesting
163 level where they are defined. They are marked a "kept" so that
164 free_temp_slots will not free them. */
166 struct temp_slot
GTY(())
168 /* Points to next temporary slot. */
169 struct temp_slot
*next
;
170 /* The rtx to used to reference the slot. */
172 /* The rtx used to represent the address if not the address of the
173 slot above. May be an EXPR_LIST if multiple addresses exist. */
175 /* The alignment (in bits) of the slot. */
177 /* The size, in units, of the slot. */
179 /* The type of the object in the slot, or zero if it doesn't correspond
180 to a type. We use this to determine whether a slot can be reused.
181 It can be reused if objects of the type of the new slot will always
182 conflict with objects of the type of the old slot. */
184 /* The value of `sequence_rtl_expr' when this temporary is allocated. */
186 /* Non-zero if this temporary is currently in use. */
188 /* Non-zero if this temporary has its address taken. */
190 /* Nesting level at which this slot is being used. */
192 /* Non-zero if this should survive a call to free_temp_slots. */
194 /* The offset of the slot from the frame_pointer, including extra space
195 for alignment. This info is for combine_temp_slots. */
196 HOST_WIDE_INT base_offset
;
197 /* The size of the slot, including extra space for alignment. This
198 info is for combine_temp_slots. */
199 HOST_WIDE_INT full_size
;
202 /* This structure is used to record MEMs or pseudos used to replace VAR, any
203 SUBREGs of VAR, and any MEMs containing VAR as an address. We need to
204 maintain this list in case two operands of an insn were required to match;
205 in that case we must ensure we use the same replacement. */
207 struct fixup_replacement
GTY(())
211 struct fixup_replacement
*next
;
214 struct insns_for_mem_entry
218 /* These are the INSNs which reference the MEM. */
222 /* Forward declarations. */
224 static rtx assign_stack_local_1
PARAMS ((enum machine_mode
, HOST_WIDE_INT
,
225 int, struct function
*));
226 static struct temp_slot
*find_temp_slot_from_address
PARAMS ((rtx
));
227 static void put_reg_into_stack
PARAMS ((struct function
*, rtx
, tree
,
228 enum machine_mode
, enum machine_mode
,
229 int, unsigned int, int,
231 static void schedule_fixup_var_refs
PARAMS ((struct function
*, rtx
, tree
,
234 static void fixup_var_refs
PARAMS ((rtx
, enum machine_mode
, int, rtx
,
236 static struct fixup_replacement
237 *find_fixup_replacement
PARAMS ((struct fixup_replacement
**, rtx
));
238 static void fixup_var_refs_insns
PARAMS ((rtx
, rtx
, enum machine_mode
,
240 static void fixup_var_refs_insns_with_hash
241 PARAMS ((htab_t
, rtx
,
242 enum machine_mode
, int, rtx
));
243 static void fixup_var_refs_insn
PARAMS ((rtx
, rtx
, enum machine_mode
,
245 static void fixup_var_refs_1
PARAMS ((rtx
, enum machine_mode
, rtx
*, rtx
,
246 struct fixup_replacement
**, rtx
));
247 static rtx fixup_memory_subreg
PARAMS ((rtx
, rtx
, enum machine_mode
, int));
248 static rtx walk_fixup_memory_subreg
PARAMS ((rtx
, rtx
, enum machine_mode
,
250 static rtx fixup_stack_1
PARAMS ((rtx
, rtx
));
251 static void optimize_bit_field
PARAMS ((rtx
, rtx
, rtx
*));
252 static void instantiate_decls
PARAMS ((tree
, int));
253 static void instantiate_decls_1
PARAMS ((tree
, int));
254 static void instantiate_decl
PARAMS ((rtx
, HOST_WIDE_INT
, int));
255 static rtx instantiate_new_reg
PARAMS ((rtx
, HOST_WIDE_INT
*));
256 static int instantiate_virtual_regs_1
PARAMS ((rtx
*, rtx
, int));
257 static void delete_handlers
PARAMS ((void));
258 static void pad_to_arg_alignment
PARAMS ((struct args_size
*, int,
259 struct args_size
*));
260 #ifndef ARGS_GROW_DOWNWARD
261 static void pad_below
PARAMS ((struct args_size
*, enum machine_mode
,
264 static rtx round_trampoline_addr
PARAMS ((rtx
));
265 static rtx adjust_trampoline_addr
PARAMS ((rtx
));
266 static tree
*identify_blocks_1
PARAMS ((rtx
, tree
*, tree
*, tree
*));
267 static void reorder_blocks_0
PARAMS ((tree
));
268 static void reorder_blocks_1
PARAMS ((rtx
, tree
, varray_type
*));
269 static void reorder_fix_fragments
PARAMS ((tree
));
270 static tree blocks_nreverse
PARAMS ((tree
));
271 static int all_blocks
PARAMS ((tree
, tree
*));
272 static tree
*get_block_vector
PARAMS ((tree
, int *));
273 extern tree debug_find_var_in_block_tree
PARAMS ((tree
, tree
));
274 /* We always define `record_insns' even if its not used so that we
275 can always export `prologue_epilogue_contains'. */
276 static void record_insns
PARAMS ((rtx
, varray_type
*)) ATTRIBUTE_UNUSED
;
277 static int contains
PARAMS ((rtx
, varray_type
));
279 static void emit_return_into_block
PARAMS ((basic_block
, rtx
));
281 static void put_addressof_into_stack
PARAMS ((rtx
, htab_t
));
282 static bool purge_addressof_1
PARAMS ((rtx
*, rtx
, int, int,
284 static void purge_single_hard_subreg_set
PARAMS ((rtx
));
285 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
286 static rtx keep_stack_depressed
PARAMS ((rtx
));
288 static int is_addressof
PARAMS ((rtx
*, void *));
289 static hashval_t insns_for_mem_hash
PARAMS ((const void *));
290 static int insns_for_mem_comp
PARAMS ((const void *, const void *));
291 static int insns_for_mem_walk
PARAMS ((rtx
*, void *));
292 static void compute_insns_for_mem
PARAMS ((rtx
, rtx
, htab_t
));
293 static void prepare_function_start
PARAMS ((void));
294 static void do_clobber_return_reg
PARAMS ((rtx
, void *));
295 static void do_use_return_reg
PARAMS ((rtx
, void *));
297 /* Pointer to chain of `struct function' for containing functions. */
298 static GTY(()) struct function
*outer_function_chain
;
300 /* Given a function decl for a containing function,
301 return the `struct function' for it. */
304 find_function_data (decl
)
309 for (p
= outer_function_chain
; p
; p
= p
->outer
)
316 /* Save the current context for compilation of a nested function.
317 This is called from language-specific code. The caller should use
318 the enter_nested langhook to save any language-specific state,
319 since this function knows only about language-independent
323 push_function_context_to (context
)
330 if (context
== current_function_decl
)
331 cfun
->contains_functions
= 1;
334 struct function
*containing
= find_function_data (context
);
335 containing
->contains_functions
= 1;
340 init_dummy_function_start ();
343 p
->outer
= outer_function_chain
;
344 outer_function_chain
= p
;
345 p
->fixup_var_refs_queue
= 0;
347 (*lang_hooks
.function
.enter_nested
) (p
);
353 push_function_context ()
355 push_function_context_to (current_function_decl
);
358 /* Restore the last saved context, at the end of a nested function.
359 This function is called from language-specific code. */
362 pop_function_context_from (context
)
363 tree context ATTRIBUTE_UNUSED
;
365 struct function
*p
= outer_function_chain
;
366 struct var_refs_queue
*queue
;
369 outer_function_chain
= p
->outer
;
371 current_function_decl
= p
->decl
;
374 restore_emit_status (p
);
376 (*lang_hooks
.function
.leave_nested
) (p
);
378 /* Finish doing put_var_into_stack for any of our variables which became
379 addressable during the nested function. If only one entry has to be
380 fixed up, just do that one. Otherwise, first make a list of MEMs that
381 are not to be unshared. */
382 if (p
->fixup_var_refs_queue
== 0)
384 else if (p
->fixup_var_refs_queue
->next
== 0)
385 fixup_var_refs (p
->fixup_var_refs_queue
->modified
,
386 p
->fixup_var_refs_queue
->promoted_mode
,
387 p
->fixup_var_refs_queue
->unsignedp
,
388 p
->fixup_var_refs_queue
->modified
, 0);
393 for (queue
= p
->fixup_var_refs_queue
; queue
; queue
= queue
->next
)
394 list
= gen_rtx_EXPR_LIST (VOIDmode
, queue
->modified
, list
);
396 for (queue
= p
->fixup_var_refs_queue
; queue
; queue
= queue
->next
)
397 fixup_var_refs (queue
->modified
, queue
->promoted_mode
,
398 queue
->unsignedp
, list
, 0);
402 p
->fixup_var_refs_queue
= 0;
404 /* Reset variables that have known state during rtx generation. */
405 rtx_equal_function_value_matters
= 1;
406 virtuals_instantiated
= 0;
407 generating_concat_p
= 1;
411 pop_function_context ()
413 pop_function_context_from (current_function_decl
);
416 /* Clear out all parts of the state in F that can safely be discarded
417 after the function has been parsed, but not compiled, to let
418 garbage collection reclaim the memory. */
421 free_after_parsing (f
)
424 /* f->expr->forced_labels is used by code generation. */
425 /* f->emit->regno_reg_rtx is used by code generation. */
426 /* f->varasm is used by code generation. */
427 /* f->eh->eh_return_stub_label is used by code generation. */
429 (*lang_hooks
.function
.final
) (f
);
433 /* Clear out all parts of the state in F that can safely be discarded
434 after the function has been compiled, to let garbage collection
435 reclaim the memory. */
438 free_after_compilation (f
)
447 f
->x_temp_slots
= NULL
;
448 f
->arg_offset_rtx
= NULL
;
449 f
->return_rtx
= NULL
;
450 f
->internal_arg_pointer
= NULL
;
451 f
->x_nonlocal_labels
= NULL
;
452 f
->x_nonlocal_goto_handler_slots
= NULL
;
453 f
->x_nonlocal_goto_handler_labels
= NULL
;
454 f
->x_nonlocal_goto_stack_level
= NULL
;
455 f
->x_cleanup_label
= NULL
;
456 f
->x_return_label
= NULL
;
457 f
->x_save_expr_regs
= NULL
;
458 f
->x_stack_slot_list
= NULL
;
459 f
->x_rtl_expr_chain
= NULL
;
460 f
->x_tail_recursion_label
= NULL
;
461 f
->x_tail_recursion_reentry
= NULL
;
462 f
->x_arg_pointer_save_area
= NULL
;
463 f
->x_clobber_return_insn
= NULL
;
464 f
->x_context_display
= NULL
;
465 f
->x_trampoline_list
= NULL
;
466 f
->x_parm_birth_insn
= NULL
;
467 f
->x_last_parm_insn
= NULL
;
468 f
->x_parm_reg_stack_loc
= NULL
;
469 f
->fixup_var_refs_queue
= NULL
;
470 f
->original_arg_vector
= NULL
;
471 f
->original_decl_initial
= NULL
;
472 f
->inl_last_parm_insn
= NULL
;
473 f
->epilogue_delay_list
= NULL
;
476 /* Allocate fixed slots in the stack frame of the current function. */
478 /* Return size needed for stack frame based on slots so far allocated in
480 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
481 the caller may have to do that. */
484 get_func_frame_size (f
)
487 #ifdef FRAME_GROWS_DOWNWARD
488 return -f
->x_frame_offset
;
490 return f
->x_frame_offset
;
494 /* Return size needed for stack frame based on slots so far allocated.
495 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
496 the caller may have to do that. */
500 return get_func_frame_size (cfun
);
503 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
504 with machine mode MODE.
506 ALIGN controls the amount of alignment for the address of the slot:
507 0 means according to MODE,
508 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
509 positive specifies alignment boundary in bits.
511 We do not round to stack_boundary here.
513 FUNCTION specifies the function to allocate in. */
516 assign_stack_local_1 (mode
, size
, align
, function
)
517 enum machine_mode mode
;
520 struct function
*function
;
523 int bigend_correction
= 0;
525 int frame_off
, frame_alignment
, frame_phase
;
532 alignment
= BIGGEST_ALIGNMENT
;
534 alignment
= GET_MODE_ALIGNMENT (mode
);
536 /* Allow the target to (possibly) increase the alignment of this
538 type
= (*lang_hooks
.types
.type_for_mode
) (mode
, 0);
540 alignment
= LOCAL_ALIGNMENT (type
, alignment
);
542 alignment
/= BITS_PER_UNIT
;
544 else if (align
== -1)
546 alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
547 size
= CEIL_ROUND (size
, alignment
);
550 alignment
= align
/ BITS_PER_UNIT
;
552 #ifdef FRAME_GROWS_DOWNWARD
553 function
->x_frame_offset
-= size
;
556 /* Ignore alignment we can't do with expected alignment of the boundary. */
557 if (alignment
* BITS_PER_UNIT
> PREFERRED_STACK_BOUNDARY
)
558 alignment
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
560 if (function
->stack_alignment_needed
< alignment
* BITS_PER_UNIT
)
561 function
->stack_alignment_needed
= alignment
* BITS_PER_UNIT
;
563 /* Calculate how many bytes the start of local variables is off from
565 frame_alignment
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
566 frame_off
= STARTING_FRAME_OFFSET
% frame_alignment
;
567 frame_phase
= frame_off
? frame_alignment
- frame_off
: 0;
569 /* Round frame offset to that alignment.
570 We must be careful here, since FRAME_OFFSET might be negative and
571 division with a negative dividend isn't as well defined as we might
572 like. So we instead assume that ALIGNMENT is a power of two and
573 use logical operations which are unambiguous. */
574 #ifdef FRAME_GROWS_DOWNWARD
575 function
->x_frame_offset
= FLOOR_ROUND (function
->x_frame_offset
- frame_phase
, alignment
) + frame_phase
;
577 function
->x_frame_offset
= CEIL_ROUND (function
->x_frame_offset
- frame_phase
, alignment
) + frame_phase
;
580 /* On a big-endian machine, if we are allocating more space than we will use,
581 use the least significant bytes of those that are allocated. */
582 if (BYTES_BIG_ENDIAN
&& mode
!= BLKmode
)
583 bigend_correction
= size
- GET_MODE_SIZE (mode
);
585 /* If we have already instantiated virtual registers, return the actual
586 address relative to the frame pointer. */
587 if (function
== cfun
&& virtuals_instantiated
)
588 addr
= plus_constant (frame_pointer_rtx
,
589 (frame_offset
+ bigend_correction
590 + STARTING_FRAME_OFFSET
));
592 addr
= plus_constant (virtual_stack_vars_rtx
,
593 function
->x_frame_offset
+ bigend_correction
);
595 #ifndef FRAME_GROWS_DOWNWARD
596 function
->x_frame_offset
+= size
;
599 x
= gen_rtx_MEM (mode
, addr
);
601 function
->x_stack_slot_list
602 = gen_rtx_EXPR_LIST (VOIDmode
, x
, function
->x_stack_slot_list
);
607 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
611 assign_stack_local (mode
, size
, align
)
612 enum machine_mode mode
;
616 return assign_stack_local_1 (mode
, size
, align
, cfun
);
619 /* Allocate a temporary stack slot and record it for possible later
622 MODE is the machine mode to be given to the returned rtx.
624 SIZE is the size in units of the space required. We do no rounding here
625 since assign_stack_local will do any required rounding.
627 KEEP is 1 if this slot is to be retained after a call to
628 free_temp_slots. Automatic variables for a block are allocated
629 with this flag. KEEP is 2 if we allocate a longer term temporary,
630 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
631 if we are to allocate something at an inner level to be treated as
632 a variable in the block (e.g., a SAVE_EXPR).
634 TYPE is the type that will be used for the stack slot. */
637 assign_stack_temp_for_type (mode
, size
, keep
, type
)
638 enum machine_mode mode
;
644 struct temp_slot
*p
, *best_p
= 0;
646 /* If SIZE is -1 it means that somebody tried to allocate a temporary
647 of a variable size. */
652 align
= BIGGEST_ALIGNMENT
;
654 align
= GET_MODE_ALIGNMENT (mode
);
657 type
= (*lang_hooks
.types
.type_for_mode
) (mode
, 0);
660 align
= LOCAL_ALIGNMENT (type
, align
);
662 /* Try to find an available, already-allocated temporary of the proper
663 mode which meets the size and alignment requirements. Choose the
664 smallest one with the closest alignment. */
665 for (p
= temp_slots
; p
; p
= p
->next
)
666 if (p
->align
>= align
&& p
->size
>= size
&& GET_MODE (p
->slot
) == mode
668 && objects_must_conflict_p (p
->type
, type
)
669 && (best_p
== 0 || best_p
->size
> p
->size
670 || (best_p
->size
== p
->size
&& best_p
->align
> p
->align
)))
672 if (p
->align
== align
&& p
->size
== size
)
680 /* Make our best, if any, the one to use. */
683 /* If there are enough aligned bytes left over, make them into a new
684 temp_slot so that the extra bytes don't get wasted. Do this only
685 for BLKmode slots, so that we can be sure of the alignment. */
686 if (GET_MODE (best_p
->slot
) == BLKmode
)
688 int alignment
= best_p
->align
/ BITS_PER_UNIT
;
689 HOST_WIDE_INT rounded_size
= CEIL_ROUND (size
, alignment
);
691 if (best_p
->size
- rounded_size
>= alignment
)
693 p
= (struct temp_slot
*) ggc_alloc (sizeof (struct temp_slot
));
694 p
->in_use
= p
->addr_taken
= 0;
695 p
->size
= best_p
->size
- rounded_size
;
696 p
->base_offset
= best_p
->base_offset
+ rounded_size
;
697 p
->full_size
= best_p
->full_size
- rounded_size
;
698 p
->slot
= gen_rtx_MEM (BLKmode
,
699 plus_constant (XEXP (best_p
->slot
, 0),
701 p
->align
= best_p
->align
;
704 p
->type
= best_p
->type
;
705 p
->next
= temp_slots
;
708 stack_slot_list
= gen_rtx_EXPR_LIST (VOIDmode
, p
->slot
,
711 best_p
->size
= rounded_size
;
712 best_p
->full_size
= rounded_size
;
719 /* If we still didn't find one, make a new temporary. */
722 HOST_WIDE_INT frame_offset_old
= frame_offset
;
724 p
= (struct temp_slot
*) ggc_alloc (sizeof (struct temp_slot
));
726 /* We are passing an explicit alignment request to assign_stack_local.
727 One side effect of that is assign_stack_local will not round SIZE
728 to ensure the frame offset remains suitably aligned.
730 So for requests which depended on the rounding of SIZE, we go ahead
731 and round it now. We also make sure ALIGNMENT is at least
732 BIGGEST_ALIGNMENT. */
733 if (mode
== BLKmode
&& align
< BIGGEST_ALIGNMENT
)
735 p
->slot
= assign_stack_local (mode
,
737 ? CEIL_ROUND (size
, align
/ BITS_PER_UNIT
)
743 /* The following slot size computation is necessary because we don't
744 know the actual size of the temporary slot until assign_stack_local
745 has performed all the frame alignment and size rounding for the
746 requested temporary. Note that extra space added for alignment
747 can be either above or below this stack slot depending on which
748 way the frame grows. We include the extra space if and only if it
749 is above this slot. */
750 #ifdef FRAME_GROWS_DOWNWARD
751 p
->size
= frame_offset_old
- frame_offset
;
756 /* Now define the fields used by combine_temp_slots. */
757 #ifdef FRAME_GROWS_DOWNWARD
758 p
->base_offset
= frame_offset
;
759 p
->full_size
= frame_offset_old
- frame_offset
;
761 p
->base_offset
= frame_offset_old
;
762 p
->full_size
= frame_offset
- frame_offset_old
;
765 p
->next
= temp_slots
;
771 p
->rtl_expr
= seq_rtl_expr
;
776 p
->level
= target_temp_slot_level
;
781 p
->level
= var_temp_slot_level
;
786 p
->level
= temp_slot_level
;
790 /* We may be reusing an old slot, so clear any MEM flags that may have been
792 RTX_UNCHANGING_P (p
->slot
) = 0;
793 MEM_IN_STRUCT_P (p
->slot
) = 0;
794 MEM_SCALAR_P (p
->slot
) = 0;
795 MEM_VOLATILE_P (p
->slot
) = 0;
796 set_mem_alias_set (p
->slot
, 0);
798 /* If we know the alias set for the memory that will be used, use
799 it. If there's no TYPE, then we don't know anything about the
800 alias set for the memory. */
801 set_mem_alias_set (p
->slot
, type
? get_alias_set (type
) : 0);
802 set_mem_align (p
->slot
, align
);
804 /* If a type is specified, set the relevant flags. */
807 RTX_UNCHANGING_P (p
->slot
) = TYPE_READONLY (type
);
808 MEM_VOLATILE_P (p
->slot
) = TYPE_VOLATILE (type
);
809 MEM_SET_IN_STRUCT_P (p
->slot
, AGGREGATE_TYPE_P (type
));
815 /* Allocate a temporary stack slot and record it for possible later
816 reuse. First three arguments are same as in preceding function. */
819 assign_stack_temp (mode
, size
, keep
)
820 enum machine_mode mode
;
824 return assign_stack_temp_for_type (mode
, size
, keep
, NULL_TREE
);
827 /* Assign a temporary.
828 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
829 and so that should be used in error messages. In either case, we
830 allocate of the given type.
831 KEEP is as for assign_stack_temp.
832 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
833 it is 0 if a register is OK.
834 DONT_PROMOTE is 1 if we should not promote values in register
838 assign_temp (type_or_decl
, keep
, memory_required
, dont_promote
)
842 int dont_promote ATTRIBUTE_UNUSED
;
845 enum machine_mode mode
;
846 #ifndef PROMOTE_FOR_CALL_ONLY
850 if (DECL_P (type_or_decl
))
851 decl
= type_or_decl
, type
= TREE_TYPE (decl
);
853 decl
= NULL
, type
= type_or_decl
;
855 mode
= TYPE_MODE (type
);
856 #ifndef PROMOTE_FOR_CALL_ONLY
857 unsignedp
= TREE_UNSIGNED (type
);
860 if (mode
== BLKmode
|| memory_required
)
862 HOST_WIDE_INT size
= int_size_in_bytes (type
);
865 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
866 problems with allocating the stack space. */
870 /* Unfortunately, we don't yet know how to allocate variable-sized
871 temporaries. However, sometimes we have a fixed upper limit on
872 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
873 instead. This is the case for Chill variable-sized strings. */
874 if (size
== -1 && TREE_CODE (type
) == ARRAY_TYPE
875 && TYPE_ARRAY_MAX_SIZE (type
) != NULL_TREE
876 && host_integerp (TYPE_ARRAY_MAX_SIZE (type
), 1))
877 size
= tree_low_cst (TYPE_ARRAY_MAX_SIZE (type
), 1);
879 /* The size of the temporary may be too large to fit into an integer. */
880 /* ??? Not sure this should happen except for user silliness, so limit
881 this to things that aren't compiler-generated temporaries. The
882 rest of the time we'll abort in assign_stack_temp_for_type. */
883 if (decl
&& size
== -1
884 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
)
886 error_with_decl (decl
, "size of variable `%s' is too large");
890 tmp
= assign_stack_temp_for_type (mode
, size
, keep
, type
);
894 #ifndef PROMOTE_FOR_CALL_ONLY
896 mode
= promote_mode (type
, mode
, &unsignedp
, 0);
899 return gen_reg_rtx (mode
);
902 /* Combine temporary stack slots which are adjacent on the stack.
904 This allows for better use of already allocated stack space. This is only
905 done for BLKmode slots because we can be sure that we won't have alignment
906 problems in this case. */
909 combine_temp_slots ()
911 struct temp_slot
*p
, *q
;
912 struct temp_slot
*prev_p
, *prev_q
;
915 /* We can't combine slots, because the information about which slot
916 is in which alias set will be lost. */
917 if (flag_strict_aliasing
)
920 /* If there are a lot of temp slots, don't do anything unless
921 high levels of optimization. */
922 if (! flag_expensive_optimizations
)
923 for (p
= temp_slots
, num_slots
= 0; p
; p
= p
->next
, num_slots
++)
924 if (num_slots
> 100 || (num_slots
> 10 && optimize
== 0))
927 for (p
= temp_slots
, prev_p
= 0; p
; p
= prev_p
? prev_p
->next
: temp_slots
)
931 if (! p
->in_use
&& GET_MODE (p
->slot
) == BLKmode
)
932 for (q
= p
->next
, prev_q
= p
; q
; q
= prev_q
->next
)
935 if (! q
->in_use
&& GET_MODE (q
->slot
) == BLKmode
)
937 if (p
->base_offset
+ p
->full_size
== q
->base_offset
)
939 /* Q comes after P; combine Q into P. */
941 p
->full_size
+= q
->full_size
;
944 else if (q
->base_offset
+ q
->full_size
== p
->base_offset
)
946 /* P comes after Q; combine P into Q. */
948 q
->full_size
+= p
->full_size
;
953 /* Either delete Q or advance past it. */
955 prev_q
->next
= q
->next
;
959 /* Either delete P or advance past it. */
963 prev_p
->next
= p
->next
;
965 temp_slots
= p
->next
;
972 /* Find the temp slot corresponding to the object at address X. */
974 static struct temp_slot
*
975 find_temp_slot_from_address (x
)
981 for (p
= temp_slots
; p
; p
= p
->next
)
986 else if (XEXP (p
->slot
, 0) == x
988 || (GET_CODE (x
) == PLUS
989 && XEXP (x
, 0) == virtual_stack_vars_rtx
990 && GET_CODE (XEXP (x
, 1)) == CONST_INT
991 && INTVAL (XEXP (x
, 1)) >= p
->base_offset
992 && INTVAL (XEXP (x
, 1)) < p
->base_offset
+ p
->full_size
))
995 else if (p
->address
!= 0 && GET_CODE (p
->address
) == EXPR_LIST
)
996 for (next
= p
->address
; next
; next
= XEXP (next
, 1))
997 if (XEXP (next
, 0) == x
)
1001 /* If we have a sum involving a register, see if it points to a temp
1003 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 0)) == REG
1004 && (p
= find_temp_slot_from_address (XEXP (x
, 0))) != 0)
1006 else if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == REG
1007 && (p
= find_temp_slot_from_address (XEXP (x
, 1))) != 0)
1013 /* Indicate that NEW is an alternate way of referring to the temp slot
1014 that previously was known by OLD. */
1017 update_temp_slot_address (old
, new)
1020 struct temp_slot
*p
;
1022 if (rtx_equal_p (old
, new))
1025 p
= find_temp_slot_from_address (old
);
1027 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
1028 is a register, see if one operand of the PLUS is a temporary
1029 location. If so, NEW points into it. Otherwise, if both OLD and
1030 NEW are a PLUS and if there is a register in common between them.
1031 If so, try a recursive call on those values. */
1034 if (GET_CODE (old
) != PLUS
)
1037 if (GET_CODE (new) == REG
)
1039 update_temp_slot_address (XEXP (old
, 0), new);
1040 update_temp_slot_address (XEXP (old
, 1), new);
1043 else if (GET_CODE (new) != PLUS
)
1046 if (rtx_equal_p (XEXP (old
, 0), XEXP (new, 0)))
1047 update_temp_slot_address (XEXP (old
, 1), XEXP (new, 1));
1048 else if (rtx_equal_p (XEXP (old
, 1), XEXP (new, 0)))
1049 update_temp_slot_address (XEXP (old
, 0), XEXP (new, 1));
1050 else if (rtx_equal_p (XEXP (old
, 0), XEXP (new, 1)))
1051 update_temp_slot_address (XEXP (old
, 1), XEXP (new, 0));
1052 else if (rtx_equal_p (XEXP (old
, 1), XEXP (new, 1)))
1053 update_temp_slot_address (XEXP (old
, 0), XEXP (new, 0));
1058 /* Otherwise add an alias for the temp's address. */
1059 else if (p
->address
== 0)
1063 if (GET_CODE (p
->address
) != EXPR_LIST
)
1064 p
->address
= gen_rtx_EXPR_LIST (VOIDmode
, p
->address
, NULL_RTX
);
1066 p
->address
= gen_rtx_EXPR_LIST (VOIDmode
, new, p
->address
);
1070 /* If X could be a reference to a temporary slot, mark the fact that its
1071 address was taken. */
1074 mark_temp_addr_taken (x
)
1077 struct temp_slot
*p
;
1082 /* If X is not in memory or is at a constant address, it cannot be in
1083 a temporary slot. */
1084 if (GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0)))
1087 p
= find_temp_slot_from_address (XEXP (x
, 0));
1092 /* If X could be a reference to a temporary slot, mark that slot as
1093 belonging to the to one level higher than the current level. If X
1094 matched one of our slots, just mark that one. Otherwise, we can't
1095 easily predict which it is, so upgrade all of them. Kept slots
1096 need not be touched.
1098 This is called when an ({...}) construct occurs and a statement
1099 returns a value in memory. */
1102 preserve_temp_slots (x
)
1105 struct temp_slot
*p
= 0;
1107 /* If there is no result, we still might have some objects whose address
1108 were taken, so we need to make sure they stay around. */
1111 for (p
= temp_slots
; p
; p
= p
->next
)
1112 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->addr_taken
)
1118 /* If X is a register that is being used as a pointer, see if we have
1119 a temporary slot we know it points to. To be consistent with
1120 the code below, we really should preserve all non-kept slots
1121 if we can't find a match, but that seems to be much too costly. */
1122 if (GET_CODE (x
) == REG
&& REG_POINTER (x
))
1123 p
= find_temp_slot_from_address (x
);
1125 /* If X is not in memory or is at a constant address, it cannot be in
1126 a temporary slot, but it can contain something whose address was
1128 if (p
== 0 && (GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0))))
1130 for (p
= temp_slots
; p
; p
= p
->next
)
1131 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->addr_taken
)
1137 /* First see if we can find a match. */
1139 p
= find_temp_slot_from_address (XEXP (x
, 0));
1143 /* Move everything at our level whose address was taken to our new
1144 level in case we used its address. */
1145 struct temp_slot
*q
;
1147 if (p
->level
== temp_slot_level
)
1149 for (q
= temp_slots
; q
; q
= q
->next
)
1150 if (q
!= p
&& q
->addr_taken
&& q
->level
== p
->level
)
1159 /* Otherwise, preserve all non-kept slots at this level. */
1160 for (p
= temp_slots
; p
; p
= p
->next
)
1161 if (p
->in_use
&& p
->level
== temp_slot_level
&& ! p
->keep
)
1165 /* X is the result of an RTL_EXPR. If it is a temporary slot associated
1166 with that RTL_EXPR, promote it into a temporary slot at the present
1167 level so it will not be freed when we free slots made in the
1171 preserve_rtl_expr_result (x
)
1174 struct temp_slot
*p
;
1176 /* If X is not in memory or is at a constant address, it cannot be in
1177 a temporary slot. */
1178 if (x
== 0 || GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0)))
1181 /* If we can find a match, move it to our level unless it is already at
1183 p
= find_temp_slot_from_address (XEXP (x
, 0));
1186 p
->level
= MIN (p
->level
, temp_slot_level
);
1193 /* Free all temporaries used so far. This is normally called at the end
1194 of generating code for a statement. Don't free any temporaries
1195 currently in use for an RTL_EXPR that hasn't yet been emitted.
1196 We could eventually do better than this since it can be reused while
1197 generating the same RTL_EXPR, but this is complex and probably not
1203 struct temp_slot
*p
;
1205 for (p
= temp_slots
; p
; p
= p
->next
)
1206 if (p
->in_use
&& p
->level
== temp_slot_level
&& ! p
->keep
1207 && p
->rtl_expr
== 0)
1210 combine_temp_slots ();
1213 /* Free all temporary slots used in T, an RTL_EXPR node. */
1216 free_temps_for_rtl_expr (t
)
1219 struct temp_slot
*p
;
1221 for (p
= temp_slots
; p
; p
= p
->next
)
1222 if (p
->rtl_expr
== t
)
1224 /* If this slot is below the current TEMP_SLOT_LEVEL, then it
1225 needs to be preserved. This can happen if a temporary in
1226 the RTL_EXPR was addressed; preserve_temp_slots will move
1227 the temporary into a higher level. */
1228 if (temp_slot_level
<= p
->level
)
1231 p
->rtl_expr
= NULL_TREE
;
1234 combine_temp_slots ();
1237 /* Mark all temporaries ever allocated in this function as not suitable
1238 for reuse until the current level is exited. */
1241 mark_all_temps_used ()
1243 struct temp_slot
*p
;
1245 for (p
= temp_slots
; p
; p
= p
->next
)
1247 p
->in_use
= p
->keep
= 1;
1248 p
->level
= MIN (p
->level
, temp_slot_level
);
1252 /* Push deeper into the nesting level for stack temporaries. */
1260 /* Likewise, but save the new level as the place to allocate variables
1265 push_temp_slots_for_block ()
1269 var_temp_slot_level
= temp_slot_level
;
1272 /* Likewise, but save the new level as the place to allocate temporaries
1273 for TARGET_EXPRs. */
1276 push_temp_slots_for_target ()
1280 target_temp_slot_level
= temp_slot_level
;
1283 /* Set and get the value of target_temp_slot_level. The only
1284 permitted use of these functions is to save and restore this value. */
1287 get_target_temp_slot_level ()
1289 return target_temp_slot_level
;
1293 set_target_temp_slot_level (level
)
1296 target_temp_slot_level
= level
;
1300 /* Pop a temporary nesting level. All slots in use in the current level
1306 struct temp_slot
*p
;
1308 for (p
= temp_slots
; p
; p
= p
->next
)
1309 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->rtl_expr
== 0)
1312 combine_temp_slots ();
1317 /* Initialize temporary slots. */
1322 /* We have not allocated any temporaries yet. */
1324 temp_slot_level
= 0;
1325 var_temp_slot_level
= 0;
1326 target_temp_slot_level
= 0;
1329 /* Retroactively move an auto variable from a register to a stack slot.
1330 This is done when an address-reference to the variable is seen. */
1333 put_var_into_stack (decl
)
1337 enum machine_mode promoted_mode
, decl_mode
;
1338 struct function
*function
= 0;
1340 int can_use_addressof
;
1341 int volatilep
= TREE_CODE (decl
) != SAVE_EXPR
&& TREE_THIS_VOLATILE (decl
);
1342 int usedp
= (TREE_USED (decl
)
1343 || (TREE_CODE (decl
) != SAVE_EXPR
&& DECL_INITIAL (decl
) != 0));
1345 context
= decl_function_context (decl
);
1347 /* Get the current rtl used for this object and its original mode. */
1348 reg
= (TREE_CODE (decl
) == SAVE_EXPR
1349 ? SAVE_EXPR_RTL (decl
)
1350 : DECL_RTL_IF_SET (decl
));
1352 /* No need to do anything if decl has no rtx yet
1353 since in that case caller is setting TREE_ADDRESSABLE
1354 and a stack slot will be assigned when the rtl is made. */
1358 /* Get the declared mode for this object. */
1359 decl_mode
= (TREE_CODE (decl
) == SAVE_EXPR
? TYPE_MODE (TREE_TYPE (decl
))
1360 : DECL_MODE (decl
));
1361 /* Get the mode it's actually stored in. */
1362 promoted_mode
= GET_MODE (reg
);
1364 /* If this variable comes from an outer function, find that
1365 function's saved context. Don't use find_function_data here,
1366 because it might not be in any active function.
1367 FIXME: Is that really supposed to happen?
1368 It does in ObjC at least. */
1369 if (context
!= current_function_decl
&& context
!= inline_function_decl
)
1370 for (function
= outer_function_chain
; function
; function
= function
->outer
)
1371 if (function
->decl
== context
)
1374 /* If this is a variable-size object with a pseudo to address it,
1375 put that pseudo into the stack, if the var is nonlocal. */
1376 if (TREE_CODE (decl
) != SAVE_EXPR
&& DECL_NONLOCAL (decl
)
1377 && GET_CODE (reg
) == MEM
1378 && GET_CODE (XEXP (reg
, 0)) == REG
1379 && REGNO (XEXP (reg
, 0)) > LAST_VIRTUAL_REGISTER
)
1381 reg
= XEXP (reg
, 0);
1382 decl_mode
= promoted_mode
= GET_MODE (reg
);
1388 /* FIXME make it work for promoted modes too */
1389 && decl_mode
== promoted_mode
1390 #ifdef NON_SAVING_SETJMP
1391 && ! (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
1395 /* If we can't use ADDRESSOF, make sure we see through one we already
1397 if (! can_use_addressof
&& GET_CODE (reg
) == MEM
1398 && GET_CODE (XEXP (reg
, 0)) == ADDRESSOF
)
1399 reg
= XEXP (XEXP (reg
, 0), 0);
1401 /* Now we should have a value that resides in one or more pseudo regs. */
1403 if (GET_CODE (reg
) == REG
)
1405 /* If this variable lives in the current function and we don't need
1406 to put things in the stack for the sake of setjmp, try to keep it
1407 in a register until we know we actually need the address. */
1408 if (can_use_addressof
)
1409 gen_mem_addressof (reg
, decl
);
1411 put_reg_into_stack (function
, reg
, TREE_TYPE (decl
), promoted_mode
,
1412 decl_mode
, volatilep
, 0, usedp
, 0);
1414 else if (GET_CODE (reg
) == CONCAT
)
1416 /* A CONCAT contains two pseudos; put them both in the stack.
1417 We do it so they end up consecutive.
1418 We fixup references to the parts only after we fixup references
1419 to the whole CONCAT, lest we do double fixups for the latter
1421 enum machine_mode part_mode
= GET_MODE (XEXP (reg
, 0));
1422 tree part_type
= (*lang_hooks
.types
.type_for_mode
) (part_mode
, 0);
1423 rtx lopart
= XEXP (reg
, 0);
1424 rtx hipart
= XEXP (reg
, 1);
1425 #ifdef FRAME_GROWS_DOWNWARD
1426 /* Since part 0 should have a lower address, do it second. */
1427 put_reg_into_stack (function
, hipart
, part_type
, part_mode
,
1428 part_mode
, volatilep
, 0, 0, 0);
1429 put_reg_into_stack (function
, lopart
, part_type
, part_mode
,
1430 part_mode
, volatilep
, 0, 0, 0);
1432 put_reg_into_stack (function
, lopart
, part_type
, part_mode
,
1433 part_mode
, volatilep
, 0, 0, 0);
1434 put_reg_into_stack (function
, hipart
, part_type
, part_mode
,
1435 part_mode
, volatilep
, 0, 0, 0);
1438 /* Change the CONCAT into a combined MEM for both parts. */
1439 PUT_CODE (reg
, MEM
);
1440 MEM_ATTRS (reg
) = 0;
1442 /* set_mem_attributes uses DECL_RTL to avoid re-generating of
1443 already computed alias sets. Here we want to re-generate. */
1445 SET_DECL_RTL (decl
, NULL
);
1446 set_mem_attributes (reg
, decl
, 1);
1448 SET_DECL_RTL (decl
, reg
);
1450 /* The two parts are in memory order already.
1451 Use the lower parts address as ours. */
1452 XEXP (reg
, 0) = XEXP (XEXP (reg
, 0), 0);
1453 /* Prevent sharing of rtl that might lose. */
1454 if (GET_CODE (XEXP (reg
, 0)) == PLUS
)
1455 XEXP (reg
, 0) = copy_rtx (XEXP (reg
, 0));
1458 schedule_fixup_var_refs (function
, reg
, TREE_TYPE (decl
),
1460 schedule_fixup_var_refs (function
, lopart
, part_type
, part_mode
, 0);
1461 schedule_fixup_var_refs (function
, hipart
, part_type
, part_mode
, 0);
1468 /* Subroutine of put_var_into_stack. This puts a single pseudo reg REG
1469 into the stack frame of FUNCTION (0 means the current function).
1470 DECL_MODE is the machine mode of the user-level data type.
1471 PROMOTED_MODE is the machine mode of the register.
1472 VOLATILE_P is nonzero if this is for a "volatile" decl.
1473 USED_P is nonzero if this reg might have already been used in an insn. */
1476 put_reg_into_stack (function
, reg
, type
, promoted_mode
, decl_mode
, volatile_p
,
1477 original_regno
, used_p
, ht
)
1478 struct function
*function
;
1481 enum machine_mode promoted_mode
, decl_mode
;
1483 unsigned int original_regno
;
1487 struct function
*func
= function
? function
: cfun
;
1489 unsigned int regno
= original_regno
;
1492 regno
= REGNO (reg
);
1494 if (regno
< func
->x_max_parm_reg
)
1495 new = func
->x_parm_reg_stack_loc
[regno
];
1498 new = assign_stack_local_1 (decl_mode
, GET_MODE_SIZE (decl_mode
), 0, func
);
1500 PUT_CODE (reg
, MEM
);
1501 PUT_MODE (reg
, decl_mode
);
1502 XEXP (reg
, 0) = XEXP (new, 0);
1503 MEM_ATTRS (reg
) = 0;
1504 /* `volatil' bit means one thing for MEMs, another entirely for REGs. */
1505 MEM_VOLATILE_P (reg
) = volatile_p
;
1507 /* If this is a memory ref that contains aggregate components,
1508 mark it as such for cse and loop optimize. If we are reusing a
1509 previously generated stack slot, then we need to copy the bit in
1510 case it was set for other reasons. For instance, it is set for
1511 __builtin_va_alist. */
1514 MEM_SET_IN_STRUCT_P (reg
,
1515 AGGREGATE_TYPE_P (type
) || MEM_IN_STRUCT_P (new));
1516 set_mem_alias_set (reg
, get_alias_set (type
));
1520 schedule_fixup_var_refs (function
, reg
, type
, promoted_mode
, ht
);
1523 /* Make sure that all refs to the variable, previously made
1524 when it was a register, are fixed up to be valid again.
1525 See function above for meaning of arguments. */
1528 schedule_fixup_var_refs (function
, reg
, type
, promoted_mode
, ht
)
1529 struct function
*function
;
1532 enum machine_mode promoted_mode
;
1535 int unsigned_p
= type
? TREE_UNSIGNED (type
) : 0;
1539 struct var_refs_queue
*temp
;
1542 = (struct var_refs_queue
*) ggc_alloc (sizeof (struct var_refs_queue
));
1543 temp
->modified
= reg
;
1544 temp
->promoted_mode
= promoted_mode
;
1545 temp
->unsignedp
= unsigned_p
;
1546 temp
->next
= function
->fixup_var_refs_queue
;
1547 function
->fixup_var_refs_queue
= temp
;
1550 /* Variable is local; fix it up now. */
1551 fixup_var_refs (reg
, promoted_mode
, unsigned_p
, reg
, ht
);
1555 fixup_var_refs (var
, promoted_mode
, unsignedp
, may_share
, ht
)
1557 enum machine_mode promoted_mode
;
1563 rtx first_insn
= get_insns ();
1564 struct sequence_stack
*stack
= seq_stack
;
1565 tree rtl_exps
= rtl_expr_chain
;
1567 /* If there's a hash table, it must record all uses of VAR. */
1572 fixup_var_refs_insns_with_hash (ht
, var
, promoted_mode
, unsignedp
,
1577 fixup_var_refs_insns (first_insn
, var
, promoted_mode
, unsignedp
,
1578 stack
== 0, may_share
);
1580 /* Scan all pending sequences too. */
1581 for (; stack
; stack
= stack
->next
)
1583 push_to_full_sequence (stack
->first
, stack
->last
);
1584 fixup_var_refs_insns (stack
->first
, var
, promoted_mode
, unsignedp
,
1585 stack
->next
!= 0, may_share
);
1586 /* Update remembered end of sequence
1587 in case we added an insn at the end. */
1588 stack
->last
= get_last_insn ();
1592 /* Scan all waiting RTL_EXPRs too. */
1593 for (pending
= rtl_exps
; pending
; pending
= TREE_CHAIN (pending
))
1595 rtx seq
= RTL_EXPR_SEQUENCE (TREE_VALUE (pending
));
1596 if (seq
!= const0_rtx
&& seq
!= 0)
1598 push_to_sequence (seq
);
1599 fixup_var_refs_insns (seq
, var
, promoted_mode
, unsignedp
, 0,
1606 /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is
1607 some part of an insn. Return a struct fixup_replacement whose OLD
1608 value is equal to X. Allocate a new structure if no such entry exists. */
1610 static struct fixup_replacement
*
1611 find_fixup_replacement (replacements
, x
)
1612 struct fixup_replacement
**replacements
;
1615 struct fixup_replacement
*p
;
1617 /* See if we have already replaced this. */
1618 for (p
= *replacements
; p
!= 0 && ! rtx_equal_p (p
->old
, x
); p
= p
->next
)
1623 p
= (struct fixup_replacement
*) xmalloc (sizeof (struct fixup_replacement
));
1626 p
->next
= *replacements
;
1633 /* Scan the insn-chain starting with INSN for refs to VAR and fix them
1634 up. TOPLEVEL is nonzero if this chain is the main chain of insns
1635 for the current function. MAY_SHARE is either a MEM that is not
1636 to be unshared or a list of them. */
1639 fixup_var_refs_insns (insn
, var
, promoted_mode
, unsignedp
, toplevel
, may_share
)
1642 enum machine_mode promoted_mode
;
1649 /* fixup_var_refs_insn might modify insn, so save its next
1651 rtx next
= NEXT_INSN (insn
);
1653 /* CALL_PLACEHOLDERs are special; we have to switch into each of
1654 the three sequences they (potentially) contain, and process
1655 them recursively. The CALL_INSN itself is not interesting. */
1657 if (GET_CODE (insn
) == CALL_INSN
1658 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
1662 /* Look at the Normal call, sibling call and tail recursion
1663 sequences attached to the CALL_PLACEHOLDER. */
1664 for (i
= 0; i
< 3; i
++)
1666 rtx seq
= XEXP (PATTERN (insn
), i
);
1669 push_to_sequence (seq
);
1670 fixup_var_refs_insns (seq
, var
, promoted_mode
, unsignedp
, 0,
1672 XEXP (PATTERN (insn
), i
) = get_insns ();
1678 else if (INSN_P (insn
))
1679 fixup_var_refs_insn (insn
, var
, promoted_mode
, unsignedp
, toplevel
,
1686 /* Look up the insns which reference VAR in HT and fix them up. Other
1687 arguments are the same as fixup_var_refs_insns.
1689 N.B. No need for special processing of CALL_PLACEHOLDERs here,
1690 because the hash table will point straight to the interesting insn
1691 (inside the CALL_PLACEHOLDER). */
1694 fixup_var_refs_insns_with_hash (ht
, var
, promoted_mode
, unsignedp
, may_share
)
1697 enum machine_mode promoted_mode
;
1701 struct insns_for_mem_entry tmp
;
1702 struct insns_for_mem_entry
*ime
;
1706 ime
= (struct insns_for_mem_entry
*) htab_find (ht
, &tmp
);
1707 for (insn_list
= ime
->insns
; insn_list
!= 0; insn_list
= XEXP (insn_list
, 1))
1708 if (INSN_P (XEXP (insn_list
, 0)))
1709 fixup_var_refs_insn (XEXP (insn_list
, 0), var
, promoted_mode
,
1710 unsignedp
, 1, may_share
);
1714 /* Per-insn processing by fixup_var_refs_insns(_with_hash). INSN is
1715 the insn under examination, VAR is the variable to fix up
1716 references to, PROMOTED_MODE and UNSIGNEDP describe VAR, and
1717 TOPLEVEL is nonzero if this is the main insn chain for this
1721 fixup_var_refs_insn (insn
, var
, promoted_mode
, unsignedp
, toplevel
, no_share
)
1724 enum machine_mode promoted_mode
;
1730 rtx set
, prev
, prev_set
;
1733 /* Remember the notes in case we delete the insn. */
1734 note
= REG_NOTES (insn
);
1736 /* If this is a CLOBBER of VAR, delete it.
1738 If it has a REG_LIBCALL note, delete the REG_LIBCALL
1739 and REG_RETVAL notes too. */
1740 if (GET_CODE (PATTERN (insn
)) == CLOBBER
1741 && (XEXP (PATTERN (insn
), 0) == var
1742 || (GET_CODE (XEXP (PATTERN (insn
), 0)) == CONCAT
1743 && (XEXP (XEXP (PATTERN (insn
), 0), 0) == var
1744 || XEXP (XEXP (PATTERN (insn
), 0), 1) == var
))))
1746 if ((note
= find_reg_note (insn
, REG_LIBCALL
, NULL_RTX
)) != 0)
1747 /* The REG_LIBCALL note will go away since we are going to
1748 turn INSN into a NOTE, so just delete the
1749 corresponding REG_RETVAL note. */
1750 remove_note (XEXP (note
, 0),
1751 find_reg_note (XEXP (note
, 0), REG_RETVAL
,
1757 /* The insn to load VAR from a home in the arglist
1758 is now a no-op. When we see it, just delete it.
1759 Similarly if this is storing VAR from a register from which
1760 it was loaded in the previous insn. This will occur
1761 when an ADDRESSOF was made for an arglist slot. */
1763 && (set
= single_set (insn
)) != 0
1764 && SET_DEST (set
) == var
1765 /* If this represents the result of an insn group,
1766 don't delete the insn. */
1767 && find_reg_note (insn
, REG_RETVAL
, NULL_RTX
) == 0
1768 && (rtx_equal_p (SET_SRC (set
), var
)
1769 || (GET_CODE (SET_SRC (set
)) == REG
1770 && (prev
= prev_nonnote_insn (insn
)) != 0
1771 && (prev_set
= single_set (prev
)) != 0
1772 && SET_DEST (prev_set
) == SET_SRC (set
)
1773 && rtx_equal_p (SET_SRC (prev_set
), var
))))
1779 struct fixup_replacement
*replacements
= 0;
1780 rtx next_insn
= NEXT_INSN (insn
);
1782 if (SMALL_REGISTER_CLASSES
)
1784 /* If the insn that copies the results of a CALL_INSN
1785 into a pseudo now references VAR, we have to use an
1786 intermediate pseudo since we want the life of the
1787 return value register to be only a single insn.
1789 If we don't use an intermediate pseudo, such things as
1790 address computations to make the address of VAR valid
1791 if it is not can be placed between the CALL_INSN and INSN.
1793 To make sure this doesn't happen, we record the destination
1794 of the CALL_INSN and see if the next insn uses both that
1797 if (call_dest
!= 0 && GET_CODE (insn
) == INSN
1798 && reg_mentioned_p (var
, PATTERN (insn
))
1799 && reg_mentioned_p (call_dest
, PATTERN (insn
)))
1801 rtx temp
= gen_reg_rtx (GET_MODE (call_dest
));
1803 emit_insn_before (gen_move_insn (temp
, call_dest
), insn
);
1805 PATTERN (insn
) = replace_rtx (PATTERN (insn
),
1809 if (GET_CODE (insn
) == CALL_INSN
1810 && GET_CODE (PATTERN (insn
)) == SET
)
1811 call_dest
= SET_DEST (PATTERN (insn
));
1812 else if (GET_CODE (insn
) == CALL_INSN
1813 && GET_CODE (PATTERN (insn
)) == PARALLEL
1814 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == SET
)
1815 call_dest
= SET_DEST (XVECEXP (PATTERN (insn
), 0, 0));
1820 /* See if we have to do anything to INSN now that VAR is in
1821 memory. If it needs to be loaded into a pseudo, use a single
1822 pseudo for the entire insn in case there is a MATCH_DUP
1823 between two operands. We pass a pointer to the head of
1824 a list of struct fixup_replacements. If fixup_var_refs_1
1825 needs to allocate pseudos or replacement MEMs (for SUBREGs),
1826 it will record them in this list.
1828 If it allocated a pseudo for any replacement, we copy into
1831 fixup_var_refs_1 (var
, promoted_mode
, &PATTERN (insn
), insn
,
1832 &replacements
, no_share
);
1834 /* If this is last_parm_insn, and any instructions were output
1835 after it to fix it up, then we must set last_parm_insn to
1836 the last such instruction emitted. */
1837 if (insn
== last_parm_insn
)
1838 last_parm_insn
= PREV_INSN (next_insn
);
1840 while (replacements
)
1842 struct fixup_replacement
*next
;
1844 if (GET_CODE (replacements
->new) == REG
)
1849 /* OLD might be a (subreg (mem)). */
1850 if (GET_CODE (replacements
->old
) == SUBREG
)
1852 = fixup_memory_subreg (replacements
->old
, insn
,
1856 = fixup_stack_1 (replacements
->old
, insn
);
1858 insert_before
= insn
;
1860 /* If we are changing the mode, do a conversion.
1861 This might be wasteful, but combine.c will
1862 eliminate much of the waste. */
1864 if (GET_MODE (replacements
->new)
1865 != GET_MODE (replacements
->old
))
1868 convert_move (replacements
->new,
1869 replacements
->old
, unsignedp
);
1874 seq
= gen_move_insn (replacements
->new,
1877 emit_insn_before (seq
, insert_before
);
1880 next
= replacements
->next
;
1881 free (replacements
);
1882 replacements
= next
;
1886 /* Also fix up any invalid exprs in the REG_NOTES of this insn.
1887 But don't touch other insns referred to by reg-notes;
1888 we will get them elsewhere. */
1891 if (GET_CODE (note
) != INSN_LIST
)
1893 = walk_fixup_memory_subreg (XEXP (note
, 0), insn
,
1895 note
= XEXP (note
, 1);
1899 /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
1900 See if the rtx expression at *LOC in INSN needs to be changed.
1902 REPLACEMENTS is a pointer to a list head that starts out zero, but may
1903 contain a list of original rtx's and replacements. If we find that we need
1904 to modify this insn by replacing a memory reference with a pseudo or by
1905 making a new MEM to implement a SUBREG, we consult that list to see if
1906 we have already chosen a replacement. If none has already been allocated,
1907 we allocate it and update the list. fixup_var_refs_insn will copy VAR
1908 or the SUBREG, as appropriate, to the pseudo. */
1911 fixup_var_refs_1 (var
, promoted_mode
, loc
, insn
, replacements
, no_share
)
1913 enum machine_mode promoted_mode
;
1916 struct fixup_replacement
**replacements
;
1921 RTX_CODE code
= GET_CODE (x
);
1924 struct fixup_replacement
*replacement
;
1929 if (XEXP (x
, 0) == var
)
1931 /* Prevent sharing of rtl that might lose. */
1932 rtx sub
= copy_rtx (XEXP (var
, 0));
1934 if (! validate_change (insn
, loc
, sub
, 0))
1936 rtx y
= gen_reg_rtx (GET_MODE (sub
));
1939 /* We should be able to replace with a register or all is lost.
1940 Note that we can't use validate_change to verify this, since
1941 we're not caring for replacing all dups simultaneously. */
1942 if (! validate_replace_rtx (*loc
, y
, insn
))
1945 /* Careful! First try to recognize a direct move of the
1946 value, mimicking how things are done in gen_reload wrt
1947 PLUS. Consider what happens when insn is a conditional
1948 move instruction and addsi3 clobbers flags. */
1951 new_insn
= emit_insn (gen_rtx_SET (VOIDmode
, y
, sub
));
1955 if (recog_memoized (new_insn
) < 0)
1957 /* That failed. Fall back on force_operand and hope. */
1960 sub
= force_operand (sub
, y
);
1962 emit_insn (gen_move_insn (y
, sub
));
1968 /* Don't separate setter from user. */
1969 if (PREV_INSN (insn
) && sets_cc0_p (PREV_INSN (insn
)))
1970 insn
= PREV_INSN (insn
);
1973 emit_insn_before (seq
, insn
);
1981 /* If we already have a replacement, use it. Otherwise,
1982 try to fix up this address in case it is invalid. */
1984 replacement
= find_fixup_replacement (replacements
, var
);
1985 if (replacement
->new)
1987 *loc
= replacement
->new;
1991 *loc
= replacement
->new = x
= fixup_stack_1 (x
, insn
);
1993 /* Unless we are forcing memory to register or we changed the mode,
1994 we can leave things the way they are if the insn is valid. */
1996 INSN_CODE (insn
) = -1;
1997 if (! flag_force_mem
&& GET_MODE (x
) == promoted_mode
1998 && recog_memoized (insn
) >= 0)
2001 *loc
= replacement
->new = gen_reg_rtx (promoted_mode
);
2005 /* If X contains VAR, we need to unshare it here so that we update
2006 each occurrence separately. But all identical MEMs in one insn
2007 must be replaced with the same rtx because of the possibility of
2010 if (reg_mentioned_p (var
, x
))
2012 replacement
= find_fixup_replacement (replacements
, x
);
2013 if (replacement
->new == 0)
2014 replacement
->new = copy_most_rtx (x
, no_share
);
2016 *loc
= x
= replacement
->new;
2017 code
= GET_CODE (x
);
2034 /* Note that in some cases those types of expressions are altered
2035 by optimize_bit_field, and do not survive to get here. */
2036 if (XEXP (x
, 0) == var
2037 || (GET_CODE (XEXP (x
, 0)) == SUBREG
2038 && SUBREG_REG (XEXP (x
, 0)) == var
))
2040 /* Get TEM as a valid MEM in the mode presently in the insn.
2042 We don't worry about the possibility of MATCH_DUP here; it
2043 is highly unlikely and would be tricky to handle. */
2046 if (GET_CODE (tem
) == SUBREG
)
2048 if (GET_MODE_BITSIZE (GET_MODE (tem
))
2049 > GET_MODE_BITSIZE (GET_MODE (var
)))
2051 replacement
= find_fixup_replacement (replacements
, var
);
2052 if (replacement
->new == 0)
2053 replacement
->new = gen_reg_rtx (GET_MODE (var
));
2054 SUBREG_REG (tem
) = replacement
->new;
2056 /* The following code works only if we have a MEM, so we
2057 need to handle the subreg here. We directly substitute
2058 it assuming that a subreg must be OK here. We already
2059 scheduled a replacement to copy the mem into the
2065 tem
= fixup_memory_subreg (tem
, insn
, promoted_mode
, 0);
2068 tem
= fixup_stack_1 (tem
, insn
);
2070 /* Unless we want to load from memory, get TEM into the proper mode
2071 for an extract from memory. This can only be done if the
2072 extract is at a constant position and length. */
2074 if (! flag_force_mem
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
2075 && GET_CODE (XEXP (x
, 2)) == CONST_INT
2076 && ! mode_dependent_address_p (XEXP (tem
, 0))
2077 && ! MEM_VOLATILE_P (tem
))
2079 enum machine_mode wanted_mode
= VOIDmode
;
2080 enum machine_mode is_mode
= GET_MODE (tem
);
2081 HOST_WIDE_INT pos
= INTVAL (XEXP (x
, 2));
2083 if (GET_CODE (x
) == ZERO_EXTRACT
)
2085 enum machine_mode new_mode
2086 = mode_for_extraction (EP_extzv
, 1);
2087 if (new_mode
!= MAX_MACHINE_MODE
)
2088 wanted_mode
= new_mode
;
2090 else if (GET_CODE (x
) == SIGN_EXTRACT
)
2092 enum machine_mode new_mode
2093 = mode_for_extraction (EP_extv
, 1);
2094 if (new_mode
!= MAX_MACHINE_MODE
)
2095 wanted_mode
= new_mode
;
2098 /* If we have a narrower mode, we can do something. */
2099 if (wanted_mode
!= VOIDmode
2100 && GET_MODE_SIZE (wanted_mode
) < GET_MODE_SIZE (is_mode
))
2102 HOST_WIDE_INT offset
= pos
/ BITS_PER_UNIT
;
2103 rtx old_pos
= XEXP (x
, 2);
2106 /* If the bytes and bits are counted differently, we
2107 must adjust the offset. */
2108 if (BYTES_BIG_ENDIAN
!= BITS_BIG_ENDIAN
)
2109 offset
= (GET_MODE_SIZE (is_mode
)
2110 - GET_MODE_SIZE (wanted_mode
) - offset
);
2112 pos
%= GET_MODE_BITSIZE (wanted_mode
);
2114 newmem
= adjust_address_nv (tem
, wanted_mode
, offset
);
2116 /* Make the change and see if the insn remains valid. */
2117 INSN_CODE (insn
) = -1;
2118 XEXP (x
, 0) = newmem
;
2119 XEXP (x
, 2) = GEN_INT (pos
);
2121 if (recog_memoized (insn
) >= 0)
2124 /* Otherwise, restore old position. XEXP (x, 0) will be
2126 XEXP (x
, 2) = old_pos
;
2130 /* If we get here, the bitfield extract insn can't accept a memory
2131 reference. Copy the input into a register. */
2133 tem1
= gen_reg_rtx (GET_MODE (tem
));
2134 emit_insn_before (gen_move_insn (tem1
, tem
), insn
);
2141 if (SUBREG_REG (x
) == var
)
2143 /* If this is a special SUBREG made because VAR was promoted
2144 from a wider mode, replace it with VAR and call ourself
2145 recursively, this time saying that the object previously
2146 had its current mode (by virtue of the SUBREG). */
2148 if (SUBREG_PROMOTED_VAR_P (x
))
2151 fixup_var_refs_1 (var
, GET_MODE (var
), loc
, insn
, replacements
,
2156 /* If this SUBREG makes VAR wider, it has become a paradoxical
2157 SUBREG with VAR in memory, but these aren't allowed at this
2158 stage of the compilation. So load VAR into a pseudo and take
2159 a SUBREG of that pseudo. */
2160 if (GET_MODE_SIZE (GET_MODE (x
)) > GET_MODE_SIZE (GET_MODE (var
)))
2162 replacement
= find_fixup_replacement (replacements
, var
);
2163 if (replacement
->new == 0)
2164 replacement
->new = gen_reg_rtx (promoted_mode
);
2165 SUBREG_REG (x
) = replacement
->new;
2169 /* See if we have already found a replacement for this SUBREG.
2170 If so, use it. Otherwise, make a MEM and see if the insn
2171 is recognized. If not, or if we should force MEM into a register,
2172 make a pseudo for this SUBREG. */
2173 replacement
= find_fixup_replacement (replacements
, x
);
2174 if (replacement
->new)
2176 *loc
= replacement
->new;
2180 replacement
->new = *loc
= fixup_memory_subreg (x
, insn
,
2183 INSN_CODE (insn
) = -1;
2184 if (! flag_force_mem
&& recog_memoized (insn
) >= 0)
2187 *loc
= replacement
->new = gen_reg_rtx (GET_MODE (x
));
2193 /* First do special simplification of bit-field references. */
2194 if (GET_CODE (SET_DEST (x
)) == SIGN_EXTRACT
2195 || GET_CODE (SET_DEST (x
)) == ZERO_EXTRACT
)
2196 optimize_bit_field (x
, insn
, 0);
2197 if (GET_CODE (SET_SRC (x
)) == SIGN_EXTRACT
2198 || GET_CODE (SET_SRC (x
)) == ZERO_EXTRACT
)
2199 optimize_bit_field (x
, insn
, 0);
2201 /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object
2202 into a register and then store it back out. */
2203 if (GET_CODE (SET_DEST (x
)) == ZERO_EXTRACT
2204 && GET_CODE (XEXP (SET_DEST (x
), 0)) == SUBREG
2205 && SUBREG_REG (XEXP (SET_DEST (x
), 0)) == var
2206 && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x
), 0)))
2207 > GET_MODE_SIZE (GET_MODE (var
))))
2209 replacement
= find_fixup_replacement (replacements
, var
);
2210 if (replacement
->new == 0)
2211 replacement
->new = gen_reg_rtx (GET_MODE (var
));
2213 SUBREG_REG (XEXP (SET_DEST (x
), 0)) = replacement
->new;
2214 emit_insn_after (gen_move_insn (var
, replacement
->new), insn
);
2217 /* If SET_DEST is now a paradoxical SUBREG, put the result of this
2218 insn into a pseudo and store the low part of the pseudo into VAR. */
2219 if (GET_CODE (SET_DEST (x
)) == SUBREG
2220 && SUBREG_REG (SET_DEST (x
)) == var
2221 && (GET_MODE_SIZE (GET_MODE (SET_DEST (x
)))
2222 > GET_MODE_SIZE (GET_MODE (var
))))
2224 SET_DEST (x
) = tem
= gen_reg_rtx (GET_MODE (SET_DEST (x
)));
2225 emit_insn_after (gen_move_insn (var
, gen_lowpart (GET_MODE (var
),
2232 rtx dest
= SET_DEST (x
);
2233 rtx src
= SET_SRC (x
);
2234 rtx outerdest
= dest
;
2236 while (GET_CODE (dest
) == SUBREG
|| GET_CODE (dest
) == STRICT_LOW_PART
2237 || GET_CODE (dest
) == SIGN_EXTRACT
2238 || GET_CODE (dest
) == ZERO_EXTRACT
)
2239 dest
= XEXP (dest
, 0);
2241 if (GET_CODE (src
) == SUBREG
)
2242 src
= SUBREG_REG (src
);
2244 /* If VAR does not appear at the top level of the SET
2245 just scan the lower levels of the tree. */
2247 if (src
!= var
&& dest
!= var
)
2250 /* We will need to rerecognize this insn. */
2251 INSN_CODE (insn
) = -1;
2253 if (GET_CODE (outerdest
) == ZERO_EXTRACT
&& dest
== var
2254 && mode_for_extraction (EP_insv
, -1) != MAX_MACHINE_MODE
)
2256 /* Since this case will return, ensure we fixup all the
2258 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (outerdest
, 1),
2259 insn
, replacements
, no_share
);
2260 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (outerdest
, 2),
2261 insn
, replacements
, no_share
);
2262 fixup_var_refs_1 (var
, promoted_mode
, &SET_SRC (x
),
2263 insn
, replacements
, no_share
);
2265 tem
= XEXP (outerdest
, 0);
2267 /* Clean up (SUBREG:SI (MEM:mode ...) 0)
2268 that may appear inside a ZERO_EXTRACT.
2269 This was legitimate when the MEM was a REG. */
2270 if (GET_CODE (tem
) == SUBREG
2271 && SUBREG_REG (tem
) == var
)
2272 tem
= fixup_memory_subreg (tem
, insn
, promoted_mode
, 0);
2274 tem
= fixup_stack_1 (tem
, insn
);
2276 if (GET_CODE (XEXP (outerdest
, 1)) == CONST_INT
2277 && GET_CODE (XEXP (outerdest
, 2)) == CONST_INT
2278 && ! mode_dependent_address_p (XEXP (tem
, 0))
2279 && ! MEM_VOLATILE_P (tem
))
2281 enum machine_mode wanted_mode
;
2282 enum machine_mode is_mode
= GET_MODE (tem
);
2283 HOST_WIDE_INT pos
= INTVAL (XEXP (outerdest
, 2));
2285 wanted_mode
= mode_for_extraction (EP_insv
, 0);
2287 /* If we have a narrower mode, we can do something. */
2288 if (GET_MODE_SIZE (wanted_mode
) < GET_MODE_SIZE (is_mode
))
2290 HOST_WIDE_INT offset
= pos
/ BITS_PER_UNIT
;
2291 rtx old_pos
= XEXP (outerdest
, 2);
2294 if (BYTES_BIG_ENDIAN
!= BITS_BIG_ENDIAN
)
2295 offset
= (GET_MODE_SIZE (is_mode
)
2296 - GET_MODE_SIZE (wanted_mode
) - offset
);
2298 pos
%= GET_MODE_BITSIZE (wanted_mode
);
2300 newmem
= adjust_address_nv (tem
, wanted_mode
, offset
);
2302 /* Make the change and see if the insn remains valid. */
2303 INSN_CODE (insn
) = -1;
2304 XEXP (outerdest
, 0) = newmem
;
2305 XEXP (outerdest
, 2) = GEN_INT (pos
);
2307 if (recog_memoized (insn
) >= 0)
2310 /* Otherwise, restore old position. XEXP (x, 0) will be
2312 XEXP (outerdest
, 2) = old_pos
;
2316 /* If we get here, the bit-field store doesn't allow memory
2317 or isn't located at a constant position. Load the value into
2318 a register, do the store, and put it back into memory. */
2320 tem1
= gen_reg_rtx (GET_MODE (tem
));
2321 emit_insn_before (gen_move_insn (tem1
, tem
), insn
);
2322 emit_insn_after (gen_move_insn (tem
, tem1
), insn
);
2323 XEXP (outerdest
, 0) = tem1
;
2327 /* STRICT_LOW_PART is a no-op on memory references
2328 and it can cause combinations to be unrecognizable,
2331 if (dest
== var
&& GET_CODE (SET_DEST (x
)) == STRICT_LOW_PART
)
2332 SET_DEST (x
) = XEXP (SET_DEST (x
), 0);
2334 /* A valid insn to copy VAR into or out of a register
2335 must be left alone, to avoid an infinite loop here.
2336 If the reference to VAR is by a subreg, fix that up,
2337 since SUBREG is not valid for a memref.
2338 Also fix up the address of the stack slot.
2340 Note that we must not try to recognize the insn until
2341 after we know that we have valid addresses and no
2342 (subreg (mem ...) ...) constructs, since these interfere
2343 with determining the validity of the insn. */
2345 if ((SET_SRC (x
) == var
2346 || (GET_CODE (SET_SRC (x
)) == SUBREG
2347 && SUBREG_REG (SET_SRC (x
)) == var
))
2348 && (GET_CODE (SET_DEST (x
)) == REG
2349 || (GET_CODE (SET_DEST (x
)) == SUBREG
2350 && GET_CODE (SUBREG_REG (SET_DEST (x
))) == REG
))
2351 && GET_MODE (var
) == promoted_mode
2352 && x
== single_set (insn
))
2356 if (GET_CODE (SET_SRC (x
)) == SUBREG
2357 && (GET_MODE_SIZE (GET_MODE (SET_SRC (x
)))
2358 > GET_MODE_SIZE (GET_MODE (var
))))
2360 /* This (subreg VAR) is now a paradoxical subreg. We need
2361 to replace VAR instead of the subreg. */
2362 replacement
= find_fixup_replacement (replacements
, var
);
2363 if (replacement
->new == NULL_RTX
)
2364 replacement
->new = gen_reg_rtx (GET_MODE (var
));
2365 SUBREG_REG (SET_SRC (x
)) = replacement
->new;
2369 replacement
= find_fixup_replacement (replacements
, SET_SRC (x
));
2370 if (replacement
->new)
2371 SET_SRC (x
) = replacement
->new;
2372 else if (GET_CODE (SET_SRC (x
)) == SUBREG
)
2373 SET_SRC (x
) = replacement
->new
2374 = fixup_memory_subreg (SET_SRC (x
), insn
, promoted_mode
,
2377 SET_SRC (x
) = replacement
->new
2378 = fixup_stack_1 (SET_SRC (x
), insn
);
2381 if (recog_memoized (insn
) >= 0)
2384 /* INSN is not valid, but we know that we want to
2385 copy SET_SRC (x) to SET_DEST (x) in some way. So
2386 we generate the move and see whether it requires more
2387 than one insn. If it does, we emit those insns and
2388 delete INSN. Otherwise, we an just replace the pattern
2389 of INSN; we have already verified above that INSN has
2390 no other function that to do X. */
2392 pat
= gen_move_insn (SET_DEST (x
), SET_SRC (x
));
2393 if (NEXT_INSN (pat
) != NULL_RTX
)
2395 last
= emit_insn_before (pat
, insn
);
2397 /* INSN might have REG_RETVAL or other important notes, so
2398 we need to store the pattern of the last insn in the
2399 sequence into INSN similarly to the normal case. LAST
2400 should not have REG_NOTES, but we allow them if INSN has
2402 if (REG_NOTES (last
) && REG_NOTES (insn
))
2404 if (REG_NOTES (last
))
2405 REG_NOTES (insn
) = REG_NOTES (last
);
2406 PATTERN (insn
) = PATTERN (last
);
2411 PATTERN (insn
) = PATTERN (pat
);
2416 if ((SET_DEST (x
) == var
2417 || (GET_CODE (SET_DEST (x
)) == SUBREG
2418 && SUBREG_REG (SET_DEST (x
)) == var
))
2419 && (GET_CODE (SET_SRC (x
)) == REG
2420 || (GET_CODE (SET_SRC (x
)) == SUBREG
2421 && GET_CODE (SUBREG_REG (SET_SRC (x
))) == REG
))
2422 && GET_MODE (var
) == promoted_mode
2423 && x
== single_set (insn
))
2427 if (GET_CODE (SET_DEST (x
)) == SUBREG
)
2428 SET_DEST (x
) = fixup_memory_subreg (SET_DEST (x
), insn
,
2431 SET_DEST (x
) = fixup_stack_1 (SET_DEST (x
), insn
);
2433 if (recog_memoized (insn
) >= 0)
2436 pat
= gen_move_insn (SET_DEST (x
), SET_SRC (x
));
2437 if (NEXT_INSN (pat
) != NULL_RTX
)
2439 last
= emit_insn_before (pat
, insn
);
2441 /* INSN might have REG_RETVAL or other important notes, so
2442 we need to store the pattern of the last insn in the
2443 sequence into INSN similarly to the normal case. LAST
2444 should not have REG_NOTES, but we allow them if INSN has
2446 if (REG_NOTES (last
) && REG_NOTES (insn
))
2448 if (REG_NOTES (last
))
2449 REG_NOTES (insn
) = REG_NOTES (last
);
2450 PATTERN (insn
) = PATTERN (last
);
2455 PATTERN (insn
) = PATTERN (pat
);
2460 /* Otherwise, storing into VAR must be handled specially
2461 by storing into a temporary and copying that into VAR
2462 with a new insn after this one. Note that this case
2463 will be used when storing into a promoted scalar since
2464 the insn will now have different modes on the input
2465 and output and hence will be invalid (except for the case
2466 of setting it to a constant, which does not need any
2467 change if it is valid). We generate extra code in that case,
2468 but combine.c will eliminate it. */
2473 rtx fixeddest
= SET_DEST (x
);
2474 enum machine_mode temp_mode
;
2476 /* STRICT_LOW_PART can be discarded, around a MEM. */
2477 if (GET_CODE (fixeddest
) == STRICT_LOW_PART
)
2478 fixeddest
= XEXP (fixeddest
, 0);
2479 /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */
2480 if (GET_CODE (fixeddest
) == SUBREG
)
2482 fixeddest
= fixup_memory_subreg (fixeddest
, insn
,
2484 temp_mode
= GET_MODE (fixeddest
);
2488 fixeddest
= fixup_stack_1 (fixeddest
, insn
);
2489 temp_mode
= promoted_mode
;
2492 temp
= gen_reg_rtx (temp_mode
);
2494 emit_insn_after (gen_move_insn (fixeddest
,
2495 gen_lowpart (GET_MODE (fixeddest
),
2499 SET_DEST (x
) = temp
;
2507 /* Nothing special about this RTX; fix its operands. */
2509 fmt
= GET_RTX_FORMAT (code
);
2510 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2513 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (x
, i
), insn
, replacements
,
2515 else if (fmt
[i
] == 'E')
2518 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2519 fixup_var_refs_1 (var
, promoted_mode
, &XVECEXP (x
, i
, j
),
2520 insn
, replacements
, no_share
);
2525 /* Previously, X had the form (SUBREG:m1 (REG:PROMOTED_MODE ...)).
2526 The REG was placed on the stack, so X now has the form (SUBREG:m1
2529 Return an rtx (MEM:m1 newaddr) which is equivalent. If any insns
2530 must be emitted to compute NEWADDR, put them before INSN.
2532 UNCRITICAL nonzero means accept paradoxical subregs.
2533 This is used for subregs found inside REG_NOTES. */
2536 fixup_memory_subreg (x
, insn
, promoted_mode
, uncritical
)
2539 enum machine_mode promoted_mode
;
2543 rtx mem
= SUBREG_REG (x
);
2544 rtx addr
= XEXP (mem
, 0);
2545 enum machine_mode mode
= GET_MODE (x
);
2548 /* Paradoxical SUBREGs are usually invalid during RTL generation. */
2549 if (GET_MODE_SIZE (mode
) > GET_MODE_SIZE (GET_MODE (mem
)) && ! uncritical
)
2552 offset
= SUBREG_BYTE (x
);
2553 if (BYTES_BIG_ENDIAN
)
2554 /* If the PROMOTED_MODE is wider than the mode of the MEM, adjust
2555 the offset so that it points to the right location within the
2557 offset
-= (GET_MODE_SIZE (promoted_mode
) - GET_MODE_SIZE (GET_MODE (mem
)));
2559 if (!flag_force_addr
2560 && memory_address_p (mode
, plus_constant (addr
, offset
)))
2561 /* Shortcut if no insns need be emitted. */
2562 return adjust_address (mem
, mode
, offset
);
2565 result
= adjust_address (mem
, mode
, offset
);
2569 emit_insn_before (seq
, insn
);
2573 /* Do fixup_memory_subreg on all (SUBREG (MEM ...) ...) contained in X.
2574 Replace subexpressions of X in place.
2575 If X itself is a (SUBREG (MEM ...) ...), return the replacement expression.
2576 Otherwise return X, with its contents possibly altered.
2578 INSN, PROMOTED_MODE and UNCRITICAL are as for
2579 fixup_memory_subreg. */
2582 walk_fixup_memory_subreg (x
, insn
, promoted_mode
, uncritical
)
2585 enum machine_mode promoted_mode
;
2595 code
= GET_CODE (x
);
2597 if (code
== SUBREG
&& GET_CODE (SUBREG_REG (x
)) == MEM
)
2598 return fixup_memory_subreg (x
, insn
, promoted_mode
, uncritical
);
2600 /* Nothing special about this RTX; fix its operands. */
2602 fmt
= GET_RTX_FORMAT (code
);
2603 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2606 XEXP (x
, i
) = walk_fixup_memory_subreg (XEXP (x
, i
), insn
,
2607 promoted_mode
, uncritical
);
2608 else if (fmt
[i
] == 'E')
2611 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2613 = walk_fixup_memory_subreg (XVECEXP (x
, i
, j
), insn
,
2614 promoted_mode
, uncritical
);
2620 /* For each memory ref within X, if it refers to a stack slot
2621 with an out of range displacement, put the address in a temp register
2622 (emitting new insns before INSN to load these registers)
2623 and alter the memory ref to use that register.
2624 Replace each such MEM rtx with a copy, to avoid clobberage. */
2627 fixup_stack_1 (x
, insn
)
2632 RTX_CODE code
= GET_CODE (x
);
2637 rtx ad
= XEXP (x
, 0);
2638 /* If we have address of a stack slot but it's not valid
2639 (displacement is too large), compute the sum in a register. */
2640 if (GET_CODE (ad
) == PLUS
2641 && GET_CODE (XEXP (ad
, 0)) == REG
2642 && ((REGNO (XEXP (ad
, 0)) >= FIRST_VIRTUAL_REGISTER
2643 && REGNO (XEXP (ad
, 0)) <= LAST_VIRTUAL_REGISTER
)
2644 || REGNO (XEXP (ad
, 0)) == FRAME_POINTER_REGNUM
2645 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2646 || REGNO (XEXP (ad
, 0)) == HARD_FRAME_POINTER_REGNUM
2648 || REGNO (XEXP (ad
, 0)) == STACK_POINTER_REGNUM
2649 || REGNO (XEXP (ad
, 0)) == ARG_POINTER_REGNUM
2650 || XEXP (ad
, 0) == current_function_internal_arg_pointer
)
2651 && GET_CODE (XEXP (ad
, 1)) == CONST_INT
)
2654 if (memory_address_p (GET_MODE (x
), ad
))
2658 temp
= copy_to_reg (ad
);
2661 emit_insn_before (seq
, insn
);
2662 return replace_equiv_address (x
, temp
);
2667 fmt
= GET_RTX_FORMAT (code
);
2668 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2671 XEXP (x
, i
) = fixup_stack_1 (XEXP (x
, i
), insn
);
2672 else if (fmt
[i
] == 'E')
2675 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2676 XVECEXP (x
, i
, j
) = fixup_stack_1 (XVECEXP (x
, i
, j
), insn
);
2682 /* Optimization: a bit-field instruction whose field
2683 happens to be a byte or halfword in memory
2684 can be changed to a move instruction.
2686 We call here when INSN is an insn to examine or store into a bit-field.
2687 BODY is the SET-rtx to be altered.
2689 EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0.
2690 (Currently this is called only from function.c, and EQUIV_MEM
2694 optimize_bit_field (body
, insn
, equiv_mem
)
2702 enum machine_mode mode
;
2704 if (GET_CODE (SET_DEST (body
)) == SIGN_EXTRACT
2705 || GET_CODE (SET_DEST (body
)) == ZERO_EXTRACT
)
2706 bitfield
= SET_DEST (body
), destflag
= 1;
2708 bitfield
= SET_SRC (body
), destflag
= 0;
2710 /* First check that the field being stored has constant size and position
2711 and is in fact a byte or halfword suitably aligned. */
2713 if (GET_CODE (XEXP (bitfield
, 1)) == CONST_INT
2714 && GET_CODE (XEXP (bitfield
, 2)) == CONST_INT
2715 && ((mode
= mode_for_size (INTVAL (XEXP (bitfield
, 1)), MODE_INT
, 1))
2717 && INTVAL (XEXP (bitfield
, 2)) % INTVAL (XEXP (bitfield
, 1)) == 0)
2721 /* Now check that the containing word is memory, not a register,
2722 and that it is safe to change the machine mode. */
2724 if (GET_CODE (XEXP (bitfield
, 0)) == MEM
)
2725 memref
= XEXP (bitfield
, 0);
2726 else if (GET_CODE (XEXP (bitfield
, 0)) == REG
2728 memref
= equiv_mem
[REGNO (XEXP (bitfield
, 0))];
2729 else if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
2730 && GET_CODE (SUBREG_REG (XEXP (bitfield
, 0))) == MEM
)
2731 memref
= SUBREG_REG (XEXP (bitfield
, 0));
2732 else if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
2734 && GET_CODE (SUBREG_REG (XEXP (bitfield
, 0))) == REG
)
2735 memref
= equiv_mem
[REGNO (SUBREG_REG (XEXP (bitfield
, 0)))];
2738 && ! mode_dependent_address_p (XEXP (memref
, 0))
2739 && ! MEM_VOLATILE_P (memref
))
2741 /* Now adjust the address, first for any subreg'ing
2742 that we are now getting rid of,
2743 and then for which byte of the word is wanted. */
2745 HOST_WIDE_INT offset
= INTVAL (XEXP (bitfield
, 2));
2748 /* Adjust OFFSET to count bits from low-address byte. */
2749 if (BITS_BIG_ENDIAN
!= BYTES_BIG_ENDIAN
)
2750 offset
= (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield
, 0)))
2751 - offset
- INTVAL (XEXP (bitfield
, 1)));
2753 /* Adjust OFFSET to count bytes from low-address byte. */
2754 offset
/= BITS_PER_UNIT
;
2755 if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
)
2757 offset
+= (SUBREG_BYTE (XEXP (bitfield
, 0))
2758 / UNITS_PER_WORD
) * UNITS_PER_WORD
;
2759 if (BYTES_BIG_ENDIAN
)
2760 offset
-= (MIN (UNITS_PER_WORD
,
2761 GET_MODE_SIZE (GET_MODE (XEXP (bitfield
, 0))))
2762 - MIN (UNITS_PER_WORD
,
2763 GET_MODE_SIZE (GET_MODE (memref
))));
2767 memref
= adjust_address (memref
, mode
, offset
);
2768 insns
= get_insns ();
2770 emit_insn_before (insns
, insn
);
2772 /* Store this memory reference where
2773 we found the bit field reference. */
2777 validate_change (insn
, &SET_DEST (body
), memref
, 1);
2778 if (! CONSTANT_ADDRESS_P (SET_SRC (body
)))
2780 rtx src
= SET_SRC (body
);
2781 while (GET_CODE (src
) == SUBREG
2782 && SUBREG_BYTE (src
) == 0)
2783 src
= SUBREG_REG (src
);
2784 if (GET_MODE (src
) != GET_MODE (memref
))
2785 src
= gen_lowpart (GET_MODE (memref
), SET_SRC (body
));
2786 validate_change (insn
, &SET_SRC (body
), src
, 1);
2788 else if (GET_MODE (SET_SRC (body
)) != VOIDmode
2789 && GET_MODE (SET_SRC (body
)) != GET_MODE (memref
))
2790 /* This shouldn't happen because anything that didn't have
2791 one of these modes should have got converted explicitly
2792 and then referenced through a subreg.
2793 This is so because the original bit-field was
2794 handled by agg_mode and so its tree structure had
2795 the same mode that memref now has. */
2800 rtx dest
= SET_DEST (body
);
2802 while (GET_CODE (dest
) == SUBREG
2803 && SUBREG_BYTE (dest
) == 0
2804 && (GET_MODE_CLASS (GET_MODE (dest
))
2805 == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest
))))
2806 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
)))
2808 dest
= SUBREG_REG (dest
);
2810 validate_change (insn
, &SET_DEST (body
), dest
, 1);
2812 if (GET_MODE (dest
) == GET_MODE (memref
))
2813 validate_change (insn
, &SET_SRC (body
), memref
, 1);
2816 /* Convert the mem ref to the destination mode. */
2817 rtx newreg
= gen_reg_rtx (GET_MODE (dest
));
2820 convert_move (newreg
, memref
,
2821 GET_CODE (SET_SRC (body
)) == ZERO_EXTRACT
);
2825 validate_change (insn
, &SET_SRC (body
), newreg
, 1);
2829 /* See if we can convert this extraction or insertion into
2830 a simple move insn. We might not be able to do so if this
2831 was, for example, part of a PARALLEL.
2833 If we succeed, write out any needed conversions. If we fail,
2834 it is hard to guess why we failed, so don't do anything
2835 special; just let the optimization be suppressed. */
2837 if (apply_change_group () && seq
)
2838 emit_insn_before (seq
, insn
);
2843 /* These routines are responsible for converting virtual register references
2844 to the actual hard register references once RTL generation is complete.
2846 The following four variables are used for communication between the
2847 routines. They contain the offsets of the virtual registers from their
2848 respective hard registers. */
2850 static int in_arg_offset
;
2851 static int var_offset
;
2852 static int dynamic_offset
;
2853 static int out_arg_offset
;
2854 static int cfa_offset
;
2856 /* In most machines, the stack pointer register is equivalent to the bottom
2859 #ifndef STACK_POINTER_OFFSET
2860 #define STACK_POINTER_OFFSET 0
2863 /* If not defined, pick an appropriate default for the offset of dynamically
2864 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
2865 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
2867 #ifndef STACK_DYNAMIC_OFFSET
2869 /* The bottom of the stack points to the actual arguments. If
2870 REG_PARM_STACK_SPACE is defined, this includes the space for the register
2871 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
2872 stack space for register parameters is not pushed by the caller, but
2873 rather part of the fixed stack areas and hence not included in
2874 `current_function_outgoing_args_size'. Nevertheless, we must allow
2875 for it when allocating stack dynamic objects. */
2877 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2878 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2879 ((ACCUMULATE_OUTGOING_ARGS \
2880 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
2881 + (STACK_POINTER_OFFSET)) \
2884 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2885 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
2886 + (STACK_POINTER_OFFSET))
2890 /* On most machines, the CFA coincides with the first incoming parm. */
2892 #ifndef ARG_POINTER_CFA_OFFSET
2893 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
2896 /* Build up a (MEM (ADDRESSOF (REG))) rtx for a register REG that just had its
2897 address taken. DECL is the decl or SAVE_EXPR for the object stored in the
2898 register, for later use if we do need to force REG into the stack. REG is
2899 overwritten by the MEM like in put_reg_into_stack. */
2902 gen_mem_addressof (reg
, decl
)
2906 rtx r
= gen_rtx_ADDRESSOF (Pmode
, gen_reg_rtx (GET_MODE (reg
)),
2909 /* Calculate this before we start messing with decl's RTL. */
2910 HOST_WIDE_INT set
= decl
? get_alias_set (decl
) : 0;
2912 /* If the original REG was a user-variable, then so is the REG whose
2913 address is being taken. Likewise for unchanging. */
2914 REG_USERVAR_P (XEXP (r
, 0)) = REG_USERVAR_P (reg
);
2915 RTX_UNCHANGING_P (XEXP (r
, 0)) = RTX_UNCHANGING_P (reg
);
2917 PUT_CODE (reg
, MEM
);
2918 MEM_ATTRS (reg
) = 0;
2923 tree type
= TREE_TYPE (decl
);
2924 enum machine_mode decl_mode
2925 = (DECL_P (decl
) ? DECL_MODE (decl
) : TYPE_MODE (TREE_TYPE (decl
)));
2926 rtx decl_rtl
= (TREE_CODE (decl
) == SAVE_EXPR
? SAVE_EXPR_RTL (decl
)
2927 : DECL_RTL_IF_SET (decl
));
2929 PUT_MODE (reg
, decl_mode
);
2931 /* Clear DECL_RTL momentarily so functions below will work
2932 properly, then set it again. */
2933 if (DECL_P (decl
) && decl_rtl
== reg
)
2934 SET_DECL_RTL (decl
, 0);
2936 set_mem_attributes (reg
, decl
, 1);
2937 set_mem_alias_set (reg
, set
);
2939 if (DECL_P (decl
) && decl_rtl
== reg
)
2940 SET_DECL_RTL (decl
, reg
);
2942 if (TREE_USED (decl
) || (DECL_P (decl
) && DECL_INITIAL (decl
) != 0))
2943 fixup_var_refs (reg
, GET_MODE (reg
), TREE_UNSIGNED (type
), reg
, 0);
2946 fixup_var_refs (reg
, GET_MODE (reg
), 0, reg
, 0);
2951 /* If DECL has an RTL that is an ADDRESSOF rtx, put it into the stack. */
2954 flush_addressof (decl
)
2957 if ((TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == VAR_DECL
)
2958 && DECL_RTL (decl
) != 0
2959 && GET_CODE (DECL_RTL (decl
)) == MEM
2960 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == ADDRESSOF
2961 && GET_CODE (XEXP (XEXP (DECL_RTL (decl
), 0), 0)) == REG
)
2962 put_addressof_into_stack (XEXP (DECL_RTL (decl
), 0), 0);
2965 /* Force the register pointed to by R, an ADDRESSOF rtx, into the stack. */
2968 put_addressof_into_stack (r
, ht
)
2973 int volatile_p
, used_p
;
2975 rtx reg
= XEXP (r
, 0);
2977 if (GET_CODE (reg
) != REG
)
2980 decl
= ADDRESSOF_DECL (r
);
2983 type
= TREE_TYPE (decl
);
2984 volatile_p
= (TREE_CODE (decl
) != SAVE_EXPR
2985 && TREE_THIS_VOLATILE (decl
));
2986 used_p
= (TREE_USED (decl
)
2987 || (DECL_P (decl
) && DECL_INITIAL (decl
) != 0));
2996 put_reg_into_stack (0, reg
, type
, GET_MODE (reg
), GET_MODE (reg
),
2997 volatile_p
, ADDRESSOF_REGNO (r
), used_p
, ht
);
3000 /* List of replacements made below in purge_addressof_1 when creating
3001 bitfield insertions. */
3002 static rtx purge_bitfield_addressof_replacements
;
3004 /* List of replacements made below in purge_addressof_1 for patterns
3005 (MEM (ADDRESSOF (REG ...))). The key of the list entry is the
3006 corresponding (ADDRESSOF (REG ...)) and value is a substitution for
3007 the all pattern. List PURGE_BITFIELD_ADDRESSOF_REPLACEMENTS is not
3008 enough in complex cases, e.g. when some field values can be
3009 extracted by usage MEM with narrower mode. */
3010 static rtx purge_addressof_replacements
;
3012 /* Helper function for purge_addressof. See if the rtx expression at *LOC
3013 in INSN needs to be changed. If FORCE, always put any ADDRESSOFs into
3014 the stack. If the function returns FALSE then the replacement could not
3018 purge_addressof_1 (loc
, insn
, force
, store
, ht
)
3030 /* Re-start here to avoid recursion in common cases. */
3037 code
= GET_CODE (x
);
3039 /* If we don't return in any of the cases below, we will recurse inside
3040 the RTX, which will normally result in any ADDRESSOF being forced into
3044 result
= purge_addressof_1 (&SET_DEST (x
), insn
, force
, 1, ht
);
3045 result
&= purge_addressof_1 (&SET_SRC (x
), insn
, force
, 0, ht
);
3048 else if (code
== ADDRESSOF
)
3052 if (GET_CODE (XEXP (x
, 0)) != MEM
)
3054 put_addressof_into_stack (x
, ht
);
3058 /* We must create a copy of the rtx because it was created by
3059 overwriting a REG rtx which is always shared. */
3060 sub
= copy_rtx (XEXP (XEXP (x
, 0), 0));
3061 if (validate_change (insn
, loc
, sub
, 0)
3062 || validate_replace_rtx (x
, sub
, insn
))
3066 sub
= force_operand (sub
, NULL_RTX
);
3067 if (! validate_change (insn
, loc
, sub
, 0)
3068 && ! validate_replace_rtx (x
, sub
, insn
))
3071 insns
= get_insns ();
3073 emit_insn_before (insns
, insn
);
3077 else if (code
== MEM
&& GET_CODE (XEXP (x
, 0)) == ADDRESSOF
&& ! force
)
3079 rtx sub
= XEXP (XEXP (x
, 0), 0);
3081 if (GET_CODE (sub
) == MEM
)
3082 sub
= adjust_address_nv (sub
, GET_MODE (x
), 0);
3083 else if (GET_CODE (sub
) == REG
3084 && (MEM_VOLATILE_P (x
) || GET_MODE (x
) == BLKmode
))
3086 else if (GET_CODE (sub
) == REG
&& GET_MODE (x
) != GET_MODE (sub
))
3088 int size_x
, size_sub
;
3092 /* When processing REG_NOTES look at the list of
3093 replacements done on the insn to find the register that X
3097 for (tem
= purge_bitfield_addressof_replacements
;
3099 tem
= XEXP (XEXP (tem
, 1), 1))
3100 if (rtx_equal_p (x
, XEXP (tem
, 0)))
3102 *loc
= XEXP (XEXP (tem
, 1), 0);
3106 /* See comment for purge_addressof_replacements. */
3107 for (tem
= purge_addressof_replacements
;
3109 tem
= XEXP (XEXP (tem
, 1), 1))
3110 if (rtx_equal_p (XEXP (x
, 0), XEXP (tem
, 0)))
3112 rtx z
= XEXP (XEXP (tem
, 1), 0);
3114 if (GET_MODE (x
) == GET_MODE (z
)
3115 || (GET_CODE (XEXP (XEXP (tem
, 1), 0)) != REG
3116 && GET_CODE (XEXP (XEXP (tem
, 1), 0)) != SUBREG
))
3119 /* It can happen that the note may speak of things
3120 in a wider (or just different) mode than the
3121 code did. This is especially true of
3124 if (GET_CODE (z
) == SUBREG
&& SUBREG_BYTE (z
) == 0)
3127 if (GET_MODE_SIZE (GET_MODE (x
)) > UNITS_PER_WORD
3128 && (GET_MODE_SIZE (GET_MODE (x
))
3129 > GET_MODE_SIZE (GET_MODE (z
))))
3131 /* This can occur as a result in invalid
3132 pointer casts, e.g. float f; ...
3133 *(long long int *)&f.
3134 ??? We could emit a warning here, but
3135 without a line number that wouldn't be
3137 z
= gen_rtx_SUBREG (GET_MODE (x
), z
, 0);
3140 z
= gen_lowpart (GET_MODE (x
), z
);
3146 /* Sometimes we may not be able to find the replacement. For
3147 example when the original insn was a MEM in a wider mode,
3148 and the note is part of a sign extension of a narrowed
3149 version of that MEM. Gcc testcase compile/990829-1.c can
3150 generate an example of this situation. Rather than complain
3151 we return false, which will prompt our caller to remove the
3156 size_x
= GET_MODE_BITSIZE (GET_MODE (x
));
3157 size_sub
= GET_MODE_BITSIZE (GET_MODE (sub
));
3159 /* Don't even consider working with paradoxical subregs,
3160 or the moral equivalent seen here. */
3161 if (size_x
<= size_sub
3162 && int_mode_for_mode (GET_MODE (sub
)) != BLKmode
)
3164 /* Do a bitfield insertion to mirror what would happen
3171 rtx p
= PREV_INSN (insn
);
3174 val
= gen_reg_rtx (GET_MODE (x
));
3175 if (! validate_change (insn
, loc
, val
, 0))
3177 /* Discard the current sequence and put the
3178 ADDRESSOF on stack. */
3184 emit_insn_before (seq
, insn
);
3185 compute_insns_for_mem (p
? NEXT_INSN (p
) : get_insns (),
3189 store_bit_field (sub
, size_x
, 0, GET_MODE (x
),
3190 val
, GET_MODE_SIZE (GET_MODE (sub
)));
3192 /* Make sure to unshare any shared rtl that store_bit_field
3193 might have created. */
3194 unshare_all_rtl_again (get_insns ());
3198 p
= emit_insn_after (seq
, insn
);
3199 if (NEXT_INSN (insn
))
3200 compute_insns_for_mem (NEXT_INSN (insn
),
3201 p
? NEXT_INSN (p
) : NULL_RTX
,
3206 rtx p
= PREV_INSN (insn
);
3209 val
= extract_bit_field (sub
, size_x
, 0, 1, NULL_RTX
,
3210 GET_MODE (x
), GET_MODE (x
),
3211 GET_MODE_SIZE (GET_MODE (sub
)));
3213 if (! validate_change (insn
, loc
, val
, 0))
3215 /* Discard the current sequence and put the
3216 ADDRESSOF on stack. */
3223 emit_insn_before (seq
, insn
);
3224 compute_insns_for_mem (p
? NEXT_INSN (p
) : get_insns (),
3228 /* Remember the replacement so that the same one can be done
3229 on the REG_NOTES. */
3230 purge_bitfield_addressof_replacements
3231 = gen_rtx_EXPR_LIST (VOIDmode
, x
,
3234 purge_bitfield_addressof_replacements
));
3236 /* We replaced with a reg -- all done. */
3241 else if (validate_change (insn
, loc
, sub
, 0))
3243 /* Remember the replacement so that the same one can be done
3244 on the REG_NOTES. */
3245 if (GET_CODE (sub
) == REG
|| GET_CODE (sub
) == SUBREG
)
3249 for (tem
= purge_addressof_replacements
;
3251 tem
= XEXP (XEXP (tem
, 1), 1))
3252 if (rtx_equal_p (XEXP (x
, 0), XEXP (tem
, 0)))
3254 XEXP (XEXP (tem
, 1), 0) = sub
;
3257 purge_addressof_replacements
3258 = gen_rtx (EXPR_LIST
, VOIDmode
, XEXP (x
, 0),
3259 gen_rtx_EXPR_LIST (VOIDmode
, sub
,
3260 purge_addressof_replacements
));
3268 /* Scan all subexpressions. */
3269 fmt
= GET_RTX_FORMAT (code
);
3270 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
3273 result
&= purge_addressof_1 (&XEXP (x
, i
), insn
, force
, 0, ht
);
3274 else if (*fmt
== 'E')
3275 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3276 result
&= purge_addressof_1 (&XVECEXP (x
, i
, j
), insn
, force
, 0, ht
);
3282 /* Return a hash value for K, a REG. */
3285 insns_for_mem_hash (k
)
3288 /* Use the address of the key for the hash value. */
3289 struct insns_for_mem_entry
*m
= (struct insns_for_mem_entry
*) k
;
3290 return (hashval_t
) m
->key
;
3293 /* Return non-zero if K1 and K2 (two REGs) are the same. */
3296 insns_for_mem_comp (k1
, k2
)
3300 struct insns_for_mem_entry
*m1
= (struct insns_for_mem_entry
*) k1
;
3301 struct insns_for_mem_entry
*m2
= (struct insns_for_mem_entry
*) k2
;
3302 return m1
->key
== m2
->key
;
3305 struct insns_for_mem_walk_info
3307 /* The hash table that we are using to record which INSNs use which
3311 /* The INSN we are currently processing. */
3314 /* Zero if we are walking to find ADDRESSOFs, one if we are walking
3315 to find the insns that use the REGs in the ADDRESSOFs. */
3319 /* Called from compute_insns_for_mem via for_each_rtx. If R is a REG
3320 that might be used in an ADDRESSOF expression, record this INSN in
3321 the hash table given by DATA (which is really a pointer to an
3322 insns_for_mem_walk_info structure). */
3325 insns_for_mem_walk (r
, data
)
3329 struct insns_for_mem_walk_info
*ifmwi
3330 = (struct insns_for_mem_walk_info
*) data
;
3331 struct insns_for_mem_entry tmp
;
3332 tmp
.insns
= NULL_RTX
;
3334 if (ifmwi
->pass
== 0 && *r
&& GET_CODE (*r
) == ADDRESSOF
3335 && GET_CODE (XEXP (*r
, 0)) == REG
)
3338 tmp
.key
= XEXP (*r
, 0);
3339 e
= htab_find_slot (ifmwi
->ht
, &tmp
, INSERT
);
3342 *e
= ggc_alloc (sizeof (tmp
));
3343 memcpy (*e
, &tmp
, sizeof (tmp
));
3346 else if (ifmwi
->pass
== 1 && *r
&& GET_CODE (*r
) == REG
)
3348 struct insns_for_mem_entry
*ifme
;
3350 ifme
= (struct insns_for_mem_entry
*) htab_find (ifmwi
->ht
, &tmp
);
3352 /* If we have not already recorded this INSN, do so now. Since
3353 we process the INSNs in order, we know that if we have
3354 recorded it it must be at the front of the list. */
3355 if (ifme
&& (!ifme
->insns
|| XEXP (ifme
->insns
, 0) != ifmwi
->insn
))
3356 ifme
->insns
= gen_rtx_EXPR_LIST (VOIDmode
, ifmwi
->insn
,
3363 /* Walk the INSNS, until we reach LAST_INSN, recording which INSNs use
3364 which REGs in HT. */
3367 compute_insns_for_mem (insns
, last_insn
, ht
)
3373 struct insns_for_mem_walk_info ifmwi
;
3376 for (ifmwi
.pass
= 0; ifmwi
.pass
< 2; ++ifmwi
.pass
)
3377 for (insn
= insns
; insn
!= last_insn
; insn
= NEXT_INSN (insn
))
3381 for_each_rtx (&insn
, insns_for_mem_walk
, &ifmwi
);
3385 /* Helper function for purge_addressof called through for_each_rtx.
3386 Returns true iff the rtl is an ADDRESSOF. */
3389 is_addressof (rtl
, data
)
3391 void *data ATTRIBUTE_UNUSED
;
3393 return GET_CODE (*rtl
) == ADDRESSOF
;
3396 /* Eliminate all occurrences of ADDRESSOF from INSNS. Elide any remaining
3397 (MEM (ADDRESSOF)) patterns, and force any needed registers into the
3401 purge_addressof (insns
)
3407 /* When we actually purge ADDRESSOFs, we turn REGs into MEMs. That
3408 requires a fixup pass over the instruction stream to correct
3409 INSNs that depended on the REG being a REG, and not a MEM. But,
3410 these fixup passes are slow. Furthermore, most MEMs are not
3411 mentioned in very many instructions. So, we speed up the process
3412 by pre-calculating which REGs occur in which INSNs; that allows
3413 us to perform the fixup passes much more quickly. */
3414 ht
= htab_create_ggc (1000, insns_for_mem_hash
, insns_for_mem_comp
, NULL
);
3415 compute_insns_for_mem (insns
, NULL_RTX
, ht
);
3417 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
3418 if (GET_CODE (insn
) == INSN
|| GET_CODE (insn
) == JUMP_INSN
3419 || GET_CODE (insn
) == CALL_INSN
)
3421 if (! purge_addressof_1 (&PATTERN (insn
), insn
,
3422 asm_noperands (PATTERN (insn
)) > 0, 0, ht
))
3423 /* If we could not replace the ADDRESSOFs in the insn,
3424 something is wrong. */
3427 if (! purge_addressof_1 (®_NOTES (insn
), NULL_RTX
, 0, 0, ht
))
3429 /* If we could not replace the ADDRESSOFs in the insn's notes,
3430 we can just remove the offending notes instead. */
3433 for (note
= REG_NOTES (insn
); note
; note
= XEXP (note
, 1))
3435 /* If we find a REG_RETVAL note then the insn is a libcall.
3436 Such insns must have REG_EQUAL notes as well, in order
3437 for later passes of the compiler to work. So it is not
3438 safe to delete the notes here, and instead we abort. */
3439 if (REG_NOTE_KIND (note
) == REG_RETVAL
)
3441 if (for_each_rtx (¬e
, is_addressof
, NULL
))
3442 remove_note (insn
, note
);
3448 purge_bitfield_addressof_replacements
= 0;
3449 purge_addressof_replacements
= 0;
3451 /* REGs are shared. purge_addressof will destructively replace a REG
3452 with a MEM, which creates shared MEMs.
3454 Unfortunately, the children of put_reg_into_stack assume that MEMs
3455 referring to the same stack slot are shared (fixup_var_refs and
3456 the associated hash table code).
3458 So, we have to do another unsharing pass after we have flushed any
3459 REGs that had their address taken into the stack.
3461 It may be worth tracking whether or not we converted any REGs into
3462 MEMs to avoid this overhead when it is not needed. */
3463 unshare_all_rtl_again (get_insns ());
3466 /* Convert a SET of a hard subreg to a set of the appropriate hard
3467 register. A subroutine of purge_hard_subreg_sets. */
3470 purge_single_hard_subreg_set (pattern
)
3473 rtx reg
= SET_DEST (pattern
);
3474 enum machine_mode mode
= GET_MODE (SET_DEST (pattern
));
3477 if (GET_CODE (reg
) == SUBREG
&& GET_CODE (SUBREG_REG (reg
)) == REG
3478 && REGNO (SUBREG_REG (reg
)) < FIRST_PSEUDO_REGISTER
)
3480 offset
= subreg_regno_offset (REGNO (SUBREG_REG (reg
)),
3481 GET_MODE (SUBREG_REG (reg
)),
3484 reg
= SUBREG_REG (reg
);
3488 if (GET_CODE (reg
) == REG
&& REGNO (reg
) < FIRST_PSEUDO_REGISTER
)
3490 reg
= gen_rtx_REG (mode
, REGNO (reg
) + offset
);
3491 SET_DEST (pattern
) = reg
;
3495 /* Eliminate all occurrences of SETs of hard subregs from INSNS. The
3496 only such SETs that we expect to see are those left in because
3497 integrate can't handle sets of parts of a return value register.
3499 We don't use alter_subreg because we only want to eliminate subregs
3500 of hard registers. */
3503 purge_hard_subreg_sets (insn
)
3506 for (; insn
; insn
= NEXT_INSN (insn
))
3510 rtx pattern
= PATTERN (insn
);
3511 switch (GET_CODE (pattern
))
3514 if (GET_CODE (SET_DEST (pattern
)) == SUBREG
)
3515 purge_single_hard_subreg_set (pattern
);
3520 for (j
= XVECLEN (pattern
, 0) - 1; j
>= 0; j
--)
3522 rtx inner_pattern
= XVECEXP (pattern
, 0, j
);
3523 if (GET_CODE (inner_pattern
) == SET
3524 && GET_CODE (SET_DEST (inner_pattern
)) == SUBREG
)
3525 purge_single_hard_subreg_set (inner_pattern
);
3536 /* Pass through the INSNS of function FNDECL and convert virtual register
3537 references to hard register references. */
3540 instantiate_virtual_regs (fndecl
, insns
)
3547 /* Compute the offsets to use for this function. */
3548 in_arg_offset
= FIRST_PARM_OFFSET (fndecl
);
3549 var_offset
= STARTING_FRAME_OFFSET
;
3550 dynamic_offset
= STACK_DYNAMIC_OFFSET (fndecl
);
3551 out_arg_offset
= STACK_POINTER_OFFSET
;
3552 cfa_offset
= ARG_POINTER_CFA_OFFSET (fndecl
);
3554 /* Scan all variables and parameters of this function. For each that is
3555 in memory, instantiate all virtual registers if the result is a valid
3556 address. If not, we do it later. That will handle most uses of virtual
3557 regs on many machines. */
3558 instantiate_decls (fndecl
, 1);
3560 /* Initialize recognition, indicating that volatile is OK. */
3563 /* Scan through all the insns, instantiating every virtual register still
3565 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
3566 if (GET_CODE (insn
) == INSN
|| GET_CODE (insn
) == JUMP_INSN
3567 || GET_CODE (insn
) == CALL_INSN
)
3569 instantiate_virtual_regs_1 (&PATTERN (insn
), insn
, 1);
3570 instantiate_virtual_regs_1 (®_NOTES (insn
), NULL_RTX
, 0);
3571 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
3572 if (GET_CODE (insn
) == CALL_INSN
)
3573 instantiate_virtual_regs_1 (&CALL_INSN_FUNCTION_USAGE (insn
),
3577 /* Instantiate the stack slots for the parm registers, for later use in
3578 addressof elimination. */
3579 for (i
= 0; i
< max_parm_reg
; ++i
)
3580 if (parm_reg_stack_loc
[i
])
3581 instantiate_virtual_regs_1 (&parm_reg_stack_loc
[i
], NULL_RTX
, 0);
3583 /* Now instantiate the remaining register equivalences for debugging info.
3584 These will not be valid addresses. */
3585 instantiate_decls (fndecl
, 0);
3587 /* Indicate that, from now on, assign_stack_local should use
3588 frame_pointer_rtx. */
3589 virtuals_instantiated
= 1;
3592 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
3593 all virtual registers in their DECL_RTL's.
3595 If VALID_ONLY, do this only if the resulting address is still valid.
3596 Otherwise, always do it. */
3599 instantiate_decls (fndecl
, valid_only
)
3605 /* Process all parameters of the function. */
3606 for (decl
= DECL_ARGUMENTS (fndecl
); decl
; decl
= TREE_CHAIN (decl
))
3608 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (decl
));
3609 HOST_WIDE_INT size_rtl
;
3611 instantiate_decl (DECL_RTL (decl
), size
, valid_only
);
3613 /* If the parameter was promoted, then the incoming RTL mode may be
3614 larger than the declared type size. We must use the larger of
3616 size_rtl
= GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl
)));
3617 size
= MAX (size_rtl
, size
);
3618 instantiate_decl (DECL_INCOMING_RTL (decl
), size
, valid_only
);
3621 /* Now process all variables defined in the function or its subblocks. */
3622 instantiate_decls_1 (DECL_INITIAL (fndecl
), valid_only
);
3625 /* Subroutine of instantiate_decls: Process all decls in the given
3626 BLOCK node and all its subblocks. */
3629 instantiate_decls_1 (let
, valid_only
)
3635 for (t
= BLOCK_VARS (let
); t
; t
= TREE_CHAIN (t
))
3636 if (DECL_RTL_SET_P (t
))
3637 instantiate_decl (DECL_RTL (t
),
3638 int_size_in_bytes (TREE_TYPE (t
)),
3641 /* Process all subblocks. */
3642 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= TREE_CHAIN (t
))
3643 instantiate_decls_1 (t
, valid_only
);
3646 /* Subroutine of the preceding procedures: Given RTL representing a
3647 decl and the size of the object, do any instantiation required.
3649 If VALID_ONLY is non-zero, it means that the RTL should only be
3650 changed if the new address is valid. */
3653 instantiate_decl (x
, size
, valid_only
)
3658 enum machine_mode mode
;
3661 /* If this is not a MEM, no need to do anything. Similarly if the
3662 address is a constant or a register that is not a virtual register. */
3664 if (x
== 0 || GET_CODE (x
) != MEM
)
3668 if (CONSTANT_P (addr
)
3669 || (GET_CODE (addr
) == ADDRESSOF
&& GET_CODE (XEXP (addr
, 0)) == REG
)
3670 || (GET_CODE (addr
) == REG
3671 && (REGNO (addr
) < FIRST_VIRTUAL_REGISTER
3672 || REGNO (addr
) > LAST_VIRTUAL_REGISTER
)))
3675 /* If we should only do this if the address is valid, copy the address.
3676 We need to do this so we can undo any changes that might make the
3677 address invalid. This copy is unfortunate, but probably can't be
3681 addr
= copy_rtx (addr
);
3683 instantiate_virtual_regs_1 (&addr
, NULL_RTX
, 0);
3685 if (valid_only
&& size
>= 0)
3687 unsigned HOST_WIDE_INT decl_size
= size
;
3689 /* Now verify that the resulting address is valid for every integer or
3690 floating-point mode up to and including SIZE bytes long. We do this
3691 since the object might be accessed in any mode and frame addresses
3694 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
3695 mode
!= VOIDmode
&& GET_MODE_SIZE (mode
) <= decl_size
;
3696 mode
= GET_MODE_WIDER_MODE (mode
))
3697 if (! memory_address_p (mode
, addr
))
3700 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
);
3701 mode
!= VOIDmode
&& GET_MODE_SIZE (mode
) <= decl_size
;
3702 mode
= GET_MODE_WIDER_MODE (mode
))
3703 if (! memory_address_p (mode
, addr
))
3707 /* Put back the address now that we have updated it and we either know
3708 it is valid or we don't care whether it is valid. */
3713 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
3714 is a virtual register, return the equivalent hard register and set the
3715 offset indirectly through the pointer. Otherwise, return 0. */
3718 instantiate_new_reg (x
, poffset
)
3720 HOST_WIDE_INT
*poffset
;
3723 HOST_WIDE_INT offset
;
3725 if (x
== virtual_incoming_args_rtx
)
3726 new = arg_pointer_rtx
, offset
= in_arg_offset
;
3727 else if (x
== virtual_stack_vars_rtx
)
3728 new = frame_pointer_rtx
, offset
= var_offset
;
3729 else if (x
== virtual_stack_dynamic_rtx
)
3730 new = stack_pointer_rtx
, offset
= dynamic_offset
;
3731 else if (x
== virtual_outgoing_args_rtx
)
3732 new = stack_pointer_rtx
, offset
= out_arg_offset
;
3733 else if (x
== virtual_cfa_rtx
)
3734 new = arg_pointer_rtx
, offset
= cfa_offset
;
3742 /* Given a pointer to a piece of rtx and an optional pointer to the
3743 containing object, instantiate any virtual registers present in it.
3745 If EXTRA_INSNS, we always do the replacement and generate
3746 any extra insns before OBJECT. If it zero, we do nothing if replacement
3749 Return 1 if we either had nothing to do or if we were able to do the
3750 needed replacement. Return 0 otherwise; we only return zero if
3751 EXTRA_INSNS is zero.
3753 We first try some simple transformations to avoid the creation of extra
3757 instantiate_virtual_regs_1 (loc
, object
, extra_insns
)
3765 HOST_WIDE_INT offset
= 0;
3771 /* Re-start here to avoid recursion in common cases. */
3778 code
= GET_CODE (x
);
3780 /* Check for some special cases. */
3798 /* We are allowed to set the virtual registers. This means that
3799 the actual register should receive the source minus the
3800 appropriate offset. This is used, for example, in the handling
3801 of non-local gotos. */
3802 if ((new = instantiate_new_reg (SET_DEST (x
), &offset
)) != 0)
3804 rtx src
= SET_SRC (x
);
3806 /* We are setting the register, not using it, so the relevant
3807 offset is the negative of the offset to use were we using
3810 instantiate_virtual_regs_1 (&src
, NULL_RTX
, 0);
3812 /* The only valid sources here are PLUS or REG. Just do
3813 the simplest possible thing to handle them. */
3814 if (GET_CODE (src
) != REG
&& GET_CODE (src
) != PLUS
)
3818 if (GET_CODE (src
) != REG
)
3819 temp
= force_operand (src
, NULL_RTX
);
3822 temp
= force_operand (plus_constant (temp
, offset
), NULL_RTX
);
3826 emit_insn_before (seq
, object
);
3829 if (! validate_change (object
, &SET_SRC (x
), temp
, 0)
3836 instantiate_virtual_regs_1 (&SET_DEST (x
), object
, extra_insns
);
3841 /* Handle special case of virtual register plus constant. */
3842 if (CONSTANT_P (XEXP (x
, 1)))
3844 rtx old
, new_offset
;
3846 /* Check for (plus (plus VIRT foo) (const_int)) first. */
3847 if (GET_CODE (XEXP (x
, 0)) == PLUS
)
3849 if ((new = instantiate_new_reg (XEXP (XEXP (x
, 0), 0), &offset
)))
3851 instantiate_virtual_regs_1 (&XEXP (XEXP (x
, 0), 1), object
,
3853 new = gen_rtx_PLUS (Pmode
, new, XEXP (XEXP (x
, 0), 1));
3862 #ifdef POINTERS_EXTEND_UNSIGNED
3863 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
3864 we can commute the PLUS and SUBREG because pointers into the
3865 frame are well-behaved. */
3866 else if (GET_CODE (XEXP (x
, 0)) == SUBREG
&& GET_MODE (x
) == ptr_mode
3867 && GET_CODE (XEXP (x
, 1)) == CONST_INT
3869 = instantiate_new_reg (SUBREG_REG (XEXP (x
, 0)),
3871 && validate_change (object
, loc
,
3872 plus_constant (gen_lowpart (ptr_mode
,
3875 + INTVAL (XEXP (x
, 1))),
3879 else if ((new = instantiate_new_reg (XEXP (x
, 0), &offset
)) == 0)
3881 /* We know the second operand is a constant. Unless the
3882 first operand is a REG (which has been already checked),
3883 it needs to be checked. */
3884 if (GET_CODE (XEXP (x
, 0)) != REG
)
3892 new_offset
= plus_constant (XEXP (x
, 1), offset
);
3894 /* If the new constant is zero, try to replace the sum with just
3896 if (new_offset
== const0_rtx
3897 && validate_change (object
, loc
, new, 0))
3900 /* Next try to replace the register and new offset.
3901 There are two changes to validate here and we can't assume that
3902 in the case of old offset equals new just changing the register
3903 will yield a valid insn. In the interests of a little efficiency,
3904 however, we only call validate change once (we don't queue up the
3905 changes and then call apply_change_group). */
3909 ? ! validate_change (object
, &XEXP (x
, 0), new, 0)
3910 : (XEXP (x
, 0) = new,
3911 ! validate_change (object
, &XEXP (x
, 1), new_offset
, 0)))
3919 /* Otherwise copy the new constant into a register and replace
3920 constant with that register. */
3921 temp
= gen_reg_rtx (Pmode
);
3923 if (validate_change (object
, &XEXP (x
, 1), temp
, 0))
3924 emit_insn_before (gen_move_insn (temp
, new_offset
), object
);
3927 /* If that didn't work, replace this expression with a
3928 register containing the sum. */
3931 new = gen_rtx_PLUS (Pmode
, new, new_offset
);
3934 temp
= force_operand (new, NULL_RTX
);
3938 emit_insn_before (seq
, object
);
3939 if (! validate_change (object
, loc
, temp
, 0)
3940 && ! validate_replace_rtx (x
, temp
, object
))
3948 /* Fall through to generic two-operand expression case. */
3954 case DIV
: case UDIV
:
3955 case MOD
: case UMOD
:
3956 case AND
: case IOR
: case XOR
:
3957 case ROTATERT
: case ROTATE
:
3958 case ASHIFTRT
: case LSHIFTRT
: case ASHIFT
:
3960 case GE
: case GT
: case GEU
: case GTU
:
3961 case LE
: case LT
: case LEU
: case LTU
:
3962 if (XEXP (x
, 1) && ! CONSTANT_P (XEXP (x
, 1)))
3963 instantiate_virtual_regs_1 (&XEXP (x
, 1), object
, extra_insns
);
3968 /* Most cases of MEM that convert to valid addresses have already been
3969 handled by our scan of decls. The only special handling we
3970 need here is to make a copy of the rtx to ensure it isn't being
3971 shared if we have to change it to a pseudo.
3973 If the rtx is a simple reference to an address via a virtual register,
3974 it can potentially be shared. In such cases, first try to make it
3975 a valid address, which can also be shared. Otherwise, copy it and
3978 First check for common cases that need no processing. These are
3979 usually due to instantiation already being done on a previous instance
3983 if (CONSTANT_ADDRESS_P (temp
)
3984 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3985 || temp
== arg_pointer_rtx
3987 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3988 || temp
== hard_frame_pointer_rtx
3990 || temp
== frame_pointer_rtx
)
3993 if (GET_CODE (temp
) == PLUS
3994 && CONSTANT_ADDRESS_P (XEXP (temp
, 1))
3995 && (XEXP (temp
, 0) == frame_pointer_rtx
3996 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3997 || XEXP (temp
, 0) == hard_frame_pointer_rtx
3999 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
4000 || XEXP (temp
, 0) == arg_pointer_rtx
4005 if (temp
== virtual_stack_vars_rtx
4006 || temp
== virtual_incoming_args_rtx
4007 || (GET_CODE (temp
) == PLUS
4008 && CONSTANT_ADDRESS_P (XEXP (temp
, 1))
4009 && (XEXP (temp
, 0) == virtual_stack_vars_rtx
4010 || XEXP (temp
, 0) == virtual_incoming_args_rtx
)))
4012 /* This MEM may be shared. If the substitution can be done without
4013 the need to generate new pseudos, we want to do it in place
4014 so all copies of the shared rtx benefit. The call below will
4015 only make substitutions if the resulting address is still
4018 Note that we cannot pass X as the object in the recursive call
4019 since the insn being processed may not allow all valid
4020 addresses. However, if we were not passed on object, we can
4021 only modify X without copying it if X will have a valid
4024 ??? Also note that this can still lose if OBJECT is an insn that
4025 has less restrictions on an address that some other insn.
4026 In that case, we will modify the shared address. This case
4027 doesn't seem very likely, though. One case where this could
4028 happen is in the case of a USE or CLOBBER reference, but we
4029 take care of that below. */
4031 if (instantiate_virtual_regs_1 (&XEXP (x
, 0),
4032 object
? object
: x
, 0))
4035 /* Otherwise make a copy and process that copy. We copy the entire
4036 RTL expression since it might be a PLUS which could also be
4038 *loc
= x
= copy_rtx (x
);
4041 /* Fall through to generic unary operation case. */
4044 case STRICT_LOW_PART
:
4046 case PRE_DEC
: case PRE_INC
: case POST_DEC
: case POST_INC
:
4047 case SIGN_EXTEND
: case ZERO_EXTEND
:
4048 case TRUNCATE
: case FLOAT_EXTEND
: case FLOAT_TRUNCATE
:
4049 case FLOAT
: case FIX
:
4050 case UNSIGNED_FIX
: case UNSIGNED_FLOAT
:
4054 /* These case either have just one operand or we know that we need not
4055 check the rest of the operands. */
4061 /* If the operand is a MEM, see if the change is a valid MEM. If not,
4062 go ahead and make the invalid one, but do it to a copy. For a REG,
4063 just make the recursive call, since there's no chance of a problem. */
4065 if ((GET_CODE (XEXP (x
, 0)) == MEM
4066 && instantiate_virtual_regs_1 (&XEXP (XEXP (x
, 0), 0), XEXP (x
, 0),
4068 || (GET_CODE (XEXP (x
, 0)) == REG
4069 && instantiate_virtual_regs_1 (&XEXP (x
, 0), object
, 0)))
4072 XEXP (x
, 0) = copy_rtx (XEXP (x
, 0));
4077 /* Try to replace with a PLUS. If that doesn't work, compute the sum
4078 in front of this insn and substitute the temporary. */
4079 if ((new = instantiate_new_reg (x
, &offset
)) != 0)
4081 temp
= plus_constant (new, offset
);
4082 if (!validate_change (object
, loc
, temp
, 0))
4088 temp
= force_operand (temp
, NULL_RTX
);
4092 emit_insn_before (seq
, object
);
4093 if (! validate_change (object
, loc
, temp
, 0)
4094 && ! validate_replace_rtx (x
, temp
, object
))
4102 if (GET_CODE (XEXP (x
, 0)) == REG
)
4105 else if (GET_CODE (XEXP (x
, 0)) == MEM
)
4107 /* If we have a (addressof (mem ..)), do any instantiation inside
4108 since we know we'll be making the inside valid when we finally
4109 remove the ADDRESSOF. */
4110 instantiate_virtual_regs_1 (&XEXP (XEXP (x
, 0), 0), NULL_RTX
, 0);
4119 /* Scan all subexpressions. */
4120 fmt
= GET_RTX_FORMAT (code
);
4121 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
4124 if (!instantiate_virtual_regs_1 (&XEXP (x
, i
), object
, extra_insns
))
4127 else if (*fmt
== 'E')
4128 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
4129 if (! instantiate_virtual_regs_1 (&XVECEXP (x
, i
, j
), object
,
4136 /* Optimization: assuming this function does not receive nonlocal gotos,
4137 delete the handlers for such, as well as the insns to establish
4138 and disestablish them. */
4144 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4146 /* Delete the handler by turning off the flag that would
4147 prevent jump_optimize from deleting it.
4148 Also permit deletion of the nonlocal labels themselves
4149 if nothing local refers to them. */
4150 if (GET_CODE (insn
) == CODE_LABEL
)
4154 LABEL_PRESERVE_P (insn
) = 0;
4156 /* Remove it from the nonlocal_label list, to avoid confusing
4158 for (t
= nonlocal_labels
, last_t
= 0; t
;
4159 last_t
= t
, t
= TREE_CHAIN (t
))
4160 if (DECL_RTL (TREE_VALUE (t
)) == insn
)
4165 nonlocal_labels
= TREE_CHAIN (nonlocal_labels
);
4167 TREE_CHAIN (last_t
) = TREE_CHAIN (t
);
4170 if (GET_CODE (insn
) == INSN
)
4174 for (t
= nonlocal_goto_handler_slots
; t
!= 0; t
= XEXP (t
, 1))
4175 if (reg_mentioned_p (t
, PATTERN (insn
)))
4181 || (nonlocal_goto_stack_level
!= 0
4182 && reg_mentioned_p (nonlocal_goto_stack_level
,
4184 delete_related_insns (insn
);
4192 return max_parm_reg
;
4195 /* Return the first insn following those generated by `assign_parms'. */
4198 get_first_nonparm_insn ()
4201 return NEXT_INSN (last_parm_insn
);
4202 return get_insns ();
4205 /* Return the first NOTE_INSN_BLOCK_BEG note in the function.
4206 Crash if there is none. */
4209 get_first_block_beg ()
4212 rtx insn
= get_first_nonparm_insn ();
4214 for (searcher
= insn
; searcher
; searcher
= NEXT_INSN (searcher
))
4215 if (GET_CODE (searcher
) == NOTE
4216 && NOTE_LINE_NUMBER (searcher
) == NOTE_INSN_BLOCK_BEG
)
4219 abort (); /* Invalid call to this function. (See comments above.) */
4223 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
4224 This means a type for which function calls must pass an address to the
4225 function or get an address back from the function.
4226 EXP may be a type node or an expression (whose type is tested). */
4229 aggregate_value_p (exp
)
4232 int i
, regno
, nregs
;
4235 tree type
= (TYPE_P (exp
)) ? exp
: TREE_TYPE (exp
);
4237 if (TREE_CODE (type
) == VOID_TYPE
)
4239 if (RETURN_IN_MEMORY (type
))
4241 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
4242 and thus can't be returned in registers. */
4243 if (TREE_ADDRESSABLE (type
))
4245 if (flag_pcc_struct_return
&& AGGREGATE_TYPE_P (type
))
4247 /* Make sure we have suitable call-clobbered regs to return
4248 the value in; if not, we must return it in memory. */
4249 reg
= hard_function_value (type
, 0, 0);
4251 /* If we have something other than a REG (e.g. a PARALLEL), then assume
4253 if (GET_CODE (reg
) != REG
)
4256 regno
= REGNO (reg
);
4257 nregs
= HARD_REGNO_NREGS (regno
, TYPE_MODE (type
));
4258 for (i
= 0; i
< nregs
; i
++)
4259 if (! call_used_regs
[regno
+ i
])
4264 /* Assign RTL expressions to the function's parameters.
4265 This may involve copying them into registers and using
4266 those registers as the RTL for them. */
4269 assign_parms (fndecl
)
4275 CUMULATIVE_ARGS args_so_far
;
4276 enum machine_mode promoted_mode
, passed_mode
;
4277 enum machine_mode nominal_mode
, promoted_nominal_mode
;
4279 /* Total space needed so far for args on the stack,
4280 given as a constant and a tree-expression. */
4281 struct args_size stack_args_size
;
4282 tree fntype
= TREE_TYPE (fndecl
);
4283 tree fnargs
= DECL_ARGUMENTS (fndecl
);
4284 /* This is used for the arg pointer when referring to stack args. */
4285 rtx internal_arg_pointer
;
4286 /* This is a dummy PARM_DECL that we used for the function result if
4287 the function returns a structure. */
4288 tree function_result_decl
= 0;
4289 #ifdef SETUP_INCOMING_VARARGS
4290 int varargs_setup
= 0;
4292 rtx conversion_insns
= 0;
4293 struct args_size alignment_pad
;
4295 /* Nonzero if the last arg is named `__builtin_va_alist',
4296 which is used on some machines for old-fashioned non-ANSI varargs.h;
4297 this should be stuck onto the stack as if it had arrived there. */
4299 = (current_function_varargs
4301 && (parm
= tree_last (fnargs
)) != 0
4303 && (! strcmp (IDENTIFIER_POINTER (DECL_NAME (parm
)),
4304 "__builtin_va_alist")));
4306 /* Nonzero if function takes extra anonymous args.
4307 This means the last named arg must be on the stack
4308 right before the anonymous ones. */
4310 = (TYPE_ARG_TYPES (fntype
) != 0
4311 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype
)))
4312 != void_type_node
));
4314 current_function_stdarg
= stdarg
;
4316 /* If the reg that the virtual arg pointer will be translated into is
4317 not a fixed reg or is the stack pointer, make a copy of the virtual
4318 arg pointer, and address parms via the copy. The frame pointer is
4319 considered fixed even though it is not marked as such.
4321 The second time through, simply use ap to avoid generating rtx. */
4323 if ((ARG_POINTER_REGNUM
== STACK_POINTER_REGNUM
4324 || ! (fixed_regs
[ARG_POINTER_REGNUM
]
4325 || ARG_POINTER_REGNUM
== FRAME_POINTER_REGNUM
)))
4326 internal_arg_pointer
= copy_to_reg (virtual_incoming_args_rtx
);
4328 internal_arg_pointer
= virtual_incoming_args_rtx
;
4329 current_function_internal_arg_pointer
= internal_arg_pointer
;
4331 stack_args_size
.constant
= 0;
4332 stack_args_size
.var
= 0;
4334 /* If struct value address is treated as the first argument, make it so. */
4335 if (aggregate_value_p (DECL_RESULT (fndecl
))
4336 && ! current_function_returns_pcc_struct
4337 && struct_value_incoming_rtx
== 0)
4339 tree type
= build_pointer_type (TREE_TYPE (fntype
));
4341 function_result_decl
= build_decl (PARM_DECL
, NULL_TREE
, type
);
4343 DECL_ARG_TYPE (function_result_decl
) = type
;
4344 TREE_CHAIN (function_result_decl
) = fnargs
;
4345 fnargs
= function_result_decl
;
4348 max_parm_reg
= LAST_VIRTUAL_REGISTER
+ 1;
4349 parm_reg_stack_loc
= (rtx
*) ggc_alloc_cleared (max_parm_reg
* sizeof (rtx
));
4351 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
4352 INIT_CUMULATIVE_INCOMING_ARGS (args_so_far
, fntype
, NULL_RTX
);
4354 INIT_CUMULATIVE_ARGS (args_so_far
, fntype
, NULL_RTX
, 0);
4357 /* We haven't yet found an argument that we must push and pretend the
4359 current_function_pretend_args_size
= 0;
4361 for (parm
= fnargs
; parm
; parm
= TREE_CHAIN (parm
))
4363 struct args_size stack_offset
;
4364 struct args_size arg_size
;
4365 int passed_pointer
= 0;
4366 int did_conversion
= 0;
4367 tree passed_type
= DECL_ARG_TYPE (parm
);
4368 tree nominal_type
= TREE_TYPE (parm
);
4370 int last_named
= 0, named_arg
;
4372 /* Set LAST_NAMED if this is last named arg before last
4374 if (stdarg
|| current_function_varargs
)
4378 for (tem
= TREE_CHAIN (parm
); tem
; tem
= TREE_CHAIN (tem
))
4379 if (DECL_NAME (tem
))
4385 /* Set NAMED_ARG if this arg should be treated as a named arg. For
4386 most machines, if this is a varargs/stdarg function, then we treat
4387 the last named arg as if it were anonymous too. */
4388 named_arg
= STRICT_ARGUMENT_NAMING
? 1 : ! last_named
;
4390 if (TREE_TYPE (parm
) == error_mark_node
4391 /* This can happen after weird syntax errors
4392 or if an enum type is defined among the parms. */
4393 || TREE_CODE (parm
) != PARM_DECL
4394 || passed_type
== NULL
)
4396 SET_DECL_RTL (parm
, gen_rtx_MEM (BLKmode
, const0_rtx
));
4397 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
);
4398 TREE_USED (parm
) = 1;
4402 /* For varargs.h function, save info about regs and stack space
4403 used by the individual args, not including the va_alist arg. */
4404 if (hide_last_arg
&& last_named
)
4405 current_function_args_info
= args_so_far
;
4407 /* Find mode of arg as it is passed, and mode of arg
4408 as it should be during execution of this function. */
4409 passed_mode
= TYPE_MODE (passed_type
);
4410 nominal_mode
= TYPE_MODE (nominal_type
);
4412 /* If the parm's mode is VOID, its value doesn't matter,
4413 and avoid the usual things like emit_move_insn that could crash. */
4414 if (nominal_mode
== VOIDmode
)
4416 SET_DECL_RTL (parm
, const0_rtx
);
4417 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
);
4421 /* If the parm is to be passed as a transparent union, use the
4422 type of the first field for the tests below. We have already
4423 verified that the modes are the same. */
4424 if (DECL_TRANSPARENT_UNION (parm
)
4425 || (TREE_CODE (passed_type
) == UNION_TYPE
4426 && TYPE_TRANSPARENT_UNION (passed_type
)))
4427 passed_type
= TREE_TYPE (TYPE_FIELDS (passed_type
));
4429 /* See if this arg was passed by invisible reference. It is if
4430 it is an object whose size depends on the contents of the
4431 object itself or if the machine requires these objects be passed
4434 if ((TREE_CODE (TYPE_SIZE (passed_type
)) != INTEGER_CST
4435 && contains_placeholder_p (TYPE_SIZE (passed_type
)))
4436 || TREE_ADDRESSABLE (passed_type
)
4437 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
4438 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, passed_mode
,
4439 passed_type
, named_arg
)
4443 passed_type
= nominal_type
= build_pointer_type (passed_type
);
4445 passed_mode
= nominal_mode
= Pmode
;
4448 promoted_mode
= passed_mode
;
4450 #ifdef PROMOTE_FUNCTION_ARGS
4451 /* Compute the mode in which the arg is actually extended to. */
4452 unsignedp
= TREE_UNSIGNED (passed_type
);
4453 promoted_mode
= promote_mode (passed_type
, promoted_mode
, &unsignedp
, 1);
4456 /* Let machine desc say which reg (if any) the parm arrives in.
4457 0 means it arrives on the stack. */
4458 #ifdef FUNCTION_INCOMING_ARG
4459 entry_parm
= FUNCTION_INCOMING_ARG (args_so_far
, promoted_mode
,
4460 passed_type
, named_arg
);
4462 entry_parm
= FUNCTION_ARG (args_so_far
, promoted_mode
,
4463 passed_type
, named_arg
);
4466 if (entry_parm
== 0)
4467 promoted_mode
= passed_mode
;
4469 #ifdef SETUP_INCOMING_VARARGS
4470 /* If this is the last named parameter, do any required setup for
4471 varargs or stdargs. We need to know about the case of this being an
4472 addressable type, in which case we skip the registers it
4473 would have arrived in.
4475 For stdargs, LAST_NAMED will be set for two parameters, the one that
4476 is actually the last named, and the dummy parameter. We only
4477 want to do this action once.
4479 Also, indicate when RTL generation is to be suppressed. */
4480 if (last_named
&& !varargs_setup
)
4482 SETUP_INCOMING_VARARGS (args_so_far
, promoted_mode
, passed_type
,
4483 current_function_pretend_args_size
, 0);
4488 /* Determine parm's home in the stack,
4489 in case it arrives in the stack or we should pretend it did.
4491 Compute the stack position and rtx where the argument arrives
4494 There is one complexity here: If this was a parameter that would
4495 have been passed in registers, but wasn't only because it is
4496 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
4497 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
4498 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
4499 0 as it was the previous time. */
4501 pretend_named
= named_arg
|| PRETEND_OUTGOING_VARARGS_NAMED
;
4502 locate_and_pad_parm (promoted_mode
, passed_type
,
4503 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4506 #ifdef FUNCTION_INCOMING_ARG
4507 FUNCTION_INCOMING_ARG (args_so_far
, promoted_mode
,
4509 pretend_named
) != 0,
4511 FUNCTION_ARG (args_so_far
, promoted_mode
,
4513 pretend_named
) != 0,
4516 fndecl
, &stack_args_size
, &stack_offset
, &arg_size
,
4520 rtx offset_rtx
= ARGS_SIZE_RTX (stack_offset
);
4522 if (offset_rtx
== const0_rtx
)
4523 stack_parm
= gen_rtx_MEM (promoted_mode
, internal_arg_pointer
);
4525 stack_parm
= gen_rtx_MEM (promoted_mode
,
4526 gen_rtx_PLUS (Pmode
,
4527 internal_arg_pointer
,
4530 set_mem_attributes (stack_parm
, parm
, 1);
4533 /* If this parameter was passed both in registers and in the stack,
4534 use the copy on the stack. */
4535 if (MUST_PASS_IN_STACK (promoted_mode
, passed_type
))
4538 #ifdef FUNCTION_ARG_PARTIAL_NREGS
4539 /* If this parm was passed part in regs and part in memory,
4540 pretend it arrived entirely in memory
4541 by pushing the register-part onto the stack.
4543 In the special case of a DImode or DFmode that is split,
4544 we could put it together in a pseudoreg directly,
4545 but for now that's not worth bothering with. */
4549 int nregs
= FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, promoted_mode
,
4550 passed_type
, named_arg
);
4554 current_function_pretend_args_size
4555 = (((nregs
* UNITS_PER_WORD
) + (PARM_BOUNDARY
/ BITS_PER_UNIT
) - 1)
4556 / (PARM_BOUNDARY
/ BITS_PER_UNIT
)
4557 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
4559 /* Handle calls that pass values in multiple non-contiguous
4560 locations. The Irix 6 ABI has examples of this. */
4561 if (GET_CODE (entry_parm
) == PARALLEL
)
4562 emit_group_store (validize_mem (stack_parm
), entry_parm
,
4563 int_size_in_bytes (TREE_TYPE (parm
)));
4566 move_block_from_reg (REGNO (entry_parm
),
4567 validize_mem (stack_parm
), nregs
,
4568 int_size_in_bytes (TREE_TYPE (parm
)));
4570 entry_parm
= stack_parm
;
4575 /* If we didn't decide this parm came in a register,
4576 by default it came on the stack. */
4577 if (entry_parm
== 0)
4578 entry_parm
= stack_parm
;
4580 /* Record permanently how this parm was passed. */
4581 DECL_INCOMING_RTL (parm
) = entry_parm
;
4583 /* If there is actually space on the stack for this parm,
4584 count it in stack_args_size; otherwise set stack_parm to 0
4585 to indicate there is no preallocated stack slot for the parm. */
4587 if (entry_parm
== stack_parm
4588 || (GET_CODE (entry_parm
) == PARALLEL
4589 && XEXP (XVECEXP (entry_parm
, 0, 0), 0) == NULL_RTX
)
4590 #if defined (REG_PARM_STACK_SPACE) && ! defined (MAYBE_REG_PARM_STACK_SPACE)
4591 /* On some machines, even if a parm value arrives in a register
4592 there is still an (uninitialized) stack slot allocated for it.
4594 ??? When MAYBE_REG_PARM_STACK_SPACE is defined, we can't tell
4595 whether this parameter already has a stack slot allocated,
4596 because an arg block exists only if current_function_args_size
4597 is larger than some threshold, and we haven't calculated that
4598 yet. So, for now, we just assume that stack slots never exist
4600 || REG_PARM_STACK_SPACE (fndecl
) > 0
4604 stack_args_size
.constant
+= arg_size
.constant
;
4606 ADD_PARM_SIZE (stack_args_size
, arg_size
.var
);
4609 /* No stack slot was pushed for this parm. */
4612 /* Update info on where next arg arrives in registers. */
4614 FUNCTION_ARG_ADVANCE (args_so_far
, promoted_mode
,
4615 passed_type
, named_arg
);
4617 /* If we can't trust the parm stack slot to be aligned enough
4618 for its ultimate type, don't use that slot after entry.
4619 We'll make another stack slot, if we need one. */
4621 unsigned int thisparm_boundary
4622 = FUNCTION_ARG_BOUNDARY (promoted_mode
, passed_type
);
4624 if (GET_MODE_ALIGNMENT (nominal_mode
) > thisparm_boundary
)
4628 /* If parm was passed in memory, and we need to convert it on entry,
4629 don't store it back in that same slot. */
4631 && nominal_mode
!= BLKmode
&& nominal_mode
!= passed_mode
)
4634 /* When an argument is passed in multiple locations, we can't
4635 make use of this information, but we can save some copying if
4636 the whole argument is passed in a single register. */
4637 if (GET_CODE (entry_parm
) == PARALLEL
4638 && nominal_mode
!= BLKmode
&& passed_mode
!= BLKmode
)
4640 int i
, len
= XVECLEN (entry_parm
, 0);
4642 for (i
= 0; i
< len
; i
++)
4643 if (XEXP (XVECEXP (entry_parm
, 0, i
), 0) != NULL_RTX
4644 && GET_CODE (XEXP (XVECEXP (entry_parm
, 0, i
), 0)) == REG
4645 && (GET_MODE (XEXP (XVECEXP (entry_parm
, 0, i
), 0))
4647 && INTVAL (XEXP (XVECEXP (entry_parm
, 0, i
), 1)) == 0)
4649 entry_parm
= XEXP (XVECEXP (entry_parm
, 0, i
), 0);
4650 DECL_INCOMING_RTL (parm
) = entry_parm
;
4655 /* ENTRY_PARM is an RTX for the parameter as it arrives,
4656 in the mode in which it arrives.
4657 STACK_PARM is an RTX for a stack slot where the parameter can live
4658 during the function (in case we want to put it there).
4659 STACK_PARM is 0 if no stack slot was pushed for it.
4661 Now output code if necessary to convert ENTRY_PARM to
4662 the type in which this function declares it,
4663 and store that result in an appropriate place,
4664 which may be a pseudo reg, may be STACK_PARM,
4665 or may be a local stack slot if STACK_PARM is 0.
4667 Set DECL_RTL to that place. */
4669 if (nominal_mode
== BLKmode
|| GET_CODE (entry_parm
) == PARALLEL
)
4671 /* If a BLKmode arrives in registers, copy it to a stack slot.
4672 Handle calls that pass values in multiple non-contiguous
4673 locations. The Irix 6 ABI has examples of this. */
4674 if (GET_CODE (entry_parm
) == REG
4675 || GET_CODE (entry_parm
) == PARALLEL
)
4678 = CEIL_ROUND (int_size_in_bytes (TREE_TYPE (parm
)),
4681 /* Note that we will be storing an integral number of words.
4682 So we have to be careful to ensure that we allocate an
4683 integral number of words. We do this below in the
4684 assign_stack_local if space was not allocated in the argument
4685 list. If it was, this will not work if PARM_BOUNDARY is not
4686 a multiple of BITS_PER_WORD. It isn't clear how to fix this
4687 if it becomes a problem. */
4689 if (stack_parm
== 0)
4692 = assign_stack_local (GET_MODE (entry_parm
),
4694 set_mem_attributes (stack_parm
, parm
, 1);
4697 else if (PARM_BOUNDARY
% BITS_PER_WORD
!= 0)
4700 /* Handle calls that pass values in multiple non-contiguous
4701 locations. The Irix 6 ABI has examples of this. */
4702 if (GET_CODE (entry_parm
) == PARALLEL
)
4703 emit_group_store (validize_mem (stack_parm
), entry_parm
,
4704 int_size_in_bytes (TREE_TYPE (parm
)));
4706 move_block_from_reg (REGNO (entry_parm
),
4707 validize_mem (stack_parm
),
4708 size_stored
/ UNITS_PER_WORD
,
4709 int_size_in_bytes (TREE_TYPE (parm
)));
4711 SET_DECL_RTL (parm
, stack_parm
);
4713 else if (! ((! optimize
4714 && ! DECL_REGISTER (parm
))
4715 || TREE_SIDE_EFFECTS (parm
)
4716 /* If -ffloat-store specified, don't put explicit
4717 float variables into registers. */
4718 || (flag_float_store
4719 && TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
))
4720 /* Always assign pseudo to structure return or item passed
4721 by invisible reference. */
4722 || passed_pointer
|| parm
== function_result_decl
)
4724 /* Store the parm in a pseudoregister during the function, but we
4725 may need to do it in a wider mode. */
4728 unsigned int regno
, regnoi
= 0, regnor
= 0;
4730 unsignedp
= TREE_UNSIGNED (TREE_TYPE (parm
));
4732 promoted_nominal_mode
4733 = promote_mode (TREE_TYPE (parm
), nominal_mode
, &unsignedp
, 0);
4735 parmreg
= gen_reg_rtx (promoted_nominal_mode
);
4736 mark_user_reg (parmreg
);
4738 /* If this was an item that we received a pointer to, set DECL_RTL
4742 rtx x
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type
)),
4744 set_mem_attributes (x
, parm
, 1);
4745 SET_DECL_RTL (parm
, x
);
4749 SET_DECL_RTL (parm
, parmreg
);
4750 maybe_set_unchanging (DECL_RTL (parm
), parm
);
4753 /* Copy the value into the register. */
4754 if (nominal_mode
!= passed_mode
4755 || promoted_nominal_mode
!= promoted_mode
)
4758 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
4759 mode, by the caller. We now have to convert it to
4760 NOMINAL_MODE, if different. However, PARMREG may be in
4761 a different mode than NOMINAL_MODE if it is being stored
4764 If ENTRY_PARM is a hard register, it might be in a register
4765 not valid for operating in its mode (e.g., an odd-numbered
4766 register for a DFmode). In that case, moves are the only
4767 thing valid, so we can't do a convert from there. This
4768 occurs when the calling sequence allow such misaligned
4771 In addition, the conversion may involve a call, which could
4772 clobber parameters which haven't been copied to pseudo
4773 registers yet. Therefore, we must first copy the parm to
4774 a pseudo reg here, and save the conversion until after all
4775 parameters have been moved. */
4777 rtx tempreg
= gen_reg_rtx (GET_MODE (entry_parm
));
4779 emit_move_insn (tempreg
, validize_mem (entry_parm
));
4781 push_to_sequence (conversion_insns
);
4782 tempreg
= convert_to_mode (nominal_mode
, tempreg
, unsignedp
);
4784 if (GET_CODE (tempreg
) == SUBREG
4785 && GET_MODE (tempreg
) == nominal_mode
4786 && GET_CODE (SUBREG_REG (tempreg
)) == REG
4787 && nominal_mode
== passed_mode
4788 && GET_MODE (SUBREG_REG (tempreg
)) == GET_MODE (entry_parm
)
4789 && GET_MODE_SIZE (GET_MODE (tempreg
))
4790 < GET_MODE_SIZE (GET_MODE (entry_parm
)))
4792 /* The argument is already sign/zero extended, so note it
4794 SUBREG_PROMOTED_VAR_P (tempreg
) = 1;
4795 SUBREG_PROMOTED_UNSIGNED_SET (tempreg
, unsignedp
);
4798 /* TREE_USED gets set erroneously during expand_assignment. */
4799 save_tree_used
= TREE_USED (parm
);
4800 expand_assignment (parm
,
4801 make_tree (nominal_type
, tempreg
), 0, 0);
4802 TREE_USED (parm
) = save_tree_used
;
4803 conversion_insns
= get_insns ();
4808 emit_move_insn (parmreg
, validize_mem (entry_parm
));
4810 /* If we were passed a pointer but the actual value
4811 can safely live in a register, put it in one. */
4812 if (passed_pointer
&& TYPE_MODE (TREE_TYPE (parm
)) != BLKmode
4813 /* If by-reference argument was promoted, demote it. */
4814 && (TYPE_MODE (TREE_TYPE (parm
)) != GET_MODE (DECL_RTL (parm
))
4816 && ! DECL_REGISTER (parm
))
4817 || TREE_SIDE_EFFECTS (parm
)
4818 /* If -ffloat-store specified, don't put explicit
4819 float variables into registers. */
4820 || (flag_float_store
4821 && TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
))))
4823 /* We can't use nominal_mode, because it will have been set to
4824 Pmode above. We must use the actual mode of the parm. */
4825 parmreg
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm
)));
4826 mark_user_reg (parmreg
);
4827 if (GET_MODE (parmreg
) != GET_MODE (DECL_RTL (parm
)))
4829 rtx tempreg
= gen_reg_rtx (GET_MODE (DECL_RTL (parm
)));
4830 int unsigned_p
= TREE_UNSIGNED (TREE_TYPE (parm
));
4831 push_to_sequence (conversion_insns
);
4832 emit_move_insn (tempreg
, DECL_RTL (parm
));
4834 convert_to_mode (GET_MODE (parmreg
),
4837 emit_move_insn (parmreg
, DECL_RTL (parm
));
4838 conversion_insns
= get_insns();
4843 emit_move_insn (parmreg
, DECL_RTL (parm
));
4844 SET_DECL_RTL (parm
, parmreg
);
4845 /* STACK_PARM is the pointer, not the parm, and PARMREG is
4849 #ifdef FUNCTION_ARG_CALLEE_COPIES
4850 /* If we are passed an arg by reference and it is our responsibility
4851 to make a copy, do it now.
4852 PASSED_TYPE and PASSED mode now refer to the pointer, not the
4853 original argument, so we must recreate them in the call to
4854 FUNCTION_ARG_CALLEE_COPIES. */
4855 /* ??? Later add code to handle the case that if the argument isn't
4856 modified, don't do the copy. */
4858 else if (passed_pointer
4859 && FUNCTION_ARG_CALLEE_COPIES (args_so_far
,
4860 TYPE_MODE (DECL_ARG_TYPE (parm
)),
4861 DECL_ARG_TYPE (parm
),
4863 && ! TREE_ADDRESSABLE (DECL_ARG_TYPE (parm
)))
4866 tree type
= DECL_ARG_TYPE (parm
);
4868 /* This sequence may involve a library call perhaps clobbering
4869 registers that haven't been copied to pseudos yet. */
4871 push_to_sequence (conversion_insns
);
4873 if (!COMPLETE_TYPE_P (type
)
4874 || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4875 /* This is a variable sized object. */
4876 copy
= gen_rtx_MEM (BLKmode
,
4877 allocate_dynamic_stack_space
4878 (expr_size (parm
), NULL_RTX
,
4879 TYPE_ALIGN (type
)));
4881 copy
= assign_stack_temp (TYPE_MODE (type
),
4882 int_size_in_bytes (type
), 1);
4883 set_mem_attributes (copy
, parm
, 1);
4885 store_expr (parm
, copy
, 0);
4886 emit_move_insn (parmreg
, XEXP (copy
, 0));
4887 conversion_insns
= get_insns ();
4891 #endif /* FUNCTION_ARG_CALLEE_COPIES */
4893 /* In any case, record the parm's desired stack location
4894 in case we later discover it must live in the stack.
4896 If it is a COMPLEX value, store the stack location for both
4899 if (GET_CODE (parmreg
) == CONCAT
)
4900 regno
= MAX (REGNO (XEXP (parmreg
, 0)), REGNO (XEXP (parmreg
, 1)));
4902 regno
= REGNO (parmreg
);
4904 if (regno
>= max_parm_reg
)
4907 int old_max_parm_reg
= max_parm_reg
;
4909 /* It's slow to expand this one register at a time,
4910 but it's also rare and we need max_parm_reg to be
4911 precisely correct. */
4912 max_parm_reg
= regno
+ 1;
4913 new = (rtx
*) ggc_realloc (parm_reg_stack_loc
,
4914 max_parm_reg
* sizeof (rtx
));
4915 memset ((char *) (new + old_max_parm_reg
), 0,
4916 (max_parm_reg
- old_max_parm_reg
) * sizeof (rtx
));
4917 parm_reg_stack_loc
= new;
4920 if (GET_CODE (parmreg
) == CONCAT
)
4922 enum machine_mode submode
= GET_MODE (XEXP (parmreg
, 0));
4924 regnor
= REGNO (gen_realpart (submode
, parmreg
));
4925 regnoi
= REGNO (gen_imagpart (submode
, parmreg
));
4927 if (stack_parm
!= 0)
4929 parm_reg_stack_loc
[regnor
]
4930 = gen_realpart (submode
, stack_parm
);
4931 parm_reg_stack_loc
[regnoi
]
4932 = gen_imagpart (submode
, stack_parm
);
4936 parm_reg_stack_loc
[regnor
] = 0;
4937 parm_reg_stack_loc
[regnoi
] = 0;
4941 parm_reg_stack_loc
[REGNO (parmreg
)] = stack_parm
;
4943 /* Mark the register as eliminable if we did no conversion
4944 and it was copied from memory at a fixed offset,
4945 and the arg pointer was not copied to a pseudo-reg.
4946 If the arg pointer is a pseudo reg or the offset formed
4947 an invalid address, such memory-equivalences
4948 as we make here would screw up life analysis for it. */
4949 if (nominal_mode
== passed_mode
4952 && GET_CODE (stack_parm
) == MEM
4953 && stack_offset
.var
== 0
4954 && reg_mentioned_p (virtual_incoming_args_rtx
,
4955 XEXP (stack_parm
, 0)))
4957 rtx linsn
= get_last_insn ();
4960 /* Mark complex types separately. */
4961 if (GET_CODE (parmreg
) == CONCAT
)
4962 /* Scan backwards for the set of the real and
4964 for (sinsn
= linsn
; sinsn
!= 0;
4965 sinsn
= prev_nonnote_insn (sinsn
))
4967 set
= single_set (sinsn
);
4969 && SET_DEST (set
) == regno_reg_rtx
[regnoi
])
4971 = gen_rtx_EXPR_LIST (REG_EQUIV
,
4972 parm_reg_stack_loc
[regnoi
],
4975 && SET_DEST (set
) == regno_reg_rtx
[regnor
])
4977 = gen_rtx_EXPR_LIST (REG_EQUIV
,
4978 parm_reg_stack_loc
[regnor
],
4981 else if ((set
= single_set (linsn
)) != 0
4982 && SET_DEST (set
) == parmreg
)
4984 = gen_rtx_EXPR_LIST (REG_EQUIV
,
4985 stack_parm
, REG_NOTES (linsn
));
4988 /* For pointer data type, suggest pointer register. */
4989 if (POINTER_TYPE_P (TREE_TYPE (parm
)))
4990 mark_reg_pointer (parmreg
,
4991 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
))));
4993 /* If something wants our address, try to use ADDRESSOF. */
4994 if (TREE_ADDRESSABLE (parm
))
4996 /* If we end up putting something into the stack,
4997 fixup_var_refs_insns will need to make a pass over
4998 all the instructions. It looks through the pending
4999 sequences -- but it can't see the ones in the
5000 CONVERSION_INSNS, if they're not on the sequence
5001 stack. So, we go back to that sequence, just so that
5002 the fixups will happen. */
5003 push_to_sequence (conversion_insns
);
5004 put_var_into_stack (parm
);
5005 conversion_insns
= get_insns ();
5011 /* Value must be stored in the stack slot STACK_PARM
5012 during function execution. */
5014 if (promoted_mode
!= nominal_mode
)
5016 /* Conversion is required. */
5017 rtx tempreg
= gen_reg_rtx (GET_MODE (entry_parm
));
5019 emit_move_insn (tempreg
, validize_mem (entry_parm
));
5021 push_to_sequence (conversion_insns
);
5022 entry_parm
= convert_to_mode (nominal_mode
, tempreg
,
5023 TREE_UNSIGNED (TREE_TYPE (parm
)));
5025 /* ??? This may need a big-endian conversion on sparc64. */
5026 stack_parm
= adjust_address (stack_parm
, nominal_mode
, 0);
5028 conversion_insns
= get_insns ();
5033 if (entry_parm
!= stack_parm
)
5035 if (stack_parm
== 0)
5038 = assign_stack_local (GET_MODE (entry_parm
),
5039 GET_MODE_SIZE (GET_MODE (entry_parm
)), 0);
5040 set_mem_attributes (stack_parm
, parm
, 1);
5043 if (promoted_mode
!= nominal_mode
)
5045 push_to_sequence (conversion_insns
);
5046 emit_move_insn (validize_mem (stack_parm
),
5047 validize_mem (entry_parm
));
5048 conversion_insns
= get_insns ();
5052 emit_move_insn (validize_mem (stack_parm
),
5053 validize_mem (entry_parm
));
5056 SET_DECL_RTL (parm
, stack_parm
);
5059 /* If this "parameter" was the place where we are receiving the
5060 function's incoming structure pointer, set up the result. */
5061 if (parm
== function_result_decl
)
5063 tree result
= DECL_RESULT (fndecl
);
5064 rtx addr
= DECL_RTL (parm
);
5067 #ifdef POINTERS_EXTEND_UNSIGNED
5068 if (GET_MODE (addr
) != Pmode
)
5069 addr
= convert_memory_address (Pmode
, addr
);
5072 x
= gen_rtx_MEM (DECL_MODE (result
), addr
);
5073 set_mem_attributes (x
, result
, 1);
5074 SET_DECL_RTL (result
, x
);
5077 if (GET_CODE (DECL_RTL (parm
)) == REG
)
5078 REGNO_DECL (REGNO (DECL_RTL (parm
))) = parm
;
5079 else if (GET_CODE (DECL_RTL (parm
)) == CONCAT
)
5081 REGNO_DECL (REGNO (XEXP (DECL_RTL (parm
), 0))) = parm
;
5082 REGNO_DECL (REGNO (XEXP (DECL_RTL (parm
), 1))) = parm
;
5087 /* Output all parameter conversion instructions (possibly including calls)
5088 now that all parameters have been copied out of hard registers. */
5089 emit_insn (conversion_insns
);
5091 last_parm_insn
= get_last_insn ();
5093 current_function_args_size
= stack_args_size
.constant
;
5095 /* Adjust function incoming argument size for alignment and
5098 #ifdef REG_PARM_STACK_SPACE
5099 #ifndef MAYBE_REG_PARM_STACK_SPACE
5100 current_function_args_size
= MAX (current_function_args_size
,
5101 REG_PARM_STACK_SPACE (fndecl
));
5105 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
5107 current_function_args_size
5108 = ((current_function_args_size
+ STACK_BYTES
- 1)
5109 / STACK_BYTES
) * STACK_BYTES
;
5111 #ifdef ARGS_GROW_DOWNWARD
5112 current_function_arg_offset_rtx
5113 = (stack_args_size
.var
== 0 ? GEN_INT (-stack_args_size
.constant
)
5114 : expand_expr (size_diffop (stack_args_size
.var
,
5115 size_int (-stack_args_size
.constant
)),
5116 NULL_RTX
, VOIDmode
, 0));
5118 current_function_arg_offset_rtx
= ARGS_SIZE_RTX (stack_args_size
);
5121 /* See how many bytes, if any, of its args a function should try to pop
5124 current_function_pops_args
= RETURN_POPS_ARGS (fndecl
, TREE_TYPE (fndecl
),
5125 current_function_args_size
);
5127 /* For stdarg.h function, save info about
5128 regs and stack space used by the named args. */
5131 current_function_args_info
= args_so_far
;
5133 /* Set the rtx used for the function return value. Put this in its
5134 own variable so any optimizers that need this information don't have
5135 to include tree.h. Do this here so it gets done when an inlined
5136 function gets output. */
5138 current_function_return_rtx
5139 = (DECL_RTL_SET_P (DECL_RESULT (fndecl
))
5140 ? DECL_RTL (DECL_RESULT (fndecl
)) : NULL_RTX
);
5142 /* If scalar return value was computed in a pseudo-reg, or was a named
5143 return value that got dumped to the stack, copy that to the hard
5145 if (DECL_RTL_SET_P (DECL_RESULT (fndecl
)))
5147 tree decl_result
= DECL_RESULT (fndecl
);
5148 rtx decl_rtl
= DECL_RTL (decl_result
);
5150 if (REG_P (decl_rtl
)
5151 ? REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
5152 : DECL_REGISTER (decl_result
))
5156 #ifdef FUNCTION_OUTGOING_VALUE
5157 real_decl_rtl
= FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result
),
5160 real_decl_rtl
= FUNCTION_VALUE (TREE_TYPE (decl_result
),
5163 REG_FUNCTION_VALUE_P (real_decl_rtl
) = 1;
5164 /* The delay slot scheduler assumes that current_function_return_rtx
5165 holds the hard register containing the return value, not a
5166 temporary pseudo. */
5167 current_function_return_rtx
= real_decl_rtl
;
5172 /* Indicate whether REGNO is an incoming argument to the current function
5173 that was promoted to a wider mode. If so, return the RTX for the
5174 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
5175 that REGNO is promoted from and whether the promotion was signed or
5178 #ifdef PROMOTE_FUNCTION_ARGS
5181 promoted_input_arg (regno
, pmode
, punsignedp
)
5183 enum machine_mode
*pmode
;
5188 for (arg
= DECL_ARGUMENTS (current_function_decl
); arg
;
5189 arg
= TREE_CHAIN (arg
))
5190 if (GET_CODE (DECL_INCOMING_RTL (arg
)) == REG
5191 && REGNO (DECL_INCOMING_RTL (arg
)) == regno
5192 && TYPE_MODE (DECL_ARG_TYPE (arg
)) == TYPE_MODE (TREE_TYPE (arg
)))
5194 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (arg
));
5195 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (arg
));
5197 mode
= promote_mode (TREE_TYPE (arg
), mode
, &unsignedp
, 1);
5198 if (mode
== GET_MODE (DECL_INCOMING_RTL (arg
))
5199 && mode
!= DECL_MODE (arg
))
5201 *pmode
= DECL_MODE (arg
);
5202 *punsignedp
= unsignedp
;
5203 return DECL_INCOMING_RTL (arg
);
5212 /* Compute the size and offset from the start of the stacked arguments for a
5213 parm passed in mode PASSED_MODE and with type TYPE.
5215 INITIAL_OFFSET_PTR points to the current offset into the stacked
5218 The starting offset and size for this parm are returned in *OFFSET_PTR
5219 and *ARG_SIZE_PTR, respectively.
5221 IN_REGS is non-zero if the argument will be passed in registers. It will
5222 never be set if REG_PARM_STACK_SPACE is not defined.
5224 FNDECL is the function in which the argument was defined.
5226 There are two types of rounding that are done. The first, controlled by
5227 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
5228 list to be aligned to the specific boundary (in bits). This rounding
5229 affects the initial and starting offsets, but not the argument size.
5231 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
5232 optionally rounds the size of the parm to PARM_BOUNDARY. The
5233 initial offset is not affected by this rounding, while the size always
5234 is and the starting offset may be. */
5236 /* offset_ptr will be negative for ARGS_GROW_DOWNWARD case;
5237 initial_offset_ptr is positive because locate_and_pad_parm's
5238 callers pass in the total size of args so far as
5239 initial_offset_ptr. arg_size_ptr is always positive. */
5242 locate_and_pad_parm (passed_mode
, type
, in_regs
, fndecl
,
5243 initial_offset_ptr
, offset_ptr
, arg_size_ptr
,
5245 enum machine_mode passed_mode
;
5247 int in_regs ATTRIBUTE_UNUSED
;
5248 tree fndecl ATTRIBUTE_UNUSED
;
5249 struct args_size
*initial_offset_ptr
;
5250 struct args_size
*offset_ptr
;
5251 struct args_size
*arg_size_ptr
;
5252 struct args_size
*alignment_pad
;
5256 = type
? size_in_bytes (type
) : size_int (GET_MODE_SIZE (passed_mode
));
5257 enum direction where_pad
= FUNCTION_ARG_PADDING (passed_mode
, type
);
5258 int boundary
= FUNCTION_ARG_BOUNDARY (passed_mode
, type
);
5260 #ifdef REG_PARM_STACK_SPACE
5261 /* If we have found a stack parm before we reach the end of the
5262 area reserved for registers, skip that area. */
5265 int reg_parm_stack_space
= 0;
5267 #ifdef MAYBE_REG_PARM_STACK_SPACE
5268 reg_parm_stack_space
= MAYBE_REG_PARM_STACK_SPACE
;
5270 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
5272 if (reg_parm_stack_space
> 0)
5274 if (initial_offset_ptr
->var
)
5276 initial_offset_ptr
->var
5277 = size_binop (MAX_EXPR
, ARGS_SIZE_TREE (*initial_offset_ptr
),
5278 ssize_int (reg_parm_stack_space
));
5279 initial_offset_ptr
->constant
= 0;
5281 else if (initial_offset_ptr
->constant
< reg_parm_stack_space
)
5282 initial_offset_ptr
->constant
= reg_parm_stack_space
;
5285 #endif /* REG_PARM_STACK_SPACE */
5287 arg_size_ptr
->var
= 0;
5288 arg_size_ptr
->constant
= 0;
5289 alignment_pad
->var
= 0;
5290 alignment_pad
->constant
= 0;
5292 #ifdef ARGS_GROW_DOWNWARD
5293 if (initial_offset_ptr
->var
)
5295 offset_ptr
->constant
= 0;
5296 offset_ptr
->var
= size_binop (MINUS_EXPR
, ssize_int (0),
5297 initial_offset_ptr
->var
);
5301 offset_ptr
->constant
= -initial_offset_ptr
->constant
;
5302 offset_ptr
->var
= 0;
5304 if (where_pad
!= none
5305 && (!host_integerp (sizetree
, 1)
5306 || (tree_low_cst (sizetree
, 1) * BITS_PER_UNIT
) % PARM_BOUNDARY
))
5307 sizetree
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
5308 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
5309 if (where_pad
!= downward
)
5310 pad_to_arg_alignment (offset_ptr
, boundary
, alignment_pad
);
5311 if (initial_offset_ptr
->var
)
5312 arg_size_ptr
->var
= size_binop (MINUS_EXPR
,
5313 size_binop (MINUS_EXPR
,
5315 initial_offset_ptr
->var
),
5319 arg_size_ptr
->constant
= (-initial_offset_ptr
->constant
5320 - offset_ptr
->constant
);
5322 #else /* !ARGS_GROW_DOWNWARD */
5324 #ifdef REG_PARM_STACK_SPACE
5325 || REG_PARM_STACK_SPACE (fndecl
) > 0
5328 pad_to_arg_alignment (initial_offset_ptr
, boundary
, alignment_pad
);
5329 *offset_ptr
= *initial_offset_ptr
;
5331 #ifdef PUSH_ROUNDING
5332 if (passed_mode
!= BLKmode
)
5333 sizetree
= size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree
)));
5336 /* Pad_below needs the pre-rounded size to know how much to pad below
5337 so this must be done before rounding up. */
5338 if (where_pad
== downward
5339 /* However, BLKmode args passed in regs have their padding done elsewhere.
5340 The stack slot must be able to hold the entire register. */
5341 && !(in_regs
&& passed_mode
== BLKmode
))
5342 pad_below (offset_ptr
, passed_mode
, sizetree
);
5344 if (where_pad
!= none
5345 && (!host_integerp (sizetree
, 1)
5346 || (tree_low_cst (sizetree
, 1) * BITS_PER_UNIT
) % PARM_BOUNDARY
))
5347 sizetree
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
5349 ADD_PARM_SIZE (*arg_size_ptr
, sizetree
);
5350 #endif /* ARGS_GROW_DOWNWARD */
5353 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
5354 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
5357 pad_to_arg_alignment (offset_ptr
, boundary
, alignment_pad
)
5358 struct args_size
*offset_ptr
;
5360 struct args_size
*alignment_pad
;
5362 tree save_var
= NULL_TREE
;
5363 HOST_WIDE_INT save_constant
= 0;
5365 int boundary_in_bytes
= boundary
/ BITS_PER_UNIT
;
5367 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
5369 save_var
= offset_ptr
->var
;
5370 save_constant
= offset_ptr
->constant
;
5373 alignment_pad
->var
= NULL_TREE
;
5374 alignment_pad
->constant
= 0;
5376 if (boundary
> BITS_PER_UNIT
)
5378 if (offset_ptr
->var
)
5381 #ifdef ARGS_GROW_DOWNWARD
5386 (ARGS_SIZE_TREE (*offset_ptr
),
5387 boundary
/ BITS_PER_UNIT
);
5388 offset_ptr
->constant
= 0; /*?*/
5389 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
5390 alignment_pad
->var
= size_binop (MINUS_EXPR
, offset_ptr
->var
,
5395 offset_ptr
->constant
=
5396 #ifdef ARGS_GROW_DOWNWARD
5397 FLOOR_ROUND (offset_ptr
->constant
, boundary_in_bytes
);
5399 CEIL_ROUND (offset_ptr
->constant
, boundary_in_bytes
);
5401 if (boundary
> PARM_BOUNDARY
&& boundary
> STACK_BOUNDARY
)
5402 alignment_pad
->constant
= offset_ptr
->constant
- save_constant
;
5407 #ifndef ARGS_GROW_DOWNWARD
5409 pad_below (offset_ptr
, passed_mode
, sizetree
)
5410 struct args_size
*offset_ptr
;
5411 enum machine_mode passed_mode
;
5414 if (passed_mode
!= BLKmode
)
5416 if (GET_MODE_BITSIZE (passed_mode
) % PARM_BOUNDARY
)
5417 offset_ptr
->constant
5418 += (((GET_MODE_BITSIZE (passed_mode
) + PARM_BOUNDARY
- 1)
5419 / PARM_BOUNDARY
* PARM_BOUNDARY
/ BITS_PER_UNIT
)
5420 - GET_MODE_SIZE (passed_mode
));
5424 if (TREE_CODE (sizetree
) != INTEGER_CST
5425 || (TREE_INT_CST_LOW (sizetree
) * BITS_PER_UNIT
) % PARM_BOUNDARY
)
5427 /* Round the size up to multiple of PARM_BOUNDARY bits. */
5428 tree s2
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
5430 ADD_PARM_SIZE (*offset_ptr
, s2
);
5431 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
5437 /* Walk the tree of blocks describing the binding levels within a function
5438 and warn about uninitialized variables.
5439 This is done after calling flow_analysis and before global_alloc
5440 clobbers the pseudo-regs to hard regs. */
5443 uninitialized_vars_warning (block
)
5447 for (decl
= BLOCK_VARS (block
); decl
; decl
= TREE_CHAIN (decl
))
5449 if (warn_uninitialized
5450 && TREE_CODE (decl
) == VAR_DECL
5451 /* These warnings are unreliable for and aggregates
5452 because assigning the fields one by one can fail to convince
5453 flow.c that the entire aggregate was initialized.
5454 Unions are troublesome because members may be shorter. */
5455 && ! AGGREGATE_TYPE_P (TREE_TYPE (decl
))
5456 && DECL_RTL (decl
) != 0
5457 && GET_CODE (DECL_RTL (decl
)) == REG
5458 /* Global optimizations can make it difficult to determine if a
5459 particular variable has been initialized. However, a VAR_DECL
5460 with a nonzero DECL_INITIAL had an initializer, so do not
5461 claim it is potentially uninitialized.
5463 We do not care about the actual value in DECL_INITIAL, so we do
5464 not worry that it may be a dangling pointer. */
5465 && DECL_INITIAL (decl
) == NULL_TREE
5466 && regno_uninitialized (REGNO (DECL_RTL (decl
))))
5467 warning_with_decl (decl
,
5468 "`%s' might be used uninitialized in this function");
5470 && TREE_CODE (decl
) == VAR_DECL
5471 && DECL_RTL (decl
) != 0
5472 && GET_CODE (DECL_RTL (decl
)) == REG
5473 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl
))))
5474 warning_with_decl (decl
,
5475 "variable `%s' might be clobbered by `longjmp' or `vfork'");
5477 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= TREE_CHAIN (sub
))
5478 uninitialized_vars_warning (sub
);
5481 /* Do the appropriate part of uninitialized_vars_warning
5482 but for arguments instead of local variables. */
5485 setjmp_args_warning ()
5488 for (decl
= DECL_ARGUMENTS (current_function_decl
);
5489 decl
; decl
= TREE_CHAIN (decl
))
5490 if (DECL_RTL (decl
) != 0
5491 && GET_CODE (DECL_RTL (decl
)) == REG
5492 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl
))))
5493 warning_with_decl (decl
,
5494 "argument `%s' might be clobbered by `longjmp' or `vfork'");
5497 /* If this function call setjmp, put all vars into the stack
5498 unless they were declared `register'. */
5501 setjmp_protect (block
)
5505 for (decl
= BLOCK_VARS (block
); decl
; decl
= TREE_CHAIN (decl
))
5506 if ((TREE_CODE (decl
) == VAR_DECL
5507 || TREE_CODE (decl
) == PARM_DECL
)
5508 && DECL_RTL (decl
) != 0
5509 && (GET_CODE (DECL_RTL (decl
)) == REG
5510 || (GET_CODE (DECL_RTL (decl
)) == MEM
5511 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == ADDRESSOF
))
5512 /* If this variable came from an inline function, it must be
5513 that its life doesn't overlap the setjmp. If there was a
5514 setjmp in the function, it would already be in memory. We
5515 must exclude such variable because their DECL_RTL might be
5516 set to strange things such as virtual_stack_vars_rtx. */
5517 && ! DECL_FROM_INLINE (decl
)
5519 #ifdef NON_SAVING_SETJMP
5520 /* If longjmp doesn't restore the registers,
5521 don't put anything in them. */
5525 ! DECL_REGISTER (decl
)))
5526 put_var_into_stack (decl
);
5527 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= TREE_CHAIN (sub
))
5528 setjmp_protect (sub
);
5531 /* Like the previous function, but for args instead of local variables. */
5534 setjmp_protect_args ()
5537 for (decl
= DECL_ARGUMENTS (current_function_decl
);
5538 decl
; decl
= TREE_CHAIN (decl
))
5539 if ((TREE_CODE (decl
) == VAR_DECL
5540 || TREE_CODE (decl
) == PARM_DECL
)
5541 && DECL_RTL (decl
) != 0
5542 && (GET_CODE (DECL_RTL (decl
)) == REG
5543 || (GET_CODE (DECL_RTL (decl
)) == MEM
5544 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == ADDRESSOF
))
5546 /* If longjmp doesn't restore the registers,
5547 don't put anything in them. */
5548 #ifdef NON_SAVING_SETJMP
5552 ! DECL_REGISTER (decl
)))
5553 put_var_into_stack (decl
);
5556 /* Return the context-pointer register corresponding to DECL,
5557 or 0 if it does not need one. */
5560 lookup_static_chain (decl
)
5563 tree context
= decl_function_context (decl
);
5567 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_NO_STATIC_CHAIN (decl
)))
5570 /* We treat inline_function_decl as an alias for the current function
5571 because that is the inline function whose vars, types, etc.
5572 are being merged into the current function.
5573 See expand_inline_function. */
5574 if (context
== current_function_decl
|| context
== inline_function_decl
)
5575 return virtual_stack_vars_rtx
;
5577 for (link
= context_display
; link
; link
= TREE_CHAIN (link
))
5578 if (TREE_PURPOSE (link
) == context
)
5579 return RTL_EXPR_RTL (TREE_VALUE (link
));
5584 /* Convert a stack slot address ADDR for variable VAR
5585 (from a containing function)
5586 into an address valid in this function (using a static chain). */
5589 fix_lexical_addr (addr
, var
)
5594 HOST_WIDE_INT displacement
;
5595 tree context
= decl_function_context (var
);
5596 struct function
*fp
;
5599 /* If this is the present function, we need not do anything. */
5600 if (context
== current_function_decl
|| context
== inline_function_decl
)
5603 fp
= find_function_data (context
);
5605 if (GET_CODE (addr
) == ADDRESSOF
&& GET_CODE (XEXP (addr
, 0)) == MEM
)
5606 addr
= XEXP (XEXP (addr
, 0), 0);
5608 /* Decode given address as base reg plus displacement. */
5609 if (GET_CODE (addr
) == REG
)
5610 basereg
= addr
, displacement
= 0;
5611 else if (GET_CODE (addr
) == PLUS
&& GET_CODE (XEXP (addr
, 1)) == CONST_INT
)
5612 basereg
= XEXP (addr
, 0), displacement
= INTVAL (XEXP (addr
, 1));
5616 /* We accept vars reached via the containing function's
5617 incoming arg pointer and via its stack variables pointer. */
5618 if (basereg
== fp
->internal_arg_pointer
)
5620 /* If reached via arg pointer, get the arg pointer value
5621 out of that function's stack frame.
5623 There are two cases: If a separate ap is needed, allocate a
5624 slot in the outer function for it and dereference it that way.
5625 This is correct even if the real ap is actually a pseudo.
5626 Otherwise, just adjust the offset from the frame pointer to
5629 #ifdef NEED_SEPARATE_AP
5632 addr
= get_arg_pointer_save_area (fp
);
5633 addr
= fix_lexical_addr (XEXP (addr
, 0), var
);
5634 addr
= memory_address (Pmode
, addr
);
5636 base
= gen_rtx_MEM (Pmode
, addr
);
5637 set_mem_alias_set (base
, get_frame_alias_set ());
5638 base
= copy_to_reg (base
);
5640 displacement
+= (FIRST_PARM_OFFSET (context
) - STARTING_FRAME_OFFSET
);
5641 base
= lookup_static_chain (var
);
5645 else if (basereg
== virtual_stack_vars_rtx
)
5647 /* This is the same code as lookup_static_chain, duplicated here to
5648 avoid an extra call to decl_function_context. */
5651 for (link
= context_display
; link
; link
= TREE_CHAIN (link
))
5652 if (TREE_PURPOSE (link
) == context
)
5654 base
= RTL_EXPR_RTL (TREE_VALUE (link
));
5662 /* Use same offset, relative to appropriate static chain or argument
5664 return plus_constant (base
, displacement
);
5667 /* Return the address of the trampoline for entering nested fn FUNCTION.
5668 If necessary, allocate a trampoline (in the stack frame)
5669 and emit rtl to initialize its contents (at entry to this function). */
5672 trampoline_address (function
)
5678 struct function
*fp
;
5681 /* Find an existing trampoline and return it. */
5682 for (link
= trampoline_list
; link
; link
= TREE_CHAIN (link
))
5683 if (TREE_PURPOSE (link
) == function
)
5685 adjust_trampoline_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link
)), 0));
5687 for (fp
= outer_function_chain
; fp
; fp
= fp
->outer
)
5688 for (link
= fp
->x_trampoline_list
; link
; link
= TREE_CHAIN (link
))
5689 if (TREE_PURPOSE (link
) == function
)
5691 tramp
= fix_lexical_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link
)), 0),
5693 return adjust_trampoline_addr (tramp
);
5696 /* None exists; we must make one. */
5698 /* Find the `struct function' for the function containing FUNCTION. */
5700 fn_context
= decl_function_context (function
);
5701 if (fn_context
!= current_function_decl
5702 && fn_context
!= inline_function_decl
)
5703 fp
= find_function_data (fn_context
);
5705 /* Allocate run-time space for this trampoline
5706 (usually in the defining function's stack frame). */
5707 #ifdef ALLOCATE_TRAMPOLINE
5708 tramp
= ALLOCATE_TRAMPOLINE (fp
);
5710 /* If rounding needed, allocate extra space
5711 to ensure we have TRAMPOLINE_SIZE bytes left after rounding up. */
5712 #ifdef TRAMPOLINE_ALIGNMENT
5713 #define TRAMPOLINE_REAL_SIZE \
5714 (TRAMPOLINE_SIZE + (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT) - 1)
5716 #define TRAMPOLINE_REAL_SIZE (TRAMPOLINE_SIZE)
5718 tramp
= assign_stack_local_1 (BLKmode
, TRAMPOLINE_REAL_SIZE
, 0,
5722 /* Record the trampoline for reuse and note it for later initialization
5723 by expand_function_end. */
5726 rtlexp
= make_node (RTL_EXPR
);
5727 RTL_EXPR_RTL (rtlexp
) = tramp
;
5728 fp
->x_trampoline_list
= tree_cons (function
, rtlexp
,
5729 fp
->x_trampoline_list
);
5733 /* Make the RTL_EXPR node temporary, not momentary, so that the
5734 trampoline_list doesn't become garbage. */
5735 rtlexp
= make_node (RTL_EXPR
);
5737 RTL_EXPR_RTL (rtlexp
) = tramp
;
5738 trampoline_list
= tree_cons (function
, rtlexp
, trampoline_list
);
5741 tramp
= fix_lexical_addr (XEXP (tramp
, 0), function
);
5742 return adjust_trampoline_addr (tramp
);
5745 /* Given a trampoline address,
5746 round it to multiple of TRAMPOLINE_ALIGNMENT. */
5749 round_trampoline_addr (tramp
)
5752 #ifdef TRAMPOLINE_ALIGNMENT
5753 /* Round address up to desired boundary. */
5754 rtx temp
= gen_reg_rtx (Pmode
);
5755 rtx addend
= GEN_INT (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
- 1);
5756 rtx mask
= GEN_INT (-TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
5758 temp
= expand_simple_binop (Pmode
, PLUS
, tramp
, addend
,
5759 temp
, 0, OPTAB_LIB_WIDEN
);
5760 tramp
= expand_simple_binop (Pmode
, AND
, temp
, mask
,
5761 temp
, 0, OPTAB_LIB_WIDEN
);
5766 /* Given a trampoline address, round it then apply any
5767 platform-specific adjustments so that the result can be used for a
5771 adjust_trampoline_addr (tramp
)
5774 tramp
= round_trampoline_addr (tramp
);
5775 #ifdef TRAMPOLINE_ADJUST_ADDRESS
5776 TRAMPOLINE_ADJUST_ADDRESS (tramp
);
5781 /* Put all this function's BLOCK nodes including those that are chained
5782 onto the first block into a vector, and return it.
5783 Also store in each NOTE for the beginning or end of a block
5784 the index of that block in the vector.
5785 The arguments are BLOCK, the chain of top-level blocks of the function,
5786 and INSNS, the insn chain of the function. */
5792 tree
*block_vector
, *last_block_vector
;
5794 tree block
= DECL_INITIAL (current_function_decl
);
5799 /* Fill the BLOCK_VECTOR with all of the BLOCKs in this function, in
5800 depth-first order. */
5801 block_vector
= get_block_vector (block
, &n_blocks
);
5802 block_stack
= (tree
*) xmalloc (n_blocks
* sizeof (tree
));
5804 last_block_vector
= identify_blocks_1 (get_insns (),
5806 block_vector
+ n_blocks
,
5809 /* If we didn't use all of the subblocks, we've misplaced block notes. */
5810 /* ??? This appears to happen all the time. Latent bugs elsewhere? */
5811 if (0 && last_block_vector
!= block_vector
+ n_blocks
)
5814 free (block_vector
);
5818 /* Subroutine of identify_blocks. Do the block substitution on the
5819 insn chain beginning with INSNS. Recurse for CALL_PLACEHOLDER chains.
5821 BLOCK_STACK is pushed and popped for each BLOCK_BEGIN/BLOCK_END pair.
5822 BLOCK_VECTOR is incremented for each block seen. */
5825 identify_blocks_1 (insns
, block_vector
, end_block_vector
, orig_block_stack
)
5828 tree
*end_block_vector
;
5829 tree
*orig_block_stack
;
5832 tree
*block_stack
= orig_block_stack
;
5834 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
5836 if (GET_CODE (insn
) == NOTE
)
5838 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
)
5842 /* If there are more block notes than BLOCKs, something
5844 if (block_vector
== end_block_vector
)
5847 b
= *block_vector
++;
5848 NOTE_BLOCK (insn
) = b
;
5851 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
)
5853 /* If there are more NOTE_INSN_BLOCK_ENDs than
5854 NOTE_INSN_BLOCK_BEGs, something is badly wrong. */
5855 if (block_stack
== orig_block_stack
)
5858 NOTE_BLOCK (insn
) = *--block_stack
;
5861 else if (GET_CODE (insn
) == CALL_INSN
5862 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
5864 rtx cp
= PATTERN (insn
);
5866 block_vector
= identify_blocks_1 (XEXP (cp
, 0), block_vector
,
5867 end_block_vector
, block_stack
);
5869 block_vector
= identify_blocks_1 (XEXP (cp
, 1), block_vector
,
5870 end_block_vector
, block_stack
);
5872 block_vector
= identify_blocks_1 (XEXP (cp
, 2), block_vector
,
5873 end_block_vector
, block_stack
);
5877 /* If there are more NOTE_INSN_BLOCK_BEGINs than NOTE_INSN_BLOCK_ENDs,
5878 something is badly wrong. */
5879 if (block_stack
!= orig_block_stack
)
5882 return block_vector
;
5885 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
5886 and create duplicate blocks. */
5887 /* ??? Need an option to either create block fragments or to create
5888 abstract origin duplicates of a source block. It really depends
5889 on what optimization has been performed. */
5894 tree block
= DECL_INITIAL (current_function_decl
);
5895 varray_type block_stack
;
5897 if (block
== NULL_TREE
)
5900 VARRAY_TREE_INIT (block_stack
, 10, "block_stack");
5902 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
5903 reorder_blocks_0 (block
);
5905 /* Prune the old trees away, so that they don't get in the way. */
5906 BLOCK_SUBBLOCKS (block
) = NULL_TREE
;
5907 BLOCK_CHAIN (block
) = NULL_TREE
;
5909 /* Recreate the block tree from the note nesting. */
5910 reorder_blocks_1 (get_insns (), block
, &block_stack
);
5911 BLOCK_SUBBLOCKS (block
) = blocks_nreverse (BLOCK_SUBBLOCKS (block
));
5913 /* Remove deleted blocks from the block fragment chains. */
5914 reorder_fix_fragments (block
);
5917 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
5920 reorder_blocks_0 (block
)
5925 TREE_ASM_WRITTEN (block
) = 0;
5926 reorder_blocks_0 (BLOCK_SUBBLOCKS (block
));
5927 block
= BLOCK_CHAIN (block
);
5932 reorder_blocks_1 (insns
, current_block
, p_block_stack
)
5935 varray_type
*p_block_stack
;
5939 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
5941 if (GET_CODE (insn
) == NOTE
)
5943 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
)
5945 tree block
= NOTE_BLOCK (insn
);
5947 /* If we have seen this block before, that means it now
5948 spans multiple address regions. Create a new fragment. */
5949 if (TREE_ASM_WRITTEN (block
))
5951 tree new_block
= copy_node (block
);
5954 origin
= (BLOCK_FRAGMENT_ORIGIN (block
)
5955 ? BLOCK_FRAGMENT_ORIGIN (block
)
5957 BLOCK_FRAGMENT_ORIGIN (new_block
) = origin
;
5958 BLOCK_FRAGMENT_CHAIN (new_block
)
5959 = BLOCK_FRAGMENT_CHAIN (origin
);
5960 BLOCK_FRAGMENT_CHAIN (origin
) = new_block
;
5962 NOTE_BLOCK (insn
) = new_block
;
5966 BLOCK_SUBBLOCKS (block
) = 0;
5967 TREE_ASM_WRITTEN (block
) = 1;
5968 BLOCK_SUPERCONTEXT (block
) = current_block
;
5969 BLOCK_CHAIN (block
) = BLOCK_SUBBLOCKS (current_block
);
5970 BLOCK_SUBBLOCKS (current_block
) = block
;
5971 current_block
= block
;
5972 VARRAY_PUSH_TREE (*p_block_stack
, block
);
5974 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
)
5976 NOTE_BLOCK (insn
) = VARRAY_TOP_TREE (*p_block_stack
);
5977 VARRAY_POP (*p_block_stack
);
5978 BLOCK_SUBBLOCKS (current_block
)
5979 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block
));
5980 current_block
= BLOCK_SUPERCONTEXT (current_block
);
5983 else if (GET_CODE (insn
) == CALL_INSN
5984 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
5986 rtx cp
= PATTERN (insn
);
5987 reorder_blocks_1 (XEXP (cp
, 0), current_block
, p_block_stack
);
5989 reorder_blocks_1 (XEXP (cp
, 1), current_block
, p_block_stack
);
5991 reorder_blocks_1 (XEXP (cp
, 2), current_block
, p_block_stack
);
5996 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
5997 appears in the block tree, select one of the fragments to become
5998 the new origin block. */
6001 reorder_fix_fragments (block
)
6006 tree dup_origin
= BLOCK_FRAGMENT_ORIGIN (block
);
6007 tree new_origin
= NULL_TREE
;
6011 if (! TREE_ASM_WRITTEN (dup_origin
))
6013 new_origin
= BLOCK_FRAGMENT_CHAIN (dup_origin
);
6015 /* Find the first of the remaining fragments. There must
6016 be at least one -- the current block. */
6017 while (! TREE_ASM_WRITTEN (new_origin
))
6018 new_origin
= BLOCK_FRAGMENT_CHAIN (new_origin
);
6019 BLOCK_FRAGMENT_ORIGIN (new_origin
) = NULL_TREE
;
6022 else if (! dup_origin
)
6025 /* Re-root the rest of the fragments to the new origin. In the
6026 case that DUP_ORIGIN was null, that means BLOCK was the origin
6027 of a chain of fragments and we want to remove those fragments
6028 that didn't make it to the output. */
6031 tree
*pp
= &BLOCK_FRAGMENT_CHAIN (new_origin
);
6036 if (TREE_ASM_WRITTEN (chain
))
6038 BLOCK_FRAGMENT_ORIGIN (chain
) = new_origin
;
6040 pp
= &BLOCK_FRAGMENT_CHAIN (chain
);
6042 chain
= BLOCK_FRAGMENT_CHAIN (chain
);
6047 reorder_fix_fragments (BLOCK_SUBBLOCKS (block
));
6048 block
= BLOCK_CHAIN (block
);
6052 /* Reverse the order of elements in the chain T of blocks,
6053 and return the new head of the chain (old last element). */
6059 tree prev
= 0, decl
, next
;
6060 for (decl
= t
; decl
; decl
= next
)
6062 next
= BLOCK_CHAIN (decl
);
6063 BLOCK_CHAIN (decl
) = prev
;
6069 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
6070 non-NULL, list them all into VECTOR, in a depth-first preorder
6071 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
6075 all_blocks (block
, vector
)
6083 TREE_ASM_WRITTEN (block
) = 0;
6085 /* Record this block. */
6087 vector
[n_blocks
] = block
;
6091 /* Record the subblocks, and their subblocks... */
6092 n_blocks
+= all_blocks (BLOCK_SUBBLOCKS (block
),
6093 vector
? vector
+ n_blocks
: 0);
6094 block
= BLOCK_CHAIN (block
);
6100 /* Return a vector containing all the blocks rooted at BLOCK. The
6101 number of elements in the vector is stored in N_BLOCKS_P. The
6102 vector is dynamically allocated; it is the caller's responsibility
6103 to call `free' on the pointer returned. */
6106 get_block_vector (block
, n_blocks_p
)
6112 *n_blocks_p
= all_blocks (block
, NULL
);
6113 block_vector
= (tree
*) xmalloc (*n_blocks_p
* sizeof (tree
));
6114 all_blocks (block
, block_vector
);
6116 return block_vector
;
6119 static int next_block_index
= 2;
6121 /* Set BLOCK_NUMBER for all the blocks in FN. */
6131 /* For SDB and XCOFF debugging output, we start numbering the blocks
6132 from 1 within each function, rather than keeping a running
6134 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
6135 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
6136 next_block_index
= 1;
6139 block_vector
= get_block_vector (DECL_INITIAL (fn
), &n_blocks
);
6141 /* The top-level BLOCK isn't numbered at all. */
6142 for (i
= 1; i
< n_blocks
; ++i
)
6143 /* We number the blocks from two. */
6144 BLOCK_NUMBER (block_vector
[i
]) = next_block_index
++;
6146 free (block_vector
);
6151 /* If VAR is present in a subblock of BLOCK, return the subblock. */
6154 debug_find_var_in_block_tree (var
, block
)
6160 for (t
= BLOCK_VARS (block
); t
; t
= TREE_CHAIN (t
))
6164 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= TREE_CHAIN (t
))
6166 tree ret
= debug_find_var_in_block_tree (var
, t
);
6174 /* Allocate a function structure and reset its contents to the defaults. */
6177 prepare_function_start ()
6179 cfun
= (struct function
*) ggc_alloc_cleared (sizeof (struct function
));
6181 init_stmt_for_function ();
6182 init_eh_for_function ();
6184 cse_not_expected
= ! optimize
;
6186 /* Caller save not needed yet. */
6187 caller_save_needed
= 0;
6189 /* No stack slots have been made yet. */
6190 stack_slot_list
= 0;
6192 current_function_has_nonlocal_label
= 0;
6193 current_function_has_nonlocal_goto
= 0;
6195 /* There is no stack slot for handling nonlocal gotos. */
6196 nonlocal_goto_handler_slots
= 0;
6197 nonlocal_goto_stack_level
= 0;
6199 /* No labels have been declared for nonlocal use. */
6200 nonlocal_labels
= 0;
6201 nonlocal_goto_handler_labels
= 0;
6203 /* No function calls so far in this function. */
6204 function_call_count
= 0;
6206 /* No parm regs have been allocated.
6207 (This is important for output_inline_function.) */
6208 max_parm_reg
= LAST_VIRTUAL_REGISTER
+ 1;
6210 /* Initialize the RTL mechanism. */
6213 /* Initialize the queue of pending postincrement and postdecrements,
6214 and some other info in expr.c. */
6217 /* We haven't done register allocation yet. */
6220 init_varasm_status (cfun
);
6222 /* Clear out data used for inlining. */
6223 cfun
->inlinable
= 0;
6224 cfun
->original_decl_initial
= 0;
6225 cfun
->original_arg_vector
= 0;
6227 cfun
->stack_alignment_needed
= STACK_BOUNDARY
;
6228 cfun
->preferred_stack_boundary
= STACK_BOUNDARY
;
6230 /* Set if a call to setjmp is seen. */
6231 current_function_calls_setjmp
= 0;
6233 /* Set if a call to longjmp is seen. */
6234 current_function_calls_longjmp
= 0;
6236 current_function_calls_alloca
= 0;
6237 current_function_contains_functions
= 0;
6238 current_function_is_leaf
= 0;
6239 current_function_nothrow
= 0;
6240 current_function_sp_is_unchanging
= 0;
6241 current_function_uses_only_leaf_regs
= 0;
6242 current_function_has_computed_jump
= 0;
6243 current_function_is_thunk
= 0;
6245 current_function_returns_pcc_struct
= 0;
6246 current_function_returns_struct
= 0;
6247 current_function_epilogue_delay_list
= 0;
6248 current_function_uses_const_pool
= 0;
6249 current_function_uses_pic_offset_table
= 0;
6250 current_function_cannot_inline
= 0;
6252 /* We have not yet needed to make a label to jump to for tail-recursion. */
6253 tail_recursion_label
= 0;
6255 /* We haven't had a need to make a save area for ap yet. */
6256 arg_pointer_save_area
= 0;
6258 /* No stack slots allocated yet. */
6261 /* No SAVE_EXPRs in this function yet. */
6264 /* No RTL_EXPRs in this function yet. */
6267 /* Set up to allocate temporaries. */
6270 /* Indicate that we need to distinguish between the return value of the
6271 present function and the return value of a function being called. */
6272 rtx_equal_function_value_matters
= 1;
6274 /* Indicate that we have not instantiated virtual registers yet. */
6275 virtuals_instantiated
= 0;
6277 /* Indicate that we want CONCATs now. */
6278 generating_concat_p
= 1;
6280 /* Indicate we have no need of a frame pointer yet. */
6281 frame_pointer_needed
= 0;
6283 /* By default assume not varargs or stdarg. */
6284 current_function_varargs
= 0;
6285 current_function_stdarg
= 0;
6287 /* We haven't made any trampolines for this function yet. */
6288 trampoline_list
= 0;
6290 init_pending_stack_adjust ();
6291 inhibit_defer_pop
= 0;
6293 current_function_outgoing_args_size
= 0;
6295 current_function_funcdef_no
= funcdef_no
++;
6297 cfun
->arc_profile
= profile_arc_flag
|| flag_test_coverage
;
6299 cfun
->arc_profile
= profile_arc_flag
|| flag_test_coverage
;
6301 cfun
->function_frequency
= FUNCTION_FREQUENCY_NORMAL
;
6303 (*lang_hooks
.function
.init
) (cfun
);
6304 if (init_machine_status
)
6305 cfun
->machine
= (*init_machine_status
) ();
6308 /* Initialize the rtl expansion mechanism so that we can do simple things
6309 like generate sequences. This is used to provide a context during global
6310 initialization of some passes. */
6312 init_dummy_function_start ()
6314 prepare_function_start ();
6317 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
6318 and initialize static variables for generating RTL for the statements
6322 init_function_start (subr
, filename
, line
)
6324 const char *filename
;
6327 prepare_function_start ();
6329 current_function_name
= (*lang_hooks
.decl_printable_name
) (subr
, 2);
6332 /* Nonzero if this is a nested function that uses a static chain. */
6334 current_function_needs_context
6335 = (decl_function_context (current_function_decl
) != 0
6336 && ! DECL_NO_STATIC_CHAIN (current_function_decl
));
6338 /* Within function body, compute a type's size as soon it is laid out. */
6339 immediate_size_expand
++;
6341 /* Prevent ever trying to delete the first instruction of a function.
6342 Also tell final how to output a linenum before the function prologue.
6343 Note linenums could be missing, e.g. when compiling a Java .class file. */
6345 emit_line_note (filename
, line
);
6347 /* Make sure first insn is a note even if we don't want linenums.
6348 This makes sure the first insn will never be deleted.
6349 Also, final expects a note to appear there. */
6350 emit_note (NULL
, NOTE_INSN_DELETED
);
6352 /* Set flags used by final.c. */
6353 if (aggregate_value_p (DECL_RESULT (subr
)))
6355 #ifdef PCC_STATIC_STRUCT_RETURN
6356 current_function_returns_pcc_struct
= 1;
6358 current_function_returns_struct
= 1;
6361 /* Warn if this value is an aggregate type,
6362 regardless of which calling convention we are using for it. */
6363 if (warn_aggregate_return
6364 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr
))))
6365 warning ("function returns an aggregate");
6367 current_function_returns_pointer
6368 = POINTER_TYPE_P (TREE_TYPE (DECL_RESULT (subr
)));
6371 /* Make sure all values used by the optimization passes have sane
6374 init_function_for_compilation ()
6378 /* No prologue/epilogue insns yet. */
6379 VARRAY_GROW (prologue
, 0);
6380 VARRAY_GROW (epilogue
, 0);
6381 VARRAY_GROW (sibcall_epilogue
, 0);
6384 /* Indicate that the current function uses extra args
6385 not explicitly mentioned in the argument list in any fashion. */
6390 current_function_varargs
= 1;
6393 /* Expand a call to __main at the beginning of a possible main function. */
6395 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
6396 #undef HAS_INIT_SECTION
6397 #define HAS_INIT_SECTION
6401 expand_main_function ()
6403 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
6404 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
)
6406 int align
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
6410 /* Forcibly align the stack. */
6411 #ifdef STACK_GROWS_DOWNWARD
6412 tmp
= expand_simple_binop (Pmode
, AND
, stack_pointer_rtx
, GEN_INT(-align
),
6413 stack_pointer_rtx
, 1, OPTAB_WIDEN
);
6415 tmp
= expand_simple_binop (Pmode
, PLUS
, stack_pointer_rtx
,
6416 GEN_INT (align
- 1), NULL_RTX
, 1, OPTAB_WIDEN
);
6417 tmp
= expand_simple_binop (Pmode
, AND
, tmp
, GEN_INT (-align
),
6418 stack_pointer_rtx
, 1, OPTAB_WIDEN
);
6420 if (tmp
!= stack_pointer_rtx
)
6421 emit_move_insn (stack_pointer_rtx
, tmp
);
6423 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
6424 tmp
= force_reg (Pmode
, const0_rtx
);
6425 allocate_dynamic_stack_space (tmp
, NULL_RTX
, BIGGEST_ALIGNMENT
);
6429 for (tmp
= get_last_insn (); tmp
; tmp
= PREV_INSN (tmp
))
6430 if (NOTE_P (tmp
) && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_FUNCTION_BEG
)
6433 emit_insn_before (seq
, tmp
);
6439 #ifndef HAS_INIT_SECTION
6440 emit_library_call (gen_rtx_SYMBOL_REF (Pmode
, NAME__MAIN
), LCT_NORMAL
,
6445 extern struct obstack permanent_obstack
;
6447 /* The PENDING_SIZES represent the sizes of variable-sized types.
6448 Create RTL for the various sizes now (using temporary variables),
6449 so that we can refer to the sizes from the RTL we are generating
6450 for the current function. The PENDING_SIZES are a TREE_LIST. The
6451 TREE_VALUE of each node is a SAVE_EXPR. */
6454 expand_pending_sizes (pending_sizes
)
6459 /* Evaluate now the sizes of any types declared among the arguments. */
6460 for (tem
= pending_sizes
; tem
; tem
= TREE_CHAIN (tem
))
6462 expand_expr (TREE_VALUE (tem
), const0_rtx
, VOIDmode
, 0);
6463 /* Flush the queue in case this parameter declaration has
6469 /* Start the RTL for a new function, and set variables used for
6471 SUBR is the FUNCTION_DECL node.
6472 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
6473 the function's parameters, which must be run at any return statement. */
6476 expand_function_start (subr
, parms_have_cleanups
)
6478 int parms_have_cleanups
;
6481 rtx last_ptr
= NULL_RTX
;
6483 /* Make sure volatile mem refs aren't considered
6484 valid operands of arithmetic insns. */
6485 init_recog_no_volatile ();
6487 current_function_instrument_entry_exit
6488 = (flag_instrument_function_entry_exit
6489 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr
));
6491 current_function_profile
6493 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr
));
6495 current_function_limit_stack
6496 = (stack_limit_rtx
!= NULL_RTX
&& ! DECL_NO_LIMIT_STACK (subr
));
6498 /* If function gets a static chain arg, store it in the stack frame.
6499 Do this first, so it gets the first stack slot offset. */
6500 if (current_function_needs_context
)
6502 last_ptr
= assign_stack_local (Pmode
, GET_MODE_SIZE (Pmode
), 0);
6504 /* Delay copying static chain if it is not a register to avoid
6505 conflicts with regs used for parameters. */
6506 if (! SMALL_REGISTER_CLASSES
6507 || GET_CODE (static_chain_incoming_rtx
) == REG
)
6508 emit_move_insn (last_ptr
, static_chain_incoming_rtx
);
6511 /* If the parameters of this function need cleaning up, get a label
6512 for the beginning of the code which executes those cleanups. This must
6513 be done before doing anything with return_label. */
6514 if (parms_have_cleanups
)
6515 cleanup_label
= gen_label_rtx ();
6519 /* Make the label for return statements to jump to. Do not special
6520 case machines with special return instructions -- they will be
6521 handled later during jump, ifcvt, or epilogue creation. */
6522 return_label
= gen_label_rtx ();
6524 /* Initialize rtx used to return the value. */
6525 /* Do this before assign_parms so that we copy the struct value address
6526 before any library calls that assign parms might generate. */
6528 /* Decide whether to return the value in memory or in a register. */
6529 if (aggregate_value_p (DECL_RESULT (subr
)))
6531 /* Returning something that won't go in a register. */
6532 rtx value_address
= 0;
6534 #ifdef PCC_STATIC_STRUCT_RETURN
6535 if (current_function_returns_pcc_struct
)
6537 int size
= int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr
)));
6538 value_address
= assemble_static_space (size
);
6543 /* Expect to be passed the address of a place to store the value.
6544 If it is passed as an argument, assign_parms will take care of
6546 if (struct_value_incoming_rtx
)
6548 value_address
= gen_reg_rtx (Pmode
);
6549 emit_move_insn (value_address
, struct_value_incoming_rtx
);
6554 rtx x
= gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr
)), value_address
);
6555 set_mem_attributes (x
, DECL_RESULT (subr
), 1);
6556 SET_DECL_RTL (DECL_RESULT (subr
), x
);
6559 else if (DECL_MODE (DECL_RESULT (subr
)) == VOIDmode
)
6560 /* If return mode is void, this decl rtl should not be used. */
6561 SET_DECL_RTL (DECL_RESULT (subr
), NULL_RTX
);
6564 /* Compute the return values into a pseudo reg, which we will copy
6565 into the true return register after the cleanups are done. */
6567 /* In order to figure out what mode to use for the pseudo, we
6568 figure out what the mode of the eventual return register will
6569 actually be, and use that. */
6571 = hard_function_value (TREE_TYPE (DECL_RESULT (subr
)),
6574 /* Structures that are returned in registers are not aggregate_value_p,
6575 so we may see a PARALLEL. Don't play pseudo games with this. */
6576 if (! REG_P (hard_reg
))
6577 SET_DECL_RTL (DECL_RESULT (subr
), hard_reg
);
6580 /* Create the pseudo. */
6581 SET_DECL_RTL (DECL_RESULT (subr
), gen_reg_rtx (GET_MODE (hard_reg
)));
6583 /* Needed because we may need to move this to memory
6584 in case it's a named return value whose address is taken. */
6585 DECL_REGISTER (DECL_RESULT (subr
)) = 1;
6589 /* Initialize rtx for parameters and local variables.
6590 In some cases this requires emitting insns. */
6592 assign_parms (subr
);
6594 /* Copy the static chain now if it wasn't a register. The delay is to
6595 avoid conflicts with the parameter passing registers. */
6597 if (SMALL_REGISTER_CLASSES
&& current_function_needs_context
)
6598 if (GET_CODE (static_chain_incoming_rtx
) != REG
)
6599 emit_move_insn (last_ptr
, static_chain_incoming_rtx
);
6601 /* The following was moved from init_function_start.
6602 The move is supposed to make sdb output more accurate. */
6603 /* Indicate the beginning of the function body,
6604 as opposed to parm setup. */
6605 emit_note (NULL
, NOTE_INSN_FUNCTION_BEG
);
6607 if (GET_CODE (get_last_insn ()) != NOTE
)
6608 emit_note (NULL
, NOTE_INSN_DELETED
);
6609 parm_birth_insn
= get_last_insn ();
6611 context_display
= 0;
6612 if (current_function_needs_context
)
6614 /* Fetch static chain values for containing functions. */
6615 tem
= decl_function_context (current_function_decl
);
6616 /* Copy the static chain pointer into a pseudo. If we have
6617 small register classes, copy the value from memory if
6618 static_chain_incoming_rtx is a REG. */
6621 /* If the static chain originally came in a register, put it back
6622 there, then move it out in the next insn. The reason for
6623 this peculiar code is to satisfy function integration. */
6624 if (SMALL_REGISTER_CLASSES
6625 && GET_CODE (static_chain_incoming_rtx
) == REG
)
6626 emit_move_insn (static_chain_incoming_rtx
, last_ptr
);
6627 last_ptr
= copy_to_reg (static_chain_incoming_rtx
);
6632 tree rtlexp
= make_node (RTL_EXPR
);
6634 RTL_EXPR_RTL (rtlexp
) = last_ptr
;
6635 context_display
= tree_cons (tem
, rtlexp
, context_display
);
6636 tem
= decl_function_context (tem
);
6639 /* Chain thru stack frames, assuming pointer to next lexical frame
6640 is found at the place we always store it. */
6641 #ifdef FRAME_GROWS_DOWNWARD
6642 last_ptr
= plus_constant (last_ptr
,
6643 -(HOST_WIDE_INT
) GET_MODE_SIZE (Pmode
));
6645 last_ptr
= gen_rtx_MEM (Pmode
, memory_address (Pmode
, last_ptr
));
6646 set_mem_alias_set (last_ptr
, get_frame_alias_set ());
6647 last_ptr
= copy_to_reg (last_ptr
);
6649 /* If we are not optimizing, ensure that we know that this
6650 piece of context is live over the entire function. */
6652 save_expr_regs
= gen_rtx_EXPR_LIST (VOIDmode
, last_ptr
,
6657 if (current_function_instrument_entry_exit
)
6659 rtx fun
= DECL_RTL (current_function_decl
);
6660 if (GET_CODE (fun
) == MEM
)
6661 fun
= XEXP (fun
, 0);
6664 emit_library_call (profile_function_entry_libfunc
, LCT_NORMAL
, VOIDmode
,
6666 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS
,
6668 hard_frame_pointer_rtx
),
6672 if (current_function_profile
)
6675 PROFILE_HOOK (current_function_funcdef_no
);
6679 /* After the display initializations is where the tail-recursion label
6680 should go, if we end up needing one. Ensure we have a NOTE here
6681 since some things (like trampolines) get placed before this. */
6682 tail_recursion_reentry
= emit_note (NULL
, NOTE_INSN_DELETED
);
6684 /* Evaluate now the sizes of any types declared among the arguments. */
6685 expand_pending_sizes (nreverse (get_pending_sizes ()));
6687 /* Make sure there is a line number after the function entry setup code. */
6688 force_next_line_note ();
6691 /* Undo the effects of init_dummy_function_start. */
6693 expand_dummy_function_end ()
6695 /* End any sequences that failed to be closed due to syntax errors. */
6696 while (in_sequence_p ())
6699 /* Outside function body, can't compute type's actual size
6700 until next function's body starts. */
6702 free_after_parsing (cfun
);
6703 free_after_compilation (cfun
);
6707 /* Call DOIT for each hard register used as a return value from
6708 the current function. */
6711 diddle_return_value (doit
, arg
)
6712 void (*doit
) PARAMS ((rtx
, void *));
6715 rtx outgoing
= current_function_return_rtx
;
6720 if (GET_CODE (outgoing
) == REG
)
6721 (*doit
) (outgoing
, arg
);
6722 else if (GET_CODE (outgoing
) == PARALLEL
)
6726 for (i
= 0; i
< XVECLEN (outgoing
, 0); i
++)
6728 rtx x
= XEXP (XVECEXP (outgoing
, 0, i
), 0);
6730 if (GET_CODE (x
) == REG
&& REGNO (x
) < FIRST_PSEUDO_REGISTER
)
6737 do_clobber_return_reg (reg
, arg
)
6739 void *arg ATTRIBUTE_UNUSED
;
6741 emit_insn (gen_rtx_CLOBBER (VOIDmode
, reg
));
6745 clobber_return_register ()
6747 diddle_return_value (do_clobber_return_reg
, NULL
);
6749 /* In case we do use pseudo to return value, clobber it too. */
6750 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
6752 tree decl_result
= DECL_RESULT (current_function_decl
);
6753 rtx decl_rtl
= DECL_RTL (decl_result
);
6754 if (REG_P (decl_rtl
) && REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
)
6756 do_clobber_return_reg (decl_rtl
, NULL
);
6762 do_use_return_reg (reg
, arg
)
6764 void *arg ATTRIBUTE_UNUSED
;
6766 emit_insn (gen_rtx_USE (VOIDmode
, reg
));
6770 use_return_register ()
6772 diddle_return_value (do_use_return_reg
, NULL
);
6775 static GTY(()) rtx initial_trampoline
;
6777 /* Generate RTL for the end of the current function.
6778 FILENAME and LINE are the current position in the source file.
6780 It is up to language-specific callers to do cleanups for parameters--
6781 or else, supply 1 for END_BINDINGS and we will call expand_end_bindings. */
6784 expand_function_end (filename
, line
, end_bindings
)
6785 const char *filename
;
6792 finish_expr_for_function ();
6794 /* If arg_pointer_save_area was referenced only from a nested
6795 function, we will not have initialized it yet. Do that now. */
6796 if (arg_pointer_save_area
&& ! cfun
->arg_pointer_save_area_init
)
6797 get_arg_pointer_save_area (cfun
);
6799 #ifdef NON_SAVING_SETJMP
6800 /* Don't put any variables in registers if we call setjmp
6801 on a machine that fails to restore the registers. */
6802 if (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
6804 if (DECL_INITIAL (current_function_decl
) != error_mark_node
)
6805 setjmp_protect (DECL_INITIAL (current_function_decl
));
6807 setjmp_protect_args ();
6811 /* Initialize any trampolines required by this function. */
6812 for (link
= trampoline_list
; link
; link
= TREE_CHAIN (link
))
6814 tree function
= TREE_PURPOSE (link
);
6815 rtx context ATTRIBUTE_UNUSED
= lookup_static_chain (function
);
6816 rtx tramp
= RTL_EXPR_RTL (TREE_VALUE (link
));
6817 #ifdef TRAMPOLINE_TEMPLATE
6822 #ifdef TRAMPOLINE_TEMPLATE
6823 /* First make sure this compilation has a template for
6824 initializing trampolines. */
6825 if (initial_trampoline
== 0)
6828 = gen_rtx_MEM (BLKmode
, assemble_trampoline_template ());
6829 set_mem_align (initial_trampoline
, TRAMPOLINE_ALIGNMENT
);
6833 /* Generate insns to initialize the trampoline. */
6835 tramp
= round_trampoline_addr (XEXP (tramp
, 0));
6836 #ifdef TRAMPOLINE_TEMPLATE
6837 blktramp
= replace_equiv_address (initial_trampoline
, tramp
);
6838 emit_block_move (blktramp
, initial_trampoline
,
6839 GEN_INT (TRAMPOLINE_SIZE
));
6841 INITIALIZE_TRAMPOLINE (tramp
, XEXP (DECL_RTL (function
), 0), context
);
6845 /* Put those insns at entry to the containing function (this one). */
6846 emit_insn_before (seq
, tail_recursion_reentry
);
6849 /* If we are doing stack checking and this function makes calls,
6850 do a stack probe at the start of the function to ensure we have enough
6851 space for another stack frame. */
6852 if (flag_stack_check
&& ! STACK_CHECK_BUILTIN
)
6856 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
6857 if (GET_CODE (insn
) == CALL_INSN
)
6860 probe_stack_range (STACK_CHECK_PROTECT
,
6861 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE
));
6864 emit_insn_before (seq
, tail_recursion_reentry
);
6869 /* Warn about unused parms if extra warnings were specified. */
6870 /* Either ``-W -Wunused'' or ``-Wunused-parameter'' enables this
6871 warning. WARN_UNUSED_PARAMETER is negative when set by
6873 if (warn_unused_parameter
> 0
6874 || (warn_unused_parameter
< 0 && extra_warnings
))
6878 for (decl
= DECL_ARGUMENTS (current_function_decl
);
6879 decl
; decl
= TREE_CHAIN (decl
))
6880 if (! TREE_USED (decl
) && TREE_CODE (decl
) == PARM_DECL
6881 && DECL_NAME (decl
) && ! DECL_ARTIFICIAL (decl
))
6882 warning_with_decl (decl
, "unused parameter `%s'");
6885 /* Delete handlers for nonlocal gotos if nothing uses them. */
6886 if (nonlocal_goto_handler_slots
!= 0
6887 && ! current_function_has_nonlocal_label
)
6890 /* End any sequences that failed to be closed due to syntax errors. */
6891 while (in_sequence_p ())
6894 /* Outside function body, can't compute type's actual size
6895 until next function's body starts. */
6896 immediate_size_expand
--;
6898 clear_pending_stack_adjust ();
6899 do_pending_stack_adjust ();
6901 /* Mark the end of the function body.
6902 If control reaches this insn, the function can drop through
6903 without returning a value. */
6904 emit_note (NULL
, NOTE_INSN_FUNCTION_END
);
6906 /* Must mark the last line number note in the function, so that the test
6907 coverage code can avoid counting the last line twice. This just tells
6908 the code to ignore the immediately following line note, since there
6909 already exists a copy of this note somewhere above. This line number
6910 note is still needed for debugging though, so we can't delete it. */
6911 if (flag_test_coverage
)
6912 emit_note (NULL
, NOTE_INSN_REPEATED_LINE_NUMBER
);
6914 /* Output a linenumber for the end of the function.
6915 SDB depends on this. */
6916 emit_line_note_force (filename
, line
);
6918 /* Before the return label (if any), clobber the return
6919 registers so that they are not propagated live to the rest of
6920 the function. This can only happen with functions that drop
6921 through; if there had been a return statement, there would
6922 have either been a return rtx, or a jump to the return label.
6924 We delay actual code generation after the current_function_value_rtx
6926 clobber_after
= get_last_insn ();
6928 /* Output the label for the actual return from the function,
6929 if one is expected. This happens either because a function epilogue
6930 is used instead of a return instruction, or because a return was done
6931 with a goto in order to run local cleanups, or because of pcc-style
6932 structure returning. */
6934 emit_label (return_label
);
6936 /* C++ uses this. */
6938 expand_end_bindings (0, 0, 0);
6940 if (current_function_instrument_entry_exit
)
6942 rtx fun
= DECL_RTL (current_function_decl
);
6943 if (GET_CODE (fun
) == MEM
)
6944 fun
= XEXP (fun
, 0);
6947 emit_library_call (profile_function_exit_libfunc
, LCT_NORMAL
, VOIDmode
,
6949 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS
,
6951 hard_frame_pointer_rtx
),
6955 /* Let except.c know where it should emit the call to unregister
6956 the function context for sjlj exceptions. */
6957 if (flag_exceptions
&& USING_SJLJ_EXCEPTIONS
)
6958 sjlj_emit_function_exit_after (get_last_insn ());
6960 /* If we had calls to alloca, and this machine needs
6961 an accurate stack pointer to exit the function,
6962 insert some code to save and restore the stack pointer. */
6963 #ifdef EXIT_IGNORE_STACK
6964 if (! EXIT_IGNORE_STACK
)
6966 if (current_function_calls_alloca
)
6970 emit_stack_save (SAVE_FUNCTION
, &tem
, parm_birth_insn
);
6971 emit_stack_restore (SAVE_FUNCTION
, tem
, NULL_RTX
);
6974 /* If scalar return value was computed in a pseudo-reg, or was a named
6975 return value that got dumped to the stack, copy that to the hard
6977 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl
)))
6979 tree decl_result
= DECL_RESULT (current_function_decl
);
6980 rtx decl_rtl
= DECL_RTL (decl_result
);
6982 if (REG_P (decl_rtl
)
6983 ? REGNO (decl_rtl
) >= FIRST_PSEUDO_REGISTER
6984 : DECL_REGISTER (decl_result
))
6986 rtx real_decl_rtl
= current_function_return_rtx
;
6988 /* This should be set in assign_parms. */
6989 if (! REG_FUNCTION_VALUE_P (real_decl_rtl
))
6992 /* If this is a BLKmode structure being returned in registers,
6993 then use the mode computed in expand_return. Note that if
6994 decl_rtl is memory, then its mode may have been changed,
6995 but that current_function_return_rtx has not. */
6996 if (GET_MODE (real_decl_rtl
) == BLKmode
)
6997 PUT_MODE (real_decl_rtl
, GET_MODE (decl_rtl
));
6999 /* If a named return value dumped decl_return to memory, then
7000 we may need to re-do the PROMOTE_MODE signed/unsigned
7002 if (GET_MODE (real_decl_rtl
) != GET_MODE (decl_rtl
))
7004 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (decl_result
));
7006 #ifdef PROMOTE_FUNCTION_RETURN
7007 promote_mode (TREE_TYPE (decl_result
), GET_MODE (decl_rtl
),
7011 convert_move (real_decl_rtl
, decl_rtl
, unsignedp
);
7013 else if (GET_CODE (real_decl_rtl
) == PARALLEL
)
7014 emit_group_load (real_decl_rtl
, decl_rtl
,
7015 int_size_in_bytes (TREE_TYPE (decl_result
)));
7017 emit_move_insn (real_decl_rtl
, decl_rtl
);
7021 /* If returning a structure, arrange to return the address of the value
7022 in a place where debuggers expect to find it.
7024 If returning a structure PCC style,
7025 the caller also depends on this value.
7026 And current_function_returns_pcc_struct is not necessarily set. */
7027 if (current_function_returns_struct
7028 || current_function_returns_pcc_struct
)
7031 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl
)), 0);
7032 tree type
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7033 #ifdef FUNCTION_OUTGOING_VALUE
7035 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type
),
7036 current_function_decl
);
7039 = FUNCTION_VALUE (build_pointer_type (type
), current_function_decl
);
7042 /* Mark this as a function return value so integrate will delete the
7043 assignment and USE below when inlining this function. */
7044 REG_FUNCTION_VALUE_P (outgoing
) = 1;
7046 #ifdef POINTERS_EXTEND_UNSIGNED
7047 /* The address may be ptr_mode and OUTGOING may be Pmode. */
7048 if (GET_MODE (outgoing
) != GET_MODE (value_address
))
7049 value_address
= convert_memory_address (GET_MODE (outgoing
),
7053 emit_move_insn (outgoing
, value_address
);
7055 /* Show return register used to hold result (in this case the address
7057 current_function_return_rtx
= outgoing
;
7060 /* If this is an implementation of throw, do what's necessary to
7061 communicate between __builtin_eh_return and the epilogue. */
7062 expand_eh_return ();
7064 /* Emit the actual code to clobber return register. */
7069 clobber_return_register ();
7073 after
= emit_insn_after (seq
, clobber_after
);
7075 if (clobber_after
!= after
)
7076 cfun
->x_clobber_return_insn
= after
;
7079 /* ??? This should no longer be necessary since stupid is no longer with
7080 us, but there are some parts of the compiler (eg reload_combine, and
7081 sh mach_dep_reorg) that still try and compute their own lifetime info
7082 instead of using the general framework. */
7083 use_return_register ();
7085 /* Fix up any gotos that jumped out to the outermost
7086 binding level of the function.
7087 Must follow emitting RETURN_LABEL. */
7089 /* If you have any cleanups to do at this point,
7090 and they need to create temporary variables,
7091 then you will lose. */
7092 expand_fixups (get_insns ());
7096 get_arg_pointer_save_area (f
)
7099 rtx ret
= f
->x_arg_pointer_save_area
;
7103 ret
= assign_stack_local_1 (Pmode
, GET_MODE_SIZE (Pmode
), 0, f
);
7104 f
->x_arg_pointer_save_area
= ret
;
7107 if (f
== cfun
&& ! f
->arg_pointer_save_area_init
)
7111 /* Save the arg pointer at the beginning of the function. The
7112 generated stack slot may not be a valid memory address, so we
7113 have to check it and fix it if necessary. */
7115 emit_move_insn (validize_mem (ret
), virtual_incoming_args_rtx
);
7119 push_topmost_sequence ();
7120 emit_insn_after (seq
, get_insns ());
7121 pop_topmost_sequence ();
7127 /* Extend a vector that records the INSN_UIDs of INSNS
7128 (a list of one or more insns). */
7131 record_insns (insns
, vecp
)
7140 while (tmp
!= NULL_RTX
)
7143 tmp
= NEXT_INSN (tmp
);
7146 i
= VARRAY_SIZE (*vecp
);
7147 VARRAY_GROW (*vecp
, i
+ len
);
7149 while (tmp
!= NULL_RTX
)
7151 VARRAY_INT (*vecp
, i
) = INSN_UID (tmp
);
7153 tmp
= NEXT_INSN (tmp
);
7157 /* Determine how many INSN_UIDs in VEC are part of INSN. Because we can
7158 be running after reorg, SEQUENCE rtl is possible. */
7161 contains (insn
, vec
)
7167 if (GET_CODE (insn
) == INSN
7168 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
7171 for (i
= XVECLEN (PATTERN (insn
), 0) - 1; i
>= 0; i
--)
7172 for (j
= VARRAY_SIZE (vec
) - 1; j
>= 0; --j
)
7173 if (INSN_UID (XVECEXP (PATTERN (insn
), 0, i
)) == VARRAY_INT (vec
, j
))
7179 for (j
= VARRAY_SIZE (vec
) - 1; j
>= 0; --j
)
7180 if (INSN_UID (insn
) == VARRAY_INT (vec
, j
))
7187 prologue_epilogue_contains (insn
)
7190 if (contains (insn
, prologue
))
7192 if (contains (insn
, epilogue
))
7198 sibcall_epilogue_contains (insn
)
7201 if (sibcall_epilogue
)
7202 return contains (insn
, sibcall_epilogue
);
7207 /* Insert gen_return at the end of block BB. This also means updating
7208 block_for_insn appropriately. */
7211 emit_return_into_block (bb
, line_note
)
7217 p
= NEXT_INSN (bb
->end
);
7218 end
= emit_jump_insn_after (gen_return (), bb
->end
);
7220 emit_line_note_after (NOTE_SOURCE_FILE (line_note
),
7221 NOTE_LINE_NUMBER (line_note
), PREV_INSN (bb
->end
));
7223 #endif /* HAVE_return */
7225 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
7227 /* These functions convert the epilogue into a variant that does not modify the
7228 stack pointer. This is used in cases where a function returns an object
7229 whose size is not known until it is computed. The called function leaves the
7230 object on the stack, leaves the stack depressed, and returns a pointer to
7233 What we need to do is track all modifications and references to the stack
7234 pointer, deleting the modifications and changing the references to point to
7235 the location the stack pointer would have pointed to had the modifications
7238 These functions need to be portable so we need to make as few assumptions
7239 about the epilogue as we can. However, the epilogue basically contains
7240 three things: instructions to reset the stack pointer, instructions to
7241 reload registers, possibly including the frame pointer, and an
7242 instruction to return to the caller.
7244 If we can't be sure of what a relevant epilogue insn is doing, we abort.
7245 We also make no attempt to validate the insns we make since if they are
7246 invalid, we probably can't do anything valid. The intent is that these
7247 routines get "smarter" as more and more machines start to use them and
7248 they try operating on different epilogues.
7250 We use the following structure to track what the part of the epilogue that
7251 we've already processed has done. We keep two copies of the SP equivalence,
7252 one for use during the insn we are processing and one for use in the next
7253 insn. The difference is because one part of a PARALLEL may adjust SP
7254 and the other may use it. */
7258 rtx sp_equiv_reg
; /* REG that SP is set from, perhaps SP. */
7259 HOST_WIDE_INT sp_offset
; /* Offset from SP_EQUIV_REG of present SP. */
7260 rtx new_sp_equiv_reg
; /* REG to be used at end of insn. */
7261 HOST_WIDE_INT new_sp_offset
; /* Offset to be used at end of insn. */
7262 rtx equiv_reg_src
; /* If nonzero, the value that SP_EQUIV_REG
7263 should be set to once we no longer need
7267 static void handle_epilogue_set
PARAMS ((rtx
, struct epi_info
*));
7268 static void emit_equiv_load
PARAMS ((struct epi_info
*));
7270 /* Modify INSN, a list of one or more insns that is part of the epilogue, to
7271 no modifications to the stack pointer. Return the new list of insns. */
7274 keep_stack_depressed (insns
)
7278 struct epi_info info
;
7281 /* If the epilogue is just a single instruction, it ust be OK as is. */
7283 if (NEXT_INSN (insns
) == NULL_RTX
)
7286 /* Otherwise, start a sequence, initialize the information we have, and
7287 process all the insns we were given. */
7290 info
.sp_equiv_reg
= stack_pointer_rtx
;
7292 info
.equiv_reg_src
= 0;
7296 while (insn
!= NULL_RTX
)
7298 next
= NEXT_INSN (insn
);
7307 /* If this insn references the register that SP is equivalent to and
7308 we have a pending load to that register, we must force out the load
7309 first and then indicate we no longer know what SP's equivalent is. */
7310 if (info
.equiv_reg_src
!= 0
7311 && reg_referenced_p (info
.sp_equiv_reg
, PATTERN (insn
)))
7313 emit_equiv_load (&info
);
7314 info
.sp_equiv_reg
= 0;
7317 info
.new_sp_equiv_reg
= info
.sp_equiv_reg
;
7318 info
.new_sp_offset
= info
.sp_offset
;
7320 /* If this is a (RETURN) and the return address is on the stack,
7321 update the address and change to an indirect jump. */
7322 if (GET_CODE (PATTERN (insn
)) == RETURN
7323 || (GET_CODE (PATTERN (insn
)) == PARALLEL
7324 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == RETURN
))
7326 rtx retaddr
= INCOMING_RETURN_ADDR_RTX
;
7328 HOST_WIDE_INT offset
= 0;
7329 rtx jump_insn
, jump_set
;
7331 /* If the return address is in a register, we can emit the insn
7332 unchanged. Otherwise, it must be a MEM and we see what the
7333 base register and offset are. In any case, we have to emit any
7334 pending load to the equivalent reg of SP, if any. */
7335 if (GET_CODE (retaddr
) == REG
)
7337 emit_equiv_load (&info
);
7342 else if (GET_CODE (retaddr
) == MEM
7343 && GET_CODE (XEXP (retaddr
, 0)) == REG
)
7344 base
= gen_rtx_REG (Pmode
, REGNO (XEXP (retaddr
, 0))), offset
= 0;
7345 else if (GET_CODE (retaddr
) == MEM
7346 && GET_CODE (XEXP (retaddr
, 0)) == PLUS
7347 && GET_CODE (XEXP (XEXP (retaddr
, 0), 0)) == REG
7348 && GET_CODE (XEXP (XEXP (retaddr
, 0), 1)) == CONST_INT
)
7350 base
= gen_rtx_REG (Pmode
, REGNO (XEXP (XEXP (retaddr
, 0), 0)));
7351 offset
= INTVAL (XEXP (XEXP (retaddr
, 0), 1));
7356 /* If the base of the location containing the return pointer
7357 is SP, we must update it with the replacement address. Otherwise,
7358 just build the necessary MEM. */
7359 retaddr
= plus_constant (base
, offset
);
7360 if (base
== stack_pointer_rtx
)
7361 retaddr
= simplify_replace_rtx (retaddr
, stack_pointer_rtx
,
7362 plus_constant (info
.sp_equiv_reg
,
7365 retaddr
= gen_rtx_MEM (Pmode
, retaddr
);
7367 /* If there is a pending load to the equivalent register for SP
7368 and we reference that register, we must load our address into
7369 a scratch register and then do that load. */
7370 if (info
.equiv_reg_src
7371 && reg_overlap_mentioned_p (info
.equiv_reg_src
, retaddr
))
7376 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
7377 if (HARD_REGNO_MODE_OK (regno
, Pmode
)
7378 && !fixed_regs
[regno
]
7379 && TEST_HARD_REG_BIT (regs_invalidated_by_call
, regno
)
7380 && !REGNO_REG_SET_P (EXIT_BLOCK_PTR
->global_live_at_start
,
7382 && !refers_to_regno_p (regno
,
7383 regno
+ HARD_REGNO_NREGS (regno
,
7385 info
.equiv_reg_src
, NULL
))
7388 if (regno
== FIRST_PSEUDO_REGISTER
)
7391 reg
= gen_rtx_REG (Pmode
, regno
);
7392 emit_move_insn (reg
, retaddr
);
7396 emit_equiv_load (&info
);
7397 jump_insn
= emit_jump_insn (gen_indirect_jump (retaddr
));
7399 /* Show the SET in the above insn is a RETURN. */
7400 jump_set
= single_set (jump_insn
);
7404 SET_IS_RETURN_P (jump_set
) = 1;
7407 /* If SP is not mentioned in the pattern and its equivalent register, if
7408 any, is not modified, just emit it. Otherwise, if neither is set,
7409 replace the reference to SP and emit the insn. If none of those are
7410 true, handle each SET individually. */
7411 else if (!reg_mentioned_p (stack_pointer_rtx
, PATTERN (insn
))
7412 && (info
.sp_equiv_reg
== stack_pointer_rtx
7413 || !reg_set_p (info
.sp_equiv_reg
, insn
)))
7415 else if (! reg_set_p (stack_pointer_rtx
, insn
)
7416 && (info
.sp_equiv_reg
== stack_pointer_rtx
7417 || !reg_set_p (info
.sp_equiv_reg
, insn
)))
7419 if (! validate_replace_rtx (stack_pointer_rtx
,
7420 plus_constant (info
.sp_equiv_reg
,
7427 else if (GET_CODE (PATTERN (insn
)) == SET
)
7428 handle_epilogue_set (PATTERN (insn
), &info
);
7429 else if (GET_CODE (PATTERN (insn
)) == PARALLEL
)
7431 for (j
= 0; j
< XVECLEN (PATTERN (insn
), 0); j
++)
7432 if (GET_CODE (XVECEXP (PATTERN (insn
), 0, j
)) == SET
)
7433 handle_epilogue_set (XVECEXP (PATTERN (insn
), 0, j
), &info
);
7438 info
.sp_equiv_reg
= info
.new_sp_equiv_reg
;
7439 info
.sp_offset
= info
.new_sp_offset
;
7444 insns
= get_insns ();
7449 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
7450 structure that contains information about what we've seen so far. We
7451 process this SET by either updating that data or by emitting one or
7455 handle_epilogue_set (set
, p
)
7459 /* First handle the case where we are setting SP. Record what it is being
7460 set from. If unknown, abort. */
7461 if (reg_set_p (stack_pointer_rtx
, set
))
7463 if (SET_DEST (set
) != stack_pointer_rtx
)
7466 if (GET_CODE (SET_SRC (set
)) == PLUS
7467 && GET_CODE (XEXP (SET_SRC (set
), 1)) == CONST_INT
)
7469 p
->new_sp_equiv_reg
= XEXP (SET_SRC (set
), 0);
7470 p
->new_sp_offset
= INTVAL (XEXP (SET_SRC (set
), 1));
7473 p
->new_sp_equiv_reg
= SET_SRC (set
), p
->new_sp_offset
= 0;
7475 /* If we are adjusting SP, we adjust from the old data. */
7476 if (p
->new_sp_equiv_reg
== stack_pointer_rtx
)
7478 p
->new_sp_equiv_reg
= p
->sp_equiv_reg
;
7479 p
->new_sp_offset
+= p
->sp_offset
;
7482 if (p
->new_sp_equiv_reg
== 0 || GET_CODE (p
->new_sp_equiv_reg
) != REG
)
7488 /* Next handle the case where we are setting SP's equivalent register.
7489 If we already have a value to set it to, abort. We could update, but
7490 there seems little point in handling that case. Note that we have
7491 to allow for the case where we are setting the register set in
7492 the previous part of a PARALLEL inside a single insn. But use the
7493 old offset for any updates within this insn. */
7494 else if (p
->new_sp_equiv_reg
!= 0 && reg_set_p (p
->new_sp_equiv_reg
, set
))
7496 if (!rtx_equal_p (p
->new_sp_equiv_reg
, SET_DEST (set
))
7497 || p
->equiv_reg_src
!= 0)
7501 = simplify_replace_rtx (SET_SRC (set
), stack_pointer_rtx
,
7502 plus_constant (p
->sp_equiv_reg
,
7506 /* Otherwise, replace any references to SP in the insn to its new value
7507 and emit the insn. */
7510 SET_SRC (set
) = simplify_replace_rtx (SET_SRC (set
), stack_pointer_rtx
,
7511 plus_constant (p
->sp_equiv_reg
,
7513 SET_DEST (set
) = simplify_replace_rtx (SET_DEST (set
), stack_pointer_rtx
,
7514 plus_constant (p
->sp_equiv_reg
,
7520 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
7526 if (p
->equiv_reg_src
!= 0)
7527 emit_move_insn (p
->sp_equiv_reg
, p
->equiv_reg_src
);
7529 p
->equiv_reg_src
= 0;
7533 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
7534 this into place with notes indicating where the prologue ends and where
7535 the epilogue begins. Update the basic block information when possible. */
7538 thread_prologue_and_epilogue_insns (f
)
7539 rtx f ATTRIBUTE_UNUSED
;
7543 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
7546 #ifdef HAVE_prologue
7547 rtx prologue_end
= NULL_RTX
;
7549 #if defined (HAVE_epilogue) || defined(HAVE_return)
7550 rtx epilogue_end
= NULL_RTX
;
7553 #ifdef HAVE_prologue
7557 seq
= gen_prologue ();
7560 /* Retain a map of the prologue insns. */
7561 record_insns (seq
, &prologue
);
7562 prologue_end
= emit_note (NULL
, NOTE_INSN_PROLOGUE_END
);
7567 /* Can't deal with multiple successors of the entry block
7568 at the moment. Function should always have at least one
7570 if (!ENTRY_BLOCK_PTR
->succ
|| ENTRY_BLOCK_PTR
->succ
->succ_next
)
7573 insert_insn_on_edge (seq
, ENTRY_BLOCK_PTR
->succ
);
7578 /* If the exit block has no non-fake predecessors, we don't need
7580 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
7581 if ((e
->flags
& EDGE_FAKE
) == 0)
7587 if (optimize
&& HAVE_return
)
7589 /* If we're allowed to generate a simple return instruction,
7590 then by definition we don't need a full epilogue. Examine
7591 the block that falls through to EXIT. If it does not
7592 contain any code, examine its predecessors and try to
7593 emit (conditional) return instructions. */
7599 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
7600 if (e
->flags
& EDGE_FALLTHRU
)
7606 /* Verify that there are no active instructions in the last block. */
7608 while (label
&& GET_CODE (label
) != CODE_LABEL
)
7610 if (active_insn_p (label
))
7612 label
= PREV_INSN (label
);
7615 if (last
->head
== label
&& GET_CODE (label
) == CODE_LABEL
)
7617 rtx epilogue_line_note
= NULL_RTX
;
7619 /* Locate the line number associated with the closing brace,
7620 if we can find one. */
7621 for (seq
= get_last_insn ();
7622 seq
&& ! active_insn_p (seq
);
7623 seq
= PREV_INSN (seq
))
7624 if (GET_CODE (seq
) == NOTE
&& NOTE_LINE_NUMBER (seq
) > 0)
7626 epilogue_line_note
= seq
;
7630 for (e
= last
->pred
; e
; e
= e_next
)
7632 basic_block bb
= e
->src
;
7635 e_next
= e
->pred_next
;
7636 if (bb
== ENTRY_BLOCK_PTR
)
7640 if ((GET_CODE (jump
) != JUMP_INSN
) || JUMP_LABEL (jump
) != label
)
7643 /* If we have an unconditional jump, we can replace that
7644 with a simple return instruction. */
7645 if (simplejump_p (jump
))
7647 emit_return_into_block (bb
, epilogue_line_note
);
7651 /* If we have a conditional jump, we can try to replace
7652 that with a conditional return instruction. */
7653 else if (condjump_p (jump
))
7657 ret
= SET_SRC (PATTERN (jump
));
7658 if (GET_CODE (XEXP (ret
, 1)) == LABEL_REF
)
7659 loc
= &XEXP (ret
, 1);
7661 loc
= &XEXP (ret
, 2);
7662 ret
= gen_rtx_RETURN (VOIDmode
);
7664 if (! validate_change (jump
, loc
, ret
, 0))
7666 if (JUMP_LABEL (jump
))
7667 LABEL_NUSES (JUMP_LABEL (jump
))--;
7669 /* If this block has only one successor, it both jumps
7670 and falls through to the fallthru block, so we can't
7672 if (bb
->succ
->succ_next
== NULL
)
7678 /* Fix up the CFG for the successful change we just made. */
7679 redirect_edge_succ (e
, EXIT_BLOCK_PTR
);
7682 /* Emit a return insn for the exit fallthru block. Whether
7683 this is still reachable will be determined later. */
7685 emit_barrier_after (last
->end
);
7686 emit_return_into_block (last
, epilogue_line_note
);
7687 epilogue_end
= last
->end
;
7688 last
->succ
->flags
&= ~EDGE_FALLTHRU
;
7693 #ifdef HAVE_epilogue
7696 /* Find the edge that falls through to EXIT. Other edges may exist
7697 due to RETURN instructions, but those don't need epilogues.
7698 There really shouldn't be a mixture -- either all should have
7699 been converted or none, however... */
7701 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
7702 if (e
->flags
& EDGE_FALLTHRU
)
7708 epilogue_end
= emit_note (NULL
, NOTE_INSN_EPILOGUE_BEG
);
7710 seq
= gen_epilogue ();
7712 #ifdef INCOMING_RETURN_ADDR_RTX
7713 /* If this function returns with the stack depressed and we can support
7714 it, massage the epilogue to actually do that. */
7715 if (TREE_CODE (TREE_TYPE (current_function_decl
)) == FUNCTION_TYPE
7716 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl
)))
7717 seq
= keep_stack_depressed (seq
);
7720 emit_jump_insn (seq
);
7722 /* Retain a map of the epilogue insns. */
7723 record_insns (seq
, &epilogue
);
7728 insert_insn_on_edge (seq
, e
);
7735 commit_edge_insertions ();
7737 #ifdef HAVE_sibcall_epilogue
7738 /* Emit sibling epilogues before any sibling call sites. */
7739 for (e
= EXIT_BLOCK_PTR
->pred
; e
; e
= e
->pred_next
)
7741 basic_block bb
= e
->src
;
7746 if (GET_CODE (insn
) != CALL_INSN
7747 || ! SIBLING_CALL_P (insn
))
7751 emit_insn (gen_sibcall_epilogue ());
7755 /* Retain a map of the epilogue insns. Used in life analysis to
7756 avoid getting rid of sibcall epilogue insns. Do this before we
7757 actually emit the sequence. */
7758 record_insns (seq
, &sibcall_epilogue
);
7760 i
= PREV_INSN (insn
);
7761 newinsn
= emit_insn_before (seq
, insn
);
7765 #ifdef HAVE_prologue
7770 /* GDB handles `break f' by setting a breakpoint on the first
7771 line note after the prologue. Which means (1) that if
7772 there are line number notes before where we inserted the
7773 prologue we should move them, and (2) we should generate a
7774 note before the end of the first basic block, if there isn't
7777 ??? This behaviour is completely broken when dealing with
7778 multiple entry functions. We simply place the note always
7779 into first basic block and let alternate entry points
7783 for (insn
= prologue_end
; insn
; insn
= prev
)
7785 prev
= PREV_INSN (insn
);
7786 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7788 /* Note that we cannot reorder the first insn in the
7789 chain, since rest_of_compilation relies on that
7790 remaining constant. */
7793 reorder_insns (insn
, insn
, prologue_end
);
7797 /* Find the last line number note in the first block. */
7798 for (insn
= ENTRY_BLOCK_PTR
->next_bb
->end
;
7799 insn
!= prologue_end
&& insn
;
7800 insn
= PREV_INSN (insn
))
7801 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7804 /* If we didn't find one, make a copy of the first line number
7808 for (insn
= next_active_insn (prologue_end
);
7810 insn
= PREV_INSN (insn
))
7811 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7813 emit_line_note_after (NOTE_SOURCE_FILE (insn
),
7814 NOTE_LINE_NUMBER (insn
),
7821 #ifdef HAVE_epilogue
7826 /* Similarly, move any line notes that appear after the epilogue.
7827 There is no need, however, to be quite so anal about the existence
7829 for (insn
= epilogue_end
; insn
; insn
= next
)
7831 next
= NEXT_INSN (insn
);
7832 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
7833 reorder_insns (insn
, insn
, PREV_INSN (epilogue_end
));
7839 /* Reposition the prologue-end and epilogue-begin notes after instruction
7840 scheduling and delayed branch scheduling. */
7843 reposition_prologue_and_epilogue_notes (f
)
7844 rtx f ATTRIBUTE_UNUSED
;
7846 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
7847 rtx insn
, last
, note
;
7850 if ((len
= VARRAY_SIZE (prologue
)) > 0)
7854 /* Scan from the beginning until we reach the last prologue insn.
7855 We apparently can't depend on basic_block_{head,end} after
7857 for (insn
= f
; insn
; insn
= NEXT_INSN (insn
))
7859 if (GET_CODE (insn
) == NOTE
)
7861 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
7864 else if (contains (insn
, prologue
))
7876 /* Find the prologue-end note if we haven't already, and
7877 move it to just after the last prologue insn. */
7880 for (note
= last
; (note
= NEXT_INSN (note
));)
7881 if (GET_CODE (note
) == NOTE
7882 && NOTE_LINE_NUMBER (note
) == NOTE_INSN_PROLOGUE_END
)
7886 next
= NEXT_INSN (note
);
7888 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
7889 if (GET_CODE (last
) == CODE_LABEL
)
7890 last
= NEXT_INSN (last
);
7891 reorder_insns (note
, note
, last
);
7895 if ((len
= VARRAY_SIZE (epilogue
)) > 0)
7899 /* Scan from the end until we reach the first epilogue insn.
7900 We apparently can't depend on basic_block_{head,end} after
7902 for (insn
= get_last_insn (); insn
; insn
= PREV_INSN (insn
))
7904 if (GET_CODE (insn
) == NOTE
)
7906 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EPILOGUE_BEG
)
7909 else if (contains (insn
, epilogue
))
7919 /* Find the epilogue-begin note if we haven't already, and
7920 move it to just before the first epilogue insn. */
7923 for (note
= insn
; (note
= PREV_INSN (note
));)
7924 if (GET_CODE (note
) == NOTE
7925 && NOTE_LINE_NUMBER (note
) == NOTE_INSN_EPILOGUE_BEG
)
7929 if (PREV_INSN (last
) != note
)
7930 reorder_insns (note
, note
, PREV_INSN (last
));
7933 #endif /* HAVE_prologue or HAVE_epilogue */
7936 /* Called once, at initialization, to initialize function.c. */
7939 init_function_once ()
7941 VARRAY_INT_INIT (prologue
, 0, "prologue");
7942 VARRAY_INT_INIT (epilogue
, 0, "epilogue");
7943 VARRAY_INT_INIT (sibcall_epilogue
, 0, "sibcall_epilogue");
7946 #include "gt-function.h"