1 /* Expands front end tree to back end RTL for GCC.
2 Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003 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. */
43 #include "coretypes.h"
54 #include "hard-reg-set.h"
55 #include "insn-config.h"
58 #include "basic-block.h"
63 #include "integrate.h"
64 #include "langhooks.h"
67 #ifndef TRAMPOLINE_ALIGNMENT
68 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
71 #ifndef LOCAL_ALIGNMENT
72 #define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
75 #ifndef STACK_ALIGNMENT_NEEDED
76 #define STACK_ALIGNMENT_NEEDED 1
79 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
81 /* Some systems use __main in a way incompatible with its use in gcc, in these
82 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
83 give the same symbol without quotes for an alternative entry point. You
84 must define both, or neither. */
86 #define NAME__MAIN "__main"
89 /* Round a value to the lowest integer less than it that is a multiple of
90 the required alignment. Avoid using division in case the value is
91 negative. Assume the alignment is a power of two. */
92 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
94 /* Similar, but round to the next highest integer that meets the
96 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
98 /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
99 during rtl generation. If they are different register numbers, this is
100 always true. It may also be true if
101 FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
102 generation. See fix_lexical_addr for details. */
104 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
105 #define NEED_SEPARATE_AP
108 /* Nonzero if function being compiled doesn't contain any calls
109 (ignoring the prologue and epilogue). This is set prior to
110 local register allocation and is valid for the remaining
112 int current_function_is_leaf;
114 /* Nonzero if function being compiled doesn't contain any instructions
115 that can throw an exception. This is set prior to final. */
117 int current_function_nothrow;
119 /* Nonzero if function being compiled doesn't modify the stack pointer
120 (ignoring the prologue and epilogue). This is only valid after
121 life_analysis has run. */
122 int current_function_sp_is_unchanging;
124 /* Nonzero if the function being compiled is a leaf function which only
125 uses leaf registers. This is valid after reload (specifically after
126 sched2) and is useful only if the port defines LEAF_REGISTERS. */
127 int current_function_uses_only_leaf_regs;
129 /* Nonzero once virtual register instantiation has been done.
130 assign_stack_local uses frame_pointer_rtx when this is nonzero.
131 calls.c:emit_library_call_value_1 uses it to set up
132 post-instantiation libcalls. */
133 int virtuals_instantiated;
135 /* Nonzero if at least one trampoline has been created. */
136 int trampolines_created;
138 /* Assign unique numbers to labels generated for profiling, debugging, etc. */
139 static GTY(()) int funcdef_no;
141 /* These variables hold pointers to functions to create and destroy
142 target specific, per-function data structures. */
143 struct machine_function * (*init_machine_status) (void);
145 /* The FUNCTION_DECL for an inline function currently being expanded. */
146 tree inline_function_decl;
148 /* The currently compiled function. */
149 struct function *cfun = 0;
151 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
152 static GTY(()) varray_type prologue;
153 static GTY(()) varray_type epilogue;
155 /* Array of INSN_UIDs to hold the INSN_UIDs for each sibcall epilogue
157 static GTY(()) varray_type sibcall_epilogue;
159 /* In order to evaluate some expressions, such as function calls returning
160 structures in memory, we need to temporarily allocate stack locations.
161 We record each allocated temporary in the following structure.
163 Associated with each temporary slot is a nesting level. When we pop up
164 one level, all temporaries associated with the previous level are freed.
165 Normally, all temporaries are freed after the execution of the statement
166 in which they were created. However, if we are inside a ({...}) grouping,
167 the result may be in a temporary and hence must be preserved. If the
168 result could be in a temporary, we preserve it if we can determine which
169 one it is in. If we cannot determine which temporary may contain the
170 result, all temporaries are preserved. A temporary is preserved by
171 pretending it was allocated at the previous nesting level.
173 Automatic variables are also assigned temporary slots, at the nesting
174 level where they are defined. They are marked a "kept" so that
175 free_temp_slots will not free them. */
177 struct temp_slot GTY(())
179 /* Points to next temporary slot. */
180 struct temp_slot *next;
181 /* The rtx to used to reference the slot. */
183 /* The rtx used to represent the address if not the address of the
184 slot above. May be an EXPR_LIST if multiple addresses exist. */
186 /* The alignment (in bits) of the slot. */
188 /* The size, in units, of the slot. */
190 /* The type of the object in the slot, or zero if it doesn't correspond
191 to a type. We use this to determine whether a slot can be reused.
192 It can be reused if objects of the type of the new slot will always
193 conflict with objects of the type of the old slot. */
195 /* The value of `sequence_rtl_expr' when this temporary is allocated. */
197 /* Nonzero if this temporary is currently in use. */
199 /* Nonzero if this temporary has its address taken. */
201 /* Nesting level at which this slot is being used. */
203 /* Nonzero if this should survive a call to free_temp_slots. */
205 /* The offset of the slot from the frame_pointer, including extra space
206 for alignment. This info is for combine_temp_slots. */
207 HOST_WIDE_INT base_offset;
208 /* The size of the slot, including extra space for alignment. This
209 info is for combine_temp_slots. */
210 HOST_WIDE_INT full_size;
213 /* This structure is used to record MEMs or pseudos used to replace VAR, any
214 SUBREGs of VAR, and any MEMs containing VAR as an address. We need to
215 maintain this list in case two operands of an insn were required to match;
216 in that case we must ensure we use the same replacement. */
218 struct fixup_replacement GTY(())
222 struct fixup_replacement *next;
225 struct insns_for_mem_entry
229 /* These are the INSNs which reference the MEM. */
233 /* Forward declarations. */
235 static rtx assign_stack_local_1 (enum machine_mode, HOST_WIDE_INT, int,
237 static struct temp_slot *find_temp_slot_from_address (rtx);
238 static void put_reg_into_stack (struct function *, rtx, tree, enum machine_mode,
239 enum machine_mode, int, unsigned int, int, htab_t);
240 static void schedule_fixup_var_refs (struct function *, rtx, tree, enum machine_mode,
242 static void fixup_var_refs (rtx, enum machine_mode, int, rtx, htab_t);
243 static struct fixup_replacement
244 *find_fixup_replacement (struct fixup_replacement **, rtx);
245 static void fixup_var_refs_insns (rtx, rtx, enum machine_mode, int, int, rtx);
246 static void fixup_var_refs_insns_with_hash (htab_t, rtx, enum machine_mode, int, rtx);
247 static void fixup_var_refs_insn (rtx, rtx, enum machine_mode, int, int, rtx);
248 static void fixup_var_refs_1 (rtx, enum machine_mode, rtx *, rtx,
249 struct fixup_replacement **, rtx);
250 static rtx fixup_memory_subreg (rtx, rtx, enum machine_mode, int);
251 static rtx walk_fixup_memory_subreg (rtx, rtx, enum machine_mode, int);
252 static rtx fixup_stack_1 (rtx, rtx);
253 static void optimize_bit_field (rtx, rtx, rtx *);
254 static void instantiate_decls (tree, int);
255 static void instantiate_decls_1 (tree, int);
256 static void instantiate_decl (rtx, HOST_WIDE_INT, int);
257 static rtx instantiate_new_reg (rtx, HOST_WIDE_INT *);
258 static int instantiate_virtual_regs_1 (rtx *, rtx, int);
259 static void delete_handlers (void);
260 static void pad_to_arg_alignment (struct args_size *, int, struct args_size *);
261 static void pad_below (struct args_size *, enum machine_mode, tree);
262 static rtx round_trampoline_addr (rtx);
263 static rtx adjust_trampoline_addr (rtx);
264 static tree *identify_blocks_1 (rtx, tree *, tree *, tree *);
265 static void reorder_blocks_0 (tree);
266 static void reorder_blocks_1 (rtx, tree, varray_type *);
267 static void reorder_fix_fragments (tree);
268 static tree blocks_nreverse (tree);
269 static int all_blocks (tree, tree *);
270 static tree *get_block_vector (tree, int *);
271 extern tree debug_find_var_in_block_tree (tree, tree);
272 /* We always define `record_insns' even if its not used so that we
273 can always export `prologue_epilogue_contains'. */
274 static void record_insns (rtx, varray_type *) ATTRIBUTE_UNUSED;
275 static int contains (rtx, varray_type);
277 static void emit_return_into_block (basic_block, rtx);
279 static void put_addressof_into_stack (rtx, htab_t);
280 static bool purge_addressof_1 (rtx *, rtx, int, int, int, htab_t);
281 static void purge_single_hard_subreg_set (rtx);
282 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
283 static rtx keep_stack_depressed (rtx);
285 static int is_addressof (rtx *, void *);
286 static hashval_t insns_for_mem_hash (const void *);
287 static int insns_for_mem_comp (const void *, const void *);
288 static int insns_for_mem_walk (rtx *, void *);
289 static void compute_insns_for_mem (rtx, rtx, htab_t);
290 static void prepare_function_start (tree);
291 static void do_clobber_return_reg (rtx, void *);
292 static void do_use_return_reg (rtx, void *);
293 static void instantiate_virtual_regs_lossage (rtx);
294 static tree split_complex_args (tree);
295 static void set_insn_locators (rtx, int) ATTRIBUTE_UNUSED;
297 /* Pointer to chain of `struct function' for containing functions. */
298 static GTY(()) struct function *outer_function_chain;
300 /* List of insns that were postponed by purge_addressof_1. */
301 static rtx postponed_insns;
303 /* Given a function decl for a containing function,
304 return the `struct function' for it. */
307 find_function_data (tree decl)
311 for (p = outer_function_chain; p; p = p->outer)
318 /* Save the current context for compilation of a nested function.
319 This is called from language-specific code. The caller should use
320 the enter_nested langhook to save any language-specific state,
321 since this function knows only about language-independent
325 push_function_context_to (tree context)
331 if (context == current_function_decl)
332 cfun->contains_functions = 1;
335 struct function *containing = find_function_data (context);
336 containing->contains_functions = 1;
341 init_dummy_function_start ();
344 p->outer = outer_function_chain;
345 outer_function_chain = p;
346 p->fixup_var_refs_queue = 0;
348 (*lang_hooks.function.enter_nested) (p);
354 push_function_context (void)
356 push_function_context_to (current_function_decl);
359 /* Restore the last saved context, at the end of a nested function.
360 This function is called from language-specific code. */
363 pop_function_context_from (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 (void)
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 (struct function *f)
423 /* f->expr->forced_labels is used by code generation. */
424 /* f->emit->regno_reg_rtx is used by code generation. */
425 /* f->varasm is used by code generation. */
426 /* f->eh->eh_return_stub_label is used by code generation. */
428 (*lang_hooks.function.final) (f);
432 /* Clear out all parts of the state in F that can safely be discarded
433 after the function has been compiled, to let garbage collection
434 reclaim the memory. */
437 free_after_compilation (struct function *f)
445 f->x_temp_slots = NULL;
446 f->arg_offset_rtx = NULL;
447 f->return_rtx = NULL;
448 f->internal_arg_pointer = NULL;
449 f->x_nonlocal_labels = NULL;
450 f->x_nonlocal_goto_handler_slots = NULL;
451 f->x_nonlocal_goto_handler_labels = NULL;
452 f->x_nonlocal_goto_stack_level = NULL;
453 f->x_cleanup_label = NULL;
454 f->x_return_label = NULL;
455 f->computed_goto_common_label = NULL;
456 f->computed_goto_common_reg = 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 (struct function *f)
486 #ifdef FRAME_GROWS_DOWNWARD
487 return -f->x_frame_offset;
489 return f->x_frame_offset;
493 /* Return size needed for stack frame based on slots so far allocated.
494 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
495 the caller may have to do that. */
497 get_frame_size (void)
499 return get_func_frame_size (cfun);
502 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
503 with machine mode MODE.
505 ALIGN controls the amount of alignment for the address of the slot:
506 0 means according to MODE,
507 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
508 positive specifies alignment boundary in bits.
510 We do not round to stack_boundary here.
512 FUNCTION specifies the function to allocate in. */
515 assign_stack_local_1 (enum machine_mode mode, HOST_WIDE_INT size, int align,
516 struct function *function)
519 int bigend_correction = 0;
521 int frame_off, frame_alignment, frame_phase;
528 alignment = BIGGEST_ALIGNMENT;
530 alignment = GET_MODE_ALIGNMENT (mode);
532 /* Allow the target to (possibly) increase the alignment of this
534 type = (*lang_hooks.types.type_for_mode) (mode, 0);
536 alignment = LOCAL_ALIGNMENT (type, alignment);
538 alignment /= BITS_PER_UNIT;
540 else if (align == -1)
542 alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
543 size = CEIL_ROUND (size, alignment);
546 alignment = align / BITS_PER_UNIT;
548 #ifdef FRAME_GROWS_DOWNWARD
549 function->x_frame_offset -= size;
552 /* Ignore alignment we can't do with expected alignment of the boundary. */
553 if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY)
554 alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
556 if (function->stack_alignment_needed < alignment * BITS_PER_UNIT)
557 function->stack_alignment_needed = alignment * BITS_PER_UNIT;
559 /* Calculate how many bytes the start of local variables is off from
561 frame_alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
562 frame_off = STARTING_FRAME_OFFSET % frame_alignment;
563 frame_phase = frame_off ? frame_alignment - frame_off : 0;
565 /* Round the frame offset to the specified alignment. The default is
566 to always honor requests to align the stack but a port may choose to
567 do its own stack alignment by defining STACK_ALIGNMENT_NEEDED. */
568 if (STACK_ALIGNMENT_NEEDED
572 /* We must be careful here, since FRAME_OFFSET might be negative and
573 division with a negative dividend isn't as well defined as we might
574 like. So we instead assume that ALIGNMENT is a power of two and
575 use logical operations which are unambiguous. */
576 #ifdef FRAME_GROWS_DOWNWARD
577 function->x_frame_offset
578 = (FLOOR_ROUND (function->x_frame_offset - frame_phase, alignment)
581 function->x_frame_offset
582 = (CEIL_ROUND (function->x_frame_offset - frame_phase, alignment)
587 /* On a big-endian machine, if we are allocating more space than we will use,
588 use the least significant bytes of those that are allocated. */
589 if (BYTES_BIG_ENDIAN && mode != BLKmode)
590 bigend_correction = size - GET_MODE_SIZE (mode);
592 /* If we have already instantiated virtual registers, return the actual
593 address relative to the frame pointer. */
594 if (function == cfun && virtuals_instantiated)
595 addr = plus_constant (frame_pointer_rtx,
597 (frame_offset + bigend_correction
598 + STARTING_FRAME_OFFSET, Pmode));
600 addr = plus_constant (virtual_stack_vars_rtx,
602 (function->x_frame_offset + bigend_correction,
605 #ifndef FRAME_GROWS_DOWNWARD
606 function->x_frame_offset += size;
609 x = gen_rtx_MEM (mode, addr);
611 function->x_stack_slot_list
612 = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list);
617 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
621 assign_stack_local (enum machine_mode mode, HOST_WIDE_INT size, int align)
623 return assign_stack_local_1 (mode, size, align, cfun);
626 /* Allocate a temporary stack slot and record it for possible later
629 MODE is the machine mode to be given to the returned rtx.
631 SIZE is the size in units of the space required. We do no rounding here
632 since assign_stack_local will do any required rounding.
634 KEEP is 1 if this slot is to be retained after a call to
635 free_temp_slots. Automatic variables for a block are allocated
636 with this flag. KEEP is 2 if we allocate a longer term temporary,
637 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
638 if we are to allocate something at an inner level to be treated as
639 a variable in the block (e.g., a SAVE_EXPR).
641 TYPE is the type that will be used for the stack slot. */
644 assign_stack_temp_for_type (enum machine_mode mode, HOST_WIDE_INT size, int keep,
648 struct temp_slot *p, *best_p = 0;
651 /* If SIZE is -1 it means that somebody tried to allocate a temporary
652 of a variable size. */
657 align = BIGGEST_ALIGNMENT;
659 align = GET_MODE_ALIGNMENT (mode);
662 type = (*lang_hooks.types.type_for_mode) (mode, 0);
665 align = LOCAL_ALIGNMENT (type, align);
667 /* Try to find an available, already-allocated temporary of the proper
668 mode which meets the size and alignment requirements. Choose the
669 smallest one with the closest alignment. */
670 for (p = temp_slots; p; p = p->next)
671 if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode
673 && objects_must_conflict_p (p->type, type)
674 && (best_p == 0 || best_p->size > p->size
675 || (best_p->size == p->size && best_p->align > p->align)))
677 if (p->align == align && p->size == size)
685 /* Make our best, if any, the one to use. */
688 /* If there are enough aligned bytes left over, make them into a new
689 temp_slot so that the extra bytes don't get wasted. Do this only
690 for BLKmode slots, so that we can be sure of the alignment. */
691 if (GET_MODE (best_p->slot) == BLKmode)
693 int alignment = best_p->align / BITS_PER_UNIT;
694 HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment);
696 if (best_p->size - rounded_size >= alignment)
698 p = ggc_alloc (sizeof (struct temp_slot));
699 p->in_use = p->addr_taken = 0;
700 p->size = best_p->size - rounded_size;
701 p->base_offset = best_p->base_offset + rounded_size;
702 p->full_size = best_p->full_size - rounded_size;
703 p->slot = gen_rtx_MEM (BLKmode,
704 plus_constant (XEXP (best_p->slot, 0),
706 p->align = best_p->align;
709 p->type = best_p->type;
710 p->next = temp_slots;
713 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot,
716 best_p->size = rounded_size;
717 best_p->full_size = rounded_size;
724 /* If we still didn't find one, make a new temporary. */
727 HOST_WIDE_INT frame_offset_old = frame_offset;
729 p = ggc_alloc (sizeof (struct temp_slot));
731 /* We are passing an explicit alignment request to assign_stack_local.
732 One side effect of that is assign_stack_local will not round SIZE
733 to ensure the frame offset remains suitably aligned.
735 So for requests which depended on the rounding of SIZE, we go ahead
736 and round it now. We also make sure ALIGNMENT is at least
737 BIGGEST_ALIGNMENT. */
738 if (mode == BLKmode && align < BIGGEST_ALIGNMENT)
740 p->slot = assign_stack_local (mode,
742 ? CEIL_ROUND (size, (int) align / BITS_PER_UNIT)
748 /* The following slot size computation is necessary because we don't
749 know the actual size of the temporary slot until assign_stack_local
750 has performed all the frame alignment and size rounding for the
751 requested temporary. Note that extra space added for alignment
752 can be either above or below this stack slot depending on which
753 way the frame grows. We include the extra space if and only if it
754 is above this slot. */
755 #ifdef FRAME_GROWS_DOWNWARD
756 p->size = frame_offset_old - frame_offset;
761 /* Now define the fields used by combine_temp_slots. */
762 #ifdef FRAME_GROWS_DOWNWARD
763 p->base_offset = frame_offset;
764 p->full_size = frame_offset_old - frame_offset;
766 p->base_offset = frame_offset_old;
767 p->full_size = frame_offset - frame_offset_old;
770 p->next = temp_slots;
776 p->rtl_expr = seq_rtl_expr;
781 p->level = target_temp_slot_level;
786 p->level = var_temp_slot_level;
791 p->level = temp_slot_level;
796 /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
797 slot = gen_rtx_MEM (mode, XEXP (p->slot, 0));
798 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, slot, stack_slot_list);
800 /* If we know the alias set for the memory that will be used, use
801 it. If there's no TYPE, then we don't know anything about the
802 alias set for the memory. */
803 set_mem_alias_set (slot, type ? get_alias_set (type) : 0);
804 set_mem_align (slot, align);
806 /* If a type is specified, set the relevant flags. */
809 RTX_UNCHANGING_P (slot) = (lang_hooks.honor_readonly
810 && TYPE_READONLY (type));
811 MEM_VOLATILE_P (slot) = TYPE_VOLATILE (type);
812 MEM_SET_IN_STRUCT_P (slot, AGGREGATE_TYPE_P (type));
818 /* Allocate a temporary stack slot and record it for possible later
819 reuse. First three arguments are same as in preceding function. */
822 assign_stack_temp (enum machine_mode mode, HOST_WIDE_INT size, int keep)
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 (tree type_or_decl, int keep, int memory_required,
839 int dont_promote ATTRIBUTE_UNUSED)
842 enum machine_mode mode;
843 #ifndef PROMOTE_FOR_CALL_ONLY
847 if (DECL_P (type_or_decl))
848 decl = type_or_decl, type = TREE_TYPE (decl);
850 decl = NULL, type = type_or_decl;
852 mode = TYPE_MODE (type);
853 #ifndef PROMOTE_FOR_CALL_ONLY
854 unsignedp = TREE_UNSIGNED (type);
857 if (mode == BLKmode || memory_required)
859 HOST_WIDE_INT size = int_size_in_bytes (type);
862 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
863 problems with allocating the stack space. */
867 /* Unfortunately, we don't yet know how to allocate variable-sized
868 temporaries. However, sometimes we have a fixed upper limit on
869 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
870 instead. This is the case for Chill variable-sized strings. */
871 if (size == -1 && TREE_CODE (type) == ARRAY_TYPE
872 && TYPE_ARRAY_MAX_SIZE (type) != NULL_TREE
873 && host_integerp (TYPE_ARRAY_MAX_SIZE (type), 1))
874 size = tree_low_cst (TYPE_ARRAY_MAX_SIZE (type), 1);
876 /* The size of the temporary may be too large to fit into an integer. */
877 /* ??? Not sure this should happen except for user silliness, so limit
878 this to things that aren't compiler-generated temporaries. The
879 rest of the time we'll abort in assign_stack_temp_for_type. */
880 if (decl && size == -1
881 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST)
883 error ("%Jsize of variable '%D' is too large", decl, decl);
887 tmp = assign_stack_temp_for_type (mode, size, keep, type);
891 #ifndef PROMOTE_FOR_CALL_ONLY
893 mode = promote_mode (type, mode, &unsignedp, 0);
896 return gen_reg_rtx (mode);
899 /* Combine temporary stack slots which are adjacent on the stack.
901 This allows for better use of already allocated stack space. This is only
902 done for BLKmode slots because we can be sure that we won't have alignment
903 problems in this case. */
906 combine_temp_slots (void)
908 struct temp_slot *p, *q;
909 struct temp_slot *prev_p, *prev_q;
912 /* We can't combine slots, because the information about which slot
913 is in which alias set will be lost. */
914 if (flag_strict_aliasing)
917 /* If there are a lot of temp slots, don't do anything unless
918 high levels of optimization. */
919 if (! flag_expensive_optimizations)
920 for (p = temp_slots, num_slots = 0; p; p = p->next, num_slots++)
921 if (num_slots > 100 || (num_slots > 10 && optimize == 0))
924 for (p = temp_slots, prev_p = 0; p; p = prev_p ? prev_p->next : temp_slots)
928 if (! p->in_use && GET_MODE (p->slot) == BLKmode)
929 for (q = p->next, prev_q = p; q; q = prev_q->next)
932 if (! q->in_use && GET_MODE (q->slot) == BLKmode)
934 if (p->base_offset + p->full_size == q->base_offset)
936 /* Q comes after P; combine Q into P. */
938 p->full_size += q->full_size;
941 else if (q->base_offset + q->full_size == p->base_offset)
943 /* P comes after Q; combine P into Q. */
945 q->full_size += p->full_size;
950 /* Either delete Q or advance past it. */
952 prev_q->next = q->next;
956 /* Either delete P or advance past it. */
960 prev_p->next = p->next;
962 temp_slots = p->next;
969 /* Find the temp slot corresponding to the object at address X. */
971 static struct temp_slot *
972 find_temp_slot_from_address (rtx x)
977 for (p = temp_slots; p; p = p->next)
982 else if (XEXP (p->slot, 0) == x
984 || (GET_CODE (x) == PLUS
985 && XEXP (x, 0) == virtual_stack_vars_rtx
986 && GET_CODE (XEXP (x, 1)) == CONST_INT
987 && INTVAL (XEXP (x, 1)) >= p->base_offset
988 && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size))
991 else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST)
992 for (next = p->address; next; next = XEXP (next, 1))
993 if (XEXP (next, 0) == x)
997 /* If we have a sum involving a register, see if it points to a temp
999 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 0)) == REG
1000 && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
1002 else if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == REG
1003 && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
1009 /* Indicate that NEW is an alternate way of referring to the temp slot
1010 that previously was known by OLD. */
1013 update_temp_slot_address (rtx old, rtx new)
1015 struct temp_slot *p;
1017 if (rtx_equal_p (old, new))
1020 p = find_temp_slot_from_address (old);
1022 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
1023 is a register, see if one operand of the PLUS is a temporary
1024 location. If so, NEW points into it. Otherwise, if both OLD and
1025 NEW are a PLUS and if there is a register in common between them.
1026 If so, try a recursive call on those values. */
1029 if (GET_CODE (old) != PLUS)
1032 if (GET_CODE (new) == REG)
1034 update_temp_slot_address (XEXP (old, 0), new);
1035 update_temp_slot_address (XEXP (old, 1), new);
1038 else if (GET_CODE (new) != PLUS)
1041 if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0)))
1042 update_temp_slot_address (XEXP (old, 1), XEXP (new, 1));
1043 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0)))
1044 update_temp_slot_address (XEXP (old, 0), XEXP (new, 1));
1045 else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1)))
1046 update_temp_slot_address (XEXP (old, 1), XEXP (new, 0));
1047 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1)))
1048 update_temp_slot_address (XEXP (old, 0), XEXP (new, 0));
1053 /* Otherwise add an alias for the temp's address. */
1054 else if (p->address == 0)
1058 if (GET_CODE (p->address) != EXPR_LIST)
1059 p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX);
1061 p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address);
1065 /* If X could be a reference to a temporary slot, mark the fact that its
1066 address was taken. */
1069 mark_temp_addr_taken (rtx x)
1071 struct temp_slot *p;
1076 /* If X is not in memory or is at a constant address, it cannot be in
1077 a temporary slot. */
1078 if (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1081 p = find_temp_slot_from_address (XEXP (x, 0));
1086 /* If X could be a reference to a temporary slot, mark that slot as
1087 belonging to the to one level higher than the current level. If X
1088 matched one of our slots, just mark that one. Otherwise, we can't
1089 easily predict which it is, so upgrade all of them. Kept slots
1090 need not be touched.
1092 This is called when an ({...}) construct occurs and a statement
1093 returns a value in memory. */
1096 preserve_temp_slots (rtx x)
1098 struct temp_slot *p = 0;
1100 /* If there is no result, we still might have some objects whose address
1101 were taken, so we need to make sure they stay around. */
1104 for (p = temp_slots; p; p = p->next)
1105 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1111 /* If X is a register that is being used as a pointer, see if we have
1112 a temporary slot we know it points to. To be consistent with
1113 the code below, we really should preserve all non-kept slots
1114 if we can't find a match, but that seems to be much too costly. */
1115 if (GET_CODE (x) == REG && REG_POINTER (x))
1116 p = find_temp_slot_from_address (x);
1118 /* If X is not in memory or is at a constant address, it cannot be in
1119 a temporary slot, but it can contain something whose address was
1121 if (p == 0 && (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0))))
1123 for (p = temp_slots; p; p = p->next)
1124 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1130 /* First see if we can find a match. */
1132 p = find_temp_slot_from_address (XEXP (x, 0));
1136 /* Move everything at our level whose address was taken to our new
1137 level in case we used its address. */
1138 struct temp_slot *q;
1140 if (p->level == temp_slot_level)
1142 for (q = temp_slots; q; q = q->next)
1143 if (q != p && q->addr_taken && q->level == p->level)
1152 /* Otherwise, preserve all non-kept slots at this level. */
1153 for (p = temp_slots; p; p = p->next)
1154 if (p->in_use && p->level == temp_slot_level && ! p->keep)
1158 /* X is the result of an RTL_EXPR. If it is a temporary slot associated
1159 with that RTL_EXPR, promote it into a temporary slot at the present
1160 level so it will not be freed when we free slots made in the
1164 preserve_rtl_expr_result (rtx x)
1166 struct temp_slot *p;
1168 /* If X is not in memory or is at a constant address, it cannot be in
1169 a temporary slot. */
1170 if (x == 0 || GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1173 /* If we can find a match, move it to our level unless it is already at
1175 p = find_temp_slot_from_address (XEXP (x, 0));
1178 p->level = MIN (p->level, temp_slot_level);
1185 /* Free all temporaries used so far. This is normally called at the end
1186 of generating code for a statement. Don't free any temporaries
1187 currently in use for an RTL_EXPR that hasn't yet been emitted.
1188 We could eventually do better than this since it can be reused while
1189 generating the same RTL_EXPR, but this is complex and probably not
1193 free_temp_slots (void)
1195 struct temp_slot *p;
1197 for (p = temp_slots; p; p = p->next)
1198 if (p->in_use && p->level == temp_slot_level && ! p->keep
1199 && p->rtl_expr == 0)
1202 combine_temp_slots ();
1205 /* Free all temporary slots used in T, an RTL_EXPR node. */
1208 free_temps_for_rtl_expr (tree t)
1210 struct temp_slot *p;
1212 for (p = temp_slots; p; p = p->next)
1213 if (p->rtl_expr == t)
1215 /* If this slot is below the current TEMP_SLOT_LEVEL, then it
1216 needs to be preserved. This can happen if a temporary in
1217 the RTL_EXPR was addressed; preserve_temp_slots will move
1218 the temporary into a higher level. */
1219 if (temp_slot_level <= p->level)
1222 p->rtl_expr = NULL_TREE;
1225 combine_temp_slots ();
1228 /* Mark all temporaries ever allocated in this function as not suitable
1229 for reuse until the current level is exited. */
1232 mark_all_temps_used (void)
1234 struct temp_slot *p;
1236 for (p = temp_slots; p; p = p->next)
1238 p->in_use = p->keep = 1;
1239 p->level = MIN (p->level, temp_slot_level);
1243 /* Push deeper into the nesting level for stack temporaries. */
1246 push_temp_slots (void)
1251 /* Pop a temporary nesting level. All slots in use in the current level
1255 pop_temp_slots (void)
1257 struct temp_slot *p;
1259 for (p = temp_slots; p; p = p->next)
1260 if (p->in_use && p->level == temp_slot_level && p->rtl_expr == 0)
1263 combine_temp_slots ();
1268 /* Initialize temporary slots. */
1271 init_temp_slots (void)
1273 /* We have not allocated any temporaries yet. */
1275 temp_slot_level = 0;
1276 var_temp_slot_level = 0;
1277 target_temp_slot_level = 0;
1280 /* Retroactively move an auto variable from a register to a stack
1281 slot. This is done when an address-reference to the variable is
1282 seen. If RESCAN is true, all previously emitted instructions are
1283 examined and modified to handle the fact that DECL is now
1287 put_var_into_stack (tree decl, int rescan)
1290 enum machine_mode promoted_mode, decl_mode;
1291 struct function *function = 0;
1293 int can_use_addressof;
1294 int volatilep = TREE_CODE (decl) != SAVE_EXPR && TREE_THIS_VOLATILE (decl);
1295 int usedp = (TREE_USED (decl)
1296 || (TREE_CODE (decl) != SAVE_EXPR && DECL_INITIAL (decl) != 0));
1298 context = decl_function_context (decl);
1300 /* Get the current rtl used for this object and its original mode. */
1301 reg = (TREE_CODE (decl) == SAVE_EXPR
1302 ? SAVE_EXPR_RTL (decl)
1303 : DECL_RTL_IF_SET (decl));
1305 /* No need to do anything if decl has no rtx yet
1306 since in that case caller is setting TREE_ADDRESSABLE
1307 and a stack slot will be assigned when the rtl is made. */
1311 /* Get the declared mode for this object. */
1312 decl_mode = (TREE_CODE (decl) == SAVE_EXPR ? TYPE_MODE (TREE_TYPE (decl))
1313 : DECL_MODE (decl));
1314 /* Get the mode it's actually stored in. */
1315 promoted_mode = GET_MODE (reg);
1317 /* If this variable comes from an outer function, find that
1318 function's saved context. Don't use find_function_data here,
1319 because it might not be in any active function.
1320 FIXME: Is that really supposed to happen?
1321 It does in ObjC at least. */
1322 if (context != current_function_decl && context != inline_function_decl)
1323 for (function = outer_function_chain; function; function = function->outer)
1324 if (function->decl == context)
1327 /* If this is a variable-size object with a pseudo to address it,
1328 put that pseudo into the stack, if the var is nonlocal. */
1329 if (TREE_CODE (decl) != SAVE_EXPR && DECL_NONLOCAL (decl)
1330 && GET_CODE (reg) == MEM
1331 && GET_CODE (XEXP (reg, 0)) == REG
1332 && REGNO (XEXP (reg, 0)) > LAST_VIRTUAL_REGISTER)
1334 reg = XEXP (reg, 0);
1335 decl_mode = promoted_mode = GET_MODE (reg);
1341 /* FIXME make it work for promoted modes too */
1342 && decl_mode == promoted_mode
1343 #ifdef NON_SAVING_SETJMP
1344 && ! (NON_SAVING_SETJMP && current_function_calls_setjmp)
1348 /* If we can't use ADDRESSOF, make sure we see through one we already
1350 if (! can_use_addressof && GET_CODE (reg) == MEM
1351 && GET_CODE (XEXP (reg, 0)) == ADDRESSOF)
1352 reg = XEXP (XEXP (reg, 0), 0);
1354 /* Now we should have a value that resides in one or more pseudo regs. */
1356 if (GET_CODE (reg) == REG)
1358 /* If this variable lives in the current function and we don't need
1359 to put things in the stack for the sake of setjmp, try to keep it
1360 in a register until we know we actually need the address. */
1361 if (can_use_addressof)
1362 gen_mem_addressof (reg, decl, rescan);
1364 put_reg_into_stack (function, reg, TREE_TYPE (decl), promoted_mode,
1365 decl_mode, volatilep, 0, usedp, 0);
1367 else if (GET_CODE (reg) == CONCAT)
1369 /* A CONCAT contains two pseudos; put them both in the stack.
1370 We do it so they end up consecutive.
1371 We fixup references to the parts only after we fixup references
1372 to the whole CONCAT, lest we do double fixups for the latter
1374 enum machine_mode part_mode = GET_MODE (XEXP (reg, 0));
1375 tree part_type = (*lang_hooks.types.type_for_mode) (part_mode, 0);
1376 rtx lopart = XEXP (reg, 0);
1377 rtx hipart = XEXP (reg, 1);
1378 #ifdef FRAME_GROWS_DOWNWARD
1379 /* Since part 0 should have a lower address, do it second. */
1380 put_reg_into_stack (function, hipart, part_type, part_mode,
1381 part_mode, volatilep, 0, 0, 0);
1382 put_reg_into_stack (function, lopart, part_type, part_mode,
1383 part_mode, volatilep, 0, 0, 0);
1385 put_reg_into_stack (function, lopart, part_type, part_mode,
1386 part_mode, volatilep, 0, 0, 0);
1387 put_reg_into_stack (function, hipart, part_type, part_mode,
1388 part_mode, volatilep, 0, 0, 0);
1391 /* Change the CONCAT into a combined MEM for both parts. */
1392 PUT_CODE (reg, MEM);
1393 MEM_ATTRS (reg) = 0;
1395 /* set_mem_attributes uses DECL_RTL to avoid re-generating of
1396 already computed alias sets. Here we want to re-generate. */
1398 SET_DECL_RTL (decl, NULL);
1399 set_mem_attributes (reg, decl, 1);
1401 SET_DECL_RTL (decl, reg);
1403 /* The two parts are in memory order already.
1404 Use the lower parts address as ours. */
1405 XEXP (reg, 0) = XEXP (XEXP (reg, 0), 0);
1406 /* Prevent sharing of rtl that might lose. */
1407 if (GET_CODE (XEXP (reg, 0)) == PLUS)
1408 XEXP (reg, 0) = copy_rtx (XEXP (reg, 0));
1409 if (usedp && rescan)
1411 schedule_fixup_var_refs (function, reg, TREE_TYPE (decl),
1413 schedule_fixup_var_refs (function, lopart, part_type, part_mode, 0);
1414 schedule_fixup_var_refs (function, hipart, part_type, part_mode, 0);
1421 /* Subroutine of put_var_into_stack. This puts a single pseudo reg REG
1422 into the stack frame of FUNCTION (0 means the current function).
1423 DECL_MODE is the machine mode of the user-level data type.
1424 PROMOTED_MODE is the machine mode of the register.
1425 VOLATILE_P is nonzero if this is for a "volatile" decl.
1426 USED_P is nonzero if this reg might have already been used in an insn. */
1429 put_reg_into_stack (struct function *function, rtx reg, tree type,
1430 enum machine_mode promoted_mode, enum machine_mode decl_mode,
1431 int volatile_p, unsigned int original_regno, int used_p, htab_t ht)
1433 struct function *func = function ? function : cfun;
1435 unsigned int regno = original_regno;
1438 regno = REGNO (reg);
1440 if (regno < func->x_max_parm_reg)
1441 new = func->x_parm_reg_stack_loc[regno];
1444 new = assign_stack_local_1 (decl_mode, GET_MODE_SIZE (decl_mode), 0, func);
1446 PUT_CODE (reg, MEM);
1447 PUT_MODE (reg, decl_mode);
1448 XEXP (reg, 0) = XEXP (new, 0);
1449 MEM_ATTRS (reg) = 0;
1450 /* `volatil' bit means one thing for MEMs, another entirely for REGs. */
1451 MEM_VOLATILE_P (reg) = volatile_p;
1453 /* If this is a memory ref that contains aggregate components,
1454 mark it as such for cse and loop optimize. If we are reusing a
1455 previously generated stack slot, then we need to copy the bit in
1456 case it was set for other reasons. For instance, it is set for
1457 __builtin_va_alist. */
1460 MEM_SET_IN_STRUCT_P (reg,
1461 AGGREGATE_TYPE_P (type) || MEM_IN_STRUCT_P (new));
1462 set_mem_alias_set (reg, get_alias_set (type));
1466 schedule_fixup_var_refs (function, reg, type, promoted_mode, ht);
1469 /* Make sure that all refs to the variable, previously made
1470 when it was a register, are fixed up to be valid again.
1471 See function above for meaning of arguments. */
1474 schedule_fixup_var_refs (struct function *function, rtx reg, tree type,
1475 enum machine_mode promoted_mode, htab_t ht)
1477 int unsigned_p = type ? TREE_UNSIGNED (type) : 0;
1481 struct var_refs_queue *temp;
1483 temp = ggc_alloc (sizeof (struct var_refs_queue));
1484 temp->modified = reg;
1485 temp->promoted_mode = promoted_mode;
1486 temp->unsignedp = unsigned_p;
1487 temp->next = function->fixup_var_refs_queue;
1488 function->fixup_var_refs_queue = temp;
1491 /* Variable is local; fix it up now. */
1492 fixup_var_refs (reg, promoted_mode, unsigned_p, reg, ht);
1496 fixup_var_refs (rtx var, enum machine_mode promoted_mode, int unsignedp,
1497 rtx may_share, htab_t ht)
1500 rtx first_insn = get_insns ();
1501 struct sequence_stack *stack = seq_stack;
1502 tree rtl_exps = rtl_expr_chain;
1504 /* If there's a hash table, it must record all uses of VAR. */
1509 fixup_var_refs_insns_with_hash (ht, var, promoted_mode, unsignedp,
1514 fixup_var_refs_insns (first_insn, var, promoted_mode, unsignedp,
1515 stack == 0, may_share);
1517 /* Scan all pending sequences too. */
1518 for (; stack; stack = stack->next)
1520 push_to_full_sequence (stack->first, stack->last);
1521 fixup_var_refs_insns (stack->first, var, promoted_mode, unsignedp,
1522 stack->next != 0, may_share);
1523 /* Update remembered end of sequence
1524 in case we added an insn at the end. */
1525 stack->last = get_last_insn ();
1529 /* Scan all waiting RTL_EXPRs too. */
1530 for (pending = rtl_exps; pending; pending = TREE_CHAIN (pending))
1532 rtx seq = RTL_EXPR_SEQUENCE (TREE_VALUE (pending));
1533 if (seq != const0_rtx && seq != 0)
1535 push_to_sequence (seq);
1536 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0,
1543 /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is
1544 some part of an insn. Return a struct fixup_replacement whose OLD
1545 value is equal to X. Allocate a new structure if no such entry exists. */
1547 static struct fixup_replacement *
1548 find_fixup_replacement (struct fixup_replacement **replacements, rtx x)
1550 struct fixup_replacement *p;
1552 /* See if we have already replaced this. */
1553 for (p = *replacements; p != 0 && ! rtx_equal_p (p->old, x); p = p->next)
1558 p = xmalloc (sizeof (struct fixup_replacement));
1561 p->next = *replacements;
1568 /* Scan the insn-chain starting with INSN for refs to VAR and fix them
1569 up. TOPLEVEL is nonzero if this chain is the main chain of insns
1570 for the current function. MAY_SHARE is either a MEM that is not
1571 to be unshared or a list of them. */
1574 fixup_var_refs_insns (rtx insn, rtx var, enum machine_mode promoted_mode,
1575 int unsignedp, int toplevel, rtx may_share)
1579 /* fixup_var_refs_insn might modify insn, so save its next
1581 rtx next = NEXT_INSN (insn);
1583 /* CALL_PLACEHOLDERs are special; we have to switch into each of
1584 the three sequences they (potentially) contain, and process
1585 them recursively. The CALL_INSN itself is not interesting. */
1587 if (GET_CODE (insn) == CALL_INSN
1588 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1592 /* Look at the Normal call, sibling call and tail recursion
1593 sequences attached to the CALL_PLACEHOLDER. */
1594 for (i = 0; i < 3; i++)
1596 rtx seq = XEXP (PATTERN (insn), i);
1599 push_to_sequence (seq);
1600 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0,
1602 XEXP (PATTERN (insn), i) = get_insns ();
1608 else if (INSN_P (insn))
1609 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, toplevel,
1616 /* Look up the insns which reference VAR in HT and fix them up. Other
1617 arguments are the same as fixup_var_refs_insns.
1619 N.B. No need for special processing of CALL_PLACEHOLDERs here,
1620 because the hash table will point straight to the interesting insn
1621 (inside the CALL_PLACEHOLDER). */
1624 fixup_var_refs_insns_with_hash (htab_t ht, rtx var, enum machine_mode promoted_mode,
1625 int unsignedp, rtx may_share)
1627 struct insns_for_mem_entry tmp;
1628 struct insns_for_mem_entry *ime;
1632 ime = htab_find (ht, &tmp);
1633 for (insn_list = ime->insns; insn_list != 0; insn_list = XEXP (insn_list, 1))
1634 if (INSN_P (XEXP (insn_list, 0)))
1635 fixup_var_refs_insn (XEXP (insn_list, 0), var, promoted_mode,
1636 unsignedp, 1, may_share);
1640 /* Per-insn processing by fixup_var_refs_insns(_with_hash). INSN is
1641 the insn under examination, VAR is the variable to fix up
1642 references to, PROMOTED_MODE and UNSIGNEDP describe VAR, and
1643 TOPLEVEL is nonzero if this is the main insn chain for this
1647 fixup_var_refs_insn (rtx insn, rtx var, enum machine_mode promoted_mode,
1648 int unsignedp, int toplevel, rtx no_share)
1651 rtx set, prev, prev_set;
1654 /* Remember the notes in case we delete the insn. */
1655 note = REG_NOTES (insn);
1657 /* If this is a CLOBBER of VAR, delete it.
1659 If it has a REG_LIBCALL note, delete the REG_LIBCALL
1660 and REG_RETVAL notes too. */
1661 if (GET_CODE (PATTERN (insn)) == CLOBBER
1662 && (XEXP (PATTERN (insn), 0) == var
1663 || (GET_CODE (XEXP (PATTERN (insn), 0)) == CONCAT
1664 && (XEXP (XEXP (PATTERN (insn), 0), 0) == var
1665 || XEXP (XEXP (PATTERN (insn), 0), 1) == var))))
1667 if ((note = find_reg_note (insn, REG_LIBCALL, NULL_RTX)) != 0)
1668 /* The REG_LIBCALL note will go away since we are going to
1669 turn INSN into a NOTE, so just delete the
1670 corresponding REG_RETVAL note. */
1671 remove_note (XEXP (note, 0),
1672 find_reg_note (XEXP (note, 0), REG_RETVAL,
1678 /* The insn to load VAR from a home in the arglist
1679 is now a no-op. When we see it, just delete it.
1680 Similarly if this is storing VAR from a register from which
1681 it was loaded in the previous insn. This will occur
1682 when an ADDRESSOF was made for an arglist slot. */
1684 && (set = single_set (insn)) != 0
1685 && SET_DEST (set) == var
1686 /* If this represents the result of an insn group,
1687 don't delete the insn. */
1688 && find_reg_note (insn, REG_RETVAL, NULL_RTX) == 0
1689 && (rtx_equal_p (SET_SRC (set), var)
1690 || (GET_CODE (SET_SRC (set)) == REG
1691 && (prev = prev_nonnote_insn (insn)) != 0
1692 && (prev_set = single_set (prev)) != 0
1693 && SET_DEST (prev_set) == SET_SRC (set)
1694 && rtx_equal_p (SET_SRC (prev_set), var))))
1700 struct fixup_replacement *replacements = 0;
1701 rtx next_insn = NEXT_INSN (insn);
1703 if (SMALL_REGISTER_CLASSES)
1705 /* If the insn that copies the results of a CALL_INSN
1706 into a pseudo now references VAR, we have to use an
1707 intermediate pseudo since we want the life of the
1708 return value register to be only a single insn.
1710 If we don't use an intermediate pseudo, such things as
1711 address computations to make the address of VAR valid
1712 if it is not can be placed between the CALL_INSN and INSN.
1714 To make sure this doesn't happen, we record the destination
1715 of the CALL_INSN and see if the next insn uses both that
1718 if (call_dest != 0 && GET_CODE (insn) == INSN
1719 && reg_mentioned_p (var, PATTERN (insn))
1720 && reg_mentioned_p (call_dest, PATTERN (insn)))
1722 rtx temp = gen_reg_rtx (GET_MODE (call_dest));
1724 emit_insn_before (gen_move_insn (temp, call_dest), insn);
1726 PATTERN (insn) = replace_rtx (PATTERN (insn),
1730 if (GET_CODE (insn) == CALL_INSN
1731 && GET_CODE (PATTERN (insn)) == SET)
1732 call_dest = SET_DEST (PATTERN (insn));
1733 else if (GET_CODE (insn) == CALL_INSN
1734 && GET_CODE (PATTERN (insn)) == PARALLEL
1735 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET)
1736 call_dest = SET_DEST (XVECEXP (PATTERN (insn), 0, 0));
1741 /* See if we have to do anything to INSN now that VAR is in
1742 memory. If it needs to be loaded into a pseudo, use a single
1743 pseudo for the entire insn in case there is a MATCH_DUP
1744 between two operands. We pass a pointer to the head of
1745 a list of struct fixup_replacements. If fixup_var_refs_1
1746 needs to allocate pseudos or replacement MEMs (for SUBREGs),
1747 it will record them in this list.
1749 If it allocated a pseudo for any replacement, we copy into
1752 fixup_var_refs_1 (var, promoted_mode, &PATTERN (insn), insn,
1753 &replacements, no_share);
1755 /* If this is last_parm_insn, and any instructions were output
1756 after it to fix it up, then we must set last_parm_insn to
1757 the last such instruction emitted. */
1758 if (insn == last_parm_insn)
1759 last_parm_insn = PREV_INSN (next_insn);
1761 while (replacements)
1763 struct fixup_replacement *next;
1765 if (GET_CODE (replacements->new) == REG)
1770 /* OLD might be a (subreg (mem)). */
1771 if (GET_CODE (replacements->old) == SUBREG)
1773 = fixup_memory_subreg (replacements->old, insn,
1777 = fixup_stack_1 (replacements->old, insn);
1779 insert_before = insn;
1781 /* If we are changing the mode, do a conversion.
1782 This might be wasteful, but combine.c will
1783 eliminate much of the waste. */
1785 if (GET_MODE (replacements->new)
1786 != GET_MODE (replacements->old))
1789 convert_move (replacements->new,
1790 replacements->old, unsignedp);
1795 seq = gen_move_insn (replacements->new,
1798 emit_insn_before (seq, insert_before);
1801 next = replacements->next;
1802 free (replacements);
1803 replacements = next;
1807 /* Also fix up any invalid exprs in the REG_NOTES of this insn.
1808 But don't touch other insns referred to by reg-notes;
1809 we will get them elsewhere. */
1812 if (GET_CODE (note) != INSN_LIST)
1814 = walk_fixup_memory_subreg (XEXP (note, 0), insn,
1816 note = XEXP (note, 1);
1820 /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
1821 See if the rtx expression at *LOC in INSN needs to be changed.
1823 REPLACEMENTS is a pointer to a list head that starts out zero, but may
1824 contain a list of original rtx's and replacements. If we find that we need
1825 to modify this insn by replacing a memory reference with a pseudo or by
1826 making a new MEM to implement a SUBREG, we consult that list to see if
1827 we have already chosen a replacement. If none has already been allocated,
1828 we allocate it and update the list. fixup_var_refs_insn will copy VAR
1829 or the SUBREG, as appropriate, to the pseudo. */
1832 fixup_var_refs_1 (rtx var, enum machine_mode promoted_mode, rtx *loc, rtx insn,
1833 struct fixup_replacement **replacements, rtx no_share)
1837 RTX_CODE code = GET_CODE (x);
1840 struct fixup_replacement *replacement;
1845 if (XEXP (x, 0) == var)
1847 /* Prevent sharing of rtl that might lose. */
1848 rtx sub = copy_rtx (XEXP (var, 0));
1850 if (! validate_change (insn, loc, sub, 0))
1852 rtx y = gen_reg_rtx (GET_MODE (sub));
1855 /* We should be able to replace with a register or all is lost.
1856 Note that we can't use validate_change to verify this, since
1857 we're not caring for replacing all dups simultaneously. */
1858 if (! validate_replace_rtx (*loc, y, insn))
1861 /* Careful! First try to recognize a direct move of the
1862 value, mimicking how things are done in gen_reload wrt
1863 PLUS. Consider what happens when insn is a conditional
1864 move instruction and addsi3 clobbers flags. */
1867 new_insn = emit_insn (gen_rtx_SET (VOIDmode, y, sub));
1871 if (recog_memoized (new_insn) < 0)
1873 /* That failed. Fall back on force_operand and hope. */
1876 sub = force_operand (sub, y);
1878 emit_insn (gen_move_insn (y, sub));
1884 /* Don't separate setter from user. */
1885 if (PREV_INSN (insn) && sets_cc0_p (PREV_INSN (insn)))
1886 insn = PREV_INSN (insn);
1889 emit_insn_before (seq, insn);
1897 /* If we already have a replacement, use it. Otherwise,
1898 try to fix up this address in case it is invalid. */
1900 replacement = find_fixup_replacement (replacements, var);
1901 if (replacement->new)
1903 *loc = replacement->new;
1907 *loc = replacement->new = x = fixup_stack_1 (x, insn);
1909 /* Unless we are forcing memory to register or we changed the mode,
1910 we can leave things the way they are if the insn is valid. */
1912 INSN_CODE (insn) = -1;
1913 if (! flag_force_mem && GET_MODE (x) == promoted_mode
1914 && recog_memoized (insn) >= 0)
1917 *loc = replacement->new = gen_reg_rtx (promoted_mode);
1921 /* If X contains VAR, we need to unshare it here so that we update
1922 each occurrence separately. But all identical MEMs in one insn
1923 must be replaced with the same rtx because of the possibility of
1926 if (reg_mentioned_p (var, x))
1928 replacement = find_fixup_replacement (replacements, x);
1929 if (replacement->new == 0)
1930 replacement->new = copy_most_rtx (x, no_share);
1932 *loc = x = replacement->new;
1933 code = GET_CODE (x);
1950 /* Note that in some cases those types of expressions are altered
1951 by optimize_bit_field, and do not survive to get here. */
1952 if (XEXP (x, 0) == var
1953 || (GET_CODE (XEXP (x, 0)) == SUBREG
1954 && SUBREG_REG (XEXP (x, 0)) == var))
1956 /* Get TEM as a valid MEM in the mode presently in the insn.
1958 We don't worry about the possibility of MATCH_DUP here; it
1959 is highly unlikely and would be tricky to handle. */
1962 if (GET_CODE (tem) == SUBREG)
1964 if (GET_MODE_BITSIZE (GET_MODE (tem))
1965 > GET_MODE_BITSIZE (GET_MODE (var)))
1967 replacement = find_fixup_replacement (replacements, var);
1968 if (replacement->new == 0)
1969 replacement->new = gen_reg_rtx (GET_MODE (var));
1970 SUBREG_REG (tem) = replacement->new;
1972 /* The following code works only if we have a MEM, so we
1973 need to handle the subreg here. We directly substitute
1974 it assuming that a subreg must be OK here. We already
1975 scheduled a replacement to copy the mem into the
1981 tem = fixup_memory_subreg (tem, insn, promoted_mode, 0);
1984 tem = fixup_stack_1 (tem, insn);
1986 /* Unless we want to load from memory, get TEM into the proper mode
1987 for an extract from memory. This can only be done if the
1988 extract is at a constant position and length. */
1990 if (! flag_force_mem && GET_CODE (XEXP (x, 1)) == CONST_INT
1991 && GET_CODE (XEXP (x, 2)) == CONST_INT
1992 && ! mode_dependent_address_p (XEXP (tem, 0))
1993 && ! MEM_VOLATILE_P (tem))
1995 enum machine_mode wanted_mode = VOIDmode;
1996 enum machine_mode is_mode = GET_MODE (tem);
1997 HOST_WIDE_INT pos = INTVAL (XEXP (x, 2));
1999 if (GET_CODE (x) == ZERO_EXTRACT)
2001 enum machine_mode new_mode
2002 = mode_for_extraction (EP_extzv, 1);
2003 if (new_mode != MAX_MACHINE_MODE)
2004 wanted_mode = new_mode;
2006 else if (GET_CODE (x) == SIGN_EXTRACT)
2008 enum machine_mode new_mode
2009 = mode_for_extraction (EP_extv, 1);
2010 if (new_mode != MAX_MACHINE_MODE)
2011 wanted_mode = new_mode;
2014 /* If we have a narrower mode, we can do something. */
2015 if (wanted_mode != VOIDmode
2016 && GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2018 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2019 rtx old_pos = XEXP (x, 2);
2022 /* If the bytes and bits are counted differently, we
2023 must adjust the offset. */
2024 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2025 offset = (GET_MODE_SIZE (is_mode)
2026 - GET_MODE_SIZE (wanted_mode) - offset);
2028 pos %= GET_MODE_BITSIZE (wanted_mode);
2030 newmem = adjust_address_nv (tem, wanted_mode, offset);
2032 /* Make the change and see if the insn remains valid. */
2033 INSN_CODE (insn) = -1;
2034 XEXP (x, 0) = newmem;
2035 XEXP (x, 2) = GEN_INT (pos);
2037 if (recog_memoized (insn) >= 0)
2040 /* Otherwise, restore old position. XEXP (x, 0) will be
2042 XEXP (x, 2) = old_pos;
2046 /* If we get here, the bitfield extract insn can't accept a memory
2047 reference. Copy the input into a register. */
2049 tem1 = gen_reg_rtx (GET_MODE (tem));
2050 emit_insn_before (gen_move_insn (tem1, tem), insn);
2057 if (SUBREG_REG (x) == var)
2059 /* If this is a special SUBREG made because VAR was promoted
2060 from a wider mode, replace it with VAR and call ourself
2061 recursively, this time saying that the object previously
2062 had its current mode (by virtue of the SUBREG). */
2064 if (SUBREG_PROMOTED_VAR_P (x))
2067 fixup_var_refs_1 (var, GET_MODE (var), loc, insn, replacements,
2072 /* If this SUBREG makes VAR wider, it has become a paradoxical
2073 SUBREG with VAR in memory, but these aren't allowed at this
2074 stage of the compilation. So load VAR into a pseudo and take
2075 a SUBREG of that pseudo. */
2076 if (GET_MODE_SIZE (GET_MODE (x)) > GET_MODE_SIZE (GET_MODE (var)))
2078 replacement = find_fixup_replacement (replacements, var);
2079 if (replacement->new == 0)
2080 replacement->new = gen_reg_rtx (promoted_mode);
2081 SUBREG_REG (x) = replacement->new;
2085 /* See if we have already found a replacement for this SUBREG.
2086 If so, use it. Otherwise, make a MEM and see if the insn
2087 is recognized. If not, or if we should force MEM into a register,
2088 make a pseudo for this SUBREG. */
2089 replacement = find_fixup_replacement (replacements, x);
2090 if (replacement->new)
2092 *loc = replacement->new;
2096 replacement->new = *loc = fixup_memory_subreg (x, insn,
2099 INSN_CODE (insn) = -1;
2100 if (! flag_force_mem && recog_memoized (insn) >= 0)
2103 *loc = replacement->new = gen_reg_rtx (GET_MODE (x));
2109 /* First do special simplification of bit-field references. */
2110 if (GET_CODE (SET_DEST (x)) == SIGN_EXTRACT
2111 || GET_CODE (SET_DEST (x)) == ZERO_EXTRACT)
2112 optimize_bit_field (x, insn, 0);
2113 if (GET_CODE (SET_SRC (x)) == SIGN_EXTRACT
2114 || GET_CODE (SET_SRC (x)) == ZERO_EXTRACT)
2115 optimize_bit_field (x, insn, 0);
2117 /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object
2118 into a register and then store it back out. */
2119 if (GET_CODE (SET_DEST (x)) == ZERO_EXTRACT
2120 && GET_CODE (XEXP (SET_DEST (x), 0)) == SUBREG
2121 && SUBREG_REG (XEXP (SET_DEST (x), 0)) == var
2122 && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x), 0)))
2123 > GET_MODE_SIZE (GET_MODE (var))))
2125 replacement = find_fixup_replacement (replacements, var);
2126 if (replacement->new == 0)
2127 replacement->new = gen_reg_rtx (GET_MODE (var));
2129 SUBREG_REG (XEXP (SET_DEST (x), 0)) = replacement->new;
2130 emit_insn_after (gen_move_insn (var, replacement->new), insn);
2133 /* If SET_DEST is now a paradoxical SUBREG, put the result of this
2134 insn into a pseudo and store the low part of the pseudo into VAR. */
2135 if (GET_CODE (SET_DEST (x)) == SUBREG
2136 && SUBREG_REG (SET_DEST (x)) == var
2137 && (GET_MODE_SIZE (GET_MODE (SET_DEST (x)))
2138 > GET_MODE_SIZE (GET_MODE (var))))
2140 SET_DEST (x) = tem = gen_reg_rtx (GET_MODE (SET_DEST (x)));
2141 emit_insn_after (gen_move_insn (var, gen_lowpart (GET_MODE (var),
2148 rtx dest = SET_DEST (x);
2149 rtx src = SET_SRC (x);
2150 rtx outerdest = dest;
2152 while (GET_CODE (dest) == SUBREG || GET_CODE (dest) == STRICT_LOW_PART
2153 || GET_CODE (dest) == SIGN_EXTRACT
2154 || GET_CODE (dest) == ZERO_EXTRACT)
2155 dest = XEXP (dest, 0);
2157 if (GET_CODE (src) == SUBREG)
2158 src = SUBREG_REG (src);
2160 /* If VAR does not appear at the top level of the SET
2161 just scan the lower levels of the tree. */
2163 if (src != var && dest != var)
2166 /* We will need to rerecognize this insn. */
2167 INSN_CODE (insn) = -1;
2169 if (GET_CODE (outerdest) == ZERO_EXTRACT && dest == var
2170 && mode_for_extraction (EP_insv, -1) != MAX_MACHINE_MODE)
2172 /* Since this case will return, ensure we fixup all the
2174 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 1),
2175 insn, replacements, no_share);
2176 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 2),
2177 insn, replacements, no_share);
2178 fixup_var_refs_1 (var, promoted_mode, &SET_SRC (x),
2179 insn, replacements, no_share);
2181 tem = XEXP (outerdest, 0);
2183 /* Clean up (SUBREG:SI (MEM:mode ...) 0)
2184 that may appear inside a ZERO_EXTRACT.
2185 This was legitimate when the MEM was a REG. */
2186 if (GET_CODE (tem) == SUBREG
2187 && SUBREG_REG (tem) == var)
2188 tem = fixup_memory_subreg (tem, insn, promoted_mode, 0);
2190 tem = fixup_stack_1 (tem, insn);
2192 if (GET_CODE (XEXP (outerdest, 1)) == CONST_INT
2193 && GET_CODE (XEXP (outerdest, 2)) == CONST_INT
2194 && ! mode_dependent_address_p (XEXP (tem, 0))
2195 && ! MEM_VOLATILE_P (tem))
2197 enum machine_mode wanted_mode;
2198 enum machine_mode is_mode = GET_MODE (tem);
2199 HOST_WIDE_INT pos = INTVAL (XEXP (outerdest, 2));
2201 wanted_mode = mode_for_extraction (EP_insv, 0);
2203 /* If we have a narrower mode, we can do something. */
2204 if (GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2206 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2207 rtx old_pos = XEXP (outerdest, 2);
2210 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2211 offset = (GET_MODE_SIZE (is_mode)
2212 - GET_MODE_SIZE (wanted_mode) - offset);
2214 pos %= GET_MODE_BITSIZE (wanted_mode);
2216 newmem = adjust_address_nv (tem, wanted_mode, offset);
2218 /* Make the change and see if the insn remains valid. */
2219 INSN_CODE (insn) = -1;
2220 XEXP (outerdest, 0) = newmem;
2221 XEXP (outerdest, 2) = GEN_INT (pos);
2223 if (recog_memoized (insn) >= 0)
2226 /* Otherwise, restore old position. XEXP (x, 0) will be
2228 XEXP (outerdest, 2) = old_pos;
2232 /* If we get here, the bit-field store doesn't allow memory
2233 or isn't located at a constant position. Load the value into
2234 a register, do the store, and put it back into memory. */
2236 tem1 = gen_reg_rtx (GET_MODE (tem));
2237 emit_insn_before (gen_move_insn (tem1, tem), insn);
2238 emit_insn_after (gen_move_insn (tem, tem1), insn);
2239 XEXP (outerdest, 0) = tem1;
2243 /* STRICT_LOW_PART is a no-op on memory references
2244 and it can cause combinations to be unrecognizable,
2247 if (dest == var && GET_CODE (SET_DEST (x)) == STRICT_LOW_PART)
2248 SET_DEST (x) = XEXP (SET_DEST (x), 0);
2250 /* A valid insn to copy VAR into or out of a register
2251 must be left alone, to avoid an infinite loop here.
2252 If the reference to VAR is by a subreg, fix that up,
2253 since SUBREG is not valid for a memref.
2254 Also fix up the address of the stack slot.
2256 Note that we must not try to recognize the insn until
2257 after we know that we have valid addresses and no
2258 (subreg (mem ...) ...) constructs, since these interfere
2259 with determining the validity of the insn. */
2261 if ((SET_SRC (x) == var
2262 || (GET_CODE (SET_SRC (x)) == SUBREG
2263 && SUBREG_REG (SET_SRC (x)) == var))
2264 && (GET_CODE (SET_DEST (x)) == REG
2265 || (GET_CODE (SET_DEST (x)) == SUBREG
2266 && GET_CODE (SUBREG_REG (SET_DEST (x))) == REG))
2267 && GET_MODE (var) == promoted_mode
2268 && x == single_set (insn))
2272 if (GET_CODE (SET_SRC (x)) == SUBREG
2273 && (GET_MODE_SIZE (GET_MODE (SET_SRC (x)))
2274 > GET_MODE_SIZE (GET_MODE (var))))
2276 /* This (subreg VAR) is now a paradoxical subreg. We need
2277 to replace VAR instead of the subreg. */
2278 replacement = find_fixup_replacement (replacements, var);
2279 if (replacement->new == NULL_RTX)
2280 replacement->new = gen_reg_rtx (GET_MODE (var));
2281 SUBREG_REG (SET_SRC (x)) = replacement->new;
2285 replacement = find_fixup_replacement (replacements, SET_SRC (x));
2286 if (replacement->new)
2287 SET_SRC (x) = replacement->new;
2288 else if (GET_CODE (SET_SRC (x)) == SUBREG)
2289 SET_SRC (x) = replacement->new
2290 = fixup_memory_subreg (SET_SRC (x), insn, promoted_mode,
2293 SET_SRC (x) = replacement->new
2294 = fixup_stack_1 (SET_SRC (x), insn);
2297 if (recog_memoized (insn) >= 0)
2300 /* INSN is not valid, but we know that we want to
2301 copy SET_SRC (x) to SET_DEST (x) in some way. So
2302 we generate the move and see whether it requires more
2303 than one insn. If it does, we emit those insns and
2304 delete INSN. Otherwise, we can just replace the pattern
2305 of INSN; we have already verified above that INSN has
2306 no other function that to do X. */
2308 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2309 if (NEXT_INSN (pat) != NULL_RTX)
2311 last = emit_insn_before (pat, insn);
2313 /* INSN might have REG_RETVAL or other important notes, so
2314 we need to store the pattern of the last insn in the
2315 sequence into INSN similarly to the normal case. LAST
2316 should not have REG_NOTES, but we allow them if INSN has
2318 if (REG_NOTES (last) && REG_NOTES (insn))
2320 if (REG_NOTES (last))
2321 REG_NOTES (insn) = REG_NOTES (last);
2322 PATTERN (insn) = PATTERN (last);
2327 PATTERN (insn) = PATTERN (pat);
2332 if ((SET_DEST (x) == var
2333 || (GET_CODE (SET_DEST (x)) == SUBREG
2334 && SUBREG_REG (SET_DEST (x)) == var))
2335 && (GET_CODE (SET_SRC (x)) == REG
2336 || (GET_CODE (SET_SRC (x)) == SUBREG
2337 && GET_CODE (SUBREG_REG (SET_SRC (x))) == REG))
2338 && GET_MODE (var) == promoted_mode
2339 && x == single_set (insn))
2343 if (GET_CODE (SET_DEST (x)) == SUBREG)
2344 SET_DEST (x) = fixup_memory_subreg (SET_DEST (x), insn,
2347 SET_DEST (x) = fixup_stack_1 (SET_DEST (x), insn);
2349 if (recog_memoized (insn) >= 0)
2352 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2353 if (NEXT_INSN (pat) != NULL_RTX)
2355 last = emit_insn_before (pat, insn);
2357 /* INSN might have REG_RETVAL or other important notes, so
2358 we need to store the pattern of the last insn in the
2359 sequence into INSN similarly to the normal case. LAST
2360 should not have REG_NOTES, but we allow them if INSN has
2362 if (REG_NOTES (last) && REG_NOTES (insn))
2364 if (REG_NOTES (last))
2365 REG_NOTES (insn) = REG_NOTES (last);
2366 PATTERN (insn) = PATTERN (last);
2371 PATTERN (insn) = PATTERN (pat);
2376 /* Otherwise, storing into VAR must be handled specially
2377 by storing into a temporary and copying that into VAR
2378 with a new insn after this one. Note that this case
2379 will be used when storing into a promoted scalar since
2380 the insn will now have different modes on the input
2381 and output and hence will be invalid (except for the case
2382 of setting it to a constant, which does not need any
2383 change if it is valid). We generate extra code in that case,
2384 but combine.c will eliminate it. */
2389 rtx fixeddest = SET_DEST (x);
2390 enum machine_mode temp_mode;
2392 /* STRICT_LOW_PART can be discarded, around a MEM. */
2393 if (GET_CODE (fixeddest) == STRICT_LOW_PART)
2394 fixeddest = XEXP (fixeddest, 0);
2395 /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */
2396 if (GET_CODE (fixeddest) == SUBREG)
2398 fixeddest = fixup_memory_subreg (fixeddest, insn,
2400 temp_mode = GET_MODE (fixeddest);
2404 fixeddest = fixup_stack_1 (fixeddest, insn);
2405 temp_mode = promoted_mode;
2408 temp = gen_reg_rtx (temp_mode);
2410 emit_insn_after (gen_move_insn (fixeddest,
2411 gen_lowpart (GET_MODE (fixeddest),
2415 SET_DEST (x) = temp;
2423 /* Nothing special about this RTX; fix its operands. */
2425 fmt = GET_RTX_FORMAT (code);
2426 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2429 fixup_var_refs_1 (var, promoted_mode, &XEXP (x, i), insn, replacements,
2431 else if (fmt[i] == 'E')
2434 for (j = 0; j < XVECLEN (x, i); j++)
2435 fixup_var_refs_1 (var, promoted_mode, &XVECEXP (x, i, j),
2436 insn, replacements, no_share);
2441 /* Previously, X had the form (SUBREG:m1 (REG:PROMOTED_MODE ...)).
2442 The REG was placed on the stack, so X now has the form (SUBREG:m1
2445 Return an rtx (MEM:m1 newaddr) which is equivalent. If any insns
2446 must be emitted to compute NEWADDR, put them before INSN.
2448 UNCRITICAL nonzero means accept paradoxical subregs.
2449 This is used for subregs found inside REG_NOTES. */
2452 fixup_memory_subreg (rtx x, rtx insn, enum machine_mode promoted_mode, int uncritical)
2455 rtx mem = SUBREG_REG (x);
2456 rtx addr = XEXP (mem, 0);
2457 enum machine_mode mode = GET_MODE (x);
2460 /* Paradoxical SUBREGs are usually invalid during RTL generation. */
2461 if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (GET_MODE (mem)) && ! uncritical)
2464 offset = SUBREG_BYTE (x);
2465 if (BYTES_BIG_ENDIAN)
2466 /* If the PROMOTED_MODE is wider than the mode of the MEM, adjust
2467 the offset so that it points to the right location within the
2469 offset -= (GET_MODE_SIZE (promoted_mode) - GET_MODE_SIZE (GET_MODE (mem)));
2471 if (!flag_force_addr
2472 && memory_address_p (mode, plus_constant (addr, offset)))
2473 /* Shortcut if no insns need be emitted. */
2474 return adjust_address (mem, mode, offset);
2477 result = adjust_address (mem, mode, offset);
2481 emit_insn_before (seq, insn);
2485 /* Do fixup_memory_subreg on all (SUBREG (MEM ...) ...) contained in X.
2486 Replace subexpressions of X in place.
2487 If X itself is a (SUBREG (MEM ...) ...), return the replacement expression.
2488 Otherwise return X, with its contents possibly altered.
2490 INSN, PROMOTED_MODE and UNCRITICAL are as for
2491 fixup_memory_subreg. */
2494 walk_fixup_memory_subreg (rtx x, rtx insn, enum machine_mode promoted_mode,
2504 code = GET_CODE (x);
2506 if (code == SUBREG && GET_CODE (SUBREG_REG (x)) == MEM)
2507 return fixup_memory_subreg (x, insn, promoted_mode, uncritical);
2509 /* Nothing special about this RTX; fix its operands. */
2511 fmt = GET_RTX_FORMAT (code);
2512 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2515 XEXP (x, i) = walk_fixup_memory_subreg (XEXP (x, i), insn,
2516 promoted_mode, uncritical);
2517 else if (fmt[i] == 'E')
2520 for (j = 0; j < XVECLEN (x, i); j++)
2522 = walk_fixup_memory_subreg (XVECEXP (x, i, j), insn,
2523 promoted_mode, uncritical);
2529 /* For each memory ref within X, if it refers to a stack slot
2530 with an out of range displacement, put the address in a temp register
2531 (emitting new insns before INSN to load these registers)
2532 and alter the memory ref to use that register.
2533 Replace each such MEM rtx with a copy, to avoid clobberage. */
2536 fixup_stack_1 (rtx x, rtx insn)
2539 RTX_CODE code = GET_CODE (x);
2544 rtx ad = XEXP (x, 0);
2545 /* If we have address of a stack slot but it's not valid
2546 (displacement is too large), compute the sum in a register. */
2547 if (GET_CODE (ad) == PLUS
2548 && GET_CODE (XEXP (ad, 0)) == REG
2549 && ((REGNO (XEXP (ad, 0)) >= FIRST_VIRTUAL_REGISTER
2550 && REGNO (XEXP (ad, 0)) <= LAST_VIRTUAL_REGISTER)
2551 || REGNO (XEXP (ad, 0)) == FRAME_POINTER_REGNUM
2552 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2553 || REGNO (XEXP (ad, 0)) == HARD_FRAME_POINTER_REGNUM
2555 || REGNO (XEXP (ad, 0)) == STACK_POINTER_REGNUM
2556 || REGNO (XEXP (ad, 0)) == ARG_POINTER_REGNUM
2557 || XEXP (ad, 0) == current_function_internal_arg_pointer)
2558 && GET_CODE (XEXP (ad, 1)) == CONST_INT)
2561 if (memory_address_p (GET_MODE (x), ad))
2565 temp = copy_to_reg (ad);
2568 emit_insn_before (seq, insn);
2569 return replace_equiv_address (x, temp);
2574 fmt = GET_RTX_FORMAT (code);
2575 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2578 XEXP (x, i) = fixup_stack_1 (XEXP (x, i), insn);
2579 else if (fmt[i] == 'E')
2582 for (j = 0; j < XVECLEN (x, i); j++)
2583 XVECEXP (x, i, j) = fixup_stack_1 (XVECEXP (x, i, j), insn);
2589 /* Optimization: a bit-field instruction whose field
2590 happens to be a byte or halfword in memory
2591 can be changed to a move instruction.
2593 We call here when INSN is an insn to examine or store into a bit-field.
2594 BODY is the SET-rtx to be altered.
2596 EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0.
2597 (Currently this is called only from function.c, and EQUIV_MEM
2601 optimize_bit_field (rtx body, rtx insn, rtx *equiv_mem)
2606 enum machine_mode mode;
2608 if (GET_CODE (SET_DEST (body)) == SIGN_EXTRACT
2609 || GET_CODE (SET_DEST (body)) == ZERO_EXTRACT)
2610 bitfield = SET_DEST (body), destflag = 1;
2612 bitfield = SET_SRC (body), destflag = 0;
2614 /* First check that the field being stored has constant size and position
2615 and is in fact a byte or halfword suitably aligned. */
2617 if (GET_CODE (XEXP (bitfield, 1)) == CONST_INT
2618 && GET_CODE (XEXP (bitfield, 2)) == CONST_INT
2619 && ((mode = mode_for_size (INTVAL (XEXP (bitfield, 1)), MODE_INT, 1))
2621 && INTVAL (XEXP (bitfield, 2)) % INTVAL (XEXP (bitfield, 1)) == 0)
2625 /* Now check that the containing word is memory, not a register,
2626 and that it is safe to change the machine mode. */
2628 if (GET_CODE (XEXP (bitfield, 0)) == MEM)
2629 memref = XEXP (bitfield, 0);
2630 else if (GET_CODE (XEXP (bitfield, 0)) == REG
2632 memref = equiv_mem[REGNO (XEXP (bitfield, 0))];
2633 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2634 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == MEM)
2635 memref = SUBREG_REG (XEXP (bitfield, 0));
2636 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2638 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == REG)
2639 memref = equiv_mem[REGNO (SUBREG_REG (XEXP (bitfield, 0)))];
2642 && ! mode_dependent_address_p (XEXP (memref, 0))
2643 && ! MEM_VOLATILE_P (memref))
2645 /* Now adjust the address, first for any subreg'ing
2646 that we are now getting rid of,
2647 and then for which byte of the word is wanted. */
2649 HOST_WIDE_INT offset = INTVAL (XEXP (bitfield, 2));
2652 /* Adjust OFFSET to count bits from low-address byte. */
2653 if (BITS_BIG_ENDIAN != BYTES_BIG_ENDIAN)
2654 offset = (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield, 0)))
2655 - offset - INTVAL (XEXP (bitfield, 1)));
2657 /* Adjust OFFSET to count bytes from low-address byte. */
2658 offset /= BITS_PER_UNIT;
2659 if (GET_CODE (XEXP (bitfield, 0)) == SUBREG)
2661 offset += (SUBREG_BYTE (XEXP (bitfield, 0))
2662 / UNITS_PER_WORD) * UNITS_PER_WORD;
2663 if (BYTES_BIG_ENDIAN)
2664 offset -= (MIN (UNITS_PER_WORD,
2665 GET_MODE_SIZE (GET_MODE (XEXP (bitfield, 0))))
2666 - MIN (UNITS_PER_WORD,
2667 GET_MODE_SIZE (GET_MODE (memref))));
2671 memref = adjust_address (memref, mode, offset);
2672 insns = get_insns ();
2674 emit_insn_before (insns, insn);
2676 /* Store this memory reference where
2677 we found the bit field reference. */
2681 validate_change (insn, &SET_DEST (body), memref, 1);
2682 if (! CONSTANT_ADDRESS_P (SET_SRC (body)))
2684 rtx src = SET_SRC (body);
2685 while (GET_CODE (src) == SUBREG
2686 && SUBREG_BYTE (src) == 0)
2687 src = SUBREG_REG (src);
2688 if (GET_MODE (src) != GET_MODE (memref))
2689 src = gen_lowpart (GET_MODE (memref), SET_SRC (body));
2690 validate_change (insn, &SET_SRC (body), src, 1);
2692 else if (GET_MODE (SET_SRC (body)) != VOIDmode
2693 && GET_MODE (SET_SRC (body)) != GET_MODE (memref))
2694 /* This shouldn't happen because anything that didn't have
2695 one of these modes should have got converted explicitly
2696 and then referenced through a subreg.
2697 This is so because the original bit-field was
2698 handled by agg_mode and so its tree structure had
2699 the same mode that memref now has. */
2704 rtx dest = SET_DEST (body);
2706 while (GET_CODE (dest) == SUBREG
2707 && SUBREG_BYTE (dest) == 0
2708 && (GET_MODE_CLASS (GET_MODE (dest))
2709 == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest))))
2710 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2712 dest = SUBREG_REG (dest);
2714 validate_change (insn, &SET_DEST (body), dest, 1);
2716 if (GET_MODE (dest) == GET_MODE (memref))
2717 validate_change (insn, &SET_SRC (body), memref, 1);
2720 /* Convert the mem ref to the destination mode. */
2721 rtx newreg = gen_reg_rtx (GET_MODE (dest));
2724 convert_move (newreg, memref,
2725 GET_CODE (SET_SRC (body)) == ZERO_EXTRACT);
2729 validate_change (insn, &SET_SRC (body), newreg, 1);
2733 /* See if we can convert this extraction or insertion into
2734 a simple move insn. We might not be able to do so if this
2735 was, for example, part of a PARALLEL.
2737 If we succeed, write out any needed conversions. If we fail,
2738 it is hard to guess why we failed, so don't do anything
2739 special; just let the optimization be suppressed. */
2741 if (apply_change_group () && seq)
2742 emit_insn_before (seq, insn);
2747 /* These routines are responsible for converting virtual register references
2748 to the actual hard register references once RTL generation is complete.
2750 The following four variables are used for communication between the
2751 routines. They contain the offsets of the virtual registers from their
2752 respective hard registers. */
2754 static int in_arg_offset;
2755 static int var_offset;
2756 static int dynamic_offset;
2757 static int out_arg_offset;
2758 static int cfa_offset;
2760 /* In most machines, the stack pointer register is equivalent to the bottom
2763 #ifndef STACK_POINTER_OFFSET
2764 #define STACK_POINTER_OFFSET 0
2767 /* If not defined, pick an appropriate default for the offset of dynamically
2768 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
2769 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
2771 #ifndef STACK_DYNAMIC_OFFSET
2773 /* The bottom of the stack points to the actual arguments. If
2774 REG_PARM_STACK_SPACE is defined, this includes the space for the register
2775 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
2776 stack space for register parameters is not pushed by the caller, but
2777 rather part of the fixed stack areas and hence not included in
2778 `current_function_outgoing_args_size'. Nevertheless, we must allow
2779 for it when allocating stack dynamic objects. */
2781 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2782 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2783 ((ACCUMULATE_OUTGOING_ARGS \
2784 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
2785 + (STACK_POINTER_OFFSET)) \
2788 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2789 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
2790 + (STACK_POINTER_OFFSET))
2794 /* On most machines, the CFA coincides with the first incoming parm. */
2796 #ifndef ARG_POINTER_CFA_OFFSET
2797 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
2800 /* Build up a (MEM (ADDRESSOF (REG))) rtx for a register REG that just
2801 had its address taken. DECL is the decl or SAVE_EXPR for the
2802 object stored in the register, for later use if we do need to force
2803 REG into the stack. REG is overwritten by the MEM like in
2804 put_reg_into_stack. RESCAN is true if previously emitted
2805 instructions must be rescanned and modified now that the REG has
2806 been transformed. */
2809 gen_mem_addressof (rtx reg, tree decl, int rescan)
2811 rtx r = gen_rtx_ADDRESSOF (Pmode, gen_reg_rtx (GET_MODE (reg)),
2814 /* Calculate this before we start messing with decl's RTL. */
2815 HOST_WIDE_INT set = decl ? get_alias_set (decl) : 0;
2817 /* If the original REG was a user-variable, then so is the REG whose
2818 address is being taken. Likewise for unchanging. */
2819 REG_USERVAR_P (XEXP (r, 0)) = REG_USERVAR_P (reg);
2820 RTX_UNCHANGING_P (XEXP (r, 0)) = RTX_UNCHANGING_P (reg);
2822 PUT_CODE (reg, MEM);
2823 MEM_ATTRS (reg) = 0;
2828 tree type = TREE_TYPE (decl);
2829 enum machine_mode decl_mode
2830 = (DECL_P (decl) ? DECL_MODE (decl) : TYPE_MODE (TREE_TYPE (decl)));
2831 rtx decl_rtl = (TREE_CODE (decl) == SAVE_EXPR ? SAVE_EXPR_RTL (decl)
2832 : DECL_RTL_IF_SET (decl));
2834 PUT_MODE (reg, decl_mode);
2836 /* Clear DECL_RTL momentarily so functions below will work
2837 properly, then set it again. */
2838 if (DECL_P (decl) && decl_rtl == reg)
2839 SET_DECL_RTL (decl, 0);
2841 set_mem_attributes (reg, decl, 1);
2842 set_mem_alias_set (reg, set);
2844 if (DECL_P (decl) && decl_rtl == reg)
2845 SET_DECL_RTL (decl, reg);
2848 && (TREE_USED (decl) || (DECL_P (decl) && DECL_INITIAL (decl) != 0)))
2849 fixup_var_refs (reg, GET_MODE (reg), TREE_UNSIGNED (type), reg, 0);
2852 fixup_var_refs (reg, GET_MODE (reg), 0, reg, 0);
2857 /* If DECL has an RTL that is an ADDRESSOF rtx, put it into the stack. */
2860 flush_addressof (tree decl)
2862 if ((TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == VAR_DECL)
2863 && DECL_RTL (decl) != 0
2864 && GET_CODE (DECL_RTL (decl)) == MEM
2865 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF
2866 && GET_CODE (XEXP (XEXP (DECL_RTL (decl), 0), 0)) == REG)
2867 put_addressof_into_stack (XEXP (DECL_RTL (decl), 0), 0);
2870 /* Force the register pointed to by R, an ADDRESSOF rtx, into the stack. */
2873 put_addressof_into_stack (rtx r, htab_t ht)
2876 int volatile_p, used_p;
2878 rtx reg = XEXP (r, 0);
2880 if (GET_CODE (reg) != REG)
2883 decl = ADDRESSOF_DECL (r);
2886 type = TREE_TYPE (decl);
2887 volatile_p = (TREE_CODE (decl) != SAVE_EXPR
2888 && TREE_THIS_VOLATILE (decl));
2889 used_p = (TREE_USED (decl)
2890 || (DECL_P (decl) && DECL_INITIAL (decl) != 0));
2899 put_reg_into_stack (0, reg, type, GET_MODE (reg), GET_MODE (reg),
2900 volatile_p, ADDRESSOF_REGNO (r), used_p, ht);
2903 /* List of replacements made below in purge_addressof_1 when creating
2904 bitfield insertions. */
2905 static rtx purge_bitfield_addressof_replacements;
2907 /* List of replacements made below in purge_addressof_1 for patterns
2908 (MEM (ADDRESSOF (REG ...))). The key of the list entry is the
2909 corresponding (ADDRESSOF (REG ...)) and value is a substitution for
2910 the all pattern. List PURGE_BITFIELD_ADDRESSOF_REPLACEMENTS is not
2911 enough in complex cases, e.g. when some field values can be
2912 extracted by usage MEM with narrower mode. */
2913 static rtx purge_addressof_replacements;
2915 /* Helper function for purge_addressof. See if the rtx expression at *LOC
2916 in INSN needs to be changed. If FORCE, always put any ADDRESSOFs into
2917 the stack. If the function returns FALSE then the replacement could not
2918 be made. If MAY_POSTPONE is true and we would not put the addressof
2919 to stack, postpone processing of the insn. */
2922 purge_addressof_1 (rtx *loc, rtx insn, int force, int store, int may_postpone,
2931 /* Re-start here to avoid recursion in common cases. */
2938 code = GET_CODE (x);
2940 /* If we don't return in any of the cases below, we will recurse inside
2941 the RTX, which will normally result in any ADDRESSOF being forced into
2945 result = purge_addressof_1 (&SET_DEST (x), insn, force, 1,
2947 result &= purge_addressof_1 (&SET_SRC (x), insn, force, 0,
2951 else if (code == ADDRESSOF)
2955 if (GET_CODE (XEXP (x, 0)) != MEM)
2956 put_addressof_into_stack (x, ht);
2958 /* We must create a copy of the rtx because it was created by
2959 overwriting a REG rtx which is always shared. */
2960 sub = copy_rtx (XEXP (XEXP (x, 0), 0));
2961 if (validate_change (insn, loc, sub, 0)
2962 || validate_replace_rtx (x, sub, insn))
2967 /* If SUB is a hard or virtual register, try it as a pseudo-register.
2968 Otherwise, perhaps SUB is an expression, so generate code to compute
2970 if (GET_CODE (sub) == REG && REGNO (sub) <= LAST_VIRTUAL_REGISTER)
2971 sub = copy_to_reg (sub);
2973 sub = force_operand (sub, NULL_RTX);
2975 if (! validate_change (insn, loc, sub, 0)
2976 && ! validate_replace_rtx (x, sub, insn))
2979 insns = get_insns ();
2981 emit_insn_before (insns, insn);
2985 else if (code == MEM && GET_CODE (XEXP (x, 0)) == ADDRESSOF && ! force)
2987 rtx sub = XEXP (XEXP (x, 0), 0);
2989 if (GET_CODE (sub) == MEM)
2990 sub = adjust_address_nv (sub, GET_MODE (x), 0);
2991 else if (GET_CODE (sub) == REG
2992 && (MEM_VOLATILE_P (x) || GET_MODE (x) == BLKmode))
2994 else if (GET_CODE (sub) == REG && GET_MODE (x) != GET_MODE (sub))
2996 int size_x, size_sub;
3000 /* Postpone for now, so that we do not emit bitfield arithmetics
3001 unless there is some benefit from it. */
3002 if (!postponed_insns || XEXP (postponed_insns, 0) != insn)
3003 postponed_insns = alloc_INSN_LIST (insn, postponed_insns);
3009 /* When processing REG_NOTES look at the list of
3010 replacements done on the insn to find the register that X
3014 for (tem = purge_bitfield_addressof_replacements;
3016 tem = XEXP (XEXP (tem, 1), 1))
3017 if (rtx_equal_p (x, XEXP (tem, 0)))
3019 *loc = XEXP (XEXP (tem, 1), 0);
3023 /* See comment for purge_addressof_replacements. */
3024 for (tem = purge_addressof_replacements;
3026 tem = XEXP (XEXP (tem, 1), 1))
3027 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3029 rtx z = XEXP (XEXP (tem, 1), 0);
3031 if (GET_MODE (x) == GET_MODE (z)
3032 || (GET_CODE (XEXP (XEXP (tem, 1), 0)) != REG
3033 && GET_CODE (XEXP (XEXP (tem, 1), 0)) != SUBREG))
3036 /* It can happen that the note may speak of things
3037 in a wider (or just different) mode than the
3038 code did. This is especially true of
3041 if (GET_CODE (z) == SUBREG && SUBREG_BYTE (z) == 0)
3044 if (GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD
3045 && (GET_MODE_SIZE (GET_MODE (x))
3046 > GET_MODE_SIZE (GET_MODE (z))))
3048 /* This can occur as a result in invalid
3049 pointer casts, e.g. float f; ...
3050 *(long long int *)&f.
3051 ??? We could emit a warning here, but
3052 without a line number that wouldn't be
3054 z = gen_rtx_SUBREG (GET_MODE (x), z, 0);
3057 z = gen_lowpart (GET_MODE (x), z);
3063 /* When we are processing the REG_NOTES of the last instruction
3064 of a libcall, there will be typically no replacements
3065 for that insn; the replacements happened before, piecemeal
3066 fashion. OTOH we are not interested in the details of
3067 this for the REG_EQUAL note, we want to know the big picture,
3068 which can be succinctly described with a simple SUBREG.
3069 Note that removing the REG_EQUAL note is not an option
3070 on the last insn of a libcall, so we must do a replacement. */
3071 if (! purge_addressof_replacements
3072 && ! purge_bitfield_addressof_replacements)
3074 /* In compile/990107-1.c:7 compiled at -O1 -m1 for sh-elf,
3076 (mem:DI (addressof:SI (reg/v:DF 160) 159 0x401c8510)
3077 [0 S8 A32]), which can be expressed with a simple
3079 if ((GET_MODE_SIZE (GET_MODE (x))
3080 == GET_MODE_SIZE (GET_MODE (sub)))
3081 /* Again, invalid pointer casts (as in
3082 compile/990203-1.c) can require paradoxical
3084 || (GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD
3085 && (GET_MODE_SIZE (GET_MODE (x))
3086 > GET_MODE_SIZE (GET_MODE (sub)))))
3088 *loc = gen_rtx_SUBREG (GET_MODE (x), sub, 0);
3091 /* ??? Are there other cases we should handle? */
3093 /* Sometimes we may not be able to find the replacement. For
3094 example when the original insn was a MEM in a wider mode,
3095 and the note is part of a sign extension of a narrowed
3096 version of that MEM. Gcc testcase compile/990829-1.c can
3097 generate an example of this situation. Rather than complain
3098 we return false, which will prompt our caller to remove the
3103 size_x = GET_MODE_BITSIZE (GET_MODE (x));
3104 size_sub = GET_MODE_BITSIZE (GET_MODE (sub));
3106 /* Do not frob unchanging MEMs. If a later reference forces the
3107 pseudo to the stack, we can wind up with multiple writes to
3108 an unchanging memory, which is invalid. */
3109 if (RTX_UNCHANGING_P (x) && size_x != size_sub)
3112 /* Don't even consider working with paradoxical subregs,
3113 or the moral equivalent seen here. */
3114 else if (size_x <= size_sub
3115 && int_mode_for_mode (GET_MODE (sub)) != BLKmode)
3117 /* Do a bitfield insertion to mirror what would happen
3124 rtx p = PREV_INSN (insn);
3127 val = gen_reg_rtx (GET_MODE (x));
3128 if (! validate_change (insn, loc, val, 0))
3130 /* Discard the current sequence and put the
3131 ADDRESSOF on stack. */
3137 emit_insn_before (seq, insn);
3138 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3142 store_bit_field (sub, size_x, 0, GET_MODE (x),
3143 val, GET_MODE_SIZE (GET_MODE (sub)));
3145 /* Make sure to unshare any shared rtl that store_bit_field
3146 might have created. */
3147 unshare_all_rtl_again (get_insns ());
3151 p = emit_insn_after (seq, insn);
3152 if (NEXT_INSN (insn))
3153 compute_insns_for_mem (NEXT_INSN (insn),
3154 p ? NEXT_INSN (p) : NULL_RTX,
3159 rtx p = PREV_INSN (insn);
3162 val = extract_bit_field (sub, size_x, 0, 1, NULL_RTX,
3163 GET_MODE (x), GET_MODE (x),
3164 GET_MODE_SIZE (GET_MODE (sub)));
3166 if (! validate_change (insn, loc, val, 0))
3168 /* Discard the current sequence and put the
3169 ADDRESSOF on stack. */
3176 emit_insn_before (seq, insn);
3177 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3181 /* Remember the replacement so that the same one can be done
3182 on the REG_NOTES. */
3183 purge_bitfield_addressof_replacements
3184 = gen_rtx_EXPR_LIST (VOIDmode, x,
3187 purge_bitfield_addressof_replacements));
3189 /* We replaced with a reg -- all done. */
3194 else if (validate_change (insn, loc, sub, 0))
3196 /* Remember the replacement so that the same one can be done
3197 on the REG_NOTES. */
3198 if (GET_CODE (sub) == REG || GET_CODE (sub) == SUBREG)
3202 for (tem = purge_addressof_replacements;
3204 tem = XEXP (XEXP (tem, 1), 1))
3205 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3207 XEXP (XEXP (tem, 1), 0) = sub;
3210 purge_addressof_replacements
3211 = gen_rtx (EXPR_LIST, VOIDmode, XEXP (x, 0),
3212 gen_rtx_EXPR_LIST (VOIDmode, sub,
3213 purge_addressof_replacements));
3221 /* Scan all subexpressions. */
3222 fmt = GET_RTX_FORMAT (code);
3223 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
3226 result &= purge_addressof_1 (&XEXP (x, i), insn, force, 0,
3228 else if (*fmt == 'E')
3229 for (j = 0; j < XVECLEN (x, i); j++)
3230 result &= purge_addressof_1 (&XVECEXP (x, i, j), insn, force, 0,
3237 /* Return a hash value for K, a REG. */
3240 insns_for_mem_hash (const void *k)
3242 /* Use the address of the key for the hash value. */
3243 struct insns_for_mem_entry *m = (struct insns_for_mem_entry *) k;
3244 return htab_hash_pointer (m->key);
3247 /* Return nonzero if K1 and K2 (two REGs) are the same. */
3250 insns_for_mem_comp (const void *k1, const void *k2)
3252 struct insns_for_mem_entry *m1 = (struct insns_for_mem_entry *) k1;
3253 struct insns_for_mem_entry *m2 = (struct insns_for_mem_entry *) k2;
3254 return m1->key == m2->key;
3257 struct insns_for_mem_walk_info
3259 /* The hash table that we are using to record which INSNs use which
3263 /* The INSN we are currently processing. */
3266 /* Zero if we are walking to find ADDRESSOFs, one if we are walking
3267 to find the insns that use the REGs in the ADDRESSOFs. */
3271 /* Called from compute_insns_for_mem via for_each_rtx. If R is a REG
3272 that might be used in an ADDRESSOF expression, record this INSN in
3273 the hash table given by DATA (which is really a pointer to an
3274 insns_for_mem_walk_info structure). */
3277 insns_for_mem_walk (rtx *r, void *data)
3279 struct insns_for_mem_walk_info *ifmwi
3280 = (struct insns_for_mem_walk_info *) data;
3281 struct insns_for_mem_entry tmp;
3282 tmp.insns = NULL_RTX;
3284 if (ifmwi->pass == 0 && *r && GET_CODE (*r) == ADDRESSOF
3285 && GET_CODE (XEXP (*r, 0)) == REG)
3288 tmp.key = XEXP (*r, 0);
3289 e = htab_find_slot (ifmwi->ht, &tmp, INSERT);
3292 *e = ggc_alloc (sizeof (tmp));
3293 memcpy (*e, &tmp, sizeof (tmp));
3296 else if (ifmwi->pass == 1 && *r && GET_CODE (*r) == REG)
3298 struct insns_for_mem_entry *ifme;
3300 ifme = htab_find (ifmwi->ht, &tmp);
3302 /* If we have not already recorded this INSN, do so now. Since
3303 we process the INSNs in order, we know that if we have
3304 recorded it it must be at the front of the list. */
3305 if (ifme && (!ifme->insns || XEXP (ifme->insns, 0) != ifmwi->insn))
3306 ifme->insns = gen_rtx_EXPR_LIST (VOIDmode, ifmwi->insn,
3313 /* Walk the INSNS, until we reach LAST_INSN, recording which INSNs use
3314 which REGs in HT. */
3317 compute_insns_for_mem (rtx insns, rtx last_insn, htab_t ht)
3320 struct insns_for_mem_walk_info ifmwi;
3323 for (ifmwi.pass = 0; ifmwi.pass < 2; ++ifmwi.pass)
3324 for (insn = insns; insn != last_insn; insn = NEXT_INSN (insn))
3328 for_each_rtx (&insn, insns_for_mem_walk, &ifmwi);
3332 /* Helper function for purge_addressof called through for_each_rtx.
3333 Returns true iff the rtl is an ADDRESSOF. */
3336 is_addressof (rtx *rtl, void *data ATTRIBUTE_UNUSED)
3338 return GET_CODE (*rtl) == ADDRESSOF;
3341 /* Eliminate all occurrences of ADDRESSOF from INSNS. Elide any remaining
3342 (MEM (ADDRESSOF)) patterns, and force any needed registers into the
3346 purge_addressof (rtx insns)
3351 /* When we actually purge ADDRESSOFs, we turn REGs into MEMs. That
3352 requires a fixup pass over the instruction stream to correct
3353 INSNs that depended on the REG being a REG, and not a MEM. But,
3354 these fixup passes are slow. Furthermore, most MEMs are not
3355 mentioned in very many instructions. So, we speed up the process
3356 by pre-calculating which REGs occur in which INSNs; that allows
3357 us to perform the fixup passes much more quickly. */
3358 ht = htab_create_ggc (1000, insns_for_mem_hash, insns_for_mem_comp, NULL);
3359 compute_insns_for_mem (insns, NULL_RTX, ht);
3361 postponed_insns = NULL;
3363 for (insn = insns; insn; insn = NEXT_INSN (insn))
3366 if (! purge_addressof_1 (&PATTERN (insn), insn,
3367 asm_noperands (PATTERN (insn)) > 0, 0, 1, ht))
3368 /* If we could not replace the ADDRESSOFs in the insn,
3369 something is wrong. */
3372 if (! purge_addressof_1 (®_NOTES (insn), NULL_RTX, 0, 0, 0, ht))
3374 /* If we could not replace the ADDRESSOFs in the insn's notes,
3375 we can just remove the offending notes instead. */
3378 for (note = REG_NOTES (insn); note; note = XEXP (note, 1))
3380 /* If we find a REG_RETVAL note then the insn is a libcall.
3381 Such insns must have REG_EQUAL notes as well, in order
3382 for later passes of the compiler to work. So it is not
3383 safe to delete the notes here, and instead we abort. */
3384 if (REG_NOTE_KIND (note) == REG_RETVAL)
3386 if (for_each_rtx (¬e, is_addressof, NULL))
3387 remove_note (insn, note);
3392 /* Process the postponed insns. */
3393 while (postponed_insns)
3395 insn = XEXP (postponed_insns, 0);
3396 tmp = postponed_insns;
3397 postponed_insns = XEXP (postponed_insns, 1);
3398 free_INSN_LIST_node (tmp);
3400 if (! purge_addressof_1 (&PATTERN (insn), insn,
3401 asm_noperands (PATTERN (insn)) > 0, 0, 0, ht))
3406 purge_bitfield_addressof_replacements = 0;
3407 purge_addressof_replacements = 0;
3409 /* REGs are shared. purge_addressof will destructively replace a REG
3410 with a MEM, which creates shared MEMs.
3412 Unfortunately, the children of put_reg_into_stack assume that MEMs
3413 referring to the same stack slot are shared (fixup_var_refs and
3414 the associated hash table code).
3416 So, we have to do another unsharing pass after we have flushed any
3417 REGs that had their address taken into the stack.
3419 It may be worth tracking whether or not we converted any REGs into
3420 MEMs to avoid this overhead when it is not needed. */
3421 unshare_all_rtl_again (get_insns ());
3424 /* Convert a SET of a hard subreg to a set of the appropriate hard
3425 register. A subroutine of purge_hard_subreg_sets. */
3428 purge_single_hard_subreg_set (rtx pattern)
3430 rtx reg = SET_DEST (pattern);
3431 enum machine_mode mode = GET_MODE (SET_DEST (pattern));
3434 if (GET_CODE (reg) == SUBREG && GET_CODE (SUBREG_REG (reg)) == REG
3435 && REGNO (SUBREG_REG (reg)) < FIRST_PSEUDO_REGISTER)
3437 offset = subreg_regno_offset (REGNO (SUBREG_REG (reg)),
3438 GET_MODE (SUBREG_REG (reg)),
3441 reg = SUBREG_REG (reg);
3445 if (GET_CODE (reg) == REG && REGNO (reg) < FIRST_PSEUDO_REGISTER)
3447 reg = gen_rtx_REG (mode, REGNO (reg) + offset);
3448 SET_DEST (pattern) = reg;
3452 /* Eliminate all occurrences of SETs of hard subregs from INSNS. The
3453 only such SETs that we expect to see are those left in because
3454 integrate can't handle sets of parts of a return value register.
3456 We don't use alter_subreg because we only want to eliminate subregs
3457 of hard registers. */
3460 purge_hard_subreg_sets (rtx insn)
3462 for (; insn; insn = NEXT_INSN (insn))
3466 rtx pattern = PATTERN (insn);
3467 switch (GET_CODE (pattern))
3470 if (GET_CODE (SET_DEST (pattern)) == SUBREG)
3471 purge_single_hard_subreg_set (pattern);
3476 for (j = XVECLEN (pattern, 0) - 1; j >= 0; j--)
3478 rtx inner_pattern = XVECEXP (pattern, 0, j);
3479 if (GET_CODE (inner_pattern) == SET
3480 && GET_CODE (SET_DEST (inner_pattern)) == SUBREG)
3481 purge_single_hard_subreg_set (inner_pattern);
3492 /* Pass through the INSNS of function FNDECL and convert virtual register
3493 references to hard register references. */
3496 instantiate_virtual_regs (tree fndecl, rtx insns)
3501 /* Compute the offsets to use for this function. */
3502 in_arg_offset = FIRST_PARM_OFFSET (fndecl);
3503 var_offset = STARTING_FRAME_OFFSET;
3504 dynamic_offset = STACK_DYNAMIC_OFFSET (fndecl);
3505 out_arg_offset = STACK_POINTER_OFFSET;
3506 cfa_offset = ARG_POINTER_CFA_OFFSET (fndecl);
3508 /* Scan all variables and parameters of this function. For each that is
3509 in memory, instantiate all virtual registers if the result is a valid
3510 address. If not, we do it later. That will handle most uses of virtual
3511 regs on many machines. */
3512 instantiate_decls (fndecl, 1);
3514 /* Initialize recognition, indicating that volatile is OK. */
3517 /* Scan through all the insns, instantiating every virtual register still
3519 for (insn = insns; insn; insn = NEXT_INSN (insn))
3520 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
3521 || GET_CODE (insn) == CALL_INSN)
3523 instantiate_virtual_regs_1 (&PATTERN (insn), insn, 1);
3524 if (INSN_DELETED_P (insn))
3526 instantiate_virtual_regs_1 (®_NOTES (insn), NULL_RTX, 0);
3527 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
3528 if (GET_CODE (insn) == CALL_INSN)
3529 instantiate_virtual_regs_1 (&CALL_INSN_FUNCTION_USAGE (insn),
3532 /* Past this point all ASM statements should match. Verify that
3533 to avoid failures later in the compilation process. */
3534 if (asm_noperands (PATTERN (insn)) >= 0
3535 && ! check_asm_operands (PATTERN (insn)))
3536 instantiate_virtual_regs_lossage (insn);
3539 /* Instantiate the stack slots for the parm registers, for later use in
3540 addressof elimination. */
3541 for (i = 0; i < max_parm_reg; ++i)
3542 if (parm_reg_stack_loc[i])
3543 instantiate_virtual_regs_1 (&parm_reg_stack_loc[i], NULL_RTX, 0);
3545 /* Now instantiate the remaining register equivalences for debugging info.
3546 These will not be valid addresses. */
3547 instantiate_decls (fndecl, 0);
3549 /* Indicate that, from now on, assign_stack_local should use
3550 frame_pointer_rtx. */
3551 virtuals_instantiated = 1;
3554 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
3555 all virtual registers in their DECL_RTL's.
3557 If VALID_ONLY, do this only if the resulting address is still valid.
3558 Otherwise, always do it. */
3561 instantiate_decls (tree fndecl, int valid_only)
3565 /* Process all parameters of the function. */
3566 for (decl = DECL_ARGUMENTS (fndecl); decl; decl = TREE_CHAIN (decl))
3568 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (decl));
3569 HOST_WIDE_INT size_rtl;
3571 instantiate_decl (DECL_RTL (decl), size, valid_only);
3573 /* If the parameter was promoted, then the incoming RTL mode may be
3574 larger than the declared type size. We must use the larger of
3576 size_rtl = GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl)));
3577 size = MAX (size_rtl, size);
3578 instantiate_decl (DECL_INCOMING_RTL (decl), size, valid_only);
3581 /* Now process all variables defined in the function or its subblocks. */
3582 instantiate_decls_1 (DECL_INITIAL (fndecl), valid_only);
3585 /* Subroutine of instantiate_decls: Process all decls in the given
3586 BLOCK node and all its subblocks. */
3589 instantiate_decls_1 (tree let, int valid_only)
3593 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
3594 if (DECL_RTL_SET_P (t))
3595 instantiate_decl (DECL_RTL (t),
3596 int_size_in_bytes (TREE_TYPE (t)),
3599 /* Process all subblocks. */
3600 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
3601 instantiate_decls_1 (t, valid_only);
3604 /* Subroutine of the preceding procedures: Given RTL representing a
3605 decl and the size of the object, do any instantiation required.
3607 If VALID_ONLY is nonzero, it means that the RTL should only be
3608 changed if the new address is valid. */
3611 instantiate_decl (rtx x, HOST_WIDE_INT size, int valid_only)
3613 enum machine_mode mode;
3616 /* If this is not a MEM, no need to do anything. Similarly if the
3617 address is a constant or a register that is not a virtual register. */
3619 if (x == 0 || GET_CODE (x) != MEM)
3623 if (CONSTANT_P (addr)
3624 || (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == REG)
3625 || (GET_CODE (addr) == REG
3626 && (REGNO (addr) < FIRST_VIRTUAL_REGISTER
3627 || REGNO (addr) > LAST_VIRTUAL_REGISTER)))
3630 /* If we should only do this if the address is valid, copy the address.
3631 We need to do this so we can undo any changes that might make the
3632 address invalid. This copy is unfortunate, but probably can't be
3636 addr = copy_rtx (addr);
3638 instantiate_virtual_regs_1 (&addr, NULL_RTX, 0);
3640 if (valid_only && size >= 0)
3642 unsigned HOST_WIDE_INT decl_size = size;
3644 /* Now verify that the resulting address is valid for every integer or
3645 floating-point mode up to and including SIZE bytes long. We do this
3646 since the object might be accessed in any mode and frame addresses
3649 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3650 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3651 mode = GET_MODE_WIDER_MODE (mode))
3652 if (! memory_address_p (mode, addr))
3655 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
3656 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3657 mode = GET_MODE_WIDER_MODE (mode))
3658 if (! memory_address_p (mode, addr))
3662 /* Put back the address now that we have updated it and we either know
3663 it is valid or we don't care whether it is valid. */
3668 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
3669 is a virtual register, return the equivalent hard register and set the
3670 offset indirectly through the pointer. Otherwise, return 0. */
3673 instantiate_new_reg (rtx x, HOST_WIDE_INT *poffset)
3676 HOST_WIDE_INT offset;
3678 if (x == virtual_incoming_args_rtx)
3679 new = arg_pointer_rtx, offset = in_arg_offset;
3680 else if (x == virtual_stack_vars_rtx)
3681 new = frame_pointer_rtx, offset = var_offset;
3682 else if (x == virtual_stack_dynamic_rtx)
3683 new = stack_pointer_rtx, offset = dynamic_offset;
3684 else if (x == virtual_outgoing_args_rtx)
3685 new = stack_pointer_rtx, offset = out_arg_offset;
3686 else if (x == virtual_cfa_rtx)
3687 new = arg_pointer_rtx, offset = cfa_offset;
3696 /* Called when instantiate_virtual_regs has failed to update the instruction.
3697 Usually this means that non-matching instruction has been emit, however for
3698 asm statements it may be the problem in the constraints. */
3700 instantiate_virtual_regs_lossage (rtx insn)
3702 if (asm_noperands (PATTERN (insn)) >= 0)
3704 error_for_asm (insn, "impossible constraint in `asm'");
3710 /* Given a pointer to a piece of rtx and an optional pointer to the
3711 containing object, instantiate any virtual registers present in it.
3713 If EXTRA_INSNS, we always do the replacement and generate
3714 any extra insns before OBJECT. If it zero, we do nothing if replacement
3717 Return 1 if we either had nothing to do or if we were able to do the
3718 needed replacement. Return 0 otherwise; we only return zero if
3719 EXTRA_INSNS is zero.
3721 We first try some simple transformations to avoid the creation of extra
3725 instantiate_virtual_regs_1 (rtx *loc, rtx object, int extra_insns)
3730 HOST_WIDE_INT offset = 0;
3736 /* Re-start here to avoid recursion in common cases. */
3743 /* We may have detected and deleted invalid asm statements. */
3744 if (object && INSN_P (object) && INSN_DELETED_P (object))
3747 code = GET_CODE (x);
3749 /* Check for some special cases. */
3767 /* We are allowed to set the virtual registers. This means that
3768 the actual register should receive the source minus the
3769 appropriate offset. This is used, for example, in the handling
3770 of non-local gotos. */
3771 if ((new = instantiate_new_reg (SET_DEST (x), &offset)) != 0)
3773 rtx src = SET_SRC (x);
3775 /* We are setting the register, not using it, so the relevant
3776 offset is the negative of the offset to use were we using
3779 instantiate_virtual_regs_1 (&src, NULL_RTX, 0);
3781 /* The only valid sources here are PLUS or REG. Just do
3782 the simplest possible thing to handle them. */
3783 if (GET_CODE (src) != REG && GET_CODE (src) != PLUS)
3785 instantiate_virtual_regs_lossage (object);
3790 if (GET_CODE (src) != REG)
3791 temp = force_operand (src, NULL_RTX);
3794 temp = force_operand (plus_constant (temp, offset), NULL_RTX);
3798 emit_insn_before (seq, object);
3801 if (! validate_change (object, &SET_SRC (x), temp, 0)
3803 instantiate_virtual_regs_lossage (object);
3808 instantiate_virtual_regs_1 (&SET_DEST (x), object, extra_insns);
3813 /* Handle special case of virtual register plus constant. */
3814 if (CONSTANT_P (XEXP (x, 1)))
3816 rtx old, new_offset;
3818 /* Check for (plus (plus VIRT foo) (const_int)) first. */
3819 if (GET_CODE (XEXP (x, 0)) == PLUS)
3821 if ((new = instantiate_new_reg (XEXP (XEXP (x, 0), 0), &offset)))
3823 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 1), object,
3825 new = gen_rtx_PLUS (Pmode, new, XEXP (XEXP (x, 0), 1));
3834 #ifdef POINTERS_EXTEND_UNSIGNED
3835 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
3836 we can commute the PLUS and SUBREG because pointers into the
3837 frame are well-behaved. */
3838 else if (GET_CODE (XEXP (x, 0)) == SUBREG && GET_MODE (x) == ptr_mode
3839 && GET_CODE (XEXP (x, 1)) == CONST_INT
3841 = instantiate_new_reg (SUBREG_REG (XEXP (x, 0)),
3843 && validate_change (object, loc,
3844 plus_constant (gen_lowpart (ptr_mode,
3847 + INTVAL (XEXP (x, 1))),
3851 else if ((new = instantiate_new_reg (XEXP (x, 0), &offset)) == 0)
3853 /* We know the second operand is a constant. Unless the
3854 first operand is a REG (which has been already checked),
3855 it needs to be checked. */
3856 if (GET_CODE (XEXP (x, 0)) != REG)
3864 new_offset = plus_constant (XEXP (x, 1), offset);
3866 /* If the new constant is zero, try to replace the sum with just
3868 if (new_offset == const0_rtx
3869 && validate_change (object, loc, new, 0))
3872 /* Next try to replace the register and new offset.
3873 There are two changes to validate here and we can't assume that
3874 in the case of old offset equals new just changing the register
3875 will yield a valid insn. In the interests of a little efficiency,
3876 however, we only call validate change once (we don't queue up the
3877 changes and then call apply_change_group). */
3881 ? ! validate_change (object, &XEXP (x, 0), new, 0)
3882 : (XEXP (x, 0) = new,
3883 ! validate_change (object, &XEXP (x, 1), new_offset, 0)))
3891 /* Otherwise copy the new constant into a register and replace
3892 constant with that register. */
3893 temp = gen_reg_rtx (Pmode);
3895 if (validate_change (object, &XEXP (x, 1), temp, 0))
3896 emit_insn_before (gen_move_insn (temp, new_offset), object);
3899 /* If that didn't work, replace this expression with a
3900 register containing the sum. */
3903 new = gen_rtx_PLUS (Pmode, new, new_offset);
3906 temp = force_operand (new, NULL_RTX);
3910 emit_insn_before (seq, object);
3911 if (! validate_change (object, loc, temp, 0)
3912 && ! validate_replace_rtx (x, temp, object))
3914 instantiate_virtual_regs_lossage (object);
3923 /* Fall through to generic two-operand expression case. */
3929 case DIV: case UDIV:
3930 case MOD: case UMOD:
3931 case AND: case IOR: case XOR:
3932 case ROTATERT: case ROTATE:
3933 case ASHIFTRT: case LSHIFTRT: case ASHIFT:
3935 case GE: case GT: case GEU: case GTU:
3936 case LE: case LT: case LEU: case LTU:
3937 if (XEXP (x, 1) && ! CONSTANT_P (XEXP (x, 1)))
3938 instantiate_virtual_regs_1 (&XEXP (x, 1), object, extra_insns);
3943 /* Most cases of MEM that convert to valid addresses have already been
3944 handled by our scan of decls. The only special handling we
3945 need here is to make a copy of the rtx to ensure it isn't being
3946 shared if we have to change it to a pseudo.
3948 If the rtx is a simple reference to an address via a virtual register,
3949 it can potentially be shared. In such cases, first try to make it
3950 a valid address, which can also be shared. Otherwise, copy it and
3953 First check for common cases that need no processing. These are
3954 usually due to instantiation already being done on a previous instance
3958 if (CONSTANT_ADDRESS_P (temp)
3959 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3960 || temp == arg_pointer_rtx
3962 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3963 || temp == hard_frame_pointer_rtx
3965 || temp == frame_pointer_rtx)
3968 if (GET_CODE (temp) == PLUS
3969 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
3970 && (XEXP (temp, 0) == frame_pointer_rtx
3971 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
3972 || XEXP (temp, 0) == hard_frame_pointer_rtx
3974 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3975 || XEXP (temp, 0) == arg_pointer_rtx
3980 if (temp == virtual_stack_vars_rtx
3981 || temp == virtual_incoming_args_rtx
3982 || (GET_CODE (temp) == PLUS
3983 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
3984 && (XEXP (temp, 0) == virtual_stack_vars_rtx
3985 || XEXP (temp, 0) == virtual_incoming_args_rtx)))
3987 /* This MEM may be shared. If the substitution can be done without
3988 the need to generate new pseudos, we want to do it in place
3989 so all copies of the shared rtx benefit. The call below will
3990 only make substitutions if the resulting address is still
3993 Note that we cannot pass X as the object in the recursive call
3994 since the insn being processed may not allow all valid
3995 addresses. However, if we were not passed on object, we can
3996 only modify X without copying it if X will have a valid
3999 ??? Also note that this can still lose if OBJECT is an insn that
4000 has less restrictions on an address that some other insn.
4001 In that case, we will modify the shared address. This case
4002 doesn't seem very likely, though. One case where this could
4003 happen is in the case of a USE or CLOBBER reference, but we
4004 take care of that below. */
4006 if (instantiate_virtual_regs_1 (&XEXP (x, 0),
4007 object ? object : x, 0))
4010 /* Otherwise make a copy and process that copy. We copy the entire
4011 RTL expression since it might be a PLUS which could also be
4013 *loc = x = copy_rtx (x);
4016 /* Fall through to generic unary operation case. */
4019 case STRICT_LOW_PART:
4021 case PRE_DEC: case PRE_INC: case POST_DEC: case POST_INC:
4022 case SIGN_EXTEND: case ZERO_EXTEND:
4023 case TRUNCATE: case FLOAT_EXTEND: case FLOAT_TRUNCATE:
4024 case FLOAT: case FIX:
4025 case UNSIGNED_FIX: case UNSIGNED_FLOAT:
4030 case POPCOUNT: case PARITY:
4031 /* These case either have just one operand or we know that we need not
4032 check the rest of the operands. */
4038 /* If the operand is a MEM, see if the change is a valid MEM. If not,
4039 go ahead and make the invalid one, but do it to a copy. For a REG,
4040 just make the recursive call, since there's no chance of a problem. */
4042 if ((GET_CODE (XEXP (x, 0)) == MEM
4043 && instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), XEXP (x, 0),
4045 || (GET_CODE (XEXP (x, 0)) == REG
4046 && instantiate_virtual_regs_1 (&XEXP (x, 0), object, 0)))
4049 XEXP (x, 0) = copy_rtx (XEXP (x, 0));
4054 /* Try to replace with a PLUS. If that doesn't work, compute the sum
4055 in front of this insn and substitute the temporary. */
4056 if ((new = instantiate_new_reg (x, &offset)) != 0)
4058 temp = plus_constant (new, offset);
4059 if (!validate_change (object, loc, temp, 0))
4065 temp = force_operand (temp, NULL_RTX);
4069 emit_insn_before (seq, object);
4070 if (! validate_change (object, loc, temp, 0)
4071 && ! validate_replace_rtx (x, temp, object))
4072 instantiate_virtual_regs_lossage (object);
4079 if (GET_CODE (XEXP (x, 0)) == REG)
4082 else if (GET_CODE (XEXP (x, 0)) == MEM)
4084 /* If we have a (addressof (mem ..)), do any instantiation inside
4085 since we know we'll be making the inside valid when we finally
4086 remove the ADDRESSOF. */
4087 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), NULL_RTX, 0);
4096 /* Scan all subexpressions. */
4097 fmt = GET_RTX_FORMAT (code);
4098 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
4101 if (!instantiate_virtual_regs_1 (&XEXP (x, i), object, extra_insns))
4104 else if (*fmt == 'E')
4105 for (j = 0; j < XVECLEN (x, i); j++)
4106 if (! instantiate_virtual_regs_1 (&XVECEXP (x, i, j), object,
4113 /* Optimization: assuming this function does not receive nonlocal gotos,
4114 delete the handlers for such, as well as the insns to establish
4115 and disestablish them. */
4118 delete_handlers (void)
4121 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4123 /* Delete the handler by turning off the flag that would
4124 prevent jump_optimize from deleting it.
4125 Also permit deletion of the nonlocal labels themselves
4126 if nothing local refers to them. */
4127 if (GET_CODE (insn) == CODE_LABEL)
4131 LABEL_PRESERVE_P (insn) = 0;
4133 /* Remove it from the nonlocal_label list, to avoid confusing
4135 for (t = nonlocal_labels, last_t = 0; t;
4136 last_t = t, t = TREE_CHAIN (t))
4137 if (DECL_RTL (TREE_VALUE (t)) == insn)
4142 nonlocal_labels = TREE_CHAIN (nonlocal_labels);
4144 TREE_CHAIN (last_t) = TREE_CHAIN (t);
4147 if (GET_CODE (insn) == INSN)
4151 for (t = nonlocal_goto_handler_slots; t != 0; t = XEXP (t, 1))
4152 if (reg_mentioned_p (t, PATTERN (insn)))
4158 || (nonlocal_goto_stack_level != 0
4159 && reg_mentioned_p (nonlocal_goto_stack_level,
4161 delete_related_insns (insn);
4166 /* Return the first insn following those generated by `assign_parms'. */
4169 get_first_nonparm_insn (void)
4172 return NEXT_INSN (last_parm_insn);
4173 return get_insns ();
4176 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
4177 This means a type for which function calls must pass an address to the
4178 function or get an address back from the function.
4179 EXP may be a type node or an expression (whose type is tested). */
4182 aggregate_value_p (tree exp, tree fntype)
4184 int i, regno, nregs;
4187 tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
4190 switch (TREE_CODE (fntype))
4193 fntype = get_callee_fndecl (fntype);
4194 fntype = fntype ? TREE_TYPE (fntype) : 0;
4197 fntype = TREE_TYPE (fntype);
4202 case IDENTIFIER_NODE:
4206 /* We don't expect other rtl types here. */
4210 if (TREE_CODE (type) == VOID_TYPE)
4212 if (targetm.calls.return_in_memory (type, fntype))
4214 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
4215 and thus can't be returned in registers. */
4216 if (TREE_ADDRESSABLE (type))
4218 if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
4220 /* Make sure we have suitable call-clobbered regs to return
4221 the value in; if not, we must return it in memory. */
4222 reg = hard_function_value (type, 0, 0);
4224 /* If we have something other than a REG (e.g. a PARALLEL), then assume
4226 if (GET_CODE (reg) != REG)
4229 regno = REGNO (reg);
4230 nregs = HARD_REGNO_NREGS (regno, TYPE_MODE (type));
4231 for (i = 0; i < nregs; i++)
4232 if (! call_used_regs[regno + i])
4237 /* Assign RTL expressions to the function's parameters.
4238 This may involve copying them into registers and using
4239 those registers as the RTL for them. */
4242 assign_parms (tree fndecl)
4245 CUMULATIVE_ARGS args_so_far;
4246 /* Total space needed so far for args on the stack,
4247 given as a constant and a tree-expression. */
4248 struct args_size stack_args_size;
4249 tree fntype = TREE_TYPE (fndecl);
4250 tree fnargs = DECL_ARGUMENTS (fndecl), orig_fnargs;
4251 /* This is used for the arg pointer when referring to stack args. */
4252 rtx internal_arg_pointer;
4253 /* This is a dummy PARM_DECL that we used for the function result if
4254 the function returns a structure. */
4255 tree function_result_decl = 0;
4256 int varargs_setup = 0;
4257 int reg_parm_stack_space = 0;
4258 rtx conversion_insns = 0;
4260 /* Nonzero if function takes extra anonymous args.
4261 This means the last named arg must be on the stack
4262 right before the anonymous ones. */
4264 = (TYPE_ARG_TYPES (fntype) != 0
4265 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
4266 != void_type_node));
4268 current_function_stdarg = stdarg;
4270 /* If the reg that the virtual arg pointer will be translated into is
4271 not a fixed reg or is the stack pointer, make a copy of the virtual
4272 arg pointer, and address parms via the copy. The frame pointer is
4273 considered fixed even though it is not marked as such.
4275 The second time through, simply use ap to avoid generating rtx. */
4277 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
4278 || ! (fixed_regs[ARG_POINTER_REGNUM]
4279 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
4280 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
4282 internal_arg_pointer = virtual_incoming_args_rtx;
4283 current_function_internal_arg_pointer = internal_arg_pointer;
4285 stack_args_size.constant = 0;
4286 stack_args_size.var = 0;
4288 /* If struct value address is treated as the first argument, make it so. */
4289 if (aggregate_value_p (DECL_RESULT (fndecl), fndecl)
4290 && ! current_function_returns_pcc_struct
4291 && targetm.calls.struct_value_rtx (TREE_TYPE (fndecl), 1) == 0)
4293 tree type = build_pointer_type (TREE_TYPE (fntype));
4295 function_result_decl = build_decl (PARM_DECL, NULL_TREE, type);
4297 DECL_ARG_TYPE (function_result_decl) = type;
4298 TREE_CHAIN (function_result_decl) = fnargs;
4299 fnargs = function_result_decl;
4302 orig_fnargs = fnargs;
4304 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
4305 parm_reg_stack_loc = ggc_alloc_cleared (max_parm_reg * sizeof (rtx));
4307 if (SPLIT_COMPLEX_ARGS)
4308 fnargs = split_complex_args (fnargs);
4310 #ifdef REG_PARM_STACK_SPACE
4311 #ifdef MAYBE_REG_PARM_STACK_SPACE
4312 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
4314 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
4318 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
4319 INIT_CUMULATIVE_INCOMING_ARGS (args_so_far, fntype, NULL_RTX);
4321 INIT_CUMULATIVE_ARGS (args_so_far, fntype, NULL_RTX, fndecl);
4324 /* We haven't yet found an argument that we must push and pretend the
4326 current_function_pretend_args_size = 0;
4328 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
4332 enum machine_mode promoted_mode, passed_mode;
4333 enum machine_mode nominal_mode, promoted_nominal_mode;
4335 struct locate_and_pad_arg_data locate;
4336 int passed_pointer = 0;
4337 int did_conversion = 0;
4338 tree passed_type = DECL_ARG_TYPE (parm);
4339 tree nominal_type = TREE_TYPE (parm);
4340 int last_named = 0, named_arg;
4343 int pretend_bytes = 0;
4345 /* Set LAST_NAMED if this is last named arg before last
4351 for (tem = TREE_CHAIN (parm); tem; tem = TREE_CHAIN (tem))
4352 if (DECL_NAME (tem))
4358 /* Set NAMED_ARG if this arg should be treated as a named arg. For
4359 most machines, if this is a varargs/stdarg function, then we treat
4360 the last named arg as if it were anonymous too. */
4361 named_arg = targetm.calls.strict_argument_naming (&args_so_far) ? 1 : ! last_named;
4363 if (TREE_TYPE (parm) == error_mark_node
4364 /* This can happen after weird syntax errors
4365 or if an enum type is defined among the parms. */
4366 || TREE_CODE (parm) != PARM_DECL
4367 || passed_type == NULL)
4369 SET_DECL_RTL (parm, gen_rtx_MEM (BLKmode, const0_rtx));
4370 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4371 TREE_USED (parm) = 1;
4375 /* Find mode of arg as it is passed, and mode of arg
4376 as it should be during execution of this function. */
4377 passed_mode = TYPE_MODE (passed_type);
4378 nominal_mode = TYPE_MODE (nominal_type);
4380 /* If the parm's mode is VOID, its value doesn't matter,
4381 and avoid the usual things like emit_move_insn that could crash. */
4382 if (nominal_mode == VOIDmode)
4384 SET_DECL_RTL (parm, const0_rtx);
4385 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4389 /* If the parm is to be passed as a transparent union, use the
4390 type of the first field for the tests below. We have already
4391 verified that the modes are the same. */
4392 if (DECL_TRANSPARENT_UNION (parm)
4393 || (TREE_CODE (passed_type) == UNION_TYPE
4394 && TYPE_TRANSPARENT_UNION (passed_type)))
4395 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
4397 /* See if this arg was passed by invisible reference. It is if
4398 it is an object whose size depends on the contents of the
4399 object itself or if the machine requires these objects be passed
4402 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (passed_type))
4403 || TREE_ADDRESSABLE (passed_type)
4404 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
4405 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, passed_mode,
4406 passed_type, named_arg)
4410 passed_type = nominal_type = build_pointer_type (passed_type);
4412 passed_mode = nominal_mode = Pmode;
4414 /* See if the frontend wants to pass this by invisible reference. */
4415 else if (passed_type != nominal_type
4416 && POINTER_TYPE_P (passed_type)
4417 && TREE_TYPE (passed_type) == nominal_type)
4419 nominal_type = passed_type;
4421 passed_mode = nominal_mode = Pmode;
4424 promoted_mode = passed_mode;
4426 if (targetm.calls.promote_function_args (TREE_TYPE (fndecl)))
4428 /* Compute the mode in which the arg is actually extended to. */
4429 unsignedp = TREE_UNSIGNED (passed_type);
4430 promoted_mode = promote_mode (passed_type, promoted_mode, &unsignedp, 1);
4433 /* Let machine desc say which reg (if any) the parm arrives in.
4434 0 means it arrives on the stack. */
4435 #ifdef FUNCTION_INCOMING_ARG
4436 entry_parm = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4437 passed_type, named_arg);
4439 entry_parm = FUNCTION_ARG (args_so_far, promoted_mode,
4440 passed_type, named_arg);
4443 if (entry_parm == 0)
4444 promoted_mode = passed_mode;
4446 /* If this is the last named parameter, do any required setup for
4447 varargs or stdargs. We need to know about the case of this being an
4448 addressable type, in which case we skip the registers it
4449 would have arrived in.
4451 For stdargs, LAST_NAMED will be set for two parameters, the one that
4452 is actually the last named, and the dummy parameter. We only
4453 want to do this action once.
4455 Also, indicate when RTL generation is to be suppressed. */
4456 if (last_named && !varargs_setup)
4458 int varargs_pretend_bytes = 0;
4459 targetm.calls.setup_incoming_varargs (&args_so_far, promoted_mode,
4461 &varargs_pretend_bytes, 0);
4464 /* If the back-end has requested extra stack space, record how
4465 much is needed. Do not change pretend_args_size otherwise
4466 since it may be nonzero from an earlier partial argument. */
4467 if (varargs_pretend_bytes > 0)
4468 current_function_pretend_args_size = varargs_pretend_bytes;
4471 /* Determine parm's home in the stack,
4472 in case it arrives in the stack or we should pretend it did.
4474 Compute the stack position and rtx where the argument arrives
4477 There is one complexity here: If this was a parameter that would
4478 have been passed in registers, but wasn't only because it is
4479 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
4480 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
4481 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
4482 0 as it was the previous time. */
4483 in_regs = entry_parm != 0;
4484 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4487 if (!in_regs && !named_arg)
4490 targetm.calls.pretend_outgoing_varargs_named (&args_so_far);
4493 #ifdef FUNCTION_INCOMING_ARG
4494 in_regs = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4496 pretend_named) != 0;
4498 in_regs = FUNCTION_ARG (args_so_far, promoted_mode,
4500 pretend_named) != 0;
4505 /* If this parameter was passed both in registers and in the stack,
4506 use the copy on the stack. */
4507 if (MUST_PASS_IN_STACK (promoted_mode, passed_type))
4510 #ifdef FUNCTION_ARG_PARTIAL_NREGS
4513 partial = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, promoted_mode,
4514 passed_type, named_arg);
4516 #ifndef MAYBE_REG_PARM_STACK_SPACE
4517 /* The caller might already have allocated stack space
4518 for the register parameters. */
4519 && reg_parm_stack_space == 0
4523 /* Part of this argument is passed in registers and part
4524 is passed on the stack. Ask the prologue code to extend
4525 the stack part so that we can recreate the full value.
4527 PRETEND_BYTES is the size of the registers we need to store.
4528 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
4529 stack space that the prologue should allocate.
4531 Internally, gcc assumes that the argument pointer is
4532 aligned to STACK_BOUNDARY bits. This is used both for
4533 alignment optimizations (see init_emit) and to locate
4534 arguments that are aligned to more than PARM_BOUNDARY
4535 bits. We must preserve this invariant by rounding
4536 CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to a stack
4538 pretend_bytes = partial * UNITS_PER_WORD;
4539 current_function_pretend_args_size
4540 = CEIL_ROUND (pretend_bytes, STACK_BYTES);
4542 /* If PRETEND_BYTES != CURRENT_FUNCTION_PRETEND_ARGS_SIZE,
4543 insert the padding before the start of the first pretend
4545 stack_args_size.constant
4546 = (current_function_pretend_args_size - pretend_bytes);
4551 memset (&locate, 0, sizeof (locate));
4552 locate_and_pad_parm (promoted_mode, passed_type, in_regs,
4553 entry_parm ? partial : 0, fndecl,
4554 &stack_args_size, &locate);
4559 /* If we're passing this arg using a reg, make its stack home
4560 the aligned stack slot. */
4562 offset_rtx = ARGS_SIZE_RTX (locate.slot_offset);
4564 offset_rtx = ARGS_SIZE_RTX (locate.offset);
4566 if (offset_rtx == const0_rtx)
4567 stack_parm = gen_rtx_MEM (promoted_mode, internal_arg_pointer);
4569 stack_parm = gen_rtx_MEM (promoted_mode,
4570 gen_rtx_PLUS (Pmode,
4571 internal_arg_pointer,
4574 set_mem_attributes (stack_parm, parm, 1);
4575 if (entry_parm && MEM_ATTRS (stack_parm)->align < PARM_BOUNDARY)
4576 set_mem_align (stack_parm, PARM_BOUNDARY);
4578 /* Set also REG_ATTRS if parameter was passed in a register. */
4580 set_reg_attrs_for_parm (entry_parm, stack_parm);
4583 /* If this parm was passed part in regs and part in memory,
4584 pretend it arrived entirely in memory
4585 by pushing the register-part onto the stack.
4587 In the special case of a DImode or DFmode that is split,
4588 we could put it together in a pseudoreg directly,
4589 but for now that's not worth bothering with. */
4593 /* Handle calls that pass values in multiple non-contiguous
4594 locations. The Irix 6 ABI has examples of this. */
4595 if (GET_CODE (entry_parm) == PARALLEL)
4596 emit_group_store (validize_mem (stack_parm), entry_parm,
4598 int_size_in_bytes (TREE_TYPE (parm)));
4601 move_block_from_reg (REGNO (entry_parm), validize_mem (stack_parm),
4604 entry_parm = stack_parm;
4607 /* If we didn't decide this parm came in a register,
4608 by default it came on the stack. */
4609 if (entry_parm == 0)
4610 entry_parm = stack_parm;
4612 /* Record permanently how this parm was passed. */
4613 DECL_INCOMING_RTL (parm) = entry_parm;
4615 /* If there is actually space on the stack for this parm,
4616 count it in stack_args_size; otherwise set stack_parm to 0
4617 to indicate there is no preallocated stack slot for the parm. */
4619 if (entry_parm == stack_parm
4620 || (GET_CODE (entry_parm) == PARALLEL
4621 && XEXP (XVECEXP (entry_parm, 0, 0), 0) == NULL_RTX)
4622 #if defined (REG_PARM_STACK_SPACE) && ! defined (MAYBE_REG_PARM_STACK_SPACE)
4623 /* On some machines, even if a parm value arrives in a register
4624 there is still an (uninitialized) stack slot allocated for it.
4626 ??? When MAYBE_REG_PARM_STACK_SPACE is defined, we can't tell
4627 whether this parameter already has a stack slot allocated,
4628 because an arg block exists only if current_function_args_size
4629 is larger than some threshold, and we haven't calculated that
4630 yet. So, for now, we just assume that stack slots never exist
4632 || REG_PARM_STACK_SPACE (fndecl) > 0
4636 stack_args_size.constant += pretend_bytes + locate.size.constant;
4637 if (locate.size.var)
4638 ADD_PARM_SIZE (stack_args_size, locate.size.var);
4641 /* No stack slot was pushed for this parm. */
4644 /* Update info on where next arg arrives in registers. */
4646 FUNCTION_ARG_ADVANCE (args_so_far, promoted_mode,
4647 passed_type, named_arg);
4649 /* If we can't trust the parm stack slot to be aligned enough
4650 for its ultimate type, don't use that slot after entry.
4651 We'll make another stack slot, if we need one. */
4653 unsigned int thisparm_boundary
4654 = FUNCTION_ARG_BOUNDARY (promoted_mode, passed_type);
4656 if (GET_MODE_ALIGNMENT (nominal_mode) > thisparm_boundary)
4660 /* If parm was passed in memory, and we need to convert it on entry,
4661 don't store it back in that same slot. */
4662 if (entry_parm == stack_parm
4663 && nominal_mode != BLKmode && nominal_mode != passed_mode)
4666 /* When an argument is passed in multiple locations, we can't
4667 make use of this information, but we can save some copying if
4668 the whole argument is passed in a single register. */
4669 if (GET_CODE (entry_parm) == PARALLEL
4670 && nominal_mode != BLKmode && passed_mode != BLKmode)
4672 int i, len = XVECLEN (entry_parm, 0);
4674 for (i = 0; i < len; i++)
4675 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
4676 && GET_CODE (XEXP (XVECEXP (entry_parm, 0, i), 0)) == REG
4677 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
4679 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
4681 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
4682 DECL_INCOMING_RTL (parm) = entry_parm;
4687 /* ENTRY_PARM is an RTX for the parameter as it arrives,
4688 in the mode in which it arrives.
4689 STACK_PARM is an RTX for a stack slot where the parameter can live
4690 during the function (in case we want to put it there).
4691 STACK_PARM is 0 if no stack slot was pushed for it.
4693 Now output code if necessary to convert ENTRY_PARM to
4694 the type in which this function declares it,
4695 and store that result in an appropriate place,
4696 which may be a pseudo reg, may be STACK_PARM,
4697 or may be a local stack slot if STACK_PARM is 0.
4699 Set DECL_RTL to that place. */
4701 if (nominal_mode == BLKmode
4702 #ifdef BLOCK_REG_PADDING
4703 || (locate.where_pad == (BYTES_BIG_ENDIAN ? upward : downward)
4704 && GET_MODE_SIZE (promoted_mode) < UNITS_PER_WORD)
4706 || GET_CODE (entry_parm) == PARALLEL)
4708 /* If a BLKmode arrives in registers, copy it to a stack slot.
4709 Handle calls that pass values in multiple non-contiguous
4710 locations. The Irix 6 ABI has examples of this. */
4711 if (GET_CODE (entry_parm) == REG
4712 || GET_CODE (entry_parm) == PARALLEL)
4714 int size = int_size_in_bytes (TREE_TYPE (parm));
4715 int size_stored = CEIL_ROUND (size, UNITS_PER_WORD);
4718 /* Note that we will be storing an integral number of words.
4719 So we have to be careful to ensure that we allocate an
4720 integral number of words. We do this below in the
4721 assign_stack_local if space was not allocated in the argument
4722 list. If it was, this will not work if PARM_BOUNDARY is not
4723 a multiple of BITS_PER_WORD. It isn't clear how to fix this
4724 if it becomes a problem. */
4726 if (stack_parm == 0)
4728 stack_parm = assign_stack_local (BLKmode, size_stored, 0);
4729 PUT_MODE (stack_parm, GET_MODE (entry_parm));
4730 set_mem_attributes (stack_parm, parm, 1);
4733 else if (PARM_BOUNDARY % BITS_PER_WORD != 0)
4736 mem = validize_mem (stack_parm);
4738 /* Handle calls that pass values in multiple non-contiguous
4739 locations. The Irix 6 ABI has examples of this. */
4740 if (GET_CODE (entry_parm) == PARALLEL)
4741 emit_group_store (mem, entry_parm, TREE_TYPE (parm), size);
4746 /* If SIZE is that of a mode no bigger than a word, just use
4747 that mode's store operation. */
4748 else if (size <= UNITS_PER_WORD)
4750 enum machine_mode mode
4751 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
4754 #ifdef BLOCK_REG_PADDING
4755 && (size == UNITS_PER_WORD
4756 || (BLOCK_REG_PADDING (mode, TREE_TYPE (parm), 1)
4757 != (BYTES_BIG_ENDIAN ? upward : downward)))
4761 rtx reg = gen_rtx_REG (mode, REGNO (entry_parm));
4762 emit_move_insn (change_address (mem, mode, 0), reg);
4765 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
4766 machine must be aligned to the left before storing
4767 to memory. Note that the previous test doesn't
4768 handle all cases (e.g. SIZE == 3). */
4769 else if (size != UNITS_PER_WORD
4770 #ifdef BLOCK_REG_PADDING
4771 && (BLOCK_REG_PADDING (mode, TREE_TYPE (parm), 1)
4779 int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
4780 rtx reg = gen_rtx_REG (word_mode, REGNO (entry_parm));
4782 x = expand_binop (word_mode, ashl_optab, reg,
4783 GEN_INT (by), 0, 1, OPTAB_WIDEN);
4784 tem = change_address (mem, word_mode, 0);
4785 emit_move_insn (tem, x);
4788 move_block_from_reg (REGNO (entry_parm), mem,
4789 size_stored / UNITS_PER_WORD);
4792 move_block_from_reg (REGNO (entry_parm), mem,
4793 size_stored / UNITS_PER_WORD);
4795 SET_DECL_RTL (parm, stack_parm);
4797 else if (! ((! optimize
4798 && ! DECL_REGISTER (parm))
4799 || TREE_SIDE_EFFECTS (parm)
4800 /* If -ffloat-store specified, don't put explicit
4801 float variables into registers. */
4802 || (flag_float_store
4803 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))
4804 /* Always assign pseudo to structure return or item passed
4805 by invisible reference. */
4806 || passed_pointer || parm == function_result_decl)
4808 /* Store the parm in a pseudoregister during the function, but we
4809 may need to do it in a wider mode. */
4812 unsigned int regno, regnoi = 0, regnor = 0;
4814 unsignedp = TREE_UNSIGNED (TREE_TYPE (parm));
4816 promoted_nominal_mode
4817 = promote_mode (TREE_TYPE (parm), nominal_mode, &unsignedp, 0);
4819 parmreg = gen_reg_rtx (promoted_nominal_mode);
4820 mark_user_reg (parmreg);
4822 /* If this was an item that we received a pointer to, set DECL_RTL
4826 rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type)),
4828 set_mem_attributes (x, parm, 1);
4829 SET_DECL_RTL (parm, x);
4833 SET_DECL_RTL (parm, parmreg);
4834 maybe_set_unchanging (DECL_RTL (parm), parm);
4837 /* Copy the value into the register. */
4838 if (nominal_mode != passed_mode
4839 || promoted_nominal_mode != promoted_mode)
4842 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
4843 mode, by the caller. We now have to convert it to
4844 NOMINAL_MODE, if different. However, PARMREG may be in
4845 a different mode than NOMINAL_MODE if it is being stored
4848 If ENTRY_PARM is a hard register, it might be in a register
4849 not valid for operating in its mode (e.g., an odd-numbered
4850 register for a DFmode). In that case, moves are the only
4851 thing valid, so we can't do a convert from there. This
4852 occurs when the calling sequence allow such misaligned
4855 In addition, the conversion may involve a call, which could
4856 clobber parameters which haven't been copied to pseudo
4857 registers yet. Therefore, we must first copy the parm to
4858 a pseudo reg here, and save the conversion until after all
4859 parameters have been moved. */
4861 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
4863 emit_move_insn (tempreg, validize_mem (entry_parm));
4865 push_to_sequence (conversion_insns);
4866 tempreg = convert_to_mode (nominal_mode, tempreg, unsignedp);
4868 if (GET_CODE (tempreg) == SUBREG
4869 && GET_MODE (tempreg) == nominal_mode
4870 && GET_CODE (SUBREG_REG (tempreg)) == REG
4871 && nominal_mode == passed_mode
4872 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (entry_parm)
4873 && GET_MODE_SIZE (GET_MODE (tempreg))
4874 < GET_MODE_SIZE (GET_MODE (entry_parm)))
4876 /* The argument is already sign/zero extended, so note it
4878 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
4879 SUBREG_PROMOTED_UNSIGNED_SET (tempreg, unsignedp);
4882 /* TREE_USED gets set erroneously during expand_assignment. */
4883 save_tree_used = TREE_USED (parm);
4884 expand_assignment (parm,
4885 make_tree (nominal_type, tempreg), 0);
4886 TREE_USED (parm) = save_tree_used;
4887 conversion_insns = get_insns ();
4892 emit_move_insn (parmreg, validize_mem (entry_parm));
4894 /* If we were passed a pointer but the actual value
4895 can safely live in a register, put it in one. */
4896 if (passed_pointer && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
4897 /* If by-reference argument was promoted, demote it. */
4898 && (TYPE_MODE (TREE_TYPE (parm)) != GET_MODE (DECL_RTL (parm))
4900 && ! DECL_REGISTER (parm))
4901 || TREE_SIDE_EFFECTS (parm)
4902 /* If -ffloat-store specified, don't put explicit
4903 float variables into registers. */
4904 || (flag_float_store
4905 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))))
4907 /* We can't use nominal_mode, because it will have been set to
4908 Pmode above. We must use the actual mode of the parm. */
4909 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
4910 mark_user_reg (parmreg);
4911 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
4913 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
4914 int unsigned_p = TREE_UNSIGNED (TREE_TYPE (parm));
4915 push_to_sequence (conversion_insns);
4916 emit_move_insn (tempreg, DECL_RTL (parm));
4918 convert_to_mode (GET_MODE (parmreg),
4921 emit_move_insn (parmreg, DECL_RTL (parm));
4922 conversion_insns = get_insns();
4927 emit_move_insn (parmreg, DECL_RTL (parm));
4928 SET_DECL_RTL (parm, parmreg);
4929 /* STACK_PARM is the pointer, not the parm, and PARMREG is
4933 #ifdef FUNCTION_ARG_CALLEE_COPIES
4934 /* If we are passed an arg by reference and it is our responsibility
4935 to make a copy, do it now.
4936 PASSED_TYPE and PASSED mode now refer to the pointer, not the
4937 original argument, so we must recreate them in the call to
4938 FUNCTION_ARG_CALLEE_COPIES. */
4939 /* ??? Later add code to handle the case that if the argument isn't
4940 modified, don't do the copy. */
4942 else if (passed_pointer
4943 && FUNCTION_ARG_CALLEE_COPIES (args_so_far,
4944 TYPE_MODE (DECL_ARG_TYPE (parm)),
4945 DECL_ARG_TYPE (parm),
4947 && ! TREE_ADDRESSABLE (DECL_ARG_TYPE (parm)))
4950 tree type = DECL_ARG_TYPE (parm);
4952 /* This sequence may involve a library call perhaps clobbering
4953 registers that haven't been copied to pseudos yet. */
4955 push_to_sequence (conversion_insns);
4957 if (!COMPLETE_TYPE_P (type)
4958 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4959 /* This is a variable sized object. */
4960 copy = gen_rtx_MEM (BLKmode,
4961 allocate_dynamic_stack_space
4962 (expr_size (parm), NULL_RTX,
4963 TYPE_ALIGN (type)));
4965 copy = assign_stack_temp (TYPE_MODE (type),
4966 int_size_in_bytes (type), 1);
4967 set_mem_attributes (copy, parm, 1);
4969 store_expr (parm, copy, 0);
4970 emit_move_insn (parmreg, XEXP (copy, 0));
4971 conversion_insns = get_insns ();
4975 #endif /* FUNCTION_ARG_CALLEE_COPIES */
4977 /* In any case, record the parm's desired stack location
4978 in case we later discover it must live in the stack.
4980 If it is a COMPLEX value, store the stack location for both
4983 if (GET_CODE (parmreg) == CONCAT)
4984 regno = MAX (REGNO (XEXP (parmreg, 0)), REGNO (XEXP (parmreg, 1)));
4986 regno = REGNO (parmreg);
4988 if (regno >= max_parm_reg)
4991 int old_max_parm_reg = max_parm_reg;
4993 /* It's slow to expand this one register at a time,
4994 but it's also rare and we need max_parm_reg to be
4995 precisely correct. */
4996 max_parm_reg = regno + 1;
4997 new = ggc_realloc (parm_reg_stack_loc,
4998 max_parm_reg * sizeof (rtx));
4999 memset (new + old_max_parm_reg, 0,
5000 (max_parm_reg - old_max_parm_reg) * sizeof (rtx));
5001 parm_reg_stack_loc = new;
5004 if (GET_CODE (parmreg) == CONCAT)
5006 enum machine_mode submode = GET_MODE (XEXP (parmreg, 0));
5008 regnor = REGNO (gen_realpart (submode, parmreg));
5009 regnoi = REGNO (gen_imagpart (submode, parmreg));
5011 if (stack_parm != 0)
5013 parm_reg_stack_loc[regnor]
5014 = gen_realpart (submode, stack_parm);
5015 parm_reg_stack_loc[regnoi]
5016 = gen_imagpart (submode, stack_parm);
5020 parm_reg_stack_loc[regnor] = 0;
5021 parm_reg_stack_loc[regnoi] = 0;
5025 parm_reg_stack_loc[REGNO (parmreg)] = stack_parm;
5027 /* Mark the register as eliminable if we did no conversion
5028 and it was copied from memory at a fixed offset,
5029 and the arg pointer was not copied to a pseudo-reg.
5030 If the arg pointer is a pseudo reg or the offset formed
5031 an invalid address, such memory-equivalences
5032 as we make here would screw up life analysis for it. */
5033 if (nominal_mode == passed_mode
5036 && GET_CODE (stack_parm) == MEM
5037 && locate.offset.var == 0
5038 && reg_mentioned_p (virtual_incoming_args_rtx,
5039 XEXP (stack_parm, 0)))
5041 rtx linsn = get_last_insn ();
5044 /* Mark complex types separately. */
5045 if (GET_CODE (parmreg) == CONCAT)
5046 /* Scan backwards for the set of the real and
5048 for (sinsn = linsn; sinsn != 0;
5049 sinsn = prev_nonnote_insn (sinsn))
5051 set = single_set (sinsn);
5053 && SET_DEST (set) == regno_reg_rtx [regnoi])
5055 = gen_rtx_EXPR_LIST (REG_EQUIV,
5056 parm_reg_stack_loc[regnoi],
5059 && SET_DEST (set) == regno_reg_rtx [regnor])
5061 = gen_rtx_EXPR_LIST (REG_EQUIV,
5062 parm_reg_stack_loc[regnor],
5065 else if ((set = single_set (linsn)) != 0
5066 && SET_DEST (set) == parmreg)
5068 = gen_rtx_EXPR_LIST (REG_EQUIV,
5069 stack_parm, REG_NOTES (linsn));
5072 /* For pointer data type, suggest pointer register. */
5073 if (POINTER_TYPE_P (TREE_TYPE (parm)))
5074 mark_reg_pointer (parmreg,
5075 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
5077 /* If something wants our address, try to use ADDRESSOF. */
5078 if (TREE_ADDRESSABLE (parm))
5080 /* If we end up putting something into the stack,
5081 fixup_var_refs_insns will need to make a pass over
5082 all the instructions. It looks through the pending
5083 sequences -- but it can't see the ones in the
5084 CONVERSION_INSNS, if they're not on the sequence
5085 stack. So, we go back to that sequence, just so that
5086 the fixups will happen. */
5087 push_to_sequence (conversion_insns);
5088 put_var_into_stack (parm, /*rescan=*/true);
5089 conversion_insns = get_insns ();
5095 /* Value must be stored in the stack slot STACK_PARM
5096 during function execution. */
5098 if (promoted_mode != nominal_mode)
5100 /* Conversion is required. */
5101 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
5103 emit_move_insn (tempreg, validize_mem (entry_parm));
5105 push_to_sequence (conversion_insns);
5106 entry_parm = convert_to_mode (nominal_mode, tempreg,
5107 TREE_UNSIGNED (TREE_TYPE (parm)));
5109 /* ??? This may need a big-endian conversion on sparc64. */
5110 stack_parm = adjust_address (stack_parm, nominal_mode, 0);
5112 conversion_insns = get_insns ();
5117 if (entry_parm != stack_parm)
5119 if (stack_parm == 0)
5122 = assign_stack_local (GET_MODE (entry_parm),
5123 GET_MODE_SIZE (GET_MODE (entry_parm)),
5125 set_mem_attributes (stack_parm, parm, 1);
5128 if (promoted_mode != nominal_mode)
5130 push_to_sequence (conversion_insns);
5131 emit_move_insn (validize_mem (stack_parm),
5132 validize_mem (entry_parm));
5133 conversion_insns = get_insns ();
5137 emit_move_insn (validize_mem (stack_parm),
5138 validize_mem (entry_parm));
5141 SET_DECL_RTL (parm, stack_parm);
5145 if (SPLIT_COMPLEX_ARGS && fnargs != orig_fnargs)
5147 for (parm = orig_fnargs; parm; parm = TREE_CHAIN (parm))
5149 if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE)
5152 gen_rtx_CONCAT (DECL_MODE (parm),
5154 DECL_RTL (TREE_CHAIN (fnargs))));
5155 DECL_INCOMING_RTL (parm)
5156 = gen_rtx_CONCAT (DECL_MODE (parm),
5157 DECL_INCOMING_RTL (fnargs),
5158 DECL_INCOMING_RTL (TREE_CHAIN (fnargs)));
5159 fnargs = TREE_CHAIN (fnargs);
5163 SET_DECL_RTL (parm, DECL_RTL (fnargs));
5164 DECL_INCOMING_RTL (parm) = DECL_INCOMING_RTL (fnargs);
5166 fnargs = TREE_CHAIN (fnargs);
5170 /* Output all parameter conversion instructions (possibly including calls)
5171 now that all parameters have been copied out of hard registers. */
5172 emit_insn (conversion_insns);
5174 /* If we are receiving a struct value address as the first argument, set up
5175 the RTL for the function result. As this might require code to convert
5176 the transmitted address to Pmode, we do this here to ensure that possible
5177 preliminary conversions of the address have been emitted already. */
5178 if (function_result_decl)
5180 tree result = DECL_RESULT (fndecl);
5181 rtx addr = DECL_RTL (function_result_decl);
5184 addr = convert_memory_address (Pmode, addr);
5185 x = gen_rtx_MEM (DECL_MODE (result), addr);
5186 set_mem_attributes (x, result, 1);
5187 SET_DECL_RTL (result, x);
5190 last_parm_insn = get_last_insn ();
5192 current_function_args_size = stack_args_size.constant;
5194 /* Adjust function incoming argument size for alignment and
5197 #ifdef REG_PARM_STACK_SPACE
5198 #ifndef MAYBE_REG_PARM_STACK_SPACE
5199 current_function_args_size = MAX (current_function_args_size,
5200 REG_PARM_STACK_SPACE (fndecl));
5204 current_function_args_size
5205 = ((current_function_args_size + STACK_BYTES - 1)
5206 / STACK_BYTES) * STACK_BYTES;
5208 #ifdef ARGS_GROW_DOWNWARD
5209 current_function_arg_offset_rtx
5210 = (stack_args_size.var == 0 ? GEN_INT (-stack_args_size.constant)
5211 : expand_expr (size_diffop (stack_args_size.var,
5212 size_int (-stack_args_size.constant)),
5213 NULL_RTX, VOIDmode, 0));
5215 current_function_arg_offset_rtx = ARGS_SIZE_RTX (stack_args_size);
5218 /* See how many bytes, if any, of its args a function should try to pop
5221 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
5222 current_function_args_size);
5224 /* For stdarg.h function, save info about
5225 regs and stack space used by the named args. */
5227 current_function_args_info = args_so_far;
5229 /* Set the rtx used for the function return value. Put this in its
5230 own variable so any optimizers that need this information don't have
5231 to include tree.h. Do this here so it gets done when an inlined
5232 function gets output. */
5234 current_function_return_rtx
5235 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
5236 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
5238 /* If scalar return value was computed in a pseudo-reg, or was a named
5239 return value that got dumped to the stack, copy that to the hard
5241 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
5243 tree decl_result = DECL_RESULT (fndecl);
5244 rtx decl_rtl = DECL_RTL (decl_result);
5246 if (REG_P (decl_rtl)
5247 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
5248 : DECL_REGISTER (decl_result))
5252 #ifdef FUNCTION_OUTGOING_VALUE
5253 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
5256 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
5259 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
5260 /* The delay slot scheduler assumes that current_function_return_rtx
5261 holds the hard register containing the return value, not a
5262 temporary pseudo. */
5263 current_function_return_rtx = real_decl_rtl;
5268 /* If ARGS contains entries with complex types, split the entry into two
5269 entries of the component type. Return a new list of substitutions are
5270 needed, else the old list. */
5273 split_complex_args (tree args)
5277 /* Before allocating memory, check for the common case of no complex. */
5278 for (p = args; p; p = TREE_CHAIN (p))
5279 if (TREE_CODE (TREE_TYPE (p)) == COMPLEX_TYPE)
5284 args = copy_list (args);
5286 for (p = args; p; p = TREE_CHAIN (p))
5288 tree type = TREE_TYPE (p);
5289 if (TREE_CODE (type) == COMPLEX_TYPE)
5292 tree subtype = TREE_TYPE (type);
5294 /* Rewrite the PARM_DECL's type with its component. */
5295 TREE_TYPE (p) = subtype;
5296 DECL_ARG_TYPE (p) = TREE_TYPE (DECL_ARG_TYPE (p));
5297 DECL_MODE (p) = VOIDmode;
5298 DECL_SIZE (p) = NULL;
5299 DECL_SIZE_UNIT (p) = NULL;
5302 /* Build a second synthetic decl. */
5303 decl = build_decl (PARM_DECL, NULL_TREE, subtype);
5304 DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (p);
5305 layout_decl (decl, 0);
5307 /* Splice it in; skip the new decl. */
5308 TREE_CHAIN (decl) = TREE_CHAIN (p);
5309 TREE_CHAIN (p) = decl;
5317 /* Indicate whether REGNO is an incoming argument to the current function
5318 that was promoted to a wider mode. If so, return the RTX for the
5319 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
5320 that REGNO is promoted from and whether the promotion was signed or
5324 promoted_input_arg (unsigned int regno, enum machine_mode *pmode, int *punsignedp)
5328 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
5329 arg = TREE_CHAIN (arg))
5330 if (GET_CODE (DECL_INCOMING_RTL (arg)) == REG
5331 && REGNO (DECL_INCOMING_RTL (arg)) == regno
5332 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
5334 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
5335 int unsignedp = TREE_UNSIGNED (TREE_TYPE (arg));
5337 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
5338 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
5339 && mode != DECL_MODE (arg))
5341 *pmode = DECL_MODE (arg);
5342 *punsignedp = unsignedp;
5343 return DECL_INCOMING_RTL (arg);
5351 /* Compute the size and offset from the start of the stacked arguments for a
5352 parm passed in mode PASSED_MODE and with type TYPE.
5354 INITIAL_OFFSET_PTR points to the current offset into the stacked
5357 The starting offset and size for this parm are returned in
5358 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
5359 nonzero, the offset is that of stack slot, which is returned in
5360 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
5361 padding required from the initial offset ptr to the stack slot.
5363 IN_REGS is nonzero if the argument will be passed in registers. It will
5364 never be set if REG_PARM_STACK_SPACE is not defined.
5366 FNDECL is the function in which the argument was defined.
5368 There are two types of rounding that are done. The first, controlled by
5369 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
5370 list to be aligned to the specific boundary (in bits). This rounding
5371 affects the initial and starting offsets, but not the argument size.
5373 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
5374 optionally rounds the size of the parm to PARM_BOUNDARY. The
5375 initial offset is not affected by this rounding, while the size always
5376 is and the starting offset may be. */
5378 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
5379 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
5380 callers pass in the total size of args so far as
5381 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
5384 locate_and_pad_parm (enum machine_mode passed_mode, tree type, int in_regs,
5385 int partial, tree fndecl ATTRIBUTE_UNUSED,
5386 struct args_size *initial_offset_ptr,
5387 struct locate_and_pad_arg_data *locate)
5390 enum direction where_pad;
5392 int reg_parm_stack_space = 0;
5393 int part_size_in_regs;
5395 #ifdef REG_PARM_STACK_SPACE
5396 #ifdef MAYBE_REG_PARM_STACK_SPACE
5397 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
5399 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
5402 /* If we have found a stack parm before we reach the end of the
5403 area reserved for registers, skip that area. */
5406 if (reg_parm_stack_space > 0)
5408 if (initial_offset_ptr->var)
5410 initial_offset_ptr->var
5411 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
5412 ssize_int (reg_parm_stack_space));
5413 initial_offset_ptr->constant = 0;
5415 else if (initial_offset_ptr->constant < reg_parm_stack_space)
5416 initial_offset_ptr->constant = reg_parm_stack_space;
5419 #endif /* REG_PARM_STACK_SPACE */
5421 part_size_in_regs = 0;
5422 if (reg_parm_stack_space == 0)
5423 part_size_in_regs = ((partial * UNITS_PER_WORD)
5424 / (PARM_BOUNDARY / BITS_PER_UNIT)
5425 * (PARM_BOUNDARY / BITS_PER_UNIT));
5428 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
5429 where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
5430 boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
5431 locate->where_pad = where_pad;
5433 #ifdef ARGS_GROW_DOWNWARD
5434 locate->slot_offset.constant = -initial_offset_ptr->constant;
5435 if (initial_offset_ptr->var)
5436 locate->slot_offset.var = size_binop (MINUS_EXPR, ssize_int (0),
5437 initial_offset_ptr->var);
5441 if (where_pad != none
5442 && (!host_integerp (sizetree, 1)
5443 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5444 s2 = round_up (s2, PARM_BOUNDARY / BITS_PER_UNIT);
5445 SUB_PARM_SIZE (locate->slot_offset, s2);
5448 locate->slot_offset.constant += part_size_in_regs;
5451 #ifdef REG_PARM_STACK_SPACE
5452 || REG_PARM_STACK_SPACE (fndecl) > 0
5455 pad_to_arg_alignment (&locate->slot_offset, boundary,
5456 &locate->alignment_pad);
5458 locate->size.constant = (-initial_offset_ptr->constant
5459 - locate->slot_offset.constant);
5460 if (initial_offset_ptr->var)
5461 locate->size.var = size_binop (MINUS_EXPR,
5462 size_binop (MINUS_EXPR,
5464 initial_offset_ptr->var),
5465 locate->slot_offset.var);
5467 /* Pad_below needs the pre-rounded size to know how much to pad
5469 locate->offset = locate->slot_offset;
5470 if (where_pad == downward)
5471 pad_below (&locate->offset, passed_mode, sizetree);
5473 #else /* !ARGS_GROW_DOWNWARD */
5475 #ifdef REG_PARM_STACK_SPACE
5476 || REG_PARM_STACK_SPACE (fndecl) > 0
5479 pad_to_arg_alignment (initial_offset_ptr, boundary,
5480 &locate->alignment_pad);
5481 locate->slot_offset = *initial_offset_ptr;
5483 #ifdef PUSH_ROUNDING
5484 if (passed_mode != BLKmode)
5485 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
5488 /* Pad_below needs the pre-rounded size to know how much to pad below
5489 so this must be done before rounding up. */
5490 locate->offset = locate->slot_offset;
5491 if (where_pad == downward)
5492 pad_below (&locate->offset, passed_mode, sizetree);
5494 if (where_pad != none
5495 && (!host_integerp (sizetree, 1)
5496 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5497 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5499 ADD_PARM_SIZE (locate->size, sizetree);
5501 locate->size.constant -= part_size_in_regs;
5502 #endif /* ARGS_GROW_DOWNWARD */
5505 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
5506 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
5509 pad_to_arg_alignment (struct args_size *offset_ptr, int boundary,
5510 struct args_size *alignment_pad)
5512 tree save_var = NULL_TREE;
5513 HOST_WIDE_INT save_constant = 0;
5514 HOST_WIDE_INT sp_offset = STACK_POINTER_OFFSET;
5516 #ifdef SPARC_STACK_BOUNDARY_HACK
5517 /* The sparc port has a bug. It sometimes claims a STACK_BOUNDARY
5518 higher than the real alignment of %sp. However, when it does this,
5519 the alignment of %sp+STACK_POINTER_OFFSET will be STACK_BOUNDARY.
5520 This is a temporary hack while the sparc port is fixed. */
5521 if (SPARC_STACK_BOUNDARY_HACK)
5525 int boundary_in_bytes = boundary / BITS_PER_UNIT;
5527 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5529 save_var = offset_ptr->var;
5530 save_constant = offset_ptr->constant;
5533 alignment_pad->var = NULL_TREE;
5534 alignment_pad->constant = 0;
5536 if (boundary > BITS_PER_UNIT)
5538 if (offset_ptr->var)
5540 tree sp_offset_tree = ssize_int (sp_offset);
5541 tree offset = size_binop (PLUS_EXPR,
5542 ARGS_SIZE_TREE (*offset_ptr),
5544 #ifdef ARGS_GROW_DOWNWARD
5545 tree rounded = round_down (offset, boundary / BITS_PER_UNIT);
5547 tree rounded = round_up (offset, boundary / BITS_PER_UNIT);
5550 offset_ptr->var = size_binop (MINUS_EXPR, rounded, sp_offset_tree);
5551 /* ARGS_SIZE_TREE includes constant term. */
5552 offset_ptr->constant = 0;
5553 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5554 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
5559 offset_ptr->constant = -sp_offset +
5560 #ifdef ARGS_GROW_DOWNWARD
5561 FLOOR_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
5563 CEIL_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
5565 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5566 alignment_pad->constant = offset_ptr->constant - save_constant;
5572 pad_below (struct args_size *offset_ptr, enum machine_mode passed_mode, tree sizetree)
5574 if (passed_mode != BLKmode)
5576 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
5577 offset_ptr->constant
5578 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
5579 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
5580 - GET_MODE_SIZE (passed_mode));
5584 if (TREE_CODE (sizetree) != INTEGER_CST
5585 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
5587 /* Round the size up to multiple of PARM_BOUNDARY bits. */
5588 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5590 ADD_PARM_SIZE (*offset_ptr, s2);
5591 SUB_PARM_SIZE (*offset_ptr, sizetree);
5596 /* Walk the tree of blocks describing the binding levels within a function
5597 and warn about uninitialized variables.
5598 This is done after calling flow_analysis and before global_alloc
5599 clobbers the pseudo-regs to hard regs. */
5602 uninitialized_vars_warning (tree block)
5605 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5607 if (warn_uninitialized
5608 && TREE_CODE (decl) == VAR_DECL
5609 /* These warnings are unreliable for and aggregates
5610 because assigning the fields one by one can fail to convince
5611 flow.c that the entire aggregate was initialized.
5612 Unions are troublesome because members may be shorter. */
5613 && ! AGGREGATE_TYPE_P (TREE_TYPE (decl))
5614 && DECL_RTL (decl) != 0
5615 && GET_CODE (DECL_RTL (decl)) == REG
5616 /* Global optimizations can make it difficult to determine if a
5617 particular variable has been initialized. However, a VAR_DECL
5618 with a nonzero DECL_INITIAL had an initializer, so do not
5619 claim it is potentially uninitialized.
5621 When the DECL_INITIAL is NULL call the language hook to tell us
5622 if we want to warn. */
5623 && (DECL_INITIAL (decl) == NULL_TREE || lang_hooks.decl_uninit (decl))
5624 && regno_uninitialized (REGNO (DECL_RTL (decl))))
5625 warning ("%J'%D' might be used uninitialized in this function",
5628 && TREE_CODE (decl) == VAR_DECL
5629 && DECL_RTL (decl) != 0
5630 && GET_CODE (DECL_RTL (decl)) == REG
5631 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5632 warning ("%Jvariable '%D' might be clobbered by `longjmp' or `vfork'",
5635 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5636 uninitialized_vars_warning (sub);
5639 /* Do the appropriate part of uninitialized_vars_warning
5640 but for arguments instead of local variables. */
5643 setjmp_args_warning (void)
5646 for (decl = DECL_ARGUMENTS (current_function_decl);
5647 decl; decl = TREE_CHAIN (decl))
5648 if (DECL_RTL (decl) != 0
5649 && GET_CODE (DECL_RTL (decl)) == REG
5650 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5651 warning ("%Jargument '%D' might be clobbered by `longjmp' or `vfork'",
5655 /* If this function call setjmp, put all vars into the stack
5656 unless they were declared `register'. */
5659 setjmp_protect (tree block)
5662 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5663 if ((TREE_CODE (decl) == VAR_DECL
5664 || TREE_CODE (decl) == PARM_DECL)
5665 && DECL_RTL (decl) != 0
5666 && (GET_CODE (DECL_RTL (decl)) == REG
5667 || (GET_CODE (DECL_RTL (decl)) == MEM
5668 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5669 /* If this variable came from an inline function, it must be
5670 that its life doesn't overlap the setjmp. If there was a
5671 setjmp in the function, it would already be in memory. We
5672 must exclude such variable because their DECL_RTL might be
5673 set to strange things such as virtual_stack_vars_rtx. */
5674 && ! DECL_FROM_INLINE (decl)
5676 #ifdef NON_SAVING_SETJMP
5677 /* If longjmp doesn't restore the registers,
5678 don't put anything in them. */
5682 ! DECL_REGISTER (decl)))
5683 put_var_into_stack (decl, /*rescan=*/true);
5684 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5685 setjmp_protect (sub);
5688 /* Like the previous function, but for args instead of local variables. */
5691 setjmp_protect_args (void)
5694 for (decl = DECL_ARGUMENTS (current_function_decl);
5695 decl; decl = TREE_CHAIN (decl))
5696 if ((TREE_CODE (decl) == VAR_DECL
5697 || TREE_CODE (decl) == PARM_DECL)
5698 && DECL_RTL (decl) != 0
5699 && (GET_CODE (DECL_RTL (decl)) == REG
5700 || (GET_CODE (DECL_RTL (decl)) == MEM
5701 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5703 /* If longjmp doesn't restore the registers,
5704 don't put anything in them. */
5705 #ifdef NON_SAVING_SETJMP
5709 ! DECL_REGISTER (decl)))
5710 put_var_into_stack (decl, /*rescan=*/true);
5713 /* Return the context-pointer register corresponding to DECL,
5714 or 0 if it does not need one. */
5717 lookup_static_chain (tree decl)
5719 tree context = decl_function_context (decl);
5723 || (TREE_CODE (decl) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (decl)))
5726 /* We treat inline_function_decl as an alias for the current function
5727 because that is the inline function whose vars, types, etc.
5728 are being merged into the current function.
5729 See expand_inline_function. */
5730 if (context == current_function_decl || context == inline_function_decl)
5731 return virtual_stack_vars_rtx;
5733 for (link = context_display; link; link = TREE_CHAIN (link))
5734 if (TREE_PURPOSE (link) == context)
5735 return RTL_EXPR_RTL (TREE_VALUE (link));
5740 /* Convert a stack slot address ADDR for variable VAR
5741 (from a containing function)
5742 into an address valid in this function (using a static chain). */
5745 fix_lexical_addr (rtx addr, tree var)
5748 HOST_WIDE_INT displacement;
5749 tree context = decl_function_context (var);
5750 struct function *fp;
5753 /* If this is the present function, we need not do anything. */
5754 if (context == current_function_decl || context == inline_function_decl)
5757 fp = find_function_data (context);
5759 if (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == MEM)
5760 addr = XEXP (XEXP (addr, 0), 0);
5762 /* Decode given address as base reg plus displacement. */
5763 if (GET_CODE (addr) == REG)
5764 basereg = addr, displacement = 0;
5765 else if (GET_CODE (addr) == PLUS && GET_CODE (XEXP (addr, 1)) == CONST_INT)
5766 basereg = XEXP (addr, 0), displacement = INTVAL (XEXP (addr, 1));
5770 /* We accept vars reached via the containing function's
5771 incoming arg pointer and via its stack variables pointer. */
5772 if (basereg == fp->internal_arg_pointer)
5774 /* If reached via arg pointer, get the arg pointer value
5775 out of that function's stack frame.
5777 There are two cases: If a separate ap is needed, allocate a
5778 slot in the outer function for it and dereference it that way.
5779 This is correct even if the real ap is actually a pseudo.
5780 Otherwise, just adjust the offset from the frame pointer to
5783 #ifdef NEED_SEPARATE_AP
5786 addr = get_arg_pointer_save_area (fp);
5787 addr = fix_lexical_addr (XEXP (addr, 0), var);
5788 addr = memory_address (Pmode, addr);
5790 base = gen_rtx_MEM (Pmode, addr);
5791 set_mem_alias_set (base, get_frame_alias_set ());
5792 base = copy_to_reg (base);
5794 displacement += (FIRST_PARM_OFFSET (context) - STARTING_FRAME_OFFSET);
5795 base = lookup_static_chain (var);
5799 else if (basereg == virtual_stack_vars_rtx)
5801 /* This is the same code as lookup_static_chain, duplicated here to
5802 avoid an extra call to decl_function_context. */
5805 for (link = context_display; link; link = TREE_CHAIN (link))
5806 if (TREE_PURPOSE (link) == context)
5808 base = RTL_EXPR_RTL (TREE_VALUE (link));
5816 /* Use same offset, relative to appropriate static chain or argument
5818 return plus_constant (base, displacement);
5821 /* Return the address of the trampoline for entering nested fn FUNCTION.
5822 If necessary, allocate a trampoline (in the stack frame)
5823 and emit rtl to initialize its contents (at entry to this function). */
5826 trampoline_address (tree function)
5831 struct function *fp;
5834 /* Find an existing trampoline and return it. */
5835 for (link = trampoline_list; link; link = TREE_CHAIN (link))
5836 if (TREE_PURPOSE (link) == function)
5838 adjust_trampoline_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0));
5840 for (fp = outer_function_chain; fp; fp = fp->outer)
5841 for (link = fp->x_trampoline_list; link; link = TREE_CHAIN (link))
5842 if (TREE_PURPOSE (link) == function)
5844 tramp = fix_lexical_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0),
5846 return adjust_trampoline_addr (tramp);
5849 /* None exists; we must make one. */
5851 /* Find the `struct function' for the function containing FUNCTION. */
5853 fn_context = decl_function_context (function);
5854 if (fn_context != current_function_decl
5855 && fn_context != inline_function_decl)
5856 fp = find_function_data (fn_context);
5858 /* Allocate run-time space for this trampoline. */
5859 /* If rounding needed, allocate extra space
5860 to ensure we have TRAMPOLINE_SIZE bytes left after rounding up. */
5861 #define TRAMPOLINE_REAL_SIZE \
5862 (TRAMPOLINE_SIZE + (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT) - 1)
5863 tramp = assign_stack_local_1 (BLKmode, TRAMPOLINE_REAL_SIZE, 0,
5865 /* Record the trampoline for reuse and note it for later initialization
5866 by expand_function_end. */
5869 rtlexp = make_node (RTL_EXPR);
5870 RTL_EXPR_RTL (rtlexp) = tramp;
5871 fp->x_trampoline_list = tree_cons (function, rtlexp,
5872 fp->x_trampoline_list);
5876 /* Make the RTL_EXPR node temporary, not momentary, so that the
5877 trampoline_list doesn't become garbage. */
5878 rtlexp = make_node (RTL_EXPR);
5880 RTL_EXPR_RTL (rtlexp) = tramp;
5881 trampoline_list = tree_cons (function, rtlexp, trampoline_list);
5884 tramp = fix_lexical_addr (XEXP (tramp, 0), function);
5885 return adjust_trampoline_addr (tramp);
5888 /* Given a trampoline address,
5889 round it to multiple of TRAMPOLINE_ALIGNMENT. */
5892 round_trampoline_addr (rtx tramp)
5894 /* Round address up to desired boundary. */
5895 rtx temp = gen_reg_rtx (Pmode);
5896 rtx addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
5897 rtx mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
5899 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
5900 temp, 0, OPTAB_LIB_WIDEN);
5901 tramp = expand_simple_binop (Pmode, AND, temp, mask,
5902 temp, 0, OPTAB_LIB_WIDEN);
5907 /* Given a trampoline address, round it then apply any
5908 platform-specific adjustments so that the result can be used for a
5912 adjust_trampoline_addr (rtx tramp)
5914 tramp = round_trampoline_addr (tramp);
5915 #ifdef TRAMPOLINE_ADJUST_ADDRESS
5916 TRAMPOLINE_ADJUST_ADDRESS (tramp);
5921 /* Put all this function's BLOCK nodes including those that are chained
5922 onto the first block into a vector, and return it.
5923 Also store in each NOTE for the beginning or end of a block
5924 the index of that block in the vector.
5925 The arguments are BLOCK, the chain of top-level blocks of the function,
5926 and INSNS, the insn chain of the function. */
5929 identify_blocks (void)
5932 tree *block_vector, *last_block_vector;
5934 tree block = DECL_INITIAL (current_function_decl);
5939 /* Fill the BLOCK_VECTOR with all of the BLOCKs in this function, in
5940 depth-first order. */
5941 block_vector = get_block_vector (block, &n_blocks);
5942 block_stack = xmalloc (n_blocks * sizeof (tree));
5944 last_block_vector = identify_blocks_1 (get_insns (),
5946 block_vector + n_blocks,
5949 /* If we didn't use all of the subblocks, we've misplaced block notes. */
5950 /* ??? This appears to happen all the time. Latent bugs elsewhere? */
5951 if (0 && last_block_vector != block_vector + n_blocks)
5954 free (block_vector);
5958 /* Subroutine of identify_blocks. Do the block substitution on the
5959 insn chain beginning with INSNS. Recurse for CALL_PLACEHOLDER chains.
5961 BLOCK_STACK is pushed and popped for each BLOCK_BEGIN/BLOCK_END pair.
5962 BLOCK_VECTOR is incremented for each block seen. */
5965 identify_blocks_1 (rtx insns, tree *block_vector, tree *end_block_vector,
5966 tree *orig_block_stack)
5969 tree *block_stack = orig_block_stack;
5971 for (insn = insns; insn; insn = NEXT_INSN (insn))
5973 if (GET_CODE (insn) == NOTE)
5975 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
5979 /* If there are more block notes than BLOCKs, something
5981 if (block_vector == end_block_vector)
5984 b = *block_vector++;
5985 NOTE_BLOCK (insn) = b;
5988 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
5990 /* If there are more NOTE_INSN_BLOCK_ENDs than
5991 NOTE_INSN_BLOCK_BEGs, something is badly wrong. */
5992 if (block_stack == orig_block_stack)
5995 NOTE_BLOCK (insn) = *--block_stack;
5998 else if (GET_CODE (insn) == CALL_INSN
5999 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
6001 rtx cp = PATTERN (insn);
6003 block_vector = identify_blocks_1 (XEXP (cp, 0), block_vector,
6004 end_block_vector, block_stack);
6006 block_vector = identify_blocks_1 (XEXP (cp, 1), block_vector,
6007 end_block_vector, block_stack);
6009 block_vector = identify_blocks_1 (XEXP (cp, 2), block_vector,
6010 end_block_vector, block_stack);
6014 /* If there are more NOTE_INSN_BLOCK_BEGINs than NOTE_INSN_BLOCK_ENDs,
6015 something is badly wrong. */
6016 if (block_stack != orig_block_stack)
6019 return block_vector;
6022 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
6023 and create duplicate blocks. */
6024 /* ??? Need an option to either create block fragments or to create
6025 abstract origin duplicates of a source block. It really depends
6026 on what optimization has been performed. */
6029 reorder_blocks (void)
6031 tree block = DECL_INITIAL (current_function_decl);
6032 varray_type block_stack;
6034 if (block == NULL_TREE)
6037 VARRAY_TREE_INIT (block_stack, 10, "block_stack");
6039 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
6040 reorder_blocks_0 (block);
6042 /* Prune the old trees away, so that they don't get in the way. */
6043 BLOCK_SUBBLOCKS (block) = NULL_TREE;
6044 BLOCK_CHAIN (block) = NULL_TREE;
6046 /* Recreate the block tree from the note nesting. */
6047 reorder_blocks_1 (get_insns (), block, &block_stack);
6048 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
6050 /* Remove deleted blocks from the block fragment chains. */
6051 reorder_fix_fragments (block);
6054 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
6057 reorder_blocks_0 (tree block)
6061 TREE_ASM_WRITTEN (block) = 0;
6062 reorder_blocks_0 (BLOCK_SUBBLOCKS (block));
6063 block = BLOCK_CHAIN (block);
6068 reorder_blocks_1 (rtx insns, tree current_block, varray_type *p_block_stack)
6072 for (insn = insns; insn; insn = NEXT_INSN (insn))
6074 if (GET_CODE (insn) == NOTE)
6076 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
6078 tree block = NOTE_BLOCK (insn);
6080 /* If we have seen this block before, that means it now
6081 spans multiple address regions. Create a new fragment. */
6082 if (TREE_ASM_WRITTEN (block))
6084 tree new_block = copy_node (block);
6087 origin = (BLOCK_FRAGMENT_ORIGIN (block)
6088 ? BLOCK_FRAGMENT_ORIGIN (block)
6090 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
6091 BLOCK_FRAGMENT_CHAIN (new_block)
6092 = BLOCK_FRAGMENT_CHAIN (origin);
6093 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
6095 NOTE_BLOCK (insn) = new_block;
6099 BLOCK_SUBBLOCKS (block) = 0;
6100 TREE_ASM_WRITTEN (block) = 1;
6101 /* When there's only one block for the entire function,
6102 current_block == block and we mustn't do this, it
6103 will cause infinite recursion. */
6104 if (block != current_block)
6106 BLOCK_SUPERCONTEXT (block) = current_block;
6107 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
6108 BLOCK_SUBBLOCKS (current_block) = block;
6109 current_block = block;
6111 VARRAY_PUSH_TREE (*p_block_stack, block);
6113 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
6115 NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack);
6116 VARRAY_POP (*p_block_stack);
6117 BLOCK_SUBBLOCKS (current_block)
6118 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
6119 current_block = BLOCK_SUPERCONTEXT (current_block);
6122 else if (GET_CODE (insn) == CALL_INSN
6123 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
6125 rtx cp = PATTERN (insn);
6126 reorder_blocks_1 (XEXP (cp, 0), current_block, p_block_stack);
6128 reorder_blocks_1 (XEXP (cp, 1), current_block, p_block_stack);
6130 reorder_blocks_1 (XEXP (cp, 2), current_block, p_block_stack);
6135 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
6136 appears in the block tree, select one of the fragments to become
6137 the new origin block. */
6140 reorder_fix_fragments (tree block)
6144 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
6145 tree new_origin = NULL_TREE;
6149 if (! TREE_ASM_WRITTEN (dup_origin))
6151 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
6153 /* Find the first of the remaining fragments. There must
6154 be at least one -- the current block. */
6155 while (! TREE_ASM_WRITTEN (new_origin))
6156 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
6157 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
6160 else if (! dup_origin)
6163 /* Re-root the rest of the fragments to the new origin. In the
6164 case that DUP_ORIGIN was null, that means BLOCK was the origin
6165 of a chain of fragments and we want to remove those fragments
6166 that didn't make it to the output. */
6169 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
6174 if (TREE_ASM_WRITTEN (chain))
6176 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
6178 pp = &BLOCK_FRAGMENT_CHAIN (chain);
6180 chain = BLOCK_FRAGMENT_CHAIN (chain);
6185 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
6186 block = BLOCK_CHAIN (block);
6190 /* Reverse the order of elements in the chain T of blocks,
6191 and return the new head of the chain (old last element). */
6194 blocks_nreverse (tree t)
6196 tree prev = 0, decl, next;
6197 for (decl = t; decl; decl = next)
6199 next = BLOCK_CHAIN (decl);
6200 BLOCK_CHAIN (decl) = prev;
6206 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
6207 non-NULL, list them all into VECTOR, in a depth-first preorder
6208 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
6212 all_blocks (tree block, tree *vector)
6218 TREE_ASM_WRITTEN (block) = 0;
6220 /* Record this block. */
6222 vector[n_blocks] = block;
6226 /* Record the subblocks, and their subblocks... */
6227 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
6228 vector ? vector + n_blocks : 0);
6229 block = BLOCK_CHAIN (block);
6235 /* Return a vector containing all the blocks rooted at BLOCK. The
6236 number of elements in the vector is stored in N_BLOCKS_P. The
6237 vector is dynamically allocated; it is the caller's responsibility
6238 to call `free' on the pointer returned. */
6241 get_block_vector (tree block, int *n_blocks_p)
6245 *n_blocks_p = all_blocks (block, NULL);
6246 block_vector = xmalloc (*n_blocks_p * sizeof (tree));
6247 all_blocks (block, block_vector);
6249 return block_vector;
6252 static GTY(()) int next_block_index = 2;
6254 /* Set BLOCK_NUMBER for all the blocks in FN. */
6257 number_blocks (tree fn)
6263 /* For SDB and XCOFF debugging output, we start numbering the blocks
6264 from 1 within each function, rather than keeping a running
6266 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
6267 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
6268 next_block_index = 1;
6271 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
6273 /* The top-level BLOCK isn't numbered at all. */
6274 for (i = 1; i < n_blocks; ++i)
6275 /* We number the blocks from two. */
6276 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
6278 free (block_vector);
6283 /* If VAR is present in a subblock of BLOCK, return the subblock. */
6286 debug_find_var_in_block_tree (tree var, tree block)
6290 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
6294 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
6296 tree ret = debug_find_var_in_block_tree (var, t);
6304 /* Allocate a function structure for FNDECL and set its contents
6308 allocate_struct_function (tree fndecl)
6312 cfun = ggc_alloc_cleared (sizeof (struct function));
6314 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
6316 cfun->stack_alignment_needed = STACK_BOUNDARY;
6317 cfun->preferred_stack_boundary = STACK_BOUNDARY;
6319 current_function_funcdef_no = funcdef_no++;
6321 cfun->function_frequency = FUNCTION_FREQUENCY_NORMAL;
6323 init_stmt_for_function ();
6324 init_eh_for_function ();
6327 init_varasm_status (cfun);
6329 (*lang_hooks.function.init) (cfun);
6330 if (init_machine_status)
6331 cfun->machine = (*init_machine_status) ();
6336 DECL_SAVED_INSNS (fndecl) = cfun;
6337 cfun->decl = fndecl;
6339 current_function_name = (*lang_hooks.decl_printable_name) (fndecl, 2);
6341 result = DECL_RESULT (fndecl);
6342 if (aggregate_value_p (result, fndecl))
6344 #ifdef PCC_STATIC_STRUCT_RETURN
6345 current_function_returns_pcc_struct = 1;
6347 current_function_returns_struct = 1;
6350 current_function_returns_pointer = POINTER_TYPE_P (TREE_TYPE (result));
6352 current_function_needs_context
6353 = (decl_function_context (current_function_decl) != 0
6354 && ! DECL_NO_STATIC_CHAIN (current_function_decl));
6357 /* Reset cfun, and other non-struct-function variables to defaults as
6358 appropriate for emitting rtl at the start of a function. */
6361 prepare_function_start (tree fndecl)
6363 if (fndecl && DECL_SAVED_INSNS (fndecl))
6364 cfun = DECL_SAVED_INSNS (fndecl);
6366 allocate_struct_function (fndecl);
6368 cse_not_expected = ! optimize;
6370 /* Caller save not needed yet. */
6371 caller_save_needed = 0;
6373 /* We haven't done register allocation yet. */
6376 /* Indicate that we need to distinguish between the return value of the
6377 present function and the return value of a function being called. */
6378 rtx_equal_function_value_matters = 1;
6380 /* Indicate that we have not instantiated virtual registers yet. */
6381 virtuals_instantiated = 0;
6383 /* Indicate that we want CONCATs now. */
6384 generating_concat_p = 1;
6386 /* Indicate we have no need of a frame pointer yet. */
6387 frame_pointer_needed = 0;
6390 /* Initialize the rtl expansion mechanism so that we can do simple things
6391 like generate sequences. This is used to provide a context during global
6392 initialization of some passes. */
6394 init_dummy_function_start (void)
6396 prepare_function_start (NULL);
6399 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
6400 and initialize static variables for generating RTL for the statements
6404 init_function_start (tree subr)
6406 prepare_function_start (subr);
6408 /* Within function body, compute a type's size as soon it is laid out. */
6409 immediate_size_expand++;
6411 /* Prevent ever trying to delete the first instruction of a
6412 function. Also tell final how to output a linenum before the
6413 function prologue. Note linenums could be missing, e.g. when
6414 compiling a Java .class file. */
6415 if (DECL_SOURCE_LINE (subr))
6416 emit_line_note (DECL_SOURCE_LOCATION (subr));
6418 /* Make sure first insn is a note even if we don't want linenums.
6419 This makes sure the first insn will never be deleted.
6420 Also, final expects a note to appear there. */
6421 emit_note (NOTE_INSN_DELETED);
6423 /* Warn if this value is an aggregate type,
6424 regardless of which calling convention we are using for it. */
6425 if (warn_aggregate_return
6426 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
6427 warning ("function returns an aggregate");
6430 /* Make sure all values used by the optimization passes have sane
6433 init_function_for_compilation (void)
6437 /* No prologue/epilogue insns yet. */
6438 VARRAY_GROW (prologue, 0);
6439 VARRAY_GROW (epilogue, 0);
6440 VARRAY_GROW (sibcall_epilogue, 0);
6443 /* Expand a call to __main at the beginning of a possible main function. */
6445 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
6446 #undef HAS_INIT_SECTION
6447 #define HAS_INIT_SECTION
6451 expand_main_function (void)
6453 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
6454 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
6456 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
6460 /* Forcibly align the stack. */
6461 #ifdef STACK_GROWS_DOWNWARD
6462 tmp = expand_simple_binop (Pmode, AND, stack_pointer_rtx, GEN_INT(-align),
6463 stack_pointer_rtx, 1, OPTAB_WIDEN);
6465 tmp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
6466 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
6467 tmp = expand_simple_binop (Pmode, AND, tmp, GEN_INT (-align),
6468 stack_pointer_rtx, 1, OPTAB_WIDEN);
6470 if (tmp != stack_pointer_rtx)
6471 emit_move_insn (stack_pointer_rtx, tmp);
6473 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
6474 tmp = force_reg (Pmode, const0_rtx);
6475 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
6479 for (tmp = get_last_insn (); tmp; tmp = PREV_INSN (tmp))
6480 if (NOTE_P (tmp) && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_FUNCTION_BEG)
6483 emit_insn_before (seq, tmp);
6489 #ifndef HAS_INIT_SECTION
6490 emit_library_call (init_one_libfunc (NAME__MAIN), LCT_NORMAL, VOIDmode, 0);
6494 /* The PENDING_SIZES represent the sizes of variable-sized types.
6495 Create RTL for the various sizes now (using temporary variables),
6496 so that we can refer to the sizes from the RTL we are generating
6497 for the current function. The PENDING_SIZES are a TREE_LIST. The
6498 TREE_VALUE of each node is a SAVE_EXPR. */
6501 expand_pending_sizes (tree pending_sizes)
6505 /* Evaluate now the sizes of any types declared among the arguments. */
6506 for (tem = pending_sizes; tem; tem = TREE_CHAIN (tem))
6508 expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode, 0);
6509 /* Flush the queue in case this parameter declaration has
6515 /* Start the RTL for a new function, and set variables used for
6517 SUBR is the FUNCTION_DECL node.
6518 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
6519 the function's parameters, which must be run at any return statement. */
6522 expand_function_start (tree subr, int parms_have_cleanups)
6525 rtx last_ptr = NULL_RTX;
6527 /* Make sure volatile mem refs aren't considered
6528 valid operands of arithmetic insns. */
6529 init_recog_no_volatile ();
6531 current_function_instrument_entry_exit
6532 = (flag_instrument_function_entry_exit
6533 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
6535 current_function_profile
6537 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
6539 current_function_limit_stack
6540 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
6542 /* If function gets a static chain arg, store it in the stack frame.
6543 Do this first, so it gets the first stack slot offset. */
6544 if (current_function_needs_context)
6546 last_ptr = assign_stack_local (Pmode, GET_MODE_SIZE (Pmode), 0);
6548 /* Delay copying static chain if it is not a register to avoid
6549 conflicts with regs used for parameters. */
6550 if (! SMALL_REGISTER_CLASSES
6551 || GET_CODE (static_chain_incoming_rtx) == REG)
6552 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6555 /* If the parameters of this function need cleaning up, get a label
6556 for the beginning of the code which executes those cleanups. This must
6557 be done before doing anything with return_label. */
6558 if (parms_have_cleanups)
6559 cleanup_label = gen_label_rtx ();
6563 /* Make the label for return statements to jump to. Do not special
6564 case machines with special return instructions -- they will be
6565 handled later during jump, ifcvt, or epilogue creation. */
6566 return_label = gen_label_rtx ();
6568 /* Initialize rtx used to return the value. */
6569 /* Do this before assign_parms so that we copy the struct value address
6570 before any library calls that assign parms might generate. */
6572 /* Decide whether to return the value in memory or in a register. */
6573 if (aggregate_value_p (DECL_RESULT (subr), subr))
6575 /* Returning something that won't go in a register. */
6576 rtx value_address = 0;
6578 #ifdef PCC_STATIC_STRUCT_RETURN
6579 if (current_function_returns_pcc_struct)
6581 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
6582 value_address = assemble_static_space (size);
6587 rtx sv = targetm.calls.struct_value_rtx (TREE_TYPE (subr), 1);
6588 /* Expect to be passed the address of a place to store the value.
6589 If it is passed as an argument, assign_parms will take care of
6593 value_address = gen_reg_rtx (Pmode);
6594 emit_move_insn (value_address, sv);
6599 rtx x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), value_address);
6600 set_mem_attributes (x, DECL_RESULT (subr), 1);
6601 SET_DECL_RTL (DECL_RESULT (subr), x);
6604 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
6605 /* If return mode is void, this decl rtl should not be used. */
6606 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
6609 /* Compute the return values into a pseudo reg, which we will copy
6610 into the true return register after the cleanups are done. */
6612 /* In order to figure out what mode to use for the pseudo, we
6613 figure out what the mode of the eventual return register will
6614 actually be, and use that. */
6616 = hard_function_value (TREE_TYPE (DECL_RESULT (subr)),
6619 /* Structures that are returned in registers are not aggregate_value_p,
6620 so we may see a PARALLEL or a REG. */
6621 if (REG_P (hard_reg))
6622 SET_DECL_RTL (DECL_RESULT (subr), gen_reg_rtx (GET_MODE (hard_reg)));
6623 else if (GET_CODE (hard_reg) == PARALLEL)
6624 SET_DECL_RTL (DECL_RESULT (subr), gen_group_rtx (hard_reg));
6628 /* Set DECL_REGISTER flag so that expand_function_end will copy the
6629 result to the real return register(s). */
6630 DECL_REGISTER (DECL_RESULT (subr)) = 1;
6633 /* Initialize rtx for parameters and local variables.
6634 In some cases this requires emitting insns. */
6636 assign_parms (subr);
6638 /* Copy the static chain now if it wasn't a register. The delay is to
6639 avoid conflicts with the parameter passing registers. */
6641 if (SMALL_REGISTER_CLASSES && current_function_needs_context)
6642 if (GET_CODE (static_chain_incoming_rtx) != REG)
6643 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6645 /* The following was moved from init_function_start.
6646 The move is supposed to make sdb output more accurate. */
6647 /* Indicate the beginning of the function body,
6648 as opposed to parm setup. */
6649 emit_note (NOTE_INSN_FUNCTION_BEG);
6651 if (GET_CODE (get_last_insn ()) != NOTE)
6652 emit_note (NOTE_INSN_DELETED);
6653 parm_birth_insn = get_last_insn ();
6655 context_display = 0;
6656 if (current_function_needs_context)
6658 /* Fetch static chain values for containing functions. */
6659 tem = decl_function_context (current_function_decl);
6660 /* Copy the static chain pointer into a pseudo. If we have
6661 small register classes, copy the value from memory if
6662 static_chain_incoming_rtx is a REG. */
6665 /* If the static chain originally came in a register, put it back
6666 there, then move it out in the next insn. The reason for
6667 this peculiar code is to satisfy function integration. */
6668 if (SMALL_REGISTER_CLASSES
6669 && GET_CODE (static_chain_incoming_rtx) == REG)
6670 emit_move_insn (static_chain_incoming_rtx, last_ptr);
6671 last_ptr = copy_to_reg (static_chain_incoming_rtx);
6676 tree rtlexp = make_node (RTL_EXPR);
6678 RTL_EXPR_RTL (rtlexp) = last_ptr;
6679 context_display = tree_cons (tem, rtlexp, context_display);
6680 tem = decl_function_context (tem);
6683 /* Chain thru stack frames, assuming pointer to next lexical frame
6684 is found at the place we always store it. */
6685 #ifdef FRAME_GROWS_DOWNWARD
6686 last_ptr = plus_constant (last_ptr,
6687 -(HOST_WIDE_INT) GET_MODE_SIZE (Pmode));
6689 last_ptr = gen_rtx_MEM (Pmode, memory_address (Pmode, last_ptr));
6690 set_mem_alias_set (last_ptr, get_frame_alias_set ());
6691 last_ptr = copy_to_reg (last_ptr);
6693 /* If we are not optimizing, ensure that we know that this
6694 piece of context is live over the entire function. */
6696 save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, last_ptr,
6701 if (current_function_instrument_entry_exit)
6703 rtx fun = DECL_RTL (current_function_decl);
6704 if (GET_CODE (fun) == MEM)
6705 fun = XEXP (fun, 0);
6708 emit_library_call (profile_function_entry_libfunc, LCT_NORMAL, VOIDmode,
6710 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
6712 hard_frame_pointer_rtx),
6716 if (current_function_profile)
6719 PROFILE_HOOK (current_function_funcdef_no);
6723 /* After the display initializations is where the tail-recursion label
6724 should go, if we end up needing one. Ensure we have a NOTE here
6725 since some things (like trampolines) get placed before this. */
6726 tail_recursion_reentry = emit_note (NOTE_INSN_DELETED);
6728 /* Evaluate now the sizes of any types declared among the arguments. */
6729 expand_pending_sizes (nreverse (get_pending_sizes ()));
6731 /* Make sure there is a line number after the function entry setup code. */
6732 force_next_line_note ();
6735 /* Undo the effects of init_dummy_function_start. */
6737 expand_dummy_function_end (void)
6739 /* End any sequences that failed to be closed due to syntax errors. */
6740 while (in_sequence_p ())
6743 /* Outside function body, can't compute type's actual size
6744 until next function's body starts. */
6746 free_after_parsing (cfun);
6747 free_after_compilation (cfun);
6751 /* Call DOIT for each hard register used as a return value from
6752 the current function. */
6755 diddle_return_value (void (*doit) (rtx, void *), void *arg)
6757 rtx outgoing = current_function_return_rtx;
6762 if (GET_CODE (outgoing) == REG)
6763 (*doit) (outgoing, arg);
6764 else if (GET_CODE (outgoing) == PARALLEL)
6768 for (i = 0; i < XVECLEN (outgoing, 0); i++)
6770 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
6772 if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
6779 do_clobber_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
6781 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
6785 clobber_return_register (void)
6787 diddle_return_value (do_clobber_return_reg, NULL);
6789 /* In case we do use pseudo to return value, clobber it too. */
6790 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6792 tree decl_result = DECL_RESULT (current_function_decl);
6793 rtx decl_rtl = DECL_RTL (decl_result);
6794 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
6796 do_clobber_return_reg (decl_rtl, NULL);
6802 do_use_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
6804 emit_insn (gen_rtx_USE (VOIDmode, reg));
6808 use_return_register (void)
6810 diddle_return_value (do_use_return_reg, NULL);
6813 static GTY(()) rtx initial_trampoline;
6815 /* Generate RTL for the end of the current function. */
6818 expand_function_end (void)
6823 finish_expr_for_function ();
6825 /* If arg_pointer_save_area was referenced only from a nested
6826 function, we will not have initialized it yet. Do that now. */
6827 if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
6828 get_arg_pointer_save_area (cfun);
6830 #ifdef NON_SAVING_SETJMP
6831 /* Don't put any variables in registers if we call setjmp
6832 on a machine that fails to restore the registers. */
6833 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
6835 if (DECL_INITIAL (current_function_decl) != error_mark_node)
6836 setjmp_protect (DECL_INITIAL (current_function_decl));
6838 setjmp_protect_args ();
6842 /* Initialize any trampolines required by this function. */
6843 for (link = trampoline_list; link; link = TREE_CHAIN (link))
6845 tree function = TREE_PURPOSE (link);
6846 rtx context ATTRIBUTE_UNUSED = lookup_static_chain (function);
6847 rtx tramp = RTL_EXPR_RTL (TREE_VALUE (link));
6848 #ifdef TRAMPOLINE_TEMPLATE
6853 #ifdef TRAMPOLINE_TEMPLATE
6854 /* First make sure this compilation has a template for
6855 initializing trampolines. */
6856 if (initial_trampoline == 0)
6859 = gen_rtx_MEM (BLKmode, assemble_trampoline_template ());
6860 set_mem_align (initial_trampoline, TRAMPOLINE_ALIGNMENT);
6864 /* Generate insns to initialize the trampoline. */
6866 tramp = round_trampoline_addr (XEXP (tramp, 0));
6867 #ifdef TRAMPOLINE_TEMPLATE
6868 blktramp = replace_equiv_address (initial_trampoline, tramp);
6869 emit_block_move (blktramp, initial_trampoline,
6870 GEN_INT (TRAMPOLINE_SIZE), BLOCK_OP_NORMAL);
6872 trampolines_created = 1;
6873 INITIALIZE_TRAMPOLINE (tramp, XEXP (DECL_RTL (function), 0), context);
6877 /* Put those insns at entry to the containing function (this one). */
6878 emit_insn_before (seq, tail_recursion_reentry);
6881 /* If we are doing stack checking and this function makes calls,
6882 do a stack probe at the start of the function to ensure we have enough
6883 space for another stack frame. */
6884 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
6888 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
6889 if (GET_CODE (insn) == CALL_INSN)
6892 probe_stack_range (STACK_CHECK_PROTECT,
6893 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
6896 emit_insn_before (seq, tail_recursion_reentry);
6901 /* Possibly warn about unused parameters. */
6902 if (warn_unused_parameter)
6906 for (decl = DECL_ARGUMENTS (current_function_decl);
6907 decl; decl = TREE_CHAIN (decl))
6908 if (! TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
6909 && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl))
6910 warning ("%Junused parameter '%D'", decl, decl);
6913 /* Delete handlers for nonlocal gotos if nothing uses them. */
6914 if (nonlocal_goto_handler_slots != 0
6915 && ! current_function_has_nonlocal_label)
6918 /* End any sequences that failed to be closed due to syntax errors. */
6919 while (in_sequence_p ())
6922 /* Outside function body, can't compute type's actual size
6923 until next function's body starts. */
6924 immediate_size_expand--;
6926 clear_pending_stack_adjust ();
6927 do_pending_stack_adjust ();
6929 /* Mark the end of the function body.
6930 If control reaches this insn, the function can drop through
6931 without returning a value. */
6932 emit_note (NOTE_INSN_FUNCTION_END);
6934 /* Must mark the last line number note in the function, so that the test
6935 coverage code can avoid counting the last line twice. This just tells
6936 the code to ignore the immediately following line note, since there
6937 already exists a copy of this note somewhere above. This line number
6938 note is still needed for debugging though, so we can't delete it. */
6939 if (flag_test_coverage)
6940 emit_note (NOTE_INSN_REPEATED_LINE_NUMBER);
6942 /* Output a linenumber for the end of the function.
6943 SDB depends on this. */
6944 force_next_line_note ();
6945 emit_line_note (input_location);
6947 /* Before the return label (if any), clobber the return
6948 registers so that they are not propagated live to the rest of
6949 the function. This can only happen with functions that drop
6950 through; if there had been a return statement, there would
6951 have either been a return rtx, or a jump to the return label.
6953 We delay actual code generation after the current_function_value_rtx
6955 clobber_after = get_last_insn ();
6957 /* Output the label for the actual return from the function,
6958 if one is expected. This happens either because a function epilogue
6959 is used instead of a return instruction, or because a return was done
6960 with a goto in order to run local cleanups, or because of pcc-style
6961 structure returning. */
6963 emit_label (return_label);
6965 if (current_function_instrument_entry_exit)
6967 rtx fun = DECL_RTL (current_function_decl);
6968 if (GET_CODE (fun) == MEM)
6969 fun = XEXP (fun, 0);
6972 emit_library_call (profile_function_exit_libfunc, LCT_NORMAL, VOIDmode,
6974 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
6976 hard_frame_pointer_rtx),
6980 /* Let except.c know where it should emit the call to unregister
6981 the function context for sjlj exceptions. */
6982 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
6983 sjlj_emit_function_exit_after (get_last_insn ());
6985 /* If we had calls to alloca, and this machine needs
6986 an accurate stack pointer to exit the function,
6987 insert some code to save and restore the stack pointer. */
6988 #ifdef EXIT_IGNORE_STACK
6989 if (! EXIT_IGNORE_STACK)
6991 if (current_function_calls_alloca)
6995 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
6996 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
6999 /* If scalar return value was computed in a pseudo-reg, or was a named
7000 return value that got dumped to the stack, copy that to the hard
7002 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
7004 tree decl_result = DECL_RESULT (current_function_decl);
7005 rtx decl_rtl = DECL_RTL (decl_result);
7007 if (REG_P (decl_rtl)
7008 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
7009 : DECL_REGISTER (decl_result))
7011 rtx real_decl_rtl = current_function_return_rtx;
7013 /* This should be set in assign_parms. */
7014 if (! REG_FUNCTION_VALUE_P (real_decl_rtl))
7017 /* If this is a BLKmode structure being returned in registers,
7018 then use the mode computed in expand_return. Note that if
7019 decl_rtl is memory, then its mode may have been changed,
7020 but that current_function_return_rtx has not. */
7021 if (GET_MODE (real_decl_rtl) == BLKmode)
7022 PUT_MODE (real_decl_rtl, GET_MODE (decl_rtl));
7024 /* If a named return value dumped decl_return to memory, then
7025 we may need to re-do the PROMOTE_MODE signed/unsigned
7027 if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
7029 int unsignedp = TREE_UNSIGNED (TREE_TYPE (decl_result));
7031 if (targetm.calls.promote_function_return (TREE_TYPE (current_function_decl)))
7032 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
7035 convert_move (real_decl_rtl, decl_rtl, unsignedp);
7037 else if (GET_CODE (real_decl_rtl) == PARALLEL)
7039 /* If expand_function_start has created a PARALLEL for decl_rtl,
7040 move the result to the real return registers. Otherwise, do
7041 a group load from decl_rtl for a named return. */
7042 if (GET_CODE (decl_rtl) == PARALLEL)
7043 emit_group_move (real_decl_rtl, decl_rtl);
7045 emit_group_load (real_decl_rtl, decl_rtl,
7046 TREE_TYPE (decl_result),
7047 int_size_in_bytes (TREE_TYPE (decl_result)));
7050 emit_move_insn (real_decl_rtl, decl_rtl);
7054 /* If returning a structure, arrange to return the address of the value
7055 in a place where debuggers expect to find it.
7057 If returning a structure PCC style,
7058 the caller also depends on this value.
7059 And current_function_returns_pcc_struct is not necessarily set. */
7060 if (current_function_returns_struct
7061 || current_function_returns_pcc_struct)
7064 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
7065 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
7066 #ifdef FUNCTION_OUTGOING_VALUE
7068 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
7069 current_function_decl);
7072 = FUNCTION_VALUE (build_pointer_type (type), current_function_decl);
7075 /* Mark this as a function return value so integrate will delete the
7076 assignment and USE below when inlining this function. */
7077 REG_FUNCTION_VALUE_P (outgoing) = 1;
7079 /* The address may be ptr_mode and OUTGOING may be Pmode. */
7080 value_address = convert_memory_address (GET_MODE (outgoing),
7083 emit_move_insn (outgoing, value_address);
7085 /* Show return register used to hold result (in this case the address
7087 current_function_return_rtx = outgoing;
7090 /* If this is an implementation of throw, do what's necessary to
7091 communicate between __builtin_eh_return and the epilogue. */
7092 expand_eh_return ();
7094 /* Emit the actual code to clobber return register. */
7099 clobber_return_register ();
7103 after = emit_insn_after (seq, clobber_after);
7105 if (clobber_after != after)
7106 cfun->x_clobber_return_insn = after;
7109 /* ??? This should no longer be necessary since stupid is no longer with
7110 us, but there are some parts of the compiler (eg reload_combine, and
7111 sh mach_dep_reorg) that still try and compute their own lifetime info
7112 instead of using the general framework. */
7113 use_return_register ();
7115 /* Fix up any gotos that jumped out to the outermost
7116 binding level of the function.
7117 Must follow emitting RETURN_LABEL. */
7119 /* If you have any cleanups to do at this point,
7120 and they need to create temporary variables,
7121 then you will lose. */
7122 expand_fixups (get_insns ());
7126 get_arg_pointer_save_area (struct function *f)
7128 rtx ret = f->x_arg_pointer_save_area;
7132 ret = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, f);
7133 f->x_arg_pointer_save_area = ret;
7136 if (f == cfun && ! f->arg_pointer_save_area_init)
7140 /* Save the arg pointer at the beginning of the function. The
7141 generated stack slot may not be a valid memory address, so we
7142 have to check it and fix it if necessary. */
7144 emit_move_insn (validize_mem (ret), virtual_incoming_args_rtx);
7148 push_topmost_sequence ();
7149 emit_insn_after (seq, get_insns ());
7150 pop_topmost_sequence ();
7156 /* Extend a vector that records the INSN_UIDs of INSNS
7157 (a list of one or more insns). */
7160 record_insns (rtx insns, varray_type *vecp)
7167 while (tmp != NULL_RTX)
7170 tmp = NEXT_INSN (tmp);
7173 i = VARRAY_SIZE (*vecp);
7174 VARRAY_GROW (*vecp, i + len);
7176 while (tmp != NULL_RTX)
7178 VARRAY_INT (*vecp, i) = INSN_UID (tmp);
7180 tmp = NEXT_INSN (tmp);
7184 /* Set the specified locator to the insn chain. */
7186 set_insn_locators (rtx insn, int loc)
7188 while (insn != NULL_RTX)
7191 INSN_LOCATOR (insn) = loc;
7192 insn = NEXT_INSN (insn);
7196 /* Determine how many INSN_UIDs in VEC are part of INSN. Because we can
7197 be running after reorg, SEQUENCE rtl is possible. */
7200 contains (rtx insn, varray_type vec)
7204 if (GET_CODE (insn) == INSN
7205 && GET_CODE (PATTERN (insn)) == SEQUENCE)
7208 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
7209 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7210 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j))
7216 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7217 if (INSN_UID (insn) == VARRAY_INT (vec, j))
7224 prologue_epilogue_contains (rtx insn)
7226 if (contains (insn, prologue))
7228 if (contains (insn, epilogue))
7234 sibcall_epilogue_contains (rtx insn)
7236 if (sibcall_epilogue)
7237 return contains (insn, sibcall_epilogue);
7242 /* Insert gen_return at the end of block BB. This also means updating
7243 block_for_insn appropriately. */
7246 emit_return_into_block (basic_block bb, rtx line_note)
7248 emit_jump_insn_after (gen_return (), bb->end);
7250 emit_note_copy_after (line_note, PREV_INSN (bb->end));
7252 #endif /* HAVE_return */
7254 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
7256 /* These functions convert the epilogue into a variant that does not modify the
7257 stack pointer. This is used in cases where a function returns an object
7258 whose size is not known until it is computed. The called function leaves the
7259 object on the stack, leaves the stack depressed, and returns a pointer to
7262 What we need to do is track all modifications and references to the stack
7263 pointer, deleting the modifications and changing the references to point to
7264 the location the stack pointer would have pointed to had the modifications
7267 These functions need to be portable so we need to make as few assumptions
7268 about the epilogue as we can. However, the epilogue basically contains
7269 three things: instructions to reset the stack pointer, instructions to
7270 reload registers, possibly including the frame pointer, and an
7271 instruction to return to the caller.
7273 If we can't be sure of what a relevant epilogue insn is doing, we abort.
7274 We also make no attempt to validate the insns we make since if they are
7275 invalid, we probably can't do anything valid. The intent is that these
7276 routines get "smarter" as more and more machines start to use them and
7277 they try operating on different epilogues.
7279 We use the following structure to track what the part of the epilogue that
7280 we've already processed has done. We keep two copies of the SP equivalence,
7281 one for use during the insn we are processing and one for use in the next
7282 insn. The difference is because one part of a PARALLEL may adjust SP
7283 and the other may use it. */
7287 rtx sp_equiv_reg; /* REG that SP is set from, perhaps SP. */
7288 HOST_WIDE_INT sp_offset; /* Offset from SP_EQUIV_REG of present SP. */
7289 rtx new_sp_equiv_reg; /* REG to be used at end of insn. */
7290 HOST_WIDE_INT new_sp_offset; /* Offset to be used at end of insn. */
7291 rtx equiv_reg_src; /* If nonzero, the value that SP_EQUIV_REG
7292 should be set to once we no longer need
7296 static void handle_epilogue_set (rtx, struct epi_info *);
7297 static void emit_equiv_load (struct epi_info *);
7299 /* Modify INSN, a list of one or more insns that is part of the epilogue, to
7300 no modifications to the stack pointer. Return the new list of insns. */
7303 keep_stack_depressed (rtx insns)
7306 struct epi_info info;
7309 /* If the epilogue is just a single instruction, it ust be OK as is. */
7311 if (NEXT_INSN (insns) == NULL_RTX)
7314 /* Otherwise, start a sequence, initialize the information we have, and
7315 process all the insns we were given. */
7318 info.sp_equiv_reg = stack_pointer_rtx;
7320 info.equiv_reg_src = 0;
7324 while (insn != NULL_RTX)
7326 next = NEXT_INSN (insn);
7335 /* If this insn references the register that SP is equivalent to and
7336 we have a pending load to that register, we must force out the load
7337 first and then indicate we no longer know what SP's equivalent is. */
7338 if (info.equiv_reg_src != 0
7339 && reg_referenced_p (info.sp_equiv_reg, PATTERN (insn)))
7341 emit_equiv_load (&info);
7342 info.sp_equiv_reg = 0;
7345 info.new_sp_equiv_reg = info.sp_equiv_reg;
7346 info.new_sp_offset = info.sp_offset;
7348 /* If this is a (RETURN) and the return address is on the stack,
7349 update the address and change to an indirect jump. */
7350 if (GET_CODE (PATTERN (insn)) == RETURN
7351 || (GET_CODE (PATTERN (insn)) == PARALLEL
7352 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
7354 rtx retaddr = INCOMING_RETURN_ADDR_RTX;
7356 HOST_WIDE_INT offset = 0;
7357 rtx jump_insn, jump_set;
7359 /* If the return address is in a register, we can emit the insn
7360 unchanged. Otherwise, it must be a MEM and we see what the
7361 base register and offset are. In any case, we have to emit any
7362 pending load to the equivalent reg of SP, if any. */
7363 if (GET_CODE (retaddr) == REG)
7365 emit_equiv_load (&info);
7370 else if (GET_CODE (retaddr) == MEM
7371 && GET_CODE (XEXP (retaddr, 0)) == REG)
7372 base = gen_rtx_REG (Pmode, REGNO (XEXP (retaddr, 0))), offset = 0;
7373 else if (GET_CODE (retaddr) == MEM
7374 && GET_CODE (XEXP (retaddr, 0)) == PLUS
7375 && GET_CODE (XEXP (XEXP (retaddr, 0), 0)) == REG
7376 && GET_CODE (XEXP (XEXP (retaddr, 0), 1)) == CONST_INT)
7378 base = gen_rtx_REG (Pmode, REGNO (XEXP (XEXP (retaddr, 0), 0)));
7379 offset = INTVAL (XEXP (XEXP (retaddr, 0), 1));
7384 /* If the base of the location containing the return pointer
7385 is SP, we must update it with the replacement address. Otherwise,
7386 just build the necessary MEM. */
7387 retaddr = plus_constant (base, offset);
7388 if (base == stack_pointer_rtx)
7389 retaddr = simplify_replace_rtx (retaddr, stack_pointer_rtx,
7390 plus_constant (info.sp_equiv_reg,
7393 retaddr = gen_rtx_MEM (Pmode, retaddr);
7395 /* If there is a pending load to the equivalent register for SP
7396 and we reference that register, we must load our address into
7397 a scratch register and then do that load. */
7398 if (info.equiv_reg_src
7399 && reg_overlap_mentioned_p (info.equiv_reg_src, retaddr))
7404 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
7405 if (HARD_REGNO_MODE_OK (regno, Pmode)
7406 && !fixed_regs[regno]
7407 && TEST_HARD_REG_BIT (regs_invalidated_by_call, regno)
7408 && !REGNO_REG_SET_P (EXIT_BLOCK_PTR->global_live_at_start,
7410 && !refers_to_regno_p (regno,
7411 regno + HARD_REGNO_NREGS (regno,
7413 info.equiv_reg_src, NULL))
7416 if (regno == FIRST_PSEUDO_REGISTER)
7419 reg = gen_rtx_REG (Pmode, regno);
7420 emit_move_insn (reg, retaddr);
7424 emit_equiv_load (&info);
7425 jump_insn = emit_jump_insn (gen_indirect_jump (retaddr));
7427 /* Show the SET in the above insn is a RETURN. */
7428 jump_set = single_set (jump_insn);
7432 SET_IS_RETURN_P (jump_set) = 1;
7435 /* If SP is not mentioned in the pattern and its equivalent register, if
7436 any, is not modified, just emit it. Otherwise, if neither is set,
7437 replace the reference to SP and emit the insn. If none of those are
7438 true, handle each SET individually. */
7439 else if (!reg_mentioned_p (stack_pointer_rtx, PATTERN (insn))
7440 && (info.sp_equiv_reg == stack_pointer_rtx
7441 || !reg_set_p (info.sp_equiv_reg, insn)))
7443 else if (! reg_set_p (stack_pointer_rtx, insn)
7444 && (info.sp_equiv_reg == stack_pointer_rtx
7445 || !reg_set_p (info.sp_equiv_reg, insn)))
7447 if (! validate_replace_rtx (stack_pointer_rtx,
7448 plus_constant (info.sp_equiv_reg,
7455 else if (GET_CODE (PATTERN (insn)) == SET)
7456 handle_epilogue_set (PATTERN (insn), &info);
7457 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
7459 for (j = 0; j < XVECLEN (PATTERN (insn), 0); j++)
7460 if (GET_CODE (XVECEXP (PATTERN (insn), 0, j)) == SET)
7461 handle_epilogue_set (XVECEXP (PATTERN (insn), 0, j), &info);
7466 info.sp_equiv_reg = info.new_sp_equiv_reg;
7467 info.sp_offset = info.new_sp_offset;
7472 insns = get_insns ();
7477 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
7478 structure that contains information about what we've seen so far. We
7479 process this SET by either updating that data or by emitting one or
7483 handle_epilogue_set (rtx set, struct epi_info *p)
7485 /* First handle the case where we are setting SP. Record what it is being
7486 set from. If unknown, abort. */
7487 if (reg_set_p (stack_pointer_rtx, set))
7489 if (SET_DEST (set) != stack_pointer_rtx)
7492 if (GET_CODE (SET_SRC (set)) == PLUS
7493 && GET_CODE (XEXP (SET_SRC (set), 1)) == CONST_INT)
7495 p->new_sp_equiv_reg = XEXP (SET_SRC (set), 0);
7496 p->new_sp_offset = INTVAL (XEXP (SET_SRC (set), 1));
7499 p->new_sp_equiv_reg = SET_SRC (set), p->new_sp_offset = 0;
7501 /* If we are adjusting SP, we adjust from the old data. */
7502 if (p->new_sp_equiv_reg == stack_pointer_rtx)
7504 p->new_sp_equiv_reg = p->sp_equiv_reg;
7505 p->new_sp_offset += p->sp_offset;
7508 if (p->new_sp_equiv_reg == 0 || GET_CODE (p->new_sp_equiv_reg) != REG)
7514 /* Next handle the case where we are setting SP's equivalent register.
7515 If we already have a value to set it to, abort. We could update, but
7516 there seems little point in handling that case. Note that we have
7517 to allow for the case where we are setting the register set in
7518 the previous part of a PARALLEL inside a single insn. But use the
7519 old offset for any updates within this insn. */
7520 else if (p->new_sp_equiv_reg != 0 && reg_set_p (p->new_sp_equiv_reg, set))
7522 if (!rtx_equal_p (p->new_sp_equiv_reg, SET_DEST (set))
7523 || p->equiv_reg_src != 0)
7527 = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
7528 plus_constant (p->sp_equiv_reg,
7532 /* Otherwise, replace any references to SP in the insn to its new value
7533 and emit the insn. */
7536 SET_SRC (set) = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
7537 plus_constant (p->sp_equiv_reg,
7539 SET_DEST (set) = simplify_replace_rtx (SET_DEST (set), stack_pointer_rtx,
7540 plus_constant (p->sp_equiv_reg,
7546 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
7549 emit_equiv_load (struct epi_info *p)
7551 if (p->equiv_reg_src != 0)
7552 emit_move_insn (p->sp_equiv_reg, p->equiv_reg_src);
7554 p->equiv_reg_src = 0;
7558 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
7559 this into place with notes indicating where the prologue ends and where
7560 the epilogue begins. Update the basic block information when possible. */
7563 thread_prologue_and_epilogue_insns (rtx f ATTRIBUTE_UNUSED)
7567 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
7570 #ifdef HAVE_prologue
7571 rtx prologue_end = NULL_RTX;
7573 #if defined (HAVE_epilogue) || defined(HAVE_return)
7574 rtx epilogue_end = NULL_RTX;
7577 #ifdef HAVE_prologue
7581 seq = gen_prologue ();
7584 /* Retain a map of the prologue insns. */
7585 record_insns (seq, &prologue);
7586 prologue_end = emit_note (NOTE_INSN_PROLOGUE_END);
7590 set_insn_locators (seq, prologue_locator);
7592 /* Can't deal with multiple successors of the entry block
7593 at the moment. Function should always have at least one
7595 if (!ENTRY_BLOCK_PTR->succ || ENTRY_BLOCK_PTR->succ->succ_next)
7598 insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ);
7603 /* If the exit block has no non-fake predecessors, we don't need
7605 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7606 if ((e->flags & EDGE_FAKE) == 0)
7612 if (optimize && HAVE_return)
7614 /* If we're allowed to generate a simple return instruction,
7615 then by definition we don't need a full epilogue. Examine
7616 the block that falls through to EXIT. If it does not
7617 contain any code, examine its predecessors and try to
7618 emit (conditional) return instructions. */
7624 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7625 if (e->flags & EDGE_FALLTHRU)
7631 /* Verify that there are no active instructions in the last block. */
7633 while (label && GET_CODE (label) != CODE_LABEL)
7635 if (active_insn_p (label))
7637 label = PREV_INSN (label);
7640 if (last->head == label && GET_CODE (label) == CODE_LABEL)
7642 rtx epilogue_line_note = NULL_RTX;
7644 /* Locate the line number associated with the closing brace,
7645 if we can find one. */
7646 for (seq = get_last_insn ();
7647 seq && ! active_insn_p (seq);
7648 seq = PREV_INSN (seq))
7649 if (GET_CODE (seq) == NOTE && NOTE_LINE_NUMBER (seq) > 0)
7651 epilogue_line_note = seq;
7655 for (e = last->pred; e; e = e_next)
7657 basic_block bb = e->src;
7660 e_next = e->pred_next;
7661 if (bb == ENTRY_BLOCK_PTR)
7665 if ((GET_CODE (jump) != JUMP_INSN) || JUMP_LABEL (jump) != label)
7668 /* If we have an unconditional jump, we can replace that
7669 with a simple return instruction. */
7670 if (simplejump_p (jump))
7672 emit_return_into_block (bb, epilogue_line_note);
7676 /* If we have a conditional jump, we can try to replace
7677 that with a conditional return instruction. */
7678 else if (condjump_p (jump))
7680 if (! redirect_jump (jump, 0, 0))
7683 /* If this block has only one successor, it both jumps
7684 and falls through to the fallthru block, so we can't
7686 if (bb->succ->succ_next == NULL)
7692 /* Fix up the CFG for the successful change we just made. */
7693 redirect_edge_succ (e, EXIT_BLOCK_PTR);
7696 /* Emit a return insn for the exit fallthru block. Whether
7697 this is still reachable will be determined later. */
7699 emit_barrier_after (last->end);
7700 emit_return_into_block (last, epilogue_line_note);
7701 epilogue_end = last->end;
7702 last->succ->flags &= ~EDGE_FALLTHRU;
7707 #ifdef HAVE_epilogue
7710 /* Find the edge that falls through to EXIT. Other edges may exist
7711 due to RETURN instructions, but those don't need epilogues.
7712 There really shouldn't be a mixture -- either all should have
7713 been converted or none, however... */
7715 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7716 if (e->flags & EDGE_FALLTHRU)
7722 epilogue_end = emit_note (NOTE_INSN_EPILOGUE_BEG);
7724 seq = gen_epilogue ();
7726 #ifdef INCOMING_RETURN_ADDR_RTX
7727 /* If this function returns with the stack depressed and we can support
7728 it, massage the epilogue to actually do that. */
7729 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
7730 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
7731 seq = keep_stack_depressed (seq);
7734 emit_jump_insn (seq);
7736 /* Retain a map of the epilogue insns. */
7737 record_insns (seq, &epilogue);
7738 set_insn_locators (seq, epilogue_locator);
7743 insert_insn_on_edge (seq, e);
7750 commit_edge_insertions ();
7752 #ifdef HAVE_sibcall_epilogue
7753 /* Emit sibling epilogues before any sibling call sites. */
7754 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7756 basic_block bb = e->src;
7761 if (GET_CODE (insn) != CALL_INSN
7762 || ! SIBLING_CALL_P (insn))
7766 emit_insn (gen_sibcall_epilogue ());
7770 /* Retain a map of the epilogue insns. Used in life analysis to
7771 avoid getting rid of sibcall epilogue insns. Do this before we
7772 actually emit the sequence. */
7773 record_insns (seq, &sibcall_epilogue);
7774 set_insn_locators (seq, epilogue_locator);
7776 i = PREV_INSN (insn);
7777 newinsn = emit_insn_before (seq, insn);
7781 #ifdef HAVE_prologue
7786 /* GDB handles `break f' by setting a breakpoint on the first
7787 line note after the prologue. Which means (1) that if
7788 there are line number notes before where we inserted the
7789 prologue we should move them, and (2) we should generate a
7790 note before the end of the first basic block, if there isn't
7793 ??? This behavior is completely broken when dealing with
7794 multiple entry functions. We simply place the note always
7795 into first basic block and let alternate entry points
7799 for (insn = prologue_end; insn; insn = prev)
7801 prev = PREV_INSN (insn);
7802 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7804 /* Note that we cannot reorder the first insn in the
7805 chain, since rest_of_compilation relies on that
7806 remaining constant. */
7809 reorder_insns (insn, insn, prologue_end);
7813 /* Find the last line number note in the first block. */
7814 for (insn = ENTRY_BLOCK_PTR->next_bb->end;
7815 insn != prologue_end && insn;
7816 insn = PREV_INSN (insn))
7817 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7820 /* If we didn't find one, make a copy of the first line number
7824 for (insn = next_active_insn (prologue_end);
7826 insn = PREV_INSN (insn))
7827 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7829 emit_note_copy_after (insn, prologue_end);
7835 #ifdef HAVE_epilogue
7840 /* Similarly, move any line notes that appear after the epilogue.
7841 There is no need, however, to be quite so anal about the existence
7843 for (insn = epilogue_end; insn; insn = next)
7845 next = NEXT_INSN (insn);
7846 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7847 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
7853 /* Reposition the prologue-end and epilogue-begin notes after instruction
7854 scheduling and delayed branch scheduling. */
7857 reposition_prologue_and_epilogue_notes (rtx f ATTRIBUTE_UNUSED)
7859 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
7860 rtx insn, last, note;
7863 if ((len = VARRAY_SIZE (prologue)) > 0)
7867 /* Scan from the beginning until we reach the last prologue insn.
7868 We apparently can't depend on basic_block_{head,end} after
7870 for (insn = f; insn; insn = NEXT_INSN (insn))
7872 if (GET_CODE (insn) == NOTE)
7874 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
7877 else if (contains (insn, prologue))
7887 /* Find the prologue-end note if we haven't already, and
7888 move it to just after the last prologue insn. */
7891 for (note = last; (note = NEXT_INSN (note));)
7892 if (GET_CODE (note) == NOTE
7893 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
7897 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
7898 if (GET_CODE (last) == CODE_LABEL)
7899 last = NEXT_INSN (last);
7900 reorder_insns (note, note, last);
7904 if ((len = VARRAY_SIZE (epilogue)) > 0)
7908 /* Scan from the end until we reach the first epilogue insn.
7909 We apparently can't depend on basic_block_{head,end} after
7911 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
7913 if (GET_CODE (insn) == NOTE)
7915 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
7918 else if (contains (insn, epilogue))
7928 /* Find the epilogue-begin note if we haven't already, and
7929 move it to just before the first epilogue insn. */
7932 for (note = insn; (note = PREV_INSN (note));)
7933 if (GET_CODE (note) == NOTE
7934 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
7938 if (PREV_INSN (last) != note)
7939 reorder_insns (note, note, PREV_INSN (last));
7942 #endif /* HAVE_prologue or HAVE_epilogue */
7945 /* Called once, at initialization, to initialize function.c. */
7948 init_function_once (void)
7950 VARRAY_INT_INIT (prologue, 0, "prologue");
7951 VARRAY_INT_INIT (epilogue, 0, "epilogue");
7952 VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue");
7955 #include "gt-function.h"